Documentation

Methods

fmap :: (a -> b) -> SemiIndex a -> SemiIndex b #

(<$) :: a -> SemiIndex b -> SemiIndex a #

Methods

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

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

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

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

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

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

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

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

toList :: SemiIndex a -> [a] #

null :: SemiIndex a -> Bool #

length :: SemiIndex a -> Int #

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

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

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

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

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

Methods

traverse :: Applicative f => (a -> f b) -> SemiIndex a -> f (SemiIndex b) #

sequenceA :: Applicative f => SemiIndex (f a) -> f (SemiIndex a) #

mapM :: Monad m => (a -> m b) -> SemiIndex a -> m (SemiIndex b) #

sequence :: Monad m => SemiIndex (m a) -> m (SemiIndex a) #

Methods

fmap :: (a -> b) -> PreSiChunk a -> PreSiChunk b #

(<$) :: a -> PreSiChunk b -> PreSiChunk a #

Methods

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

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

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

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

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

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

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

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

toList :: PreSiChunk a -> [a] #

null :: PreSiChunk a -> Bool #

length :: PreSiChunk a -> Int #

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

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

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

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

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

Methods

traverse :: Applicative f => (a -> f b) -> PreSiChunk a -> f (PreSiChunk b) #

sequenceA :: Applicative f => PreSiChunk (f a) -> f (PreSiChunk a) #

mapM :: Monad m => (a -> m b) -> PreSiChunk a -> m (PreSiChunk b) #

sequence :: Monad m => PreSiChunk (m a) -> m (PreSiChunk a) #

Methods

fmap :: (a -> b) -> SiChunk a -> SiChunk b #

(<$) :: a -> SiChunk b -> SiChunk a #

Methods

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

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

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

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

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

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

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

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

toList :: SiChunk a -> [a] #

null :: SiChunk a -> Bool #

length :: SiChunk a -> Int #

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

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

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

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

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

Methods

traverse :: Applicative f => (a -> f b) -> SiChunk a -> f (SiChunk b) #

sequenceA :: Applicative f => SiChunk (f a) -> f (SiChunk a) #

mapM :: Monad m => (a -> m b) -> SiChunk a -> m (SiChunk b) #

sequence :: Monad m => SiChunk (m a) -> m (SiChunk a) #

Methods

minBound :: State #

maxBound :: State #

Methods

succ :: State -> State #

pred :: State -> State #

toEnum :: Int -> State #

fromEnum :: State -> Int #

enumFrom :: State -> [State] #

enumFromThen :: State -> State -> [State] #

enumFromTo :: State -> State -> [State] #

enumFromThenTo :: State -> State -> State -> [State] #

Methods

(==) :: State -> State -> Bool #

(/=) :: State -> State -> Bool #

Methods

showsPrec :: Int -> State -> ShowS #

show :: State -> String #

showList :: [State] -> ShowS #