boost/geometry
2
0
Fork 0
mirror of https://github.com/boostorg/geometry.git synced 2026-02-13 00:22:10 +00:00
Code Issues Projects Releases Wiki Activity

naming error fixed

Browse Source 
[SVN r75749]
This commit is contained in:
Adam Wulkiewicz
2011-11-30 13:40:14 +00:00
parent 608241a9cc
commit 6079b53ff8
3 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/html/geometry_index/r_tree.html
View File

@@ -438,8 +438,8 @@
</pre>
<p>
Furthermore, it's possible to define if the closest, furthest or centroidal
point of the non-point <code class="computeroutput"><span class="identifier">__Indexable__</span></code>
should be taken into account in the routine calculating distance.
point of the non-point <code class="computeroutput">Indexable</code> should be taken into account
in the routine calculating distance.
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span>Value<span class="special">&gt;</span> <span class="identifier">returned_values</span><span class="special">;</span>
<a href="http://www.boost.org/libs/geometry/doc/html/geometry/reference/concepts/concept_point.html" target="_top">Point</a> <span class="identifier">pt</span><span class="special">(...);</span>

4
doc/html/index.html
View File

@@ -30,7 +30,7 @@
</h3></div></div>
<div><p class="copyright">Copyright &#169; 2011 Adam Wulkiewicz, Federico J. Fernandez</p></div>
<div><div class="legalnotice">
<a name="id787827"></a><p>
<a name="id808512"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>
@@ -54,7 +54,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"><p><small>Last revised: November 30, 2011 at 12:44:52 GMT</small></p></td>
<td align="left"><p><small>Last revised: November 30, 2011 at 13:38:40 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

2
doc/rtree.qbk
View File

@@ -270,7 +270,7 @@ may be defined as follows.
index::nearest(rt, index::bounded(pt, 10, 500), k, std::back_inserter(returned_values));
Furthermore, it's possible to define if the closest, furthest or centroidal point of the
non-point `__Indexable__` should be taken into account in the routine calculating distance.
non-point `__indexable__` should be taken into account in the routine calculating distance.
std::vector<__value__> returned_values;
__point__ pt(...);