Hoogle Search
Within LTS Haskell 24.31 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sortModeLens :: Lens' DefaultSort (Maybe SortMode)bloodhound Database.Bloodhound.Common.Types No documentation available.
sortOrder :: DefaultSort -> SortOrderbloodhound Database.Bloodhound.Common.Types No documentation available.
sortOrderLens :: Lens' DefaultSort SortOrderbloodhound Database.Bloodhound.Common.Types No documentation available.
sortIncludeRenaming :: IncludeRenaming -> IncludeRenamingcabal-gild CabalGild.Unstable.Type.Mixin Sorts both includeProvidesRn and includeRequiresRn fields using sortModuleRenaming.
-
cabal-gild CabalGild.Unstable.Type.Mixin Sorts the mixinIncludeRenaming field using sortIncludeRenaming.
sortModuleRenaming :: ModuleRenaming -> ModuleRenamingcabal-gild CabalGild.Unstable.Type.Mixin Sorts both HidingRenaming and ModuleRenaming variants.
sortGroupOn :: Ord b => (a -> b) -> [a] -> [(b, [a])]cabal-install Distribution.Client.CmdErrorMessages When rendering lists of things it often reads better to group related things, e.g. grouping components by package name
renderListSemiAnd [ "the package " ++ prettyShow pkgname ++ " components " ++ renderListCommaAnd showComponentName components | (pkgname, components) <- sortGroupOn packageName allcomponents ]
sortTop :: BindingMap -> [TopEntityT] -> ([TopEntityT], HashMap Unique [Unique])clash-lib Clash.Driver Reverse topologically sort given top entities. Also returns a mapping that maps a top entity to its reverse topologically sorted transitive dependencies.
-
code-conjure Conjure.Engine List sort lifted over the Expr type. Works for the element types Int, Char and Bool.
> sort' $ unit one sort [1] :: Int
> sort' $ unit bee sort "b" :: Int
> sort' $ zero -:- unit two sort [0,2] :: Int
> evl $ sort' $ two -:- unit one :: [Int] [1,2]
-
code-conjure Conjure.Expr List sort lifted over the Expr type. Works for the element types Int, Char and Bool.
> sort' $ unit one sort [1] :: Int
> sort' $ unit bee sort "b" :: Int
> sort' $ zero -:- unit two sort [0,2] :: Int
> evl $ sort' $ two -:- unit one :: [Int] [1,2]