-- |
-- Module:     Data.Vector.Algorithms.Quicksort.Predefined.UTupleParallelStrategiesMedian3or5ST
-- Copyright:  (c) Sergey Vinokurov 2023
-- License:    Apache-2.0 (see LICENSE)
-- Maintainer: serg.foo@gmail.com

module Data.Vector.Algorithms.Quicksort.Predefined.UTupleParallelStrategiesMedian3or5ST
  ( sortUTupleParallelStrategiesMedian3or5ST
  ) 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.UTupleSequentialMedian3ST ()

{-# NOINLINE sortUTupleParallelStrategiesMedian3or5ST #-}
sortUTupleParallelStrategiesMedian3or5ST :: U.MVector s (Int32, Int32) -> ST s ()
sortUTupleParallelStrategiesMedian3or5ST :: forall s. MVector s (Int32, Int32) -> ST s ()
sortUTupleParallelStrategiesMedian3or5ST = ParStrategies
-> Median3or5 (Int32, Int32)
-> MVector (PrimState (ST s)) (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 ParStrategies
defaultParStrategies (forall a. Median3or5 a
forall {k} (a :: k). Median3or5 a
Median3or5 @(Int32, Int32))