Lines Matching refs:intersects

34  rt.query(bgi::intersects(box_region), std::back_inserter(returned_values));
40  bgi::query(rt, bgi::intersects(box_region), std::back_inserter(returned_values));
45  BOOST_FOREACH(__value__ & v, rt | bgi::adaptors::queried(bgi::intersects(box_region)))
52  std::copy(rt.qbegin(bgi::intersects(box_region)), rt.qend(), std::back_inserter(returned_values));
58 …std::copy(bgi::qbegin(rt, bgi::intersects(box_region)), bgi::qend(rt), std::back_inserter(returned…
67 [[intersects(Box)] [covered_by(Box)] [disjoint(Box)] [overlaps(Box)] [within(Box)]]
68 [[[$img/index/rtree/intersects.png]] [[$img/index/rtree/within.png]] [[$img/index/rtree/disjoint.pn…
72 [[intersects(Segment)] [intersects(Box)] [disjoint(Box)] [intersects(Box)] [disjoint(Box)]]
77 [[intersects(Ring)] [intersects(Polygon)] [intersects(MultiPolygon)] [intersects(Segment)] [interse…
82 [[intersects(Box)] [disjoint(Box)] [intersects(Box)] [disjoint(Box)]]
92  rt.query(index::intersects(box), std::back_inserter(result));
98  rt.query(!index::intersects(box), std::back_inserter(result));
162  rt.query(index::intersects(box) && index::satisfies(is_red),
165  rt.query(index::intersects(box) && index::satisfies(is_red_o()),
169  rt.query(index::intersects(box) && index::satisfies([](__value__ const& v) { return v.is_red(); }),
180  rt.query(index::intersects(box) && index::satisfies(is_red),
183  rt.query(index::intersects(box) && !index::satisfies(is_not_red),
195  rt.query(index::intersects(box1) && !index::within(box2),
198  rt.query(index::intersects(box1) && !index::within(box2) && index::overlaps(box3),
237  rt1.query(bgi::intersects(Box(/*...*/)), std::back_inserter(result));
244  rt1.query(bgi::intersects(Box(/*...*/))), bgi::inserter(rt3));
248  RTree rt4(rt1 | bgi::adaptors::queried(bgi::intersects(Box(/*...*/)))));