incremental-computing-0.0.1.0: Incremental computing

Safe HaskellNone
LanguageHaskell2010

Data.MultiChange

Contents

Synopsis

Type

data MultiChange p Source #

Instances

Foldable MultiChange Source # 

Methods

fold :: Monoid m => MultiChange m -> m #

foldMap :: Monoid m => (a -> m) -> MultiChange a -> m #

foldr :: (a -> b -> b) -> b -> MultiChange a -> b #

foldr' :: (a -> b -> b) -> b -> MultiChange a -> b #

foldl :: (b -> a -> b) -> b -> MultiChange a -> b #

foldl' :: (b -> a -> b) -> b -> MultiChange a -> b #

foldr1 :: (a -> a -> a) -> MultiChange a -> a #

foldl1 :: (a -> a -> a) -> MultiChange a -> a #

toList :: MultiChange a -> [a] #

null :: MultiChange a -> Bool #

length :: MultiChange a -> Int #

elem :: Eq a => a -> MultiChange a -> Bool #

maximum :: Ord a => MultiChange a -> a #

minimum :: Ord a => MultiChange a -> a #

sum :: Num a => MultiChange a -> a #

product :: Num a => MultiChange a -> a #

Read p => Read (MultiChange p) Source # 
Show p => Show (MultiChange p) Source # 
Monoid (MultiChange p) Source # 
Change p => Change (MultiChange p) Source # 

Associated Types

type Value (MultiChange p) :: * Source #

type Value (MultiChange p) Source # 
type Value (MultiChange p) = Value p

Construction

Monad structure

Multi composition