std::deque::end

      iterator end();const_iterator end() const;

      iterator end() noexcept;const_iterator end() const noexcept;

Return iterator to end

Returns an iterator referring to the past-the-end element in the deque container.

The past-the-end element is the theoretical element that would follow the last element in the deque container. It does not point to any element, and thus shall not be dereferenced.

Because the ranges used by functions of the standard library do not include the element pointed by their closing iterator, this function is often used in combination with deque::begin to specify a range including all the elements in the container.

If the container is empty, this function returns the same as deque::begin.

Parameters

none

Return Value

An iterator to the element past the end of the sequence.

If the deque object is const-qualified, the function returns a const_iterator. Otherwise, it returns an iterator.

Member types iterator and const_iterator are random access iterator types (pointing to an element and to a const element, respectively).

Example

// deque::end
#include <iostream>
#include <deque>

int main ()
{
  std::deque<int> mydeque;

  for (int i=1; i<=5; i++) mydeque.insert(mydeque.end(),i);

  std::cout << "mydeque contains:";

  std::deque<int>::iterator it = mydeque.begin();

  while (it != mydeque.end() )
    std::cout << ' ' << *it++;

  std::cout << '\n';

  return 0;
}

Output:

mydeque contains: 1 2 3 4 5

Complexity

Constant.

Iterator validity

No changes.

Data races

The container is accessed (neither the const nor the non-const versions modify the container).
No contained elements are accessed by the call, but the iterator returned can be used to access or modify elements. Concurrently accessing or modifying different elements is safe.

Exception safety

No-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.

member functions

non-member overloads