Boost logo

Geometry :

Subject: Re: [geometry] [index] rtree iterative queries
From: Adam Wulkiewicz (adam.wulkiewicz_at_[hidden])
Date: 2013-09-09 18:44:24

Mateusz Loskot wrote:
> On 8 September 2013 23:49, Adam Wulkiewicz <adam.wulkiewicz_at_[hidden]> wrote:
>> After some thinking I propose to change qbegin() and qend() to return
>> type-erased const_query_iterators and leave only non-parameter qend(). As
>> Bruno have written this will be the closest to the other solutions where
>> iterators are involved. Later we may add a way to obtain those faster 'raw'
>> iterators. For now I'd add qbegin_() and qend_() returning them and shield
>> those functions with BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL. Are you ok
>> with that or see it differently?
> +1 to what Bruno suggested
> Best regards,

Ok, now it looks more familiar:

for ( Rtree::const_query_iterator it = tree.qbegin(bgi::nearest(pt,
10000)) ;
       it != tree.qend() ; ++it )
// do something with value
     if ( has_enough_nearest_values() )


Geometry list run by mateusz at