module Data.Vector.Algorithms.Quicksort.Predefined.VTupleSequentialMedian3or5ST
( sortVTupleSequentialMedian3or5ST
) 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.VTupleSequentialMedian3ST ()
{-# NOINLINE sortVTupleSequentialMedian3or5ST #-}
sortVTupleSequentialMedian3or5ST :: V.MVector s (Int32, Int32) -> ST s ()
sortVTupleSequentialMedian3or5ST :: forall s. MVector s (Int32, Int32) -> ST s ()
sortVTupleSequentialMedian3or5ST = 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 {k} (a :: k). Median3or5 a
Median3or5 @(Int32, Int32))