Automatic generation produced by ISE Eiffel

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