Main Page glibmm Namespaces Book

# Glib::NodeTree<T> Member List

This is the complete list of members for Glib::NodeTree<T>, including all inherited members.

append(NodeTree<T>& node) | Glib::NodeTree<T> | `[inline]`
append_data(const T& the_data) | Glib::NodeTree<T> | `[inline]`
child_count() const | Glib::NodeTree<T> | `[inline]`
child_index(const T& the_data) const | Glib::NodeTree<T> | `[inline]`
child_position(const NodeTree<T>& child) const | Glib::NodeTree<T> | `[inline]`
data() | Glib::NodeTree<T> | `[inline]`
data() const | Glib::NodeTree<T> | `[inline]`
depth() const | Glib::NodeTree<T> | `[inline]`
find(const T& the_data, TraverseType order=TRAVERSE_IN_ORDER, TraverseFlags flags=TRAVERSE_ALL) | Glib::NodeTree<T> | `[inline]`
find(const T& the_data, TraverseType order=TRAVERSE_IN_ORDER, TraverseFlags flags=TRAVERSE_ALL) const | Glib::NodeTree<T> | `[inline]`
find_child(const T& the_data, TraverseFlags flags=TRAVERSE_ALL) | Glib::NodeTree<T> | `[inline]`
find_child(const T& the_data, TraverseFlags flags=TRAVERSE_ALL) const | Glib::NodeTree<T> | `[inline]`
first_child() | Glib::NodeTree<T> | `[inline]`
first_child() const | Glib::NodeTree<T> | `[inline]`
first_sibling() | Glib::NodeTree<T> | `[inline]`
first_sibling() const | Glib::NodeTree<T> | `[inline]`
foreach(const ForeachFunc& func, TraverseFlags flags=TRAVERSE_ALL) | Glib::NodeTree<T> | `[inline]`
ForeachFunc typedef | Glib::NodeTree<T> |
get_max_height() const | Glib::NodeTree<T> | `[inline]`
get_root() | Glib::NodeTree<T> | `[inline]`
get_root() const | Glib::NodeTree<T> | `[inline]`
gobj() | Glib::NodeTree<T> | `[inline]`
gobj() const | Glib::NodeTree<T> | `[inline]`
insert(int position, NodeTree<T>& node) | Glib::NodeTree<T> | `[inline]`
insert_after(NodeTree<T>& sibling, NodeTree<T>& node) | Glib::NodeTree<T> | `[inline]`
insert_before(NodeTree<T>& sibling, NodeTree<T>& node) | Glib::NodeTree<T> | `[inline]`
insert_data(int position, const T& the_data) | Glib::NodeTree<T> | `[inline]`
insert_data_before(NodeTree<T>& sibling, const T& the_data) | Glib::NodeTree<T> | `[inline]`
is_ancestor(const NodeTree<T>& descendant) const | Glib::NodeTree<T> | `[inline]`
is_leaf() const | Glib::NodeTree<T> | `[inline]`
is_root() const | Glib::NodeTree<T> | `[inline]`
last_child() | Glib::NodeTree<T> | `[inline]`
last_child() const | Glib::NodeTree<T> | `[inline]`
last_sibling() | Glib::NodeTree<T> | `[inline]`
last_sibling() const | Glib::NodeTree<T> | `[inline]`
next_sibling() | Glib::NodeTree<T> | `[inline]`
next_sibling() const | Glib::NodeTree<T> | `[inline]`
node_count(TraverseFlags flags=TRAVERSE_ALL) const | Glib::NodeTree<T> | `[inline]`
NodeTree() | Glib::NodeTree<T> | `[inline]`
NodeTree(const T& the_data) | Glib::NodeTree<T> | `[inline, explicit]`
NodeTree(const NodeTree<T>& node) | Glib::NodeTree<T> | `[inline]`
nth_child(int n) | Glib::NodeTree<T> | `[inline]`
nth_child(int n) const | Glib::NodeTree<T> | `[inline]`
operator=(const NodeTree<T>& node) | Glib::NodeTree<T> | `[inline]`
parent() const | Glib::NodeTree<T> | `[inline]`
prepend(NodeTree<T>& node) | Glib::NodeTree<T> | `[inline]`
prepend_data(const T& the_data) | Glib::NodeTree<T> | `[inline]`
prev_sibling() | Glib::NodeTree<T> | `[inline]`
prev_sibling() const | Glib::NodeTree<T> | `[inline]`
reverse_children() | Glib::NodeTree<T> | `[inline]`
traverse(const TraverseFunc& func, TraverseType order=TRAVERSE_IN_ORDER, TraverseFlags flags=TRAVERSE_ALL, int max_depth=-1) | Glib::NodeTree<T> | `[inline]`
TRAVERSE_ALL enum value | Glib::NodeTree<T> |
TRAVERSE_LEAVES enum value | Glib::NodeTree<T> |
TRAVERSE_MASK enum value | Glib::NodeTree<T> |
TRAVERSE_NON_LEAVES enum value | Glib::NodeTree<T> |
TraverseFlags enum name | Glib::NodeTree<T> |
TraverseFunc typedef | Glib::NodeTree<T> |
unlink() | Glib::NodeTree<T> | `[inline]`
~NodeTree() | Glib::NodeTree<T> | `[inline]`