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. sortThreeNotes :: RandomGen g => g -> [([Pitch], [Pitch])]

   reactive-midyim	Reactive.Banana.MIDI.Training

   No documentation available.

2. sortArrayBy :: (a -> a -> Ordering) -> MutableArray# s a -> Int -> Int -> ST s ()

   samsort	Data.SamSort

   Sort a slice of a MutableArray# using a comparison function. The comparison must form a total order, as required by the Ord laws. offset and length must be valid, i.e.

   • 0 <= offset < array size .
   • 0 <= length .
   • offset + length <= array size .
   This function will inline to get the best performance out of statically known comparison functions. To avoid code duplication, create a wrapping definition and reuse it as necessary.

3. sortIntArrayBy :: (Int -> Int -> Ordering) -> MutableByteArray# s -> Int -> Int -> ST s ()

   samsort	Data.SamSort

   Sort a slice of a MutableByteArray# interpreted as an array of Int#s using a comparison function. The comparison must form a total order, as required by the Ord laws. offset and length must be valid, i.e.

   • 0 <= offset < array size .
   • 0 <= length .
   • offset + length <= array size .
   This function will inline to get the best performance out of statically known comparison functions. To avoid code duplication, create a wrapping definition and reuse it as necessary.

4. sortBy :: forall (m :: Type -> Type) a . Monad m => (a -> a -> Ordering) -> StreamK m a -> StreamK m a

   streamly-core	Streamly.Data.StreamK

   Sort the input stream using a supplied comparison function. Sorting can be achieved by simply:

   >>> sortBy cmp = StreamK.mergeMapWith (StreamK.mergeBy cmp) StreamK.fromPure
   

   However, this combinator uses a parser to first split the input stream into down and up sorted segments and then merges them to optimize sorting when pre-sorted sequences exist in the input stream. O(n) space

5. sortBy :: forall (m :: Type -> Type) a . Monad m => (a -> a -> Ordering) -> StreamK m a -> StreamK m a

   streamly-core	Streamly.Internal.Data.StreamK

   Sort the input stream using a supplied comparison function. Sorting can be achieved by simply:

   >>> sortBy cmp = StreamK.mergeMapWith (StreamK.mergeBy cmp) StreamK.fromPure
   

   However, this combinator uses a parser to first split the input stream into down and up sorted segments and then merges them to optimize sorting when pre-sorted sequences exist in the input stream. O(n) space

6. sortDefs :: Definitions -> [(QName, Definition)]

   Agda	Agda.Compiler.Common

   No documentation available.

7. sortInteractionPoints :: (MonadInteractionPoints m, MonadError TCErr m, MonadDebug m) => [InteractionId] -> m [InteractionId]

   Agda	Agda.Interaction.InteractionTop

   Sorts interaction points based on their ranges.

8. sortUniv :: Sort' t -> Maybe Univ

   Agda	Agda.Syntax.Internal

   Get the flavor of the universe. Nothing could also mean "don't know".

9. sortKit :: (HasBuiltins m, MonadTCError m, HasOptions m) => m SortKit

   Agda	Agda.TypeChecking.Monad.Builtin

   Compute a SortKit in an environment that supports failures. When optLoadPrimitives is set to False, sortKit is a fallible operation, so for the uses of sortKit in fallible contexts (e.g. TCM), we report a type error rather than exploding.

10. sortRulesOfSymbol :: QName -> TCM ()

    Agda	Agda.TypeChecking.Rewriting.Confluence

    No documentation available.

Page 37 of many | Previous | Next