Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Related modules
A module that is a lot like this one:
- Data.AssocList.List.Comparison - Functions on
AssocList
s that make use of aComparison
on the keys
Sorting
sortKeys :: Ord a => AssocList a b -> AssocList a b Source #
Sort an association list according by its keys. This is a stable sort, so when a key appears multiple times in the input list, the ordering of its values in the resulting list remains unchanged.
>>>
sortKeys [(2, 'b'), (3, 'c'), (2, 'a'), (4, 'd'), (2, 'e'), (1, 'f')]
[(1,'f'),(2,'b'),(2,'a'),(2,'e'),(3,'c'),(4,'d')]