deferred class EV_TREE_NODE_LIST General cluster: interface description: "Base class for EV_TREE and EV_TREE_ITEM." Ancestors EV_ITEM_LIST* [reference G -> EV_ITEM] Queries after: BOOLEAN before: BOOLEAN Changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: EV_DYNAMIC_LIST_CURSOR [EV_TREE_NODE] data: ANY exhausted: BOOLEAN Extendible: BOOLEAN first: [like item] EV_TREE_NODE for_all (test: FUNCTION [ANY, TUPLE [EV_TREE_NODE], BOOLEAN]): BOOLEAN Full: BOOLEAN has (v: [like item] EV_TREE_NODE): BOOLEAN has_recursively (an_item: EV_TREE_NODE): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] EV_TREE_NODE index: INTEGER_32 index_of (v: [like item] EV_TREE_NODE; i: INTEGER_32): INTEGER_32 index_set: INTEGER_INTERVAL infix "@" (i: INTEGER_32): [like item] EV_TREE_NODE is_destroyed: BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] EV_TREE_NODE_LIST): BOOLEAN is_inserted (v: EV_TREE_NODE): BOOLEAN is_parent_recursive (a_list: [like item] EV_TREE_NODE): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: EV_TREE_NODE last: [like item] EV_TREE_NODE linear_representation: LINEAR [EV_TREE_NODE] object_comparison: BOOLEAN occurrences (v: [like item] EV_TREE_NODE): INTEGER_32 off: BOOLEAN parent: EV_ANY prunable: BOOLEAN readable: BOOLEAN retrieve_item_by_data (some_data: ANY; should_compare_objects: BOOLEAN): EV_TREE_NODE retrieve_item_recursively_by_data (some_data: ANY; should_compare_objects: BOOLEAN): EV_TREE_NODE retrieve_items_by_data (some_data: ANY; should_compare_objects: BOOLEAN): ARRAYED_LIST [EV_TREE_NODE] retrieve_items_recursively_by_data (some_data: ANY; should_compare_objects: BOOLEAN): ARRAYED_LIST [EV_TREE_NODE] same (other: EV_ANY): BOOLEAN sequential_occurrences (v: [like item] EV_TREE_NODE): INTEGER_32 there_exists (test: FUNCTION [ANY, TUPLE [EV_TREE_NODE], BOOLEAN]): BOOLEAN valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER_32): BOOLEAN valid_index (i: INTEGER_32): BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [[like item] EV_TREE_NODE]) back compare_objects compare_references copy (other: [like Current] EV_TREE_NODE_LIST) destroy dl_force (v: [like item] EV_TREE_NODE) do_all (action: PROCEDURE [ANY, TUPLE [EV_TREE_NODE]]) do_if (action: PROCEDURE [ANY, TUPLE [EV_TREE_NODE]]; test: FUNCTION [ANY, TUPLE [EV_TREE_NODE], BOOLEAN]) extend (v: [like item] EV_TREE_NODE) fill (other: CONTAINER [EV_TREE_NODE]) finish force (v: [like item] EV_TREE_NODE) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) merge_left (other: [like Current] EV_TREE_NODE_LIST) merge_right (other: [like Current] EV_TREE_NODE_LIST) move (i: INTEGER_32) prune (v: [like item] EV_TREE_NODE) prune_all (v: [like item] EV_TREE_NODE) put (v: [like item] EV_TREE_NODE) put_front (v: [like item] EV_TREE_NODE) put_i_th (v: [like item] EV_TREE_NODE; i: INTEGER_32) put_left (v: [like item] EV_TREE_NODE) put_right (v: [like item] EV_TREE_NODE) recursive_do_all (action: PROCEDURE [ANY, TUPLE [EV_TREE_NODE]]) remove remove_left remove_right replace (v: [like item] EV_TREE_NODE) search (v: [like item] EV_TREE_NODE) set_data (some_data: [like data] ANY) start swap (i: INTEGER_32) wipe_out