Node

---

Object Hierarchy:

Description:

Content:

Creation methods:

• public Node (owned G data = null)

Methods:

• public Node<weak G> copy ()
• public unowned Node<G> insert (int position, owned Node<G> node)
• public unowned Node<G> insert_before (Node<G> sibling, owned Node<G> node)
• public unowned Node<G> insert_after (Node<G> sibling, owned Node<G> node)
• public unowned Node<G> append (owned Node<G> node)
• public unowned Node<G> prepend (owned Node<G> node)
• public unowned Node<G> insert_data (int position, owned G data)
• public unowned Node<G> insert_data_before (Node<G> sibling, owned G data)
• public unowned Node<G> append_data (owned G data)
• public unowned Node<G> prepend_data (owned G data)
• public void reverse_children ()
• public void traverse (TraverseType order, TraverseFlags flags, int max_depth, NodeTraverseFunc func)
• public void children_foreach (TraverseFlags flags, NodeForeachFunc func)
• public unowned Node<G> get_root ()
• public unowned Node<G> find (TraverseType order, TraverseFlags flags, G data)
• public unowned Node<G> find_child (TraverseFlags flags, G data)
• public int child_index (G data)
• public int child_position (Node<G> child)
• public unowned Node<G> first_child ()
• public unowned Node<G> last_child ()
• public unowned Node<G> nth_child (uint n)
• public unowned Node<G> first_sibling ()
• public unowned Node<G> next_sibling ()
• public unowned Node<G> prev_sibling ()
• public unowned Node<G> last_sibling ()
• public bool is_leaf ()
• public bool is_root ()
• public bool is_ancestor (Node<G> descendant)
• public uint depth ()
• public uint n_nodes (TraverseFlags flags)
• public uint n_children ()
• public uint max_height ()
• public void _unlink ()
• public Node<G> unlink ()

Fields:

• public G data
• public Node next
• public Node prev
• public Node parent
• public Node children