Hoogle Search
Within LTS Haskell 24.27 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
WordList :: ([Word32], Zord64) -> WordListMissingH Data.Hash.MD5 No documentation available.
breakList :: ([a] -> Bool) -> [a] -> ([a], [a])MissingH Data.List.Utils Similar to break, but performs the test on the entire remaining list instead of just one element.
dropWhileList :: ([a] -> Bool) -> [a] -> [a]MissingH Data.List.Utils Similar to dropWhile, drops elements while the func is true. The function is given the remainder of the list to examine.
-
MissingH Data.List.Utils Forces the evaluation of the entire list.
spanList :: ([a] -> Bool) -> [a] -> ([a], [a])MissingH Data.List.Utils Similar to span, but performs the test on the entire remaining list instead of just one element. spanList p xs is the same as (takeWhileList p xs, dropWhileList p xs)
takeWhileList :: ([a] -> Bool) -> [a] -> [a]MissingH Data.List.Utils Similar to takeWhile, takes elements while the func is true. The function is given the remainder of the list to examine.
fromAList :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n*log n). Build a map from a list of pairs. Unlike fromList, earlier pairs will take precedence over later ones. The name fromAList is a reference to Lisp-style association lists, where associations can be overridden by prepending new ones. Note that when duplicates occur in both the keys and in the values, fromList xs /= fromAList (reverse xs). However, if either contains no duplicates, then the equality holds. Version: 0.2.2
fromAscPairList :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n). Build a bimap from a list of pairs, where both the fst and snd halves of the list are in strictly ascending order. This precondition is checked; an invalid list will cause an error. Version: 0.2.3
fromAscPairListUnchecked :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n). Build a bimap from a list of pairs, where both the fst and snd halves of the list are in strictly ascending order. This precondition is not checked; an invalid list will produce a malformed bimap. Version: 0.2.3
fromList :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n*log n). Build a map from a list of pairs. If there are any overlapping pairs in the list, the later ones will override the earlier ones. Version: 0.2