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.

Exact lookup

1. sortOrder :: CoinDetails -> String

   cryptocompare	CryptoCompare

   No documentation available.

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

3. sorting :: Sorting a => Sort a

   discrimination	Data.Discrimination

   For every strictly monotone-increasing function f:

   contramap f sorting ≡ sorting
   

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

   discrimination	Data.Discrimination

   No documentation available.

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

   discrimination	Data.Discrimination

   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.

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

   discrimination	Data.Discrimination

   Valid definition for compare in terms of Sorting.

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

   discrimination	Data.Discrimination

   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.

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

   discrimination	Data.Discrimination.Sorting

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

   For every strictly monotone-increasing function f:

   contramap f sorting ≡ sorting
   

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

    discrimination	Data.Discrimination.Sorting

    No documentation available.

Page 39 of many | Previous | Next