2008-09-22 Benjamin Kosnik <bkoz@redhat.com>
+ PR libstdc++/37391
+ * doc/html/ext/pb_ds/*.html: Fix external links.
+
+2008-09-22 Benjamin Kosnik <bkoz@redhat.com>
+
* doc/doxygen/user.cfg.in: Define _GLIBCXX_HAS_GTHREADS for mutex,
condition_variable, and thread output.
data structure.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<title>Examples</title>
<meta http-equiv="Content-Type" content=
"text/html; charset=us-ascii" />
+ <base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/">
</head>
+
<body>
<div id="page">
<h1>Associative-Container Examples</h1>
+
+
<h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
+ <li>
+ <a href= "basic_map.cc"><tt>basic_map.cc</tt></a>
Basic use of "maps".</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
+ <li><a href= "basic_set.cc"><tt>basic_set.cc</tt></a>
Basic use of "sets".</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/erase_if.cc"><tt>erase_if.cc</tt></a>
+ <li><a href= "erase_if.cc"><tt>erase_if.cc</tt></a>
Conditionally erasing values from a container object.</li>
</ol>
<h2><a name="generics" id="generics">Generics</a></h2>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
+ <li><a href= "assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
Using <a href=
- "assoc_container_traits.html"><tt>container_traits</tt></a> to query
+ "http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/assoc_container_traits.html"><tt>container_traits</tt></a> to query
about underlying data structure behavior.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
+ <li><a href= "hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
A non-compiling example showing wrong use of finding keys in
hash-based containers.</li>
</ol>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>
+ <li><a href= "hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>
Setting the initial size of a hash-based container
object.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
+ <li><a href= "hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
A non-compiling example showing how not to resize a
hash-based container object.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_resize.cc"><tt>hash_resize.cc</tt></a>
+ <li><a href= "hash_resize.cc"><tt>hash_resize.cc</tt></a>
Resizing the size of a hash-based container object.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>
+ <li><a href= "hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>
Showing an illegal resize of a hash-based container
object.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>
+ <li><a href= "hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>
Changing the load factors of a hash-based container
object.</li>
</ol>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_mod.cc"><tt>hash_mod.cc</tt></a>
+ <li><a href= "hash_mod.cc"><tt>hash_mod.cc</tt></a>
Using a modulo range-hashing function for the case of an
unknown skewed key distribution.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
+ <li><a href= "hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
Writing a range-hashing functor for the case of a known
skewed key distribution.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/store_hash.cc"><tt>store_hash.cc</tt></a>
+ <li><a href= "store_hash.cc"><tt>store_hash.cc</tt></a>
Storing the hash value along with each key.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
+ <li><a href= "ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
Writing a ranged-hash functor.</li>
</ol>
- <h2><a name="tree_like_based" id=
- "tree_like_based">Tree-Like Containers (Trees and
+ <h2><a name="tree_like_based" id= "tree_like_based">Tree-Like Containers (Trees and
Tries)</a></h2>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
+ <li><a href= "tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
Using trees for order statistics.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
+ <li><a href= "tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
Augmenting trees to support operations on line
intervals.</li>
</ol>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/tree_join.cc"><tt>tree_join.cc</tt></a>
+ <li><a href= "tree_join.cc"><tt>tree_join.cc</tt></a>
Joining two tree-based container objects.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/trie_split.cc"><tt>trie_split.cc</tt></a>
+ <li><a href= "trie_split.cc"><tt>trie_split.cc</tt></a>
Splitting a PATRICIA trie container object.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
+ <li><a href= "tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
Order statistics while joining two tree-based container
objects.</li>
</ol>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/trie_dna.cc"><tt>trie_dna.cc</tt></a>
+ <li><a href= "trie_dna.cc"><tt>trie_dna.cc</tt></a>
Using a PATRICIA trie for DNA strings.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
+ <li><a href= "trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
Using a PATRICIA trie for finding all entries whose key
matches a given prefix.</li>
</ol>
<h2><a name="mmaps" id="mmaps">"Multimaps" and
"Multisets".</a></h2>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
+ <li><a href= "basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
Basic use of "multimaps".</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
+ <li><a href= "basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
Basic use of "multisets".</li>
</ol>
</div>
<title>Associative-Container Regression Tests</title>
<meta http-equiv="Content-Type" content=
"text/html; charset=us-ascii" />
+<base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/regression/">
</head>
<body>
<ol>
<li><a href=
- "../../../../testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc"><tt>hash_no_data_map_rand.cc</tt></a>
+ "hash_no_data_map_rand.cc"><tt>hash_no_data_map_rand.cc</tt></a>
checks all hash-based "set" types.</li>
<li><a href=
- "../../../../testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc"><tt>list_update_no_data_map_rand.cc</tt></a>
+ "list_update_no_data_map_rand.cc"><tt>list_update_no_data_map_rand.cc</tt></a>
checks all list-based "set" types.</li>
<li><a href=
- "../../../../testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc"><tt>tree_no_data_map_rand.cc</tt></a>
+ "tree_no_data_map_rand.cc"><tt>tree_no_data_map_rand.cc</tt></a>
checks all tree-based "set" types.</li>
<li><a href=
- "../../../../testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc"><tt>trie_no_data_map_rand.cc</tt></a>
+ "trie_no_data_map_rand.cc"><tt>trie_no_data_map_rand.cc</tt></a>
checks all PATRICIA-trie-based "set" types.</li>
</ol>
<p>The following check all "map" types:</p>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/regression/hash_data_map_rand.cc"><tt>hash_data_map_rand.cc</tt></a>
+ <li><a href= "hash_data_map_rand.cc"><tt>hash_data_map_rand.cc</tt></a>
checks all hash-based "map" types.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc"><tt>list_update_data_map_rand.cc</tt></a>
+ <li><a href= "list_update_data_map_rand.cc"><tt>list_update_data_map_rand.cc</tt></a>
checks all list-based "map" types.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/regression/tree_data_map_rand.cc"><tt>tree_data_map_rand.cc</tt></a>
+ <li><a href= "tree_data_map_rand.cc"><tt>tree_data_map_rand.cc</tt></a>
checks all tree-based "map" types.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/regression/trie_data_map_rand.cc"><tt>trie_data_map_rand.cc</tt></a>
+ <li><a href= "trie_data_map_rand.cc"><tt>trie_data_map_rand.cc</tt></a>
checks all PATRICIA-trie-based "map" types.</li>
</ol>
</div>
<p>Basic associative-container data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>An abstract basic hash-based associative container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Basic hash data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
is valid as long as the container is not modified.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
</div>
</body>
</html>
<p>An abstract basic tree-like-based associative container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Basic tree-like data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>Binary-heap (array-based) data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>Binomial-heap data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
factor.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Collision-chaining hash data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>An abstract basic associative container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Basic data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
</div>
</body>
</html>
list based on the counter algorithm.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>A mask range-hashing class (uses a bit-mask).</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>A mod range-hashing class (uses the modulo function).</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Base class for associative-container exceptions.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>General-probing hash data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
sequence (typically powers of 2)</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
load_max.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
nearly-exponential sequence of primes.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
Constants</a></h2>
<p>This test inserts a number of uniform i.i.d. integer keys
into a container, then erases all keys except one. It measures
the final size of the container.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc"><tt>hash_random_int_erase_mem_usage.cc</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc"><tt>hash_random_int_erase_mem_usage.cc</tt></a>
2000 2000 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks how containers adjust internally as their
using <tt>find</tt>. It measures the average time
for<tt>find</tt> as a function of the number of values
inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_find_timing.cc"><tt>random_int_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc"><tt>random_int_find_timing_test</tt></a>
200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
using <tt><b>operator</b>[]</tt>. It measures the average time
for <tt><b>operator</b>[]</tt> as a function of the number of
values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc"><tt>hash_random_int_subscript_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc"><tt>hash_random_int_subscript_find_timing_test</tt></a>
200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
<tt><b>operator</b>[]</tt>. It measures the average time for
<tt><b>operator</b>[]</tt> as a function of the number of
values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc"><tt>hash_random_int_subscript_insert_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc"><tt>hash_random_int_subscript_insert_timing_test</tt></a>
200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test primarily checks the effect of different underlying
trigger policies.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
a container, then performs a series of finds using
<tt>find</tt> . It measures the average time for <tt>find</tt>
as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different range-hashing
time for <tt>find</tt> as a function of the number of values in
the containers. The keys are generated as follows. First, a
uniform integer is created; it is then shifted left 8 bits.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc"><tt>hash_zlob_random_int_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc"><tt>hash_zlob_random_int_find_timing_test</tt></a>
200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different range-hashing
more natural case in which mod-based range hashing is better.
In our opnion, real-life key distributions are handled better
with an appropriate hash function and a mask-based
- range-hashing function. (<a href="../../../../testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
+ range-hashing function. (<a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
shows an example of handling this a-priori known skewed
distribution with a mask-based range-hashing function). If hash
performance is bad, a <i>Χ<sup>2</sup></i> test can be used
even though free positions are available.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
overlaps.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>A probe sequence policy using fixed increments.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>A list-update based associative container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>List-update data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
associative container mapping each user to an associative
container which maps each application id to a start time (see
<a href=
- "../../../../testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>);
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>);
in the second example, one would use an associative container
mapping each <tt><b>int</b></tt> to some size-type indicating
the number of times it logically occurs (see <a href=
- "../../../../testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>).</p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>).</p>
<p><a href=
"assoc_performance_tests.html#multimaps">Associative-Container
the front of the list.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
finds the secondary key from a container obtained from finding
a primary key. For the native multimaps, it searches a range
obtained using <tt>std::equal_range</tt> on a primary key.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc"><tt>multimap_text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc"><tt>multimap_text_find_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the find-time scalability of different
finds the secondary key from a container obtained from finding
a primary key. For the native multimaps, it searches a range
obtained using <tt>std::equal_range</tt> on a primary key.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc"><tt>multimap_text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc"><tt>multimap_text_find_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the find-time scalability of different
Containers::Alternative to Multiple Equivalent Keys</a>). There
are 100 distinct primary keys. The test measures the memory use
as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
thirty_years_among_the_dead_preproc.txt 100 200 2100 100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the memory scalability of different
to primary keys ranges to about 20.</p>
<p>The test measures the memory use as a function of the number
of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the memory scalability of different
to primary keys ranges to about 20.</p>
<p>The test measures the memory use as a function of the number
of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
thirty_years_among_the_dead_preproc.txt 400 1 6 6)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the insert-time scalability of different
container. For the native multimaps, it obtains a range using
<tt>std::equal_range</tt>, and inserts a value only if it was
not contained already.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc"><tt>multimap_text_insert_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc"><tt>multimap_text_insert_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the insert-time scalability of different
Containers::Hash Policies</a>.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
</div>
</body>
</html>
container does not actually need metadata.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
</div>
</body>
</html>
a "set"</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
</div>
</body>
</html>
Policy Classes</a> explains the concept of a null policy.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
</div>
</body>
</html>
Policy Classes</a> explains the concept of a null policy.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
Policy Classes</a> explains the concept of a null policy.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Ordered-vector tree data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>Pairing-heap data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>PATRICIA trie data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
regardless of modifications to the container object.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
data structure.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<title>Examples</title>
<meta http-equiv="Content-Type" content=
"text/html; charset=us-ascii" />
+ <base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/">
</head>
<body>
<h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
+ <li><a href= "basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
Basic use of priority queues.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
+ <li><a href= "priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
Splitting and joining priority queues.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
+ <li><a href= "priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
Conditionally erasing values from a container object.</li>
</ol>
<h2><a name="generics" id="generics">Generics</a></h2>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a>
- Using <a href="pq_container_traits.html"><tt>container_traits</tt></a>
+ <li><a href= "priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a>
+ Using <a href="http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/assoc_container_traits.html"><tt>container_traits</tt></a>
to query about underlying data structure behavior.</li>
</ol>
<ol>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
+ <li><a href= "priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
Cross referencing an associative container and a priority
queue.</li>
- <li><a href=
- "../../../../testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
+ <li><a href= "priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
Cross referencing a vector and a priority queue using a
<u>very</u> simple version of Dijkstra's shortest path
algorithm.</li>
<h2><a name="pq_tests" id="pq_tests">Tests</a></h2>
<p><a href=
- "../../../../testsuite/ext/pb_ds/regression/priority_queue_rand.cc"><tt>priority_queue_rand.cc</tt></a>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/regression/priority_queue_rand.cc"><tt>priority_queue_rand.cc</tt></a>
checks all priority queue types.</p>
</div>
</body>
<p>Basic priority queue.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/priority_queue.hpp"><tt>priority_queue.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/priority_queue.hpp"><tt>priority_queue.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
using <tt>pop</tt> . It measures the average time for
<tt>push</tt> and <tt>pop</tt> as a function of the number of
values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc">
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc">
<tt>priority_queue_random_int_push_pop_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
into a container using <tt>push</tt> . It measures the average
time for <tt>push</tt> as a function of the number of
values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc"><tt>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc"><tt>
priority_queue_random_intpush_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>Basic priority-queue data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
STL's priority queues, it successively pops values from one
container and pushes them into the other. The test measures the
average time as a function of the number of values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc"><tt>priority_queue_text_join_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc"><tt>priority_queue_text_join_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
modified, then pushes values back in. It measures the average
time for <tt>modify</tt> as a function of the number of
values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_down_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_down_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100 f)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The main purpose of this test is to contrast <a href="priority_queue_text_modify_up_timing_test.html">Priority Queue
modified, then pushes values back in. It measures the average
time for <tt>modify</tt> as a function of the number of
values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_up_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_up_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100 t)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
a container, then pops them until only one is left in the
container. It measures the memory use as a function of the
number of values pushed to the container.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc"><tt>priority_queue_text_pop_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc"><tt>priority_queue_text_pop_mem_usage_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
a container using <tt>push</tt> , then removes them using
<tt>pop</tt> . It measures the average time for <tt>push</tt>
as a function of the number of values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc"><tt>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc"><tt>
priority_queue_text_push_pop_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
a container using <tt>push</tt> . It measures the average time
for <tt>push</tt> as a function of the number of values
pushed.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc"><tt>priority_queue_text_push_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc"><tt>priority_queue_text_push_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
<p>A probe sequence policy using square increments.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
modifications to the container object.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>Red-black tree data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>Redundant-counter binomial-heap data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
adequate size for an external resize.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp"><tt>sample_probe_fn.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp"><tt>sample_probe_fn.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
Constants</a></h2>
functor needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp"><tt>sample_range_hashing.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp"><tt>sample_range_hashing.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
Constants</a></h2>
functor needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp"><tt>sample_ranged_hash_fn.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp"><tt>sample_ranged_hash_fn.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
Constants</a></h2>
functor needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp"><tt>sample_ranged_probe_fn.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp"><tt>sample_ranged_probe_fn.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
Constants</a></h2>
needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp"><tt>sample_resize_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp"><tt>sample_resize_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
Constants</a></h2>
needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp"><tt>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp"><tt>
sample_resize_trigger.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp"><tt>sample_size_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp"><tt>sample_size_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
Constants</a></h2>
functor needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp"><tt>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp"><tt>
sample_tree_node_update.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
traits class needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp">
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp">
<tt>sample_trie_e_access_traits.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and
functor needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp"><tt>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp"><tt>
sample_trie_node_update.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
functor needs to support.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp"><tt>sample_update_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp"><tt>sample_update_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Methods</a></h2>
<p>Splay tree data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>Element access traits for string types.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Thin heap data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
<p>A concrete basic tree-based associative container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<tt>std::make_pair(29,42)</tt> (useful in geometric
applications or distributed file systems with leases, for
example). (See <a href=
- "../../../../testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
and <a href=
- "../../../../testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
for examples.) It should be noted that an <tt>std::set</tt> can
only solve these types of problems with linear complexity.</p>
<p>Functor updating ranks of entrees.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
; otherwise, it uses the <tt>find</tt> method and
<tt>std::distance</tt> .) It measures the average time for such
queries as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc"><tt>tree_order_statistics_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc"><tt>tree_order_statistics_timing_test</tt></a>
200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the performance difference of policies based
a container, then performs a series of finds using
<tt>find</tt>. It measures the average time for <tt>find</tt>
as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
<tt>insert</tt> methods.) It measures the time for splitting
and joining the containers as a function of the number of
values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_split_join_timing.cc"><tt>tree_split_join_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc"><tt>tree_split_join_timing_test</tt></a>
200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the performance difference of <tt>join</tt>
<p>Basic tree data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
a container, then performs a series of finds using
<tt>find</tt>. It measures the average time for <tt>find</tt>
as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
a container using <tt>insert</tt> . It measures the average
time for <tt>insert</tt> as a function of the number of values
inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc"><tt>tree_text_insert_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc"><tt>tree_text_insert_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
<tt>find</tt> s on the same key before moving on to the next
key. It measures the average time for <tt>find</tt> as a
function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc"><tt>tree_text_lor_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc"><tt>tree_text_lor_find_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying
<p>A concrete basic trie-based associative container.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
"trie_prefix_search_node_update.html"><tt>trie_prefix_search_node_update</tt></a>
supports searching for ranges that match a given prefix. See
<a href=
- "../../../../testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>.</li>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>.</li>
<li><a href=
"null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
<p>Functor updating ranks of entrees.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
range of values that match a certain prefix.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2>
<p>Basic trie data structure tag.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
<h2><a name="link1" id="link1">Base Classes</a></h2>
iterators has none of the STL's movement abilities.</p>
<p>Defined in: <a href=
- "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
</div>
</body>
</html>
customary. <a href=
"assoc_examples.html#basic_usage">Associative-Container
Examples::Basic use</a>, and especially <a href=
- "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>,
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>,
show examples of this.</p>
<p>This isn't to say that things are exactly as one would expect,
<p>Each type or method is defined in the most-common ancestor
in which it makes sense:
<a href=
- "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
shows an example of most of the associative-container
types.</p>
<p>This is described further in <a href=
"ds_gen.html">Design::Data-Structure Genericity</a>; <a href=
- "../../../../testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
shows an example of querying containers' attributes.</p>
<h3><a name="assoc_find_range" id="assoc_find_range">Point-Type
"null_mapped_type.html">null_mapped_type</a> object. Also,
, the container's <tt>value_type</tt> is essentially
its <tt>key_type</tt> - just as with the STL's sets. For a simple example, see <a href=
- "../../../../testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
.</p>
<p>The STL's multimaps and multisets allow, respectively,
Traits::Data Structure Tags::Priority-Queues</a> lists the
possible types, <a href="pq_design.html">Priority-Queue
Design</a> explains this further, and <a href=
- "../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
+ "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
shows an example.</p>
<p>Note that as opposed to the STL's priority queue, <a href=
projects / platform / upstream / linaro-gcc.git / commitdiff