* doc/xml/manual/policy_data_structures.xml: Fix typo.
* doc/xml/manual/test_policy_data_structures.xml: Likewise.
* doc/html/*: Regenerate.
From-SVN: r248189
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.
</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>
<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>
<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>
</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>