Skip to content

R
riscv-gcc-1
Commit a56feea8 by Benjamin Kosnik Committed by Benjamin Kosnik
Options

re PR libstdc++/37391 (examples not accessible online (non existing URLs)) 

2008-09-22  Benjamin Kosnik  <bkoz@redhat.com>

	PR libstdc++/37391
	* doc/html/ext/pb_ds/*.html: Fix external links.

From-SVN: r140564
parent 61debb78
Showing with 151 additions and 173 deletions
libstdc++-v3/ChangeLog
2008-09-22 Benjamin Kosnik <bkoz@redhat.com> 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, * doc/doxygen/user.cfg.in: Define _GLIBCXX_HAS_GTHREADS for mutex,
condition_variable, and thread output. condition_variable, and thread output.
......
libstdc++-v3/doc/html/ext/pb_ds/assoc_container_traits.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
data structure.</p> data structure.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/assoc_examples.html
...@@ -9,39 +9,39 @@ ...@@ -9,39 +9,39 @@
<title>Examples</title> <title>Examples</title>
<meta http-equiv="Content-Type" content= <meta http-equiv="Content-Type" content=
"text/html; charset=us-ascii" /> "text/html; charset=us-ascii" />
<base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/">
</head> </head>
<body> <body>
<div id="page"> <div id="page">
<h1>Associative-Container Examples</h1> <h1>Associative-Container Examples</h1>
<h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2> <h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
<ol> <ol>
<li><a href= <li>
"../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a> <a href= "basic_map.cc"><tt>basic_map.cc</tt></a>
Basic use of "maps".</li> Basic use of "maps".</li>
<li><a href= <li><a href= "basic_set.cc"><tt>basic_set.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
Basic use of "sets".</li> Basic use of "sets".</li>
<li><a href= <li><a href= "erase_if.cc"><tt>erase_if.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/erase_if.cc"><tt>erase_if.cc</tt></a>
Conditionally erasing values from a container object.</li> Conditionally erasing values from a container object.</li>
</ol> </ol>
<h2><a name="generics" id="generics">Generics</a></h2> <h2><a name="generics" id="generics">Generics</a></h2>
<ol> <ol>
<li><a href= <li><a href= "assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
Using <a href= 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> about underlying data structure behavior.</li>
<li><a href= <li><a href= "hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
A non-compiling example showing wrong use of finding keys in A non-compiling example showing wrong use of finding keys in
hash-based containers.</li> hash-based containers.</li>
</ol> </ol>
...@@ -55,27 +55,22 @@ ...@@ -55,27 +55,22 @@
<ol> <ol>
<li><a href= <li><a href= "hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>
Setting the initial size of a hash-based container Setting the initial size of a hash-based container
object.</li> object.</li>
<li><a href= <li><a href= "hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
A non-compiling example showing how not to resize a A non-compiling example showing how not to resize a
hash-based container object.</li> hash-based container object.</li>
<li><a href= <li><a href= "hash_resize.cc"><tt>hash_resize.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_resize.cc"><tt>hash_resize.cc</tt></a>
Resizing the size of a hash-based container object.</li> Resizing the size of a hash-based container object.</li>
<li><a href= <li><a href= "hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>
Showing an illegal resize of a hash-based container Showing an illegal resize of a hash-based container
object.</li> object.</li>
<li><a href= <li><a href= "hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>
Changing the load factors of a hash-based container Changing the load factors of a hash-based container
object.</li> object.</li>
</ol> </ol>
...@@ -85,27 +80,22 @@ ...@@ -85,27 +80,22 @@
<ol> <ol>
<li><a href= <li><a href= "hash_mod.cc"><tt>hash_mod.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_mod.cc"><tt>hash_mod.cc</tt></a>
Using a modulo range-hashing function for the case of an Using a modulo range-hashing function for the case of an
unknown skewed key distribution.</li> unknown skewed key distribution.</li>
<li><a href= <li><a href= "hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
Writing a range-hashing functor for the case of a known Writing a range-hashing functor for the case of a known
skewed key distribution.</li> skewed key distribution.</li>
<li><a href= <li><a href= "store_hash.cc"><tt>store_hash.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/store_hash.cc"><tt>store_hash.cc</tt></a>
Storing the hash value along with each key.</li> Storing the hash value along with each key.</li>
<li><a href= <li><a href= "ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
Writing a ranged-hash functor.</li> Writing a ranged-hash functor.</li>
</ol> </ol>
<h2><a name="tree_like_based" id= <h2><a name="tree_like_based" id= "tree_like_based">Tree-Like Containers (Trees and
"tree_like_based">Tree-Like Containers (Trees and
Tries)</a></h2> Tries)</a></h2>
...@@ -114,12 +104,10 @@ ...@@ -114,12 +104,10 @@
<ol> <ol>
<li><a href= <li><a href= "tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
Using trees for order statistics.</li> Using trees for order statistics.</li>
<li><a href= <li><a href= "tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
Augmenting trees to support operations on line Augmenting trees to support operations on line
intervals.</li> intervals.</li>
</ol> </ol>
...@@ -129,16 +117,13 @@ ...@@ -129,16 +117,13 @@
<ol> <ol>
<li><a href= <li><a href= "tree_join.cc"><tt>tree_join.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/tree_join.cc"><tt>tree_join.cc</tt></a>
Joining two tree-based container objects.</li> Joining two tree-based container objects.</li>
<li><a href= <li><a href= "trie_split.cc"><tt>trie_split.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/trie_split.cc"><tt>trie_split.cc</tt></a>
Splitting a PATRICIA trie container object.</li> Splitting a PATRICIA trie container object.</li>
<li><a href= <li><a href= "tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
Order statistics while joining two tree-based container Order statistics while joining two tree-based container
objects.</li> objects.</li>
</ol> </ol>
...@@ -148,12 +133,10 @@ ...@@ -148,12 +133,10 @@
<ol> <ol>
<li><a href= <li><a href= "trie_dna.cc"><tt>trie_dna.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/trie_dna.cc"><tt>trie_dna.cc</tt></a>
Using a PATRICIA trie for DNA strings.</li> Using a PATRICIA trie for DNA strings.</li>
<li><a href= <li><a href= "trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
Using a PATRICIA trie for finding all entries whose key Using a PATRICIA trie for finding all entries whose key
matches a given prefix.</li> matches a given prefix.</li>
</ol> </ol>
...@@ -161,12 +144,10 @@ ...@@ -161,12 +144,10 @@
<h2><a name="mmaps" id="mmaps">"Multimaps" and <h2><a name="mmaps" id="mmaps">"Multimaps" and
"Multisets".</a></h2> "Multisets".</a></h2>
<ol> <ol>
<li><a href= <li><a href= "basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
Basic use of "multimaps".</li> Basic use of "multimaps".</li>
<li><a href= <li><a href= "basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
Basic use of "multisets".</li> Basic use of "multisets".</li>
</ol> </ol>
</div> </div>
......
libstdc++-v3/doc/html/ext/pb_ds/assoc_regression_tests.html
...@@ -9,6 +9,7 @@ ...@@ -9,6 +9,7 @@
<title>Associative-Container Regression Tests</title> <title>Associative-Container Regression Tests</title>
<meta http-equiv="Content-Type" content= <meta http-equiv="Content-Type" content=
"text/html; charset=us-ascii" /> "text/html; charset=us-ascii" />
<base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/regression/">
</head> </head>
<body> <body>
...@@ -53,19 +54,19 @@ ...@@ -53,19 +54,19 @@
<ol> <ol>
<li><a href= <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> checks all hash-based "set" types.</li>
<li><a href= <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> checks all list-based "set" types.</li>
<li><a href= <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> checks all tree-based "set" types.</li>
<li><a href= <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> checks all PATRICIA-trie-based "set" types.</li>
</ol> </ol>
...@@ -75,20 +76,16 @@ ...@@ -75,20 +76,16 @@
<p>The following check all "map" types:</p> <p>The following check all "map" types:</p>
<ol> <ol>
<li><a href= <li><a href= "hash_data_map_rand.cc"><tt>hash_data_map_rand.cc</tt></a>
"../../../../testsuite/ext/pb_ds/regression/hash_data_map_rand.cc"><tt>hash_data_map_rand.cc</tt></a>
checks all hash-based "map" types.</li> checks all hash-based "map" types.</li>
<li><a href= <li><a href= "list_update_data_map_rand.cc"><tt>list_update_data_map_rand.cc</tt></a>
"../../../../testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc"><tt>list_update_data_map_rand.cc</tt></a>
checks all list-based "map" types.</li> checks all list-based "map" types.</li>
<li><a href= <li><a href= "tree_data_map_rand.cc"><tt>tree_data_map_rand.cc</tt></a>
"../../../../testsuite/ext/pb_ds/regression/tree_data_map_rand.cc"><tt>tree_data_map_rand.cc</tt></a>
checks all tree-based "map" types.</li> checks all tree-based "map" types.</li>
<li><a href= <li><a href= "trie_data_map_rand.cc"><tt>trie_data_map_rand.cc</tt></a>
"../../../../testsuite/ext/pb_ds/regression/trie_data_map_rand.cc"><tt>trie_data_map_rand.cc</tt></a>
checks all PATRICIA-trie-based "map" types.</li> checks all PATRICIA-trie-based "map" types.</li>
</ol> </ol>
</div> </div>
......
libstdc++-v3/doc/html/ext/pb_ds/associative_container_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Basic associative-container data structure tag.</p> <p>Basic associative-container data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/basic_hash_table.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>An abstract basic hash-based associative container.</p> <p>An abstract basic hash-based associative container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/basic_hash_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Basic hash data structure tag.</p> <p>Basic hash data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/basic_invalidation_guarantee.html
...@@ -20,7 +20,7 @@ ...@@ -20,7 +20,7 @@
is valid as long as the container is not modified.</p> is valid as long as the container is not modified.</p>
<p>Defined in: <a href= <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> </div>
</body> </body>
</html> </html>
libstdc++-v3/doc/html/ext/pb_ds/basic_tree.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>An abstract basic tree-like-based associative container.</p> <p>An abstract basic tree-like-based associative container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/basic_tree_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Basic tree-like data structure tag.</p> <p>Basic tree-like data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/binary_heap_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Binary-heap (array-based) data structure tag.</p> <p>Binary-heap (array-based) data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/binomial_heap_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Binomial-heap data structure tag.</p> <p>Binomial-heap data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/cc_hash_max_collision_check_resize_trigger.html
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
factor.</p> factor.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/cc_hash_table.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
container.</p> container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/cc_hash_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Collision-chaining hash data structure tag.</p> <p>Collision-chaining hash data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/container_base.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>An abstract basic associative container.</p> <p>An abstract basic associative container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/container_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Basic data structure tag.</p> <p>Basic data structure tag.</p>
<p>Defined in: <a href= <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> </div>
</body> </body>
</html> </html>
libstdc++-v3/doc/html/ext/pb_ds/counter_lu_policy.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
list based on the counter algorithm.</p> list based on the counter algorithm.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/direct_mask_range_hashing.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>A mask range-hashing class (uses a bit-mask).</p> <p>A mask range-hashing class (uses a bit-mask).</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/direct_mod_range_hashing.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>A mod range-hashing class (uses the modulo function).</p> <p>A mod range-hashing class (uses the modulo function).</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/exceptions.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Base class for associative-container exceptions.</p> <p>Base class for associative-container exceptions.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/gp_hash_table.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
container.</p> container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/gp_hash_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>General-probing hash data structure tag.</p> <p>General-probing hash data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/hash_exponential_size_policy.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
sequence (typically powers of 2)</p> sequence (typically powers of 2)</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/hash_load_check_resize_trigger.html
...@@ -20,7 +20,7 @@ ...@@ -20,7 +20,7 @@
load_max.</p> load_max.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/hash_prime_size_policy.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
nearly-exponential sequence of primes.</p> nearly-exponential sequence of primes.</p>
<p>Defined in: <a href= <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 <h2><a name="link1" id="link1">Public Types and
Constants</a></h2> Constants</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_erase_mem_usage_test.html
...@@ -14,7 +14,7 @@ ...@@ -14,7 +14,7 @@
<p>This test inserts a number of uniform i.i.d. integer keys <p>This test inserts a number of uniform i.i.d. integer keys
into a container, then erases all keys except one. It measures into a container, then erases all keys except one. It measures
the final size of the container.</p> 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> 2000 2000 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks how containers adjust internally as their <p>The test checks how containers adjust internally as their
......
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_find_find_timing_test.html
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
using <tt>find</tt>. It measures the average time using <tt>find</tt>. It measures the average time
for<tt>find</tt> as a function of the number of values for<tt>find</tt> as a function of the number of values
inserted.</p> 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> 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_subscript_find_timing_test.html
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
using <tt><b>operator</b>[]</tt>. It measures the average time using <tt><b>operator</b>[]</tt>. It measures the average time
for <tt><b>operator</b>[]</tt> as a function of the number of for <tt><b>operator</b>[]</tt> as a function of the number of
values inserted.</p> 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> 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_subscript_insert_timing_test.html
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
<tt><b>operator</b>[]</tt>. It measures the average time for <tt><b>operator</b>[]</tt>. It measures the average time for
<tt><b>operator</b>[]</tt> as a function of the number of <tt><b>operator</b>[]</tt> as a function of the number of
values inserted.</p> 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> 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test primarily checks the effect of different underlying <p>The test primarily checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/hash_standard_resize_policy.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
trigger policies.</p> trigger policies.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/hash_text_find_find_timing_test.html
...@@ -16,7 +16,7 @@ ...@@ -16,7 +16,7 @@
a container, then performs a series of finds using a container, then performs a series of finds using
<tt>find</tt> . It measures the average time for <tt>find</tt> <tt>find</tt> . It measures the average time for <tt>find</tt>
as a function of the number of values inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different range-hashing <p>The test checks the effect of different range-hashing
......
libstdc++-v3/doc/html/ext/pb_ds/hash_zlob_random_int_find_find_timing_test.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
time for <tt>find</tt> as a function of the number of values in time for <tt>find</tt> as a function of the number of values in
the containers. The keys are generated as follows. First, a the containers. The keys are generated as follows. First, a
uniform integer is created; it is then shifted left 8 bits.</p> 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> 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different range-hashing <p>The test checks the effect of different range-hashing
...@@ -145,7 +145,7 @@ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_ ...@@ -145,7 +145,7 @@ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_
more natural case in which mod-based range hashing is better. more natural case in which mod-based range hashing is better.
In our opnion, real-life key distributions are handled better In our opnion, real-life key distributions are handled better
with an appropriate hash function and a mask-based 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 shows an example of handling this a-priori known skewed
distribution with a mask-based range-hashing function). If hash distribution with a mask-based range-hashing function). If hash
performance is bad, a <i>&Chi;<sup>2</sup></i> test can be used performance is bad, a <i>&Chi;<sup>2</sup></i> test can be used
......
libstdc++-v3/doc/html/ext/pb_ds/insert_error.html
...@@ -24,7 +24,7 @@ allocator's exception will be thrown).</p> ...@@ -24,7 +24,7 @@ allocator's exception will be thrown).</p>
even though free positions are available.</p> even though free positions are available.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/join_error.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
overlaps.</p> overlaps.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/linear_probe_fn.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>A probe sequence policy using fixed increments.</p> <p>A probe sequence policy using fixed increments.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/list_update.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>A list-update based associative container.</p> <p>A list-update based associative container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/list_update_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>List-update data structure tag.</p> <p>List-update data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/motivation.html
...@@ -753,11 +753,11 @@ belonging to a specific user are stored consecutively. ...@@ -753,11 +753,11 @@ belonging to a specific user are stored consecutively.
associative container mapping each user to an associative associative container mapping each user to an associative
container which maps each application id to a start time (see container which maps each application id to a start time (see
<a href= <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 in the second example, one would use an associative container
mapping each <tt><b>int</b></tt> to some size-type indicating mapping each <tt><b>int</b></tt> to some size-type indicating
the number of times it logically occurs (see <a href= 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= <p><a href=
"assoc_performance_tests.html#multimaps">Associative-Container "assoc_performance_tests.html#multimaps">Associative-Container
......
libstdc++-v3/doc/html/ext/pb_ds/move_to_front_lu_policy.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
the front of the list.</p> the front of the list.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_find_timing_test_large.html
...@@ -28,7 +28,7 @@ ...@@ -28,7 +28,7 @@
finds the secondary key from a container obtained from finding finds the secondary key from a container obtained from finding
a primary key. For the native multimaps, it searches a range a primary key. For the native multimaps, it searches a range
obtained using <tt>std::equal_range</tt> on a primary key.</p> 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> thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the find-time scalability of different <p>The test checks the find-time scalability of different
......
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_find_timing_test_small.html
...@@ -28,7 +28,7 @@ ...@@ -28,7 +28,7 @@
finds the secondary key from a container obtained from finding finds the secondary key from a container obtained from finding
a primary key. For the native multimaps, it searches a range a primary key. For the native multimaps, it searches a range
obtained using <tt>std::equal_range</tt> on a primary key.</p> 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> thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the find-time scalability of different <p>The test checks the find-time scalability of different
......
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large.html
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
Containers::Alternative to Multiple Equivalent Keys</a>). There Containers::Alternative to Multiple Equivalent Keys</a>). There
are 100 distinct primary keys. The test measures the memory use are 100 distinct primary keys. The test measures the memory use
as a function of the number of values inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 100 200 2100 100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the memory scalability of different <p>The test checks the memory scalability of different
......
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small.html
...@@ -25,7 +25,7 @@ ...@@ -25,7 +25,7 @@
to primary keys ranges to about 20.</p> to primary keys ranges to about 20.</p>
<p>The test measures the memory use as a function of the number <p>The test measures the memory use as a function of the number
of values inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the memory scalability of different <p>The test checks the memory scalability of different
......
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_timing_test_large.html
...@@ -25,7 +25,7 @@ ...@@ -25,7 +25,7 @@
to primary keys ranges to about 20.</p> to primary keys ranges to about 20.</p>
<p>The test measures the memory use as a function of the number <p>The test measures the memory use as a function of the number
of values inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 400 1 6 6)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the insert-time scalability of different <p>The test checks the insert-time scalability of different
......
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_timing_test_small.html
...@@ -30,7 +30,7 @@ ...@@ -30,7 +30,7 @@
container. For the native multimaps, it obtains a range using container. For the native multimaps, it obtains a range using
<tt>std::equal_range</tt>, and inserts a value only if it was <tt>std::equal_range</tt>, and inserts a value only if it was
not contained already.</p> 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> thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the insert-time scalability of different <p>The test checks the insert-time scalability of different
......
libstdc++-v3/doc/html/ext/pb_ds/null_hash_fn.html
...@@ -26,7 +26,7 @@ ...@@ -26,7 +26,7 @@
Containers::Hash Policies</a>.</p> Containers::Hash Policies</a>.</p>
<p>Defined in: <a href= <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> </div>
</body> </body>
</html> </html>
libstdc++-v3/doc/html/ext/pb_ds/null_lu_metadata.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
container does not actually need metadata.</p> container does not actually need metadata.</p>
<p>Defined in: <a href= <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> </div>
</body> </body>
</html> </html>
libstdc++-v3/doc/html/ext/pb_ds/null_mapped_type.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
a "set"</p> a "set"</p>
<p>Defined in: <a href= <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> </div>
</body> </body>
</html> </html>
libstdc++-v3/doc/html/ext/pb_ds/null_probe_fn.html
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
Policy Classes</a> explains the concept of a null policy.</p> Policy Classes</a> explains the concept of a null policy.</p>
<p>Defined in: <a href= <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> </div>
</body> </body>
</html> </html>
libstdc++-v3/doc/html/ext/pb_ds/null_tree_node_update.html
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
Policy Classes</a> explains the concept of a null policy.</p> Policy Classes</a> explains the concept of a null policy.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/null_trie_node_update.html
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
Policy Classes</a> explains the concept of a null policy.</p> Policy Classes</a> explains the concept of a null policy.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/ov_tree_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Ordered-vector tree data structure tag.</p> <p>Ordered-vector tree data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/pairing_heap_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Pairing-heap data structure tag.</p> <p>Pairing-heap data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/pat_trie_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>PATRICIA trie data structure tag.</p> <p>PATRICIA trie data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/point_invalidation_guarantee.html
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
regardless of modifications to the container object.</p> regardless of modifications to the container object.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/pq_container_traits.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
data structure.</p> data structure.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/pq_examples.html
...@@ -9,6 +9,7 @@ ...@@ -9,6 +9,7 @@
<title>Examples</title> <title>Examples</title>
<meta http-equiv="Content-Type" content= <meta http-equiv="Content-Type" content=
"text/html; charset=us-ascii" /> "text/html; charset=us-ascii" />
<base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/">
</head> </head>
<body> <body>
...@@ -18,25 +19,21 @@ ...@@ -18,25 +19,21 @@
<h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2> <h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
<ol> <ol>
<li><a href= <li><a href= "basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
Basic use of priority queues.</li> Basic use of priority queues.</li>
<li><a href= <li><a href= "priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
Splitting and joining priority queues.</li> Splitting and joining priority queues.</li>
<li><a href= <li><a href= "priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
Conditionally erasing values from a container object.</li> Conditionally erasing values from a container object.</li>
</ol> </ol>
<h2><a name="generics" id="generics">Generics</a></h2> <h2><a name="generics" id="generics">Generics</a></h2>
<ol> <ol>
<li><a href= <li><a href= "priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/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>
Using <a href="pq_container_traits.html"><tt>container_traits</tt></a>
to query about underlying data structure behavior.</li> to query about underlying data structure behavior.</li>
</ol> </ol>
...@@ -44,13 +41,11 @@ ...@@ -44,13 +41,11 @@
<ol> <ol>
<li><a href= <li><a href= "priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
Cross referencing an associative container and a priority Cross referencing an associative container and a priority
queue.</li> queue.</li>
<li><a href= <li><a href= "priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
"../../../../testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
Cross referencing a vector and a priority queue using a Cross referencing a vector and a priority queue using a
<u>very</u> simple version of Dijkstra's shortest path <u>very</u> simple version of Dijkstra's shortest path
algorithm.</li> algorithm.</li>
......
libstdc++-v3/doc/html/ext/pb_ds/pq_regression_tests.html
...@@ -45,7 +45,7 @@ ...@@ -45,7 +45,7 @@
<h2><a name="pq_tests" id="pq_tests">Tests</a></h2> <h2><a name="pq_tests" id="pq_tests">Tests</a></h2>
<p><a href= <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> checks all priority queue types.</p>
</div> </div>
</body> </body>
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Basic priority queue.</p> <p>Basic priority queue.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test.html
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
using <tt>pop</tt> . It measures the average time for using <tt>pop</tt> . It measures the average time for
<tt>push</tt> and <tt>pop</tt> as a function of the number of <tt>push</tt> and <tt>pop</tt> as a function of the number of
values.</p> 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> <tt>priority_queue_random_int_push_pop_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html
...@@ -16,7 +16,7 @@ ...@@ -16,7 +16,7 @@
into a container using <tt>push</tt> . It measures the average into a container using <tt>push</tt> . It measures the average
time for <tt>push</tt> as a function of the number of time for <tt>push</tt> as a function of the number of
values.</p> 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> priority_queue_random_intpush_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Basic priority-queue data structure tag.</p> <p>Basic priority-queue data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_join_timing_test.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
STL's priority queues, it successively pops values from one STL's priority queues, it successively pops values from one
container and pushes them into the other. The test measures the container and pushes them into the other. The test measures the
average time as a function of the number of values.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_modify_down_timing_test.html
...@@ -20,7 +20,7 @@ ...@@ -20,7 +20,7 @@
modified, then pushes values back in. It measures the average modified, then pushes values back in. It measures the average
time for <tt>modify</tt> as a function of the number of time for <tt>modify</tt> as a function of the number of
values.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100 f)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <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 <p>The main purpose of this test is to contrast <a href="priority_queue_text_modify_up_timing_test.html">Priority Queue
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_modify_up_timing_test.html
...@@ -20,7 +20,7 @@ ...@@ -20,7 +20,7 @@
modified, then pushes values back in. It measures the average modified, then pushes values back in. It measures the average
time for <tt>modify</tt> as a function of the number of time for <tt>modify</tt> as a function of the number of
values.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100 t)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test.html
...@@ -16,7 +16,7 @@ ...@@ -16,7 +16,7 @@
a container, then pops them until only one is left in the a container, then pops them until only one is left in the
container. It measures the memory use as a function of the container. It measures the memory use as a function of the
number of values pushed to the container.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
a container using <tt>push</tt> , then removes them using a container using <tt>push</tt> , then removes them using
<tt>pop</tt> . It measures the average time for <tt>push</tt> <tt>pop</tt> . It measures the average time for <tt>push</tt>
as a function of the number of values.</p> 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> priority_queue_text_push_pop_timing_test</tt></a>
thirty_years_among_the_dead_preproc.txt 200 200 2100)</p> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_push_timing_test.html
...@@ -16,7 +16,7 @@ ...@@ -16,7 +16,7 @@
a container using <tt>push</tt> . It measures the average time a container using <tt>push</tt> . It measures the average time
for <tt>push</tt> as a function of the number of values for <tt>push</tt> as a function of the number of values
pushed.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/quadratic_probe_fn.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>A probe sequence policy using square increments.</p> <p>A probe sequence policy using square increments.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/range_invalidation_guarantee.html
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
modifications to the container object.</p> modifications to the container object.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/rb_tree_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Red-black tree data structure tag.</p> <p>Red-black tree data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/rc_binomial_heap_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Redundant-counter binomial-heap data structure tag.</p> <p>Redundant-counter binomial-heap data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/resize_error.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
adequate size for an external resize.</p> adequate size for an external resize.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_probe_fn.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
needs to support.</p> needs to support.</p>
<p>Defined in: <a href= <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 <h2><a name="link1" id="link1">Public Types and
Constants</a></h2> Constants</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_range_hashing.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
functor needs to support.</p> functor needs to support.</p>
<p>Defined in: <a href= <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 <h2><a name="link1" id="link1">Public Types and
Constants</a></h2> Constants</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_ranged_hash_fn.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
functor needs to support.</p> functor needs to support.</p>
<p>Defined in: <a href= <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 <h2><a name="link1" id="link1">Public Types and
Constants</a></h2> Constants</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_ranged_probe_fn.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
functor needs to support.</p> functor needs to support.</p>
<p>Defined in: <a href= <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 <h2><a name="link1" id="link1">Public Types and
Constants</a></h2> Constants</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_resize_policy.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
needs to support.</p> needs to support.</p>
<p>Defined in: <a href= <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 <h2><a name="link1" id="link1">Public Types and
Constants</a></h2> Constants</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_resize_trigger.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
needs to support.</p> needs to support.</p>
<p>Defined in: <a href= <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> sample_resize_trigger.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and <h2><a name="link1" id="link1">Public Types and
......
libstdc++-v3/doc/html/ext/pb_ds/sample_size_policy.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
to support.</p> to support.</p>
<p>Defined in: <a href= <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 <h2><a name="link1" id="link1">Public Types and
Constants</a></h2> Constants</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_tree_node_update.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
functor needs to support.</p> functor needs to support.</p>
<p>Defined in: <a href= <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> sample_tree_node_update.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_trie_e_access_traits.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
traits class needs to support.</p> traits class needs to support.</p>
<p>Defined in: <a href= <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> <tt>sample_trie_e_access_traits.hpp</tt></a></p>
<h2><a name="link1" id="link1">Public Types and <h2><a name="link1" id="link1">Public Types and
......
libstdc++-v3/doc/html/ext/pb_ds/sample_trie_node_update.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
functor needs to support.</p> functor needs to support.</p>
<p>Defined in: <a href= <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> sample_trie_node_update.hpp</tt></a></p>
<h2><a name="link1" id="link1">Template Parameters</a></h2> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/sample_update_policy.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
functor needs to support.</p> functor needs to support.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Public Methods</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/splay_tree_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Splay tree data structure tag.</p> <p>Splay tree data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/string_trie_e_access_traits.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Element access traits for string types.</p> <p>Element access traits for string types.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/thin_heap_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Thin heap data structure tag.</p> <p>Thin heap data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/tree.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>A concrete basic tree-based associative container.</p> <p>A concrete basic tree-based associative container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/tree_based_containers.html
...@@ -86,9 +86,9 @@ ...@@ -86,9 +86,9 @@
<tt>std::make_pair(29,42)</tt> (useful in geometric <tt>std::make_pair(29,42)</tt> (useful in geometric
applications or distributed file systems with leases, for applications or distributed file systems with leases, for
example). (See <a href= 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= 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 for examples.) It should be noted that an <tt>std::set</tt> can
only solve these types of problems with linear complexity.</p> only solve these types of problems with linear complexity.</p>
......
libstdc++-v3/doc/html/ext/pb_ds/tree_order_statistics_node_update.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Functor updating ranks of entrees.</p> <p>Functor updating ranks of entrees.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/tree_order_statistics_timing_test.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
; otherwise, it uses the <tt>find</tt> method and ; otherwise, it uses the <tt>find</tt> method and
<tt>std::distance</tt> .) It measures the average time for such <tt>std::distance</tt> .) It measures the average time for such
queries as a function of the number of values inserted.</p> 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> 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the performance difference of policies based <p>The test checks the performance difference of policies based
......
libstdc++-v3/doc/html/ext/pb_ds/tree_random_int_find_find_timing_test.html
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
a container, then performs a series of finds using a container, then performs a series of finds using
<tt>find</tt>. It measures the average time for <tt>find</tt> <tt>find</tt>. It measures the average time for <tt>find</tt>
as a function of the number of values inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/tree_split_join_timing_test.html
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
<tt>insert</tt> methods.) It measures the time for splitting <tt>insert</tt> methods.) It measures the time for splitting
and joining the containers as a function of the number of and joining the containers as a function of the number of
values inserted.</p> 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> 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the performance difference of <tt>join</tt> <p>The test checks the performance difference of <tt>join</tt>
......
libstdc++-v3/doc/html/ext/pb_ds/tree_tag.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>Basic tree data structure tag.</p> <p>Basic tree data structure tag.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Base Classes</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/tree_text_find_find_timing_test.html
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
a container, then performs a series of finds using a container, then performs a series of finds using
<tt>find</tt>. It measures the average time for <tt>find</tt> <tt>find</tt>. It measures the average time for <tt>find</tt>
as a function of the number of values inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/tree_text_insert_timing_test.html
...@@ -16,7 +16,7 @@ ...@@ -16,7 +16,7 @@
a container using <tt>insert</tt> . It measures the average a container using <tt>insert</tt> . It measures the average
time for <tt>insert</tt> as a function of the number of values time for <tt>insert</tt> as a function of the number of values
inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/tree_text_lor_find_find_timing_test.html
...@@ -21,7 +21,7 @@ ...@@ -21,7 +21,7 @@
<tt>find</tt> s on the same key before moving on to the next <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 key. It measures the average time for <tt>find</tt> as a
function of the number of values inserted.</p> 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> thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
<h2><a name="purpose" id="purpose">Purpose</a></h2> <h2><a name="purpose" id="purpose">Purpose</a></h2>
<p>The test checks the effect of different underlying <p>The test checks the effect of different underlying
......
libstdc++-v3/doc/html/ext/pb_ds/trie.html
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
<p>A concrete basic trie-based associative container.</p> <p>A concrete basic trie-based associative container.</p>
<p>Defined in: <a href= <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> <h2><a name="link1" id="link1">Template Parameters</a></h2>
......
libstdc++-v3/doc/html/ext/pb_ds/trie_based_containers.html
...@@ -221,7 +221,7 @@ ...@@ -221,7 +221,7 @@
"trie_prefix_search_node_update.html"><tt>trie_prefix_search_node_update</tt></a> "trie_prefix_search_node_update.html"><tt>trie_prefix_search_node_update</tt></a>
supports searching for ranges that match a given prefix. See supports searching for ranges that match a given prefix. See
<a href= <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= <li><a href=
"null_trie_node_update.html"><tt>null_trie_node_update</tt></a> "null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment