Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
presort :: (Functor f, HasField s "presort" a) => LensLike' f s ariak-protobuf Data.Riak.Proto No documentation available.
groupSort :: Ord a => (a -> [a] -> b) -> [a] -> [b]sort Data.Sort Sort a list of elements with a stable sort, grouping together the equal elements with the argument grouping function
groupSortAssocs :: Ord k => (k -> a -> [a] -> b) -> [(k, a)] -> [(k, b)]sort Data.Sort Sort the list of associations, aggregating duplicates with the supplied function.
groupSortAssocsBy :: (k -> k -> Ordering) -> (k -> a -> [a] -> b) -> [(k, a)] -> [(k, b)]sort Data.Sort Sort the list of associations, aggregating duplicates with the supplied function and ordering the keys with the argument compare function.
groupSortBy :: (a -> a -> Ordering) -> (a -> [a] -> b) -> [a] -> [b]sort Data.Sort Sort a list of elements with a stable sort, grouping together the equal elements with the argument grouping function.
groupSortOn :: Ord k => (a -> k) -> (k -> a -> [a] -> b) -> [a] -> [b]sort Data.Sort Sort a list of elements with a stable sort, using the argument compare function determine the ordering, grouping together the equal elements with the grouping function
monoidSort :: (Monoid a, Ord a) => [a] -> [a]sort Data.Sort Sort the list, agregating duplicates with the monoid.
monoidSortAssocs :: (Monoid a, Ord k) => [(k, a)] -> [(k, a)]sort Data.Sort Sort the list of associations, aggregating duplicates with the monoid.
monoidSortAssocsBy :: Monoid a => (k -> k -> Ordering) -> [(k, a)] -> [(k, a)]sort Data.Sort Sort the list of associations, aggregating duplicates with the monoid and ordering the keys with the argument compare function.
monoidSortBy :: Monoid a => (a -> a -> Ordering) -> [a] -> [a]sort Data.Sort Sort the list, agregating duplicates with the monoid and ordering the keys with the argument compare function.