GNU
|
Liberty Eiffel
|
Automated Tests
|
Wiki
|
Savannah project
|
Debian packages
|
Documentation
>
libraries
>
HASHED_DICTIONARY_NODE
+
Point of view
All features
ANY
ABSTRACT_HASHED_DICTIONARY
All features
class HASHED_DICTIONARY_NODE [V_, K_]
Summary
top
Auxiliary class to implement
HASHED_DICTIONARY
.
Direct parents
Inherit list:
ANY_HASHED_DICTIONARY_NODE
Known children
Inherit list:
LINKED_HASHED_DICTIONARY_NODE
Overview
top
Creation features
{
ABSTRACT_HASHED_DICTIONARY
}
make
(i: V_, k: K_, n: HASHED_DICTIONARY_NODE [V_, K_])
Features
{
ABSTRACT_HASHED_DICTIONARY
}
item
: V_
key
: K_
next
: HASHED_DICTIONARY_NODE [V_, K_]
The
next
one when some clash occurs.
set_item
(i: V_)
set_next
(n: HASHED_DICTIONARY_NODE [V_, K_])
make
(i: V_, k: K_, n: HASHED_DICTIONARY_NODE [V_, K_])
item
: V_
writable attribute
{
ABSTRACT_HASHED_DICTIONARY
}
top
key
: K_
writable attribute
{
ABSTRACT_HASHED_DICTIONARY
}
top
next
: 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: HASHED_DICTIONARY_NODE [V_, K_])
effective procedure
{
ABSTRACT_HASHED_DICTIONARY
}
top
ensure
next
= n
make
(i: V_, k: K_, n: HASHED_DICTIONARY_NODE [V_, K_])
effective procedure
{
ABSTRACT_HASHED_DICTIONARY
}
top
ensure
item
= i
key
= k
next
= n