indexing
description: "[
Dynamically expandable tree item.
]"
legal: "See notice at end of class."
status: "See notice at end of class."
keywords: "tree, item, dynamic"
date: "11/4/1999"
revision: "$Revision$"
class interface
EV_DYNAMIC_TREE_ITEM
create
default_create
EV_ANY
require ANY
True
ensure then EV_ANY
is_coupled: implementation /= Void
is_initialized: is_initialized
default_create_called_set: default_create_called
is_in_default_state: is_in_default_state
make_with_text (a_text: STRING_GENERAL)
`Current'`a_text'text
EV_TEXTABLE
require EV_TEXTABLE
a_text_not_void: a_text /= Void
ensure EV_TEXTABLE
text_assigned: text.is_equal (a_text) and text /= a_text
make_with_function (a_subtree_function: like subtree_function)
`a_subtree_function'
feature
accept_cursor: EV_POINTER_STYLE
`Result'
pebble
EV_PICK_AND_DROPABLE
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure EV_ABSTRACT_PICK_AND_DROPABLE
result_not_void: Result /= Void
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.accept_cursor
cursor: EV_DYNAMIC_LIST_CURSOR [EV_TREE_NODE]
EV_DYNAMIC_LIST
require CURSOR_STRUCTURE
True
ensure CURSOR_STRUCTURE
cursor_not_void: Result /= Void
ensure then EV_DYNAMIC_LIST
bridge_ok: Result.is_equal (implementation.cursor)
data: ANY
EV_ANY
default_subtree_function_timeout: INTEGER_32 is 1000
deny_cursor: EV_POINTER_STYLE
`Result'
pebble
EV_PICK_AND_DROPABLE
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure EV_ABSTRACT_PICK_AND_DROPABLE
result_not_void: Result /= Void
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.deny_cursor
first: like item
CHAIN
require CHAIN
not_empty: not is_empty
generating_type: STRING_8
ANY
generator: STRING_8
ANY
has (v: like item): BOOLEAN
`v'
object_comparison
CHAIN
require CONTAINER
True
ensure CONTAINER
not_found_in_empty: Result implies not is_empty
has_recursively (an_item: EV_TREE_NODE): BOOLEAN
`an_item'`Current'
EV_TREE_NODE_LIST
require EV_TREE_NODE_LIST
item_not_void: an_item /= Void
ensure EV_TREE_NODE_LIST
not_found_in_empty: Result implies not is_empty
index_not_changed: old index = index
i_th alias "[]" (i: INTEGER_32): like item
`i'
EV_DYNAMIC_LIST
require TABLE
valid_key: valid_index (i)
ensure then EV_DYNAMIC_LIST
bridge_ok: Result.is_equal (implementation.i_th (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
EV_DYNAMIC_LIST
require LINEAR
True
ensure then EV_DYNAMIC_LIST
bridge_ok: Result = implementation.index
index_of (v: like item; i: INTEGER_32): INTEGER_32
`i'`v'
EV_DYNAMIC_LIST
require LINEAR
positive_occurrences: i > 0
ensure LINEAR
non_negative_result: Result >= 0
ensure then EV_DYNAMIC_LIST
bridge_ok: Result = implementation.index_of (v, i)
item: EV_TREE_NODE
EV_DYNAMIC_LIST
require TRAVERSABLE
not_off: not off
require ACTIVE
readable: readable
ensure then EV_DYNAMIC_LIST
not_void: Result /= Void
bridge_ok: Result.is_equal (implementation.item)
last: like item
CHAIN
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
parent: EV_TREE_NODE_LIST
`Current'
EV_TREE_NODE
require EV_CONTAINABLE
not_destroyed: not is_destroyed
ensure then EV_ITEM
bridge_ok: Result = implementation.parent
parent_tree: EV_TREE
`Current'
EV_TREE_NODE
require EV_TREE_NODE
not_destroyed: not is_destroyed
ensure EV_TREE_NODE
bridge_ok: Result = implementation.parent_tree
pebble: ANY
EV_PICK_AND_DROPABLE
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.pebble
pebble_function: FUNCTION [ANY, TUPLE, ANY]
EV_PICK_AND_DROPABLE
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.pebble_function
pebble_positioning_enabled: BOOLEAN
`True'
pebble_x_positionpebble_y_position
`False'
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.pebble_positioning_enabled
pebble_x_position: INTEGER_32
`Current'
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.pebble_x_position
pebble_y_position: INTEGER_32
`Current'
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.pebble_y_position
pixmap: EV_PIXMAP
`Current'
EV_PIXMAPABLE
require EV_PIXMAPABLE
not_destroyed: not is_destroyed
ensure EV_PIXMAPABLE
bridge_ok: (Result = Void and implementation.pixmap = Void) or Result.is_equal (implementation.pixmap)
remove_subtree_function
`Void'subtree_function`Current'
retrieve_item_by_data (some_data: ANY; should_compare_objects: BOOLEAN): EV_TREE_NODE
`Result'`Current'
`some_data'
`should_compare_objects'
EV_DYNAMIC_LIST
ensure EV_DYNAMIC_LIST
not_found_in_empty: Result /= Void implies not is_empty
index_not_changed: old index = index
retrieve_item_recursively_by_data (some_data: ANY; should_compare_objects: BOOLEAN): EV_TREE_NODE
data
`Result'
`should_compare_objects'
EV_TREE_NODE_LIST
ensure EV_TREE_NODE_LIST
not_found_in_empty: Result /= Void implies not is_empty
index_not_changed: old index = index
retrieve_items_by_data (some_data: ANY; should_compare_objects: BOOLEAN): ARRAYED_LIST [EV_TREE_NODE]
`Result'`Current'
`some_data'
`should_compare_objects'
EV_DYNAMIC_LIST
ensure EV_DYNAMIC_LIST
result_not_void: Result /= Void
not_found_in_empty: not Result.is_empty implies not is_empty
index_not_changed: old index = index
retrieve_items_recursively_by_data (some_data: ANY; should_compare_objects: BOOLEAN): ARRAYED_LIST [EV_TREE_NODE]
`Result'`Current'
`some_data'
`should_compare_objects'
EV_TREE_NODE_LIST
ensure EV_TREE_NODE_LIST
result_not_void: Result /= Void
not_found_in_empty: not Result.is_empty implies not is_empty
index_not_changed: old index = index
set_subtree_function (a_subtree_function: like subtree_function)
`a_subtree_function'subtree_function
require
not_destroyed: not is_destroyed
not_void: a_subtree_function /= Void
valid_operands: a_subtree_function.valid_operands (Void)
set_subtree_function_timeout (a_timeout: like subtree_function_timeout)
`a_timeout'subtree_function_timeout
require
not_destroyed: not is_destroyed
subtree_function: FUNCTION [ANY, TUPLE, LINEAR [EV_TREE_NODE]]
`Current'
subtree_function_call
subtree_function
subtree_function_timeout
require
not_destroyed: not is_destroyed
subtree_function_timeout: INTEGER_32
subtree_function
subtree_function
subtree_function
target_name: STRING_GENERAL
`Current'
EV_ABSTRACT_PICK_AND_DROPABLE
text: STRING_32
EV_TEXTABLE
require EV_TEXTABLE
not_destroyed: not is_destroyed
ensure EV_TEXTABLE
bridge_ok: equal (Result, implementation.text)
not_void: Result /= Void
cloned: Result /= implementation.text
no_carriage_returns: not Result.has ('%R')
tooltip: STRING_32
`Current'
`Result'
EV_TOOLTIPABLE
require EV_TOOLTIPABLE
not_destroyed: not is_destroyed
ensure EV_TOOLTIPABLE
bridge_ok: equal (Result, implementation.tooltip)
not_void: Result /= Void
cloned: Result /= implementation.tooltip
infix "@" (i: INTEGER_32): like item assign put_i_th
`i'
CHAINi_th
CHAIN
require TABLE
valid_key: valid_index (i)
feature
count: INTEGER_32
EV_DYNAMIC_LIST
require FINITE
True
require SET
True
ensure then EV_DYNAMIC_LIST
bridge_ok: Result = implementation.count
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
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'
LIST
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
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 is False
EV_DYNAMIC_LIST
is_empty: BOOLEAN
FINITE
require CONTAINER
True
is_expanded: BOOLEAN
`Current'
EV_TREE_NODE
require EV_TREE_NODE
not_destroyed: not is_destroyed
is_inserted (v: EV_TREE_NODE): BOOLEAN
`v'
`has (v)'
COLLECTION
is_selectable: BOOLEAN
enable_select
EV_SELECTABLE
require EV_SELECTABLE
not_destroyed: not is_destroyed
is_selected: BOOLEAN
EV_SELECTABLE
require EV_SELECTABLE
not_destroyed: not is_destroyed
ensure EV_SELECTABLE
bridge_ok: is_selectable implies Result = implementation.is_selected
isfirst: BOOLEAN
CHAIN
ensure CHAIN
valid_position: Result implies not is_empty
islast: BOOLEAN
CHAIN
ensure CHAIN
valid_position: Result implies not is_empty
mode_is_drag_and_drop: BOOLEAN
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.mode_is_drag_and_drop
mode_is_pick_and_drop: BOOLEAN
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.mode_is_pick_and_drop
mode_is_target_menu: BOOLEAN
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure then EV_PICK_AND_DROPABLE
bridge_ok: Result = implementation.mode_is_target_menu
object_comparison: BOOLEAN
equal`='
`='
CONTAINER
off: BOOLEAN
CHAIN
require TRAVERSABLE
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))
valid_cursor (p: CURSOR): BOOLEAN
`p'
`p'
`Current'
EV_DYNAMIC_LIST
require CURSOR_STRUCTURE
True
ensure then EV_DYNAMIC_LIST
bridge_ok: Result = implementation.valid_cursor (p)
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'
CHAIN
require TABLE
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))
feature
collapse
is_expanded`False'
EV_TREE_NODE
require EV_TREE_NODE
not_destroyed: not is_destroyed
is_collapsable: is_expandable
ensure EV_TREE_NODE
not_is_expanded: not is_expanded
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_pebble_positioning
`False'pebble_positioning_enabled
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure EV_PICK_AND_DROPABLE
pebble_positioning_updated: not pebble_positioning_enabled
disable_select
EV_DESELECTABLE
require EV_DESELECTABLE
not_destroyed: not is_destroyed
ensure EV_DESELECTABLE
unselected: not is_selected
enable_pebble_positioning
`True'pebble_positioning_enabled
pebble_x_positionpebble_y_position
`Current'
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure EV_PICK_AND_DROPABLE
pebble_positioning_updated: pebble_positioning_enabled
enable_select
is_selected
EV_SELECTABLE
require EV_SELECTABLE
not_destroyed: not is_destroyed
is_selectable: is_selectable
ensure EV_SELECTABLE
is_selected: is_selected
expand
is_expanded`True'
EV_TREE_NODE
require EV_TREE_NODE
not_destroyed: not is_destroyed
is_expandable: is_expandable
ensure EV_TREE_NODE
is_expanded: is_expanded
remove_pebble
pebble`Void'pebble_function
EV_PICK_AND_DROPABLE
ensure EV_ABSTRACT_PICK_AND_DROPABLE
pebble_removed: pebble = Void and pebble_function = Void
set_accept_cursor (a_cursor: like accept_cursor)
`a_cursor'
pebble
EV_PICK_AND_DROPABLE
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: like deny_cursor)
`a_cursor'
EV_PICK_AND_DROPABLE
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_drag_and_drop_mode
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure EV_PICK_AND_DROPABLE
drag_and_drop_set: mode_is_drag_and_drop
set_pebble (a_pebble: like pebble)
`a_pebble'pebble
set_pebble_function
EV_PICK_AND_DROPABLE
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
pebble
`a_function'
set_pebble
EV_PICK_AND_DROPABLE
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_pebble_position (a_x, a_y: INTEGER_32)
`Current'
`True'
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure EV_PICK_AND_DROPABLE
pebble_position_assigned: pebble_x_position = a_x and pebble_y_position = a_y
set_pick_and_drop_mode
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure EV_PICK_AND_DROPABLE
pick_and_drop_set: mode_is_pick_and_drop
set_target_menu_mode
EV_PICK_AND_DROPABLE
require EV_PICK_AND_DROPABLE
not_destroyed: not is_destroyed
ensure EV_PICK_AND_DROPABLE
target_menu_mode_set: mode_is_target_menu
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)
toggle
is_selected
EV_DESELECTABLE
require EV_DESELECTABLE
not_is_destroyed: not is_destroyed
can_be_selected: not is_selected implies is_selectable
ensure EV_DESELECTABLE
is_selected_changed: is_selected /= old is_selected
feature
back
EV_DYNAMIC_LIST
require BILINEAR
not_before: not before
finish
CHAIN
require LINEAR
True
ensure then CHAIN
at_last: not is_empty implies islast
forth
EV_DYNAMIC_LIST
require LINEAR
not_after: not after
ensure then LIST
moved_forth: index = old index + 1
go_i_th (i: INTEGER_32)
`i'
EV_DYNAMIC_LIST
require CHAIN
valid_cursor_index: valid_cursor_index (i)
ensure CHAIN
position_expected: index = i
go_to (p: CURSOR)
`p'
EV_DYNAMIC_LIST
require CURSOR_STRUCTURE
cursor_position_valid: valid_cursor (p)
search (v: like item)
item`v'
`v'
exhausted
object_comparison
BILINEAR
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
EV_DYNAMIC_LIST
require TRAVERSABLE
True
ensure then CHAIN
at_first: not is_empty implies isfirst
ensure then EV_DYNAMIC_LIST
empty_implies_after: is_empty implies after
feature
remove_pixmap
`Current'
EV_PIXMAPABLE
require EV_PIXMAPABLE
not_destroyed: not is_destroyed
ensure EV_PIXMAPABLE
pixmap_removed: pixmap = Void
remove_text
textis_empty
EV_TEXTABLE
require EV_TEXTABLE
not_destroyed: not is_destroyed
ensure EV_TEXTABLE
text_empty: text.is_empty
remove_tooltip
tooltip
EV_TOOLTIPABLE
require EV_TOOLTIPABLE
not_destroyed: not is_destroyed
ensure EV_TOOLTIPABLE
tooltip_removed: tooltip.is_empty
set_data (some_data: like data)
`some_data'data
EV_ANY
require EV_ANY
not_destroyed: not is_destroyed
ensure EV_ANY
data_assigned: data = some_data
set_pixmap (a_pixmap: EV_PIXMAP)
`a_pixmap'`Current'
pixmap`a_pixmap'
EV_PIXMAPABLE
require EV_PIXMAPABLE
not_destroyed: not is_destroyed
pixmap_not_void: a_pixmap /= Void
set_text (a_text: STRING_GENERAL)
`a_text'text
EV_TEXTABLE
require EV_TEXTABLE
not_destroyed: not is_destroyed
a_text_not_void: a_text /= Void
no_carriage_returns: not a_text.has_code (('%R').natural_32_code)
ensure EV_TEXTABLE
text_cloned: text.is_equal (a_text) and then text /= a_text
set_tooltip (a_tooltip: STRING_GENERAL)
`a_tooltip'tooltip
EV_TOOLTIPABLE
require EV_TOOLTIPABLE
not_destroyed: not is_destroyed
tooltip: a_tooltip /= Void
ensure EV_TOOLTIPABLE
tooltip_assigned: tooltip.is_equal (a_tooltip)
cloned: tooltip /= a_tooltip
feature
linear_representation: LINEAR [EV_TREE_NODE]
LINEAR
require CONTAINER
True
feature
copy (other: like Current)
`other'
EV_ANY
require ANY
other_not_void: other /= Void
type_identity: same_type (other)
ensure ANY
is_equal: is_equal (other)
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)
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
changeable_comparison_criterion: BOOLEAN is False
object_comparison
EV_ITEM_LIST
feature
recursive_do_all (action: PROCEDURE [ANY, TUPLE [EV_TREE_NODE]])
`action'
`action'
EV_TREE_NODE_LIST
require EV_TREE_NODE_LIST
action_not_void: action /= Void
feature
destroy
`Current'
EV_ANY
ensure EV_ANY
is_destroyed: is_destroyed
feature
is_expandable: BOOLEAN
`Current'
require EV_TREE_NODE
not_destroyed: not is_destroyed
is_parent_recursive (a_list: EV_TREE_NODE): BOOLEAN
`a_list'parentparentparent
EV_TREE_NODE
require EV_DYNAMIC_LIST
a_list_not_void: a_list /= Void
not_destroyed: not is_destroyed
same (other: EV_ANY): BOOLEAN
`other'`Current'
EV_DYNAMIC_LIST
feature
collapse_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_TREE_NODE_ACTION_SEQUENCES
ensure EV_TREE_NODE_ACTION_SEQUENCES
not_void: Result /= Void
conforming_pick_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
not_void: Result /= Void
deselect_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_TREE_NODE_ACTION_SEQUENCES
ensure EV_TREE_NODE_ACTION_SEQUENCES
not_void: Result /= Void
drop_actions: EV_PND_ACTION_SEQUENCE
EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
not_void: Result /= Void
expand_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_TREE_NODE_ACTION_SEQUENCES
ensure EV_TREE_NODE_ACTION_SEQUENCES
not_void: Result /= Void
pick_actions: EV_PND_START_ACTION_SEQUENCE
pebble
EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
not_void: Result /= Void
pick_ended_actions: EV_PND_FINISHED_ACTION_SEQUENCE
`Current'
EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
ensure EV_PICK_AND_DROPABLE_ACTION_SEQUENCES
not_void: Result /= Void
pointer_button_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_ITEM_ACTION_SEQUENCES
ensure EV_ITEM_ACTION_SEQUENCES
not_void: Result /= Void
pointer_double_press_actions: EV_POINTER_BUTTON_ACTION_SEQUENCE
EV_ITEM_ACTION_SEQUENCES
ensure EV_ITEM_ACTION_SEQUENCES
not_void: Result /= Void
pointer_motion_actions: EV_POINTER_MOTION_ACTION_SEQUENCE
EV_ITEM_ACTION_SEQUENCES
require EV_ABSTRACT_PICK_AND_DROPABLE
True
ensure EV_ITEM_ACTION_SEQUENCES
not_void: Result /= Void
select_actions: EV_NOTIFY_ACTION_SEQUENCE
EV_TREE_NODE_ACTION_SEQUENCES
ensure EV_TREE_NODE_ACTION_SEQUENCES
not_void: Result /= Void
feature
do_all (action: PROCEDURE [ANY, TUPLE [EV_TREE_NODE]])
`action'
`action'
LINEAR
require TRAVERSABLE
action_exists: action /= Void
do_if (action: PROCEDURE [ANY, TUPLE [EV_TREE_NODE]]; test: FUNCTION [ANY, TUPLE [EV_TREE_NODE], BOOLEAN])
`action'`test'
`action'`test'
LINEAR
require TRAVERSABLE
action_exists: action /= Void
test_exits: test /= Void
for_all (test: FUNCTION [ANY, TUPLE [EV_TREE_NODE], BOOLEAN]): BOOLEAN
`test'
`test'
LINEAR
require TRAVERSABLE
test_exits: test /= Void
ensure then LINEAR
empty: is_empty implies Result
there_exists (test: FUNCTION [ANY, TUPLE [EV_TREE_NODE], BOOLEAN]): BOOLEAN
`test'
`test'
LINEAR
require TRAVERSABLE
test_exits: test /= Void
feature
fixme (comment: STRING_8)
`comment'
REFACTORING_HELPER
require REFACTORING_HELPER
comment_not_void: comment /= Void
to_implement (comment: STRING_8)
`comment'
REFACTORING_HELPER
require REFACTORING_HELPER
comment_not_void: comment /= Void
to_implement_assertion (comment: STRING_8): BOOLEAN
`comment'
REFACTORING_HELPER
require REFACTORING_HELPER
comment_not_void: comment /= Void
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
is_destroyed: BOOLEAN
`Current'
EV_ANY
ensure EV_ANY
bridge_ok: Result = implementation.is_destroyed
invariant
EV_PICK_AND_DROPABLE
user_interface_modes_mutually_exclusive: mode_is_pick_and_drop.to_integer + mode_is_drag_and_drop.to_integer + mode_is_target_menu.to_integer = 1
EV_ANY
is_initialized: is_initialized
is_coupled: implementation /= Void and then implementation.interface = Current
default_create_called: default_create_called
ANY
reflexive_equality: standard_is_equal (Current)
reflexive_conformance: conforms_to (Current)
EV_ITEM_LIST
parent_of_items_is_current: is_usable and then not is_empty implies parent_of_items_is_current
items_unique: is_usable and not is_empty implies items_unique
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)
INDEXABLE
index_set_not_void: index_set /= Void
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
FINITE
empty_definition: is_empty = (count = 0)
non_negative_count: count >= 0
DYNAMIC_CHAIN
extendible: extendible
EV_TEXTABLE
text_not_void: is_usable implies text /= Void
EV_DESELECTABLE
not_selectable_therefore_not_selected: not is_selectable implies not is_selected
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_DYNAMIC_TREE_ITEM