module Data.Vector.Algorithms.Quicksort.Predefined.VPairParallelStrategiesMedian3or5IO
( sortVPairParallelStrategiesMedian3or5IO
) where
import Control.Monad.ST
import Data.Int
import Data.Vector qualified as V
import Data.Vector.Algorithms.Quicksort.Parameterised
import Data.Vector.Algorithms.Quicksort.Predefined.Pair
import Data.Vector.Algorithms.Quicksort.Predefined.VPairSequentialMedian3IO ()
{-# NOINLINE sortVPairParallelStrategiesMedian3or5IO #-}
sortVPairParallelStrategiesMedian3or5IO :: V.MVector RealWorld (TestPair Int32 Int32) -> IO ()
sortVPairParallelStrategiesMedian3or5IO :: MVector RealWorld (TestPair Int32 Int32) -> IO ()
sortVPairParallelStrategiesMedian3or5IO = 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 ParStrategies
defaultParStrategies (forall {k} (a :: k). Median3or5 a
Median3or5 @(TestPair Int32 Int32))