DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Documentation

data (:<)

Constructors

(:<)

Instances

InequalitySearch (:<)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:<) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:<) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:<) -> Int -> (Int, Int) -> (Int, Int) -> Int

data (:<=)

Constructors

(:<=)

Instances

InequalitySearch (:<=)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:<=) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:<=) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:<=) -> Int -> (Int, Int) -> (Int, Int) -> Int

data (:>)

Constructors

(:>)

Instances

InequalitySearch (:>)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:>) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:>) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:>) -> Int -> (Int, Int) -> (Int, Int) -> Int

data (:>=)

Constructors

(:>=)

Instances

InequalitySearch (:>=)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:>=) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:>=) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:>=) -> Int -> (Int, Int) -> (Int, Int) -> Int

class InequalitySearch s where

Methods

inequalityCompare

Arguments

:: Ord a

=> s

-> a

V

-> a

A

-> a

B

-> Ordering

GT means we must search higher in the array, LT means we must search lower in the array, or EQ, which means we have found the correct bounding pair.

getIndex :: (PrimMonad m, MVector v a, Ord a) => s -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve

Arguments

:: s

-> Int

-> (Int, Int)

Final low index, high index (lo, hi)

-> (Int, Int)

Initial search region (low, high)

-> Int

A thing

Instances

InequalitySearch (:>=)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:>=) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:>=) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:>=) -> Int -> (Int, Int) -> (Int, Int) -> Int

InequalitySearch (:>)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:>) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:>) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:>) -> Int -> (Int, Int) -> (Int, Int) -> Int

InequalitySearch (:<=)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:<=) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:<=) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:<=) -> Int -> (Int, Int) -> (Int, Int) -> Int

InequalitySearch (:<)

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.InequalitySearch

Methods

inequalityCompare :: Ord a => (:<) -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => (:<) -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: (:<) -> Int -> (Int, Int) -> (Int, Int) -> Int

InequalitySearch Criterion

Defined in DataSketches.Quantiles.RelativeErrorQuantile.Types

Methods

inequalityCompare :: Ord a => Criterion -> a -> a -> a -> Ordering

getIndex :: (PrimMonad m, MVector v a, Ord a) => Criterion -> v (PrimState m) a -> Int -> Int -> a -> m Int

resolve :: Criterion -> Int -> (Int, Int) -> (Int, Int) -> Int

find :: (InequalitySearch s, PrimMonad m, MVector v a, Ord a) => s -> v (PrimState m) a -> Int -> Int -> a -> m Int