Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

package tidal-core

Core pattern library for TidalCycles, a pattern language for improvised music Tidal is a domain specific language for live coding patterns. This is a pre-release ahead of version 1.10, which will become a dependency of the main tidal package, with the same version number.
package tidal-link

Ableton Link integration for Tidal Ableton Link integration for Tidal, to let Tidal sync with external clocks
package time-domain

A library for time domains and durations This library mainly provides a type class, TimeDomain, which can be used to specify times and durations. There are some instances for standard types from base and time.
package timezone-olson

A pure Haskell parser and renderer for binary Olson timezone files A parser and renderer for binary Olson timezone files whose format is specified by the tzfile(5) man page on Unix-like systems. For more information about this format, see http://www.iana.org/time-zones/repository/tz-link.html. Functions are provided for converting the parsed data into TimeZoneSeries objects from the timezone-series package. On many platforms, binary Olson timezone files suitable for use with this package are available in the directory usrshare/zoneinfo and its subdirectories on your computer. For a way to read binary Olson timezone files at compile time, see the timezone-olson-th package (http://hackage.haskell.org/package/timezone-olson-th).
package tmp-proc-redis

Launch Redis in docker using tmp-proc Demos how to use tmp-proc to run Redis in docker in a unittest.
package token-bucket

Rate limiter using lazy bucket algorithm This package provides a variant of a Token Bucket or Leaky Bucket rate-limiting algorithm optimised for low overhead. The rate-limiting variant implemented by this package is heavily inspired by the algorithm described in "Rate Limiting at Webscale: Lazy Leaky Buckets".
package toml-parser

TOML 1.1.0 parser TOML parser using generated lexers and parsers with careful attention to the TOML 1.1.0 semantics for defining tables.
package toml-reader

TOML format parser compliant with v1.0.0. TOML format parser compliant with v1.0.0. See README.md for more details.
package tree-fun

Library for functions pertaining to tree exploration and manipulation Library for functions pertaining to tree exploration and manipulation
package trivial-constraint

Constraints that any type, resp. no type fulfills Since GHC 7.4, constraints are first-class: we have the constraint kind, and thus type-classes have a kind of form k -> Constraint, or k -> l -> m -> ... -> Constraint for a multi-param type class. Such type-level functions can be used as arguments to data types, or as instances for other type classes. For any given arity, the constraint-valued functions form a semigroup with respect to “constraint intersection”, which Haskell supports with tuple syntax, e.g.
```
type NewCstrt¹ a = (Cstrt¹₀ a, Cstrt¹₁ a)
```
means that NewCstrt¹ :: * -> Constraint requires that for any given parameter both Cstrt¹₀ and Cstrt¹₁ be fulfilled. It is intuitive enough that this type-level semigroup can be extended to a monoid, but out of the box this is only possible for arity 0, i.e. for Cstrt⁰ :: Constraint
```
(Cstrt⁰, ()) ~ ((), Cstrt⁰) ~ Cstrt⁰
```
For higher arity, this would require type-level lambdas, like for Cstrt² :: * -> * -> Constraint
```
(Cstrt², \a b -> ()) ~ (\a b -> (), Cstrt²) ~ Cstrt²
```
which is not valid Haskell syntax. It is easy enough to define the lambdas in an ad-hoc manner as
```
type Unconstrained² a b = ()
```
and then
```
(Cstrt², Unconstrained²) ~ (Unconstrained², Cstrt²) ~ Cstrt²
```
This library provides those trivial constraints in a single, documented place, and it uses classes instead of type-synonyms (which would be problematic when it comes to partial application). Arities 0-9 are provided. They can be useful in any construction that is parameterised over a constrainer-class, when you do not wish to actually constrain the domain with it. The other thing this library provides are the opposite classes, i.e. \a b ... -> Impossible, constraints which can never be fulfilled. They are essentially dual to the Unconstrained ones, and can likewise be useful as parameters that should completely “disable” a conditional feature.

Page 145 of many | Previous | Next