Space-efficient geometric algorithms and data structures By Ilya Katz and Hervé Brönnimann

dynamic_sorted_vector.hpp File Reference

---

Detailed Description

This is a dynamic version of the a sorted vector. It supports insertion and deletion. Dynamic operations are accomplished in good amortized time by using the decomposition principle.

TODO:fix kd-tree acording to these! TODO: fix documentation

Definition in file dynamic_sorted_vector.hpp.

Go to the source code of this file.

Namespaces
namespace	inplaceds
Functions
template<class RandomAccessIterator, class StrictWeakOrdering>
void	inplaceds::build_dynamic_sorted_vector (RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp)
	Turns [first, last) into a dynamic sorted vector.
template<class RandomAccessIterator>
void	inplaceds::build_dynamic_sorted_vector (RandomAccessIterator first, RandomAccessIterator last)
	Turns [first, last) into a dynamic sorted vector.
template<class RandomAccessIterator, class StrictWeakOrdering>
bool	inplaceds::is_sorted (RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp)
	Returns true if [first, last) is a sorted range.
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.
template<class RandomAccessIterator>
bool	inplaceds::is_dynamic_sorted_vector (RandomAccessIterator first, RandomAccessIterator last)
	Returns true if [first, last) is a valid dynamic sorted vector.
template<class RandomAccessIterator, class StrictWeakOrdering>
void	inplaceds::insert_dynamic_sorted_vector (RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp)
	Adds an element to the dynamic sorted vector. The element to be added to the dynamic sorted vector is at iterator (last-1) .
template<class RandomAccessIterator>
void	inplaceds::insert_dynamic_sorted_vector (RandomAccessIterator first, RandomAccessIterator last)
	Adds an element to the dynamic sorted vector. The element to be added to the dynamic sorted vector is at iterator (last-1) .
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.
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.
template<class RandomAccessIterator>
void	inplaceds::remove_dynamic_sorted_vector (RandomAccessIterator first, RandomAccessIterator pos, RandomAccessIterator last)
	Removes element to the dynamic sorted vector. Element to be removed is refered to by pos.

---

Code Documentation generated Using Doxygen

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