Moduleutility-ht-0.0.17.2Haskell98

Data.List.Key

Variant of Data.List functions like Data.List.group, Data.List.sort where the comparison is performed on a key computed from the list elements. In principle these functions could be replaced by e.g. sortBy (compare on f), but f will be re-computed for every comparison. If the evaluation of f is expensive, our functions are better, since they buffer the results of f.

Synopsis

value nub
value sort
value minimum
value maximum
value group
value merge

Packageutility-ht-0.0.17.2
Exports6
LanguageHaskell98
LicenceBSD-3-Clause
SourceKey.hs

valuenub :: Eq b => (a -> b) -> [a] -> [a]

valuesort :: Ord b => (a -> b) -> [a] -> [a]

valueminimum :: Ord b => (a -> b) -> [a] -> a

Source#

argmin

valuemaximum :: Ord b => (a -> b) -> [a] -> a

Source#

argmax

valuegroup :: Eq b => (a -> b) -> [a] -> [[a]]

Source#

Divides a list into sublists such that the members in a sublist share the same key. It uses semantics of groupBy, not that of Data.List.groupBy.

valuemerge :: Ord b => (a -> b) -> [a] -> [a] -> [a]