indexing
description: "[
A EV_FIGURE_GROUP is an ARRAYED_LIST of EV_FIGURE.
Since EV_FIGURE_GROUP is also an EV_FIGURE (composite pattern) you
can rotate, scale and change the position of an EV_FIGURE_GROUP.
All elements in the group are rotated around the center
of the EV_FIGURE_GROUP. A EV_FIGURE can only be grouped
in one group at the same time.
]"
legal: "See notice at end of class."
status: "See notice at end of class."
date: "$Date: 2006-01-22 18:25:44 -0800 (Sun, 22 Jan 2006) $"
revision: "$Revision: 56675 $"
class interface
EV_MODEL_GROUP
create
default_create
require ANY
True
ensure then
is_grouped: is_grouped
not_is_in_group: not is_in_group
make_with_point (a_point: EV_COORDINATE)
`a_point'
EV_MODEL_SINGLE_POINTED
require EV_MODEL_SINGLE_POINTED
a_point_not_void: a_point /= Void
make_with_position (a_point_x, a_point_y: INTEGER_32)
`a_point_x'`a_point_y'
EV_MODEL_SINGLE_POINTED
create {EV_MODEL_GROUP}
make_filled (n: INTEGER_32)
`n'
`n'
ARRAYED_LIST
require ARRAYED_LIST
valid_number_of_items: n >= 0
ensure ARRAYED_LIST
correct_position: before
filled: full
feature
list_make (n: INTEGER_32)
`n'
`n'
ARRAYED_LIST
require ARRAYED_LIST
valid_number_of_items: n >= 0
ensure ARRAYED_LIST
correct_position: before
is_empty: is_empty
make_filled (n: INTEGER_32)
`n'
`n'
ARRAYED_LIST
require ARRAYED_LIST
valid_number_of_items: n >= 0
ensure ARRAYED_LIST
correct_position: before
filled: full
feature
angle: REAL_64
`Current'xyangle
require EV_MODEL
True
ensure then
result_equal_current_angle: Result = current_angle
cursor: ARRAYED_LIST_CURSOR
ARRAYED_LIST
ensure CURSOR_STRUCTURE
cursor_not_void: Result /= Void
deep_elements: LIST [EV_MODEL]
`Current'
ensure
result_not_void: Result /= Void
first: like item
ARRAYED_LIST
require CHAIN
not_empty: not is_empty
generating_type: STRING_8
ANY
generator: STRING_8
ANY
group: EV_MODEL_GROUP
`Current'`Current'
EV_MODEL
i_th alias "[]" (i: INTEGER_32): like item assign put_i_th
`i'
ARRAYED_LISTinfix "@"
ARRAYED_LIST
require TABLE
valid_key: valid_index (i)
id: INTEGER_32
EV_MODEL
ensure HASHABLE
good_hash_value: Result >= 0
frozen id_object (an_id: INTEGER_32): IDENTIFIED
`an_id'
IDENTIFIED
ensure IDENTIFIED
consistent: Result = Void or else Result.object_id = an_id
index: INTEGER_32
item
ARRAYED_LIST
index_of (v: like item; i: INTEGER_32): INTEGER_32
`i'`v'
object_comparison
CHAIN
require LINEAR
positive_occurrences: i > 0
ensure LINEAR
non_negative_result: Result >= 0
item: EV_MODEL
ARRAYED_LIST
require TRAVERSABLE
not_off: not off
require ACTIVE
readable: readable
require else ARRAYED_LIST
index_is_valid: valid_index (index)
last: like first
ARRAYED_LIST
require CHAIN
not_empty: not is_empty
frozen object_id: INTEGER_32
IDENTIFIED
ensure IDENTIFIED
valid_id: id_object (Result) = Current
sequential_occurrences (v: like item): INTEGER_32
`v'
object_comparison
LINEAR
require BAG
True
ensure BAG
non_negative_occurrences: Result >= 0
pebble: ANY
EV_MODEL
pebble_function: FUNCTION [ANY, TUPLE, ANY]
`Void'pebble
EV_MODEL
point: EV_COORDINATE
`Current'
EV_MODEL_SINGLE_POINTED
ensure 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'
EV_MODEL_SINGLE_POINTED
require EV_MODEL
True
ensure EV_MODEL
correct: Result = point_array.count
point_relative: EV_COORDINATE
pointgrouppoint
EV_MODEL_SINGLE_POINTED
ensure 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
point
point_x_relative: INTEGER_32
point_xgrouppoint_x
EV_MODEL_SINGLE_POINTED
point_y: INTEGER_32
point
point_y_relative: INTEGER_32
point_ygrouppoint_y
EV_MODEL_SINGLE_POINTED
pointer_style: EV_POINTER_STYLE
EV_MODEL
target_name: STRING_GENERAL
`Current'
EV_ABSTRACT_PICK_AND_DROPABLE
world: EV_MODEL_WORLD
`Current'`Current'
EV_MODEL
x: INTEGER_32
x
EV_MODEL
y: INTEGER_32
y
EV_MODEL
infix "@" (i: INTEGER_32): like item assign put_i_th
`i'
ARRAYED_LISTi_th
ARRAYED_LIST
require TABLE
valid_key: valid_index (i)
feature
count: INTEGER_32
ARRAYED_LIST
index_set: INTEGER_INTERVAL
CHAIN
require INDEXABLE
True
ensure INDEXABLE
not_void: Result /= Void
ensure then CHAIN
count_definition: Result.count = count
occurrences (v: like item): INTEGER_32
`v'
object_comparison
CHAIN
require BAG
True
require LINEAR
True
ensure BAG
non_negative_occurrences: Result >= 0
feature {ANY}
capacity: INTEGER_32
ARRAYcount
ARRAY
require BOUNDED
True
ensure then ARRAY
consistent_with_bounds: Result = upper - lower + 1
feature
frozen deep_equal (some: ANY; other: like arg #1): BOOLEAN
`some'`other'
ANY
ensure ANY
shallow_implies_deep: standard_equal (some, other) implies Result
both_or_none_void: (some = Void) implies (Result = (other = Void))
same_type: (Result and (some /= Void)) implies some.same_type (other)
symmetric: Result implies deep_equal (other, some)
frozen equal (some: ANY; other: like arg #1): BOOLEAN
`some'`other'
ANY
ensure ANY
definition: Result = (some = Void and other = Void) or else ((some /= Void and other /= Void) and then some.is_equal (other))
is_equal (other: like Current): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
ensure ANY
symmetric: Result implies other.is_equal (Current)
consistent: standard_is_equal (other) implies Result
ensure then LIST
indices_unchanged: index = old index and other.index = old other.index
true_implies_same_size: Result implies count = other.count
frozen standard_equal (some: ANY; other: like arg #1): BOOLEAN
`some'`other'
ANY
ensure ANY
definition: Result = (some = Void and other = Void) or else ((some /= Void and other /= Void) and then some.standard_is_equal (other))
frozen standard_is_equal (other: like Current): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
ensure ANY
same_type: Result implies same_type (other)
symmetric: Result implies other.standard_is_equal (Current)
feature
after: BOOLEAN
LIST
require LINEAR
True
before: BOOLEAN
LIST
require BILINEAR
True
changeable_comparison_criterion: BOOLEAN
object_comparison
CONTAINER
conforms_to (other: ANY): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
exhausted: BOOLEAN
LINEAR
ensure LINEAR
exhausted_when_off: off implies Result
extendible: BOOLEAN is True
DYNAMIC_CHAIN
full: BOOLEAN
ARRAYED_LIST
require BOX
True
has (v: like item): BOOLEAN
`v'
require CONTAINER
True
ensure CONTAINER
not_found_in_empty: Result implies not is_empty
has_deep (figure: EV_MODEL): BOOLEAN
`figure'
invalid_rectangle: EV_RECTANGLE
`Void'
is_empty: BOOLEAN
FINITE
is_grouped: BOOLEAN
is_hashable: BOOLEAN
HASHABLE
ensure HASHABLE
ok_if_not_default: Result implies (Current /= default)
is_inserted (v: EV_MODEL): BOOLEAN
`v'put
extend
ARRAYED_LIST
is_rotatable: BOOLEAN
is_scalable: BOOLEAN
is_transformable: BOOLEAN
isfirst: BOOLEAN
CHAIN
ensure CHAIN
valid_position: Result implies not is_empty
islast: BOOLEAN
CHAIN
ensure CHAIN
valid_position: Result implies not is_empty
object_comparison: BOOLEAN
equal`='
`='
CONTAINER
off: BOOLEAN
CHAIN
require TRAVERSABLE
True
prunable: BOOLEAN
ARRAYED_LIST
require COLLECTION
True
readable: BOOLEAN
SEQUENCE
require ACTIVE
True
same_type (other: ANY): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
ensure ANY
definition: Result = (conforms_to (other) and other.conforms_to (Current))
update_rectangle: EV_RECTANGLE
`Void'
valid_cursor (p: CURSOR): BOOLEAN
`p'
ARRAYED_LIST
valid_cursor_index (i: INTEGER_32): BOOLEAN
`i'
CHAIN
ensure CHAIN
valid_cursor_index_definition: Result = ((i >= 0) and (i <= count + 1))
valid_index (i: INTEGER_32): BOOLEAN
`i'
ARRAYED_LIST
require TABLE
True
require TO_SPECIAL
True
ensure then INDEXABLE
only_if_in_index_set: Result implies ((i >= index_set.lower) and (i <= index_set.upper))
ensure then CHAIN
valid_index_definition: Result = ((i >= 1) and (i <= count))
writable: BOOLEAN
SEQUENCE
require ACTIVE
True
feature
compare_objects
equal
`='
CONTAINER
require CONTAINER
changeable_comparison_criterion: changeable_comparison_criterion
ensure CONTAINER
object_comparison
compare_references
`='
equal
CONTAINER
require CONTAINER
changeable_comparison_criterion: changeable_comparison_criterion
ensure CONTAINER
reference_comparison: not object_comparison
set_point_position_relative (ax, ay: INTEGER_32)
point_relative`ax'`ay'
EV_MODEL_SINGLE_POINTED
set_target_name (a_name: STRING_GENERAL)
`a_name'target_name
EV_ABSTRACT_PICK_AND_DROPABLE
require EV_ABSTRACT_PICK_AND_DROPABLE
a_name_not_void: a_name /= Void
ensure EV_ABSTRACT_PICK_AND_DROPABLE
target_name_assigned: a_name /= target_name and a_name.is_equal (target_name)
feature
back
ARRAYED_LIST
require BILINEAR
not_before: not before
finish
ARRAYED_LIST
require LINEAR
True
ensure then CHAIN
at_last: not is_empty implies islast
ensure then ARRAYED_LIST
before_when_empty: is_empty implies before
forth
ARRAYED_LIST
require LINEAR
not_after: not after
ensure then LIST
moved_forth: index = old index + 1
go_i_th (i: INTEGER_32)
`i'
ARRAYED_LIST
require CHAIN
valid_cursor_index: valid_cursor_index (i)
ensure CHAIN
position_expected: index = i
go_to (p: CURSOR)
`p'
ARRAYED_LIST
require CURSOR_STRUCTURE
cursor_position_valid: valid_cursor (p)
move (i: INTEGER_32)
`i'
ARRAYED_LIST
ensure 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)
item`v'
`v'
exhausted
object_comparison
ARRAYED_LIST
require LINEAR
True
ensure LINEAR
object_found: (not exhausted and object_comparison) implies equal (v, item)
item_found: (not exhausted and not object_comparison) implies v = item
start
ARRAYED_LIST
require TRAVERSABLE
True
ensure then CHAIN
at_first: not is_empty implies isfirst
ensure then ARRAYED_LIST
after_when_empty: is_empty implies after
feature
bring_forward (a_figure: EV_MODEL)
`a_figure'
require
a_figure_in_figures: has (a_figure)
ensure
a_figure_in_group: a_figure.group = Current
a_figure_in_current: has (a_figure)
bring_to_front (a_figure: EV_MODEL)
`a_figure'
require
a_figure_in_figures: has (a_figure)
ensure
is_last: last = a_figure
a_figure_in_group: a_figure.group = Current
a_figure_in_current: has (a_figure)
extend (v: like item)
`v'
ARRAYED_LISTforce
ARRAYED_LIST
require COLLECTION
extendible: extendible
ensure COLLECTION
item_inserted: is_inserted (v)
ensure then BAG
one_more_occurrence: occurrences (v) = old (occurrences (v)) + 1
fill (other: CONTAINER [EV_MODEL])
`other'
`other'
CHAIN
require COLLECTION
other_not_void: other /= Void
extendible: extendible
force (v: like item)
`v'
ARRAYED_LISTextend
ARRAYED_LIST
require SEQUENCE
extendible: extendible
ensure then SEQUENCE
new_count: count = old count + 1
item_inserted: has (v)
put (v: like item)
`v'
replace
CHAIN
require COLLECTION
extendible: extendible
ensure COLLECTION
item_inserted: is_inserted (v)
ensure then CHAIN
same_count: count = old count
put_front (v: like item)
`v'
ARRAYED_LIST
ensure DYNAMIC_CHAIN
new_count: count = old count + 1
item_inserted: first = v
put_left (v: like item)
`v'
ARRAYED_LIST
require DYNAMIC_CHAIN
extendible: extendible
not_before: not before
ensure DYNAMIC_CHAIN
new_count: count = old count + 1
new_index: index = old index + 1
put_right (v: like item)
`v'
ARRAYED_LIST
require DYNAMIC_CHAIN
extendible: extendible
not_after: not after
ensure DYNAMIC_CHAIN
new_count: count = old count + 1
same_index: index = old index
regroup
`figures'
require
not_is_grouped: not is_grouped
not_is_in_group: not is_in_group
ensure
is_grouped: is_grouped
all_grouped: for_all (agent {EV_MODEL}.is_in_group)
center_is_invalid: not is_center_valid
remove_pebble
pebble`Void'pebble_function
EV_MODEL
ensure EV_ABSTRACT_PICK_AND_DROPABLE
pebble_removed: pebble = Void and pebble_function = Void
rotate (an_angle: REAL_64)
`an_angle'
require EV_MODEL
is_rotatable: is_rotatable
ensure EV_MODEL
center_valid: is_center_valid
ensure then
angle_equal_an_angle: angle = old angle + an_angle
rotate_around (an_angle: REAL_64; ax, ay: INTEGER_32)
`ax'`ay'`an_angle'
EV_MODEL
require EV_MODEL
is_rotatable: is_rotatable
ensure EV_MODEL
center_valid: is_center_valid
scale (a_scale: REAL_64)
`a_scale'
EV_MODEL
require EV_MODEL
is_scalable: is_scalable
a_scale_bigger_zero: a_scale > 0.0
scale_abs (a_scale: REAL_64)
`a_scale'
angle
EV_MODEL
require EV_MODEL
is_scalable: is_scalable
a_scale_bigger_zero: a_scale > 0.0
scale_x (a_scale_x: REAL_64)
`a_scale_x'
EV_MODEL
require EV_MODEL
is_scalable: is_scalable
a_scale_x_bigger_zero: a_scale_x > 0.0
scale_x_abs (a_scale_x: REAL_64)
`a_scale_x'
angle
EV_MODEL
require EV_MODEL
is_scalable: is_scalable
a_scale_x_bigger_zero: a_scale_x > 0.0
scale_y (a_scale_y: REAL_64)
`a_scale_y'
EV_MODEL
require EV_MODEL
is_scalable: is_scalable
a_scale_y_bigger_zero: a_scale_y > 0.0
scale_y_abs (a_scale_y: REAL_64)
`a_scale_y'
angle
EV_MODEL
require EV_MODEL
is_scalable: is_scalable
a_scale_y_bigger_zero: a_scale_y > 0.0
send_backward (a_figure: EV_MODEL)
`a_figure'
require
a_figure_in_figures: has (a_figure)
ensure
a_figure_in_group: a_figure.group = Current
a_figure_in_current: has (a_figure)
send_to_back (a_figure: EV_MODEL)
`a_figure'
require
a_figure_in_figures: has (a_figure)
ensure
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: EV_POINTER_STYLE)
`a_cursor'
pebble
EV_MODEL
require EV_ABSTRACT_PICK_AND_DROPABLE
a_cursor_not_void: a_cursor /= Void
ensure EV_ABSTRACT_PICK_AND_DROPABLE
accept_cursor_assigned: accept_cursor.is_equal (a_cursor)
set_deny_cursor (a_cursor: EV_POINTER_STYLE)
`a_cursor'
EV_MODEL
require EV_ABSTRACT_PICK_AND_DROPABLE
a_cursor_not_void: a_cursor /= Void
ensure EV_ABSTRACT_PICK_AND_DROPABLE
deny_cursor_assigned: deny_cursor.is_equal (a_cursor)
set_pebble (a_pebble: like pebble)
`a_pebble'pebble
EV_MODEL
require EV_ABSTRACT_PICK_AND_DROPABLE
a_pebble_not_void: a_pebble /= Void
ensure EV_ABSTRACT_PICK_AND_DROPABLE
pebble_assigned: pebble = a_pebble
set_pebble_function (a_function: FUNCTION [ANY, TUPLE, ANY])
`a_function'pebble
EV_MODEL
require 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 EV_ABSTRACT_PICK_AND_DROPABLE
pebble_function_assigned: pebble_function = a_function
set_point_position (a_x, a_y: INTEGER_32)
point`a_x'`a_y'
set_pointer_style (a_cursor: like pointer_style)
`a_cursor'pointer_style
EV_MODEL
require EV_MODEL
a_cursor_not_void: a_cursor /= Void
ensure EV_MODEL
pointer_style_assigned: pointer_style = a_cursor
set_x (a_x: INTEGER_32)
x`an_x'
ensure EV_MODEL
x_set: a_x = x
center_valid: is_center_valid
set_x_y (a_x, a_y: INTEGER_32)
x`an_x'
ensure EV_MODEL
set: a_x = x and a_y = y
center_valid: is_center_valid
set_y (a_y: INTEGER_32)
y`an_y'
ensure EV_MODEL
y_set: a_y = y
center_valid: is_center_valid
transform (a_transformation: EV_MODEL_TRANSFORMATION)
point_array`a_transformation'
`Current'
EV_MODEL
require EV_MODEL
a_transformation_not_void: a_transformation /= Void
is_transformable: is_transformable
ungroup
`figures'
require
is_grouped: is_grouped
not_is_in_group: not is_in_group
ensure
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
prune (v: like item)
`v'
after`v'
ARRAYED_LIST
require COLLECTION
prunable: prunable
remove_left
ARRAYED_LIST
require DYNAMIC_CHAIN
left_exists: index > 1
ensure DYNAMIC_CHAIN
new_count: count = old count - 1
new_index: index = old index - 1
remove_right
ARRAYED_LIST
require DYNAMIC_CHAIN
right_exists: index < count
ensure DYNAMIC_CHAIN
new_count: count = old count - 1
same_index: index = old index
feature
resize (new_capacity: INTEGER_32)
`n'
ARRAYED_LIST
require ARRAYED_LIST
new_capacity_large_enough: new_capacity >= capacity
ensure ARRAYED_LIST
capacity_set: capacity >= new_capacity
feature
linear_representation: LINEAR [EV_MODEL]
LINEAR
require CONTAINER
True
feature
copy (other: like Current)
`other'
ANY
require ANY
other_not_void: other /= Void
type_identity: same_type (other)
ensure ANY
is_equal: is_equal (other)
ensure then ARRAY
equal_areas: area.is_equal (other.area)
frozen deep_copy (other: like Current)
copy`other'deep_twin
ANY
require ANY
other_not_void: other /= Void
ensure ANY
deep_equal: deep_equal (Current, other)
frozen deep_twin: like Current
ANY
ensure ANY
deep_equal: deep_equal (Current, Result)
duplicate (n: INTEGER_32): like Current
`n'countindex
ARRAYED_LIST
require CHAIN
not_off_unless_after: off implies after
valid_subchain: n >= 0
frozen standard_copy (other: like Current)
`other'
ANY
require ANY
other_not_void: other /= Void
type_identity: same_type (other)
ensure ANY
is_standard_equal: standard_is_equal (other)
frozen standard_twin: like Current
`other'
ANY
ensure ANY
standard_twin_not_void: Result /= Void
equal: standard_equal (Result, Current)
frozen twin: like Current
`Current'
twincopycopy
ANY
ensure ANY
twin_not_void: Result /= Void
is_equal: Result.is_equal (Current)
feature
frozen default: like Current
ANY
frozen default_pointer: POINTER
`POINTER'
`p'default
`p'`POINTER'
ANY
default_rescue
ANY
frozen do_nothing
ANY
feature
conforming_pick_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_MODEL
drop_actions: EV_PND_ACTION_SEQUENCE
`Current'
EV_MODEL
pick_actions: EV_PND_START_ACTION_SEQUENCE
pebble
EV_MODEL
pointer_button_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_MODEL
pointer_button_release_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_MODEL
pointer_double_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_MODEL
pointer_enter_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_MODEL
pointer_leave_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_MODEL
pointer_motion_actions: EV_POINTER_MOTION_ACTION_SEQUENCE
EV_MODEL
feature
bounding_box: EV_RECTANGLE
`Current'
ensure EV_MODEL
result_not_void: Result /= Void
internal_is_twin: internal_bounding_box /= Result
position_on_figure (a_x, a_y: INTEGER_32): BOOLEAN
`a_x'`a_y'
`False'
feature
do_all (action: PROCEDURE [ANY, TUPLE [EV_MODEL]])
`action'
`action'
LINEAR
require TRAVERSABLE
action_exists: action /= Void
require ARRAY
action_not_void: action /= Void
do_if (action: PROCEDURE [ANY, TUPLE [EV_MODEL]]; test: FUNCTION [ANY, TUPLE [EV_MODEL], BOOLEAN])
`action'`test'
`action'`test'
LINEAR
require TRAVERSABLE
action_exists: action /= Void
test_exits: test /= Void
require ARRAY
action_not_void: action /= Void
test_not_void: test /= Void
for_all (test: FUNCTION [ANY, TUPLE [EV_MODEL], BOOLEAN]): BOOLEAN
`test'
`test'
LINEAR
require TRAVERSABLE
test_exits: test /= Void
require ARRAY
test_not_void: test /= Void
ensure then LINEAR
empty: is_empty implies Result
there_exists (test: FUNCTION [ANY, TUPLE [EV_MODEL], BOOLEAN]): BOOLEAN
`test'
`test'
LINEAR
require TRAVERSABLE
test_exits: test /= Void
require ARRAY
test_not_void: test /= Void
feature
append (s: SEQUENCE [EV_MODEL])
`s'
require SEQUENCE
argument_not_void: s /= Void
ensure SEQUENCE
new_count: count >= old count
force_i_th (fig: like item; i: INTEGER_32)
`fig'
require ARRAY
True
ensure ARRAY
inserted: i_th (i) = fig
higher_count: count >= old count
ensure then
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)
`fig'
require ARRAYED_LIST
index_small_enough: i <= count
index_large_enough: i >= 1
ensure ARRAYED_LIST
new_count: count = old count + 1
index_unchanged: index = old index
insertion_done: i_th (i) = fig
ensure then
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])
`a'
require ARRAY
array_exists: a /= Void
ensure then ARRAYED_LIST
correct_position: before
filled: count = a.count
merge_left (other: like Current)
`other'
`other'
require DYNAMIC_CHAIN
extendible: extendible
not_before: not before
other_exists: other /= Void
not_current: other /= Current
ensure 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: like Current)
`other'
`other'
require DYNAMIC_CHAIN
extendible: extendible
not_after: not after
other_exists: other /= Void
not_current: other /= Current
ensure 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)
`fig'
require COLLECTION
prunable: prunable
ensure COLLECTION
no_more_occurrences: not has (fig)
ensure then DYNAMIC_CHAIN
is_exhausted: exhausted
ensure then ARRAYED_LIST
is_after: after
ensure then
item_not_in_lookup_table: fig /= Void implies not lookup_table.has (fig.id)
remove
item
require ACTIVE
prunable: prunable
writable: writable
ensure then DYNAMIC_LIST
after_when_empty: is_empty implies after
ensure then ARRAYED_LIST
index: index = old index
ensure then
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)
`fig'
require ACTIVE
writable: writable
ensure ACTIVE
item_replaced: item = fig
ensure then
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)
`i'
require CHAIN
not_off: not off
valid_index: valid_index (i)
ensure CHAIN
swapped_to_item: item = old i_th (i)
swapped_from_item: i_th (i) = old item
ensure then
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
require COLLECTION
prunable: prunable
ensure COLLECTION
wiped_out: is_empty
ensure then DYNAMIC_LIST
is_before: before
feature
io: STD_FILES
ANY
out: STRING_8
ANYtagged_out
ANY
print (some: ANY)
`some'
ANY
frozen tagged_out: STRING_8
ANYout
ANY
feature
operating_environment: OPERATING_ENVIRONMENT
ANY
feature
accept_cursor: EV_POINTER_STYLE
pebble
EV_MODEL
are_events_sended_to_group: BOOLEAN
pointer_motion_actionspointer_button_press_actions
pointer_double_press_actionspointer_button_release_actions
pointer_enter_actionspointer_leave_actions`Current'
`Current'
EV_MODEL
deny_cursor: EV_POINTER_STYLE
EV_MODEL
has_capture: BOOLEAN
`Current'
EV_MODEL
is_center_valid: BOOLEAN
EV_MODEL
is_in_group: BOOLEAN
`Current'
EV_MODEL
ensure EV_MODEL
group_defines_is_in_group: Result = (group /= Void)
is_in_world: BOOLEAN
`Current'
EV_MODEL
ensure EV_MODEL
world_defines_is_in_world: Result = (world /= Void)
is_sensitive: BOOLEAN
EV_MODEL
is_show_requested: BOOLEAN
`Current'
EV_MODEL
feature
disable_capture
world
EV_MODEL
require EV_MODEL
in_world: world /= Void
has_capture: has_capture
ensure EV_MODEL
capture_released: not has_capture
disable_events_sended_to_group
are_events_sended_to_group
EV_MODEL
ensure EV_MODEL
events_blocked: not are_events_sended_to_group
disable_sensitive
EV_MODEL
ensure EV_MODEL
insensitive_requested: not internal_is_sensitive
enable_capture
world
EV_MODEL
require EV_MODEL
in_world: world /= Void
ensure EV_MODEL
capture_set: has_capture
enable_events_sended_to_group
are_events_sended_to_group
EV_MODEL
ensure EV_MODEL
events_sended_to_group: are_events_sended_to_group
enable_sensitive
EV_MODEL
ensure EV_MODEL
sensitive_requested: internal_is_sensitive
hide
`Current'group
EV_MODEL
ensure EV_MODEL
not_is_show_requested: not is_show_requested
invalidate
`Current'
show
`Current'group
`True'
EV_MODEL
ensure EV_MODEL
is_show_requested: is_show_requested
validate
`Current'
feature EV_FIGURE
center_invalidate
EV_MODEL
invariant
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)
EV_MODEL
point_array_exists: point_array /= Void
center_exists: center /= Void
x_is_center_x: x = center.x
y_is_center_y: 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)
ANY
reflexive_equality: standard_is_equal (Current)
reflexive_conformance: conforms_to (Current)
ARRAYED_LIST
prunable: prunable
starts_from_one: lower = 1
empty_means_storage_empty: is_empty implies all_default
ARRAY
area_exists: area /= Void
consistent_size: capacity = upper - lower + 1
non_negative_count: count >= 0
index_set_has_same_count: valid_index_set
RESIZABLE
increase_by_at_least_one: minimal_increase >= 1
BOUNDED
valid_count: count <= capacity
full_definition: full = (count = capacity)
FINITE
empty_definition: is_empty = (count = 0)
non_negative_count: count >= 0
INDEXABLE
index_set_not_void: index_set /= Void
LIST
before_definition: before = (index = 0)
after_definition: after = (index = count + 1)
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))
index_set_has_same_count: index_set.count = count
ACTIVE
writable_constraint: writable implies readable
empty_constraint: is_empty implies (not readable) and (not writable)
BILINEAR
not_both: not (after and before)
before_constraint: before implies off
LINEAR
after_constraint: after implies off
TRAVERSABLE
empty_constraint: is_empty implies off
DYNAMIC_CHAIN
extendible: extendible
indexing
copyright: "Copyright (c) 1984-2006, Eiffel Software and others"
license: "Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)"
source: "[
Eiffel Software
356 Storke Road, Goleta, CA 93117 USA
Telephone 805-685-1006, Fax 805-685-6869
Website http://www.eiffel.com
Customer support http://support.eiffel.com
]"
end EV_MODEL_GROUP