Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. data TypeLitSort

    ghc-internal GHC.Internal.Type.Reflection.Unsafe

    No documentation available.

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

  3. quicksort :: (Manifest r e, Ord e) => Vector r e -> Vector r e

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

  4. quicksortBy :: Manifest r e => (e -> e -> Ordering) -> Vector r e -> Vector r e

    massiv Data.Massiv.Array

    Same as quicksortBy, but instead of Ord constraint expects a custom Ordering.

  5. quicksortByM :: (Manifest r e, MonadUnliftIO m) => (e -> e -> m Ordering) -> Vector r e -> m (Vector r e)

    massiv Data.Massiv.Array

    Same as quicksortBy, but instead of Ord constraint expects a custom Ordering.

  6. quicksortByM_ :: (Manifest r e, MonadPrimBase s m) => (e -> e -> m Ordering) -> Scheduler s () -> MVector s r e -> m ()

    massiv Data.Massiv.Array.Mutable.Algorithms

    Same as quicksortM_, but instead of Ord constraint expects a custom Ordering.

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

  8. class RebuildSortedHList (l :: [Type])

    reflex Reflex.Dynamic

    This class allows HLists and FHlists to be built from regular lists; they must be contiguous and sorted.

  9. rebuildSortedFHList :: forall (f :: Type -> Type) . RebuildSortedHList l => [DSum (HListPtr l) f] -> FHList f l

    reflex Reflex.Dynamic

    No documentation available.

  10. rebuildSortedHList :: RebuildSortedHList l => [DSum (HListPtr l) Identity] -> HList l

    reflex Reflex.Dynamic

    No documentation available.

Page 118 of many | Previous | Next