Hoogle Search

Within LTS Haskell 24.55 (ghc-9.10.3)

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

Exact lookup

1. sequenceSortIter :: (HasCallStack, MonadIO m) => Sequence -> SequenceIterCompareFunc -> m ()

   gi-glib	GI.GLib.Structs.Sequence

   Like sequenceSort, but uses a SequenceIterCompareFunc instead of a CompareDataFunc as the compare function cmpFunc is called with two iterators pointing into seq. It should return 0 if the iterators are equal, a negative value if the first iterator comes before the second, and a positive value if the second iterator comes before the first. Since: 2.14

2. valueArraySort :: (HasCallStack, MonadIO m) => ValueArray -> CompareDataFunc -> m ValueArray

   gi-gobject	GI.GObject.Structs.ValueArray

   Deprecated: (Since version 2.32)Use Array and g_array_sort_with_data().

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

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

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

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

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

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

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

   mono-traversable	Data.Sequences

   Use Data.List's implementation of sortBy.

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

    mono-traversable	Data.Sequences

    Sort a vector.

Page 113 of many | Previous | Next