diff options
5 files changed, 8 insertions, 4 deletions
diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index cb59eca..c286818 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,5 +1,9 @@ 2017-05-18 Jonathan Wakely <jwakely@redhat.com> + * doc/xml/manual/policy_data_structures.xml: Fix typo. + * doc/xml/manual/test_policy_data_structures.xml: Likewise. + * doc/html/*: Regenerate. + * doc/xml/manual/abi.xml: Document latest library versions. * doc/xml/manual/build_hacking.xml: Document requirement to update abi.xml when bumping library versions. diff --git a/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html b/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html index 048ae86..b59d59c 100644 --- a/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html +++ b/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html @@ -43,7 +43,7 @@ </p></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="hash.text_find.results"></a> Results </h6></div></div></div><p>The graphic below show the results for the native - and collision-chaining hash types the the function + and collision-chaining hash types the function applied being a text find timing test using <code class="function">find</code>. </p><div class="informalfigure"><div class="mediaobject" align="center"><img src="../images/pbds_hash_text_find.png" align="middle" /></div></div><p> diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures.html b/libstdc++-v3/doc/html/manual/policy_data_structures.html index bd0d18e..f3d0fb5 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures.html @@ -172,7 +172,7 @@ <code class="code">push</code> and <code class="code">pop</code> operations, differs from the others in terms of its invalidation guarantees. Other design decisions also impact the cost and placement of the overhead, at the - expense of more difference in the the kinds of operations that the + expense of more difference in the kinds of operations that the underlying data structure can support. These differences pose a challenge when creating a uniform interface for priority queues. </p></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.intro.motivation"></a>Goals</h3></div></div></div><p> diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml index 0d0bf43..0f19be3 100644 --- a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml @@ -169,7 +169,7 @@ <code>push</code> and <code>pop</code> operations, differs from the others in terms of its invalidation guarantees. Other design decisions also impact the cost and placement of the overhead, at the - expense of more difference in the the kinds of operations that the + expense of more difference in the kinds of operations that the underlying data structure can support. These differences pose a challenge when creating a uniform interface for priority queues. </para> diff --git a/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml index 241ec9f..27d6c1d 100644 --- a/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml @@ -89,7 +89,7 @@ </title></info> <para>The graphic below show the results for the native - and collision-chaining hash types the the function + and collision-chaining hash types the function applied being a text find timing test using <function>find</function>. </para> |