Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
srtree Data.SRTree.Recursion No documentation available.
type
ListFnApply a = a -> Bool -> ListFnDescr a -> [Maybe a] -> Maybe [a]swish Swish.Datatype altArgs support for list functions: function applicator type
type
ListFnDescr a = (a -> a -> a, a, a -> a -> a, Int)swish Swish.Datatype altArgs support for list functions (e.g. sum over list of args), where first element of list is a fold over the rest of the list, and remaining elements of list can be calculated in terms of the result of the fold and the remaining elements List function descriptor is (a) list-fold function, f (e.g. (+) (b) list-fold identity, z (e.g. 0) (c) list-fold-function inverse, g (e.g. (-)) (d) index of element to evaluate such that:
(a `f` z) == (z `f` a) == a (a `g` c) == b <=> a == b `f` c (a `g` z) == a (a `g` a) == z
and the result of the folded function does not depend on the order that the list elements are processed. NOTE: the list of ListFnDescr values supplied to altArgs must be at least as long as the argument list. In many cases, Haskell lazy evaluation can be used to supply an arbitrarily long list. See test cases in spike-altargs.hs for an example. Function descriptor typetype
ListFnTable a = [(a -> Bool, [ListFnDescr a])]swish Swish.Datatype Function table type
-
text-ldap Text.LDAP.Data Not empty list type
-
type-level-kv-list Data.KVList ListKey is just a proxy, but needed to implement a non-orphan IsLabel instance. In most cases, you only need to create a ListKey instance with OverloadedLabels, such as `#foo`.
ListKey :: ListKey (t :: Symbol)type-level-kv-list Data.KVList No documentation available.
-
folds Data.Fold.Internal No documentation available.
-
gogol-dataflow Gogol.Dataflow Response to a request to list job messages. See: newListJobMessagesResponse smart constructor.
-
gogol-dataflow Gogol.Dataflow No documentation available.