|Generic syntax tree handling functions
|subtrees :: tree t -> [tree t]||Source|
|Direct subtrees of a tree
|uniplate :: tree t -> ([tree t], [tree t] -> tree t)||Source|
|Return the 1st token of a subtree.
|Return the last token of a subtree.
|Search the given list, and return the last tree before the given
point; with path to the root. (Root is at the start of the path)
|Return all subtrees in a tree, in preorder.
|tokenBasedStrokes :: Foldable t3 => (a -> b) -> t3 a -> t -> t2 -> t1 -> [b]||Source|
|Search the tree in pre-order starting at a given node, until finding a leaf which is at
or after the given point. An effort is also made to return a leaf as close as possible to p.
TODO: rename to fromLeafToLeafAt
|Given an approximate path to a leaf at the end of the region, return:
(path to leaf at the end of the region,path from focused node to the leaf, small node encompassing the region)
|Produced by Haddock version 2.6.1|