Space Efficient Geometric Data Structures

Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann

template<class _Tp, class _Sequence = std::vector<_Tp>, class _Compare = std::less<typename _Sequence::value_type>>

void inplaceds::beap_set< _Tp, _Sequence, _Compare >::insert ( _Tp x ) [inline]

Insert element x into the beap_set.

Definition at line 94 of file beap_set.hpp.

Code Documentation generated Using Doxygen