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>>

bool inplaceds::beap_set< _Tp, _Sequence, _Compare >::is_empty ( ) [inline]

Returns true if the structure is empty.

Definition at line 73 of file beap_set.hpp.

Code Documentation generated Using Doxygen