...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
R*-tree creation algorithm parameters - run-time version.
#include <boost/geometry/index/parameters.hpp>
class dynamic_rstar
{
// ...
};
Function |
Description |
---|---|
The constructor. |
dynamic_rstar
(
size_t
max_elements
,
size_t
min_elements
= default,
size_t
reinserted_elements
= default,
size_t
overlap_cost_threshold
=32
)
explicit
Type |
Name |
Description |
---|---|---|
|
|
Maximum number of elements in nodes. |
|
|
Minimum number of elements in nodes. Default: 0.3*Max. |
|
|
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. |
|
|
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. |