| /third_party/boost/libs/geometry/index/test/rtree/ |
| D | rtree_non_cartesian.cpp | 36 Rtree rtree; in test_rtree() local
51 rtree.insert(v); in test_rtree()
52 BOOST_CHECK_EQUAL(rtree.size(), n + 1); in test_rtree()
54 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree()
56 rtree.query(bgi::intersects(v), std::back_inserter(res)); in test_rtree()
67 rtree.remove(v); in test_rtree()
68 BOOST_CHECK_EQUAL(rtree.size(), n - 1); in test_rtree()
70 BOOST_CHECK_EQUAL(rtree.count(v), vcount); in test_rtree()
72 rtree.query(bgi::intersects(v), std::back_inserter(res)); in test_rtree()
80 test_rtree<bgi::rtree<Value, bgi::linear<4> > >(); in test_value()
[all …]
|
| D | rtree_contains_point.cpp | 19 typedef bgi::rtree<Pt, Params> Rtree; in test_one()
20 Rtree rtree; in test_one() local
22 rtree.insert(Pt(0, 0)); in test_one()
23 rtree.insert(Pt(1, 1)); in test_one()
24 rtree.insert(Pt(2, 2)); in test_one()
25 rtree.insert(Pt(3, 3)); in test_one()
26 rtree.insert(Pt(4, 4)); in test_one()
27 rtree.insert(Pt(4, 3)); in test_one()
28 rtree.insert(Pt(0, 3)); in test_one()
30 for (typename Rtree::const_iterator it = rtree.begin() ; it != rtree.end() ; ++it) in test_one()
[all …]
|
| D | test_rtree.hpp | 671 void rtree(Rtree & tree, Elements & input, Box & qbox) in rtree() function
689 Iter find(Rtree const& rtree, Iter first, Iter last, Value const& value) in find() argument
692 if ( rtree.value_eq()(value, *first) ) in find()
698 void compare_outputs(Rtree const& rtree, std::vector<Value> const& output, std::vector<Value> const… in compare_outputs() argument
706 BOOST_CHECK(find(rtree, output.begin(), output.end(), v) != output.end() ); in compare_outputs()
712 void exactly_the_same_outputs(Rtree const& rtree, Range1 const& output, Range2 const& expected_outp… in exactly_the_same_outputs() argument
724 if ( !rtree.value_eq()(*it1, *it2) ) in exactly_the_same_outputs()
776 void spatial_query(Rtree & rtree, Predicates const& pred, std::vector<Value> const& expected_output) in spatial_query() argument
778 BOOST_CHECK( bgi::detail::rtree::utilities::are_levels_ok(rtree) ); in spatial_query()
779 if ( !rtree.empty() ) in spatial_query()
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
| D | remove.hpp | 25 namespace detail { namespace rtree { namespace visitors { namespace
42 typedef rtree::subtree_destroyer<MembersHolder> subtree_destroyer;
46 typedef typename rtree::elements_type<internal_node>::type::size_type internal_size_type;
76 typedef typename rtree::elements_type<internal_node>::type children_type; in operator ()()
77 children_type & children = rtree::elements(n); in operator ()()
98 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
100 elements_type & elements = rtree::elements(n); in operator ()()
123 rtree::elements(*m_parent)[m_current_child_index].first in operator ()()
124 = rtree::elements_box<box_type>(elements.begin(), elements.end(), m_translator, in operator ()()
130 …BOOST_GEOMETRY_INDEX_ASSERT(&n == &rtree::get<internal_node>(*m_root_node), "node must be the root… in operator ()()
[all …]
|
| D | copy.hpp | 22 namespace detail { namespace rtree { namespace visitors { namespace
34 typedef rtree::subtree_destroyer<MembersHolder> subtree_destroyer;
45 …node_pointer raw_new_node = rtree::create_node<allocators_type, internal_node>::apply(m_allocators… in operator ()()
48 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
49 elements_type & elements = rtree::elements(n); in operator ()()
51 elements_type & elements_dst = rtree::elements(rtree::get<internal_node>(*new_node)); in operator ()()
56 …rtree::apply_visitor(*this, *it->second); // MAY… in operator ()()
61 …elements_dst.push_back( rtree::make_ptr_pair(it->first, result) ); // MAY… in operator ()()
72 …node_pointer raw_new_node = rtree::create_node<allocators_type, leaf>::apply(m_allocators); … in operator ()()
75 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
[all …]
|
| D | insert.hpp | 30 namespace detail { namespace rtree { namespace
51 typedef typename rtree::elements_type<internal_node>::type children_type;
61 children_type & children = rtree::elements(n); in apply()
152 typename rtree::elements_type<internal_node>::type::value_type,
167 …node_pointer n2_ptr = rtree::create_node<allocators_type, Node>::apply(allocators); … in apply()
169 Node & n2 = rtree::get<Node>(*n2_ptr); in apply()
188 … BOOST_GEOMETRY_INDEX_ASSERT(parameters.get_min_elements() <= rtree::elements(n).size() && in apply()
189 rtree::elements(n).size() <= parameters.get_max_elements(), in apply()
191 … BOOST_GEOMETRY_INDEX_ASSERT(parameters.get_min_elements() <= rtree::elements(n2).size() && in apply()
192 rtree::elements(n2).size() <= parameters.get_max_elements(), in apply()
[all …]
|
| D | iterator.hpp | 16 namespace detail { namespace rtree { namespace visitors { namespace
20 …: public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Option…
23 …typedef typename rtree::node<Value, typename Options::parameters_type, Box, Allocators, typename O…
24 …typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, t…
25 …typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename O…
31 typedef typename rtree::elements_type<internal_node>::type::const_iterator internal_iterator;
32 typedef typename rtree::elements_type<leaf>::type leaf_elements;
33 typedef typename rtree::elements_type<leaf>::type::const_iterator leaf_iterator;
42 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
43 elements_type const& elements = rtree::elements(n); in operator ()()
[all …]
|
| D | destroy.hpp | 20 namespace detail { namespace rtree { namespace visitors { namespace
41 …BOOST_GEOMETRY_INDEX_ASSERT(&n == &rtree::get<internal_node>(*m_current_node), "invalid pointers"); in operator ()()
45 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
46 elements_type & elements = rtree::elements(n); in operator ()()
52 rtree::apply_visitor(*this, *m_current_node); in operator ()()
56 rtree::destroy_node<allocators_type, internal_node>::apply(m_allocators, node_to_destroy); in operator ()()
62 BOOST_GEOMETRY_INDEX_ASSERT(&l == &rtree::get<leaf>(*m_current_node), "invalid pointers"); in operator ()()
64 rtree::destroy_node<allocators_type, leaf>::apply(m_allocators, m_current_node); in operator ()()
70 rtree::apply_visitor(v, *node); in apply()
|
| D | spatial_query.hpp | 20 namespace detail { namespace rtree { namespace visitors { namespace
46 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
47 elements_type const& elements = rtree::elements(n); in operator ()()
60 rtree::apply_visitor(*this, *it->second); in operator ()()
67 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
68 elements_type const& elements = rtree::elements(n); in operator ()()
118 typedef typename rtree::elements_type<internal_node>::type::const_iterator internal_iterator;
119 typedef typename rtree::elements_type<leaf>::type leaf_elements;
120 typedef typename rtree::elements_type<leaf>::type::const_iterator leaf_iterator;
142 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
[all …]
|
| D | children_box.hpp | 20 namespace detail { namespace rtree { namespace visitors { namespace
42 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
43 elements_type const& elements = rtree::elements(n); in operator ()()
45 m_result = rtree::elements_box<box_type>(elements.begin(), elements.end(), m_tr, in operator ()()
51 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
52 elements_type const& elements = rtree::elements(n); in operator ()()
54 m_result = rtree::values_box<box_type>(elements.begin(), elements.end(), m_tr, in operator ()()
|
| /third_party/boost/libs/geometry/doc/index/generated/ |
| D | rtree_functions.qbk | 7 [[[link group__rtree__functions_1gada4f62111ed22eb2860ea30995c1ce60 `insert(rtree<...> &, Value con…
8 [[[link group__rtree__functions_1ga056469ea699e609e67762fe1b789997f `insert(rtree<...> &, Iterator,…
9 [[[link group__rtree__functions_1gab4edad000d63eb103f2dad3813ceb2b3 `insert(rtree<...> &, Convertib…
10 [[[link group__rtree__functions_1gaf353d90fd933e6110b031f63166fb45a `remove(rtree<...> &, Value con…
11 [[[link group__rtree__functions_1gaa460a8985496cf133f63f245527ac6e7 `remove(rtree<...> &, Iterator,…
12 [[[link group__rtree__functions_1ga700c922f8b4d5ebd073e999e12b55249 `remove(rtree<...> &, Convertib…
13 [[[link group__rtree__functions_1gadb43b211d5d743ebe2ef256328286e95 `query(rtree<...> const &, Pred…
14 [[[link group__rtree__functions_1ga45c2b7b112bf730d10367e10df62aa3c `qbegin(rtree<...> const &, Pre…
15 [[[link group__rtree__functions_1ga5c9a1eb0421bf2c702392247d48143e5 `qend(rtree<...> const &)`]][Re…
16 …7dc6ac90303496abd6ebd136eba18 `begin(rtree<...> const &)`]][Returns the iterator pointing at the b…
[all …]
|
| D | rtree.qbk | 4 [section boost::geometry::index::rtree]
6 …exterm><indexterm><primary>index</primary></indexterm><indexterm><primary>rtree</primary></indexte…
13 The user must pass a type defining the Parameters which will be used in rtree creation process. Thi…
44 `#include <boost/geometry/index/rtree.hpp>`
53 `class rtree`
92 [[[link classboost_1_1geometry_1_1index_1_1rtree_1a55d5fd5d205df08db5267253689ccf0c `rtree()`]][The…
93 [[[link classboost_1_1geometry_1_1index_1_1rtree_1a1a6b696d4855cbf1866196fe058c3a87 `rtree(paramete…
94 [[[link classboost_1_1geometry_1_1index_1_1rtree_1a037f17d8a1dfa4a818ff471dec61c912 `rtree(Iterator…
95 [[[link classboost_1_1geometry_1_1index_1_1rtree_1a7b96b715c52ddc13d7a81db344825848 `rtree(Range co…
96 [[[link classboost_1_1geometry_1_1index_1_1rtree_1aad1b32e82dd734747810f01ee17e464e `rtree(Iterator…
[all …]
|
| /third_party/boost/libs/geometry/doc/index/ |
| D | imports.qbk | 11 [import src/examples/rtree/quick_start.cpp]
12 [import src/examples/rtree/polygons_vector.cpp]
13 [import src/examples/rtree/polygons_shared_ptr.cpp]
14 [import src/examples/rtree/variants_map.cpp]
15 [import src/examples/rtree/value_shared_ptr.cpp]
16 [import src/examples/rtree/value_index.cpp]
17 [import src/examples/rtree/range_adaptors.cpp]
18 [import src/examples/rtree/iterative_query.cpp]
19 [import src/examples/rtree/interprocess.cpp]
20 [import src/examples/rtree/mapped_file.cpp]
|
| D | rtree.qbk | 13 [include rtree/introduction.qbk]
14 [include rtree/quickstart.qbk]
15 [include rtree/creation.qbk]
16 [include rtree/query.qbk]
17 [include rtree/examples.qbk]
18 [include rtree/experimental.qbk]
19 [/include rtree/reference.qbk]
|
| /third_party/boost/boost/geometry/index/detail/rtree/quadratic/ |
| D | redistribute_elements.hpp | 33 namespace detail { namespace rtree { namespace
45 typedef typename rtree::element_indexable_type<element_type, Translator>::type indexable_type; in pick_seeds()
68 indexable_type const& ind1 = rtree::element_indexable(elements[i], tr); in pick_seeds()
69 indexable_type const& ind2 = rtree::element_indexable(elements[j], tr); in pick_seeds()
118 typedef typename rtree::elements_type<Node>::type elements_type; in apply()
120 …typedef typename rtree::element_indexable_type<element_type, translator_type>::type indexable_type; in apply()
122 elements_type & elements1 = rtree::elements(n); in apply()
123 elements_type & elements2 = rtree::elements(second_node); in apply()
129 typedef typename rtree::container_from_elements_type<elements_type, element_type>::type in apply()
153 detail::bounds(rtree::element_indexable(elements_copy[seed1], translator), in apply()
[all …]
|
| /third_party/boost/libs/geometry/doc/index/rtree/ |
| D | examples.qbk | 16 [include ../src/examples/rtree/quick_start_results.qbk]
22 [include ../src/examples/rtree/polygons_vector_results.qbk]
28 [include ../src/examples/rtree/polygons_shared_ptr_results.qbk]
34 [include ../src/examples/rtree/variants_map_results.qbk]
37 [section Specializing index::indexable function object - storing shared pointers in the rtree]
40 [include ../src/examples/rtree/value_shared_ptr_results.qbk]
46 [include ../src/examples/rtree/value_index_results.qbk]
52 [include ../src/examples/rtree/range_adaptors_results.qbk]
58 [include ../src/examples/rtree/iterative_query_results.qbk]
64 [include ../src/examples/rtree/interprocess_results.qbk]
[all …]
|
| D | experimental.qbk | 26 …rtree.query(index::nearest(index::to_nearest(pt), k), std::back_inserter(returned_values)); // sam…
29 rtree.query(index::nearest(index::to_centroid(pt), k), std::back_inserter(returned_values));
32 rtree.query(index::nearest(index::to_furthest(pt), k), std::back_inserter(returned_values));
39 [$img/index/rtree/path.png]
44 rtree.query(index::path(segment, k), std::back_inserter(returned_values));
45 rtree.query(index::path(linestring, k), std::back_inserter(returned_values));
63 …std::copy(rtree.qbegin(index::intersects(box)), rtree.qend(index::intersects(box)), std::back_inse…
66 typedef BOOST_TYPEOF(rtree.qbegin(index::nearest(pt, 5))) const_query_iterator;
67 const_query_iterator first = rtree.qbegin(index::nearest(pt, 5));
68 const_query_iterator last = rtree.qend(index::nearest(pt, 5));
[all …]
|
| D | exception_safety.qbk | 22 [[`rtree()`] [ /nothrow/ ]]
23 [[`rtree(Iterator, Iterator)`] [ *strong* ]]
24 [[`~rtree()`] [ /nothrow/ ]]
26 [[`rtree(rtree const&)`] [ *strong* ]]
27 [[`operator=(rtree const&)`] [ *strong* ]]
29 [[`rtree(rtree &&)`] [ /nothrow/ ]]
30 [[`operator=(rtree &&)`] [ /nothrow/ or *strong*
32 [[`swap(rtree &)`] [ /nothrow/ ]]
|
| D | query.qbk | 68 …index/rtree/intersects.png]] [[$img/index/rtree/within.png]] [[$img/index/rtree/disjoint.png]] [[$…
73 …rtree/intersects_segment.png]] [[$img/index/rtree/rtree_pt_intersects_box.png]] [[$img/index/rtree…
78 …rtree/intersects_ring.png]] [[$img/index/rtree/intersects_poly.png]] [[$img/index/rtree/intersects…
83 …/rtree/rtree_pt_intersects_box.png]] [[$img/index/rtree/rtree_pt_disjoint_box.png]] [[$img/index/r…
109 [[[$img/index/rtree/knn_pt_box.png]] [[$img/index/rtree/knn_box_box.png]] [[$img/index/rtree/rtree_…
115 [[[$img/index/rtree/knn_seg_box.png]]
116 …[[$img/index/rtree/rtree_seg_knn_pt.png]] [[$img/index/rtree/rtree_seg_knn_box.png]] [[$img/index/…
117 [[$img/index/rtree/rtree_pt_knn_seg.png]]]
222 [warning The modification of the `rtree`, e.g. insertion or removal of `__value__`s may invalidate …
231 typedef bgi::rtree< __value__, bgi::linear<32, 8> > RTree;
|
| /third_party/boost/boost/geometry/index/detail/ |
| D | serialization.hpp | 284 namespace boost { namespace geometry { namespace index { namespace detail { namespace rtree { names… namespace
290 …: public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Option…
293 …typedef typename rtree::node<Value, typename Options::parameters_type, Box, Allocators, typename O…
294 …typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, t…
295 …typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename O…
303 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
304 elements_type const& elements = rtree::elements(n); in operator ()()
315 rtree::apply_visitor(*this, *it->second); in operator ()()
321 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
323 elements_type const& elements = rtree::elements(l); in operator ()()
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/rstar/ |
| D | insert.hpp | 24 namespace detail { namespace rtree { namespace visitors { namespace
84 typedef typename rtree::elements_type<Node>::type elements_type; in apply()
95 elements_type & elements = rtree::elements(n); in apply()
106 geometry::centroid(rtree::elements(*parent)[current_child_index].first, node_center); in apply()
109 typedef typename index::detail::rtree::container_from_elements_type< in apply()
125 geometry::centroid( rtree::element_indexable(*it, translator), element_center); in apply()
202 typedef typename rtree::elements_type<
203 typename rtree::internal_node<
216 typedef typename rtree::elements_type<
217 typename rtree::leaf<
[all …]
|
| D | redistribute_elements.hpp | 33 namespace detail { namespace rtree { namespace
40 typedef typename rtree::element_indexable_type<Element, Translator>::type indexable_type;
56 bounded_view_type bounded_ind1(rtree::element_indexable(e1, m_tr), m_strategy); in operator ()()
57 bounded_view_type bounded_ind2(rtree::element_indexable(e2, m_tr), m_strategy); in operator ()()
80 return geometry::get<Corner, AxisIndex>(rtree::element_indexable(e1, m_tr)) in operator ()()
81 < geometry::get<Corner, AxisIndex>(rtree::element_indexable(e2, m_tr)); in operator ()()
100 return geometry::get<AxisIndex>(rtree::element_indexable(e1, m_tr)) in operator ()()
101 < geometry::get<AxisIndex>(rtree::element_indexable(e2, m_tr)); in operator ()()
124 … typedef typename rtree::element_indexable_type<element_type, Translator>::type indexable_type; in apply()
165 Box box1 = rtree::elements_box<Box>(elements_copy.begin(), elements_copy.begin() + i, in apply()
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/linear/ |
| D | redistribute_elements.hpp | 32 namespace detail { namespace rtree { namespace
87 typedef typename rtree::element_indexable_type<element_type, Translator>::type indexable_type;
119 bounded_view_type bounded_indexable_0(rtree::element_indexable(elements[0], translator), in apply()
129 bounded_view_type bounded_indexable(rtree::element_indexable(elements[i], translator), in apply()
149 …bounded_view_type bounded_indexable_hl(rtree::element_indexable(elements[highest_low_index], trans… in apply()
154 bounded_view_type bounded_indexable(rtree::element_indexable(elements[i], translator), in apply()
186 typedef typename rtree::element_indexable_type<element_type, Translator>::type indexable_type;
203 …coordinate_type lowest = geometry::get<DimensionIndex>(rtree::element_indexable(elements[0], trans… in apply()
204 …coordinate_type highest = geometry::get<DimensionIndex>(rtree::element_indexable(elements[0], tran… in apply()
209 …coordinate_type coord = geometry::get<DimensionIndex>(rtree::element_indexable(elements[i], transl… in apply()
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/utilities/ |
| D | are_boxes_ok.hpp | 21 namespace boost { namespace geometry { namespace index { namespace detail { namespace rtree { names… namespace
43 typedef typename rtree::elements_type<internal_node>::type elements_type; in operator ()()
44 elements_type const& elements = rtree::elements(n); in operator ()()
62 rtree::apply_visitor(*this, *it->second); in operator ()()
71 box_type box_exp = rtree::elements_box<box_type>(elements.begin(), elements.end(), m_tr, in operator ()()
82 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
83 elements_type const& elements = rtree::elements(n); in operator ()()
94 box_type box_exp = rtree::values_box<box_type>(elements.begin(), elements.end(), m_tr, in operator ()()
|
| /third_party/flutter/skia/tests/ |
| D | RTreeTest.cpp | 76 SkRTree rtree; in DEF_TEST() local
77 REPORTER_ASSERT(reporter, 0 == rtree.getCount()); in DEF_TEST()
83 rtree.insert(rects.get(), NUM_RECTS); in DEF_TEST()
86 run_queries(reporter, rand, rects, rtree); in DEF_TEST()
87 REPORTER_ASSERT(reporter, NUM_RECTS == rtree.getCount()); in DEF_TEST()
88 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree.getDepth() && in DEF_TEST()
89 expectedDepthMax >= rtree.getDepth()); in DEF_TEST()
|