vector-quicksort-0.1: Fast and flexible quicksort implementation for mutable vectors
Copyright(c) Sergey Vinokurov 2023
LicenseApache-2.0 (see LICENSE)
Maintainerserg.foo@gmail.com
Safe HaskellSafe-Inferred
LanguageGHC2021

Data.Vector.Algorithms.Quicksort.Predefined.AveragingMedian

Description

 

Documentation

data AveragingMedian a Source #

Constructors

AveragingMedian 

Instances

Instances details
(PrimMonad m, s ~ PrimState m) => Median (AveragingMedian Int64) Int64 m s Source # 
Instance details

Defined in Data.Vector.Algorithms.Quicksort.Predefined.AveragingMedian

Methods

selectMedian :: (MVector v Int64, Ord Int64) => AveragingMedian Int64 -> v s Int64 -> m (MedianResult Int64) #

(PrimMonad m, s ~ PrimState m) => Median (AveragingMedian (TestPair Int32 b)) (TestPair Int32 b) m s Source # 
Instance details

Defined in Data.Vector.Algorithms.Quicksort.Predefined.AveragingMedian

Methods

selectMedian :: (MVector v (TestPair Int32 b), Ord (TestPair Int32 b)) => AveragingMedian (TestPair Int32 b) -> v s (TestPair Int32 b) -> m (MedianResult (TestPair Int32 b)) #