home
wiki
classes/clusters list
class information
+
Point of view
TWO_WAY_LINKED_LIST
ANY
TWO_WAY_LINKED_LIST_NODE
TWO_WAY_LINKED_LIST
ITERATOR_ON_TWO_WAY_LINKED_LIST
INTERNALS_HANDLER
All features
class TWO_WAY_LINKED_LIST_NODE [E_]
Summary
top
To implement
TWO_WAY_LINKED_LIST
.
Direct parents
inherit list:
ANY_TWO_WAY_LINKED_LIST_NODE
Overview
top
creation features
make
(i: E_, p: TWO_WAY_LINKED_LIST_NODE [E_], n: TWO_WAY_LINKED_LIST_NODE [E_])
exported features
item
: E_
previous
: TWO_WAY_LINKED_LIST_NODE [E_]
next
: TWO_WAY_LINKED_LIST_NODE [E_]
make
(i: E_, p: TWO_WAY_LINKED_LIST_NODE [E_], n: TWO_WAY_LINKED_LIST_NODE [E_])
set_item
(i: E_)
set_next
(n: TWO_WAY_LINKED_LIST_NODE [E_])
set_all_with
(v: E_)
set_previous
(p: TWO_WAY_LINKED_LIST_NODE [E_])
item
: E_
writable attribute
top
previous
: TWO_WAY_LINKED_LIST_NODE [E_]
writable attribute
top
next
: TWO_WAY_LINKED_LIST_NODE [E_]
writable attribute
top
make
(i: E_, p: TWO_WAY_LINKED_LIST_NODE [E_], n: TWO_WAY_LINKED_LIST_NODE [E_])
effective procedure
top
ensure
item
= i
previous
= p
next
= n
set_item
(i: E_)
effective procedure
top
ensure
item
= i
set_next
(n: TWO_WAY_LINKED_LIST_NODE [E_])
effective procedure
top
ensure
next
= n
set_all_with
(v: E_)
effective procedure
top
set_previous
(p: TWO_WAY_LINKED_LIST_NODE [E_])
effective procedure
top
ensure
previous
= p