glibmm 2.4: Member List

Main Page glibmm Namespaces Book

# Glib::Tree<T> Member List

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

append(Tree<T>& node) | Glib::Tree<T> | `[inline]`
append_data(T& data) | Glib::Tree<T> | `[inline]`
child_count() const | Glib::Tree<T> | `[inline]`
children_ | Glib::Tree<T> | `[protected]`
data() const | Glib::Tree<T> | `[inline]`
depth() const | Glib::Tree<T> | `[inline]`
find(TraverseType order, TraverseFlags flags, const T& data) const | Glib::Tree<T> | `[inline]`
find_child(TraverseFlags flags, const T& data) const | Glib::Tree<T> | `[inline]`
first_child() const | Glib::Tree<T> | `[inline]`
first_sibling() const | Glib::Tree<T> | `[inline]`
foreach(TraverseFlags flags, ForeachFunc func) | Glib::Tree<T> | `[inline]`
ForeachFunc typedef | Glib::Tree<T> |
gobj() | Glib::Tree<T> | `[inline]`
gobj() const | Glib::Tree<T> | `[inline]`
gobject_ | Glib::Tree<T> | `[protected]`
index_of(const T& data) const | Glib::Tree<T> | `[inline]`
insert(int position, Tree<T>& node) | Glib::Tree<T> | `[inline]`
insert_after(Tree<T>& sibling, Tree<T>& node) | Glib::Tree<T> | `[inline]`
insert_before(Tree<T>& sibling, Tree<T>& node) | Glib::Tree<T> | `[inline]`
insert_data(int position, T& data) | Glib::Tree<T> | `[inline]`
insert_data_before(Tree<T>& sibling, T& data) | Glib::Tree<T> | `[inline]`
is_ancestor(const Tree<T>& descendant) const | Glib::Tree<T> | `[inline]`
is_leaf() const | Glib::Tree<T> | `[inline]`
is_root() const | Glib::Tree<T> | `[inline]`
iter() const | Glib::Tree<T> | `[inline]`
iterator typedef | Glib::Tree<T> |
last_child() const | Glib::Tree<T> | `[inline]`
last_sibling() const | Glib::Tree<T> | `[inline]`
lookup(const iterator child) const | Glib::Tree<T> | `[inline]`
max_height() const | Glib::Tree<T> | `[inline]`
next_sibling() const | Glib::Tree<T> | `[inline]`
node_count(TraverseFlags flags) const | Glib::Tree<T> | `[inline]`
NodeMap typedef | Glib::Tree<T> |
nth_child(int n) const | Glib::Tree<T> | `[inline]`
on_compare_child(GNode* node, const T& needle, GNode* result) | Glib::Tree<T> | `[inline, protected, static]`
on_compare_node(GNode* node, const T& needle, GNode** result) | Glib::Tree<T> | `[inline, protected, static]`
on_wrap_compare_child(GNode* node, gpointer data) | Glib::Tree<T> | `[inline, protected, static]`
on_wrap_compare_node(GNode* node, gpointer data) | Glib::Tree<T> | `[inline, protected, static]`
owns_gobject_ | Glib::Tree<T> | `[protected]`
parent(Tree<T>* newparent=0) | Glib::Tree<T> | `[inline, protected]`
parent_ | Glib::Tree<T> | `[protected]`
position_of(const Tree<T>& child) const | Glib::Tree<T> | `[inline]`
prepend(Tree<T>& node) | Glib::Tree<T> | `[inline]`
prepend_data(T& data) | Glib::Tree<T> | `[inline]`
prev_sibling() const | Glib::Tree<T> | `[inline]`
reverse_children() | Glib::Tree<T> | `[inline]`
root() const | Glib::Tree<T> | `[inline]`
traverse(TraverseType order, TraverseFlags flags, int max_depth, TraverseFunc func) | Glib::Tree<T> | `[inline]`
TraverseFunc typedef | Glib::Tree<T> |
Tree() | Glib::Tree<T> | `[inline]`
Tree(T& data) | Glib::Tree<T> | `[inline, explicit]`
type_foreach_gnode_slot typedef | Glib::Tree<T> | `[protected]`
type_traverse_gnode_slot typedef | Glib::Tree<T> | `[protected]`
unlink(Tree<T>& child) | Glib::Tree<T> | `[inline]`
wrap_foreach_slot(GNode* node, gpointer slot) | Glib::Tree<T> | `[inline, protected, static]`
wrap_traverse_slot(GNode* node, gpointer slot) | Glib::Tree<T> | `[inline, protected, static]`
~Tree() | Glib::Tree<T> | `[inline]`