Îõ³h&€      Safe-Inferred89:Ñæ  data-forest$A tree is defined completely by its  and its .To construct a tree, use  or . data-forest'The value at the root node of the tree. data-forest7The forest containing all descendants of the tree's . data-forest&A forest is defined completely by its .To construct a forest, use  or . data-forest%The trees that constitute the forest. data-forest(Construct a forest from a list of trees. [] is equivalent to . data-forest5Construct a tree with a single root and no subforest. x is equivalent to  x . data-forestÄConstruct a forest of depth 1, where each tree contains only a root. is equivalent to  . fmap  data-forest+Construct a tree with a root and subforest.  data-forestThe tree's immediate subtrees.  is equivalent to  . .  data-forestCatamorphism on forests. :{example :: Forest Charexample = forest [ tree 'a' $ leaves "bc" , tree 'd' $ forest [ leaf 'e' , tree 'f' $ leaves "g" ] ]:}ÑfoldForest (intercalate ", " . fmap (\(a, b) -> [a] <> " [" <> b <> "]")) example$"a [b [], c []], d [e [], f [g []]]"  data-forestCatamorphism on trees. :{example :: Tree Charexample = tree 'a' $ forest [ tree 'b' $ leaves "cd" , tree 'e' $ forest [ leaf 'f' , tree 'g' $ leaves "h" ] ]:}ÅfoldTree (\a bs -> [a] <> " [" <> intercalate ", " bs <> "]") example("a [b [c [], d []], e [f [], g [h []]]]"        +data-forest-0.1.0.10-JJHXxmUjhyxI3SHIGxnfCC Data.ForestTreeroot subforestForesttreesforestleafleavestreesubtrees foldForestfoldTree$fEqTree $fShowTree $fFunctorTree$fFoldableTree$fTraversableTree $fEqForest $fShowForest$fFunctorForest$fFoldableForest$fTraversableForest$fSemigroupForest$fMonoidForestbaseGHC.Basemempty