This file contains all of the general iterator-related utility functions, such as distance() and advance().
Definition in file stl_iterator_base_funcs.h.
Go to the source code of this file.
|
A generalization of pointer arithmetic.
i by n . For bidirectional and random access iterators, n may be negative, in which case i is decremented.
For random access iterators, this uses their Definition at line 172 of file stl_iterator_base_funcs.h. Referenced by std::equal_range(), std::lower_bound(), and std::upper_bound(). |
|
A generalization of pointer arithmetic.
n such that first + n == last. This requires that last must be reachable from first . Note that n may be negative.
For random access iterators, this uses their Definition at line 114 of file stl_iterator_base_funcs.h. Referenced by std::equal_range(), std::inplace_merge(), std::lower_bound(), __gnu_cxx::random_sample_n(), list::size(), and std::upper_bound(). |