INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Create node with item `v'.
-- Allocate space for `n' children.
-- Left neighbor if any
-- Right neighbor if any
-- Replace current child item with `v'.
-- Make `n' the node's current child.
-- Add `v' at end.
-- 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 left of cursor position.
-- Do not move cursor.
-- Add `n' to the right of the cursor position.
-- Do not move cursor.
-- Add `n' to the list of children.
-- Do not move child cursor.
-- Merge children of `other' into current structure
-- before 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 child at cursor position.
-- Move cursor to the next sibling, or `after' if none.
-- Remove item to the left of cursor position.
-- Do not move cursor.
-- Remove item to the right of cursor position.
-- Do not move cursor.
-- Copy of sub-tree beginning at cursor position and
-- having min (`n', `arity' - `child_index' + 1)
-- children.
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |