Hoogle Search
Within LTS Haskell 24.37 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
hyperbole Web.Hyperbole.Data.Session No documentation available.
-
Lists whose types are indexed by their lengths. The implementation is a simple wrapper around a regular list. All functions in this module are total. The time complexity of each function is the same as that of the corresponding function on regular lists.
-
indexed-containers Data.NList A list whose length is statically known. Type parameter n, of kind Nat, is the length of the list.
toList :: forall (n :: Nat) a . NList n a -> [a]indexed-containers Data.NList Convert an NList into a regular list.
toList (mk3 'a' 'b' 'c') === "abc"
maybeToList :: Maybe a <-> [a]invertible Data.Invertible.Maybe Convert between Maybe and a (singleton) list (see maybeToList). (invert listToMaybe)
type
PointAsListFn a p = p -> [a]kdt Data.KdMap.Dynamic Converts a point of type p with axis values of type a into a list of axis values [a].
type
PointAsListFn a p = p -> [a]kdt Data.KdMap.Static Converts a point of type p with axis values of type a into a list of axis values [a].
type
PointAsListFn a p = p -> [a]kdt Data.KdTree.Dynamic Converts a point of type p with axis values of type a into a list of axis values [a].
-
kdt Data.KdTree.Dynamic Returns a list of all the points in the KdTree. Time complexity: O(n)
type
PointAsListFn a p = p -> [a]kdt Data.KdTree.Static Converts a point of type p with axis values of type a into a list of axis values [a].