A rose tree.
Modulehedgehog-1.7Haskell2010
Hedgehog.Internal.Tree
Synopsis
- type Tree
- pattern Tree
- newtype TreeT
- value runTree
- value mapTreeT
- value treeValue
- value treeChildren
- type Node
- pattern Node
- data NodeT
- value fromNodeT
- value unfold
- value unfoldForest
- value expand
- value prune
- value catMaybes
- value filter
- value mapMaybe
- value filterMaybeT
- value mapMaybeMaybeT
- value filterT
- value consChild
- value mapMaybeT
- value depth
- value interleave
- value render
- value renderT
- Packagehedgehog-1.7
- Exports27
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceTree.hs
Pattern to ease construction / deconstruction of pure trees.
An effectful tree, each node in the tree can have an effect before it is produced.
Instances29Foldable, Traversable, MonadTrans, MMonad, MonadTransDistributive, MFunctor, …
Foldable TreeDefined in hedgehog-1.7 · Hedgehog.Internal.TreeTraversable TreeDefined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadTrans TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.TreeMMonad TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadTransDistributive TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.TreeMFunctor TreeTDefined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadError e m => MonadError e (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadReader r m => MonadReader r (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadState s m => MonadState s (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadWriter w m => MonadWriter w (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadBase b m => MonadBase b (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadBaseControl b m => MonadBaseControl b (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonad m => Monad (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeFunctor m => Functor (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeApplicative m => Applicative (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeAlternative m => Alternative (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadPlus m => MonadPlus (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadIO m => MonadIO (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonad m => MonadZip (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeShow1 m => Show1 (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadCatch m => MonadCatch (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadThrow m => MonadThrow (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreePrimMonad m => PrimMonad (TreeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeMonadResource 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.Treetype PrimState (TreeT m) = PrimState mDefined in hedgehog-1.7 · Hedgehog.Internal.Treetype StM (TreeT m) a = StM m (NodeT m a)Defined in hedgehog-1.7 · Hedgehog.Internal.Treetype 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
Map between TreeT computations.
The value at the root of the Tree.
The children of the Tree.
A node in a rose tree.
Pattern to ease construction / deconstruction of pure nodes.
A node in an effectful tree, as well as its unevaluated children.
Instances9Foldable, Traversable, MFunctor, Monad, Functor, Applicative, …
Foldable NodeDefined in hedgehog-1.7 · Hedgehog.Internal.TreeTraversable NodeDefined in hedgehog-1.7 · Hedgehog.Internal.TreeMFunctor NodeTDefined in hedgehog-1.7 · Hedgehog.Internal.TreeMonad m => Monad (NodeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeFunctor m => Functor (NodeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeApplicative m => Applicative (NodeT m)Defined in hedgehog-1.7 · Hedgehog.Internal.TreeShow1 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
Create a tree from a value and an unfolding function.
Create a forest from a value and an unfolding function.
Expand a tree using an unfolding function.
Throw away all but the top n levels of a tree's children.
prune 0 will throw away all of a tree's children.
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.
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.
Returns a tree containing only elements that match the predicate.
When an element does not match the predicate its node is replaced with empty.
Returns the depth of the deepest leaf node in the tree.
Render a tree of strings.
Render a tree of strings, note that this forces all the delayed effects in the tree.