Spatial C++ Library
Generic MultiDimensional Containers and Spatial Operations

A policy that balances a node if the difference in weight between left and right is higher than the current rank of the tree. More...
#include <spatial_relaxed_kdtree.hpp>
Public Member Functions  
template<typename Rank >  
bool  operator() (const Rank &rank, weight_type left, weight_type right) const 
Rebalancing predicate. More...  
A policy that balances a node if the difference in weight between left and right is higher than the current rank of the tree.
The dimension is choosen as a limiter because balancing the tree even more strictly will not have an impact on most search algorithm, since dimensions at each level of the kd tree are rotated.
Definition at line 87 of file spatial_relaxed_kdtree.hpp.
bool spatial::tight_balancing::operator()  (  const Rank &  rank, 
weight_type  left,  
weight_type  right  
)  const 
Rebalancing predicate.
rank  The current dimension function to use for examination. 
left  The weight at the left 
right  The weight at the right 
Definition at line 98 of file spatial_relaxed_kdtree.hpp.