Safe Haskell | None |
---|

Some more utilities for Data.Tree.

## Synopsis

- edges :: [Tree.Tree a] -> [(a, a)]
- paths :: [Tree.Tree a] -> [(Tree.Tree a, [Tree.Tree a])]
- flat_paths :: [Tree.Tree a] -> [(a, [a], [a])]
- find :: (a -> Bool) -> [Tree.Tree a] -> Maybe (Tree.Tree a)
- find_with_parents :: (a -> Bool) -> [Tree.Tree a] -> Maybe (Tree.Tree a, [Tree.Tree a])
- leaves :: Tree.Tree a -> [a]
- filter :: (a -> Bool) -> [Tree.Tree a] -> [Tree.Tree a]

# Documentation

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.

:: [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.