GNU
|
Liberty Eiffel
|
Automated Tests
|
Wiki
|
Savannah project
|
Debian packages
|
Documentation
>
libraries
>
HASHED_BIJECTIVE_DICTIONARY_NODE
+
Point of view
All features
ANY
HASHED_BIJECTIVE_DICTIONARY
All features
class HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_]
Summary
top
Auxiliary class to implement
HASHED_BIJECTIVE_DICTIONARY
.
Direct parents
Inherit list:
ANY_HASHED_BIJECTIVE_DICTIONARY_NODE
Class invariant
top
key
/= Void
val
/= Void
Overview
top
Creation features
{
HASHED_BIJECTIVE_DICTIONARY
}
make
(v: V_, nv: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_], k: K_, nk: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_])
Features
{
HASHED_BIJECTIVE_DICTIONARY
}
val
: V_
key
: K_
next_key
: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_]
The forward link to the next
key
in case of hash-code clash.
next_val
: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_]
The forward link to the next
val
in case of hash-code clash.
make
(v: V_, nv: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_], k: K_, nk: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_])
set_val
(v: V_)
set_next_val
(nv: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_])
set_key
(k: K_)
set_next_key
(nk: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_])
set_val_and_key
(v: V_, k: K_)
val
: V_
writable attribute
{
HASHED_BIJECTIVE_DICTIONARY
}
top
key
: K_
writable attribute
{
HASHED_BIJECTIVE_DICTIONARY
}
top
next_key
: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_]
writable attribute
{
HASHED_BIJECTIVE_DICTIONARY
}
top
The forward link to the next
key
in case of hash-code clash.
next_val
: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_]
writable attribute
{
HASHED_BIJECTIVE_DICTIONARY
}
top
The forward link to the next
val
in case of hash-code clash.
make
(v: V_, nv: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_], k: K_, nk: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_])
effective procedure
{
HASHED_BIJECTIVE_DICTIONARY
}
top
require
v /= Void
k /= Void
ensure
val
= v
next_val
= nv
key
= k
next_key
= nk
set_val
(v: V_)
effective procedure
{
HASHED_BIJECTIVE_DICTIONARY
}
top
ensure
val
= v
set_next_val
(nv: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_])
effective procedure
{
HASHED_BIJECTIVE_DICTIONARY
}
top
ensure
next_val
= nv
set_key
(k: K_)
effective procedure
{
HASHED_BIJECTIVE_DICTIONARY
}
top
ensure
key
= k
set_next_key
(nk: HASHED_BIJECTIVE_DICTIONARY_NODE [V_, K_])
effective procedure
{
HASHED_BIJECTIVE_DICTIONARY
}
top
ensure
next_key
= nk
set_val_and_key
(v: V_, k: K_)
effective procedure
{
HASHED_BIJECTIVE_DICTIONARY
}
top
ensure
val
= v
key
= k