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.
insertListWith :: Ord key => (elt -> elt -> elt) -> [(key, elt)] -> Map key elt -> Map key eltghc GHC.Data.FiniteMap No documentation available.
fromList :: Word -> [a] -> FlatBag aghc GHC.Data.FlatBag Store the list in a flattened memory representation, avoiding the memory overhead of a linked list. The size n needs to be smaller or equal to the length of the list. If it is smaller than the length of the list, overflowing elements are discarded. It is undefined behaviour to set n to be bigger than the length of the list.
delUnVarSetList :: UnVarSet -> [Var] -> UnVarSetghc GHC.Data.Graph.UnVar No documentation available.
extendUnVarSetList :: [Var] -> UnVarSet -> UnVarSetghc GHC.Data.Graph.UnVar No documentation available.
allListsOf :: [a] -> Infinite [a]ghc GHC.Data.List.Infinite Compute all lists of the given alphabet. For example: allListsOf "ab" = ["a", "b", "aa", "ba", "ab", "bb", "aaa", "baa", "aba", ...]
dropList :: [a] -> Infinite b -> Infinite bghc GHC.Data.List.Infinite No documentation available.
-
ghc GHC.Data.List.Infinite No documentation available.
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.
unionLists :: (HasDebugCallStack, Outputable a, Eq a) => [a] -> [a] -> [a]ghc GHC.Data.List.SetOps Assumes that the arguments contain no duplicates
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.