Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

template<class RandomAccessIterator, class StrictWeakOrdering>
bool inplaceds::is_dynamic_sorted_vector RandomAccessIterator  first,
RandomAccessIterator  last,
StrictWeakOrdering  comp
 

Returns true if [first, last) is a valid dynamic sorted vector.

Parameters:
first RandomAccessIterator to the first element in the sequence
last RandomAccessIterator to the first element in the sequence
comp Comparison function object
Requirements on types:

Definition at line 138 of file dynamic_sorted_vector.hpp.


Code Documentation generated Using Doxygen

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