Karya, built on 2022-03-21T01:30:44 (patch 89d1651424c35e564138d93424a157ff87457245)
Safe HaskellSafe-Inferred



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.

flatPaths 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.

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

Return the unmodified subtrees that match the predicate. This is like find, except that it returns all matching subtrees instead of the first one.

findWithParents :: (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 -> Maybe (Tree.Tree a) Source #

Filter out nodes that don't match.