MatCat.OpenSource/8sa1-gcc
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fix typos in libstdc++ manual

Browse Source 
* doc/xml/manual/policy_data_structures.xml: Fix typo.
	* doc/xml/manual/test_policy_data_structures.xml: Likewise.
	* doc/html/*: Regenerate.

From-SVN: r248189
This commit is contained in:
Jonathan Wakely 2017-05-18 11:26:02 +01:00 committed by Jonathan Wakely
parent cf0042303e
commit 8985968cc4
5 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
libstdc++-v3/ChangeLog
View File

@ -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.

2
libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html
View File

@ -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>

2
libstdc++-v3/doc/html/manual/policy_data_structures.html
View File

@ -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>

2
libstdc++-v3/doc/xml/manual/policy_data_structures.xml
View File

@ -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>

2
libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml
View File

@ -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>