iter_util.hh File Reference

#include <algorithm>
#include <iterator>

Go to the source code of this file.

Namespaces
	utility
	unresizable vector whose size is known at compile time, which may be allocated on the stack, and which indexes from 0.

Functions
template<typename BidirectionalIterator , typename T >
BidirectionalIterator	utility::find_closest (BidirectionalIterator first, BidirectionalIterator last, const T &value)
	Returns an iterator on the sorted range [first, last) nearest to value. If value is equidistant between adjacent elements, the lesser is returned. More...

Detailed Description

Author

Christopher Miles (cmile.nosp@m.s@uw.nosp@m..edu)

Definition in file iter_util.hh.