On 18/05/17 11:09 +0100, Jonathan Wakely wrote:
This adds the missing 7.1.0 version info to the manual, and adds a step about updating that in future when bumping the version.* 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. * doc/html/*: Regenerate. Committing to trunk and gcc-7-branch.
And a couple of typo fixes as well.
commit 795ffc416b1f97f7be9cb7ee4708ff3bad7c504b Author: Jonathan Wakely <[email protected]> Date: Thu May 18 11:23:15 2017 +0100 Fix typos in libstdc++ manual * doc/xml/manual/policy_data_structures.xml: Fix typo. * doc/xml/manual/test_policy_data_structures.xml: Likewise. * doc/html/*: Regenerate. 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>
