Sets our main struct and passes it to the parent class.
Creates a new glib.Node containing the given data. Used to create the first node in a tree.
A destructor is present on this object, but not explicitly documented in the source.
Gets the position of the first child of a glib.Node which contains the given data.
Gets the position of a glib.Node with respect to its siblings. child must be a child of node. The first child is numbered 0, the second 1, and so on.
Calls a function for each of the children of a glib.Node Note that it doesn't descend beneath the child nodes. func must not do anything that would modify the structure of the tree.
Recursively copies a glib.Node and its data.
Gets the depth of a glib.Node
Removes root and its children from the tree, freeing any memory allocated.
Finds a glib.Node in a tree.
Finds the first child of a glib.Node with the given data.
Gets the first sibling of a glib.Node This could possibly be the node itself.
Get the main Gtk struct
Gets the root of a tree.
the main Gtk struct as a void*
Inserts a glib.Node beneath the parent at the given position.
Inserts a glib.Node beneath the parent after the given sibling.
Inserts a glib.Node beneath the parent before the given sibling.
Returns TRUE if node is an ancestor of descendant. This is true if node is the parent of descendant, or if node is the grandparent of descendant etc.
Gets the last child of a glib.Node
Gets the last sibling of a glib.Node This could possibly be the node itself.
Gets the number of children of a glib.Node
Gets the number of nodes in a tree.
Gets a child of a glib.Node, using the given index. The first child is at index 0. If the index is too big, NULL is returned.
Inserts a glib.Node as the first child of the given parent.
Reverses the order of the children of a glib.Node (It doesn't change the order of the grandchildren.)
Traverses a tree starting at the given root glib.Node It calls the given function for each node visited. The traversal can be halted at any point by returning TRUE from func. func must not do anything that would modify the structure of the tree.
Unlinks a glib.Node from a tree, resulting in two separate trees.
points to the first child of the glib.Node The other children are accessed by using the next pointer of each child.
contains the actual data of the node.
points to the node's next sibling (a sibling is another glib.Node with the same parent).
points to the node's previous sibling.
the main Gtk struct