Inherit/Insert Summary | |
| |
No developed. |
Constructor Summary | |
|
Counting: | |
count of stored elements.
Number of available indices.See also is_empty , lower , upper .
| |
See also count .
|
Basic access: | |
See also fast_has , at .
| |
See also fast_at , reference_at , has .
| |
has just followed by at to get
the corresponding value.See also fast_reference_at , at , has .
| |
See also has , at , fast_at .
| |
See also at , reference_at , fast_reference_at .
| |
reference_at , but basic = is used for comparison.See also reference_at , at , has .
|
Modification. | |
See also fast_put, add. | |
See also put, add. | |
See also put, fast_put. |
Looking and searching some value: | |
See also fast_occurrences , fast_has , has .
| |
See also occurrences , fast_has , has .
| |
See also fast_key_at , at .
| |
See also key_at , at .
|
Removing: | |
remove procedure actually uses is_equal, you may
consider to use fast_remove for expanded objects as well
while trying to get the very best performances.See also fast_remove , clear_count .
| |
remove , but uses basic = for comparison.See also remove , clear_count .
| |
is_empty is True after that call).
The internal capacity is not changed by this call.See also clear_count_and_capacity , remove .
| |
is_empty is True after that call).
The internal capacity may also be reduced after this call.See also clear_count , remove .
| |
capacity .
The capacity will grow automatically when needed
(i.e. capacity is not a limit for the number of values stored).
Also note that the capacity value may not be always accurate
depending of the implementation (anyway, this capacity value
is at least equals to count ).
|
To provide iterating facilities: | |
See also upper , valid_index , item .
| |
See also lower , valid_index , item .
| |
See also lower , upper , valid_index .
| |
first item.See also last , item .
| |
last item.See also first , item .
| |
| |
See also item_map_in .
| |
See also key_map_in .
|
Comparaison. | |
See also is_equal_map .
| |
See also is_equal. | |
|
Agents based features: | |
See also for_all , exist.
| |
| |
| |
| |
| |
| |
| |
| |
See also do_all , exist.
| |
See also for_all , do_all .
|
Other features: | |
See also has , fast_has .
|
Creation. | |
|
|
Indexing: | |
See also lower , upper , item .
|
Iterate: | |
| |
| |
| |
| |
|
Inherit/Insert Detail |
.../base/collection/low_level/dictionary.li line #19
.../base/property/traversable.li line #28
Constructor Detail |
.../base/collection/low_level/dictionary.li line #645
Counting: |
.../base/collection/low_level/dictionary.li line #27
count
of stored elements.
Number of available indices.is_empty
, lower
, upper
.
.../base/collection/low_level/dictionary.li line #34
count
.
Basic access: |
.../base/collection/low_level/dictionary.li line #41
fast_has
, at
.
.../base/collection/low_level/dictionary.li line #53
fast_at
, reference_at
, has
.
.../base/collection/low_level/dictionary.li line #66
has
just followed by at
to get
the corresponding value.fast_reference_at
, at
, has
.
.../base/collection/low_level/dictionary.li line #86
has
, at
, fast_at
.
.../base/collection/low_level/dictionary.li line #99
at
, reference_at
, fast_reference_at
.
.../base/collection/low_level/dictionary.li line #112
reference_at
, but basic = is used for comparison.reference_at
, at
, has
.
Modification. |
.../base/collection/low_level/dictionary.li line #134
.../base/collection/low_level/dictionary.li line #153
.../base/collection/low_level/dictionary.li line #167
Looking and searching some value: |
.../base/collection/low_level/dictionary.li line #187
fast_occurrences
, fast_has
, has
.
.../base/collection/low_level/dictionary.li line #207
occurrences
, fast_has
, has
.
.../base/collection/low_level/dictionary.li line #226
fast_key_at
, at
.
.../base/collection/low_level/dictionary.li line #246
key_at
, at
.
Removing: |
.../base/collection/low_level/dictionary.li line #269
remove
procedure actually uses is_equal, you may
consider to use fast_remove
for expanded objects as well
while trying to get the very best performances.fast_remove
, clear_count
.
.../base/collection/low_level/dictionary.li line #286
remove
, but uses basic = for comparison.remove
, clear_count
.
.../base/collection/low_level/dictionary.li line #300
is_empty
is True after that call).
The internal capacity
is not changed by this call.clear_count_and_capacity
, remove
.
.../base/collection/low_level/dictionary.li line #313
is_empty
is True after that call).
The internal capacity
may also be reduced after this call.clear_count
, remove
.
.../base/collection/low_level/dictionary.li line #326
capacity
.
The capacity
will grow automatically when needed
(i.e. capacity
is not a limit for the number of values stored).
Also note that the capacity
value may not be always accurate
depending of the implementation (anyway, this capacity
value
is at least equals to count
).
To provide iterating facilities: |
.../base/collection/low_level/dictionary.li line #342
upper
, valid_index
, item
.
.../base/collection/low_level/dictionary.li line #344
lower
, valid_index
, item
.
.../base/collection/low_level/dictionary.li line #352
lower
, upper
, valid_index
.
.../base/collection/low_level/dictionary.li line #362
first
item.last
, item
.
.../base/collection/low_level/dictionary.li line #364
last
item.first
, item
.
.../base/collection/low_level/dictionary.li line #366
.../base/collection/low_level/dictionary.li line #379
item_map_in
.
.../base/collection/low_level/dictionary.li line #399
key_map_in
.
Comparaison. |
.../base/collection/low_level/dictionary.li line #423
is_equal_map
.
.../base/collection/low_level/dictionary.li line #455
.../base/collection/low_level/dictionary.li line #486
Agents based features: |
.../base/collection/low_level/dictionary.li line #503
for_all
, exist.
.../base/collection/low_level/dictionary.li line #520
.../base/collection/low_level/dictionary.li line #527
.../base/collection/low_level/dictionary.li line #534
.../base/collection/low_level/dictionary.li line #544
.../base/collection/low_level/dictionary.li line #554
.../base/collection/low_level/dictionary.li line #561
.../base/collection/low_level/dictionary.li line #571
.../base/collection/low_level/dictionary.li line #581
do_all
, exist.
.../base/collection/low_level/dictionary.li line #601
for_all
, do_all
.
Other features: |
.../base/collection/low_level/dictionary.li line #624
has
, fast_has
.
Creation. |
.../base/collection/low_level/dictionary.li line #653
.../base/collection/low_level/dictionary.li line #666
Indexing: |
.../base/property/traversable.li line #54
lower
, upper
, item
.
Iterate: |
.../base/property/traversable.li line #140
.../base/property/traversable.li line #142
.../base/property/traversable.li line #145
.../base/property/traversable.li line #148
.../base/property/traversable.li line #151