diff options
| author | redi <redi@138bc75d-0d04-0410-961f-82ee72b054a4> | 2017-05-18 10:26:02 +0000 |
|---|---|---|
| committer | redi <redi@138bc75d-0d04-0410-961f-82ee72b054a4> | 2017-05-18 10:26:02 +0000 |
| commit | a9c8d273372b87f77414364566760dd715136cd9 (patch) | |
| tree | 7afdf0a34a35a8c2e87910849c760dbcef97eeb5 /libstdc++-v3/doc | |
| parent | 841da9cf6d75b7fb61f8093e8144c52197e9c226 (diff) | |
| download | gcc-a9c8d273372b87f77414364566760dd715136cd9.tar.gz | |
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.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@248189 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libstdc++-v3/doc')
4 files changed, 4 insertions, 4 deletions
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 048ae86745e..b59d59cb245 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 bd0d18e21f5..f3d0fb59bf7 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 0d0bf43f979..0f19be315a8 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 241ec9f0e33..27d6c1df084 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> |