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. sortNaturallyBy :: (a -> (String, Int)) -> [a] -> [a]

   hspec-discover	Test.Hspec.Discover.Sort

   No documentation available.

2. sortBy :: SortBy f => (a -> a -> Ordering) -> f a -> f a

   non-empty	Data.NonEmpty.Class

   No documentation available.

3. sortDefault :: (Ord a, SortBy f) => f a -> f a

   non-empty	Data.NonEmpty.Class

   Default implementation for sort based on sortBy.

4. sortKey :: (SortKey f, Ord b) => (a -> b) -> f a -> f a

   non-empty	Data.NonEmpty.Class

   No documentation available.

5. sortKeyGen :: (SortBy f, Functor f, Ord b) => (a -> b) -> f a -> f a

   non-empty	Data.NonEmpty.Class

   No documentation available.

6. sortIndex :: (Ord t, Element t) => Vector t -> Vector I

   hmatrix	Numeric.LinearAlgebra.Data

   >>> m <- randn 4 10
   
   >>> disp 2 m
   4x10
   -0.31   0.41   0.43  -0.19  -0.17  -0.23  -0.17  -1.04  -0.07  -1.24
   0.26   0.19   0.14   0.83  -1.54  -0.09   0.37  -0.63   0.71  -0.50
   -0.11  -0.10  -1.29  -1.40  -1.04  -0.89  -0.68   0.35  -1.46   1.86
   1.04  -0.29   0.19  -0.75  -2.20  -0.01   1.06   0.11  -2.09  -1.58
   

   >>> disp 2 $ m ?? (All, Pos $ sortIndex (m!1))
   4x10
   -0.17  -1.04  -1.24  -0.23   0.43   0.41  -0.31  -0.17  -0.07  -0.19
   -1.54  -0.63  -0.50  -0.09   0.14   0.19   0.26   0.37   0.71   0.83
   -1.04   0.35   1.86  -0.89  -1.29  -0.10  -0.11  -0.68  -1.46  -1.40
   -2.20   0.11  -1.58  -0.01   0.19  -0.29   1.04   1.06  -2.09  -0.75
   

7. sortVector :: (Ord t, Element t) => Vector t -> Vector t

   hmatrix	Numeric.LinearAlgebra.Data

   No documentation available.

8. sortBy :: (PrimMonad m, MVector v e) => Comparison e -> (e -> Int -> Bool) -> Int -> (Int -> e -> Int) -> v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.AmericanFlag

   A fully parameterized version of the sorting algorithm. Again, this function takes both radix information and a comparison, because the algorithms falls back to insertion sort for small arrays.

9. sortUniq :: forall e m v . (PrimMonad m, MVector v e, Lexicographic e, Ord e) => v (PrimState m) e -> m (v (PrimState m) e)

   vector-algorithms	Data.Vector.Algorithms.AmericanFlag

   A variant on sort that returns a vector of unique elements.

10. sortUniqBy :: (PrimMonad m, MVector v e) => Comparison e -> (e -> Int -> Bool) -> Int -> (Int -> e -> Int) -> v (PrimState m) e -> m (v (PrimState m) e)

    vector-algorithms	Data.Vector.Algorithms.AmericanFlag

    A variant on sortBy which returns a vector of unique elements.

Page 17 of many | Previous | Next