Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

template<class RandomAccessIterator, class EqualityComparable>
RandomAccessIterator inplaceds::find_dynamic_sorted_vector RandomAccessIterator  first,
RandomAccessIterator  last,
const EqualityComparable &  key
 

Find the first accurance of key in the dynamic sorted vector.

The occurance of the element returned by the function may not be the first in the underlined vector

Precondition:
Requirements on types:

Definition at line 283 of file dynamic_sorted_vector.hpp.


Code Documentation generated Using Doxygen

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