deferred-folds-0.9.17: Abstractions over deferred folds
Safe HaskellNone
LanguageHaskell2010

DeferredFolds.Defs.UnfoldlM

Synopsis

Documentation

null :: Monad m => UnfoldlM m input -> m Bool Source #

Check whether it's empty

foldlM' :: Monad m => (output -> input -> m output) -> output -> UnfoldlM m input -> m output Source #

Perform a monadic strict left fold

mapM_ :: Monad m => (input -> m ()) -> UnfoldlM m input -> m () Source #

A more efficient implementation of mapM_

forM_ :: Monad m => UnfoldlM m input -> (input -> m ()) -> m () Source #

Same as mapM_ with arguments flipped

fold :: Fold input output -> UnfoldlM Identity input -> output Source #

Apply a Gonzalez fold

foldM :: Monad m => FoldM m input output -> UnfoldlM m input -> m output Source #

Apply a monadic Gonzalez fold

mapFoldMInput :: Monad m => (forall x. FoldM m b x -> FoldM m a x) -> UnfoldlM m a -> UnfoldlM m b Source #

Lift a fold input mapping function into a mapping of unfolds

foldable :: (Monad m, Foldable foldable) => foldable a -> UnfoldlM m a Source #

Construct from any foldable

foldlRunner :: Monad m => (forall x. (x -> a -> x) -> x -> x) -> UnfoldlM m a Source #

Construct from a specification of how to execute a left-fold

foldrRunner :: Monad m => (forall x. (a -> x -> x) -> x -> x) -> UnfoldlM m a Source #

Construct from a specification of how to execute a right-fold

filter :: Monad m => (a -> m Bool) -> UnfoldlM m a -> UnfoldlM m a Source #

Filter the values given a predicate

intsInRange :: Monad m => Int -> Int -> UnfoldlM m Int Source #

Ints in the specified inclusive range

tVarValue :: TVar a -> UnfoldlM STM a Source #

TVar contents

hoist :: (forall a. m a -> n a) -> (forall a. n a -> m a) -> UnfoldlM m a -> UnfoldlM n a Source #

Change the base monad using invariant natural transformations

byteStringBytes :: ByteString -> UnfoldlM IO Word8 Source #

Bytes of a bytestring

shortByteStringBytes :: Monad m => ShortByteString -> UnfoldlM m Word8 Source #

Bytes of a short bytestring

primArray :: (Monad m, Prim prim) => PrimArray prim -> UnfoldlM m prim Source #

Elements of a prim array

primArrayWithIndices :: (Monad m, Prim prim) => PrimArray prim -> UnfoldlM m (Int, prim) Source #

Elements of a prim array coming paired with indices

Orphan instances

MonadTrans UnfoldlM Source # 
Instance details

Methods

lift :: Monad m => m a -> UnfoldlM m a Source #

Monad m => Monad (UnfoldlM m) Source # 
Instance details

Methods

(>>=) :: UnfoldlM m a -> (a -> UnfoldlM m b) -> UnfoldlM m b Source #

(>>) :: UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m b Source #

return :: a -> UnfoldlM m a Source #

Functor m => Functor (UnfoldlM m) Source # 
Instance details

Methods

fmap :: (a -> b) -> UnfoldlM m a -> UnfoldlM m b Source #

(<$) :: a -> UnfoldlM m b -> UnfoldlM m a Source #

Monad m => Applicative (UnfoldlM m) Source # 
Instance details

Methods

pure :: a -> UnfoldlM m a Source #

(<*>) :: UnfoldlM m (a -> b) -> UnfoldlM m a -> UnfoldlM m b Source #

liftA2 :: (a -> b -> c) -> UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m c Source #

(*>) :: UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m b Source #

(<*) :: UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m a Source #

Foldable (UnfoldlM Identity) Source # 
Instance details

Methods

fold :: Monoid m => UnfoldlM Identity m -> m Source #

foldMap :: Monoid m => (a -> m) -> UnfoldlM Identity a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UnfoldlM Identity a -> m Source #

foldr :: (a -> b -> b) -> b -> UnfoldlM Identity a -> b Source #

foldr' :: (a -> b -> b) -> b -> UnfoldlM Identity a -> b Source #

foldl :: (b -> a -> b) -> b -> UnfoldlM Identity a -> b Source #

foldl' :: (b -> a -> b) -> b -> UnfoldlM Identity a -> b Source #

foldr1 :: (a -> a -> a) -> UnfoldlM Identity a -> a Source #

foldl1 :: (a -> a -> a) -> UnfoldlM Identity a -> a Source #

toList :: UnfoldlM Identity a -> [a] Source #

null :: UnfoldlM Identity a -> Bool Source #

length :: UnfoldlM Identity a -> Int Source #

elem :: Eq a => a -> UnfoldlM Identity a -> Bool Source #

maximum :: Ord a => UnfoldlM Identity a -> a Source #

minimum :: Ord a => UnfoldlM Identity a -> a Source #

sum :: Num a => UnfoldlM Identity a -> a Source #

product :: Num a => UnfoldlM Identity a -> a Source #

Monad m => Alternative (UnfoldlM m) Source # 
Instance details

Methods

empty :: UnfoldlM m a Source #

(<|>) :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a Source #

some :: UnfoldlM m a -> UnfoldlM m [a] Source #

many :: UnfoldlM m a -> UnfoldlM m [a] Source #

Monad m => MonadPlus (UnfoldlM m) Source # 
Instance details

Methods

mzero :: UnfoldlM m a Source #

mplus :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a Source #

IsList (UnfoldlM Identity a) Source # 
Instance details

Associated Types

type Item (UnfoldlM Identity a) Source #

Eq a => Eq (UnfoldlM Identity a) Source # 
Instance details

Show a => Show (UnfoldlM Identity a) Source # 
Instance details

Monad m => Semigroup (UnfoldlM m a) Source # 
Instance details

Methods

(<>) :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a Source #

sconcat :: NonEmpty (UnfoldlM m a) -> UnfoldlM m a Source #

stimes :: Integral b => b -> UnfoldlM m a -> UnfoldlM m a Source #

Monad m => Monoid (UnfoldlM m a) Source # 
Instance details

Methods

mempty :: UnfoldlM m a Source #

mappend :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a Source #

mconcat :: [UnfoldlM m a] -> UnfoldlM m a Source #