commit 795ffc416b1f97f7be9cb7ee4708ff3bad7c504b
Author: Jonathan Wakely <jwakely@redhat.com>
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.
@@ -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>
@@ -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>