INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Current child node
-- Item in current node
-- Item in current child node
-- Current cursor position
-- Index of current child
-- Leftmost child
-- Right most child
-- Left neighbor (if any)
-- Right neighbor (if any)
-- Does subtree include `v'?
-- (Reference or object equality,
-- based on `object_comparison'.)
-- Are current node and `other' siblings?
-- Number of children
-- Number of items
-- Is there a current `child_item' to be read?
-- Is there a current child to be read?
-- Is there a current `child_item' that may be modified?
-- Is there a current child that may be modified?
-- Is there no current child?
-- Is there no valid child position to the left of cursor?
-- Is there no valid child position to the right of cursor?
-- Is structure empty of items?
-- Are there no children?
-- Is there no parent?
-- Is cursor under first child?
-- Is cursor under last child?
-- Is `i' correctly bounded for cursor movement?
-- Move cursor to position `p'.
-- Move cursor to first child.
-- Move cursor to last child.
-- Move cursor to next child.
-- Move cursor to previous child.
-- Move cursor to `i'-th child.
-- Make current node a root.
-- Replace element at cursor position by `v'.
-- Put `v' at current child position.
-- Put `n' at current child position.
-- Remove `n' from the children
-- Fill with as many items of `other' as possible.
-- The representations of `other' and current node
-- need not be the same.
-- Representation as a linear structure
-- Convert to binary tree representation:
-- first child becomes left child,
-- right sibling becomes right child.
-- Copy of sub-tree beginning at cursor position and
-- having min (`n', `arity' - `child_index' + 1)
-- children.
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |