Safe Haskell	Safe-Inferred
Language	GHC2021

Data.Monoid.RangedSum

Documentation

data RangedSum a Source #

Constructors

RangedSum
Fields getRangesSumSize :: !a getRangedSum :: !a

Instances

Instances details

Unbox a => Vector Vector (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum Methods basicUnsafeFreeze :: Mutable Vector s (RangedSum a) -> ST s (Vector (RangedSum a)) basicUnsafeThaw :: Vector (RangedSum a) -> ST s (Mutable Vector s (RangedSum a)) basicLength :: Vector (RangedSum a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (RangedSum a) -> Vector (RangedSum a) basicUnsafeIndexM :: Vector (RangedSum a) -> Int -> Box (RangedSum a) basicUnsafeCopy :: Mutable Vector s (RangedSum a) -> Vector (RangedSum a) -> ST s () elemseq :: Vector (RangedSum a) -> RangedSum a -> b -> b
Unbox a => MVector MVector (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum Methods basicLength :: MVector s (RangedSum a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (RangedSum a) -> MVector s (RangedSum a) basicOverlaps :: MVector s (RangedSum a) -> MVector s (RangedSum a) -> Bool basicUnsafeNew :: Int -> ST s (MVector s (RangedSum a)) basicInitialize :: MVector s (RangedSum a) -> ST s () basicUnsafeReplicate :: Int -> RangedSum a -> ST s (MVector s (RangedSum a)) basicUnsafeRead :: MVector s (RangedSum a) -> Int -> ST s (RangedSum a) basicUnsafeWrite :: MVector s (RangedSum a) -> Int -> RangedSum a -> ST s () basicClear :: MVector s (RangedSum a) -> ST s () basicSet :: MVector s (RangedSum a) -> RangedSum a -> ST s () basicUnsafeCopy :: MVector s (RangedSum a) -> MVector s (RangedSum a) -> ST s () basicUnsafeMove :: MVector s (RangedSum a) -> MVector s (RangedSum a) -> ST s () basicUnsafeGrow :: MVector s (RangedSum a) -> Int -> ST s (MVector s (RangedSum a))
Num a => Monoid (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum Methods mempty :: RangedSum a # mappend :: RangedSum a -> RangedSum a -> RangedSum a # mconcat :: [RangedSum a] -> RangedSum a #
Num a => Semigroup (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum Methods (<>) :: RangedSum a -> RangedSum a -> RangedSum a # sconcat :: NonEmpty (RangedSum a) -> RangedSum a # stimes :: Integral b => b -> RangedSum a -> RangedSum a #
Show a => Show (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum Methods showsPrec :: Int -> RangedSum a -> ShowS # show :: RangedSum a -> String # showList :: [RangedSum a] -> ShowS #
Eq a => Eq (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum Methods (==) :: RangedSum a -> RangedSum a -> Bool # (/=) :: RangedSum a -> RangedSum a -> Bool #
Unbox a => Unbox (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum
Num a => AsSemigroupEndo (Sum a) (RangedSum a) Source #
Instance details Defined in Data.SegTree.RangeAddRangeSum Methods sendo :: Sum a -> RangedSum a -> RangedSum a Source #
Num a => AsSemigroupEndo (Affine a) (RangedSum a) Source #
Instance details Defined in Data.SegTree.RangeAffineRangeSum Methods sendo :: Affine a -> RangedSum a -> RangedSum a Source #
newtype MVector s (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum newtype MVector s (RangedSum a) = MV_RangedSum (MVector s a)
newtype Vector (RangedSum a) Source #
Instance details Defined in Data.Monoid.RangedSum newtype Vector (RangedSum a) = V_RangedSum (Vector a)