Safe Haskell	None
Language	GHC2021

Data.Monoid.Affine

Synopsis

data Affine a = Affine {
- getAffine1 :: !a
- getAffine0 :: !a
}

Documentation

data Affine a Source #

a x + b

Constructors

Affine
Fields getAffine1 :: !a getAffine0 :: !a

Instances

Instances details

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