INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Add `v' as new child.
-- Add `v' to the list of children.
-- Do not move child cursor.
-- Add `v' to the left of cursor position.
-- Do not move child cursor.
-- Add `v' to the right of cursor position.
-- Do not move child cursor.
-- Add `n' to the list of children.
-- Do not move child cursor.
-- Add `n' to the left of cursor position.
-- Do not move cursor.
-- Add `n' to the right of cursor position.
-- Do not move cursor.
-- Merge children of `other' into current structure
-- after cursor position. Do not move cursor.
-- Make `other' a leaf.
-- Merge children of `other' into current structure
-- after cursor position. Do not move cursor.
-- Make `other' a leaf.
-- Remove item to the left of cursor position.
-- Do not move cursor.
-- Remove item to the right of cursor position.
-- Do not move cursor.
-- Remove child at cursor position.
-- Move cursor to next sibling, or `after' if none.
-- Remove all child
-- Fill from a binary tree representation.
-- Left child becomes first child.
-- Right child becomes right sibling.
-- Any right child of `b' is ignored.
-- Copy of sub-tree beginning at cursor position and
-- having min (`n', `arity' - `child_index' + 1)
-- children
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |