toList

toList :: HashTable key val -> IO [(key, val)]
base Data.HashTable
Converts a hash table to a list of key/value pairs.
toList :: Foldable t => t a -> [a]
base Data.Foldable
List of elements of a structure.
toList :: Array -> Int -> Int -> [Word16]
text Data.Text.Array
Convert an immutable array to a list.
toList :: IntMap a -> [(Key, a)]
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(n). Convert the map to a list of key/value pairs. Subject to list fusion. > toList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")] > toList empty == []
toList :: IntSet -> [Key]
containers Data.IntSet
O(n). Convert the set to a list of elements. Subject to list fusion.
toList :: Map k a -> [(k, a)]
containers Data.Map.Lazy, containers Data.Map.Strict
O(n). Convert the map to a list of key/value pairs. Subject to list fusion. > toList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")] > toList empty == []
toList :: Set a -> [a]
containers Data.Set
O(n). Convert the set to a list of elements. Subject to list fusion.
toList :: Ord a => Heap a b -> [(a, b)]
fgl Data.Graph.Inductive.Internal.Heap
maybeToList :: Maybe a -> [a]
base Data.Maybe
The maybeToList function returns an empty list when given Nothing or a singleton list when not given Nothing.
fmToList :: Ord a => FiniteMap a b -> [(a, b)]
fgl Data.Graph.Inductive.Internal.FiniteMap