Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. sorting :: Sorting a => Sort a

   discrimination	Data.Discrimination.Sorting

   For every strictly monotone-increasing function f:

   contramap f sorting ≡ sorting
   

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

   discrimination	Data.Discrimination.Sorting

   No documentation available.

3. sortingBag :: Foldable f => Sort k -> Sort (f k)

   discrimination	Data.Discrimination.Sorting

   Construct a stable ordered discriminator that sorts a list as multisets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys and their multiplicity, and is sorted as if we'd sorted each key in turn before comparing.

4. sortingCompare :: Sorting a => a -> a -> Ordering

   discrimination	Data.Discrimination.Sorting

   Valid definition for compare in terms of Sorting.

5. sortingNat :: Int -> Sort Int

   discrimination	Data.Discrimination.Sorting

   No documentation available.

6. sortingSet :: Foldable f => Sort k -> Sort (f k)

   discrimination	Data.Discrimination.Sorting

   Construct a stable ordered discriminator that sorts a list as sets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys, and is sorted as if we'd sorted each key in turn before comparing.

7. sortAndGroupFstBySnd :: Ord b => [(a, b)] -> [([a], b)]

   fitspec	Test.FitSpec.Utils

   No documentation available.

8. sortAndGroupOn :: Ord b => (a -> b) -> [a] -> [[a]]

   fitspec	Test.FitSpec.Utils

   No documentation available.

9. sortGroupAndCollapse :: Ord b => (a -> b) -> (a -> c) -> (b -> [c] -> d) -> [a] -> [d]

   fitspec	Test.FitSpec.Utils

   No documentation available.

10. sortOn :: Ord b => (a -> b) -> [a] -> [a]

    fitspec	Test.FitSpec.Utils

    No documentation available.

Page 40 of many | Previous | Next