Optimise R-tree queries in the case if there is no need to limit maximum number of results
This commit is contained in:
parent
8ac393623c
commit
99dceb1abb
@ -74,11 +74,6 @@ template <typename RTreeT, typename DataFacadeT> class GeospatialQuery
|
|||||||
{
|
{
|
||||||
return std::pair<bool, bool>{false, false};
|
return std::pair<bool, bool>{false, false};
|
||||||
}
|
}
|
||||||
(void)approach;
|
|
||||||
(void)use_all_edges;
|
|
||||||
(void)bearing_with_range;
|
|
||||||
(void)use_all_edges;
|
|
||||||
|
|
||||||
auto valid = CheckSegmentExclude(segment) &&
|
auto valid = CheckSegmentExclude(segment) &&
|
||||||
CheckApproach(input_coordinate, segment, approach) &&
|
CheckApproach(input_coordinate, segment, approach) &&
|
||||||
(use_all_edges ? HasValidEdge(segment, *use_all_edges)
|
(use_all_edges ? HasValidEdge(segment, *use_all_edges)
|
||||||
|
Loading…
Reference in New Issue
Block a user