acceptVisitor(NodeVisitorBase< Node< _TContent >, NormalNode< _TContent >, RootNode< _TContent > > *visitor) | NormalNode | [virtual] |
acceptVisitor(NodeVisitorBase< const Node< _TContent >, const NormalNode< _TContent >, const RootNode< _TContent > > *visitor) const | NormalNode | [virtual] |
addChild(Node *node) | Node | [virtual] |
addChild(Node *node, unsigned int index) | Node | [virtual] |
addChild(Node *node, typename std::list< Node * >::iterator &iter) | Node | [virtual] |
addChildBack(Node *node) | Node | [virtual] |
addChildFront(Node *node) | Node | [virtual] |
all_iterator typedef | Node | |
begin() | Node | [inline, virtual] |
begin() const | Node | [inline, virtual] |
beginAll() | Node | [inline, virtual] |
beginAll() const | Node | [inline, virtual] |
beginAllConst() const | Node | [inline, virtual] |
cloneNode() const | NormalNode | [virtual] |
cloneTree() const | NormalNode | [virtual] |
const_all_iterator typedef | Node | |
const_iterator typedef | Node | |
const_leave_iterator typedef | Node | |
const_pointer typedef | NormalNode | |
const_post_iterator typedef | Node | |
const_reference typedef | NormalNode | |
const_reverse_iterator typedef | Node | |
const_var_iterator typedef | Node | |
construct() const | NormalNode | [inline, virtual] |
copy(OldNewMap &nodeMap) const | NormalNode | [protected, virtual] |
cutChild(Node *node) | Node | [virtual] |
deleteChild(Node *node) | Node | [virtual] |
deleteParent() | Node | [protected, virtual] |
difference_type typedef | NormalNode | |
disconnectChildren() | Node | [protected, virtual] |
end() | Node | [inline, virtual] |
end() const | Node | [inline, virtual] |
endAll() | Node | [inline, virtual] |
endAll() const | Node | [inline, virtual] |
getChildren() const | Node | [inline, virtual] |
getContent() | Node | [inline, virtual] |
getContent() const | Node | [inline, virtual] |
getDepth() const | Node | [virtual] |
getLeaves() const | Node | [inline, virtual] |
getLeftSibling() | Node | [inline, virtual] |
getLeftSibling() const | Node | [inline, virtual] |
getName() const | Node | [inline, virtual] |
getNumChildren() const | Node | [inline, virtual] |
getNumDescendants() const | Node | [inline, virtual] |
getParent() | Node | [inline, virtual] |
getParent() const | Node | [inline, virtual] |
getRightSibling() | Node | [inline, virtual] |
getRightSibling() const | Node | [inline, virtual] |
getRoot() | Node | [inline, virtual] |
getRoot() const | Node | [inline, virtual] |
isFixed() const | Node | [inline, virtual] |
isInner() const | Node | [protected, virtual] |
isProtected() const | Node | [inline, protected, virtual] |
isRootNode() const | Node | [inline, virtual] |
iterator typedef | Node | |
leave_iterator typedef | Node | |
linkSiblings() | Node | [protected, virtual] |
m_children | Node | [protected] |
m_content | Node | [protected] |
m_fixed | Node | [protected] |
m_left_sibling | Node | [protected] |
m_name | Node | [protected] |
m_parent | Node | [protected] |
m_protected | Node | [protected] |
m_repairIter | Node | [protected] |
m_right_sibling | Node | [protected] |
m_root | Node | [protected] |
Node() | Node | [explicit] |
Node(const Node< _TContent > &node) | Node | [explicit] |
Node(const _TContent &content) | Node | [explicit] |
NormalNode< _TContent > class | Node | [friend] |
OldNewMap typedef | NormalNode | [protected] |
pointer typedef | NormalNode | |
post_iterator typedef | Node | |
recalcLeaves() | Node | [inline, virtual] |
reduce() | Node | [virtual] |
reference typedef | NormalNode | |
reverse_iterator typedef | Node | |
RootNode< _TContent > class | Node | [friend] |
setFixed(bool b) | Node | [inline, virtual] |
setName(std::string name) | Node | [inline, virtual] |
setParent(Node *node) | Node | [protected, virtual] |
setProtected(bool) | Node | [inline, protected, virtual] |
size_type typedef | NormalNode | |
value_type typedef | NormalNode | |
var_iterator typedef | Node | |
~Node() | Node | [virtual] |
~NormalNode() | NormalNode | [inline, virtual] |