Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. toDescList :: Ord r => IntervalSet r -> [Interval r]

    data-interval Data.IntervalSet

    Convert a interval set into a list of intervals in descending order.

  2. toList :: Ord r => IntervalSet r -> [Interval r]

    data-interval Data.IntervalSet

    Convert a interval set into a list of intervals.

  3. modifyAscList :: (Ord b, Num b, Bits b) => [(b, a -> a)] -> IntTrie a -> IntTrie a

    data-inttrie Data.IntTrie

    Modify the function at a (potentially infinite) list of points in ascending order 

    modifyAscList [(i0, f0)..(iN, fN)] = modify i0 f0 . ... . modify iN fN

  4. modifyDescList :: (Ord b, Num b, Bits b) => [(b, a -> a)] -> IntTrie a -> IntTrie a

    data-inttrie Data.IntTrie

    Modify the function at a (potentially infinite) list of points in descending order

  5. boundedList :: Int -> Memo a -> Memo [a]

    data-memocombinators Data.MemoCombinators

    Build a table which memoizes all lists of less than the given length.

  6. newtype DeltaList a

    delta-types Data.Delta.List

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

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

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

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

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

Page 192 of many | Previous | Next