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.

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

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

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

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

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

  6. toposortKindVarsOfTvbs :: [DTyVarBndr flag] -> [DTyVarBndrUnit]

    th-desugar Language.Haskell.TH.Desugar

    Take a telescope of DTyVarBndrs, find the free variables in their kinds, and sort them in reverse topological order to ensure that they are well scoped. Because the argument list is assumed to be telescoping, kind variables that are bound earlier in the list are not returned. For example, this: 

    toposortKindVarsOfTvbs [a :: k, b :: Proxy a]
    Will return [k], not [k, a], since a is bound earlier by a :: k.

  7. toposortTyVarsOf :: [DType] -> [DTyVarBndrUnit]

    th-desugar Language.Haskell.TH.Desugar

    Take a list of DTypes, find their free variables, and sort them in reverse topological order to ensure that they are well scoped. In other words, the free variables are ordered such that:

    1. Whenever an explicit kind signature of the form (A :: K) is encountered, the free variables of K will always appear to the left of the free variables of A in the returned result.
    2. The constraint in (1) notwithstanding, free variables will appear in left-to-right order of their original appearance.
    On older GHCs, this takes measures to avoid returning explicitly bound kind variables, which was not possible before TypeInType.

  8. preprocessorTests :: [([Char], IO ())]

    HTF Test.Framework.Preprocessor

    No documentation available.

  9. data TestSort

    HTF Test.Framework.TestTypes

    Type for distinguishing different sorts of tests.

  10. ft_sort :: GenFlatTest a -> TestSort

    HTF Test.Framework.TestTypes

    The sort of the test.

Page 118 of many | Previous | Next