
- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ Iterator Library - prev
Description
It returns an iterator pointing to the element that it would be pointing to if advanced -n positions.
Declaration
Following is the declaration for std::prev.
C++11
template <class BidirectionalIterator> BidirectionalIterator prev (BidirectionalIterator it, typename iterator_traits<BidirectionalIterator>::difference_type n = 1);
Parameters
it − It is a base postion in iterator.
n − It indicates about number of postion.
Return value
It returned an iterator to the element n positions before it.
Exceptions
If any of the arithmetical operations performed on the iterator throws.
Time complexity
constant for random-access iterators.
Example
The following example shows the usage of std::prev.
#include <iostream> #include <iterator> #include <list> #include <algorithm> int main () { std::list<int> mylist; for (int i = 0; i < 10; i++) mylist.push_back (i*1); std::cout << "The last element is " << *std::prev(mylist.begin()) << '\n'; return 0; }
Let us compile and run the above program, this will produce the following result −
The last element is 10
iterator.htm
Advertisements