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.

  1. newtype DeltaList a

    delta-types Data.Delta.List

    Delta type for lists where a list of elements is prepended.

  2. deltaSetFromList :: Ord a => [DeltaSet1 a] -> DeltaSet a

    delta-types Data.Delta.Set

    Collect insertions or deletions of elements into a DeltaSet. To save space, combinations of Insert and Delete for the same element are simplified when possible. These simplifications always preserve the property 

    apply (deltaSetFromList ds) = apply ds

  3. fromAscListWithKey :: GEq k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> MonoidalDMap k2 f

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    O(n). Build a map from an ascending list in linear time with a combining function for equal keys. The precondition (input list is ascending) is not checked.

  4. fromListWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> MonoidalDMap k2 f

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    O(n*log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey.

  5. fromList :: (Foldable t, Ord p) => t (Int, p, a) -> DEPQ p a

    depq Data.DEPQ

    Populate a DEPQ from a Foldable container (e.g. a list)

  6. toList :: DEPQ p v -> [(Int, p, v)]

    depq Data.DEPQ

    Produce a list of (key, priority, value) triples with the entries of the DEPQ Note : the order of the output list is undefined

  7. fromList :: (Eq a, Hashable a) => [(a, [a])] -> DiGraph a

    digraph Data.DiGraph

    Construct a graph from adjacency lists.

  8. unsafeFromList :: (Eq a, Hashable a) => [(a, [a])] -> DiGraph a

    digraph Data.DiGraph

    Unsafely construct a graph from adjacency lists. This function assumes that the input includes a adjacency list of each vertex that appears in a adjacency list of another vertex. Generally, fromList should be preferred.

  9. fromList :: [(Word64, v)] -> WordMap v

    discrimination Data.Discrimination.Internal.WordMap

    No documentation available.

  10. module Data.DoList

    Construct lists with do notation. For more information see https://github.com/tserduke/do-list#readme.

Page 193 of many | Previous | Next