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

{-# OPTIONS_GHC -Wno-orphans #-}

module Data.Vector.Algorithms.Quicksort.Predefined.PIntSequentialMedian3ST
  ( sortPIntSequentialMedian3ST
  ) where

import Control.Monad.ST
import Data.Int
import Data.Vector.Primitive qualified as P

import Data.Vector.Algorithms.Quicksort.Parameterised

import Data.Vector.Algorithms.FixedSort
import Data.Vector.Algorithms.Heapsort

{-# SPECIALIZE heapSort    :: P.MVector s Int64 -> ST s ()        #-}
{-# SPECIALIZE bitonicSort :: Int -> P.MVector s Int64 -> ST s () #-}

{-# NOINLINE sortPIntSequentialMedian3ST #-}
sortPIntSequentialMedian3ST :: P.MVector s Int64 -> ST s ()
sortPIntSequentialMedian3ST :: forall s. MVector s Int64 -> ST s ()
sortPIntSequentialMedian3ST = Sequential
-> Median3 Int64 -> MVector (PrimState (ST s)) Int64 -> 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. Median3 a
forall {k} (a :: k). Median3 a
Median3 @Int64)