Hoogle Search
Within LTS Haskell 24.5 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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
toAscList :: Bimap a b -> [(a, b)]bimap Data.Bimap O(n). Convert to a list of associated pairs, with the left-hand values in ascending order. Since pair ordering is lexical, the pairs will also be in ascending order. Version: 0.2
toAscListR :: Bimap a b -> [(b, a)]bimap Data.Bimap O(n). Convert to a list of associated pairs, with the right-hand values first in the pair and in ascending order. Since pair ordering is lexical, the pairs will also be in ascending order. Version: 0.2
toList :: Bimap a b -> [(a, b)]bimap Data.Bimap O(n). Convert to a list of associated pairs. Version: 0.2
cast'List :: Val a => Value -> Maybe [a]bson Data.Bson No documentation available.
valList :: Val a => [a] -> Valuebson Data.Bson No documentation available.
toList :: Foldable t => t a -> [a]ghc-internal GHC.Internal.Data.Foldable List of elements of a structure, from left to right. If the entire list is intended to be reduced via a fold, just fold the structure directly bypassing the list.
Examples
Basic usage:>>> toList Nothing []
>>> toList (Just 42) [42]
>>> toList (Left "foo") []
>>> toList (Node (Leaf 5) 17 (Node Empty 12 (Leaf 8))) [5,17,12,8]
For lists, toList is the identity:>>> toList [1, 2, 3] [1,2,3]