Space Efficient Geometric Data Structures

Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann

template<class RandomAccessIterator>

void inplaceds::insert_dynamic_sorted_vector ( RandomAccessIterator first,

RandomAccessIterator last

) [inline]

Adds an element to the dynamic sorted vector. The element to be added to the dynamic sorted vector is at iterator (last-1) .

Precondition:

Range [first, last-1) must be valid dynamic sorted vector.

Postcondition:

Range [first, last) 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

Requirements on types:

RandomAccessIterator is a model of [http://www.sgi.com/tech/stl/RandomAccessIterator.html]

Definition at line 259 of file dynamic_sorted_vector.hpp.

Code Documentation generated Using Doxygen