Space Efficient Geometric Data Structures

template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Compare_PQ, typename _Alloc = std::allocator<_Val>>

void inplaceds::block::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc >::_M_swap_nodes ( _Base_ptr a,

_Base_ptr b

) [inline]

Given two pointers, swap the nodes PQ is not affected
Definition at line 1197 of file tree.h.

Code Documentation generated Using Doxygen