indexing
description: "Handles that allow the user to control certain EV_RELATIVE_POINTs%Nin an EV_FIGURE_WORLD."
legal: "See notice at end of class."
status: "See notice at end of class."
keywords: "point, handle, move, resize, grab"
date: "$Date: 2006-01-22 18:25:44 -0800 (Sun, 22 Jan 2006) $"
revision: "$Revision: 56675 $"
class interface
EV_MOVE_HANDLE
create
default_create
require ANY
True
create {EV_MOVE_HANDLE}
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
cursor: ARRAYED_LIST_CURSOR
ARRAYED_LIST
ensure CURSOR_STRUCTURE
cursor_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_FIGURE_GROUP
`Current'
EV_FIGURE
has (v: like item): BOOLEAN
`v'
object_comparison
ARRAYED_LIST
require CONTAINER
True
ensure CONTAINER
not_found_in_empty: Result implies not is_empty
i_th alias "[]" (i: INTEGER_32): like item assign put_i_th
`i'
ARRAYED_LISTinfix "@"
ARRAYED_LIST
require TABLE
valid_key: valid_index (i)
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_FIGURE
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
maximum_x: INTEGER_32
maximum_y: INTEGER_32
minimum_x: INTEGER_32
minimum_y: INTEGER_32
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
orientation: REAL_64
`Current'
EV_FIGURE
pebble: ANY
EV_FIGURE
pebble_function: FUNCTION [ANY, TUPLE, ANY]
`Void'pebble
EV_FIGURE
point: EV_RELATIVE_POINT
`Current'
EV_SINGLE_POINTED_FIGURE
point_array: ARRAY [EV_COORDINATE]
points
EV_FIGURE
ensure EV_FIGURE
same_length: Result.count = points.count
point_count: INTEGER_32
`Current'
EV_SINGLE_POINTED_FIGURE
require EV_FIGURE
True
pointer_style: EV_POINTER_STYLE
EV_FIGURE
real_position_agent: FUNCTION [ANY, TUPLE [INTEGER_32, INTEGER_32], TUPLE [INTEGER_32, INTEGER_32]]
`Current'
target_name: STRING_GENERAL
`Current'
EV_ABSTRACT_PICK_AND_DROPABLE
world: EV_FIGURE_WORLD
`Current'
EV_FIGURE
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
accept_cursor: EV_POINTER_STYLE
pebble
EV_FIGURE
after: BOOLEAN
LIST
require LINEAR
True
before: BOOLEAN
LIST
require BILINEAR
True
bounding_box: EV_RECTANGLE
`Current'
EV_FIGURE_GROUP
ensure EV_FIGURE
not_void: Result /= Void
changeable_comparison_criterion: BOOLEAN
object_comparison
CONTAINER
conforms_to (other: ANY): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
deny_cursor: EV_POINTER_STYLE
EV_FIGURE
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_capture: BOOLEAN
`Current'
EV_FIGURE
invalid_rectangle: EV_RECTANGLE
`Void'
EV_FIGURE_GROUP
is_always_shown: BOOLEAN
`figure'
`figure'
is_empty: BOOLEAN
FINITE
is_inserted (v: EV_FIGURE): BOOLEAN
`v'put
extend
ARRAYED_LIST
is_sensitive: BOOLEAN
EV_FIGURE
is_show_requested: BOOLEAN
`Current'
EV_FIGURE
is_snapping: BOOLEAN
`Current'
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'
EV_FIGURE_GROUP
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
disable_always_shown
is_always_shown`False'
ensure
not_always_shown: not is_always_shown
disable_capture
world
EV_FIGURE
require EV_FIGURE
in_world: world /= Void
ensure EV_FIGURE
capture_released: not has_capture
disable_sensitive
EV_FIGURE
ensure EV_FIGURE
insensitive_requested: not internal_is_sensitive
disable_snapping
is_snapping`False'
ensure
snap_disabled: not is_snapping
enable_always_shown
is_always_shown`True'
ensure
is_always_shown: is_always_shown
enable_capture
world
EV_FIGURE
require EV_FIGURE
in_world: world /= Void
ensure EV_FIGURE
capture_set: has_capture
enable_sensitive
EV_FIGURE
ensure EV_FIGURE
sensitive_requested: internal_is_sensitive
enable_snapping
is_snapping`True'
ensure
snap_enabled: is_snapping
hide
`Current'group
EV_FIGURE
ensure EV_FIGURE
not_is_show_requested: not is_show_requested
intersects (r: EV_RECTANGLE): BOOLEAN
`r'`Current'bounding_box
EV_FIGURE
set_point (a_point: EV_RELATIVE_POINT)
`a_point'point
EV_SINGLE_POINTED_FIGURE
require EV_SINGLE_POINTED_FIGURE
a_point_not_void: a_point /= Void
ensure EV_SINGLE_POINTED_FIGURE
point_assigned: point = a_point
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)
show
`Current'group
`True'
EV_FIGURE
ensure EV_FIGURE
is_show_requested: is_show_requested
snap_to_grid
require EV_FIGURE_GROUP
world_not_void: world /= Void
grid_enabled: world.grid_enabled
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
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_FIGURE])
`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
remove_pebble
pebble`Void'pebble_function
EV_FIGURE
ensure EV_ABSTRACT_PICK_AND_DROPABLE
pebble_removed: pebble = Void and pebble_function = Void
set_accept_cursor (a_cursor: EV_POINTER_STYLE)
`a_cursor'
pebble
EV_FIGURE
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_FIGURE
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_maximum_x (a_x: INTEGER_32)
`a_x'maximum_x
set_maximum_y (a_y: INTEGER_32)
`a_y'maximum_y
set_minimum_x (a_x: INTEGER_32)
`a_x'minimum_x
set_minimum_y (a_y: INTEGER_32)
`a_y'minimum_y
set_origin (an_origin: EV_RELATIVE_POINT)
`o'
EV_FIGURE
set_pebble (a_pebble: like pebble)
`a_pebble'pebble
EV_FIGURE
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_FIGURE
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_pointer_style (a_cursor: like pointer_style)
`a_cursor'pointer_style
EV_FIGURE
require EV_FIGURE
a_cursor_not_void: a_cursor /= Void
ensure EV_FIGURE
pointer_style_assigned: pointer_style = a_cursor
set_real_position_agent (an_agent: like real_position_agent)
`an_agent'real_position_agent
require
an_agent_not_void: an_agent /= Void
ensure
real_position_agent_assigned: real_position_agent = an_agent
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
swap (i: INTEGER_32)
`i'
ARRAYED_LIST
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
feature
linear_representation: LINEAR [EV_FIGURE]
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_FIGURE
drop_actions: EV_PND_ACTION_SEQUENCE
`Current'
EV_FIGURE
pick_actions: EV_PND_START_ACTION_SEQUENCE
pebble
EV_FIGURE
pointer_button_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_FIGURE
pointer_button_release_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_FIGURE
pointer_double_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_FIGURE
pointer_enter_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_FIGURE
pointer_leave_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_FIGURE
pointer_motion_actions: EV_POINTER_MOTION_ACTION_SEQUENCE
EV_FIGURE
feature
end_actions: EV_NOTIFY_ACTION_SEQUENCE
move_actions: EV_PND_START_ACTION_SEQUENCE
`Current'
start_actions: EV_NOTIFY_ACTION_SEQUENCE
feature
position_on_figure (x, y: INTEGER_32): BOOLEAN
`x'`y'
`False'
EV_FIGURE_GROUP
feature
do_all (action: PROCEDURE [ANY, TUPLE [EV_FIGURE]])
`action'
`action'
LINEAR
require TRAVERSABLE
action_exists: action /= Void
require ARRAY
action_not_void: action /= Void
do_if (action: PROCEDURE [ANY, TUPLE [EV_FIGURE]]; test: FUNCTION [ANY, TUPLE [EV_FIGURE], 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_FIGURE], 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_FIGURE], BOOLEAN]): BOOLEAN
`test'
`test'
LINEAR
require TRAVERSABLE
test_exits: test /= Void
require ARRAY
test_not_void: test /= Void
feature
append (s: SEQUENCE [EV_FIGURE])
`s'
EV_FIGURE_GROUP
require SEQUENCE
argument_not_void: s /= Void
ensure SEQUENCE
new_count: count >= old count
force_i_th (fig: like item; i: INTEGER_32)
`fig'
EV_FIGURE_GROUP
ensure ARRAY
inserted: i_th (i) = fig
higher_count: count >= old count
insert (fig: like item; i: INTEGER_32)
`fig'
EV_FIGURE_GROUP
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
make_from_array (a: ARRAY [EV_FIGURE])
`a'
EV_FIGURE_GROUP
require ARRAY
array_exists: a /= Void
ensure then ARRAYED_LIST
correct_position: before
filled: count = a.count
merge_left (other: like Current)
`other'
`other'
EV_FIGURE_GROUP
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'
EV_FIGURE_GROUP
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'
EV_FIGURE_GROUP
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
remove
item
EV_FIGURE_GROUP
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
replace (fig: like item)
`fig'
EV_FIGURE_GROUP
require ACTIVE
writable: writable
ensure ACTIVE
item_replaced: item = fig
wipe_out
EV_FIGURE_GROUP
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
calculate_absolute_position
EV_FIGURE_GROUP
invalidate
`Current'
EV_FIGURE_GROUP
validate
`Current'
EV_FIGURE_GROUP
invariant
EV_FIGURE
points_not_void: points /= Void
points_correct_size: points.count = point_count
points_items_not_void: all_points_exist (points)
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_MOVE_HANDLE