Automatic generation produced by ISE Eiffel
note description: "Object that is an movable edge of an polyline link figure (the black dot)." legal: "See notice at end of class." status: "See notice at end of class." date: "$Date: 2010-12-08 07:55:59 -0900 (Wed, 08 Dec 2010) $" revision: "$Revision: 85085 $" class interface EG_EDGE create make (owner: like corresponding_line) -- Create a move handle used to move the edges (the black circle). -- | If you change this you might also have to change the drawers in EG_FIGURE_DRAWER create {EG_EDGE} make_filled (n: INTEGER_32) -- Allocate list with n items. -- (n may be zero for empty list.) -- This list will be full. -- (from EV_MODEL_GROUP) require -- from ARRAYED_LIST valid_number_of_items: n >= 0 has_default: ({EV_MODEL}).has_default ensure -- from ARRAYED_LIST correct_position: before filled: full feature -- Initialization list_make (n: INTEGER_32) -- Allocate list with n items. -- (n may be zero for empty list.) -- (from EV_MODEL_GROUP) require -- from ARRAYED_LIST valid_number_of_items: n >= 0 ensure -- from ARRAYED_LIST correct_position: before is_empty: is_empty make_filled (n: INTEGER_32) -- Allocate list with n items. -- (n may be zero for empty list.) -- This list will be full. -- (from EV_MODEL_GROUP) require -- from ARRAYED_LIST valid_number_of_items: n >= 0 has_default: ({EV_MODEL}).has_default ensure -- from ARRAYED_LIST correct_position: before filled: full feature -- Access angle: REAL_64 -- Current has to be rotated around (`x`,`y`) for -`angle` -- to be in upright position. -- (from EV_MODEL_GROUP) require -- from EV_MODEL True ensure then -- from EV_MODEL_GROUP result_equal_current_angle: Result = current_angle arc_cosine (v: REAL_64): REAL_64 -- Trigonometric arccosine of radian v -- in the range [0, pi]. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class arc_sine (v: REAL_64): REAL_64 -- Trigonometric arcsine of radian v -- in the range [-pi/2, +pi/2]. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class arc_tangent (v: REAL_64): REAL_64 -- Trigonometric arctangent of radian v -- in the range [-pi/2, +pi/2]. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class area: SPECIAL [EV_MODEL] -- Access to internal storage of ARRAYED_LIST -- (from ARRAYED_LIST) area_v2: SPECIAL [EV_MODEL] -- Special data zone. -- (from TO_SPECIAL) at alias "@" (i: INTEGER_32): like item assign put_i_th -- Item at i-th position -- Was declared in {ARRAYED_LIST} as synonym of `i_th`. -- (from ARRAYED_LIST) require -- from TABLE valid_key: valid_index (i) array_at (i: INTEGER_32): EV_MODEL assign array_put -- Entry at index i, if in index interval. -- Was declared in {TO_SPECIAL} as synonym of `item`. -- (from TO_SPECIAL) require -- from TO_SPECIAL valid_index: array_valid_index (i) ceiling (v: REAL_64): REAL_64 -- Least integral greater than or equal to v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class corresponding_line: detachable EG_POLYLINE_LINK_FIGURE -- Line Current is part of. corresponding_point: detachable EV_COORDINATE -- Point on line Current is an edge handler for. cosine (v: REAL_64): REAL_64 -- Trigonometric cosine of radian v approximated -- in the range [-pi/4, +pi/4]. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class cursor: ARRAYED_LIST_CURSOR -- Current cursor position -- (from ARRAYED_LIST) ensure -- from CURSOR_STRUCTURE cursor_not_void: Result /= Void dabs (v: REAL_64): REAL_64 -- Absolute of v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class deep_elements: LIST [EV_MODEL] -- All elements in Current and in its subgroups. -- (from EV_MODEL_GROUP) ensure -- from EV_MODEL_GROUP result_not_void: Result /= Void Euler: REAL_64 = 2.7182818284590452353602874713526625 -- Logarithm base -- (from MATH_CONST) ev_application: EV_APPLICATION -- Current application if created yet. -- (from EV_SHARED_APPLICATION) require -- from EV_SHARED_APPLICATION application_exists: attached Shared_environment.application same_processor_as_application: Shared_environment.is_application_processor ev_separate_application: separate EV_APPLICATION -- Current application if created yet. -- (from EV_SHARED_APPLICATION) require -- from EV_SHARED_APPLICATION application_exists: attached Shared_environment.application exp (x: REAL_64): REAL_64 -- Exponential of v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class first: like item -- Item at first position -- (from ARRAYED_LIST) require -- from CHAIN not_empty: not is_empty floor (v: REAL_64): REAL_64 -- Greatest integral less than or equal to v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class generating_type: TYPE [detachable EG_EDGE] -- Type of current object -- (type of which it is a direct instance) -- (from ANY) ensure -- from ANY generating_type_not_void: Result /= Void generator: STRING_8 -- Name of current object's generating class -- (base class of the type of which it is a direct instance) -- (from ANY) ensure -- from ANY generator_not_void: Result /= Void generator_not_empty: not Result.is_empty group: detachable EV_MODEL_GROUP -- The group Current is part of. Void if Current is -- not part of a group. -- (from EV_MODEL) i_th alias "[]" (i: INTEGER_32): like item assign put_i_th -- Item at i-th position -- Was declared in {ARRAYED_LIST} as synonym of `at`. -- (from ARRAYED_LIST) require -- from TABLE valid_key: valid_index (i) require -- from READABLE_INDEXABLE valid_index: valid_index (i) id: INTEGER_32 -- Unique id. -- (from EV_MODEL) ensure -- from HASHABLE good_hash_value: Result >= 0 frozen id_object (an_id: INTEGER_32): detachable IDENTIFIED -- Object associated with an_id (void if no such object) -- (from IDENTIFIED) ensure -- from IDENTIFIED consistent: Result = Void or else Result.object_id = an_id index: INTEGER_32 -- Index of `item`, if valid. -- (from ARRAYED_LIST) index_of (v: like item; i: INTEGER_32): INTEGER_32 -- Index of i-th occurrence of item identical to v. -- (Reference or object equality, -- based on `object_comparison`.) -- 0 if none. -- (from CHAIN) require -- from LINEAR positive_occurrences: i > 0 ensure -- from LINEAR non_negative_result: Result >= 0 item: EV_MODEL -- Current item -- (from ARRAYED_LIST) require -- from ACTIVE readable: readable require -- from TRAVERSABLE not_off: not off require else -- from ARRAYED_LIST index_is_valid: valid_index (index) array_item (i: INTEGER_32): EV_MODEL assign array_put -- Entry at index i, if in index interval. -- Was declared in {TO_SPECIAL} as synonym of `at`. -- (from TO_SPECIAL) require -- from TO_SPECIAL valid_index: array_valid_index (i) item_for_iteration: EV_MODEL -- Item at current position -- (from LINEAR) require -- from LINEAR not_off: not off last: like first -- Item at last position -- (from ARRAYED_LIST) require -- from CHAIN not_empty: not is_empty log (v: REAL_64): REAL_64 -- Natural logarithm of v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class log10 (v: REAL_64): REAL_64 -- Base 10 logarithm of v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class log_2 (v: REAL_64): REAL_64 -- Base 2 logarithm of v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class maximum_x: INTEGER_32 -- Right boundary. -- (from EV_MODEL_MOVE_HANDLE) maximum_y: INTEGER_32 -- Bottom boundary. -- (from EV_MODEL_MOVE_HANDLE) minimum_x: INTEGER_32 -- Left boundary. -- (from EV_MODEL_MOVE_HANDLE) minimum_y: INTEGER_32 -- Top boundary. -- (from EV_MODEL_MOVE_HANDLE) move_button: INTEGER_32 -- Mouse button used to move. -- Default: 1 -- (from EV_MODEL_MOVE_HANDLE) new_cursor: ARRAYED_LIST_ITERATION_CURSOR [EV_MODEL] -- Fresh cursor associated with current structure -- (from ARRAYED_LIST) require -- from ITERABLE True ensure -- from ITERABLE result_attached: Result /= Void frozen object_id: INTEGER_32 -- Unique for current object in any given session -- (from IDENTIFIED) ensure -- from IDENTIFIED valid_id: Result > 0 implies id_object (Result) = Current pebble: detachable ANY -- Data to be transported by pick and drop mechanism. -- (from EV_MODEL) pebble_function: detachable FUNCTION [detachable ANY] -- Returns data to be transported by pick and drop mechanism. -- When not Void, `pebble` is ignored. -- (from EV_MODEL) Pi: REAL_64 = 3.1415926535897932384626433832795029 -- (from MATH_CONST) Pi_2: REAL_64 = 1.5707963267948966192313216916397514 -- (from MATH_CONST) Pi_4: REAL_64 = 0.7853981633974483096156608458198757 -- (from MATH_CONST) point: EV_COORDINATE -- First point of Current. -- (from EV_MODEL_SINGLE_POINTED) ensure -- from EV_MODEL_SINGLE_POINTED result_exists: Result /= Void result_x_equal_point_x: Result.x = point_x result_y_eqyal_point_y: Result.y = point_y point_count: INTEGER_32 -- Current has one point. -- (from EV_MODEL_SINGLE_POINTED) require -- from EV_MODEL True ensure -- from EV_MODEL correct: Result = point_array.count point_relative: EV_COORDINATE -- `point` relative to `group`.`point`. -- (from EV_MODEL_SINGLE_POINTED) ensure -- from EV_MODEL_SINGLE_POINTED result_exists: Result /= Void result_x_equal_point_x_relative: Result.x = point_x_relative result_y_eqyal_point_y_relative: Result.y = point_y_relative point_x: INTEGER_32 -- x position of `point`. -- (from EV_MODEL_GROUP) point_x_relative: INTEGER_32 -- horizontal distance between `point_x` and `group`.`point_x`. -- (from EV_MODEL_SINGLE_POINTED) point_y: INTEGER_32 -- y position of `point`. -- (from EV_MODEL_GROUP) point_y_relative: INTEGER_32 -- vertical distance between `point_y` and `group`.`point_y`. -- (from EV_MODEL_SINGLE_POINTED) pointer_style: detachable EV_POINTER_STYLE -- Cursor displayed when pointer is over this figure. -- (from EV_MODEL) real_position_agent: detachable FUNCTION [INTEGER_32, INTEGER_32, TUPLE [x: INTEGER_32; y: INTEGER_32]] -- User defined function that translates actual coordinates to -- the coordinates Current will be displayed on. -- (from EV_MODEL_MOVE_HANDLE) rotate_button: INTEGER_32 -- Mouse button used to rotate. -- Default: 2 -- (from EV_MODEL_MOVE_HANDLE) scale_button: INTEGER_32 -- Mouse button used to scale. -- Default: 3 -- (from EV_MODEL_MOVE_HANDLE) Shared_environment: EV_ENVIRONMENT -- Shared EV_ENVIRONMENT object. -- (from EV_SHARED_APPLICATION) sine (v: REAL_64): REAL_64 -- Trigonometric sine of radian v approximated -- in range [-pi/4, +pi/4]. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class sqrt (v: REAL_64): REAL_64 -- Square root of v. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class Sqrt2: REAL_64 = 1.4142135623730950488016887242096981 -- Square root of 2 -- (from MATH_CONST) tangent (v: REAL_64): REAL_64 -- Trigonometric tangent of radian v approximated -- in range [-pi/4, +pi/4]. -- (from DOUBLE_MATH) ensure -- from DOUBLE_MATH instance_free: class target_data_function: detachable FUNCTION [like pebble, EV_PND_TARGET_DATA] -- Function for computing target meta data based on source pebble. -- Primarily used for Pick and Drop target menu. -- (from EV_ABSTRACT_PICK_AND_DROPABLE) note option: stable target_name: detachable READABLE_STRING_GENERAL -- Optional textual name describing Current pick and drop hole. -- (from EV_ABSTRACT_PICK_AND_DROPABLE) note option: stable to_array: ARRAY [EV_MODEL] -- Share content to be used as an ARRAY. -- Note that although the content is shared, it might -- not be shared when a resizing occur in either ARRAY or Current. -- (from ARRAYED_LIST) ensure -- from ARRAYED_LIST to_array_attached: Result /= Void array_lower_set: Result.lower = 1 array_upper_set: Result.upper = count shared_area: Result.area = area world: detachable EV_MODEL_WORLD -- The world Current is part of. Void if Current is -- not part of a world -- (from EV_MODEL) x: INTEGER_32 -- `x` position of the center on the screen. -- (from EV_MODEL) y: INTEGER_32 -- `y` position of the center on the screen . -- (from EV_MODEL) feature -- Measurement additional_space: INTEGER_32 -- Proposed number of additional items -- (from RESIZABLE) ensure -- from RESIZABLE at_least_one: Result >= 1 capacity: INTEGER_32 -- Number of items that may be stored -- (from ARRAYED_LIST) ensure -- from BOUNDED capacity_non_negative: Result >= 0 count: INTEGER_32 -- Number of items. -- (from ARRAYED_LIST) require -- from FINITE True require -- from READABLE_INDEXABLE True ensure -- from FINITE count_non_negative: Result >= 0 Growth_percentage: INTEGER_32 = 50 -- Percentage by which structure will grow automatically -- (from RESIZABLE) Lower: INTEGER_32 = 1 -- Minimum index. -- (from CHAIN) Minimal_increase: INTEGER_32 = 5 -- Minimal number of additional items -- (from RESIZABLE) occurrences (v: like item): INTEGER_32 -- Number of times v appears. -- (Reference or object equality, -- based on `object_comparison`.) -- (from CHAIN) require -- from BAG True require -- from LINEAR True ensure -- from BAG non_negative_occurrences: Result >= 0 upper: INTEGER_32 -- Maximum index. -- Use `count` instead. -- (from ARRAYED_LIST) ensure -- from ARRAYED_LIST definition: Result = count feature -- Comparison frozen deep_equal (a: detachable ANY; b: like arg #1): BOOLEAN -- Are a and b either both void -- or attached to isomorphic object structures? -- (from ANY) ensure -- from ANY instance_free: class shallow_implies_deep: standard_equal (a, b) implies Result both_or_none_void: (a = Void) implies (Result = (b = Void)) same_type: (Result and (a /= Void)) implies (b /= Void and then a.same_type (b)) symmetric: Result implies deep_equal (b, a) frozen equal (a: detachable ANY; b: like arg #1): BOOLEAN -- Are a and b either both void or attached -- to objects considered equal? -- (from ANY) ensure -- from ANY instance_free: class definition: Result = (a = Void and b = Void) or else ((a /= Void and b /= Void) and then a.is_equal (b)) frozen is_deep_equal alias "≡≡≡" (other: EG_EDGE): BOOLEAN -- Are Current and other attached to isomorphic object structures? -- (from ANY) require -- from ANY other_not_void: other /= Void ensure -- from ANY shallow_implies_deep: standard_is_equal (other) implies Result same_type: Result implies same_type (other) symmetric: Result implies other.is_deep_equal (Current) is_equal (other: EG_EDGE): BOOLEAN -- Is other attached to an object considered -- equal to current object? -- (from ANY) require -- from ANY other_not_void: other /= Void ensure -- from ANY symmetric: Result implies other ~ Current consistent: standard_is_equal (other) implies Result ensure then -- from LIST indices_unchanged: index = old index and other.index = old other.index true_implies_same_size: Result implies count = other.count frozen standard_equal (a: detachable ANY; b: like arg #1): BOOLEAN -- Are a and b either both void or attached to -- field-by-field identical objects of the same type? -- Always uses default object comparison criterion. -- (from ANY) ensure -- from ANY instance_free: class definition: Result = (a = Void and b = Void) or else ((a /= Void and b /= Void) and then a.standard_is_equal (b)) frozen standard_is_equal alias "≜" (other: EG_EDGE): BOOLEAN -- Is other attached to an object of the same type -- as current object, and field-by-field identical to it? -- (from ANY) require -- from ANY other_not_void: other /= Void ensure -- from ANY same_type: Result implies same_type (other) symmetric: Result implies other.standard_is_equal (Current) feature -- Status report after: BOOLEAN -- Is there no valid cursor position to the right of cursor? -- (from LIST) require -- from LINEAR True all_default: BOOLEAN -- Are all items set to default values? -- (from ARRAYED_LIST) require -- from ARRAYED_LIST has_default: ({EV_MODEL}).has_default before: BOOLEAN -- Is there no valid cursor position to the left of cursor? -- (from LIST) require -- from BILINEAR True changeable_comparison_criterion: BOOLEAN -- May `object_comparison` be changed? -- (Answer: yes by default.) -- (from CONTAINER) conforms_to (other: ANY): BOOLEAN -- Does type of current object conform to type -- of other (as per Eiffel: The Language, chapter 13)? -- (from ANY) require -- from ANY other_not_void: other /= Void exhausted: BOOLEAN -- Has structure been completely explored? -- (from LINEAR) ensure -- from LINEAR exhausted_when_off: off implies Result extendible: BOOLEAN -- May new items be added? (Answer: yes.) -- (from DYNAMIC_CHAIN) require -- from COLLECTION True full: BOOLEAN -- Is structure full? -- (from BOUNDED) require -- from BOX True has (v: like item): BOOLEAN -- Does current include v? -- (based on v.id) -- (from EV_MODEL_GROUP) require -- from CONTAINER True ensure -- from CONTAINER not_found_in_empty: Result implies not is_empty has_deep (figure: EV_MODEL): BOOLEAN -- Does any item contains figure? -- (from EV_MODEL_GROUP) frozen id_freed: BOOLEAN -- Has Current been removed from the table? -- (from IDENTIFIED) invalid_rectangle: detachable EV_RECTANGLE -- Rectangle that needs erasing. -- Void if no change is made. -- (from EV_MODEL_GROUP) is_always_shown: BOOLEAN -- Is figure always shown? -- (Or only when pointer over figure?) -- (from EV_MODEL_MOVE_HANDLE) is_empty: BOOLEAN -- Is structure empty? -- (from FINITE) is_grouped: BOOLEAN -- Is grouped? -- (from EV_MODEL_GROUP) is_hashable: BOOLEAN -- May current object be hashed? -- (True by default.) -- (from HASHABLE) is_inserted (v: EV_MODEL): BOOLEAN -- Has v been inserted at the end by the most recent `put` or -- `extend`? -- (from ARRAYED_LIST) is_moving: BOOLEAN -- Does Current move its items? -- Default: True -- (from EV_MODEL_MOVE_HANDLE) is_rotatable: BOOLEAN -- Is this figure group rotatable? -- (from EV_MODEL_GROUP) is_rotating: BOOLEAN -- Does Current rotate its items? -- Default: True -- (from EV_MODEL_MOVE_HANDLE) is_scalable: BOOLEAN -- Is this figure group scalable? -- (from EV_MODEL_GROUP) is_scaling: BOOLEAN -- Does Current scale its items? -- Default: True -- (from EV_MODEL_MOVE_HANDLE) is_snapping: BOOLEAN -- Does Current snap to grid when grid is enabled? -- Default: True -- (from EV_MODEL_MOVE_HANDLE) is_transformable: BOOLEAN -- Is this figure group transformable? -- (from EV_MODEL_GROUP) isfirst: BOOLEAN -- Is cursor at first position? -- (from CHAIN) ensure -- from CHAIN valid_position: Result implies not is_empty islast: BOOLEAN -- Is cursor at last position? -- (from CHAIN) ensure -- from CHAIN valid_position: Result implies not is_empty object_comparison: BOOLEAN -- Must search operations use `equal` rather than = -- for comparing references? (Default: no, use =.) -- (from CONTAINER) off: BOOLEAN -- Is there no current item? -- (from CHAIN) require -- from TRAVERSABLE True prunable: BOOLEAN -- May items be removed? (Answer: yes.) -- (from ARRAYED_LIST) require -- from COLLECTION True readable: BOOLEAN -- Is there a current item that may be read? -- (from SEQUENCE) require -- from ACTIVE True replaceable: BOOLEAN -- Can current item be replaced? -- (from ACTIVE) resizable: BOOLEAN -- May `capacity` be changed? (Answer: yes.) -- (from RESIZABLE) same_type (other: ANY): BOOLEAN -- Is type of current object identical to type of other? -- (from ANY) require -- from ANY other_not_void: other /= Void ensure -- from ANY definition: Result = (conforms_to (other) and other.conforms_to (Current)) update_rectangle: detachable EV_RECTANGLE -- Rectangle that needs redrawing. -- Void if no change is made. -- (from EV_MODEL_GROUP) valid_cursor (p: CURSOR): BOOLEAN -- Can the cursor be moved to position p? -- (from ARRAYED_LIST) valid_cursor_index (i: INTEGER_32): BOOLEAN -- Is i correctly bounded for cursor movement? -- (from CHAIN) ensure -- from CHAIN valid_cursor_index_definition: Result = ((i >= 0) and (i <= count + 1)) valid_index (i: INTEGER_32): BOOLEAN -- Is i a valid index? -- (from ARRAYED_LIST) require -- from READABLE_INDEXABLE True require -- from TABLE True ensure -- from READABLE_INDEXABLE only_if_in_index_set: Result implies (Lower <= i and i <= count) ensure then -- from CHAIN valid_index_definition: Result = ((i >= 1) and (i <= count)) array_valid_index (i: INTEGER_32): BOOLEAN -- Is i within the bounds of Current? -- (from TO_SPECIAL) writable: BOOLEAN -- Is there a current item that may be modified? -- (from SEQUENCE) require -- from ACTIVE True feature -- Status setting compare_objects -- Ensure that future search operations will use `equal` -- rather than = for comparing references. -- (from CONTAINER) require -- from CONTAINER changeable_comparison_criterion: changeable_comparison_criterion ensure -- from CONTAINER object_comparison compare_references -- Ensure that future search operations will use = -- rather than `equal` for comparing references. -- (from CONTAINER) require -- from CONTAINER changeable_comparison_criterion: changeable_comparison_criterion ensure -- from CONTAINER reference_comparison: not object_comparison disable_always_shown -- Set `is_always_shown` False. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE not_always_shown: not is_always_shown disable_moving -- Set `is_moving` to False. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE moving_disabled: is_moving = False disable_rotating -- Set `is_moving` to False. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE rotating_disabled: is_rotating = False disable_scaling -- Set `is_moving` to False. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE scaling_disabled: is_scaling = False disable_snapping -- Set `is_snapping` False. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE snap_disabled: not is_snapping enable_always_shown -- Set `is_always_shown` True. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE is_always_shown: is_always_shown enable_moving -- Set `is_moving` to True. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE moving_enabled: is_moving = True enable_rotating -- Set `is_moving` to True. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE rotating_enabled: is_rotating = True enable_scaling -- Set `is_moving` to True. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE scaling_enabled: is_scaling = True enable_snapping -- Set `is_snapping` True. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE snap_enabled: is_snapping set_point_position_relative (ax, ay: INTEGER_32) -- Set position of `point_relative` to (ax, ay). -- (from EV_MODEL_SINGLE_POINTED) set_target_data_function (a_function: FUNCTION [like pebble, EV_PND_TARGET_DATA]) -- Set a_function to compute target meta data based on transport source. -- Overrides any `target_name` set with `set_target_name`. -- (from EV_ABSTRACT_PICK_AND_DROPABLE) require -- from EV_ABSTRACT_PICK_AND_DROPABLE a_function_not_void: a_function /= Void ensure -- from EV_ABSTRACT_PICK_AND_DROPABLE target_data_function_assigned: target_data_function /= Void and then target_data_function.is_equal (a_function) set_target_name (a_name: READABLE_STRING_GENERAL) -- Assign a_name to `target_name`. -- (from EV_ABSTRACT_PICK_AND_DROPABLE) require -- from EV_ABSTRACT_PICK_AND_DROPABLE a_name_not_void: a_name /= Void ensure -- from EV_ABSTRACT_PICK_AND_DROPABLE target_name_assigned: attached target_name as l_target_name and then a_name /= l_target_name and then a_name.same_string (l_target_name) snap_to_grid -- Move to the most nearby point on the grid. -- (from EV_MODEL_MOVE_HANDLE) feature -- Cursor movement back -- Move cursor one position backward. -- (from ARRAYED_LIST) require -- from BILINEAR not_before: not before finish -- Move cursor to last position if any. -- (from ARRAYED_LIST) require -- from LINEAR True ensure then -- from CHAIN at_last: not is_empty implies islast ensure then -- from ARRAYED_LIST before_when_empty: is_empty implies before forth -- Move cursor one position forward. -- (from ARRAYED_LIST) require -- from LINEAR not_after: not after ensure then -- from LIST moved_forth: index = old index + 1 go_i_th (i: INTEGER_32) -- Move cursor to i-th position. -- (from ARRAYED_LIST) require -- from CHAIN valid_cursor_index: valid_cursor_index (i) ensure -- from CHAIN position_expected: index = i go_to (p: CURSOR) -- Move cursor to position p. -- (from ARRAYED_LIST) require -- from CURSOR_STRUCTURE cursor_position_valid: valid_cursor (p) move (i: INTEGER_32) -- Move cursor i positions. -- (from ARRAYED_LIST) ensure -- from CHAIN too_far_right: (old index + i > count) implies exhausted too_far_left: (old index + i < 1) implies exhausted expected_index: (not exhausted) implies (index = old index + i) search (v: like item) -- Move to first position (at or after current -- position) where `item` and v are equal. -- If structure does not include v ensure that -- `exhausted` will be true. -- (Reference or object equality, -- based on `object_comparison`.) -- (from ARRAYED_LIST) require -- from LINEAR True ensure -- from LINEAR object_found: (not exhausted and object_comparison) implies v ~ item item_found: (not exhausted and not object_comparison) implies v = item start -- Move cursor to first position if any. -- (from ARRAYED_LIST) require -- from TRAVERSABLE True ensure then -- from CHAIN at_first: not is_empty implies isfirst ensure then -- from ARRAYED_LIST after_when_empty: is_empty implies after feature -- Element change bring_forward (a_figure: EV_MODEL) -- Bring a_figure one layer forwards. -- (from EV_MODEL_GROUP) require -- from EV_MODEL_GROUP a_figure_in_figures: has (a_figure) ensure -- from EV_MODEL_GROUP a_figure_in_group: a_figure.group = Current a_figure_in_current: has (a_figure) bring_to_front (a_figure: EV_MODEL) -- Bring a_figure to the top most layer -- (from EV_MODEL_GROUP) require -- from EV_MODEL_GROUP a_figure_in_figures: has (a_figure) ensure -- from EV_MODEL_GROUP is_last: last = a_figure a_figure_in_group: a_figure.group = Current a_figure_in_current: has (a_figure) fill (other: CONTAINER [EV_MODEL]) -- Fill with as many items of other as possible. -- The representations of other and current structure -- need not be the same. -- (from CHAIN) require -- from COLLECTION other_not_void: other /= Void extendible: extendible array_put (v: EV_MODEL; i: INTEGER_32) -- Replace i-th entry, if in index interval, by v. -- (from TO_SPECIAL) require -- from TO_SPECIAL valid_index: array_valid_index (i) ensure -- from TO_SPECIAL inserted: array_item (i) = v put (v: like item) -- Replace current item by v. -- (Synonym for `replace`) -- (from CHAIN) require -- from CHAIN writeable: writable replaceable: replaceable ensure -- from CHAIN same_count: count = old count is_inserted: is_inserted (v) sequence_put (v: like item) -- Add v to end. -- (from SEQUENCE) require -- from COLLECTION extendible: extendible ensure -- from COLLECTION item_inserted: is_inserted (v) ensure then -- from SEQUENCE new_count: count = old count + 1 put_front (v: like item) -- Add v to the beginning. -- Do not move cursor. -- (from ARRAYED_LIST) require -- from DYNAMIC_CHAIN extendible: extendible ensure -- from DYNAMIC_CHAIN new_count: count = old count + 1 item_inserted: first = v put_i_th (v: like i_th; i: INTEGER_32) -- Replace i-th entry, if in index interval, by v. -- (from ARRAYED_LIST) require -- from TABLE valid_key: valid_index (i) require -- from TABLE valid_key: valid_index (i) ensure -- from TABLE inserted: i_th (i) = v put_left (v: like item) -- Add v to the left of current position. -- Do not move cursor. -- (from ARRAYED_LIST) require -- from DYNAMIC_CHAIN extendible: extendible not_before: not before ensure -- from DYNAMIC_CHAIN new_count: count = old count + 1 new_index: index = old index + 1 put_right (v: like item) -- Add v to the right of current position. -- Do not move cursor. -- (from ARRAYED_LIST) require -- from DYNAMIC_CHAIN extendible: extendible not_after: not after ensure -- from DYNAMIC_CHAIN new_count: count = old count + 1 same_index: index = old index regroup -- Group the figures in the group. -- (from EV_MODEL_GROUP) require -- from EV_MODEL_GROUP not_is_grouped: not is_grouped not_is_in_group: not is_in_group ensure -- from EV_MODEL_GROUP is_grouped: is_grouped all_grouped: for_all (agent {EV_MODEL}.is_in_group) center_is_invalid: not is_center_valid remove_pebble -- Make `pebble` Void and `pebble_function` `Void, -- Removing transport. -- (from EV_MODEL) ensure -- from EV_ABSTRACT_PICK_AND_DROPABLE pebble_removed: pebble = Void and pebble_function = Void rotate (an_angle: REAL_64) -- Rotate around the center for an_angle. -- (from EV_MODEL_GROUP) require -- from EV_MODEL is_rotatable: is_rotatable ensure -- from EV_MODEL center_valid: is_center_valid ensure then -- from EV_MODEL_GROUP angle_equal_an_angle: angle = old angle + an_angle rotate_around (an_angle: REAL_64; ax, ay: INTEGER_32) -- Rotate around (ax, ay) for an_angle. -- (from EV_MODEL) require -- from EV_MODEL is_rotatable: is_rotatable ensure -- from EV_MODEL center_valid: is_center_valid scale (a_scale: REAL_64) -- Scale to x and y direction for a_scale. -- (from EV_MODEL) require -- from EV_MODEL is_scalable: is_scalable a_scale_bigger_zero: a_scale > 0.0 scale_abs (a_scale: REAL_64) -- Scale to x and y direction for a_scale. -- Do not rotate around `angle` first. -- (from EV_MODEL) require -- from EV_MODEL is_scalable: is_scalable a_scale_bigger_zero: a_scale > 0.0 scale_x (a_scale_x: REAL_64) -- Scale to x direction for a_scale_x. -- (from EV_MODEL) require -- from EV_MODEL is_scalable: is_scalable a_scale_x_bigger_zero: a_scale_x > 0.0 scale_x_abs (a_scale_x: REAL_64) -- Scale absolute to x direction for a_scale_x. -- Do not rotate around `angle` first. -- (from EV_MODEL) require -- from EV_MODEL is_scalable: is_scalable a_scale_x_bigger_zero: a_scale_x > 0.0 scale_y (a_scale_y: REAL_64) -- Scale to y direction for a_scale_y. -- (from EV_MODEL) require -- from EV_MODEL is_scalable: is_scalable a_scale_y_bigger_zero: a_scale_y > 0.0 scale_y_abs (a_scale_y: REAL_64) -- Scale to y direction for a_scale_y. -- Do not rotate around `angle` first. -- (from EV_MODEL) require -- from EV_MODEL is_scalable: is_scalable a_scale_y_bigger_zero: a_scale_y > 0.0 send_backward (a_figure: EV_MODEL) -- Send a_figure one layer backwards. -- (from EV_MODEL_GROUP) require -- from EV_MODEL_GROUP a_figure_in_figures: has (a_figure) ensure -- from EV_MODEL_GROUP a_figure_in_group: a_figure.group = Current a_figure_in_current: has (a_figure) send_to_back (a_figure: EV_MODEL) -- Send a_figure to the bottom most layer. -- (from EV_MODEL_GROUP) require -- from EV_MODEL_GROUP a_figure_in_figures: has (a_figure) ensure -- from EV_MODEL_GROUP is_at_front: first = a_figure a_figure_in_group: a_figure.group = Current a_figure_in_current: has (a_figure) set_accept_cursor (a_cursor: detachable like accept_cursor) -- Set a_cursor to be displayed when the screen pointer is over a -- target that accepts `pebble` during pick and drop. -- (from EV_MODEL) ensure -- from EV_ABSTRACT_PICK_AND_DROPABLE accept_cursor_assigned: attached a_cursor as l_accept_cursor implies l_accept_cursor ~ accept_cursor set_deny_cursor (a_cursor: detachable like deny_cursor) -- Set a_cursor to be displayed when the screen pointer is not -- over a valid target. -- (from EV_MODEL) ensure -- from EV_ABSTRACT_PICK_AND_DROPABLE deny_cursor_assigned: attached a_cursor as l_deny_cursor implies l_deny_cursor ~ deny_cursor set_maximum_x (a_x: INTEGER_32) -- Assign a_x to `maximum_x`. -- (from EV_MODEL_MOVE_HANDLE) set_maximum_y (a_y: INTEGER_32) -- Assign a_y to `maximum_y`. -- (from EV_MODEL_MOVE_HANDLE) set_minimum_x (a_x: INTEGER_32) -- Assign a_x to `minimum_x`. -- (from EV_MODEL_MOVE_HANDLE) set_minimum_y (a_y: INTEGER_32) -- Assign a_y to `minimum_y`. -- (from EV_MODEL_MOVE_HANDLE) set_move_button (nr: INTEGER_32) -- Set `move_button` to nr. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE set: move_button = nr set_pebble (a_pebble: like pebble) -- Assign a_pebble to `pebble`. -- (from EV_MODEL) require -- from EV_ABSTRACT_PICK_AND_DROPABLE a_pebble_not_void: a_pebble /= Void ensure -- from EV_ABSTRACT_PICK_AND_DROPABLE pebble_assigned: pebble = a_pebble set_pebble_function (a_function: attached like pebble_function) -- Set a_function to compute `pebble`. -- (from EV_MODEL) require -- from EV_ABSTRACT_PICK_AND_DROPABLE a_function_not_void: a_function /= Void a_function_takes_two_integer_open_operands: a_function.valid_operands ([1, 1]) ensure -- from EV_ABSTRACT_PICK_AND_DROPABLE pebble_function_assigned: pebble_function = a_function set_point_position (a_x, a_y: INTEGER_32) -- Set position of `point` to (a_x, a_y). -- (from EV_MODEL_GROUP) set_pointer_style (a_cursor: like pointer_style) -- Assign a_cursor to `pointer_style`. -- (from EV_MODEL) require -- from EV_MODEL a_cursor_not_void: a_cursor /= Void ensure -- from EV_MODEL pointer_style_assigned: pointer_style = a_cursor set_real_position_agent (an_agent: like real_position_agent) -- Assign an_agent to `real_position_agent`. -- (from EV_MODEL_MOVE_HANDLE) require -- from EV_MODEL_MOVE_HANDLE an_agent_not_void: an_agent /= Void ensure -- from EV_MODEL_MOVE_HANDLE real_position_agent_assigned: real_position_agent = an_agent set_rotate_button (nr: INTEGER_32) -- Set `rotate_button` to nr. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE set: rotate_button = nr set_scale_button (nr: INTEGER_32) -- Set `scale_button` to nr. -- (from EV_MODEL_MOVE_HANDLE) ensure -- from EV_MODEL_MOVE_HANDLE set: scale_button = nr set_x (a_x: INTEGER_32) -- Set `x` to an_x. -- (from EV_MODEL_GROUP) ensure -- from EV_MODEL x_set: a_x = x center_valid: is_center_valid set_x_y (a_x, a_y: INTEGER_32) -- Set `x` to an_x. -- (from EV_MODEL_GROUP) ensure -- from EV_MODEL set: a_x = x and a_y = y center_valid: is_center_valid set_y (a_y: INTEGER_32) -- Set `y` to an_y. -- (from EV_MODEL_GROUP) ensure -- from EV_MODEL y_set: a_y = y center_valid: is_center_valid transform (a_transformation: EV_MODEL_TRANSFORMATION) -- Transform all points in `point_array` using a_transformation. -- You can do any transformation you want. You can -- for example rotate Current around an other point -- than the center. -- (from EV_MODEL) require -- from EV_MODEL a_transformation_not_void: a_transformation /= Void is_transformable: is_transformable ungroup -- Ungroup all figures. -- (from EV_MODEL_GROUP) require -- from EV_MODEL_GROUP is_grouped: is_grouped not_is_in_group: not is_in_group ensure -- from EV_MODEL_GROUP is_ungrouped: not is_grouped none_is_in_a_group: not there_exists (agent {EV_MODEL}.is_in_group) center_is_invalid: not is_center_valid feature -- Removal dispose -- Free the entry associated with `object_id` if any -- (from IDENTIFIED) require -- from DISPOSABLE True ensure then -- from IDENTIFIED object_freed: id_freed frozen free_id -- Free the entry associated with `object_id` if any. -- (from IDENTIFIED) ensure -- from IDENTIFIED object_freed: id_freed prune (v: like item) -- Remove first occurrence of v, if any, -- after cursor position. -- Move cursor to right neighbor. -- (or `after` if no right neighbor or v does not occur) -- (from ARRAYED_LIST) require -- from COLLECTION prunable: prunable remove_i_th (i: INTEGER_32) -- Remove item at index i. -- Move cursor to next neighbor (or `after` if no next neighbor) if it is at i-th position. -- Do not change cursor otherwise. -- (from ARRAYED_LIST) require -- from DYNAMIC_TABLE prunable: prunable valid_key: valid_index (i) ensure then -- from DYNAMIC_CHAIN new_count: count = old count - 1 same_index_if_below: index <= i implies index = old index new_index_if_above: index > i implies index = old index - 1 same_leading_items: ∀ c: old twin ¦ @ c.target_index < i implies c = i_th (.target_index) same_trailing_items: ∀ c: old twin ¦ .target_index > i implies c = i_th (.target_index - 1) remove_left -- Remove item to the left of cursor position. -- Do not move cursor. -- (from ARRAYED_LIST) require -- from DYNAMIC_CHAIN left_exists: index > 1 ensure -- from DYNAMIC_CHAIN new_count: count = old count - 1 new_index: index = old index - 1 remove_right -- Remove item to the right of cursor position -- Do not move cursor -- (from ARRAYED_LIST) require -- from DYNAMIC_CHAIN right_exists: index < count ensure -- from DYNAMIC_CHAIN new_count: count = old count - 1 same_index: index = old index feature -- Resizing automatic_grow -- Change the capacity to accommodate at least -- `growth_percentage` more items. -- (from RESIZABLE) require -- from RESIZABLE resizable: resizable ensure -- from RESIZABLE increased_capacity: capacity >= old capacity + old additional_space grow (i: INTEGER_32) -- Change the capacity to at least i. -- (from ARRAYED_LIST) require -- from RESIZABLE resizable: resizable ensure -- from RESIZABLE new_capacity: capacity >= i resize (new_capacity: INTEGER_32) -- Resize list so that it can contain -- at least n items. Do not lose any item. -- (from ARRAYED_LIST) require -- from ARRAYED_LIST resizable: resizable new_capacity_large_enough: new_capacity >= capacity ensure -- from ARRAYED_LIST capacity_set: capacity >= new_capacity trim -- Decrease `capacity` to the minimum value. -- Apply to reduce allocated storage. -- (from ARRAYED_LIST) require -- from RESIZABLE True ensure -- from RESIZABLE same_count: count = old count minimal_capacity: capacity = count ensure then -- from ARRAYED_LIST same_items: to_array.same_items (old to_array) feature -- Conversion linear_representation: LINEAR [EV_MODEL] -- Representation as a linear structure -- (from LINEAR) require -- from CONTAINER True feature -- Duplication copy (other: EG_EDGE) -- Update current object using fields of object attached -- to other, so as to yield equal objects. -- (from ANY) require -- from ANY other_not_void: other /= Void type_identity: same_type (other) ensure -- from ANY is_equal: Current ~ other ensure then -- from ARRAYED_LIST equal_areas: area_v2 ~ other.area_v2 frozen deep_copy (other: EG_EDGE) -- Effect equivalent to that of: -- `copy` (other . `deep_twin`) -- (from ANY) require -- from ANY other_not_void: other /= Void ensure -- from ANY deep_equal: deep_equal (Current, other) frozen deep_twin: EG_EDGE -- New object structure recursively duplicated from Current. -- (from ANY) ensure -- from ANY deep_twin_not_void: Result /= Void deep_equal: deep_equal (Current, Result) frozen standard_copy (other: EG_EDGE) -- Copy every field of other onto corresponding field -- of current object. -- (from ANY) require -- from ANY other_not_void: other /= Void type_identity: same_type (other) ensure -- from ANY is_standard_equal: standard_is_equal (other) frozen standard_twin: EG_EDGE -- New object field-by-field identical to other. -- Always uses default copying semantics. -- (from ANY) ensure -- from ANY standard_twin_not_void: Result /= Void equal: standard_equal (Result, Current) frozen twin: EG_EDGE -- New object equal to Current -- `twin` calls `copy`; to change copying/twinning semantics, redefine `copy`. -- (from ANY) ensure -- from ANY twin_not_void: Result /= Void is_equal: Result ~ Current feature -- Basic operations frozen default: detachable EG_EDGE -- Default value of object's type -- (from ANY) frozen default_pointer: POINTER -- Default value of type POINTER -- (Avoid the need to write p.`default` for -- some p of type POINTER.) -- (from ANY) ensure -- from ANY instance_free: class default_rescue -- Process exception for routines with no Rescue clause. -- (Default: do nothing.) -- (from ANY) frozen do_nothing -- Execute a null action. -- (from ANY) ensure -- from ANY instance_free: class feature -- Implementation between (n, a, b: REAL_64): BOOLEAN -- Is n a value between a and b? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class delta_x (angle: REAL_64; length: REAL_64): REAL_64 -- Get dx component of line segment with length and `angle`. -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class delta_y (angle: REAL_64; length: REAL_64): REAL_64 -- Get dy component of line segment with length and `angle`. -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class distance (x1, y1, x2, y2: REAL_64): REAL_64 -- Calculate distance between (x1, y1) and (x2, y2). -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class distance_from_line (x, y, x1, y1, x2, y2: REAL_64): REAL_64 -- Calculate distance between (`x`, `y`) and (x1, y1)-(x2, y2). -- The line is considered to be infinite. -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class line_angle (x1, y1, x2, y2: REAL_64): REAL_64 -- Return angle of line from (x1, y1) to (x2, y2) relative to world. -- clockwise. 0.0 is 3 o'clock. -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class modulo (a, b: REAL_64): REAL_64 -- a modulo b. -- (from EV_MODEL_DOUBLE_MATH) require -- from EV_MODEL_DOUBLE_MATH divisible: b /= 0.0 ensure -- from EV_MODEL_DOUBLE_MATH in_interval: Result >= 0.0 and Result < b instance_free: class point_on_ellipse (x, y, xc, yc, r1, r2: REAL_64): BOOLEAN -- Is (`x`, `y`) inside specified ellipse? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH equals_point_on_rotated: Result = point_on_rotated_ellipse (x, y, xc, yc, r1, r2, 0.0) instance_free: class point_on_ellipse_boundary (x, y, xc, yc, r1, r2, width: REAL_64): BOOLEAN -- Is (`x`, `y`) on specified ellipse border? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class point_on_line (x, y, x1, y1, x2, y2, width: REAL_64): BOOLEAN -- Is (`x`, `y`) on line from (x2, y2) to (x1, y1) with width? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class point_on_polygon (x, y: REAL_64; points: SPECIAL [EV_COORDINATE]): BOOLEAN -- Is (`x`, `y`) contained in polygon with points? -- Based on code by Hanpeter van Vliet. -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class point_on_rectangle (x, y, x1, y1, x2, y2: REAL_64): BOOLEAN -- Is (`x`, `y`) inside specified box? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class point_on_rotated_ellipse (x, y, xc, yc, r1, r2, angle: REAL_64): BOOLEAN -- Is ('x', `y`) inside specified ellipse? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class point_on_rotated_ellipse_boundary (x, y, xc, yc, r1, r2, angle, width: REAL_64): BOOLEAN -- Is (`x`, `y`) on specified ellipse border? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class point_on_segment (x, y, x1, y1, x2, y2, width: REAL_64): BOOLEAN -- Is (`x`, `y`) on segment [(x2, y2), (x1, y1)] with width? -- (from EV_MODEL_DOUBLE_MATH) ensure -- from EV_MODEL_DOUBLE_MATH instance_free: class feature -- Action sequences conforming_pick_actions: EV_NOTIFY_ACTION_SEQUENCE -- Actions to be performed when a pebble that fits this hole is -- picked up from another source. -- (when drop_actions.accepts_pebble (pebble)) -- (from EV_MODEL) drop_actions: EV_PND_ACTION_SEQUENCE -- Actions to take when pick and drop transport drops on Current. -- (from EV_MODEL) pick_actions: EV_PND_START_ACTION_SEQUENCE -- Actions to be performed when `pebble` is picked up. -- (from EV_MODEL) pointer_button_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE -- Actions to be performed when screen pointer button is pressed. -- (from EV_MODEL) pointer_button_release_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE -- Actions to be performed when screen pointer button is released. -- (from EV_MODEL) pointer_double_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE -- Actions to be performed when screen pointer is double clicked. -- (from EV_MODEL) pointer_enter_actions: EV_NOTIFY_ACTION_SEQUENCE -- Actions to be performed when screen pointer enters widget. -- (from EV_MODEL) pointer_leave_actions: EV_NOTIFY_ACTION_SEQUENCE -- Actions to be performed when screen pointer leaves widget. -- (from EV_MODEL) pointer_motion_actions: EV_POINTER_MOTION_ACTION_SEQUENCE -- Actions to be performed when screen pointer moves. -- (from EV_MODEL) feature -- Actions end_actions: EV_NOTIFY_ACTION_SEQUENCE -- Actions called when drag ends. -- (from EV_MODEL_MOVE_HANDLE) move_actions: EV_POINTER_MOTION_ACTION_SEQUENCE -- Actions called when user drags Current. -- (from EV_MODEL_MOVE_HANDLE) rotate_actions: EV_DOUBLE_VALUE_CHANGE_ACTION_SEQUENCE -- Actions called when the user rotates Current -- (from EV_MODEL_MOVE_HANDLE) scale_x_actions: EV_DOUBLE_VALUE_CHANGE_ACTION_SEQUENCE -- Actions called when the user scales Current to x direction. -- (from EV_MODEL_MOVE_HANDLE) scale_y_actions: EV_DOUBLE_VALUE_CHANGE_ACTION_SEQUENCE -- Actions called when the user scales Current to y direction. -- (from EV_MODEL_MOVE_HANDLE) start_actions: EV_NOTIFY_ACTION_SEQUENCE -- Actions called when drag starts. -- (from EV_MODEL_MOVE_HANDLE) feature -- Correction Mismatch_information: MISMATCH_INFORMATION -- Original attribute values of mismatched object -- (from MISMATCH_CORRECTOR) feature -- Events bounding_box: EV_RECTANGLE -- Smallest orthogonal rectangular area Current fits in. -- (from EV_MODEL_GROUP) ensure -- from EV_MODEL result_not_void: Result /= Void internal_is_twin: internal_bounding_box /= Result position_on_figure (a_x, a_y: INTEGER_32): BOOLEAN -- Is the point on (a_x, a_y) on this figure? -- Always returns False, but descendants can override -- it to improve efficiency. -- (from EV_MODEL_GROUP) update_rectangle_to_bounding_box (a_bbox: EV_RECTANGLE) -- Update a_bbox to match `bounding_box` of Current. -- (from EV_MODEL) feature -- Iteration do_all (action: PROCEDURE [EV_MODEL]) -- Apply action to every item, from first to last. -- Semantics not guaranteed if action changes the structure; -- in such a case, apply iterator to clone of structure instead. -- (from ARRAYED_LIST) require -- from TRAVERSABLE action_exists: action /= Void do_all_with_index (action: PROCEDURE [EV_MODEL, INTEGER_32]) -- Apply action to every item, from first to last. -- action receives item and its index. -- Semantics not guaranteed if action changes the structure; -- in such a case, apply iterator to clone of structure instead. -- (from ARRAYED_LIST) require -- from ARRAYED_LIST action_not_void: action /= Void do_if (action: PROCEDURE [EV_MODEL]; test: FUNCTION [EV_MODEL, BOOLEAN]) -- Apply action to every item that satisfies test, from first to last. -- Semantics not guaranteed if action or test changes the structure; -- in such a case, apply iterator to clone of structure instead. -- (from ARRAYED_LIST) require -- from TRAVERSABLE action_exists: action /= Void test_exists: test /= Void do_if_with_index (action: PROCEDURE [EV_MODEL, INTEGER_32]; test: FUNCTION [EV_MODEL, INTEGER_32, BOOLEAN]) -- Apply action to every item that satisfies test, from first to last. -- action and test receive the item and its index. -- Semantics not guaranteed if action or test changes the structure; -- in such a case, apply iterator to clone of structure instead. -- (from ARRAYED_LIST) require -- from ARRAYED_LIST action_not_void: action /= Void test_not_void: test /= Void for_all (test: FUNCTION [EV_MODEL, BOOLEAN]): BOOLEAN -- Is test true for all items? -- (from ARRAYED_LIST) require -- from TRAVERSABLE test_exists: test /= Void ensure then -- from LINEAR empty: is_empty implies Result there_exists (test: FUNCTION [EV_MODEL, BOOLEAN]): BOOLEAN -- Is test true for at least one item? -- (from ARRAYED_LIST) require -- from TRAVERSABLE test_exists: test /= Void feature -- List change append (s: SEQUENCE [EV_MODEL]) -- Append a copy of s. -- (from EV_MODEL_GROUP) require -- from SEQUENCE argument_not_void: s /= Void ensure -- from SEQUENCE new_count: count >= old count extend (fig: like item) -- Add fig to the group. -- (from EV_MODEL_GROUP) require -- from COLLECTION extendible: extendible ensure -- from COLLECTION item_inserted: is_inserted (fig) ensure then -- from EV_MODEL_GROUP fig_in_lookup_table: fig /= Void implies lookup_table.has (fig.id) fig_in_group: fig /= Void implies fig.group = Current force (fig: like item) -- Add fig to the group. -- (from EV_MODEL_GROUP) require -- from SEQUENCE extendible: extendible ensure then -- from SEQUENCE new_count: count = old count + 1 item_inserted: has (fig) ensure then -- from EV_MODEL_GROUP fig_in_lookup_table: fig /= Void implies lookup_table.has (fig.id) fig_in_group: fig /= Void implies fig.group = Current insert (fig: like item; i: INTEGER_32) -- Add fig to the group. -- (from EV_MODEL_GROUP) require -- from ARRAYED_LIST index_small_enough: i <= count index_large_enough: i >= 1 ensure -- from ARRAYED_LIST new_count: count = old count + 1 index_unchanged: index = old index insertion_done: i_th (i) = fig ensure then -- from EV_MODEL_GROUP fig_in_lookup_table: fig /= Void implies lookup_table.has (fig.id) fig_in_group: fig /= Void implies fig.group = Current make_from_array (a: ARRAY [EV_MODEL]) -- Create list from array a. -- (from EV_MODEL_GROUP) require -- from ARRAYED_LIST array_exists: a /= Void ensure -- from ARRAYED_LIST shared: area = a.area correct_position: before filled: count = a.count merge_left (other: ARRAYED_LIST [EV_MODEL]) -- Merge other into group before cursor. -- other will be empty afterwards. -- (from EV_MODEL_GROUP) require -- from DYNAMIC_CHAIN extendible: extendible not_before: not before other_exists: other /= Void not_current: other /= Current ensure -- from DYNAMIC_CHAIN new_count: count = old count + old other.count new_index: index = old index + old other.count other_is_empty: other.is_empty merge_right (other: ARRAYED_LIST [EV_MODEL]) -- Merge other into group after cursor. -- other will be empty afterwards. -- (from EV_MODEL_GROUP) require -- from DYNAMIC_CHAIN extendible: extendible not_after: not after other_exists: other /= Void not_current: other /= Current ensure -- from DYNAMIC_CHAIN new_count: count = old count + old other.count same_index: index = old index other_is_empty: other.is_empty prune_all (fig: like item) -- Remove fig from the group. -- (from EV_MODEL_GROUP) require -- from COLLECTION prunable: prunable ensure -- from COLLECTION no_more_occurrences: not has (fig) ensure then -- from DYNAMIC_CHAIN is_exhausted: exhausted ensure then -- from ARRAYED_LIST is_after: after ensure then -- from EV_MODEL_GROUP item_not_in_lookup_table: fig /= Void implies not lookup_table.has (fig.id) remove -- Remove `item` from figure. -- (from EV_MODEL_GROUP) require -- from ACTIVE prunable: prunable writable: writable ensure then -- from DYNAMIC_LIST after_when_empty: is_empty implies after ensure then -- from ARRAYED_LIST index: index = old index ensure then -- from EV_MODEL_GROUP item_not_in_lookup_table: not lookup_table.has (old item.id) item_not_in_group: not (old item).is_in_group replace (fig: like item) -- Replace current item by fig. -- (from EV_MODEL_GROUP) require -- from ACTIVE writable: writable replaceable: replaceable ensure -- from ACTIVE item_replaced: item = fig ensure then -- from EV_MODEL_GROUP fig_in_lookup_table: fig /= Void implies lookup_table.has (fig.id) item_not_in_lookup_table: not lookup_table.has (old item.id) fig_in_group: fig /= Void implies fig.group = Current item_not_in_group: not (old item).is_in_group swap (i: INTEGER_32) -- Exchange item at i-th position with item -- at cursor position. -- (from EV_MODEL_GROUP) require -- from CHAIN not_off: not off valid_index: valid_index (i) ensure -- from CHAIN swapped_to_item: item = old i_th (i) swapped_from_item: i_th (i) = old item ensure then -- from EV_MODEL_GROUP item_in_lookup_table: lookup_table.has (old item.id) i_in_lookup_table: lookup_table.has (i_th (i).id) item_in_group: (old item).group = Current i_th_in_group: i_th (i).group = Current wipe_out -- Remove all items. -- (from EV_MODEL_GROUP) require -- from COLLECTION prunable: prunable ensure -- from COLLECTION wiped_out: is_empty ensure then -- from DYNAMIC_LIST is_before: before feature -- Output Io: STD_FILES -- Handle to standard file setup -- (from ANY) ensure -- from ANY instance_free: class io_not_void: Result /= Void out: STRING_8 -- New string containing terse printable representation -- of current object -- (from ANY) ensure -- from ANY out_not_void: Result /= Void print (o: detachable ANY) -- Write terse external representation of o -- on standard output. -- (from ANY) ensure -- from ANY instance_free: class frozen tagged_out: STRING_8 -- New string containing terse printable representation -- of current object -- (from ANY) ensure -- from ANY tagged_out_not_void: Result /= Void feature -- Platform Operating_environment: OPERATING_ENVIRONMENT -- Objects available from the operating system -- (from ANY) ensure -- from ANY instance_free: class operating_environment_not_void: Result /= Void feature -- Retrieval correct_mismatch -- Attempt to correct object mismatch using `mismatch_information`. -- (from ARRAYED_LIST) feature -- Status Report accept_cursor: EV_POINTER_STYLE -- Accept cursor set by user. -- To be displayed when the screen pointer is over a target that accepts -- `pebble` during pick and drop. -- (from EV_MODEL) are_events_sent_to_group: BOOLEAN -- Are events for `pointer_motion_actions`, `pointer_button_press_actions`, -- `pointer_double_press_actions`, `pointer_button_release_actions` -- `pointer_enter_actions` and `pointer_leave_actions` send to Currents -- group (if any) even if Current catch the event. (Default True). -- (from EV_MODEL) deny_cursor: EV_POINTER_STYLE -- Deny cursor set by user. -- To be displayed when the screen pointer is not over a valid target. -- (from EV_MODEL) has_capture: BOOLEAN -- Are all events sent to Current? -- (from EV_MODEL) is_center_valid: BOOLEAN -- Is the position of the center valid? -- (from EV_MODEL) is_in_group: BOOLEAN -- Is Current part of a group? -- (from EV_MODEL) ensure -- from EV_MODEL group_defines_is_in_group: Result = (group /= Void) is_in_world: BOOLEAN -- Is Current part of a world? -- (from EV_MODEL) ensure -- from EV_MODEL world_defines_is_in_world: Result = (world /= Void) is_sensitive: BOOLEAN -- Is object sensitive to user input? -- (from EV_MODEL) is_show_requested: BOOLEAN -- Will Current be displayed when its parent is? -- (from EV_MODEL) feature -- Status settings disable_capture -- Disable grab of all events on `world`. -- (from EV_MODEL) require -- from EV_MODEL in_world: world /= Void has_capture: has_capture ensure -- from EV_MODEL capture_released: not has_capture disable_events_sended_to_group -- Set `are_events_sent_to_group` to False. -- (from EV_MODEL) ensure -- from EV_MODEL events_blocked: not are_events_sent_to_group disable_sensitive -- Make object non-sensitive to user input. -- (from EV_MODEL) ensure -- from EV_MODEL insensitive_requested: not internal_is_sensitive enable_capture -- Grab all mouse events for `world`. -- (from EV_MODEL) require -- from EV_MODEL in_world: world /= Void ensure -- from EV_MODEL capture_set: has_capture enable_events_sended_to_group -- Set `are_events_sent_to_group` to True. -- (from EV_MODEL) ensure -- from EV_MODEL events_sended_to_group: are_events_sent_to_group enable_sensitive -- Make object sensitive to user input. -- (from EV_MODEL) ensure -- from EV_MODEL sensitive_requested: internal_is_sensitive hide -- Request that Current not be displayed even when its `group` is. -- (from EV_MODEL) ensure -- from EV_MODEL not_is_show_requested: not is_show_requested invalidate -- Some property of Current has changed. -- (from EV_MODEL_GROUP) show -- Request that Current be displayed when its `group` is. -- True by default. -- (from EV_MODEL) ensure -- from EV_MODEL is_show_requested: is_show_requested validate -- Validate Current. -- (from EV_MODEL_GROUP) feature -- Visitor project (a_projector: EV_MODEL_DRAWING_ROUTINES) -- Project Current onto a_projector. -- (from EV_MODEL_GROUP) feature --{EV_FIGURE} -- Status settings center_invalidate -- The position of the center may have changed. -- (from EV_MODEL) invariant -- from EV_MODEL_GROUP is_grouped_implies_all_grouped: is_grouped implies for_all (agent {EV_MODEL}.is_in_group) angle_equal_current_angle: angle = current_angle not_is_grouped_implies_angel_equals_zero: not is_grouped implies (angle = 0.to_double) -- from EV_MODEL point_array_exists: point_array /= Void center_exists: center /= Void x_is_center_x: is_center_valid implies x = center.x y_is_center_y: is_center_valid implies y = center.y all_points_exist: all_points_exist (point_array) projection_matrix_not_void: projection_matrix /= Void is_transfomable_implies_rotatable_and_scalable: is_transformable implies (is_rotatable and is_scalable) -- from ANY reflexive_equality: standard_is_equal (Current) reflexive_conformance: conforms_to (Current) -- from ARRAYED_LIST prunable: prunable starts_from_one: Lower = 1 -- from RESIZABLE increase_by_at_least_one: Minimal_increase >= 1 -- from BOUNDED valid_count: count <= capacity full_definition: full = (count = capacity) -- from FINITE empty_definition: is_empty = (count = 0) -- from LIST before_definition: before = (index = 0) after_definition: after = (index = count + 1) -- from CHAIN non_negative_index: index >= 0 index_small_enough: index <= count + 1 off_definition: off = ((index = 0) or (index = count + 1)) isfirst_definition: isfirst = ((not is_empty) and (index = 1)) islast_definition: islast = ((not is_empty) and (index = count)) item_corresponds_to_index: (not off) implies (item = i_th (index)) -- from ACTIVE writable_constraint: writable implies readable empty_constraint: is_empty implies (not readable) and (not writable) -- from READABLE_INDEXABLE consistent_boundaries: Lower <= count or else Lower = count + 1 -- from BILINEAR not_both: not (after and before) before_constraint: before implies off -- from LINEAR after_constraint: after implies off -- from TRAVERSABLE empty_constraint: is_empty implies off note copyright: "Copyright (c) 1984-2010, Eiffel Software and others" license: "Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)" source: "[ Eiffel Software 5949 Hollister Ave., Goleta, CA 93117 USA Telephone 805-685-1006, Fax 805-685-6869 Website http://www.eiffel.com Customer support http://support.eiffel.com ]" end -- class EG_EDGE -- Generated by Eiffel Studio --
For more details: eiffel.org