Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

  1. 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].

  2. 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].

  3. toList :: KdTree a p -> [p]

    kdt Data.KdTree.Dynamic

    Returns a list of all the points in the KdTree. Time complexity: O(n)

  4. 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].

  5. toList :: KdTree a p -> [p]

    kdt Data.KdTree.Static

    Returns a list of all the points in the KdTree. Time complexity: O(n) for n data points.

  6. updateHashList :: (a -> LH ()) -> [a] -> LH ()

    large-hashable Data.LargeHashable.Class

    No documentation available.

  7. fromList :: forall (m :: Type -> Type) a . Monad m => [a] -> Stream m a

    leveldb-haskell Data.Stream.Monadic

    No documentation available.

  8. toList :: (Functor m, Monad m) => Stream m a -> m [a]

    leveldb-haskell Data.Stream.Monadic

    No documentation available.

  9. 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]
    

  10. 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.

Page 204 of many | Previous | Next