INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Create an empty tree.
-- `i' is an estimate of the number of nodes.
-- Does structure include an occurrence of `v'?
-- (Reference or object equality,
-- based on `object_comparison'.)
-- Number of times `v' appears.
-- (Reference or object equality,
-- based on `object_comparison'.)
-- Current item
-- Current cursor position
-- Number of children
-- Number of items in subtree
-- Is cursor on first sibling?
-- Is cursor on last sibling?
-- Is cursor on root?
-- Can the cursor be moved to position `p'?
-- Move cursor one position backward.
-- Move cursor one position forward.
-- Move cursor one level upward, to parent
-- or `above' if `is_root' holds.
-- Move cursor one level downward:
-- to `i'-th child if there is one,
-- or `after' if `i' = `arity' + 1,
-- or `before' if `i' = 0.
-- Move cursor to position `p'.
-- Replace current item by `v'
-- Add a leaf `v' to the right of cursor position.
-- Add `v' to the left of current position.
-- Add a leaf `v' as first child.
-- If `above' and `empty', make `v' the root value
-- insert a new node, with value v, as parent of
-- current node and
-- with the same position
--if above or on root, add a new root
-- Remove node at cursor position
-- (and consequently the corresponding subtree).
-- Move cursor to next sibling, or `after' if none.
-- Remove node at cursor position; insert children into
-- parent's children at current position; move cursor up.
-- If node is root, it must not have more than one child.
-- Remove all items.
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |