| deque::end |
public member function |
iterator end ();
const_iterator end () const; |
|
Return iterator to end
Returns an iterator referring to the past-the-end element in the deque container.
Notice that, unlike member deque::back, which returns a reference to the element preceding this one, this function returns a random access iterator.
Parameters
none
Return Value
An iterator to the element past the end of the sequence.
Both iterator and const_iterator are member types. In the deque class template, these are random access iterators.
Example
// deque::end
#include <iostream>
#include <deque>
using namespace std;
int main ()
{
deque<int> mydeque;
deque<int>::iterator it;
for (int i=1; i<=5; i++) mydeque.insert(mydeque.end(),i);
cout << "mydeque contains:";
it = mydeque.begin();
while (it != mydeque.end() )
cout << " " << *it++;
cout << endl;
return 0;
}
|
Output:
mydeque contains: 1 2 3 4 5
|
Complexity
Constant.
See also
| deque::back | Access last element (public member function) |
| deque::begin | Return iterator to beginning (public member function) |
| deque::rbegin | Return reverse iterator to reverse beginning (public member function) |
| deque::rend | Return reverse iterator to reverse end (public member function) |
