|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r85639 - trunk/libs/geometry/doc/index
From: adam.wulkiewicz_at_[hidden]
Date: 2013-09-10 08:12:43
Author: awulkiew
Date: 2013-09-10 08:12:43 EDT (Tue, 10 Sep 2013)
New Revision: 85639
URL: http://svn.boost.org/trac/boost/changeset/85639
Log:
[geometry] index docs: removed meaningless 'experimental'.
Text files modified:
trunk/libs/geometry/doc/index/introduction.qbk | 8 ++++----
1 files changed, 4 insertions(+), 4 deletions(-)
Modified: trunk/libs/geometry/doc/index/introduction.qbk
==============================================================================
--- trunk/libs/geometry/doc/index/introduction.qbk Tue Sep 10 08:00:44 2013 (r85638)
+++ trunk/libs/geometry/doc/index/introduction.qbk 2013-09-10 08:12:43 EDT (Tue, 10 Sep 2013) (r85639)
@@ -83,7 +83,7 @@
* capable to store __value__ type with no default constructor,
* in-memory storage (shared memory by use of Boost.Interprocess allocator).
-[heading Planned and experimental features]
+[heading Planned features]
Below you can find features that will (or probably will) be added in the future releases:
@@ -93,12 +93,12 @@
* 'reversed' spatial predicates or additional spatial predicates like contains(),
* iterative queries - query iterators / type-erased query iterators,
/]
-* path/ray query predicate - search for Values along Segment or LineString, closest to the starting point (experimental),
+* path/ray query predicate - search for Values along Segment or LineString, closest to the starting point,
* user-defined distance calculation in nearest() predicate,
-* serialization (experimental),
+* serialization,
* persistent storage.
[/ Maybe
-* other geometries as Values, e.g. NSpheres. Rings would probably require using move semantics instead of copying
+* other geometries as Indexables, e.g. NSpheres. Rings would probably require using move semantics instead of copying
* bounding tree - rtree variation capable to use other Geometries as bounds, e.g. NSpheres, Rings/convex polygons/ (moving required), Capsules, Elipses, Variants etc.
* moving instead of copying + optimizations for movable/nonthrowing/trivialy copied elements
* passing more than one nearest/path predicate - "returned value is one of k1 nearest values to p1 and ... and one of kN nearest values to pN"
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk