class
	FIXED_TREE [G]

General
	cluster: base.structures.tree
	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

Ancestors
	CELL [G]
	FIXED_LIST [G]
	TREE [G]

Queries
	infix "@" (i: INTEGER): FIXED_TREE [G]
	area: SPECIAL [FIXED_TREE [G]]
	arity: INTEGER
	binary_representation: BINARY_TREE [G]
	capacity: INTEGER
	changeable_comparison_criterion: BOOLEAN
	child: FIXED_TREE [G]
	child_after: BOOLEAN
	child_before: BOOLEAN
	child_capacity: INTEGER
	child_contractable: BOOLEAN
	child_cursor: CURSOR
	child_index: INTEGER
	child_isfirst: BOOLEAN
	child_islast: BOOLEAN
	child_item: [like item] G
	child_off: BOOLEAN
	child_readable: BOOLEAN
	child_writable: BOOLEAN
	count: INTEGER
	duplicate (n: INTEGER): [like Current] FIXED_TREE [G]
	exhausted: BOOLEAN
	first_child: [like parent] FIXED_TREE [G]
	fl_changeable_object_criterion: BOOLEAN
	fl_object_comparison: BOOLEAN
	for_all (test: FUNCTION [ANY, TUPLE [FIXED_TREE [G]], BOOLEAN]): BOOLEAN
	Full: BOOLEAN
	has (v: G): BOOLEAN
	index_of (v: [like item] FIXED_TREE [G]; i: INTEGER): INTEGER
	index_set: INTEGER_INTERVAL
	is_empty: BOOLEAN
	is_equal (other: [like Current] FIXED_TREE [G]): BOOLEAN
	is_inserted (v: 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] FIXED_TREE [G]
	left_sibling: [like parent] FIXED_TREE [G]
	linear_representation: LINEAR [G]
	object_comparison: BOOLEAN
	occurrences (v: FIXED_TREE [G]): INTEGER
	parent: FIXED_TREE [G]
	prunable: BOOLEAN
	Readable: BOOLEAN
	readable_child: BOOLEAN
	Resizable: BOOLEAN
	right_sibling: [like parent] FIXED_TREE [G]
	sequential_occurrences (v: FIXED_TREE [G]): INTEGER
	there_exists (test: FUNCTION [ANY, TUPLE [FIXED_TREE [G]], BOOLEAN]): BOOLEAN
	valid_cursor (p: CURSOR): BOOLEAN
	valid_cursor_index (i: INTEGER): BOOLEAN
	valid_index (i: INTEGER): BOOLEAN
	Writable: BOOLEAN
	writable_child: BOOLEAN

Commands
	append (s: SEQUENCE [FIXED_TREE [G]])
	child_back
	child_finish
	child_forth
	child_go_i_th (i: INTEGER)
	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])
	do_all (action: PROCEDURE [ANY, TUPLE [FIXED_TREE [G]]])
	do_if (action: PROCEDURE [ANY, TUPLE [FIXED_TREE [G]]]; test: FUNCTION [ANY, TUPLE [FIXED_TREE [G]], BOOLEAN])
	extend (v: [like item] FIXED_TREE [G])
	fill (other: TREE [G])
	make (n: INTEGER; v: G)
	move (i: INTEGER)
	prune (v: FIXED_TREE [G])
	put (v: [like item] G)
	put_child (n: [like parent] FIXED_TREE [G])
	put_i_th (v: [like item] FIXED_TREE [G]; i: INTEGER)
	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: [like item] FIXED_TREE [G])
	sprout
	swap (i: INTEGER)