Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. minusList :: Ord a => [a] -> [a] -> [a]

   ghc	GHC.Data.List.SetOps

   Calculate the set difference of two lists. This is O((m + n) log n), where we subtract a list of n elements from a list of m elements. Extremely short cases are handled specially: When m or n is 0, this takes O(1) time. When m is 1, it takes O(n) time.

2. unionLists :: (HasDebugCallStack, Outputable a, Eq a) => [a] -> [a] -> [a]

   ghc	GHC.Data.List.SetOps

   Assumes that the arguments contain no duplicates

3. unionListsOrd :: (HasDebugCallStack, Outputable a, Ord a) => [a] -> [a] -> [a]

   ghc	GHC.Data.List.SetOps

   Combines the two lists while keeping their order, placing the first argument first in the result. Uses a set internally to record duplicates. This makes it slightly slower for very small lists but avoids quadratic behaviour for large lists.

4. module GHC.Data.OrdList

   Provide trees (of instructions), so that lists of instructions can be appended in linear time.

5. data OrdList a

   ghc	GHC.Data.OrdList

   No documentation available.

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

   ghc	GHC.Data.Stream

   Turn a list into a Stream, by yielding each element in turn.

7. lkList :: TrieMap m => (forall b . () => k -> m b -> Maybe b) -> [k] -> ListMap m a -> Maybe a

   ghc	GHC.Data.TrieMap

   No documentation available.

8. xtList :: TrieMap m => (forall b . () => k -> XT b -> m b -> m b) -> [k] -> XT a -> ListMap m a -> ListMap m a

   ghc	GHC.Data.TrieMap

   No documentation available.

9. fromAscList :: [(Key, a)] -> Word64Map a

   ghc	GHC.Data.Word64Map.Internal

   Build a map from a list of key/value pairs where the keys are in ascending order.

   fromAscList [(3,"b"), (5,"a")]          == fromList [(3, "b"), (5, "a")]
   fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]
   

10. fromAscListWith :: (a -> a -> a) -> [(Key, a)] -> Word64Map a

    ghc	GHC.Data.Word64Map.Internal

    Build a map from a list of key/value pairs where the keys are in ascending order, with a combining function on equal keys. The precondition (input list is ascending) is not checked.

    fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]
    

Page 60 of many | Previous | Next