Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

template<class RandomAccessIterator, class StrictWeakOrdering>
void inplaceds::remove_dynamic_sorted_vector RandomAccessIterator  first,
RandomAccessIterator  pos,
RandomAccessIterator  last,
StrictWeakOrdering  comp
 

Removes element to the dynamic sorted vector. Element to be removed is refered to by pos.

Precondition:
  • Range [first, last) must be valid dynamic sorted vector.
  • pos must be in [first, last)
Postcondition:
  • Range [first, last-1) is a valid dynamic sorted vector.
Parameters:
first RandomAccessIterator to the first element in the sequence
last RandomAccessIterator to one past the last element in the sequence
pos RandomAccessIterator to the element to be removed
comp Comparison function object
Requirements on types:

Definition at line 350 of file dynamic_sorted_vector.hpp.


Code Documentation generated Using Doxygen

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