Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class ARRAYED_TREE [G] General cluster: elks description: "Trees where the children of each node are kept in an array" create: make Ancestors CELL [G] DYNAMIC_TREE* [G] Queries arity: INTEGER_32 array_item (n: INTEGER_32): [like Current] ARRAYED_TREE [G] binary_representation: BINARY_TREE [G] changeable_comparison_criterion: BOOLEAN child: [attached like parent] [attached like Current] attached ARRAYED_TREE [G] child_after: BOOLEAN child_before: BOOLEAN child_capacity: INTEGER_32 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 Extendible: BOOLEAN first_child: [like parent] [detachable like Current] detachable ARRAYED_TREE [G] has (v: G): BOOLEAN index_of (v: [like Current] ARRAYED_TREE [G]; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] ARRAYED_TREE [G]): BOOLEAN is_leaf: BOOLEAN is_root: BOOLEAN is_sibling (other: [attached like parent] [attached like Current] attached ARRAYED_TREE [G]): BOOLEAN item: G last_child: [like first_child] [detachable like Current] detachable ARRAYED_TREE [G] left_sibling: [like parent] [detachable like Current] detachable ARRAYED_TREE [G] linear_representation: LINEAR [G] new_cursor: TREE_ITERATION_CURSOR [G] node_is_equal (other: [like Current] ARRAYED_TREE [G]): BOOLEAN object_comparison: BOOLEAN parent: [detachable like Current] detachable ARRAYED_TREE [G] Readable: BOOLEAN readable_child: BOOLEAN right_sibling: [like parent] [detachable like Current] detachable ARRAYED_TREE [G] valid_cursor_index (i: INTEGER_32): BOOLEAN Writable: BOOLEAN writable_child: BOOLEAN Commands child_back child_extend (v: [like item] G) child_finish child_forth child_go_i_th (i: INTEGER_32) child_go_to (p: CURSOR) child_move (i: INTEGER_32) 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 (an_agent: PROCEDURE [G]) extend (v: G) fill_from_binary (b: BINARY_TREE [G]) forget_left forget_right merge_tree_after (other: [like Current] ARRAYED_TREE [G]) merge_tree_before (other: [like Current] ARRAYED_TREE [G]) prune (n: [like child] [attached like Current] attached ARRAYED_TREE [G]) put (v: [like item] G) put_child (n: [like child] [attached like Current] attached ARRAYED_TREE [G]) put_child_left (n: [like child] [attached like Current] attached ARRAYED_TREE [G]) put_child_right (n: [like child] [attached like Current] attached ARRAYED_TREE [G]) remove_child remove_left_child remove_right_child replace (v: [like item] G) replace_child (n: [like child] [attached like Current] attached ARRAYED_TREE [G]) search_child (v: [like Current] ARRAYED_TREE [G]) sprout wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

-- Generated by Eiffel Studio --
For more details: eiffel.org