From: bkoz Date: Tue, 23 Sep 2008 16:06:43 +0000 (+0000) Subject: 2008-09-23 Benjamin Kosnik X-Git-Tag: upstream/4.9.2~39543 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=249c57bf012393f75382557f17da693aa50c10ad;p=platform%2Fupstream%2Flinaro-gcc.git 2008-09-23 Benjamin Kosnik 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. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@140600 138bc75d-0d04-0410-961f-82ee72b054a4 --- diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 13cb028..5bca65c 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,10 @@ +2008-09-23 Benjamin Kosnik + + 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 * 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 * doc/doxygen/user.cfg.in: Define _GLIBCXX_HAS_GTHREADS for mutex, diff --git a/libstdc++-v3/doc/html/ext/pb_ds/assoc_examples.html b/libstdc++-v3/doc/html/ext/pb_ds/assoc_examples.html index 269c975..b64c747 100644 --- a/libstdc++-v3/doc/html/ext/pb_ds/assoc_examples.html +++ b/libstdc++-v3/doc/html/ext/pb_ds/assoc_examples.html @@ -9,39 +9,35 @@ Examples - -

Associative-Container Examples

- -

Basic Use

  1. - basic_map.cc + basic_map.cc Basic use of "maps".
    2. -
  2. basic_set.cc +
  3. basic_set.cc Basic use of "sets".
    4. -
  4. erase_if.cc +
  5. erase_if.cc Conditionally erasing values from a container object.

Generics

    -
  1. assoc_container_traits.cc +
  2. assoc_container_traits.cc Using container_traits to query + "assoc_container_traits.html">container_traits to query about underlying data structure behavior.
    3. -
  3. hash_find_neg.cc +
  4. hash_find_neg.cc A non-compiling example showing wrong use of finding keys in hash-based containers.
@@ -55,22 +51,22 @@
    -
  1. hash_initial_size.cc +
  2. hash_initial_size.cc Setting the initial size of a hash-based container object.
    3. -
  3. hash_resize_neg.cc +
  4. hash_resize_neg.cc A non-compiling example showing how not to resize a hash-based container object.
    5. -
  5. hash_resize.cc +
  6. hash_resize.cc Resizing the size of a hash-based container object.
    7. -
  7. hash_illegal_resize.cc +
  8. hash_illegal_resize.cc Showing an illegal resize of a hash-based container object.
    9. -
  9. hash_load_set_change.cc +
  10. hash_load_set_change.cc Changing the load factors of a hash-based container object.
@@ -80,18 +76,18 @@
    -
  1. hash_mod.cc +
  2. hash_mod.cc Using a modulo range-hashing function for the case of an unknown skewed key distribution.
    3. -
  3. shift_mask.cc +
  4. shift_mask.cc Writing a range-hashing functor for the case of a known skewed key distribution.
    5. -
  5. store_hash.cc +
  6. store_hash.cc Storing the hash value along with each key.
    7. -
  7. ranged_hash.cc +
  8. ranged_hash.cc Writing a ranged-hash functor.
@@ -104,10 +100,10 @@
    -
  1. tree_order_statistics.cc +
  2. tree_order_statistics.cc Using trees for order statistics.
    3. -
  3. tree_intervals.cc +
  4. tree_intervals.cc Augmenting trees to support operations on line intervals.
@@ -117,13 +113,13 @@
    -
  1. tree_join.cc +
  2. tree_join.cc Joining two tree-based container objects.
    3. -
  3. trie_split.cc +
  4. trie_split.cc Splitting a PATRICIA trie container object.
    5. -
  5. tree_order_statistics_join.cc +
  6. tree_order_statistics_join.cc Order statistics while joining two tree-based container objects.
@@ -133,10 +129,10 @@
    -
  1. trie_dna.cc +
  2. trie_dna.cc Using a PATRICIA trie for DNA strings.
    3. -
  3. trie_prefix_search.cc +
  4. trie_prefix_search.cc Using a PATRICIA trie for finding all entries whose key matches a given prefix.
@@ -144,10 +140,10 @@

"Multimaps" and "Multisets".

    -
  1. basic_multimap.cc +
  2. basic_multimap.cc Basic use of "multimaps".
    3. -
  3. basic_multiset.cc +
  4. basic_multiset.cc Basic use of "multisets".
diff --git a/libstdc++-v3/doc/html/ext/pb_ds/pq_examples.html b/libstdc++-v3/doc/html/ext/pb_ds/pq_examples.html index ab84862..15311eb 100644 --- a/libstdc++-v3/doc/html/ext/pb_ds/pq_examples.html +++ b/libstdc++-v3/doc/html/ext/pb_ds/pq_examples.html @@ -9,7 +9,6 @@ Examples - @@ -19,21 +18,21 @@

Basic Use

    -
  1. basic_priority_queue.cc +
  2. basic_priority_queue.cc Basic use of priority queues.
    3. -
  3. priority_queue_split_join.cc +
  4. priority_queue_split_join.cc Splitting and joining priority queues.
    5. -
  5. priority_queue_erase_if.cc +
  6. priority_queue_erase_if.cc Conditionally erasing values from a container object.

Generics

    -
  1. priority_queue_container_traits.cc - Using container_traits +
  2. priority_queue_container_traits.cc + Using container_traits to query about underlying data structure behavior.
@@ -41,11 +40,11 @@
    -
  1. priority_queue_xref.cc +
  2. priority_queue_xref.cc Cross referencing an associative container and a priority queue.
    3. -
  3. priority_queue_dijkstra.cc +
  4. priority_queue_dijkstra.cc Cross referencing a vector and a priority queue using a very simple version of Dijkstra's shortest path algorithm.