module Data.Vector.Algorithms.Quicksort.Predefined.UPairSequentialMedian3or5ST
( sortUPairSequentialMedian3or5ST
) where
import Control.Monad.ST
import Data.Int
import Data.Vector.Unboxed qualified as U
import Data.Vector.Algorithms.Quicksort.Parameterised
import Data.Vector.Algorithms.Quicksort.Predefined.Pair
import Data.Vector.Algorithms.Quicksort.Predefined.UPairSequentialMedian3ST ()
{-# NOINLINE sortUPairSequentialMedian3or5ST #-}
sortUPairSequentialMedian3or5ST :: U.MVector s (TestPair Int32 Int32) -> ST s ()
sortUPairSequentialMedian3or5ST :: forall s. MVector s (TestPair Int32 Int32) -> ST s ()
sortUPairSequentialMedian3or5ST = Sequential
-> Median3or5 (TestPair Int32 Int32)
-> MVector (PrimState (ST s)) (TestPair Int32 Int32)
-> ST s ()
forall p med x (m :: * -> *) a (v :: * -> * -> *).
(Fork2 p x m, Median med a m (PrimState m), PrimMonad m, Ord a,
MVector v a) =>
p -> med -> v (PrimState m) a -> m ()
sortInplaceFM Sequential
Sequential (forall a. Median3or5 a
forall {k} (a :: k). Median3or5 a
Median3or5 @(TestPair Int32 Int32))