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.
-
kdt Data.KdTree.Static Returns a list of all the points in the KdTree. Time complexity: O(n) for n data points.
updateHashList :: (a -> LH ()) -> [a] -> LH ()large-hashable Data.LargeHashable.Class No documentation available.
fromList :: forall (m :: Type -> Type) a . Monad m => [a] -> Stream m aleveldb-haskell Data.Stream.Monadic No documentation available.
toList :: (Functor m, Monad m) => Stream m a -> m [a]leveldb-haskell Data.Stream.Monadic No documentation available.
lgeneratorsList :: forall s x . LActGen x s => [x]lr-acts Data.Act.Cyclic A version of lgeneratorsList' such that the first type application is s.
>>> lgeneratorsList @(Sum Int) :: [Int] [0]
lgeneratorsList' :: LActGen x s => [x]lr-acts Data.Act.Cyclic The set of origins of the action LAct x s seen as a list. You can let this function undefined if the set of origins cannot be represented as a list.
>>> lgeneratorsList' @Int @(Sum Int) [0]
To avoid having to use the redundant first type aplication, use lgeneratorsList.rgeneratorsList :: forall s x . RActGen x s => [x]lr-acts Data.Act.Cyclic A version of rgeneratorsList' such that the first type application is s.
>>> rgeneratorsList @(Sum Int) :: [Int] [0]
rgeneratorsList' :: RActGen x s => [x]lr-acts Data.Act.Cyclic The set of origins of the action RAct x s seen as a list. You can let this function undefined if the set of origins cannot be represented as a list.
>>> rgeneratorsList' @(Sum Int) :: [Int] [0]
fromList :: (Ord k, Eq v) => v -> [(k, v)] -> MapWithDefault k vmappings Data.Mapping.MapWithDefault No documentation available.
fromListWithKey :: (Ord k, Eq v) => v -> (k -> u -> v -> v) -> [(k, u)] -> MapWithDefault k vmappings Data.Mapping.MapWithDefault No documentation available.