EQ2EMu/EQ2/source/depends/boost_1_72_0/libs/geometry/doc/index/generated/rtree_dynamic_rstar.qbk

[/ Generated by doxygen_xml2qbk 1.1.1, don't change, will be overwritten automatically]
[/ Generated from xml/classboost_1_1geometry_1_1index_1_1dynamic__rstar.xml]
[#classboost_1_1geometry_1_1index_1_1dynamic__rstar]
[section boost::geometry::index::dynamic_rstar]

'''<indexterm><primary>boost</primary></indexterm><indexterm><primary>geometry</primary></indexterm><indexterm><primary>index</primary></indexterm><indexterm><primary>dynamic_rstar</primary></indexterm>'''
R*-tree creation algorithm parameters - run-time version. 

[heading Header]
`#include <boost/geometry/index/parameters.hpp>`

[heading Synopsis]
[pre

`class dynamic_rstar`
`{`
`  // ...`
`};`
]

[heading Constructor(s) and destructor]
[table
[[Function][Description]]
[[[link classboost_1_1geometry_1_1index_1_1dynamic__rstar_1ad5115c769752603a179bf158f02fdb1c `dynamic_rstar(size_t)`]][The constructor. ]]
]

[#classboost_1_1geometry_1_1index_1_1dynamic__rstar_1ad5115c769752603a179bf158f02fdb1c]
[section dynamic_rstar(size_t)]
'''<indexterm><primary>dynamic_rstar</primary></indexterm>'''
The constructor. 

[heading Synopsis]
[pre

`dynamic_rstar``(``size_t` `max_elements``,`
              `size_t` `min_elements` = /default/`,`
              `size_t` `reinserted_elements` = /default/`,`
              `size_t` `overlap_cost_threshold` = `32``)`
]

[heading Modifier(s)]
``explicit ``[heading Parameter(s)]
[table 
[[Type][Name][Description]]
[[`size_t`][ `max_elements` ][Maximum number of elements in nodes. ]]
[[`size_t`][ `min_elements` ][Minimum number of elements in nodes. Default: 0.3*Max. ]]
[[`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. ]]
[[`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. ]]
]
[endsect]

[endsect]