Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class EV_NOTIFY_ACTION_SEQUENCE General cluster: interface description: "Action sequence for general notify events with no parameters." keywords: "ev_notify" create: default_create, make_filled Ancestors EV_ACTION_SEQUENCE* [EVENT_DATA -> TUPLE create default_create end] Action sequences duplicate (n: INTEGER_32): [attached like Current] attached EV_NOTIFY_ACTION_SEQUENCE Queries additional_space: INTEGER_32 after: BOOLEAN all_default: BOOLEAN area: SPECIAL [PROCEDURE [ANY, TUPLE]] area_v2: SPECIAL [PROCEDURE [ANY, TUPLE]] array_at (i: INTEGER_32): PROCEDURE [ANY, TUPLE] array_item (i: INTEGER_32): PROCEDURE [ANY, TUPLE] array_valid_index (i: INTEGER_32): BOOLEAN at alias "@" (i: INTEGER_32): [like item] PROCEDURE [ANY, TUPLE] 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 [ANY, TUPLE]] ev_application: EV_APPLICATION exhausted: BOOLEAN extendible: BOOLEAN first: [like item] PROCEDURE [ANY, TUPLE] for_all (test: FUNCTION [ANY, TUPLE [PROCEDURE [ANY, TUPLE]], BOOLEAN]): BOOLEAN full: BOOLEAN Growth_percentage: INTEGER_32 has (v: [like item] PROCEDURE [ANY, TUPLE]): BOOLEAN has_kamikaze_action (an_action: [like item] PROCEDURE [ANY, TUPLE]): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] PROCEDURE [ANY, TUPLE] index: INTEGER_32 index_of (v: [like item] PROCEDURE [ANY, TUPLE]; i: INTEGER_32): INTEGER_32 index_set: INTEGER_INTERVAL is_empty: BOOLEAN is_equal (other: [attached like Current] attached EV_NOTIFY_ACTION_SEQUENCE): BOOLEAN is_inserted (v: PROCEDURE [ANY, TUPLE]): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: PROCEDURE [ANY, TUPLE] item_for_iteration: PROCEDURE [ANY, TUPLE] last: [like first] PROCEDURE [ANY, TUPLE] linear_representation: LINEAR [PROCEDURE [ANY, TUPLE]] Lower: INTEGER_32 Minimal_increase: INTEGER_32 Mismatch_information: MISMATCH_INFORMATION name: detachable STRING_8 new_cursor: INDEXABLE_ITERATION_CURSOR [PROCEDURE [ANY, TUPLE]] Normal_state: INTEGER_32 not_empty_actions: ARRAYED_LIST [PROCEDURE [ANY, TUPLE]] object_comparison: BOOLEAN occurrences (v: [like item] PROCEDURE [ANY, TUPLE]): 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 [ANY, TUPLE [PROCEDURE [ANY, TUPLE]], BOOLEAN]): BOOLEAN to_array: ARRAY [PROCEDURE [ANY, TUPLE]] 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 [ANY, TUPLE]]) array_put (v: PROCEDURE [ANY, TUPLE]; i: INTEGER_32) arrayed_list_make (n: INTEGER_32) automatic_grow back block call (event_data: detachable TUPLE) compare_objects compare_references copy (other: [attached like Current] attached EV_NOTIFY_ACTION_SEQUENCE) correct_mismatch do_all (action: PROCEDURE [ANY, TUPLE [PROCEDURE [ANY, TUPLE]]]) do_all_with_index (action: PROCEDURE [ANY, TUPLE [PROCEDURE [ANY, TUPLE], INTEGER_32]]) do_if (action: PROCEDURE [ANY, TUPLE [PROCEDURE [ANY, TUPLE]]]; test: FUNCTION [ANY, TUPLE [PROCEDURE [ANY, TUPLE]], BOOLEAN]) do_if_with_index (action: PROCEDURE [ANY, TUPLE [PROCEDURE [ANY, TUPLE], INTEGER_32]]; test: FUNCTION [ANY, TUPLE [PROCEDURE [ANY, TUPLE], INTEGER_32], BOOLEAN]) extend (v: [like item] PROCEDURE [ANY, TUPLE]) extend_kamikaze (an_item: [like item] PROCEDURE [ANY, TUPLE]) fill (other: CONTAINER [PROCEDURE [ANY, TUPLE]]) finish flush force (v: [like item] PROCEDURE [ANY, TUPLE]) force_extend (action: PROCEDURE [ANY, TUPLE]) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) grow (i: INTEGER_32) make_filled (n: INTEGER_32) merge_left (other: [attached like Current] attached EV_NOTIFY_ACTION_SEQUENCE) merge_right (other: [attached like Current] attached EV_NOTIFY_ACTION_SEQUENCE) move (i: INTEGER_32) on_item_added_at (an_item: [like item] PROCEDURE [ANY, TUPLE]; item_index: INTEGER_32) on_item_removed_at (an_item: [like item] PROCEDURE [ANY, TUPLE]; item_index: INTEGER_32) pause prune (v: [like item] PROCEDURE [ANY, TUPLE]) prune_all (v: [like item] PROCEDURE [ANY, TUPLE]) prune_when_called (an_action: [like item] PROCEDURE [ANY, TUPLE]) put (v: [like item] PROCEDURE [ANY, TUPLE]) put_front (v: [like item] PROCEDURE [ANY, TUPLE]) put_i_th (v: [like i_th] PROCEDURE [ANY, TUPLE]; i: INTEGER_32) put_left (v: [like item] PROCEDURE [ANY, TUPLE]) put_right (v: [like item] PROCEDURE [ANY, TUPLE]) remove remove_left remove_right replace (v: [like item] PROCEDURE [ANY, TUPLE]) resize (new_capacity: INTEGER_32) resume search (v: [like item] PROCEDURE [ANY, TUPLE]) sequence_put (v: [like item] PROCEDURE [ANY, TUPLE]) start swap (i: INTEGER_32) trim update_for_added (start_index: INTEGER_32) wipe_out wrapper (action: PROCEDURE [ANY, TUPLE])
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

-- Generated by Eiffel Studio --
For more details: docs.eiffel.com