Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class EV_ACCELERATOR_LIST General cluster: interface description: "Objects that store a list of unique keyboard accelerators." keywords: "accelerator, shortcut" create: default_create, make_filled Ancestors EV_ACTIVE_LIST [G] Action sequences add_actions: ACTION_SEQUENCE [[like item] EV_ACCELERATOR] remove_actions: ACTION_SEQUENCE [[like item] EV_ACCELERATOR] Queries additional_space: INTEGER_32 after: BOOLEAN all_default: BOOLEAN area: SPECIAL [EV_ACCELERATOR] area_v2: SPECIAL [EV_ACCELERATOR] array_at (i: INTEGER_32): EV_ACCELERATOR array_item (i: INTEGER_32): EV_ACCELERATOR array_valid_index (i: INTEGER_32): BOOLEAN at alias "@" (i: INTEGER_32): [like item] EV_ACCELERATOR before: BOOLEAN capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: ARRAYED_LIST_CURSOR exhausted: BOOLEAN extendible: BOOLEAN first: [like item] EV_ACCELERATOR for_all (test: FUNCTION [EV_ACCELERATOR, BOOLEAN]): BOOLEAN full: BOOLEAN Growth_percentage: INTEGER_32 has (v: [like item] EV_ACCELERATOR): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] EV_ACCELERATOR index: INTEGER_32 index_of (v: [like item] EV_ACCELERATOR; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] EV_ACCELERATOR_LIST): BOOLEAN is_inserted (v: EV_ACCELERATOR): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: EV_ACCELERATOR item_for_iteration: EV_ACCELERATOR last: [like first] EV_ACCELERATOR linear_representation: LINEAR [EV_ACCELERATOR] Lower: INTEGER_32 Minimal_increase: INTEGER_32 Mismatch_information: MISMATCH_INFORMATION new_cursor: ARRAYED_LIST_ITERATION_CURSOR [EV_ACCELERATOR] object_comparison: BOOLEAN occurrences (v: [like item] EV_ACCELERATOR): INTEGER_32 off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN resizable: BOOLEAN sequential_has (v: [like item] EV_ACCELERATOR): BOOLEAN sequential_index_of (v: [like item] EV_ACCELERATOR; i: INTEGER_32): INTEGER_32 sequential_occurrences (v: [like item] EV_ACCELERATOR): INTEGER_32 there_exists (test: FUNCTION [EV_ACCELERATOR, BOOLEAN]): BOOLEAN to_array: ARRAY [EV_ACCELERATOR] upper: INTEGER_32 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_ACCELERATOR]) array_put (v: EV_ACCELERATOR; i: INTEGER_32) automatic_grow back chain_wipe_out compare_objects compare_references copy (other: [like Current] EV_ACCELERATOR_LIST) correct_mismatch default_create do_all (action: PROCEDURE [EV_ACCELERATOR]) do_all_with_index (action: PROCEDURE [EV_ACCELERATOR, INTEGER_32]) do_if (action: PROCEDURE [EV_ACCELERATOR]; test: FUNCTION [EV_ACCELERATOR, BOOLEAN]) do_if_with_index (action: PROCEDURE [EV_ACCELERATOR, INTEGER_32]; test: FUNCTION [EV_ACCELERATOR, INTEGER_32, BOOLEAN]) extend (v: [like item] EV_ACCELERATOR) fill (other: CONTAINER [EV_ACCELERATOR]) finish force (v: [like item] EV_ACCELERATOR) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) grow (i: INTEGER_32) make (n: INTEGER_32) make_filled (n: INTEGER_32) merge_left (other: [like Current] EV_ACCELERATOR_LIST) merge_right (other: [like Current] EV_ACCELERATOR_LIST) move (i: INTEGER_32) on_item_added_at (an_item: [like item] EV_ACCELERATOR; item_index: INTEGER_32) on_item_removed_at (an_item: [like item] EV_ACCELERATOR; item_index: INTEGER_32) prune (v: [like item] EV_ACCELERATOR) prune_all (v: [like item] EV_ACCELERATOR) put (v: [like item] EV_ACCELERATOR) put_front (v: [like item] EV_ACCELERATOR) put_i_th (v: [like i_th] EV_ACCELERATOR; i: INTEGER_32) put_left (v: [like item] EV_ACCELERATOR) put_right (v: [like item] EV_ACCELERATOR) remove remove_i_th (i: INTEGER_32) remove_left remove_right replace (v: [like item] EV_ACCELERATOR) resize (new_capacity: INTEGER_32) search (v: [like item] EV_ACCELERATOR) sequence_put (v: [like item] EV_ACCELERATOR) 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