• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1[/ Generated by doxygen_xml2qbk 1.1.1, don't change, will be overwritten automatically]
2[/ Generated from xml/structboost_1_1geometry_1_1index_1_1rstar.xml]
3[#structboost_1_1geometry_1_1index_1_1rstar]
4[section boost::geometry::index::rstar]
5
6'''<indexterm><primary>boost</primary></indexterm><indexterm><primary>geometry</primary></indexterm><indexterm><primary>index</primary></indexterm><indexterm><primary>rstar</primary></indexterm>'''
7R*-tree creation algorithm parameters.
8
9[heading Header]
10`#include <boost/geometry/index/parameters.hpp>`
11
12[heading Synopsis]
13[pre
14`template<``size_t MaxElements``,`
15         `size_t MinElements` = /default/`,`
16         `size_t ReinsertedElements` = /default/`,`
17         `size_t OverlapCostThreshold` = `32``>`
18`struct rstar`
19`{`
20`  // ...`
21`};`
22]
23
24[heading Template parameter(s)]
25[table
26[[Parameter] [Description]]
27[[`size_t MaxElements`][Maximum number of elements in nodes. ]]
28[[`size_t MinElements`][Minimum number of elements in nodes. Default: 0.3*Max. ]]
29[[`size_t ReinsertedElements`][The number of elements reinserted by forced reinsertions algorithm. If 0 forced reinsertions are disabled. Maximum value is Max+1-Min. Greater values are truncated. Default: 0.3*Max. ]]
30[[`size_t OverlapCostThreshold`][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. ]]
31]
32
33[endsect]
34
35