|Find things in a syntax tree.
|Lookup all the things in a certain region.
|Returns the deepest leaf, together with the path to this leaf. For
example, for the following tree with root A:
A -+- B --- C
'- D --- E --- F
this function will return:
(F, [E, D, A])
If F were missing the result is either (C, [B,A]) or (E, [D,A]).
|Produced by Haddock version 2.4.2|