Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. sortMixin :: Mixin -> Mixin

   cabal-gild	CabalGild.Unstable.Type.Mixin

   Sorts the mixinIncludeRenaming field using sortIncludeRenaming.

2. sortModuleRenaming :: ModuleRenaming -> ModuleRenaming

   cabal-gild	CabalGild.Unstable.Type.Mixin

   Sorts both HidingRenaming and ModuleRenaming variants.

3. 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 ]
   

4. 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.

5. sort' :: Expr -> Expr

   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]
   

6. sort' :: Expr -> Expr

   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]
   

7. sortOrder :: CoinDetails -> String

   cryptocompare	CryptoCompare

   No documentation available.

8. sortWith :: Sorting b => (a -> b) -> [a] -> [a]

   discrimination	Data.Discrimination

   O(n). Sort a list with a Schwartzian transformation by using discrimination. This linear time replacement for sortWith and sortOn uses discrimination.

9. sorting :: Sorting a => Sort a

   discrimination	Data.Discrimination

   For every strictly monotone-increasing function f:

   contramap f sorting ≡ sorting
   

10. sorting1 :: Sorting1 f => Sort a -> Sort (f a)

    discrimination	Data.Discrimination

    No documentation available.

Page 40 of many | Previous | Next