Karya, built on 2020-11-26T21:03:17 (patch 23b5be2d53a9e8e7d6136cda5aae2849abe5cded)
Safe HaskellNone



Some more utilities for Data.Tree.



edges :: [Tree.Tree a] -> [(a, a)] Source #

The edges of a forest, as (parent, child).

paths :: [Tree.Tree a] -> [(Tree.Tree a, [Tree.Tree a])] Source #

Get every element along with its parents. The parents are closest first root last.

flat_paths Source #


:: [Tree.Tree a] 
-> [(a, [a], [a])]

(element, parents, children). Parents are closest first root last, children are in depth first order.

Like paths but the parents and children have been flattened.

find :: (a -> Bool) -> [Tree.Tree a] -> Maybe (Tree.Tree a) Source #

Given a predicate, return the first depthwise matching element and its children.

find_with_parents :: (a -> Bool) -> [Tree.Tree a] -> Maybe (Tree.Tree a, [Tree.Tree a]) Source #

Like paths, but return only the element that matches the predicate.

leaves :: Tree.Tree a -> [a] Source #

Get all leaves. The list will never be null.

filter :: (a -> Bool) -> [Tree.Tree a] -> [Tree.Tree a] Source #

Return the first subtrees that match the predicate.