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

inplaceds::beap_set< _Tp, _Sequence, _Compare >::beap_set ( const value_type * first,

const value_type * last,

const Comp & compare

) [inline]

Create a new beap_set from the copy of the range [first, last) with the given comparison functor.

Definition at line 56 of file beap_set.hpp.

Code Documentation generated Using Doxygen