Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
deferred class EV_ACTION_SEQUENCE [EVENT_DATA -> TUPLE create default_create end] General cluster: interface description: "Base Eiffel Vision action sequence." keywords: "event, action, sequence" Ancestors EV_LITE_ACTION_SEQUENCE [EVENT_DATA -> detachable TUPLE create default_create end] Action sequences duplicate (n: INTEGER_32): [like Current] EV_ACTION_SEQUENCE [EVENT_DATA] Queries additional_space: INTEGER_32 after: BOOLEAN all_default: BOOLEAN area: SPECIAL [PROCEDURE [EVENT_DATA]] area_v2: SPECIAL [PROCEDURE [EVENT_DATA]] array_at (i: INTEGER_32): PROCEDURE [EVENT_DATA] array_item (i: INTEGER_32): PROCEDURE [EVENT_DATA] array_valid_index (i: INTEGER_32): BOOLEAN at alias "@" (i: INTEGER_32): [like item] PROCEDURE [EVENT_DATA] before: BOOLEAN Blocked_state: INTEGER_32 call_is_underway: BOOLEAN capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: ARRAYED_LIST_CURSOR empty_actions: ARRAYED_LIST [PROCEDURE] ev_application: EV_APPLICATION ev_separate_application: separate EV_APPLICATION exhausted: BOOLEAN extendible: BOOLEAN first: [like item] PROCEDURE [EVENT_DATA] for_all (test: FUNCTION [PROCEDURE [EVENT_DATA], BOOLEAN]): BOOLEAN full: BOOLEAN Growth_percentage: INTEGER_32 has (v: [like item] PROCEDURE [EVENT_DATA]): BOOLEAN has_kamikaze_action (an_action: [like item] PROCEDURE [EVENT_DATA]): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] PROCEDURE [EVENT_DATA] index: INTEGER_32 index_of (v: [like item] PROCEDURE [EVENT_DATA]; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] EV_ACTION_SEQUENCE [EVENT_DATA]): BOOLEAN is_inserted (v: PROCEDURE [EVENT_DATA]): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: PROCEDURE [EVENT_DATA] item_for_iteration: PROCEDURE [EVENT_DATA] last: [like first] PROCEDURE [EVENT_DATA] linear_representation: LINEAR [PROCEDURE [EVENT_DATA]] Lower: INTEGER_32 Minimal_increase: INTEGER_32 Mismatch_information: MISMATCH_INFORMATION name: detachable STRING_8 new_cursor: ARRAYED_LIST_ITERATION_CURSOR [PROCEDURE [EVENT_DATA]] Normal_state: INTEGER_32 not_empty_actions: ARRAYED_LIST [PROCEDURE] object_comparison: BOOLEAN occurrences (v: [like item] PROCEDURE [EVENT_DATA]): INTEGER_32 off: BOOLEAN Paused_state: INTEGER_32 prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN resizable: BOOLEAN Shared_environment: EV_ENVIRONMENT state: INTEGER_32 there_exists (test: FUNCTION [PROCEDURE [EVENT_DATA], BOOLEAN]): BOOLEAN to_array: ARRAY [PROCEDURE [EVENT_DATA]] upper: INTEGER_32 valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER_32): BOOLEAN valid_index (i: INTEGER_32): BOOLEAN writable: BOOLEAN Commands abort append (s: SEQUENCE [[like item] PROCEDURE [EVENT_DATA]]) array_put (v: PROCEDURE [EVENT_DATA]; i: INTEGER_32) arrayed_list_make (n: INTEGER_32) automatic_grow back block call (event_data: detachable EVENT_DATA) compare_objects compare_references copy (other: [like Current] EV_ACTION_SEQUENCE [EVENT_DATA]) correct_mismatch do_all (action: PROCEDURE [PROCEDURE [EVENT_DATA]]) do_all_with_index (action: PROCEDURE [PROCEDURE [EVENT_DATA], INTEGER_32]) do_if (action: PROCEDURE [PROCEDURE [EVENT_DATA]]; test: FUNCTION [PROCEDURE [EVENT_DATA], BOOLEAN]) do_if_with_index (action: PROCEDURE [PROCEDURE [EVENT_DATA], INTEGER_32]; test: FUNCTION [PROCEDURE [EVENT_DATA], INTEGER_32, BOOLEAN]) extend (v: [like item] PROCEDURE [EVENT_DATA]) extend_kamikaze (an_item: [like item] PROCEDURE [EVENT_DATA]) fill (other: CONTAINER [PROCEDURE [EVENT_DATA]]) finish flush force (v: [like item] PROCEDURE [EVENT_DATA]) force_extend (an_item: PROCEDURE) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) grow (i: INTEGER_32) make_filled (n: INTEGER_32) merge_left (other: [like Current] EV_ACTION_SEQUENCE [EVENT_DATA]) merge_right (other: [like Current] EV_ACTION_SEQUENCE [EVENT_DATA]) move (i: INTEGER_32) on_item_added_at (an_item: [like item] PROCEDURE [EVENT_DATA]; item_index: INTEGER_32) on_item_removed_at (an_item: [like item] PROCEDURE [EVENT_DATA]; item_index: INTEGER_32) pause prune (v: [like item] PROCEDURE [EVENT_DATA]) prune_all (v: [like item] PROCEDURE [EVENT_DATA]) prune_when_called (an_action: [like item] PROCEDURE [EVENT_DATA]) put (v: [like item] PROCEDURE [EVENT_DATA]) put_front (v: [like item] PROCEDURE [EVENT_DATA]) put_i_th (v: [like i_th] PROCEDURE [EVENT_DATA]; i: INTEGER_32) put_left (v: [like item] PROCEDURE [EVENT_DATA]) put_right (v: [like item] PROCEDURE [EVENT_DATA]) remove remove_left remove_right replace (v: [like item] PROCEDURE [EVENT_DATA]) resize (new_capacity: INTEGER_32) resume search (v: [like item] PROCEDURE [EVENT_DATA]) sequence_put (v: [like item] PROCEDURE [EVENT_DATA]) start swap (i: INTEGER_32) trim update_for_added (start_index: INTEGER_32) wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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