Automatic generation produced by ISE Eiffel
class ARRAYED_TREE [G] General cluster: base.structures.tree description: "Trees where the children of each node are kept in an array" create: make Ancestors ARRAYED_LIST [G] CELL [G] DYNAMIC_TREE [G] Queries infix "@" (i: INTEGER): ARRAYED_TREE [G] Al_extendible: BOOLEAN arity: INTEGER array_item (i: INTEGER): ARRAYED_TREE [G] binary_representation: BINARY_TREE [G] capacity: INTEGER changeable_comparison_criterion: BOOLEAN child: [like first] ARRAYED_TREE [G] child_after: BOOLEAN child_before: BOOLEAN child_capacity: INTEGER 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] ARRAYED_TREE [G] exhausted: BOOLEAN Extendible: BOOLEAN first_child: ARRAYED_TREE [G] for_all (test: FUNCTION [ANY, TUPLE [ARRAYED_TREE [G]], BOOLEAN]): BOOLEAN has (v: G): BOOLEAN index_of (v: [like item] ARRAYED_TREE [G]; i: INTEGER): INTEGER index_set: INTEGER_INTERVAL is_empty: BOOLEAN is_equal (other: [like Current] ARRAYED_TREE [G]): BOOLEAN is_inserted (v: ARRAYED_TREE [G]): BOOLEAN is_leaf: BOOLEAN is_root: BOOLEAN is_sibling (other: [like parent] ARRAYED_TREE [G]): BOOLEAN item: G last_child: [like first] ARRAYED_TREE [G] left_sibling: [like parent] ARRAYED_TREE [G] linear_representation: LINEAR [G] object_comparison: BOOLEAN occurrences (v: [like item] ARRAYED_TREE [G]): INTEGER parent: ARRAYED_TREE [G] prunable: BOOLEAN Readable: BOOLEAN readable_child: BOOLEAN right_sibling: [like parent] ARRAYED_TREE [G] sequential_occurrences (v: ARRAYED_TREE [G]): INTEGER there_exists (test: FUNCTION [ANY, TUPLE [ARRAYED_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 [ARRAYED_TREE [G]]) child_back child_extend (v: [like item] G) child_finish child_forth child_go_i_th (i: INTEGER) child_go_to (p: CURSOR) child_put (v: [like item] G) child_put_left (v: [like item] G) child_put_right (v: [like item] G) child_replace (v: [like item] G) child_start compare_objects compare_references copy (other: [like Current] ARRAYED_TREE [G]) do_all (action: PROCEDURE [ANY, TUPLE [ARRAYED_TREE [G]]]) do_if (action: PROCEDURE [ANY, TUPLE [ARRAYED_TREE [G]]]; test: FUNCTION [ANY, TUPLE [ARRAYED_TREE [G]], BOOLEAN]) fill (other: TREE [G]) fill_from_binary (b: BINARY_TREE [G]) force (v: [like item] ARRAYED_TREE [G]) make (n: INTEGER; v: G) make_filled (n: INTEGER) make_from_array (a: ARRAY [ARRAYED_TREE [G]]) merge_tree_after (other: [like first_child] ARRAYED_TREE [G]) merge_tree_before (other: [like first_child] ARRAYED_TREE [G]) move (i: INTEGER) prune (v: [like item] ARRAYED_TREE [G]) prune_all (v: [like item] ARRAYED_TREE [G]) put (v: [like item] G) put_child (n: [like parent] ARRAYED_TREE [G]) put_child_left (n: [like parent] ARRAYED_TREE [G]) put_child_right (n: [like parent] ARRAYED_TREE [G]) put_front (v: [like item] ARRAYED_TREE [G]) put_i_th (v: [like item] ARRAYED_TREE [G]; i: INTEGER) remove_child remove_left_child remove_right_child replace (v: [like item] G) replace_child (n: [like parent] ARRAYED_TREE [G]) search_child (v: [like item] ARRAYED_TREE [G]) sprout swap (i: INTEGER) wipe_out -- Generated by ISE Eiffel --
For more details: www.eiffel.com