+
Point of view
All features
deferred class EIFFEL_LIST_NODE
Summary
top
Direct parents
Inherit list: EIFFEL_NODE
Insert list: TRAVERSABLE
Known children
Inherit list: EIFFEL_LIST_NODE_IMPL
Overview
top
Features
{ANY}
{EIFFEL_GRAMMAR}
{ANY}
{EIFFEL_GRAMMAR}
Basic operations
{EIFFEL_NODE_HANDLER}
{EIFFEL_NODE_HANDLER}
{EIFFEL_NON_TERMINAL_NODE, EIFFEL_LIST_NODE}
{}
{ANY}
{ANY}
Other features:
{ANY}
Agent-based features:
{ANY}
Printing:
{ANY}
{ANY}
{}
Counting:
{ANY}
Agent-based features:
{ANY}
{}
Indexing:
{ANY}
Accessing:
{ANY}
new_iterator: ITERATOR[EIFFEL_NODE]
frozen
effective function
{ANY}
top
source_line: INTEGER_32
effective function
{ANY}
top
source_column: INTEGER_32
effective function
{ANY}
top
source_index: INTEGER_32
effective function
{ANY}
top
add (a_child: EIFFEL_NODE)
deferred procedure
{EIFFEL_GRAMMAR}
top
parent: EIFFEL_NODE
writable attribute
{ANY}
top
the parent node
forgotten: FAST_ARRAY[EIFFEL_NODE]
writable attribute
{ANY}
top
used when this node is in a EIFFEL_LIST_NODE and nodes are between this node and the next one
deferred function
{ANY}
top
the name of the node in the grammar
set_forgotten (a_forgotten: FAST_ARRAY[EIFFEL_NODE])
effective procedure
{EIFFEL_GRAMMAR}
top
display (output: OUTPUT_STREAM, indent: INTEGER_32, p: STRING)
deferred procedure
{EIFFEL_NODE_HANDLER}
top
Display the node in a tree fashion in the provided output stream
generate (o: OUTPUT_STREAM)
deferred procedure
{EIFFEL_NODE_HANDLER}
top
Generate the node exactly as it was written, including blanks and forgotten nodes, onto the provided output stream
generate_forgotten (o: OUTPUT_STREAM)
effective procedure
{EIFFEL_NODE_HANDLER}
top
set_parent (a_parent: EIFFEL_NODE)
effective procedure
{EIFFEL_NON_TERMINAL_NODE, EIFFEL_LIST_NODE}
top
do_indent (output: OUTPUT_STREAM, indent: INTEGER_32, p: STRING)
effective procedure
{}
top
accept (visitor: VISITOR)
deferred procedure
{ANY}
top
Accept to be visited by the visitor.
enumerate: ENUMERATE[E_]
effective function
{ANY}
top
get_new_iterator: ITERATOR[E_]
frozen
effective function
{ANY}
top
for_each (action: PROCEDURE[TUPLE[TUPLE 1[E_]]])
effective procedure
{ANY}
top
Apply action to every item of Current.
for_all (test: FUNCTION[TUPLE[TUPLE 1[E_]]]): BOOLEAN
effective function
{ANY}
top
Do all items satisfy test?
exists (test: FUNCTION[TUPLE[TUPLE 1[E_]]]): BOOLEAN
effective function
{ANY}
top
Does at least one item satisfy test?
aggregate (action: FUNCTION[TUPLE[TUPLE 2[E_, E_], E_]], initial: E_): E_
effective function
{ANY}
top
Aggregate all the elements starting from the initial value.
out_in_tagged_out_memory
effective procedure
{ANY}
top
Append terse printable representation of current object in tagged_out_memory.
generation: INTEGER_32
writable attribute
{ANY}
top
next_generation
effective procedure
{}
top
count: INTEGER_32
deferred function
{ANY}
top
Number of available items in the hoard.
is_empty: BOOLEAN
deferred function
{ANY}
top
Is the hoard empty ?
See also count.
do_all (action: ROUTINE[TUPLE[TUPLE 1[E_]]])
frozen
effective procedure
{ANY}
top
Apply action to every item of Current.
_inline_agent1 (a: ROUTINE[TUPLE[TUPLE 1[E_]]], e: E_)
frozen
effective procedure
{}
top
lower: INTEGER_32
deferred function
{ANY}
top
Minimum index.
upper: INTEGER_32
deferred function
{ANY}
top
Maximum index.
valid_index (i: INTEGER_32): BOOLEAN
effective function
{ANY}
top
True when i is valid (i.e., inside actual bounds).
item (i: INTEGER_32): E_
deferred function
{ANY}
top
Item at the corresponding index i.
first: E_
deferred function
{ANY}
top
The very first item.
last: E_
deferred function
{ANY}
top
The last item.