class HASHED_BIJECTIVE_DICTIONARY [V_ -> HASHABLE, K_ -> HASHABLE]
Summary
Class invariant
Overview
creation features
  • make
    Create an empty dictionary.
  • with_capacity (medium_size: INTEGER_32)
    May be used to save some execution time if one is sure that storage size will rapidly become really bigger than Default_size.
exported features
  • count: INTEGER_32
    Number of available indices.
  • has (k: K_): BOOLEAN
    Is there a value currently associated with key k?
  • at (k: K_): V_
    Return the value associated to key k.
  • reference_at (k: K_): V_
    Return Void or the value associated with key k.
  • fast_has (k: K_): BOOLEAN
    Is there a value currently associated with key k?
  • fast_at (k: K_): V_
    Return the value associated to key k.
  • fast_reference_at (k: K_): V_
    Return Void or the value associated with key k.
  • has_value (v: V_): BOOLEAN
    Is there a value v?
  • key_at (v: V_): K_
    Retrieve the key used for value v using is_equal for comparison.
  • fast_has_value (v: V_): BOOLEAN
    Is there a value v?
  • fast_key_at (v: V_): K_
    Retrieve the key used for value v using = for comparison.
  • put (v: V_, k: K_)
    Change some existing entry or add the new one.
  • add (v: V_, k: K_)
    To add a new entry k with its associated value v.
  • remove (k: K_)
    Remove entry k (which may exist or not before this call).
  • clear_count
    Discard all items (is_empty is True after that call).
  • clear_count_and_capacity
    Discard all items (is_empty is True after that call).
  • item (index: INTEGER_32): V_
    Item at the corresponding index i.
  • key (index: INTEGER_32): K_
  • Default_size: INTEGER_32
    Default size for the storage area in number of items.
  • internal_key (k: K_): K_
    Retrieve the internal key object which correspond to the existing entry k (the one memorized into the Current dictionary).
Counting:
To provide iterating facilities:
Agents based features:
Indexing:
Other features:
count: INTEGER_32
writable attribute
Number of available indices.
has (k: K_): BOOLEAN
effective function
Is there a value currently associated with key k?
at (k: K_): V_
effective function
Return the value associated to key k.
reference_at (k: K_): V_
effective function
Return Void or the value associated with key k.
fast_has (k: K_): BOOLEAN
effective function
Is there a value currently associated with key k?
fast_at (k: K_): V_
effective function
Return the value associated to key k.
fast_reference_at (k: K_): V_
effective function
Return Void or the value associated with key k.
has_value (v: V_): BOOLEAN
effective function
Is there a value v?
key_at (v: V_): K_
effective function
Retrieve the key used for value v using is_equal for comparison.
fast_has_value (v: V_): BOOLEAN
effective function
Is there a value v?
fast_key_at (v: V_): K_
effective function
Retrieve the key used for value v using = for comparison.
put (v: V_, k: K_)
effective procedure
Change some existing entry or add the new one.
add (v: V_, k: K_)
effective procedure
To add a new entry k with its associated value v.
remove (k: K_)
effective procedure
Remove entry k (which may exist or not before this call).
clear_count
effective procedure
Discard all items (is_empty is True after that call).
clear_count_and_capacity
effective procedure
Discard all items (is_empty is True after that call).
item (index: INTEGER_32): V_
effective function
Item at the corresponding index i.
key (index: INTEGER_32): K_
effective function
Default_size: INTEGER_32
constant attribute
Default size for the storage area in number of items.
internal_key (k: K_): K_
effective function
Retrieve the internal key object which correspond to the existing entry k (the one memorized into the Current dictionary).
capacity: INTEGER_32
writable attribute
Approximation of the actual internal storage capacity.
copy (other: HASHED_BIJECTIVE_DICTIONARY [V_ -> HASHABLE, K_ -> HASHABLE])
effective procedure
Reinitialize by copying all associations of other.
is_empty: BOOLEAN
effective function
Is it empty ?
lower: INTEGER_32
constant attribute
Minimum index.
upper: INTEGER_32
effective function
Maximum index.
first: V_
effective function
The very first item.
last: V_
effective function
The last item.
get_new_iterator_on_items: ITERATOR[V_]
effective function
get_new_iterator_on_keys: ITERATOR[K_]
effective function
is_equal (other: HASHED_BIJECTIVE_DICTIONARY [V_ -> HASHABLE, K_ -> HASHABLE]): BOOLEAN
effective function
Do both dictionaries have the same set of associations?
do_all (action: ROUTINE[TUPLE[TUPLE 2[V_, K_]]])
effective procedure
Apply action to every [V_, K_] associations of Current.
for_all (test: FUNCTION[TUPLE[TUPLE 2[V_, K_]]]): BOOLEAN
effective function
Do all [V_, K_] associations satisfy test?
exists (test: FUNCTION[TUPLE[TUPLE 2[V_, K_]]]): BOOLEAN
effective function
Does at least one [V_, K_] association satisfy test?
valid_index (i: INTEGER_32): BOOLEAN
effective function
True when i is valid (i.e., inside actual bounds).
get_new_iterator: ITERATOR[E_]
deferred function