Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
u_SORT_KEY_TOO_SHORT_WARNING :: ICUErrortext-icu Data.Text.ICU.Error No documentation available.
unoSortParameters :: URINormalizationOptions -> Booluri-bytestring URI.ByteString Sorts parameters by parameter name
-
ghc-internal GHC.Internal.Base No documentation available.
-
ghc-internal GHC.Internal.Type.Reflection.Unsafe No documentation available.
tabArraySort :: (HasCallStack, MonadIO m) => TabArray -> m ()gi-pango GI.Pango.Structs.TabArray Utility function to ensure that the tab stops are in increasing order. Since: 1.50
quicksort :: (Manifest r e, Ord e) => Vector r e -> Vector r emassiv Data.Massiv.Array This is an implementation of Quicksort, which is an efficient, but unstable sort. This implementation uses Median-of-three for pivot choosing, as such it performs very well not only for random values, but also for common edge cases like already sorted, reversed sorted and arrays with many duplicate elements. It will also respect the computation strategy and will result in a nice speed up for systems with multiple CPUs.
quicksortBy :: Manifest r e => (e -> e -> Ordering) -> Vector r e -> Vector r emassiv Data.Massiv.Array Same as quicksortBy, but instead of Ord constraint expects a custom Ordering.
-
massiv Data.Massiv.Array Same as quicksortBy, but instead of Ord constraint expects a custom Ordering.
-
massiv Data.Massiv.Array.Mutable.Algorithms Same as quicksortM_, but instead of Ord constraint expects a custom Ordering.
quicksortM_ :: (Ord e, Manifest r e, MonadPrimBase s m) => Scheduler s () -> MVector s r e -> m ()massiv Data.Massiv.Array.Mutable.Algorithms Manifest version of quicksort