A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://cplusplus.com/reference/deque/deque/rend/ below:

public member function

<deque>

std::deque::rend 
      reverse_iterator rend();const_reverse_iterator rend() const;
      reverse_iterator rend() noexcept;const_reverse_iterator rend() const noexcept;

Return reverse iterator to reverse end

Returns a reverse iterator pointing to the theoretical element preceding the first element in the deque container (which is considered its reverse end).

The range between deque::rbegin and deque::rend contains all the elements of the deque container (in reverse order).



Parameters none

Return Value A reverse iterator to the reverse end of the sequence container.

If the deque object is const-qualified, the function returns a const_reverse_iterator. Otherwise, it returns a reverse_iterator.

Member types reverse_iterator and const_reverse_iterator are reverse random access iterator types (pointing to an element and to a const element, respectively). See deque member types.



Example 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// deque::rbegin/rend
#include <iostream>
#include <deque>

int main ()
{
  std::deque<int> mydeque (5);  // 5 default-constructed ints

  std::deque<int>::reverse_iterator rit = mydeque.rbegin();

  int i=0;
  for (rit = mydeque.rbegin(); rit!= mydeque.rend(); ++rit)
    *rit = ++i;

  std::cout << "mydeque contains:";
  for (std::deque<int>::iterator it = mydeque.begin(); it != mydeque.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';

  return 0;
}

Output:


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 safetyNo-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.

See also
deque::rbegin
Return reverse iterator to reverse beginning (public member function)
deque::front
Access first element (public member function)
deque::begin
Return iterator to beginning (public member function)
deque::end
Return iterator to end (public member function)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4