| /third_party/boost/boost/geometry/index/ |
| D | parameters.hpp | 93 static size_t get_min_elements() { return MinElements; } in get_min_elements() function
113 static size_t get_min_elements() { return MinElements; } in get_min_elements() function
145 static size_t get_min_elements() { return MinElements; } in get_min_elements() function
179 size_t get_min_elements() const { return m_min_elements; } in get_min_elements() function in boost::geometry::index::dynamic_linear
208 size_t get_min_elements() const { return m_min_elements; } in get_min_elements() function in boost::geometry::index::dynamic_quadratic
249 size_t get_min_elements() const { return m_min_elements; } in get_min_elements() function in boost::geometry::index::dynamic_rstar
|
| /third_party/boost/boost/geometry/index/detail/ |
| D | serialization.hpp | 86 size_t max = params->get_max_elements(), min = params->get_min_elements(); in save_construct_data()
96 if ( max != params->get_max_elements() || min != params->get_min_elements() ) in load_construct_data()
109 size_t max = params->get_max_elements(), min = params->get_min_elements(); in save_construct_data()
119 if ( max != params->get_max_elements() || min != params->get_min_elements() ) in load_construct_data()
133 , min = params->get_min_elements() in save_construct_data()
149 if ( max != params->get_max_elements() || min != params->get_min_elements() || in load_construct_data()
164 size_t max = params->get_max_elements(), min = params->get_min_elements(); in save_construct_data()
183 size_t max = params->get_max_elements(), min = params->get_min_elements(); in save_construct_data()
203 , min = params->get_min_elements() in save_construct_data()
394 …if ( elements_count < parameters.get_min_elements() || parameters.get_max_elements() < elements_co… in raw_apply()
|
| /third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
| D | remove.hpp | 121 …BOOST_GEOMETRY_INDEX_ASSERT((elements.size() < m_parameters.get_min_elements()) == m_is_underflow,… in operator ()()
174 …BOOST_GEOMETRY_INDEX_ASSERT(0 < m_parameters.get_min_elements(), "min number of elements is too sm… in operator ()()
177 m_is_underflow = elements.size() < m_parameters.get_min_elements(); in operator ()()
242 return elements.size() < m_parameters.get_min_elements(); in store_underflowed_node()
|
| D | insert.hpp | 188 … BOOST_GEOMETRY_INDEX_ASSERT(parameters.get_min_elements() <= rtree::elements(n).size() && in apply()
191 … BOOST_GEOMETRY_INDEX_ASSERT(parameters.get_min_elements() <= rtree::elements(n2).size() && in apply()
|
| /third_party/boost/boost/geometry/index/detail/rtree/rstar/ |
| D | redistribute_elements.hpp | 135 size_t const index_first = parameters.get_min_elements(); in apply()
136 size_t const index_last = parameters.get_max_elements() - parameters.get_min_elements() + 2; in apply()
442 size_t split_index = parameters.get_min_elements(); in apply()
461 …EX_ASSERT(parameters.get_min_elements() <= split_index && split_index <= parameters.get_max_elemen… in apply()
|
| D | insert.hpp | 98 …(::std::min)(parameters.get_reinserted_elements(), elements_count - parameters.get_min_elements()); in apply()
|
| /third_party/boost/libs/geometry/index/test/rtree/ |
| D | test_rtree.hpp | 1354 BOOST_CHECK(t1.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
1366 BOOST_CHECK(t1.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
1380 BOOST_CHECK(t1.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
1382 BOOST_CHECK(t2.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
1394 BOOST_CHECK(t1.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
1396 BOOST_CHECK(t2.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
1404 BOOST_CHECK(t3.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
1416 BOOST_CHECK(t1.parameters().get_min_elements() == params.get_min_elements()); in copy_swap_move()
|
| /third_party/boost/boost/geometry/index/detail/rtree/utilities/ |
| D | are_counts_ok.hpp | 88 && ( elements.size() >= m_parameters.get_min_elements() in check_count()
|
| /third_party/boost/boost/geometry/index/detail/rtree/quadratic/ |
| D | redistribute_elements.hpp | 191 if ( elements1_count + remaining <= parameters.get_min_elements() ) in apply()
195 else if ( elements2_count + remaining <= parameters.get_min_elements() ) in apply()
|
| /third_party/boost/boost/geometry/index/detail/rtree/linear/ |
| D | redistribute_elements.hpp | 404 if ( elements1.size() + remaining <= parameters.get_min_elements() ) in apply()
410 else if ( elements2.size() + remaining <= parameters.get_min_elements() ) in apply()
|
| /third_party/boost/boost/geometry/index/detail/rtree/ |
| D | pack_create.hpp | 440 res.minc = parameters.get_min_elements() * (res.maxc / parameters.get_max_elements()); in calculate_subtree_elements_counts()
|