Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
minusList :: Ord a => [a] -> [a] -> [a]ghc-lib-parser 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.
unionLists :: (HasDebugCallStack, Outputable a, Eq a) => [a] -> [a] -> [a]ghc-lib-parser GHC.Data.List.SetOps Assumes that the arguments contain no duplicates
unionListsOrd :: (HasDebugCallStack, Outputable a, Ord a) => [a] -> [a] -> [a]ghc-lib-parser 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.
-
Provide trees (of instructions), so that lists of instructions can be appended in linear time.
-
ghc-lib-parser GHC.Data.OrdList No documentation available.
addListToSS :: SizedSeq a -> [a] -> SizedSeq aghc-lib-parser GHC.Data.SizedSeq No documentation available.
fromList :: forall (m :: Type -> Type) a . Monad m => [a] -> Stream m a ()ghc-lib-parser GHC.Data.Stream Turn a list into a Stream, by yielding each element in turn.
lkList :: TrieMap m => (forall b . () => k -> m b -> Maybe b) -> [k] -> ListMap m a -> Maybe aghc-lib-parser GHC.Data.TrieMap No documentation available.
-
ghc-lib-parser GHC.Data.TrieMap No documentation available.
fromAscList :: [(Key, a)] -> Word64Map aghc-lib-parser 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")]