Tree traversal functions |
|
| return parent of <parameter>n</parameter> |
|
| return first daughter of <parameter>n</parameter> |
|
| return second daughter of <parameter>n</parameter> |
|
| return nth daughter of <parameter>n</parameter> |
|
| return last daughter of <parameter>n</parameter> |
|
| return next sibling (sister) of <parameter>n</parameter> |
|
| return previous sibling (sister) of <parameter>n</parameter> |
|
| return root node of treeprevious sibling (sister) of <parameter>n</parameter> |
|
| return parent of <parameter>n</parameter> as seen from relation <parameter>relname</parameter> |
|
| return first daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter> |
|
| return second daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter> |
|
| return last daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter> |
|
| return next sibling (sister) of <parameter>n</parameter> as seen from relation <parameter>relname</parameter> |
|
| return previous sibling (sistem) of <parameter>n</parameter> as seen from relation <parameter>relname</parameter> |
|
| return root of tree of <parameter>n</parameter> as seen from relation <parameter>relname</parameter> |
|
| return the first leaf (terminal node) which is dominated by <parameter>n</parameter>. |
|
| return the last leaf (terminal node) which is dominated by <parameter>n</parameter>. |
|
| Return next leaf in tree given <parameter>n</parameter>. |
|
| Return number of leaves (terminal nodes) under <parameter>n</parameter> |
|
| Given a node <parameter>t</parameter>, return true if <parameter>c</parameter> is under it in a tree |
Alphabetic index Hierarchy of classes
This page is part of the
Edinburgh Speech Tools Library documentation
Copyright University of Edinburgh 1997
Contact:
speech_tools@cstr.ed.ac.uk