Modulehedgehog-1.7Haskell2010

Hedgehog.Internal.Tree

4 types
21 values

Packagehedgehog-1.7
Exports27
LanguageHaskell2010
LicenceBSD-3-Clause
SourceTree.hs

typetype Tree = TreeT Identity

A rose tree.

patternpattern Tree :: NodeT Identity a -> Tree a

Pattern to ease construction / deconstruction of pure trees.

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

An effectful tree, each node in the tree can have an effect before it is produced.

Constructors

TreeT
- runTreeT :: m (NodeT m a)

Instances29Foldable, Traversable, MonadTrans, MMonad, MonadTransDistributive, MFunctor, …

Foldable TreeDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
Traversable TreeDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadTrans TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
MMonad TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadTransDistributive TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
MFunctor TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadError e m => MonadError e (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadReader r m => MonadReader r (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadState s m => MonadState s (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadWriter w m => MonadWriter w (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadBase b m => MonadBase b (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadBaseControl b m => MonadBaseControl b (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Monad m => Monad (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Functor m => Functor (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Applicative m => Applicative (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Alternative m => Alternative (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadPlus m => MonadPlus (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadIO m => MonadIO (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Monad m => MonadZip (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Show1 m => Show1 (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadCatch m => MonadCatch (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadThrow m => MonadThrow (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
PrimMonad m => PrimMonad (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
MonadResource m => MonadResource (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
(Eq1 m, Eq a) => Eq (TreeT m a)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
(Show1 m, Show a) => Show (TreeT m a)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
type PrimState (TreeT m) = PrimState mDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
type StM (TreeT m) a = StM m (NodeT m a)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
type Transformer f TreeT m = (Monad m, Monad (f m), Monad (TreeT m), Monad (f (TreeT m)), MonadTrans f, MFunctor f)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree

valuerunTree :: Tree a -> Node a

Extracts the Node from a Tree.

valuemapTreeT :: (m (NodeT m a) -> m (NodeT m a)) -> TreeT m a -> TreeT m a

Map between TreeT computations.

valuetreeValue :: Tree a -> a

The value at the root of the Tree.

valuetreeChildren :: Tree a -> [Tree a]

The children of the Tree.

typetype Node = NodeT Identity

A node in a rose tree.

patternpattern Node :: a -> [Tree a] -> Node a

Pattern to ease construction / deconstruction of pure nodes.

datadata NodeT (m :: Type -> Type) a

A node in an effectful tree, as well as its unevaluated children.

Constructors

NodeT
- nodeValue :: a
  The value at this NodeT in the TreeT.
- nodeChildren :: [TreeT m a]
  The children of this NodeT.

Instances9Foldable, Traversable, MFunctor, Monad, Functor, Applicative, …

Foldable NodeDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
Traversable NodeDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
MFunctor NodeTDefined in hedgehog-1.7 · Hedgehog.Internal.Tree
Monad m => Monad (NodeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Functor m => Functor (NodeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Applicative m => Applicative (NodeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
Show1 m => Show1 (NodeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
(Eq a, Eq1 m) => Eq (NodeT m a)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree
(Show1 m, Show a) => Show (NodeT m a)Defined in hedgehog-1.7 · Hedgehog.Internal.Tree

valuefromNodeT :: Applicative m => NodeT m a -> TreeT m a

Create a TreeT from a NodeT

valueunfold :: Monad m => (a -> [a]) -> a -> TreeT m a

Create a tree from a value and an unfolding function.

valueunfoldForest :: Monad m => (a -> [a]) -> a -> [TreeT m a]

Create a forest from a value and an unfolding function.

valueexpand :: Monad m => (a -> [a]) -> TreeT m a -> TreeT m a

Expand a tree using an unfolding function.

valueprune :: Monad m => Int -> TreeT m a -> TreeT m a

Throw away all but the top n levels of a tree's children.

prune 0 will throw away all of a tree's children.

valuecatMaybes :: Tree (Maybe a) -> Maybe (Tree a)

Takes a tree of Maybes and returns a tree of all the Just values.

If the root of the tree is Nothing then Nothing is returned.

valuefilter :: (a -> Bool) -> Tree a -> Maybe (Tree a)

Returns a tree containing only elements that match the predicate.

If the root of the tree does not match the predicate then Nothing is returned.

valuemapMaybe :: (a -> Maybe b) -> Tree a -> Maybe (Tree b)

valuefilterMaybeT

:: a -> Bool
-> TreeT (MaybeT Identity) a
-> TreeT (MaybeT Identity) a

Returns a tree containing only elements that match the predicate.

If the root of the tree does not match the predicate then Nothing is returned.

valuemapMaybeMaybeT

:: a -> Maybe b
-> TreeT (MaybeT Identity) a
-> TreeT (MaybeT Identity) b

valuefilterT :: (Monad m, Alternative m) => (a -> Bool) -> TreeT m a -> TreeT m a

Returns a tree containing only elements that match the predicate.

When an element does not match the predicate its node is replaced with empty.

valueconsChild :: Monad m => a -> TreeT m a -> TreeT m a

valuemapMaybeT

:: (Monad m, Alternative m)
=> a -> Maybe b
-> TreeT m a
-> TreeT m b

valuedepth :: Tree a -> Int

Returns the depth of the deepest leaf node in the tree.

valueinterleave :: Monad m => [NodeT m a] -> NodeT m [a]

valuerender :: Tree String -> String

Render a tree of strings.

valuerenderT :: Monad m => TreeT m String -> m String

Render a tree of strings, note that this forces all the delayed effects in the tree.