Searched refs:min_elements (Results 1 – 6 of 6) sorted by relevance
| /third_party/boost/boost/geometry/algorithms/detail/ |
| D | partition.hpp | 203 std::size_t min_elements, std::size_t level) in recurse_ok() argument
205 return boost::size(input) >= min_elements in recurse_ok()
212 std::size_t min_elements, std::size_t level) in recurse_ok() argument
214 return boost::size(input1) >= min_elements in recurse_ok()
215 && recurse_ok(input2, min_elements, level); in recurse_ok()
227 std::size_t min_elements, std::size_t level) in recurse_ok() argument
229 return boost::size(input1) >= min_elements in recurse_ok()
230 && recurse_ok(input2, input3, min_elements, level); in recurse_ok()
261 std::size_t level, std::size_t min_elements, in next_level() argument
267 if (recurse_ok(input, min_elements, level)) in next_level()
[all …]
|
| /third_party/boost/boost/geometry/index/ |
| D | parameters.hpp | 42 inline size_t default_min_elements_d_calc(size_t max_elements, size_t min_elements) in default_min_elements_d_calc() argument
44 if ( default_min_elements_d() == min_elements ) in default_min_elements_d_calc()
50 return min_elements; in default_min_elements_d_calc()
90 static const size_t min_elements = MinElements; member
110 static const size_t min_elements = MinElements; member
140 static const size_t min_elements = MinElements; member
170 size_t min_elements = detail::default_min_elements_d()) in dynamic_linear() argument
172 , m_min_elements(detail::default_min_elements_d_calc(max_elements, min_elements)) in dynamic_linear()
199 size_t min_elements = detail::default_min_elements_d()) in dynamic_quadratic() argument
201 , m_min_elements(detail::default_min_elements_d_calc(max_elements, min_elements)) in dynamic_quadratic()
[all …]
|
| /third_party/boost/libs/geometry/doc/index/generated/ |
| D | rtree_dynamic_linear.qbk | 35 `dynamic_linear``(``size_t` `max_elements``,` `size_t` `min_elements` = /default/`)`
43 [[`size_t`][ `min_elements` ][Minimum number of elements in nodes. Default: 0.3*Max. ]]
|
| D | rtree_dynamic_quadratic.qbk | 35 `dynamic_quadratic``(``size_t` `max_elements``,` `size_t` `min_elements` = /default/`)`
43 [[`size_t`][ `min_elements` ][Minimum number of elements in nodes. Default: 0.3*Max. ]]
|
| D | rtree_dynamic_rstar.qbk | 36 `size_t` `min_elements` = /default/`,`
46 [[`size_t`][ `min_elements` ][Minimum number of elements in nodes. Default: 0.3*Max. ]]
|
| /third_party/boost/boost/container/detail/ |
| D | adaptive_node_pool_impl.hpp | 642 void priv_append_from_new_blocks( size_type min_elements, multiallocation_chain &chain in priv_append_from_new_blocks() argument
650 BOOST_ASSERT(min_elements > 0); in priv_append_from_new_blocks()
651 const size_type n = (min_elements - 1)/real_num_node + 1; in priv_append_from_new_blocks()
653 const size_type target_elem_in_chain = chain.size() + min_elements; in priv_append_from_new_blocks()
678 void priv_append_from_new_blocks( size_type min_elements, multiallocation_chain &chain in priv_append_from_new_blocks() argument
685 BOOST_ASSERT(min_elements > 0); in priv_append_from_new_blocks()
686 const size_type n = (min_elements - 1)/real_num_node + 1; in priv_append_from_new_blocks()
691 const size_type target_elem_in_chain = chain.size() + min_elements; in priv_append_from_new_blocks()
|