Data.Cond

Documentation

newtype CondT a m b

CondT is a kind of StateT a (MaybeT m) b, which uses a special Result type instead of Maybe to express whether recursion should be performed from the item under consideration. This is used to build predicates that can guide recursive traversals.

Several different types may be promoted to CondT:

Bool

Using guard

m Bool

Using guardM

a -> Bool

Using guard_

a -> m Bool

Using guardM_

a -> m (Maybe b)

Using apply

a -> m (Maybe (b, a))

Using consider

Here is a trivial example:

flip runCondT 42 $ do
  guard_ even
  liftIO $ putStrLn "42 must be even to reach here"
  guard_ odd <|> guard_ even
  guard_ (== 42)

If CondT is executed using runCondT, it return a Maybe b if the predicate matched. It can also be run with applyCondT, which does case analysis on the Result, specifying how recursion should be performed from the given a value.

Constructors

CondT

Fields

• getCondT :: StateT a m (Result a m b)

Instances

MonadBase b m => MonadBase b (CondT a m)

Methods

liftBase :: b α -> CondT a m α

MonadBaseControl b m => MonadBaseControl b (CondT r m)

Associated Types

type StM (CondT r m :: * -> *) a :: *

Methods

liftBaseWith :: (RunInBase (CondT r m) b -> b a) -> CondT r m a

restoreM :: StM (CondT r m) a -> CondT r m a

Monad m => MonadReader a (CondT a m)

Methods

ask :: CondT a m a

local :: (a -> a) -> CondT a m a -> CondT a m a

reader :: (a -> a) -> CondT a m a

Monad m => MonadState a (CondT a m)

Methods

get :: CondT a m a

put :: a -> CondT a m ()

state :: (a -> (a, a)) -> CondT a m a

MonadTrans (CondT a)

Methods

lift :: Monad m => m a -> CondT a m a

MFunctor (CondT a)

Methods

hoist :: Monad m => (forall b. m b -> n b) -> CondT a m b -> CondT a n b

Monad m => Monad (CondT a m)

Methods

(>>=) :: CondT a m a -> (a -> CondT a m b) -> CondT a m b

(>>) :: CondT a m a -> CondT a m b -> CondT a m b

return :: a -> CondT a m a

fail :: String -> CondT a m a

Monad m => Functor (CondT a m)

Methods

fmap :: (a -> b) -> CondT a m a -> CondT a m b

(<$) :: a -> CondT a m b -> CondT a m a

Monad m => Applicative (CondT a m)

Methods

pure :: a -> CondT a m a

(<*>) :: CondT a m (a -> b) -> CondT a m a -> CondT a m b

(*>) :: CondT a m a -> CondT a m b -> CondT a m b

(<*) :: CondT a m a -> CondT a m b -> CondT a m a

Monad m => Alternative (CondT a m)

Methods

empty :: CondT a m a

(<|>) :: CondT a m a -> CondT a m a -> CondT a m a

some :: CondT a m a -> CondT a m [a]

many :: CondT a m a -> CondT a m [a]

Monad m => MonadPlus (CondT a m)

Methods

mzero :: CondT a m a

mplus :: CondT a m a -> CondT a m a -> CondT a m a

MonadIO m => MonadIO (CondT a m)

Methods

liftIO :: IO a -> CondT a m a

MonadThrow m => MonadThrow (CondT a m)

Methods

throwM :: Exception e => e -> CondT a m a

MonadCatch m => MonadCatch (CondT a m)

Methods

catch :: Exception e => CondT a m a -> (e -> CondT a m a) -> CondT a m a

MonadMask m => MonadMask (CondT a m)

Methods

mask :: ((forall b. CondT a m b -> CondT a m b) -> CondT a m b) -> CondT a m b

uninterruptibleMask :: ((forall b. CondT a m b -> CondT a m b) -> CondT a m b) -> CondT a m b

Show (CondT a m b)

Methods

showsPrec :: Int -> CondT a m b -> ShowS

show :: CondT a m b -> String

showList :: [CondT a m b] -> ShowS

(Monad m, Semigroup b) => Semigroup (CondT a m b)

Methods

(<>) :: CondT a m b -> CondT a m b -> CondT a m b

sconcat :: NonEmpty (CondT a m b) -> CondT a m b

stimes :: Integral b => b -> CondT a m b -> CondT a m b

(Monad m, Monoid b) => Monoid (CondT a m b)

Methods

mempty :: CondT a m b

mappend :: CondT a m b -> CondT a m b -> CondT a m b

mconcat :: [CondT a m b] -> CondT a m b

type StM (CondT r m) a

type StM (CondT r m) a

type Cond a = CondT a Identity

Executing CondT

runCondT :: Monad m => CondT a m b -> a -> m (Maybe b)

runCond :: Cond a b -> a -> Maybe b

applyCondT :: Monad m => a -> CondT a m b -> m ((Maybe b, Maybe (CondT a m b)), a)

Case analysis of applying a condition to an input value. The result is a pair whose first part is a pair of Maybes specifying if the input matched and if recursion is expected from this value, and whose second part is the (possibly) mutated input value.

applyCond :: a -> Cond a b -> ((Maybe b, Maybe (Cond a b)), a)

Case analysis of applying a pure condition to an input value. The result is a pair whose first part is a pair of Maybes specifying if the input matched and if recursion is expected from this value, and whose second part is the (possibly) mutated input value.

Promotions

guardM :: Monad m => m Bool -> CondT a m ()

guard_ :: Monad m => (a -> Bool) -> CondT a m ()

guardM_ :: Monad m => (a -> m Bool) -> CondT a m ()

apply :: Monad m => (a -> m (Maybe b)) -> CondT a m b

consider :: Monad m => (a -> m (Maybe (b, a))) -> CondT a m b

Boolean logic

matches :: Monad m => CondT a m b -> CondT a m Bool

Return True or False depending on whether the given condition matches or not. This differs from simply stating the condition in that it itself always succeeds.

>>> flip runCond "foo.hs" $ matches (guard =<< asks (== "foo.hs"))
Just True
>>> flip runCond "foo.hs" $ matches (guard =<< asks (== "foo.hi"))
Just False

if_ :: Monad m => CondT a m r -> CondT a m b -> CondT a m b -> CondT a m b

A variant of ifM which branches on whether the condition succeeds or not. Note that if_ x is equivalent to ifM (matches x), and is provided solely for convenience.

>>> let good = guard_ (== "foo.hs") :: Cond String ()
>>> let bad  = guard_ (== "foo.hi") :: Cond String ()
>>> flip runCond "foo.hs" $ if_ good (return "Success") (return "Failure")
Just "Success"
>>> flip runCond "foo.hs" $ if_ bad (return "Success") (return "Failure")
Just "Failure"

when_ :: Monad m => CondT a m r -> CondT a m () -> CondT a m ()

when_ is just like when, except that it executes the body if the condition passes, rather than based on a Bool value.

>>> let good = guard_ (== "foo.hs") :: Cond String ()
>>> let bad  = guard_ (== "foo.hi") :: Cond String ()
>>> flip runCond "foo.hs" $ when_ good ignore
Nothing
>>> flip runCond "foo.hs" $ when_ bad ignore
Just ()

unless_ :: Monad m => CondT a m r -> CondT a m () -> CondT a m ()

when_ is just like when, except that it executes the body if the condition fails, rather than based on a Bool value.

>>> let good = guard_ (== "foo.hs") :: Cond String ()
>>> let bad  = guard_ (== "foo.hi") :: Cond String ()
>>> flip runCond "foo.hs" $ unless_ bad ignore
Nothing
>>> flip runCond "foo.hs" $ unless_ good ignore
Just ()

or_ :: Monad m => [CondT a m b] -> CondT a m b

Check whether at least one of the given conditions is true. This is a synonym for asum.

>>> let good = guard_ (== "foo.hs") :: Cond String ()
>>> let bad  = guard_ (== "foo.hi") :: Cond String ()
>>> flip runCond "foo.hs" $ or_ [bad, good]
Just ()
>>> flip runCond "foo.hs" $ or_ [bad]
Nothing

and_ :: Monad m => [CondT a m b] -> CondT a m ()

Check that all of the given conditions are true. This is a synonym for sequence_.

>>> let good = guard_ (== "foo.hs") :: Cond String ()
>>> let bad  = guard_ (== "foo.hi") :: Cond String ()
>>> flip runCond "foo.hs" $ and_ [bad, good]
Nothing
>>> flip runCond "foo.hs" $ and_ [good]
Just ()

not_ :: Monad m => CondT a m b -> CondT a m ()

not_ inverts the meaning of the given predicate.

>>> let good = guard_ (== "foo.hs") :: Cond String ()
>>> let bad  = guard_ (== "foo.hi") :: Cond String ()
>>> flip runCond "foo.hs" $ not_ bad >> return "Success"
Just "Success"
>>> flip runCond "foo.hs" $ not_ good >> return "Shouldn't reach here"
Nothing

Basic conditionals

ignore :: Monad m => CondT a m b

ignore ignores the current entry, but allows recursion into its descendents. This is the same as mzero.

norecurse :: Monad m => CondT a m ()

norecurse prevents recursion into the current entry's descendents, but does not ignore the entry itself.

prune :: Monad m => CondT a m b

prune is a synonym for both ignoring an entry and its descendents. It is the same as ignore >> norecurse.

Helper functions

recurse :: Monad m => CondT a m b -> CondT a m b

recurse changes the recursion predicate for any child elements. For example, the following file-finding predicate looks for all *.hs files, but under any .git directory looks only for a file named config:

if_ (name_ ".git" >> directory)
    (ignore >> recurse (name_ "config"))
    (glob "*.hs")

NOTE: If this code had used recurse (glob "*.hs")) instead in the else case, it would have meant that .git is only looked for at the top-level of the search (i.e., the top-most element).

test :: Monad m => a -> CondT a m b -> m Bool

A specialized variant of runCondT that simply returns True or False.

>>> let good = guard_ (== "foo.hs") :: Cond String ()
>>> let bad  = guard_ (== "foo.hi") :: Cond String ()
>>> runIdentity $ test "foo.hs" $ not_ bad >> return "Success"
True
>>> runIdentity $ test "foo.hs" $ not_ good >> return "Shouldn't reach here"
False

Isomorphism with a stateful EitherT

newtype CondEitherT a m b

This type is for documentation only, and shows the isomorphism between CondT and CondEitherT. The reason for using Result is that it makes meaning of the constructors more explicit.

Constructors

CondEitherT (StateT a (EitherT (Maybe (Maybe (CondEitherT a m b))) m) (b, Maybe (Maybe (CondEitherT a m b))))

fromCondT :: Monad m => CondT a m b -> CondEitherT a m b

Witness one half of the isomorphism from CondT to CondEitherT.

toCondT :: Monad m => CondEitherT a m b -> CondT a m b

Witness the other half of the isomorphism from CondEitherT to CondT.