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.
monoidSortOn :: (Monoid a, Ord k) => (a -> k) -> [a] -> [a]sort Data.Sort Sort the list, agregating duplicates with the monoid and ordering the elements by the items generated by the argument function.
uniqueSort :: Ord a => [a] -> [a]sort Data.Sort Sort the list, discarding duplicates.
uniqueSortBy :: (a -> a -> Ordering) -> [a] -> [a]sort Data.Sort Sort the list, discarding duplicates and ordering the keys with the argument compare function.
uniqueSortOn :: Ord k => (a -> k) -> [a] -> [a]sort Data.Sort Sort the list, discarding duplicates and ordering the elements by the items generated by the argument function.
groupSort :: Configuration -> Stringsphinx Text.Search.Sphinx Group-by count-distinct attribute
groupSort :: Configuration -> Stringsphinx Text.Search.Sphinx.Configuration Group-by count-distinct attribute
groupSort :: Ord k => [(k, v)] -> [(k, [v])]verset Verset A combination of group and sort.
groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")] \xs -> map fst (groupSort xs) == sort (nub (map fst xs)) \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
groupSortBy :: (a -> a -> Ordering) -> [a] -> [[a]]verset Verset A combination of group and sort, using a predicate to compare on.
groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
groupSortOn :: Ord b => (a -> b) -> [a] -> [[a]]verset Verset A combination of group and sort, using a part of the value to compare on.
groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
getSortByOrder :: X WorkspaceSortxmonad-contrib XMonad.Actions.DynamicWorkspaceOrder Sort workspaces according to the stored dynamic ordering.