    class
    	FIXED_TREE [G]

    General
    	cluster: base
    	description:
    		"Trees where each node has a fixed number of children
    		(The number of children is arbitrary but cannot be
    		changed once the node has been created"
    	create: make_filled, make

    Ancestors
    	CELL [G]
    	TREE* [G]

    Queries
    	arity: INTEGER_32
    	array_item (n: INTEGER_32): FIXED_TREE [G]
    	binary_representation: BINARY_TREE [G]
    	capacity: INTEGER_32
    	changeable_comparison_criterion: BOOLEAN
    	child: [like parent] FIXED_TREE [G]
    	child_after: BOOLEAN
    	child_before: BOOLEAN
    	child_capacity: INTEGER_32
    	child_contractable: BOOLEAN
    	child_cursor: CURSOR
    	child_index: INTEGER_32
    	child_isfirst: BOOLEAN
    	child_islast: BOOLEAN
    	child_item: [like item] G
    	child_off: BOOLEAN
    	child_readable: BOOLEAN
    	child_writable: BOOLEAN
    	count: INTEGER_32
    	duplicate (n: INTEGER_32): [like Current] FIXED_TREE [G]
    	first_child: [like parent] FIXED_TREE [G]
    	Full: BOOLEAN
    	has (v: G): BOOLEAN
    	index_of (v: FIXED_TREE [[like item] G]; i: INTEGER_32): INTEGER_32
    	is_empty: BOOLEAN
    	is_equal (other: [like Current] FIXED_TREE [G]): BOOLEAN
    	is_leaf: BOOLEAN
    	is_root: BOOLEAN
    	is_sibling (other: [like parent] FIXED_TREE [G]): BOOLEAN
    	item: G
    	last_child: [like first_child] FIXED_TREE [G]
    	left_sibling: [like parent] FIXED_TREE [G]
    	linear_representation: LINEAR [G]
    	node_is_equal (other: [like Current] FIXED_TREE [G]): BOOLEAN
    	object_comparison: BOOLEAN
    	parent: FIXED_TREE [G]
    	Readable: BOOLEAN
    	readable_child: BOOLEAN
    	right_sibling: [like parent] FIXED_TREE [G]
    	valid_cursor_index (i: INTEGER_32): BOOLEAN
    	Writable: BOOLEAN
    	writable_child: BOOLEAN

    Commands
    	array_make (min_index, max_index: INTEGER_32)
    	child_back
    	child_finish
    	child_forth
    	child_go_i_th (i: INTEGER_32)
    	child_go_to (p: CURSOR)
    	child_put (v: [like item] G)
    	child_replace (v: [like item] G)
    	child_start
    	compare_objects
    	compare_references
    	copy (other: [like Current] FIXED_TREE [G])
    	fill (other: TREE [G])
    	forget_left
    	forget_right
    	make (n: INTEGER_32; v: G)
    	make_filled (n: INTEGER_32; v: G)
    	prune (n: [like parent] FIXED_TREE [G])
    	put (v: [like item] G)
    	put_child (n: [like parent] FIXED_TREE [G])
    	put_i_th (v: FIXED_TREE [[like item] G]; n: INTEGER_32)
    	put_left (v: [like item] G)
    	put_left_sibling (other: [like parent] FIXED_TREE [G])
    	put_right (v: [like item] G)
    	put_right_sibling (other: [like parent] FIXED_TREE [G])
    	remove_child
    	replace (v: [like item] G)
    	replace_child (n: [like parent] FIXED_TREE [G])
    	search_child (v: FIXED_TREE [[like item] G])
    	sprout
    	wipe_out