Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data DoubleBuffer s
- type Capacity = Int
- type GrowthIncrement = Int
- type SpaceAtBottom = Bool
- newtype DoubleIsNonFiniteException = DoubleIsNonFiniteException Double
- mkBuffer :: PrimMonad m => Capacity -> GrowthIncrement -> SpaceAtBottom -> m (DoubleBuffer (PrimState m))
- copyBuffer :: PrimMonad m => DoubleBuffer (PrimState m) -> m (DoubleBuffer (PrimState m))
- append :: PrimMonad m => DoubleBuffer (PrimState m) -> Double -> m ()
- ensureCapacity :: PrimMonad m => DoubleBuffer (PrimState m) -> Int -> m ()
- getCountWithCriterion :: PrimMonad m => DoubleBuffer (PrimState m) -> Double -> Criterion -> m Int
- getEvensOrOdds :: PrimMonad m => DoubleBuffer (PrimState m) -> Int -> Int -> Bool -> m (DoubleBuffer (PrimState m))
- (!) :: PrimMonad m => DoubleBuffer (PrimState m) -> Int -> m Double
- growthIncrement :: DoubleBuffer s -> Int
- spaceAtBottom :: DoubleBuffer s -> Bool
- getCapacity :: PrimMonad m => DoubleBuffer (PrimState m) -> m Int
- getCount :: PrimMonad m => DoubleBuffer (PrimState m) -> m Int
- getSpace :: PrimMonad m => DoubleBuffer (PrimState m) -> m Int
- getVector :: (PrimMonad m, PrimState m ~ s) => DoubleBuffer s -> m (MVector s Double)
- isEmpty :: PrimMonad m => DoubleBuffer (PrimState m) -> m Bool
- isSorted :: PrimMonad m => DoubleBuffer (PrimState m) -> m Bool
- sort :: PrimMonad m => DoubleBuffer (PrimState m) -> m ()
- mergeSortIn :: (PrimMonad m, HasCallStack) => DoubleBuffer (PrimState m) -> DoubleBuffer (PrimState m) -> m ()
- trimCount :: PrimMonad m => DoubleBuffer (PrimState m) -> Int -> m ()
Documentation
data DoubleBuffer s Source #
A special buffer of floats specifically designed to support the ReqCompactor class.
Instances
TakeSnapshot DoubleBuffer Source # | |
Defined in DataSketches.Quantiles.RelativeErrorQuantile.Internal.DoubleBuffer data Snapshot DoubleBuffer Source # takeSnapshot :: PrimMonad m => DoubleBuffer (PrimState m) -> m (Snapshot DoubleBuffer) Source # | |
Show (Snapshot DoubleBuffer) Source # | |
data Snapshot DoubleBuffer Source # | |
type GrowthIncrement = Int Source #
type SpaceAtBottom = Bool Source #
newtype DoubleIsNonFiniteException Source #
mkBuffer :: PrimMonad m => Capacity -> GrowthIncrement -> SpaceAtBottom -> m (DoubleBuffer (PrimState m)) Source #
copyBuffer :: PrimMonad m => DoubleBuffer (PrimState m) -> m (DoubleBuffer (PrimState m)) Source #
append :: PrimMonad m => DoubleBuffer (PrimState m) -> Double -> m () Source #
Appends the given item to the active array and increments the active count. This will expand the array if necessary.
ensureCapacity :: PrimMonad m => DoubleBuffer (PrimState m) -> Int -> m () Source #
getCountWithCriterion :: PrimMonad m => DoubleBuffer (PrimState m) -> Double -> Criterion -> m Int Source #
getEvensOrOdds :: PrimMonad m => DoubleBuffer (PrimState m) -> Int -> Int -> Bool -> m (DoubleBuffer (PrimState m)) Source #
growthIncrement :: DoubleBuffer s -> Int Source #
spaceAtBottom :: DoubleBuffer s -> Bool Source #
getCapacity :: PrimMonad m => DoubleBuffer (PrimState m) -> m Int Source #
mergeSortIn :: (PrimMonad m, HasCallStack) => DoubleBuffer (PrimState m) -> DoubleBuffer (PrimState m) -> m () Source #
Merges the incoming sorted buffer into this sorted buffer.