1[/ Generated by doxygen_xml2qbk 1.1.1, don't change, will be overwritten automatically] 2[/ Generated from xml/classboost_1_1geometry_1_1index_1_1dynamic__rstar.xml] 3[#classboost_1_1geometry_1_1index_1_1dynamic__rstar] 4[section boost::geometry::index::dynamic_rstar] 5 6'''<indexterm><primary>boost</primary></indexterm><indexterm><primary>geometry</primary></indexterm><indexterm><primary>index</primary></indexterm><indexterm><primary>dynamic_rstar</primary></indexterm>''' 7R*-tree creation algorithm parameters - run-time version. 8 9[heading Header] 10`#include <boost/geometry/index/parameters.hpp>` 11 12[heading Synopsis] 13[pre 14 15`class dynamic_rstar` 16`{` 17` // ...` 18`};` 19] 20 21[heading Constructor(s) and destructor] 22[table 23[[Function][Description]] 24[[[link classboost_1_1geometry_1_1index_1_1dynamic__rstar_1ad5115c769752603a179bf158f02fdb1c `dynamic_rstar(size_t)`]][The constructor. ]] 25] 26 27[#classboost_1_1geometry_1_1index_1_1dynamic__rstar_1ad5115c769752603a179bf158f02fdb1c] 28[section dynamic_rstar(size_t)] 29'''<indexterm><primary>dynamic_rstar</primary></indexterm>''' 30The constructor. 31 32[heading Synopsis] 33[pre 34 35`dynamic_rstar``(``size_t` `max_elements``,` 36 `size_t` `min_elements` = /default/`,` 37 `size_t` `reinserted_elements` = /default/`,` 38 `size_t` `overlap_cost_threshold` = `32``)` 39] 40 41[heading Modifier(s)] 42``explicit ``[heading Parameter(s)] 43[table 44[[Type][Name][Description]] 45[[`size_t`][ `max_elements` ][Maximum number of elements in nodes. ]] 46[[`size_t`][ `min_elements` ][Minimum number of elements in nodes. Default: 0.3*Max. ]] 47[[`size_t`][ `reinserted_elements` ][The number of elements reinserted by forced reinsertions algorithm. If 0 forced reinsertions are disabled. Maximum value is Max-Min+1. Greater values are truncated. Default: 0.3*Max. ]] 48[[`size_t`][ `overlap_cost_threshold` ][The number of most suitable leafs taken into account while choosing the leaf node to which currently inserted value will be added. If value is in range (0, MaxElements) - the algorithm calculates nearly minimum overlap cost, otherwise all leafs are analyzed and true minimum overlap cost is calculated. Default: 32. ]] 49] 50[endsect] 51 52[endsect] 53 54