Documentation

Multary (Rose) Tree, with data solely in leaves

Constructors

Stem (LForest v a)
Leaf a

Instances

Functor v => Functor (LTree v)
Functor v => Applicative (LTree v)
Foldable v => Foldable (LTree v)
Traversable v => Traversable (LTree v)
(Eq a, Eq (LForest v a)) => Eq (LTree v a)

type LForest v a = v (LTree v a)Source

unfoldLTree :: Functor v => (b -> Either a (v b)) -> b -> LTree v aSource

unfoldLTreeM :: (Monad m, Traversable v) => (b -> m (Either a (v b))) -> b -> m (LTree v a)Source