Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
deferred class EV_ITEM_LIST [G -> EV_ITEM] General cluster: interface description: "Base class for widgets that contain EV_ITEMs" keywords: "item, list" Ancestors EV_ANY* EV_DYNAMIC_LIST* [G -> EV_CONTAINABLE] Queries after: BOOLEAN at alias "@" (i: INTEGER_32): [like item] G before: BOOLEAN Changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: EV_DYNAMIC_LIST_CURSOR [G] data: detachable ANY debug_output: STRING_32 default_identifier_name: STRING_32 exhausted: BOOLEAN extendible: BOOLEAN first: [like item] G for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN Full: BOOLEAN full_identifier_path: STRING_32 has (v: [like item] G): BOOLEAN has_identifier_name_set: BOOLEAN has_parent: BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] G identifier_name: STRING_32 index: INTEGER_32 index_of (v: [like item] G; i: INTEGER_32): INTEGER_32 is_destroyed: BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] EV_ITEM_LIST [G]): BOOLEAN is_inserted (v: G): BOOLEAN is_parent_recursive (a_list: [like item] G): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: G item_for_iteration: G last: [like item] G linear_representation: LINEAR [G] Lower: INTEGER_32 new_cursor: INDEXABLE_ITERATION_CURSOR [G] object_comparison: BOOLEAN occurrences (v: [like item] G): INTEGER_32 off: BOOLEAN parent: detachable EV_CONTAINABLE prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN retrieve_item_by_data (some_data: ANY; should_compare_objects: BOOLEAN): detachable G retrieve_items_by_data (some_data: ANY; should_compare_objects: BOOLEAN): ARRAYED_LIST [G] same (other: EV_ANY): BOOLEAN 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 Commands append (s: SEQUENCE [[like item] G]) back compare_objects compare_references destroy dl_append (s: SEQUENCE [G]) dl_extend (v: [like item] G) dl_force (v: [like item] G) dl_prune (v: [like item] G) dl_put_front (v: [like item] G) dl_put_i_th (v: [like item] G; i: INTEGER_32) dl_put_left (v: [like item] G) dl_put_right (v: [like item] G) dl_replace (v: [like item] G) do_all (action: PROCEDURE [G]) do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN]) extend (v: [like item] G) fill (other: CONTAINER [G]) finish force (v: [like item] G) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) merge_left (other: [like Current] EV_ITEM_LIST [G]) merge_right (other: [like Current] EV_ITEM_LIST [G]) move (i: INTEGER_32) prune (v: [like item] G) prune_all (v: [like item] G) put (v: [like item] G) put_front (v: [like item] G) put_i_th (v: [like item] G; i: INTEGER_32) put_left (v: [like item] G) put_right (v: [like item] G) remove remove_i_th (i: INTEGER_32) remove_left remove_right replace (v: [like item] G) search (v: [like item] G) sequence_put (v: [like item] G) set_data (some_data: [like data] detachable ANY) set_identifier_name (a_name: READABLE_STRING_GENERAL) start swap (i: INTEGER_32) wipe_out Constraints parent of items is current items unique
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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