GNU
|
Liberty Eiffel
|
Automated Tests
|
Wiki
|
Savannah project
|
Debian packages
|
Documentation
>
libraries
>
LINKED_HASHED_DICTIONARY_NODE
+
Point of view
All features
ANY
HASHED_DICTIONARY
ABSTRACT_LINKED_HASHED_DICTIONARY
ITERATOR_ON_LINKED_HASHED_DICTIONARY_ITEMS
ITERATOR_ON_LINKED_HASHED_DICTIONARY_KEYS
ITERATOR_ON_LINKED_HASHED_DICTIONARY
All features
class LINKED_HASHED_DICTIONARY_NODE [V_, K_]
Summary
top
Auxiliary class to implement
LINKED_HASHED_DICTIONARY
.
Direct parents
Inherit list:
HASHED_DICTIONARY_NODE
Overview
top
Creation features
{
ABSTRACT_HASHED_DICTIONARY
}
make
(i: V_, k: K_, n: LINKED_HASHED_DICTIONARY_NODE [V_, K_])
Features
{
ABSTRACT_LINKED_HASHED_DICTIONARY
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY_ITEMS
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY_KEYS
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY
}
previous_link
: LINKED_HASHED_DICTIONARY_NODE [V_, K_]
To implement the good iterating order.
next_link
: LINKED_HASHED_DICTIONARY_NODE [V_, K_]
To implement the good iterating order.
{
ABSTRACT_LINKED_HASHED_DICTIONARY
}
set_links
(a_previous: LINKED_HASHED_DICTIONARY_NODE [V_, K_], a_next: LINKED_HASHED_DICTIONARY_NODE [V_, K_])
{
ABSTRACT_HASHED_DICTIONARY
}
item
: V_
key
: K_
next
: LINKED_HASHED_DICTIONARY_NODE [V_, K_]
The
next
one when some clash occurs.
set_item
(i: V_)
set_next
(n: LINKED_HASHED_DICTIONARY_NODE [V_, K_])
make
(i: V_, k: K_, n: LINKED_HASHED_DICTIONARY_NODE [V_, K_])
previous_link
: LINKED_HASHED_DICTIONARY_NODE [V_, K_]
writable attribute
{
ABSTRACT_LINKED_HASHED_DICTIONARY
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY_ITEMS
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY_KEYS
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY
}
top
To implement the good iterating order.
next_link
: LINKED_HASHED_DICTIONARY_NODE [V_, K_]
writable attribute
{
ABSTRACT_LINKED_HASHED_DICTIONARY
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY_ITEMS
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY_KEYS
,
ITERATOR_ON_LINKED_HASHED_DICTIONARY
}
top
To implement the good iterating order.
set_links
(a_previous: LINKED_HASHED_DICTIONARY_NODE [V_, K_], a_next: LINKED_HASHED_DICTIONARY_NODE [V_, K_])
effective procedure
{
ABSTRACT_LINKED_HASHED_DICTIONARY
}
top
ensure
previous_link
= a_previous
next_link
= a_next
item
: V_
writable attribute
{
ABSTRACT_HASHED_DICTIONARY
}
top
key
: K_
writable attribute
{
ABSTRACT_HASHED_DICTIONARY
}
top
next
: LINKED_HASHED_DICTIONARY_NODE [V_, K_]
writable attribute
{
ABSTRACT_HASHED_DICTIONARY
}
top
The
next
one when some clash occurs.
set_item
(i: V_)
effective procedure
{
ABSTRACT_HASHED_DICTIONARY
}
top
ensure
item
= i
set_next
(n: LINKED_HASHED_DICTIONARY_NODE [V_, K_])
effective procedure
{
ABSTRACT_HASHED_DICTIONARY
}
top
ensure
next
= n
make
(i: V_, k: K_, n: LINKED_HASHED_DICTIONARY_NODE [V_, K_])
effective procedure
{
ABSTRACT_HASHED_DICTIONARY
}
top
ensure
item
= i
key
= k
next
= n