indexing
description: "Trees with a dynamically modifiable structure"
legal: "See notice at end of class."
status: "See notice at end of class."
names: dynamic_tree, tree
representation: recursive
access: cursor, membership
contents: generic
date: "$Date: 2006-01-22 18:25:44 -0800 (Sun, 22 Jan 2006) $"
revision: "$Revision: 56675 $"
deferred class interface
DYNAMIC_TREE [G]
feature
child: like parent
TREE
require TREE
readable: readable_child
child_cursor: CURSOR
TREE
child_index: INTEGER_32
TREE
ensure TREE
valid_index: Result >= 0 and Result <= arity + 1
child_item: like item
TREE
require TREE
readable: child_readable
first_child: like parent
TREE
require TREE
is_not_leaf: not is_leaf
generating_type: STRING_8
ANY
generator: STRING_8
ANY
item: G
TREE
last_child: like first_child
TREE
require TREE
is_not_leaf: not is_leaf
left_sibling: like parent
TREE
require TREE
is_not_root: not is_root
ensure TREE
is_sibling: Result /= Void implies is_sibling (Result)
right_is_current: (Result /= Void) implies (Result.right_sibling = Current)
parent: DYNAMIC_TREE [G]
right_sibling: like parent
TREE
require TREE
is_not_root: not is_root
ensure TREE
is_sibling: Result /= Void implies is_sibling (Result)
left_is_current: (Result /= Void) implies (Result.left_sibling = Current)
feature
arity: INTEGER_32
TREE
child_capacity: INTEGER_32
TREE
count: INTEGER_32
TREE
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'
object_comparison
TREE
require ANY
other_not_void: other /= Void
ensure ANY
symmetric: Result implies other.is_equal (Current)
consistent: standard_is_equal (other) implies Result
node_is_equal (other: like Current): BOOLEAN
`other'
TREE
require TREE
other_not_void: other /= Void
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
changeable_comparison_criterion: BOOLEAN
object_comparison
CONTAINER
child_after: BOOLEAN
TREE
child_before: BOOLEAN
TREE
child_isfirst: BOOLEAN
TREE
ensure TREE
not_is_leaf: Result implies not is_leaf
child_islast: BOOLEAN
TREE
ensure TREE
not_is_leaf: Result implies not is_leaf
child_off: BOOLEAN
TREE
child_readable: BOOLEAN
child_item
TREE
child_writable: BOOLEAN
child_item
TREE
conforms_to (other: ANY): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
extendible: BOOLEAN is True
has (v: G): BOOLEAN
`v'
object_comparison
TREE
ensure CONTAINER
not_found_in_empty: Result implies not is_empty
is_empty: BOOLEAN
TREE
is_leaf: BOOLEAN
TREE
is_root: BOOLEAN
TREE
is_sibling (other: like parent): BOOLEAN
`other'
TREE
require TREE
other_exists: other /= Void
ensure TREE
not_root: Result implies not is_root
other_not_root: Result implies not other.is_root
same_parent: Result = not is_root and other.parent = parent
object_comparison: BOOLEAN
equal`='
`='
CONTAINER
readable: BOOLEAN is True
TREE
readable_child: BOOLEAN
TREE
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_index (i: INTEGER_32): BOOLEAN
`i'
TREE
ensure TREE
valid_cursor_index_definition: Result = (i >= 0) and (i <= child_capacity + 1)
writable: BOOLEAN is True
TREE
writable_child: BOOLEAN
TREE
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
feature
child_back
TREE
child_finish
TREE
child_forth
TREE
child_go_i_th (i: INTEGER_32)
`i'
TREE
ensure then TREE
position: child_index = i
child_go_to (p: CURSOR)
`p'
TREE
child_start
TREE
feature
child_extend (v: like item)
`v'
child_put (v: like item)
`v'
TREEchild_replace
TREE
require TREE
child_writable: child_writable
ensure TREE
item_inserted: child_item = v
child_put_left (v: like item)
`v'
require
not_child_before: not child_before
child_put_right (v: like item)
`v'
require
not_child_after: not child_after
child_replace (v: like item)
`v'
TREEchild_put
TREE
require TREE
child_writable: child_writable
ensure TREE
item_inserted: child_item = v
extend (v: like item)
`v'
fill (other: TREE [G])
`other'
`other'
TREE
merge_tree_after (other: like first_child)
`other'
`other'
require
not_child_off: not child_off
other_exists: (other /= Void)
ensure
other_is_leaf: other.is_leaf
merge_tree_before (other: like first_child)
`other'
`other'
require
not_child_off: not child_off
other_exists: (other /= Void)
ensure
other_is_leaf: other.is_leaf
prune (n: like parent)
`n'
TREE
require TREE
is_child: n.parent = Current
ensure TREE
n_is_root: n.is_root
put (v: like item)
`v'
TREEreplace
TREE
require TREE
is_writable: writable
ensure TREE
item_inserted: item = v
put_child (n: like parent)
`n'
TREE
require TREE
non_void_argument: n /= Void
put_child_left (n: like parent)
`n'
require
not_child_before: not child_before
non_void_argument: n /= Void
put_child_right (n: like parent)
`n'
require
not_child_after: not child_after
non_void_argument: n /= Void
replace (v: like item)
`v'
TREEput
TREE
require TREE
is_writable: writable
ensure TREE
item_inserted: item = v
replace_child (n: like parent)
`n'
TREE
require TREE
writable_child: writable_child
ensure TREE
child_replaced: child = n
sprout
TREE
feature
forget_left
TREE
forget_right
TREE
remove_child
`after'
require
child_not_off: not child_off
ensure
new_arity: arity = old arity - 1
new_child_index: child_index = old child_index
remove_left_child
require
is_not_first: not child_isfirst
ensure
new_arity: arity = old arity - 1
new_child_index: child_index = old child_index - 1
remove_right_child
require
is_not_last: not child_islast
ensure
new_arity: arity = old arity - 1
new_child_index: child_index = old child_index
wipe_out
TREE
ensure TREE
is_leaf: is_leaf
feature
binary_representation: BINARY_TREE [G]
TREE
ensure TREE
result_is_root: Result.is_root
result_has_no_right_child: not Result.has_right
fill_from_binary (b: BINARY_TREE [G])
`b'
linear_representation: LINEAR [G]
TREE
feature
copy (other: like Current)
`other'
TREE
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)
duplicate (n: INTEGER_32): like Current
`n'aritychild_index
require TREE
not_child_off: not child_off
valid_sublist: 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
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
invariant
extendible_definition: extendible
child_after_definition: child_after = (child_index = arity + 1)
TREE
tree_consistency: child_readable implies child.parent = Current
leaf_definition: is_leaf = (arity = 0)
child_off_definition: child_off = child_before or child_after
child_before_definition: child_before = (child_index = 0)
child_isfirst_definition: child_isfirst = (not is_leaf and child_index = 1)
child_islast_definition: child_islast = (not is_leaf and child_index = child_capacity)
child_after_definition: child_after = (child_index >= child_capacity + 1)
ANY
reflexive_equality: standard_is_equal (Current)
reflexive_conformance: conforms_to (Current)
indexing
library: "EiffelBase: Library of reusable components for Eiffel."
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 DYNAMIC_TREE