+
Point of view
All features
class LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]
Summary
top
Direct parents
Inherit list: HIERARCHIC_GRAPH_NODE
Class invariant
top
Overview
top
Creation features
{ANY}
Features
{ANY}
{ANY}
{LOADED_HIERARCHIC_GRAPH_NODE}
{ANY}
{HIERARCHIC_GRAPH_NODE}
{}
{HIERARCHIC_GRAPH_NODE}
{HIERARCHIC_GRAPH_NODE}
{ANY}
  • is_equal (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]): BOOLEAN
    Is other attached to an object considered equal to current object?
Maximum:
{}
Minimum:
{}
Bits:
{}
make (i: HASHABLE)
effective procedure
{ANY}
top
parent_edge_load (i: INTEGER_32): LOAD
effective function
{ANY}
top
child_edge_load (i: INTEGER_32): LOAD
effective function
{ANY}
top
add_parent (node: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD])
effective procedure
{ANY}
top
add_child (node: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD])
effective procedure
{ANY}
top
remove_parent (node: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD])
effective procedure
{ANY}
top
remove_child (node: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD])
effective procedure
{ANY}
top
parents_edge_load: FAST_ARRAY[LOAD]
writable attribute
{LOADED_HIERARCHIC_GRAPH_NODE}
top
children_edge_load: FAST_ARRAY[LOAD]
writable attribute
{LOADED_HIERARCHIC_GRAPH_NODE}
top
item: E_
writable attribute
{ANY}
top
max_rank: INTEGER_32
writable attribute
{ANY}
top
min_rank: INTEGER_32
writable attribute
{ANY}
top
parents: FAST_ARRAY[LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]]
writable attribute
{ANY}
top
children: FAST_ARRAY[LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]]
writable attribute
{ANY}
top
set_item (i: E_)
effective procedure
{ANY}
top
parents_count: INTEGER_32
effective function
{ANY}
top
children_count: INTEGER_32
effective function
{ANY}
top
has_parent_edge (id: INTEGER_32): BOOLEAN
effective function
{ANY}
top
has_child_edge (id: INTEGER_32): BOOLEAN
effective function
{ANY}
top
remove_parent_edge (id: INTEGER_32): LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]
effective function
{ANY}
top
Return connected node.
restore_parent_edge (id: INTEGER_32, node: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD])
effective procedure
{ANY}
top
remove_child_edge (id: INTEGER_32): LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]
effective function
{ANY}
top
Return connected node.
restore_child_edge (id: INTEGER_32, node: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD])
effective procedure
{ANY}
top
deep_reset_edges
effective procedure
{ANY}
top
Set edge identifiers with values starting from 0.
parent (i: INTEGER_32): LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]
effective function
{ANY}
top
child (i: INTEGER_32): LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]
effective function
{ANY}
top
has_parent (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]): BOOLEAN
effective function
{ANY}
top
has_child (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]): BOOLEAN
effective function
{ANY}
top
parent_edge (i: INTEGER_32): INTEGER_32
effective function
{ANY}
top
child_edge (i: INTEGER_32): INTEGER_32
effective function
{ANY}
top
has_cycle: BOOLEAN
effective function
{ANY}
top
has_parent_cycle: BOOLEAN
effective function
{ANY}
top
has_children_cycle: BOOLEAN
effective function
{ANY}
top
is_toplevel: BOOLEAN
effective function
{ANY}
top
is_leaf: BOOLEAN
effective function
{ANY}
top
is_connected_to (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]): BOOLEAN
effective function
{ANY}
top
distance (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]): INTEGER_32
effective function
{ANY}
top
set_rank
effective procedure
{ANY}
top
add_connected_nodes_in (list: COLLECTION[HIERARCHIC_GRAPH_NODE[E_]])
effective procedure
{ANY}
top
Add in list all nodes belonging to the same graph as Current
fill_path_to (path: COLLECTION[INTEGER_32], destination: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD])
effective procedure
{ANY}
top
Add in path edges identifiers corresponding to a path from current node to destination node.
hash_code: INTEGER_32
effective function
{ANY}
top
The hash-code value of Current.
internal_has_parent_cycle: BOOLEAN
effective function
{HIERARCHIC_GRAPH_NODE}
top
internal_has_children_cycle: BOOLEAN
effective function
{HIERARCHIC_GRAPH_NODE}
top
internal_is_connected_to (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]): BOOLEAN
effective function
{HIERARCHIC_GRAPH_NODE}
top
internal_unmark_parents
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
internal_unmark_children
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
internal_unmark_connected
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
unmark parents and children
internal_deep_reset_edges: INTEGER_32
effective function
{HIERARCHIC_GRAPH_NODE}
top
internal_deep_init_edges (use: INTEGER_32): INTEGER_32
effective function
{HIERARCHIC_GRAPH_NODE}
top
internal_distance (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD], pos: INTEGER_32, max: INTEGER_32): INTEGER_32
effective function
{HIERARCHIC_GRAPH_NODE}
top
Returns Maximum_integer if inaccessibility detected Returns -1 when break needed Distance from current point otherwise Warning: max length and pos are from the search start.
clean_mark_score
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
internal_set_rank
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
internal_add_connected_nodes_in (list: COLLECTION[HIERARCHIC_GRAPH_NODE[E_]])
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
internal_fill_path_to (path: COLLECTION[INTEGER_32], destination: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD], position: INTEGER_32): BOOLEAN
effective function
{HIERARCHIC_GRAPH_NODE}
top
invariant_checking_mode: REFERENCE[BOOLEAN]
once function
{}
top
valid_parents: BOOLEAN
effective function
{}
top
valid_children: BOOLEAN
effective function
{}
top
valid_parents_and_children: BOOLEAN
effective function
{}
top
set_invariant_checking_mode (new_mode: BOOLEAN)
effective procedure
{}
top
deconnect_current
effective procedure
{}
top
parents_edge: FAST_ARRAY[INTEGER_32]
writable attribute
{HIERARCHIC_GRAPH_NODE}
top
children_edge: FAST_ARRAY[INTEGER_32]
writable attribute
{HIERARCHIC_GRAPH_NODE}
top
mark: BOOLEAN
writable attribute
{HIERARCHIC_GRAPH_NODE}
top
unmark
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
set_mark
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
deep_unmark_connected
effective procedure
{HIERARCHIC_GRAPH_NODE}
top
deep unmark parents and children (paths stops at unmarked nodes)
mark_score: INTEGER_32
writable attribute
{HIERARCHIC_GRAPH_NODE}
top
is_equal (other: LOADED_HIERARCHIC_GRAPH_NODE [E_ -> HASHABLE, LOAD]): BOOLEAN
deferred function
{ANY}
top
Is other attached to an object considered equal to current object?
Maximum_character_code: INTEGER_16
{}
top
Largest supported code for CHARACTER values.
Maximum_integer_8: INTEGER_8
is 127
constant attribute
{}
top
Largest supported value of type INTEGER_8.
Maximum_integer_16: INTEGER_16
is 32767
constant attribute
{}
top
Largest supported value of type INTEGER_16.
Maximum_integer: INTEGER_32
is 2147483647
constant attribute
{}
top
Largest supported value of type INTEGER/INTEGER_32.
Maximum_integer_32: INTEGER_32
is 2147483647
constant attribute
{}
top
Largest supported value of type INTEGER/INTEGER_32.
Maximum_integer_64: INTEGER_64
is 9223372036854775807
constant attribute
{}
top
Largest supported value of type INTEGER_64.
Maximum_real_32: REAL_32
is {REAL_32 3.4028234663852885981170418348451692544e+38}
constant attribute
{}
top
Largest non-special (no NaNs nor infinity) supported value of type REAL_32.
Maximum_real: REAL_64
{}
top
Largest non-special (no NaNs nor infinity) supported value of type REAL.
Maximum_real_64: REAL_64
{}
top
Largest non-special (no NaNs nor infinity) supported value of type REAL.
Maximum_real_80: REAL_EXTENDED
{}
top
Largest supported value of type REAL_80.
Minimum_character_code: INTEGER_16
{}
top
Smallest supported code for CHARACTER values.
Minimum_integer_8: INTEGER_8
is -128
constant attribute
{}
top
Smallest supported value of type INTEGER_8.
Minimum_integer_16: INTEGER_16
is -32768
constant attribute
{}
top
Smallest supported value of type INTEGER_16.
Minimum_integer: INTEGER_32
is -2147483648
constant attribute
{}
top
Smallest supported value of type INTEGER/INTEGER_32.
Minimum_integer_32: INTEGER_32
is -2147483648
constant attribute
{}
top
Smallest supported value of type INTEGER/INTEGER_32.
Minimum_integer_64: INTEGER_64
is -9223372036854775808
constant attribute
{}
top
Smallest supported value of type INTEGER_64.
Minimum_real_32: REAL_32
is {REAL_32 -3.40282346638528859811704183484516925440e+38}
constant attribute
{}
top
Smallest non-special (no NaNs nor infinity) supported value of type REAL_32.
Minimum_real: REAL_64
{}
top
Smallest non-special (no NaNs nor infinity) supported value of type REAL.
Minimum_real_64: REAL_64
{}
top
Smallest non-special (no NaNs nor infinity) supported value of type REAL.
Minimum_real_80: REAL_64
{}
top
Smallest supported value of type REAL_80.
Boolean_bits: INTEGER_32
{}
top
Number of bits in a value of type BOOLEAN.
Character_bits: INTEGER_32
{}
top
Number of bits in a value of type CHARACTER.
Integer_bits: INTEGER_32
{}
top
Number of bits in a value of type INTEGER.
Real_bits: INTEGER_32
is 64
constant attribute
{}
top
Number of bits in a value of type REAL.
Pointer_bits: INTEGER_32
{}
top
Number of bits in a value of type POINTER.