Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.SegmentTree.Beats.SumMinMax

Contents

Unbox instances

Description

SumMinMax and AddChminChmax on the segment tree beats.

Typical problems

Range Chmin Chmax Add Range Sum

Synopsis

data SumMinMax a = SumMinMax {
- sumSMM :: !a
- minSMM :: !a
- maxSMM :: !a
- nMinSMM :: !Int
- nMaxSMM :: !Int
- min2SMM :: !a
- max2SMM :: !a
- failsSMM :: !Bool
}
singletonSMM :: a -> SumMinMax a
data AddChminChmax a = AddChminChmax {
- addACC :: !a
- chminACC :: !a
- chmaxACC :: !a
}
newAddACC :: (Num a, Ord a, Bounded a) => a -> AddChminChmax a
newChminACC :: (Num a, Ord a, Bounded a) => a -> AddChminChmax a
newChmaxACC :: (Num a, Ord a, Bounded a) => a -> AddChminChmax a
type SumMinMaxRepr a = (a, a, a, a, a, (Int, Int, Bool))
type AddChminChmaxRepr a = (a, a, a)

Documentation

data SumMinMax a #

Sum + Min + Max information on segment tree beats.

REMARK: Be sure to NOT use mempty as initial values in segment tree beats, use singletonSMM 0 instead.

TODO: Specialize and UNPACK.

Constructors

SumMinMax
Fields sumSMM :: !a minSMM :: !a maxSMM :: !a nMinSMM :: !Int The number of elements that equals to `minSMM` in the interval. nMaxSMM :: !Int The number of elements that equals to `maxSMM` in the interval. min2SMM :: !a Secondary minimum value. max2SMM :: !a Secondary maximum value. failsSMM :: !Bool

Instances

Instances details

Unbox a => Vector Vector (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods basicUnsafeFreeze :: Mutable Vector s (SumMinMax a) -> ST s (Vector (SumMinMax a)) # basicUnsafeThaw :: Vector (SumMinMax a) -> ST s (Mutable Vector s (SumMinMax a)) # basicLength :: Vector (SumMinMax a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (SumMinMax a) -> Vector (SumMinMax a) # basicUnsafeIndexM :: Vector (SumMinMax a) -> Int -> Box (SumMinMax a) # basicUnsafeCopy :: Mutable Vector s (SumMinMax a) -> Vector (SumMinMax a) -> ST s () # elemseq :: Vector (SumMinMax a) -> SumMinMax a -> b -> b #
Unbox a => MVector MVector (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods basicLength :: MVector s (SumMinMax a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (SumMinMax a) -> MVector s (SumMinMax a) # basicOverlaps :: MVector s (SumMinMax a) -> MVector s (SumMinMax a) -> Bool # basicUnsafeNew :: Int -> ST s (MVector s (SumMinMax a)) # basicInitialize :: MVector s (SumMinMax a) -> ST s () # basicUnsafeReplicate :: Int -> SumMinMax a -> ST s (MVector s (SumMinMax a)) # basicUnsafeRead :: MVector s (SumMinMax a) -> Int -> ST s (SumMinMax a) # basicUnsafeWrite :: MVector s (SumMinMax a) -> Int -> SumMinMax a -> ST s () # basicClear :: MVector s (SumMinMax a) -> ST s () # basicSet :: MVector s (SumMinMax a) -> SumMinMax a -> ST s () # basicUnsafeCopy :: MVector s (SumMinMax a) -> MVector s (SumMinMax a) -> ST s () # basicUnsafeMove :: MVector s (SumMinMax a) -> MVector s (SumMinMax a) -> ST s () # basicUnsafeGrow :: MVector s (SumMinMax a) -> Int -> ST s (MVector s (SumMinMax a)) #
(Num a, Ord a, Bounded a) => Monoid (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods mempty :: SumMinMax a # mappend :: SumMinMax a -> SumMinMax a -> SumMinMax a # mconcat :: [SumMinMax a] -> SumMinMax a #
(Num a, Ord a) => Semigroup (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods (<>) :: SumMinMax a -> SumMinMax a -> SumMinMax a # sconcat :: NonEmpty (SumMinMax a) -> SumMinMax a # stimes :: Integral b => b -> SumMinMax a -> SumMinMax a #
Show a => Show (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods showsPrec :: Int -> SumMinMax a -> ShowS # show :: SumMinMax a -> String # showList :: [SumMinMax a] -> ShowS #
Eq a => Eq (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods (==) :: SumMinMax a -> SumMinMax a -> Bool # (/=) :: SumMinMax a -> SumMinMax a -> Bool #
FailableSemigroupActionTarget (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods isFailureFSAT :: SumMinMax a -> Bool #
Unbox a => Unbox (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax
(Num a, Ord a, Bounded a) => SegmentAction (AddChminChmax a) (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods segAct :: AddChminChmax a -> SumMinMax a -> SumMinMax a # segActWithLength :: Int -> AddChminChmax a -> SumMinMax a -> SumMinMax a #
IsoUnbox (SumMinMax a) (SumMinMaxRepr a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods toURepr :: SumMinMax a -> SumMinMaxRepr a # fromURepr :: SumMinMaxRepr a -> SumMinMax a #
newtype MVector s (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax newtype MVector s (SumMinMax a) = MV_SumMinMax (MVector s (SumMinMaxRepr a))
newtype Vector (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax newtype Vector (SumMinMax a) = V_SumMinMax (Vector (SumMinMaxRepr a))

singletonSMM :: a -> SumMinMax a #

data AddChminChmax a #

Add first then apply chmin and chmax, works on segment tree beats.

TODO: Specialize and UNPACK.

Constructors

AddChminChmax
Fields addACC :: !a chminACC :: !a chmaxACC :: !a

Instances

Instances details

Unbox a => Vector Vector (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods basicUnsafeFreeze :: Mutable Vector s (AddChminChmax a) -> ST s (Vector (AddChminChmax a)) # basicUnsafeThaw :: Vector (AddChminChmax a) -> ST s (Mutable Vector s (AddChminChmax a)) # basicLength :: Vector (AddChminChmax a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (AddChminChmax a) -> Vector (AddChminChmax a) # basicUnsafeIndexM :: Vector (AddChminChmax a) -> Int -> Box (AddChminChmax a) # basicUnsafeCopy :: Mutable Vector s (AddChminChmax a) -> Vector (AddChminChmax a) -> ST s () # elemseq :: Vector (AddChminChmax a) -> AddChminChmax a -> b -> b #
Unbox a => MVector MVector (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods basicLength :: MVector s (AddChminChmax a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (AddChminChmax a) -> MVector s (AddChminChmax a) # basicOverlaps :: MVector s (AddChminChmax a) -> MVector s (AddChminChmax a) -> Bool # basicUnsafeNew :: Int -> ST s (MVector s (AddChminChmax a)) # basicInitialize :: MVector s (AddChminChmax a) -> ST s () # basicUnsafeReplicate :: Int -> AddChminChmax a -> ST s (MVector s (AddChminChmax a)) # basicUnsafeRead :: MVector s (AddChminChmax a) -> Int -> ST s (AddChminChmax a) # basicUnsafeWrite :: MVector s (AddChminChmax a) -> Int -> AddChminChmax a -> ST s () # basicClear :: MVector s (AddChminChmax a) -> ST s () # basicSet :: MVector s (AddChminChmax a) -> AddChminChmax a -> ST s () # basicUnsafeCopy :: MVector s (AddChminChmax a) -> MVector s (AddChminChmax a) -> ST s () # basicUnsafeMove :: MVector s (AddChminChmax a) -> MVector s (AddChminChmax a) -> ST s () # basicUnsafeGrow :: MVector s (AddChminChmax a) -> Int -> ST s (MVector s (AddChminChmax a)) #
(Num a, Ord a, Bounded a) => Monoid (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods mempty :: AddChminChmax a # mappend :: AddChminChmax a -> AddChminChmax a -> AddChminChmax a # mconcat :: [AddChminChmax a] -> AddChminChmax a #
(Num a, Ord a, Bounded a) => Semigroup (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods (<>) :: AddChminChmax a -> AddChminChmax a -> AddChminChmax a # sconcat :: NonEmpty (AddChminChmax a) -> AddChminChmax a # stimes :: Integral b => b -> AddChminChmax a -> AddChminChmax a #
Show a => Show (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods showsPrec :: Int -> AddChminChmax a -> ShowS # show :: AddChminChmax a -> String # showList :: [AddChminChmax a] -> ShowS #
Eq a => Eq (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods (==) :: AddChminChmax a -> AddChminChmax a -> Bool # (/=) :: AddChminChmax a -> AddChminChmax a -> Bool #
Unbox a => Unbox (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax
(Num a, Ord a, Bounded a) => SegmentAction (AddChminChmax a) (SumMinMax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods segAct :: AddChminChmax a -> SumMinMax a -> SumMinMax a # segActWithLength :: Int -> AddChminChmax a -> SumMinMax a -> SumMinMax a #
IsoUnbox (AddChminChmax a) (AddChminChmaxRepr a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax Methods toURepr :: AddChminChmax a -> AddChminChmaxRepr a # fromURepr :: AddChminChmaxRepr a -> AddChminChmax a #
newtype MVector s (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax newtype MVector s (AddChminChmax a) = MV_AddChminChmax (MVector s (AddChminChmaxRepr a))
newtype Vector (AddChminChmax a) #
Instance details Defined in Data.SegmentTree.Beats.SumMinMax newtype Vector (AddChminChmax a) = V_AddChminChmax (Vector (AddChminChmaxRepr a))

newAddACC :: (Num a, Ord a, Bounded a) => a -> AddChminChmax a #

newChminACC :: (Num a, Ord a, Bounded a) => a -> AddChminChmax a #

newChmaxACC :: (Num a, Ord a, Bounded a) => a -> AddChminChmax a #

`Unbox` instances

type SumMinMaxRepr a = (a, a, a, a, a, (Int, Int, Bool)) #

type AddChminChmaxRepr a = (a, a, a) #

Typical problems

Documentation

Instances

Instances

Unbox instances

`Unbox` instances