Spatial C++ Library
Generic Multi-Dimensional Containers and Spatial Operations
This policy triggers rebalancing for the node when the difference in weight between left or right is more than a half. More...
|template<typename Rank >|
|bool||operator() (const Rank &, weight_type left, weight_type right) const|
|Rebalancing predicate. More...|
This policy triggers rebalancing for the node when the difference in weight between left or right is more than a half.
The default policy for rebalancing.
In effect, this policy leaves the tree roughly balanced: the path from the root to the furthest leaf is no more than twice as long as the path from the root to the nearest leaf.
This policy is adequate in many cases cause it prevents worse-case insertion or deletion time, and worst-case run-time on many search algorithms, and does not require a large amount of rebalancing.
|bool spatial::loose_balancing::operator()||(||const Rank &||,|