rtree_rstar.qbk 1.6 KB

12345678910111213141516171819202122232425262728293031323334
  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. '''<indexterm><primary>boost</primary></indexterm><indexterm><primary>geometry</primary></indexterm><indexterm><primary>index</primary></indexterm><indexterm><primary>rstar</primary></indexterm>'''
  6. R*-tree creation algorithm parameters.
  7. [heading Header]
  8. `#include <boost/geometry/index/parameters.hpp>`
  9. [heading Synopsis]
  10. [pre
  11. `template<``size_t MaxElements``,`
  12. `size_t MinElements` = /default/`,`
  13. `size_t ReinsertedElements` = /default/`,`
  14. `size_t OverlapCostThreshold` = `32``>`
  15. `struct rstar`
  16. `{`
  17. ` // ...`
  18. `};`
  19. ]
  20. [heading Template parameter(s)]
  21. [table
  22. [[Parameter] [Description]]
  23. [[`size_t MaxElements`][Maximum number of elements in nodes. ]]
  24. [[`size_t MinElements`][Minimum number of elements in nodes. Default: 0.3*Max. ]]
  25. [[`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. ]]
  26. [[`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. ]]
  27. ]
  28. [endsect]