OSDN Git Service

2008-09-22 Benjamin Kosnik <bkoz@redhat.com>
authorbkoz <bkoz@138bc75d-0d04-0410-961f-82ee72b054a4>
Mon, 22 Sep 2008 20:56:08 +0000 (20:56 +0000)
committerbkoz <bkoz@138bc75d-0d04-0410-961f-82ee72b054a4>
Mon, 22 Sep 2008 20:56:08 +0000 (20:56 +0000)
PR libstdc++/37391
* doc/html/ext/pb_ds/*.html: Fix external links.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@140564 138bc75d-0d04-0410-961f-82ee72b054a4

105 files changed:
libstdc++-v3/ChangeLog
libstdc++-v3/doc/html/ext/pb_ds/assoc_container_traits.html
libstdc++-v3/doc/html/ext/pb_ds/assoc_examples.html
libstdc++-v3/doc/html/ext/pb_ds/assoc_regression_tests.html
libstdc++-v3/doc/html/ext/pb_ds/associative_container_tag.html
libstdc++-v3/doc/html/ext/pb_ds/basic_hash_table.html
libstdc++-v3/doc/html/ext/pb_ds/basic_hash_tag.html
libstdc++-v3/doc/html/ext/pb_ds/basic_invalidation_guarantee.html
libstdc++-v3/doc/html/ext/pb_ds/basic_tree.html
libstdc++-v3/doc/html/ext/pb_ds/basic_tree_tag.html
libstdc++-v3/doc/html/ext/pb_ds/binary_heap_tag.html
libstdc++-v3/doc/html/ext/pb_ds/binomial_heap_tag.html
libstdc++-v3/doc/html/ext/pb_ds/cc_hash_max_collision_check_resize_trigger.html
libstdc++-v3/doc/html/ext/pb_ds/cc_hash_table.html
libstdc++-v3/doc/html/ext/pb_ds/cc_hash_tag.html
libstdc++-v3/doc/html/ext/pb_ds/container_base.html
libstdc++-v3/doc/html/ext/pb_ds/container_tag.html
libstdc++-v3/doc/html/ext/pb_ds/counter_lu_policy.html
libstdc++-v3/doc/html/ext/pb_ds/direct_mask_range_hashing.html
libstdc++-v3/doc/html/ext/pb_ds/direct_mod_range_hashing.html
libstdc++-v3/doc/html/ext/pb_ds/exceptions.html
libstdc++-v3/doc/html/ext/pb_ds/gp_hash_table.html
libstdc++-v3/doc/html/ext/pb_ds/gp_hash_tag.html
libstdc++-v3/doc/html/ext/pb_ds/hash_exponential_size_policy.html
libstdc++-v3/doc/html/ext/pb_ds/hash_load_check_resize_trigger.html
libstdc++-v3/doc/html/ext/pb_ds/hash_prime_size_policy.html
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_erase_mem_usage_test.html
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_find_find_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_subscript_find_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/hash_random_int_subscript_insert_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/hash_standard_resize_policy.html
libstdc++-v3/doc/html/ext/pb_ds/hash_text_find_find_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/hash_zlob_random_int_find_find_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/insert_error.html
libstdc++-v3/doc/html/ext/pb_ds/join_error.html
libstdc++-v3/doc/html/ext/pb_ds/linear_probe_fn.html
libstdc++-v3/doc/html/ext/pb_ds/list_update.html
libstdc++-v3/doc/html/ext/pb_ds/list_update_tag.html
libstdc++-v3/doc/html/ext/pb_ds/motivation.html
libstdc++-v3/doc/html/ext/pb_ds/move_to_front_lu_policy.html
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_find_timing_test_large.html
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_find_timing_test_small.html
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large.html
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small.html
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_timing_test_large.html
libstdc++-v3/doc/html/ext/pb_ds/multimap_text_insert_timing_test_small.html
libstdc++-v3/doc/html/ext/pb_ds/null_hash_fn.html
libstdc++-v3/doc/html/ext/pb_ds/null_lu_metadata.html
libstdc++-v3/doc/html/ext/pb_ds/null_mapped_type.html
libstdc++-v3/doc/html/ext/pb_ds/null_probe_fn.html
libstdc++-v3/doc/html/ext/pb_ds/null_tree_node_update.html
libstdc++-v3/doc/html/ext/pb_ds/null_trie_node_update.html
libstdc++-v3/doc/html/ext/pb_ds/ov_tree_tag.html
libstdc++-v3/doc/html/ext/pb_ds/pairing_heap_tag.html
libstdc++-v3/doc/html/ext/pb_ds/pat_trie_tag.html
libstdc++-v3/doc/html/ext/pb_ds/point_invalidation_guarantee.html
libstdc++-v3/doc/html/ext/pb_ds/pq_container_traits.html
libstdc++-v3/doc/html/ext/pb_ds/pq_examples.html
libstdc++-v3/doc/html/ext/pb_ds/pq_regression_tests.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_tag.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_join_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_modify_down_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_modify_up_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_push_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/quadratic_probe_fn.html
libstdc++-v3/doc/html/ext/pb_ds/range_invalidation_guarantee.html
libstdc++-v3/doc/html/ext/pb_ds/rb_tree_tag.html
libstdc++-v3/doc/html/ext/pb_ds/rc_binomial_heap_tag.html
libstdc++-v3/doc/html/ext/pb_ds/resize_error.html
libstdc++-v3/doc/html/ext/pb_ds/sample_probe_fn.html
libstdc++-v3/doc/html/ext/pb_ds/sample_range_hashing.html
libstdc++-v3/doc/html/ext/pb_ds/sample_ranged_hash_fn.html
libstdc++-v3/doc/html/ext/pb_ds/sample_ranged_probe_fn.html
libstdc++-v3/doc/html/ext/pb_ds/sample_resize_policy.html
libstdc++-v3/doc/html/ext/pb_ds/sample_resize_trigger.html
libstdc++-v3/doc/html/ext/pb_ds/sample_size_policy.html
libstdc++-v3/doc/html/ext/pb_ds/sample_tree_node_update.html
libstdc++-v3/doc/html/ext/pb_ds/sample_trie_e_access_traits.html
libstdc++-v3/doc/html/ext/pb_ds/sample_trie_node_update.html
libstdc++-v3/doc/html/ext/pb_ds/sample_update_policy.html
libstdc++-v3/doc/html/ext/pb_ds/splay_tree_tag.html
libstdc++-v3/doc/html/ext/pb_ds/string_trie_e_access_traits.html
libstdc++-v3/doc/html/ext/pb_ds/thin_heap_tag.html
libstdc++-v3/doc/html/ext/pb_ds/tree.html
libstdc++-v3/doc/html/ext/pb_ds/tree_based_containers.html
libstdc++-v3/doc/html/ext/pb_ds/tree_order_statistics_node_update.html
libstdc++-v3/doc/html/ext/pb_ds/tree_order_statistics_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/tree_random_int_find_find_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/tree_split_join_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/tree_tag.html
libstdc++-v3/doc/html/ext/pb_ds/tree_text_find_find_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/tree_text_insert_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/tree_text_lor_find_find_timing_test.html
libstdc++-v3/doc/html/ext/pb_ds/trie.html
libstdc++-v3/doc/html/ext/pb_ds/trie_based_containers.html
libstdc++-v3/doc/html/ext/pb_ds/trie_order_statistics_node_update.html
libstdc++-v3/doc/html/ext/pb_ds/trie_prefix_search_node_update.html
libstdc++-v3/doc/html/ext/pb_ds/trie_tag.html
libstdc++-v3/doc/html/ext/pb_ds/trivial_iterator_tag.html
libstdc++-v3/doc/html/ext/pb_ds/tutorial.html

index 9fce643..6233eec 100644 (file)
@@ -1,5 +1,10 @@
 2008-09-22  Benjamin Kosnik  <bkoz@redhat.com>
 
+       PR libstdc++/37391
+       * doc/html/ext/pb_ds/*.html: Fix external links.
+       
+2008-09-22  Benjamin Kosnik  <bkoz@redhat.com>
+
        * doc/doxygen/user.cfg.in: Define _GLIBCXX_HAS_GTHREADS for mutex,
        condition_variable, and thread output.
 
index 245b81c..7814712 100644 (file)
@@ -19,7 +19,7 @@
     data structure.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 6c16698..269c975 100644 (file)
@@ -9,39 +9,39 @@
   <title>Examples</title>
   <meta http-equiv="Content-Type" content=
   "text/html; charset=us-ascii" />
+  <base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/">
   </head>
 
+
 <body>
   <div id="page">
     <h1>Associative-Container Examples</h1>
 
+    
+
     <h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
+      <li>
+       <a href= "basic_map.cc"><tt>basic_map.cc</tt></a>
       Basic use of "maps".</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
+      <li><a href= "basic_set.cc"><tt>basic_set.cc</tt></a>
       Basic use of "sets".</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/erase_if.cc"><tt>erase_if.cc</tt></a>
+      <li><a href= "erase_if.cc"><tt>erase_if.cc</tt></a>
       Conditionally erasing values from a container object.</li>
     </ol>
 
     <h2><a name="generics" id="generics">Generics</a></h2>
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
+      <li><a href= "assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
       Using <a href=
-      "assoc_container_traits.html"><tt>container_traits</tt></a> to query
+      "http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/assoc_container_traits.html"><tt>container_traits</tt></a> to query
       about underlying data structure behavior.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
+      <li><a href= "hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
       A non-compiling example showing wrong use of finding keys in
       hash-based containers.</li>
     </ol>
 
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>
+      <li><a href= "hash_initial_size.cc"><tt>hash_initial_size.cc</tt></a>
       Setting the initial size of a hash-based container
       object.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
+      <li><a href= "hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
       A non-compiling example showing how not to resize a
       hash-based container object.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_resize.cc"><tt>hash_resize.cc</tt></a>
+      <li><a href= "hash_resize.cc"><tt>hash_resize.cc</tt></a>
       Resizing the size of a hash-based container object.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>
+      <li><a href= "hash_illegal_resize.cc"><tt>hash_illegal_resize.cc</tt></a>
       Showing an illegal resize of a hash-based container
       object.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>
+      <li><a href= "hash_load_set_change.cc"><tt>hash_load_set_change.cc</tt></a>
       Changing the load factors of a hash-based container
       object.</li>
     </ol>
 
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_mod.cc"><tt>hash_mod.cc</tt></a>
+      <li><a href= "hash_mod.cc"><tt>hash_mod.cc</tt></a>
       Using a modulo range-hashing function for the case of an
       unknown skewed key distribution.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
+      <li><a href= "hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
       Writing a range-hashing functor for the case of a known
       skewed key distribution.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/store_hash.cc"><tt>store_hash.cc</tt></a>
+      <li><a href= "store_hash.cc"><tt>store_hash.cc</tt></a>
       Storing the hash value along with each key.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
+      <li><a href= "ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
       Writing a ranged-hash functor.</li>
     </ol>
 
-    <h2><a name="tree_like_based" id=
-    "tree_like_based">Tree-Like Containers (Trees and
+    <h2><a name="tree_like_based" id= "tree_like_based">Tree-Like Containers (Trees and
     Tries)</a></h2>
 
  
 
  
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
+      <li><a href= "tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
       Using trees for order statistics.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
+      <li><a href= "tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
       Augmenting trees to support operations on line
       intervals.</li>
     </ol>
 
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/tree_join.cc"><tt>tree_join.cc</tt></a>
+      <li><a href= "tree_join.cc"><tt>tree_join.cc</tt></a>
       Joining two tree-based container objects.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/trie_split.cc"><tt>trie_split.cc</tt></a>
+      <li><a href= "trie_split.cc"><tt>trie_split.cc</tt></a>
       Splitting a PATRICIA trie container object.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
+      <li><a href= "tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
       Order statistics while joining two tree-based container
       objects.</li>
     </ol>
 
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/trie_dna.cc"><tt>trie_dna.cc</tt></a>
+      <li><a href= "trie_dna.cc"><tt>trie_dna.cc</tt></a>
       Using a PATRICIA trie for DNA strings.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
+      <li><a href= "trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
       Using a PATRICIA trie for finding all entries whose key
       matches a given prefix.</li>
     </ol>
     <h2><a name="mmaps" id="mmaps">"Multimaps" and
     "Multisets".</a></h2>
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
+      <li><a href= "basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
       Basic use of "multimaps".</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
+      <li><a href= "basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
       Basic use of "multisets".</li>
     </ol>
   </div>
index 178aadf..9b6b6b8 100644 (file)
@@ -9,6 +9,7 @@
   <title>Associative-Container Regression Tests</title>
   <meta http-equiv="Content-Type" content=
   "text/html; charset=us-ascii" />
+<base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/regression/">
   </head>
 
 <body>
 
     <ol>
       <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc"><tt>hash_no_data_map_rand.cc</tt></a>
+      "hash_no_data_map_rand.cc"><tt>hash_no_data_map_rand.cc</tt></a>
       checks all hash-based "set" types.</li>
 
       <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc"><tt>list_update_no_data_map_rand.cc</tt></a>
+      "list_update_no_data_map_rand.cc"><tt>list_update_no_data_map_rand.cc</tt></a>
       checks all list-based "set" types.</li>
 
       <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc"><tt>tree_no_data_map_rand.cc</tt></a>
+      "tree_no_data_map_rand.cc"><tt>tree_no_data_map_rand.cc</tt></a>
       checks all tree-based "set" types.</li>
 
       <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc"><tt>trie_no_data_map_rand.cc</tt></a>
+      "trie_no_data_map_rand.cc"><tt>trie_no_data_map_rand.cc</tt></a>
       checks all PATRICIA-trie-based "set" types.</li>
     </ol>
 
     <p>The following check all "map" types:</p>
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/hash_data_map_rand.cc"><tt>hash_data_map_rand.cc</tt></a>
+      <li><a href= "hash_data_map_rand.cc"><tt>hash_data_map_rand.cc</tt></a>
       checks all hash-based "map" types.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc"><tt>list_update_data_map_rand.cc</tt></a>
+      <li><a href= "list_update_data_map_rand.cc"><tt>list_update_data_map_rand.cc</tt></a>
       checks all list-based "map" types.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/tree_data_map_rand.cc"><tt>tree_data_map_rand.cc</tt></a>
+      <li><a href= "tree_data_map_rand.cc"><tt>tree_data_map_rand.cc</tt></a>
       checks all tree-based "map" types.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/regression/trie_data_map_rand.cc"><tt>trie_data_map_rand.cc</tt></a>
+      <li><a href= "trie_data_map_rand.cc"><tt>trie_data_map_rand.cc</tt></a>
       checks all PATRICIA-trie-based "map" types.</li>
     </ol>
   </div>
index 5c44efe..ceb91cd 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic associative-container data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index a6c569c..668e681 100644 (file)
@@ -18,7 +18,7 @@
     <p>An abstract basic hash-based associative container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 8110c0d..9dc5e6d 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic hash data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index c4c242b..d4a0df2 100644 (file)
@@ -20,7 +20,7 @@
     is valid as long as the container is not modified.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
   </div>
 </body>
 </html>
index f66d7a9..3811707 100644 (file)
@@ -18,7 +18,7 @@
     <p>An abstract basic tree-like-based associative container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index c35ecad..8eca2a8 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic tree-like data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 47f4247..47873b1 100644 (file)
@@ -18,7 +18,7 @@
     <p>Binary-heap (array-based) data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 6b5e849..fde6a91 100644 (file)
@@ -18,7 +18,7 @@
     <p>Binomial-heap data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index e07c51e..a6b512b 100644 (file)
@@ -22,7 +22,7 @@
     factor.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index fec6bec..0557732 100644 (file)
@@ -19,7 +19,7 @@
     container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index fb6f593..1923e20 100644 (file)
@@ -18,7 +18,7 @@
     <p>Collision-chaining hash data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index a074130..359e024 100644 (file)
@@ -18,7 +18,7 @@
     <p>An abstract basic associative container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index b9f0531..de187a9 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
   </div>
 </body>
 </html>
index 142cca1..d9d5112 100644 (file)
@@ -19,7 +19,7 @@
     list based on the counter algorithm.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 1a7d39b..19f8621 100644 (file)
@@ -18,7 +18,7 @@
     <p>A mask range-hashing class (uses a bit-mask).</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 33c9933..f3f9295 100644 (file)
@@ -18,7 +18,7 @@
     <p>A mod range-hashing class (uses the modulo function).</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 3b50c27..a51e8eb 100644 (file)
@@ -18,7 +18,7 @@
 <p>Base class for associative-container exceptions.</p>
 
 <p>Defined in: <a href=
-               "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+               "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
 
 <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 446359b..dd9d725 100644 (file)
@@ -19,7 +19,7 @@
     container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 720984f..4c5f06b 100644 (file)
@@ -18,7 +18,7 @@
     <p>General-probing hash data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 059fa48..1089b15 100644 (file)
@@ -19,7 +19,7 @@
     sequence (typically powers of 2)</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 0013e01..b22b7b5 100644 (file)
@@ -20,7 +20,7 @@
     load_max.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index cf67dab..8976767 100644 (file)
@@ -19,7 +19,7 @@
     nearly-exponential sequence of primes.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
     Constants</a></h2>
index 073c84c..2867595 100644 (file)
@@ -14,7 +14,7 @@
 <p>This test inserts a number of uniform i.i.d. integer keys
     into a container, then erases all keys except one. It measures
     the final size of the container.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc"><tt>hash_random_int_erase_mem_usage.cc</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc"><tt>hash_random_int_erase_mem_usage.cc</tt></a>
     2000 2000 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks how containers adjust internally as their
index 7e7f208..b6066e7 100644 (file)
@@ -17,7 +17,7 @@
     using <tt>find</tt>. It measures the average time
     for<tt>find</tt> as a function of the number of values
     inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_find_timing.cc"><tt>random_int_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc"><tt>random_int_find_timing_test</tt></a>
     200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index adee8f0..0025163 100644 (file)
@@ -17,7 +17,7 @@
     using <tt><b>operator</b>[]</tt>. It measures the average time
     for <tt><b>operator</b>[]</tt> as a function of the number of
     values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc"><tt>hash_random_int_subscript_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc"><tt>hash_random_int_subscript_find_timing_test</tt></a>
     200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 37a8644..a15d03b 100644 (file)
@@ -17,7 +17,7 @@
     <tt><b>operator</b>[]</tt>. It measures the average time for
     <tt><b>operator</b>[]</tt> as a function of the number of
     values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc"><tt>hash_random_int_subscript_insert_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc"><tt>hash_random_int_subscript_insert_timing_test</tt></a>
     200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test primarily checks the effect of different underlying
index 70d6086..8dbc57c 100644 (file)
@@ -19,7 +19,7 @@
     trigger policies.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index fafa245..60c30fd 100644 (file)
@@ -16,7 +16,7 @@
     a container, then performs a series of finds using
     <tt>find</tt> . It measures the average time for <tt>find</tt>
     as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different range-hashing
index f7156b1..bfbb3b0 100644 (file)
@@ -18,7 +18,7 @@
     time for <tt>find</tt> as a function of the number of values in
     the containers. The keys are generated as follows. First, a
     uniform integer is created; it is then shifted left 8 bits.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc"><tt>hash_zlob_random_int_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc"><tt>hash_zlob_random_int_find_timing_test</tt></a>
     200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different range-hashing
@@ -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.
     In our opnion, real-life key distributions are handled better
     with an appropriate hash function and a mask-based
-    range-hashing function. (<a href="../../../../testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
+    range-hashing function. (<a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
     shows an example of handling this a-priori known skewed
     distribution with a mask-based range-hashing function). If hash
     performance is bad, a <i>&Chi;<sup>2</sup></i> test can be used
index f67160f..37a89aa 100644 (file)
@@ -24,7 +24,7 @@ allocator's exception will be thrown).</p>
     even though free positions are available.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 3441e1f..f3e3eaf 100644 (file)
@@ -21,7 +21,7 @@
                                               overlaps.</p>
 
                                               <p>Defined in: <a href=
-                                              "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+                                              "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
 
                                               <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 2141c26..6387d3a 100644 (file)
@@ -18,7 +18,7 @@
     <p>A probe sequence policy using fixed increments.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 93785ac..434e82f 100644 (file)
@@ -18,7 +18,7 @@
     <p>A list-update based associative container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index a35dc8c..f04aaea 100644 (file)
@@ -18,7 +18,7 @@
     <p>List-update data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 420fc64..6273172 100644 (file)
@@ -753,11 +753,11 @@ belonging to a specific user are stored consecutively.
     associative container mapping each user to an associative
     container which maps each application id to a start time (see
     <a href=
-    "../../../../testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>);
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>);
     in the second example, one would use an associative container
     mapping each <tt><b>int</b></tt> to some size-type indicating
     the number of times it logically occurs (see <a href=
-    "../../../../testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>).</p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>).</p>
 
     <p><a href=
     "assoc_performance_tests.html#multimaps">Associative-Container
index 3519092..4ed4d40 100644 (file)
@@ -19,7 +19,7 @@
     the front of the list.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index c24acdc..74d33a3 100644 (file)
@@ -28,7 +28,7 @@
     finds the secondary key from a container obtained from finding
     a primary key. For the native multimaps, it searches a range
     obtained using <tt>std::equal_range</tt> on a primary key.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc"><tt>multimap_text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc"><tt>multimap_text_find_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the find-time scalability of different
index 5c0b577..1b379d8 100644 (file)
@@ -28,7 +28,7 @@
     finds the secondary key from a container obtained from finding
     a primary key. For the native multimaps, it searches a range
     obtained using <tt>std::equal_range</tt> on a primary key.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc"><tt>multimap_text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc"><tt>multimap_text_find_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the find-time scalability of different
index c4b1df5..4affbf4 100644 (file)
@@ -23,7 +23,7 @@
     Containers::Alternative to Multiple Equivalent Keys</a>). There
     are 100 distinct primary keys. The test measures the memory use
     as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 100 200 2100 100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the memory scalability of different
index 7b710f3..462fce4 100644 (file)
@@ -25,7 +25,7 @@
     to primary keys ranges to about 20.</p>
 <p>The test measures the memory use as a function of the number
     of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the memory scalability of different
index ecdf2a4..b9a2d99 100644 (file)
@@ -25,7 +25,7 @@
     to primary keys ranges to about 20.</p>
 <p>The test measures the memory use as a function of the number
     of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 400 1 6 6)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the insert-time scalability of different
index ae0bd0b..cda3629 100644 (file)
@@ -30,7 +30,7 @@
     container. For the native multimaps, it obtains a range using
     <tt>std::equal_range</tt>, and inserts a value only if it was
     not contained already.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc"><tt>multimap_text_insert_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc"><tt>multimap_text_insert_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the insert-time scalability of different
index 5d95224..34f1ee0 100644 (file)
@@ -26,7 +26,7 @@
     Containers::Hash Policies</a>.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
   </div>
 </body>
 </html>
index 1cbf9cc..e8fb6a3 100644 (file)
@@ -19,7 +19,7 @@
     container does not actually need metadata.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
   </div>
 </body>
 </html>
index 5be7359..d62fac5 100644 (file)
@@ -19,7 +19,7 @@
     a "set"</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
   </div>
 </body>
 </html>
index af9379b..1c8811e 100644 (file)
@@ -23,7 +23,7 @@
     Policy Classes</a> explains the concept of a null policy.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
   </div>
 </body>
 </html>
index 98960ed..cc1c900 100644 (file)
@@ -23,7 +23,7 @@
     Policy Classes</a> explains the concept of a null policy.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index c6c0844..18ea007 100644 (file)
@@ -23,7 +23,7 @@
     Policy Classes</a> explains the concept of a null policy.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 8da2d50..01d7f90 100644 (file)
@@ -18,7 +18,7 @@
     <p>Ordered-vector tree data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 756e886..5901d1a 100644 (file)
@@ -18,7 +18,7 @@
     <p>Pairing-heap data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 459546d..2e9a32c 100644 (file)
@@ -18,7 +18,7 @@
     <p>PATRICIA trie data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index ba2eee6..f677221 100644 (file)
@@ -22,7 +22,7 @@
     regardless of modifications to the container object.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 2ff5ed7..dcd995f 100644 (file)
@@ -19,7 +19,7 @@
     data structure.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index ee8e930..ab84862 100644 (file)
@@ -9,6 +9,7 @@
   <title>Examples</title>
   <meta http-equiv="Content-Type" content=
   "text/html; charset=us-ascii" />
+  <base href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/">
   </head>
 
 <body>
      <h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
+      <li><a href= "basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
       Basic use of priority queues.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
+      <li><a href= "priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
       Splitting and joining priority queues.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
+      <li><a href= "priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
       Conditionally erasing values from a container object.</li>
     </ol>
 
     <h2><a name="generics" id="generics">Generics</a></h2>
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a>
-      Using <a href="pq_container_traits.html"><tt>container_traits</tt></a>
+      <li><a href= "priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a>
+      Using <a href="http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/assoc_container_traits.html"><tt>container_traits</tt></a>
       to query about underlying data structure behavior.</li>
     </ol>
 
 
 
     <ol>
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
+      <li><a href= "priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
       Cross referencing an associative container and a priority
       queue.</li>
 
-      <li><a href=
-      "../../../../testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
+      <li><a href= "priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
       Cross referencing a vector and a priority queue using a
       <u>very</u> simple version of Dijkstra's shortest path
       algorithm.</li>
index 1e894ca..9084409 100644 (file)
@@ -45,7 +45,7 @@
     <h2><a name="pq_tests" id="pq_tests">Tests</a></h2>
 
     <p><a href=
-    "../../../../testsuite/ext/pb_ds/regression/priority_queue_rand.cc"><tt>priority_queue_rand.cc</tt></a>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/regression/priority_queue_rand.cc"><tt>priority_queue_rand.cc</tt></a>
     checks all priority queue types.</p>
   </div>
 </body>
index 169953f..def310f 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic priority queue.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/priority_queue.hpp"><tt>priority_queue.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/priority_queue.hpp"><tt>priority_queue.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index e9aec9c..903331d 100644 (file)
@@ -17,7 +17,7 @@
     using <tt>pop</tt> . It measures the average time for
     <tt>push</tt> and <tt>pop</tt> as a function of the number of
     values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc">
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc">
 <tt>priority_queue_random_int_push_pop_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
index 6532302..ba91f60 100644 (file)
@@ -16,7 +16,7 @@
     into a container using <tt>push</tt> . It measures the average
     time for <tt>push</tt> as a function of the number of
     values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc"><tt>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc"><tt>
     priority_queue_random_intpush_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
index 4bad6ee..8b6d81c 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic priority-queue data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 4710ea9..a4bf576 100644 (file)
@@ -18,7 +18,7 @@
     STL's priority queues, it successively pops values from one
     container and pushes them into the other. The test measures the
     average time as a function of the number of values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc"><tt>priority_queue_text_join_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc"><tt>priority_queue_text_join_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 6935957..7ece80b 100644 (file)
@@ -20,7 +20,7 @@
     modified, then pushes values back in. It measures the average
     time for <tt>modify</tt> as a function of the number of
     values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_down_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_down_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100 f)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The main purpose of this test is to contrast <a href="priority_queue_text_modify_up_timing_test.html">Priority Queue
index 3db4639..72a1e0a 100644 (file)
@@ -20,7 +20,7 @@
     modified, then pushes values back in. It measures the average
     time for <tt>modify</tt> as a function of the number of
     values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_up_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_up_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100 t)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 8b5388e..2545fc0 100644 (file)
@@ -16,7 +16,7 @@
     a container, then pops them until only one is left in the
     container. It measures the memory use as a function of the
     number of values pushed to the container.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc"><tt>priority_queue_text_pop_mem_usage_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc"><tt>priority_queue_text_pop_mem_usage_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 02fe321..3c143fe 100644 (file)
@@ -17,7 +17,7 @@
     a container using <tt>push</tt> , then removes them using
     <tt>pop</tt> . It measures the average time for <tt>push</tt>
     as a function of the number of values.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc"><tt>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc"><tt>
     priority_queue_text_push_pop_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
index 67ae4b9..542eb91 100644 (file)
@@ -16,7 +16,7 @@
     a container using <tt>push</tt> . It measures the average time
     for <tt>push</tt> as a function of the number of values
     pushed.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc"><tt>priority_queue_text_push_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc"><tt>priority_queue_text_push_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index f3209d3..00367da 100644 (file)
@@ -18,7 +18,7 @@
     <p>A probe sequence policy using square increments.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index e59a257..7bfba19 100644 (file)
@@ -23,7 +23,7 @@
     modifications to the container object.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 600235d..2adbd09 100644 (file)
@@ -18,7 +18,7 @@
     <p>Red-black tree data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 46106f4..1a4ba9f 100644 (file)
@@ -18,7 +18,7 @@
     <p>Redundant-counter binomial-heap data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index cb05b50..6aab88c 100644 (file)
@@ -21,7 +21,7 @@
    adequate size for an external resize.</p>
 
    <p>Defined in: <a href=
-                  "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+                  "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
 
    <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 3d18650..51dccce 100644 (file)
@@ -21,7 +21,7 @@
     needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp"><tt>sample_probe_fn.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp"><tt>sample_probe_fn.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
     Constants</a></h2>
index 5b1a900..8505187 100644 (file)
@@ -21,7 +21,7 @@
     functor needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp"><tt>sample_range_hashing.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp"><tt>sample_range_hashing.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
     Constants</a></h2>
index f8e47ab..834f496 100644 (file)
@@ -21,7 +21,7 @@
     functor needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp"><tt>sample_ranged_hash_fn.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp"><tt>sample_ranged_hash_fn.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
     Constants</a></h2>
index b0e744c..ee1bc06 100644 (file)
@@ -21,7 +21,7 @@
     functor needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp"><tt>sample_ranged_probe_fn.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp"><tt>sample_ranged_probe_fn.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
     Constants</a></h2>
index 7807ace..61ff09b 100644 (file)
@@ -21,7 +21,7 @@
     needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp"><tt>sample_resize_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp"><tt>sample_resize_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
     Constants</a></h2>
index d7042bc..5c8173c 100644 (file)
@@ -21,7 +21,7 @@
     needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp"><tt>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp"><tt>
     sample_resize_trigger.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
index e7f58e7..ebb14d3 100644 (file)
@@ -21,7 +21,7 @@
     to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp"><tt>sample_size_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp"><tt>sample_size_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
     Constants</a></h2>
index 2cfab0a..aefd670 100644 (file)
@@ -21,7 +21,7 @@
     functor needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp"><tt>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp"><tt>
     sample_tree_node_update.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
index b663e50..a46c91b 100644 (file)
@@ -21,7 +21,7 @@
     traits class needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp">
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp">
     <tt>sample_trie_e_access_traits.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Types and
index beab37c..61b6b40 100644 (file)
@@ -21,7 +21,7 @@
     functor needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp"><tt>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp"><tt>
     sample_trie_node_update.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
index f671bcd..8a286c7 100644 (file)
@@ -21,7 +21,7 @@
     functor needs to support.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp"><tt>sample_update_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp"><tt>sample_update_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Public Methods</a></h2>
 
index 98c56ce..3e6a64b 100644 (file)
@@ -18,7 +18,7 @@
     <p>Splay tree data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 10fa2af..4ce9e86 100644 (file)
@@ -18,7 +18,7 @@
     <p>Element access traits for string types.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index a8e9d4d..c441896 100644 (file)
@@ -18,7 +18,7 @@
     <p>Thin heap data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index d836bda..3202a6e 100644 (file)
@@ -18,7 +18,7 @@
     <p>A concrete basic tree-based associative container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 7a1b554..63c7c74 100644 (file)
@@ -86,9 +86,9 @@
     <tt>std::make_pair(29,42)</tt> (useful in geometric
     applications or distributed file systems with leases, for
     example). (See <a href=
-    "../../../../testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
     and <a href=
-    "../../../../testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
     for examples.) It should be noted that an <tt>std::set</tt> can
     only solve these types of problems with linear complexity.</p>
 
index 449966b..f434553 100644 (file)
@@ -18,7 +18,7 @@
     <p>Functor updating ranks of entrees.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 0d75790..ef81161 100644 (file)
@@ -19,7 +19,7 @@
     ; otherwise, it uses the <tt>find</tt> method and
     <tt>std::distance</tt> .) It measures the average time for such
     queries as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc"><tt>tree_order_statistics_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc"><tt>tree_order_statistics_timing_test</tt></a>
     200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the performance difference of policies based
index 9317cfc..c34354f 100644 (file)
@@ -17,7 +17,7 @@
     a container, then performs a series of finds using
     <tt>find</tt>. It measures the average time for <tt>find</tt>
     as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 11db03d..9164984 100644 (file)
@@ -19,7 +19,7 @@
     <tt>insert</tt> methods.) It measures the time for splitting
     and joining the containers as a function of the number of
     values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_split_join_timing.cc"><tt>tree_split_join_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc"><tt>tree_split_join_timing_test</tt></a>
     200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the performance difference of <tt>join</tt>
index e4b2060..d7265ac 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic tree data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index 283bdf0..fbfdfef 100644 (file)
@@ -17,7 +17,7 @@
     a container, then performs a series of finds using
     <tt>find</tt>. It measures the average time for <tt>find</tt>
     as a function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 6f0e26c..a5815fb 100644 (file)
@@ -16,7 +16,7 @@
     a container using <tt>insert</tt> . It measures the average
     time for <tt>insert</tt> as a function of the number of values
     inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc"><tt>tree_text_insert_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc"><tt>tree_text_insert_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 48d0112..c577a56 100644 (file)
@@ -21,7 +21,7 @@
     <tt>find</tt> s on the same key before moving on to the next
     key. It measures the average time for <tt>find</tt> as a
     function of the number of values inserted.</p>
-<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc"><tt>tree_text_lor_find_timing_test</tt></a>
+<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc"><tt>tree_text_lor_find_timing_test</tt></a>
     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
 <h2><a name="purpose" id="purpose">Purpose</a></h2>
 <p>The test checks the effect of different underlying
index 71a8688..32a2ab1 100644 (file)
@@ -18,7 +18,7 @@
     <p>A concrete basic trie-based associative container.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 8b670bc..72bdd06 100644 (file)
       "trie_prefix_search_node_update.html"><tt>trie_prefix_search_node_update</tt></a>
       supports searching for ranges that match a given prefix. See
       <a href=
-      "../../../../testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>.</li>
+      "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>.</li>
 
       <li><a href=
       "null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
index dcc236f..66aab26 100644 (file)
@@ -18,7 +18,7 @@
     <p>Functor updating ranks of entrees.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index da6efa2..e136495 100644 (file)
@@ -19,7 +19,7 @@
     range of values that match a certain prefix.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Template Parameters</a></h2>
 
index 6d2def4..62bf124 100644 (file)
@@ -18,7 +18,7 @@
     <p>Basic trie data structure tag.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
 
     <h2><a name="link1" id="link1">Base Classes</a></h2>
 
index be9813b..1f59c51 100644 (file)
@@ -19,7 +19,7 @@
     iterators has none of the STL's movement abilities.</p>
 
     <p>Defined in: <a href=
-    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
   </div>
 </body>
 </html>
index 029204b..152cd57 100644 (file)
@@ -72,7 +72,7 @@ assert(c.find(2) != c.end());
     customary. <a href=
     "assoc_examples.html#basic_usage">Associative-Container
     Examples::Basic use</a>, and especially <a href=
-    "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>,
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>,
     show examples of this.</p>
 
 <p>This isn't to say that things are exactly as one would expect,
@@ -156,7 +156,7 @@ uses standard-derived terminology if possible.
     <p>Each type or method is defined in the most-common ancestor
     in which it makes sense:
   <a href=
-    "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
     shows an example of most of the associative-container
     types.</p>
 
@@ -347,7 +347,7 @@ Tags::Associative-Containers</a>; <a href="ds_gen.html#container_traits">
 
     <p>This is described further in <a href=
     "ds_gen.html">Design::Data-Structure Genericity</a>; <a href=
-    "../../../../testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
     shows an example of querying containers' attributes.</p>
 
     <h3><a name="assoc_find_range" id="assoc_find_range">Point-Type
@@ -511,7 +511,7 @@ between 1 and 5.
     "null_mapped_type.html">null_mapped_type</a> object. Also,
    , the container's <tt>value_type</tt> is essentially
     its <tt>key_type</tt> - just as with the STL's sets. For a simple example, see <a href=
-    "../../../../testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
    .</p>
 
     <p>The STL's multimaps and multisets allow, respectively,
@@ -608,7 +608,7 @@ assert(!p.empty());
     Traits::Data Structure Tags::Priority-Queues</a> lists the
     possible types, <a href="pq_design.html">Priority-Queue
     Design</a> explains this further, and <a href=
-    "../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
+    "http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
     shows an example.</p>
 
     <p>Note that as opposed to the STL's priority queue, <a href=