DeferredFolds.UnfoldlM

deferred-folds-0.9.18.6: Abstractions over deferred folds

Safe Haskell | None
Language | Haskell2010

DeferredFolds.UnfoldlM

Synopsis

- unfoldr :: forall (m :: Type -> Type) a. Monad m => Unfoldr a -> UnfoldlM m a
- filter :: Monad m => (a -> m Bool) -> UnfoldlM m a -> UnfoldlM m a
- null :: Monad m => UnfoldlM m input -> m Bool
- fold :: Fold input output -> UnfoldlM Identity input -> output
- mapM_ :: Monad m => (input -> m ()) -> UnfoldlM m input -> m ()
- forM_ :: Monad m => UnfoldlM m input -> (input -> m ()) -> m ()
- foldM :: Monad m => FoldM m input output -> UnfoldlM m input -> m output
- hoist :: (forall a1. m a1 -> n a1) -> (forall a1. n a1 -> m a1) -> UnfoldlM m a -> UnfoldlM n a
- foldlM' :: Monad m => (output -> input -> m output) -> output -> UnfoldlM m input -> m output
- newtype UnfoldlM (m :: Type -> Type) a = UnfoldlM (forall x. (x -> a -> m x) -> x -> m x)
- foldable :: forall (m :: Type -> Type) foldable a. (Monad m, Foldable foldable) => foldable a -> UnfoldlM m a
- mapFoldMInput :: forall (m :: Type -> Type) b a. Monad m => (forall x. FoldM m b x -> FoldM m a x) -> UnfoldlM m a -> UnfoldlM m b
- foldlRunner :: forall (m :: Type -> Type) a. Monad m => (forall x. (x -> a -> x) -> x -> x) -> UnfoldlM m a
- foldrRunner :: forall (m :: Type -> Type) a. Monad m => (forall x. (a -> x -> x) -> x -> x) -> UnfoldlM m a
- intsInRange :: forall (m :: Type -> Type). Monad m => Int -> Int -> UnfoldlM m Int
- tVarValue :: TVar a -> UnfoldlM STM a
- byteStringBytes :: ByteString -> UnfoldlM IO Word8
- shortByteStringBytes :: forall (m :: Type -> Type). Monad m => ShortByteString -> UnfoldlM m Word8
- primArray :: forall (m :: Type -> Type) prim. (Monad m, Prim prim) => PrimArray prim -> UnfoldlM m prim
- primArrayWithIndices :: forall (m :: Type -> Type) prim. (Monad m, Prim prim) => PrimArray prim -> UnfoldlM m (Int, prim)

# Documentation

unfoldr :: forall (m :: Type -> Type) a. Monad m => Unfoldr a -> UnfoldlM m a #

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

Filter the values given a predicate

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

Check whether it's empty

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

Apply a Gonzalez fold

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

A more efficient implementation of mapM_

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

Same as `mapM_` with arguments flipped

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

Apply a monadic Gonzalez fold

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

Change the base monad using invariant natural transformations

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

Perform a monadic strict left fold

newtype UnfoldlM (m :: Type -> Type) a #

A monadic variation of DeferredFolds.Unfoldl

Constructors

UnfoldlM (forall x. (x -> a -> m x) -> x -> m x) |

#### Instances

Instances details

MonadTrans UnfoldlM # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods lift :: Monad m => m a -> UnfoldlM m a #
Monad m => Alternative (UnfoldlM m) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods empty :: UnfoldlM m a # (<|>) :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a # some :: UnfoldlM m a -> UnfoldlM m [a] # many :: UnfoldlM m a -> UnfoldlM m [a] #
Monad m => Applicative (UnfoldlM m) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods pure :: a -> UnfoldlM m a # (<*>) :: UnfoldlM m (a -> b) -> UnfoldlM m a -> UnfoldlM m b # liftA2 :: (a -> b -> c) -> UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m c # (*>) :: UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m b # (<*) :: UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m a #
Functor m => Functor (UnfoldlM m) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods fmap :: (a -> b) -> UnfoldlM m a -> UnfoldlM m b # (<$) :: a -> UnfoldlM m b -> UnfoldlM m a #
Monad m => Monad (UnfoldlM m) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods (>>=) :: UnfoldlM m a -> (a -> UnfoldlM m b) -> UnfoldlM m b # (>>) :: UnfoldlM m a -> UnfoldlM m b -> UnfoldlM m b # return :: a -> UnfoldlM m a #
Monad m => MonadPlus (UnfoldlM m) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods mzero :: UnfoldlM m a # mplus :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a #
Foldable (UnfoldlM Identity) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods fold :: Monoid m => UnfoldlM Identity m -> m # foldMap :: Monoid m => (a -> m) -> UnfoldlM Identity a -> m # foldMap' :: Monoid m => (a -> m) -> UnfoldlM Identity a -> m # foldr :: (a -> b -> b) -> b -> UnfoldlM Identity a -> b # foldr' :: (a -> b -> b) -> b -> UnfoldlM Identity a -> b # foldl :: (b -> a -> b) -> b -> UnfoldlM Identity a -> b # foldl' :: (b -> a -> b) -> b -> UnfoldlM Identity a -> b # foldr1 :: (a -> a -> a) -> UnfoldlM Identity a -> a # foldl1 :: (a -> a -> a) -> UnfoldlM Identity a -> a # toList :: UnfoldlM Identity a -> [a] # null :: UnfoldlM Identity a -> Bool # length :: UnfoldlM Identity a -> Int # elem :: Eq a => a -> UnfoldlM Identity a -> Bool # maximum :: Ord a => UnfoldlM Identity a -> a # minimum :: Ord a => UnfoldlM Identity a -> a # sum :: Num a => UnfoldlM Identity a -> a # product :: Num a => UnfoldlM Identity a -> a #
Monad m => Monoid (UnfoldlM m a) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods mempty :: UnfoldlM m a # mappend :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a # mconcat :: [UnfoldlM m a] -> UnfoldlM m a #
Monad m => Semigroup (UnfoldlM m a) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods (<>) :: UnfoldlM m a -> UnfoldlM m a -> UnfoldlM m a # sconcat :: NonEmpty (UnfoldlM m a) -> UnfoldlM m a # stimes :: Integral b => b -> UnfoldlM m a -> UnfoldlM m a #
IsList (UnfoldlM Identity a) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Associated Types
type Item (UnfoldlM Identity a) |
Instance details Defined in DeferredFolds.Defs.UnfoldlM type Item (UnfoldlM Identity a) = a
Methods fromList :: [Item (UnfoldlM Identity a)] -> UnfoldlM Identity a # fromListN :: Int -> [Item (UnfoldlM Identity a)] -> UnfoldlM Identity a # toList :: UnfoldlM Identity a -> [Item (UnfoldlM Identity a)] #
Show a => Show (UnfoldlM Identity a) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods showsPrec :: Int -> UnfoldlM Identity a -> ShowS # show :: UnfoldlM Identity a -> String # showList :: [UnfoldlM Identity a] -> ShowS #
Eq a => Eq (UnfoldlM Identity a) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM Methods (==) :: UnfoldlM Identity a -> UnfoldlM Identity a -> Bool # (/=) :: UnfoldlM Identity a -> UnfoldlM Identity a -> Bool #
type Item (UnfoldlM Identity a) # |
Instance details Defined in DeferredFolds.Defs.UnfoldlM type Item (UnfoldlM Identity a) = a

foldable :: forall (m :: Type -> Type) foldable a. (Monad m, Foldable foldable) => foldable a -> UnfoldlM m a #

Construct from any foldable

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

Lift a fold input mapping function into a mapping of unfolds

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

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

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

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

intsInRange :: forall (m :: Type -> Type). Monad m => Int -> Int -> UnfoldlM m Int #

Ints in the specified inclusive range

tVarValue :: TVar a -> UnfoldlM STM a #

TVar contents

byteStringBytes :: ByteString -> UnfoldlM IO Word8 #

Bytes of a bytestring

shortByteStringBytes :: forall (m :: Type -> Type). Monad m => ShortByteString -> UnfoldlM m Word8 #

Bytes of a short bytestring

primArray :: forall (m :: Type -> Type) prim. (Monad m, Prim prim) => PrimArray prim -> UnfoldlM m prim #

Elements of a prim array

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

Elements of a prim array coming paired with indices