Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

inplaceds::beap_set
beap_set
beap_set
bottom
c
comp
const_iterator
container_type
end
find
insert
is_empty
iterator
remove
size_type
sort
top
value_type

template<class _Tp, class _Sequence = std::vector<_Tp>, class _Compare = std::less<typename _Sequence::value_type>>
void inplaceds::beap_set< _Tp, _Sequence, _Compare >::sort (  reference  first  )  [inline]
 

Make a copy of the beap_set and store the range as a sorted containers starting at the position first

Definition at line 121 of file beap_set.hpp.

Code Documentation generated Using Doxygen

Copyright © Ilya Katz and Hervé Brönnimann, 2005, 2006.