Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class LINKED_TREE [G] General cluster: elks description: "Trees implemented using a linked list representation" create: make Ancestors DYNAMIC_TREE* [G] LINKABLE [G] LINKED_LIST [G] Queries arity: INTEGER_32 at alias "@" (i: INTEGER_32): [like child_item] G binary_representation: BINARY_TREE [G] changeable_comparison_criterion: BOOLEAN child: [like first_child] [detachable like Current] detachable LINKED_TREE [G] child_after: BOOLEAN child_before: BOOLEAN child_capacity: INTEGER_32 child_cursor: LINKED_TREE_CURSOR [G] child_extendible: BOOLEAN child_index: INTEGER_32 child_isfirst: BOOLEAN child_islast: BOOLEAN child_item: G child_off: BOOLEAN child_readable: BOOLEAN child_writable: BOOLEAN count: INTEGER_32 exhausted: BOOLEAN Extendible: BOOLEAN first: [like child_item] G first_child: [like parent] [detachable like Current] detachable LINKED_TREE [G] for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN has (v: G): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like child_item] G index_of (v: [like child_item] G; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] LINKED_TREE [G]): BOOLEAN is_inserted (v: G): BOOLEAN is_leaf: BOOLEAN is_root: BOOLEAN is_sibling (other: [attached like parent] [attached like Current] attached LINKED_TREE [G]): BOOLEAN item: G item_for_iteration: G last: [like child_item] G last_child: [like first_child] [detachable like Current] detachable LINKED_TREE [G] left_sibling: [like parent] [detachable like Current] detachable LINKED_TREE [G] linear_representation: LINEAR [G] Ll_full: BOOLEAN ll_has (v: [like child_item] G): BOOLEAN ll_new_cursor: LINKED_LIST_ITERATION_CURSOR [G] Lower: INTEGER_32 new_cursor: LINKED_TREE_ITERATION_CURSOR [G] node_is_equal (other: [like Current] LINKED_TREE [G]): BOOLEAN object_comparison: BOOLEAN occurrences (v: [like child_item] G): INTEGER_32 parent: [detachable like new_cell] [detachable like Current] detachable LINKED_TREE [G] prunable: BOOLEAN Readable: BOOLEAN readable_child: BOOLEAN replaceable: BOOLEAN right_sibling: [detachable like Current] detachable LINKED_TREE [G] sequential_has (v: [like child_item] G): BOOLEAN sequential_index_of (v: [like child_item] G; i: INTEGER_32): INTEGER_32 sequential_occurrences (v: [like child_item] G): INTEGER_32 there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER_32): BOOLEAN valid_index (i: INTEGER_32): BOOLEAN Writable: BOOLEAN writable_child: BOOLEAN Commands append (s: SEQUENCE [G]) chain_wipe_out child_back child_extend (v: [like child_item] G) child_finish child_forth child_go_i_th (i: INTEGER_32) child_go_to (p: CURSOR) child_put (v: [like child_item] G) child_put_left (v: [like child_item] G) child_put_right (v: [like child_item] G) child_replace (v: [like child_item] G) child_start compare_objects compare_references copy (other: [like Current] LINKED_TREE [G]) do_all (action: PROCEDURE [G]) do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN]) extend (v: [like item] G) fill_from_binary (b: BINARY_TREE [G]) force (v: [like child_item] G) forget_left forget_right ll_fill (other: CONTAINER [G]) ll_merge_left (other: [like Current] LINKED_TREE [G]) ll_merge_right (other: [like Current] LINKED_TREE [G]) ll_prune (v: [like child_item] G) merge_tree_after (other: [like new_cell] [like Current] LINKED_TREE [G]) merge_tree_before (other: [like new_cell] [like Current] LINKED_TREE [G]) move (i: INTEGER_32) prune (n: [like new_cell] [like Current] LINKED_TREE [G]) prune_all (v: [like child_item] G) put (v: [like item] G) put_child (n: [like new_cell] [like Current] LINKED_TREE [G]) put_child_left (n: [like new_cell] [like Current] LINKED_TREE [G]) put_child_right (n: [like new_cell] [like Current] LINKED_TREE [G]) put_front (v: [like child_item] G) put_i_th (v: [like child_item] G; i: INTEGER_32) remove_child remove_i_th (i: INTEGER_32) remove_left_child remove_right_child replace (v: [like item] G) replace_child (n: [like new_cell] [like Current] LINKED_TREE [G]) search_child (v: [like child_item] G) sequence_put (v: [like child_item] G) sprout swap (i: INTEGER_32) wipe_out Constraints no void child
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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