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. partialSort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Heap

   Moves the lowest k elements to the front of the array, sorted. The remaining values of the array will be in no particular order.

2. partialSortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Heap

   Moves the lowest k elements (as defined by the comparison) to the front of the array, sorted. The remaining values of the array will be in no particular order.

3. partialSortByBounds :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> Int -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Heap

   Moves the lowest k elements in the portion [l,u) of the array into positions [l,k+l), sorted. The remaining values in [l,u) will be in no particular order. Values outside the range [l,u) will be unaffected.

4. partialSort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Intro

   Moves the least k elements to the front of the array, sorted.

5. partialSortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Intro

   Moves the least k elements (as defined by the comparison) to the front of the array, sorted.

6. partialSortByBounds :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> Int -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Intro

   Moves the least k elements in the interval [l,u) to the positions [l,k+l), sorted.

7. defaultSortBy :: IsSequence seq => (Element seq -> Element seq -> Ordering) -> seq -> seq

   mono-traversable	Data.Sequences

   Use Data.List's implementation of sortBy.

8. vectorSort :: (Vector v e, Ord e) => v e -> v e

   mono-traversable	Data.Sequences

   Sort a vector.

9. vectorSortBy :: Vector v e => (e -> e -> Ordering) -> v e -> v e

   mono-traversable	Data.Sequences

   Sort a vector using an supplied element ordering function.

10. unstableSort :: Ord a => Seq a -> Seq a

    rio	RIO.Seq

    unstableSort sorts the specified Seq by the natural ordering of its elements, but the sort is not stable. This algorithm is frequently faster and uses less memory than sort.

Page 113 of many | Previous | Next