PR libstdc++/37391 continued.

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

	PR libstdc++/37391 continued.
	* doc/html/ext/pb_ds/assoc_examples.html: Don't use base tag,
	specify full path for source file links.
	* doc/html/ext/pb_ds/pq_examples.html: Same.

From-SVN: r140600
This commit is contained in:
Benjamin Kosnik 2008-09-23 16:06:43 +00:00 committed by Benjamin Kosnik
parent ba47d38d4c
commit e5f21110e0
3 changed files with 39 additions and 37 deletions

View File

@ -1,3 +1,10 @@
2008-09-23 Benjamin Kosnik <bkoz@redhat.com>
PR libstdc++/37391 continued.
* doc/html/ext/pb_ds/assoc_examples.html: Don't use base tag,
specify full path for source file links.
* doc/html/ext/pb_ds/pq_examples.html: Same.
2008-09-23 Paolo Carlini <paolo.carlini@oracle.com>
* include/bits/locale_facets.tcc (__pad<>::_S_pad): Don't use const
@ -52,7 +59,7 @@
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,

View File

@ -9,39 +9,35 @@
<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= "basic_map.cc"><tt>basic_map.cc</tt></a>
<a href= "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>
Basic use of "maps".</li>
<li><a href= "basic_set.cc"><tt>basic_set.cc</tt></a>
<li><a href= "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>
Basic use of "sets".</li>
<li><a href= "erase_if.cc"><tt>erase_if.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/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= "assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
<li><a href= "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>
Using <a href=
"http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/assoc_container_traits.html"><tt>container_traits</tt></a> to query
"assoc_container_traits.html"><tt>container_traits</tt></a> to query
about underlying data structure behavior.</li>
<li><a href= "hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
hash-based containers.</li>
</ol>
@ -55,22 +51,22 @@
<ol>
<li><a href= "hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
object.</li>
<li><a href= "hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
hash-based container object.</li>
<li><a href= "hash_resize.cc"><tt>hash_resize.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/hash_resize.cc"><tt>hash_resize.cc</tt></a>
Resizing the size of a hash-based container object.</li>
<li><a href= "hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
object.</li>
<li><a href= "hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
object.</li>
</ol>
@ -80,18 +76,18 @@
<ol>
<li><a href= "hash_mod.cc"><tt>hash_mod.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
unknown skewed key distribution.</li>
<li><a href= "hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
<li><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>
Writing a range-hashing functor for the case of a known
skewed key distribution.</li>
<li><a href= "store_hash.cc"><tt>store_hash.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/store_hash.cc"><tt>store_hash.cc</tt></a>
Storing the hash value along with each key.</li>
<li><a href= "ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
Writing a ranged-hash functor.</li>
</ol>
@ -104,10 +100,10 @@
<ol>
<li><a href= "tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
<li><a href= "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>
Using trees for order statistics.</li>
<li><a href= "tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
<li><a href= "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>
Augmenting trees to support operations on line
intervals.</li>
</ol>
@ -117,13 +113,13 @@
<ol>
<li><a href= "tree_join.cc"><tt>tree_join.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/tree_join.cc"><tt>tree_join.cc</tt></a>
Joining two tree-based container objects.</li>
<li><a href= "trie_split.cc"><tt>trie_split.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/trie_split.cc"><tt>trie_split.cc</tt></a>
Splitting a PATRICIA trie container object.</li>
<li><a href= "tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
objects.</li>
</ol>
@ -133,10 +129,10 @@
<ol>
<li><a href= "trie_dna.cc"><tt>trie_dna.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/trie_dna.cc"><tt>trie_dna.cc</tt></a>
Using a PATRICIA trie for DNA strings.</li>
<li><a href= "trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
<li><a href= "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>
Using a PATRICIA trie for finding all entries whose key
matches a given prefix.</li>
</ol>
@ -144,10 +140,10 @@
<h2><a name="mmaps" id="mmaps">"Multimaps" and
"Multisets".</a></h2>
<ol>
<li><a href= "basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
<li><a href= "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>
Basic use of "multimaps".</li>
<li><a href= "basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
<li><a href= "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>
Basic use of "multisets".</li>
</ol>
</div>

View File

@ -9,7 +9,6 @@
<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>
@ -19,21 +18,21 @@
<h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
<ol>
<li><a href= "basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
<li><a href= "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>
Basic use of priority queues.</li>
<li><a href= "priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
Splitting and joining priority queues.</li>
<li><a href= "priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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>
</ol>
<h2><a name="generics" id="generics">Generics</a></h2>
<ol>
<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>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a>
Using <a href="assoc_container_traits.html"><tt>container_traits</tt></a>
to query about underlying data structure behavior.</li>
</ol>
@ -41,11 +40,11 @@
<ol>
<li><a href= "priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
Cross referencing an associative container and a priority
queue.</li>
<li><a href= "priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
<li><a href= "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/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
<u>very</u> simple version of Dijkstra's shortest path
algorithm.</li>