#include <detree.h>
| Public Methods | |
| iterator | begin (void) | 
| iterator | end (void) | 
| iterator | append_child (iterator, T) | 
| iterator | insert (iterator, T) | 
| iterator | replace (iterator, T) | 
| iterator | erase (iterator) | 
| Public Attributes | |
| friend | iterator | 
Definition at line 29 of file detree.h.
| 
 | |||||||||||||||||||
| appends T at the end of the sibling list specified by the iterator | 
| 
 | ||||||||||
| 
 
 | 
| 
 | ||||||||||
| 
 
 | 
| 
 | ||||||||||
| erases the iterator's current node | 
| 
 | |||||||||||||||||||
| insert T at the current position of the iterator | 
| 
 | |||||||||||||||||||
| replaces T at the position of the iterator | 
| 
 | |||||
| 
 Definition at line 115 of file detree.h. Referenced by append_child(), begin(), end(), and insert(). 
 | 
 1.2.9.1 written by Dimitri van Heesch,
 © 1997-2001
1.2.9.1 written by Dimitri van Heesch,
 © 1997-2001