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>>
bool inplaceds::beap_set< _Tp, _Sequence, _Compare >::remove (  _Tp  x  )  [inline]
 

If element x is in the beap_set, it will be removed and true is returned. Else, false is returned.

Definition at line 103 of file beap_set.hpp.

Code Documentation generated Using Doxygen

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