Skip to content

HORIZON HASKELL Docs lts/ghc-9.10.x248f8f02026-10-05Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · 248f8f0 · 2026-10-05

Moduledeferred-folds-0.9.18.6Haskell2010

DeferredFolds.UnfoldlM

1 type
19 values

Packagedeferred-folds-0.9.18.6
Exports20
LanguageHaskell2010
LicenceMIT
SourceTypes.hs

newtypenewtype UnfoldlM (m :: Type -> Type) a

A monadic variation of DeferredFolds.Unfoldl

Constructors

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

Instances13MonadTrans, Monad, Functor, Applicative, Foldable, Alternative, …

MonadTrans UnfoldlMDefined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Monad m => Monad (UnfoldlM m)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Functor m => Functor (UnfoldlM m)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Monad m => Applicative (UnfoldlM m)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Foldable (UnfoldlM Identity)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Monad m => Alternative (UnfoldlM m)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Monad m => MonadPlus (UnfoldlM m)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
IsList (UnfoldlM Identity a)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Eq a => Eq (UnfoldlM Identity a)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Show a => Show (UnfoldlM Identity a)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Monad m => Semigroup (UnfoldlM m a)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
Monad m => Monoid (UnfoldlM m a)Defined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan
type Item (UnfoldlM Identity a) = aDefined in deferred-folds-0.9.18.6 · DeferredFolds.Defs.UnfoldlM · orphan

valuefold :: Fold input output -> UnfoldlM Identity input -> output

Apply a Gonzalez fold

valuefoldM :: Monad m => FoldM m input output -> UnfoldlM m input -> m output

Apply a monadic Gonzalez fold

valuemapM_ :: Monad m => (input -> m ()) -> UnfoldlM m input -> m ()

A more efficient implementation of mapM_

valueunfoldr :: Monad m => Unfoldr a -> UnfoldlM m a

valueforM_ :: Monad m => UnfoldlM m input -> (input -> m ()) -> m ()

Same as mapM_ with arguments flipped

valuenull :: Monad m => UnfoldlM m input -> m Bool

Check whether it's empty

valuefilter :: Monad m => (a -> m Bool) -> UnfoldlM m a -> UnfoldlM m a

Filter the values given a predicate

valuefoldlM'

:: Monad m
=> output -> input -> m output
-> output
-> UnfoldlM m input
-> m output

Perform a monadic strict left fold

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

Construct from any foldable

valuemapFoldMInput

:: 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

valuefoldlRunner

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

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

valueintsInRange :: Monad m => Int -> Int -> UnfoldlM m Int

Ints in the specified inclusive range

valuefoldrRunner

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

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

valuebyteStringBytes :: ByteString -> UnfoldlM IO Word8

Bytes of a bytestring

valueshortByteStringBytes :: Monad m => ShortByteString -> UnfoldlM m Word8

Bytes of a short bytestring

valuetVarValue :: TVar a -> UnfoldlM STM a

TVar contents

valueprimArray :: (Monad m, Prim prim) => PrimArray prim -> UnfoldlM m prim

Elements of a prim array

valueprimArrayWithIndices

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

Elements of a prim array coming paired with indices

valuehoist

:: 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