priority-queues container), there is a possible need for
different types of iterators for self-organizing containers:
the iterator concept seems overloaded to mean two different
- things (in some cases). <remark> XXX
+ things (in some cases). <!-- <remark> XXX
"ds_gen.html#find_range">Design::Associative
Containers::Data-Structure Genericity::Point-Type and Range-Type
- Methods</remark>.
+ Methods</remark>. -->
</para>
<section xml:id="associative.iterators.using">
<para>Α<subscript>min</subscript> ≤ (number of
stored elements) / (hash-table size) ≤
- Α<subscript>max</subscript><remark>load factor min max</remark></para>
+ Α<subscript>max</subscript>
+ <!-- <remark>load factor min max</remark> -->
+ </para>
<para>Collision-check policies work in the opposite direction of
load-check policies. They focus on keeping the number of
<para>This test inserts a number of values with keys from an arbitrary
- text ([ wickland96thirty ]) into a container
+ text ([wickland96thirty]) into a container
using <function>insert</function> . It measures the average time
for <function>insert</function> as a function of the number of
values inserted.</para>
<para>This test inserts a number of values with keys from an
- arbitrary text ([ wickland96thirty ]) into
+ arbitrary text ([wickland96thirty]) into
a container, then performs a series of finds using
<function>find</function>. It is different than Tree-Based and
Trie-Based Text <function>find</function> Find Timing Test in the
<para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text
- [wickland96thirty], and
+ ([wickland96thirty]), and
the second is a uniform i.i.d.integer. The container is a
"multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary
<para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text
- [wickland96thirty], and
+ ([wickland96thirty]), and
the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary
<para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text
- [wickland96thirty], and
+ ([wickland96thirty]), and
the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary
<para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text
- [wickland96thirty], and
+ ([wickland96thirty]), and
the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary
</title></info>
<para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text
- [wickland96thirty], and
+ ([wickland96thirty]), and
the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary
</title></info>
<para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text
- [wickland96thirty], and
+ ([wickland96thirty]), and
the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary
projects / gcc.git / commitdiff