STL deque的crend方法（11）

最新推荐文章于 2023-03-26 18:00:00 发布

coderguang

最新推荐文章于 2023-03-26 18:00:00 发布

阅读量1k

点赞数

STL containers 同时被 2 个专栏收录

90 篇文章 6 订阅

订阅专栏

STL 容器接口系列译文

89 篇文章 11 订阅

订阅专栏

原文地址：http://www.cplusplus.com/reference/deque/deque/crend/

public member function

 
 <deque> 

std::deque::crend

const_reverse_iterator crend() const noexcept;

Return const_reverse_iterator to reverse end

Returns a const_reverse_iterator pointing to the theoretical element preceding the first element in the container (which is considered itsreverse end).

const_reverse_iterator指向理论上存在于数组第一个元素之前位置的元素，这个元素被认为是反向的超尾元素。

Parameters

none

Return Value

A const_reverse_iterator to the reverse end of the sequence.

返回一个const_reverse_iterator指向序列的反向超尾元素。

Member type const_reverse_iterator is a reverse random access iterator type that points to a const element (see deque member types).

迭代器属于随机迭代器。

Example

// deque::crbegin/crend
#include <iostream>
#include <deque>

int main ()
{
  std::deque<int> mydeque = {1,2,3,4,5};

  std::cout << "mydeque backwards:";
  for (auto rit = mydeque.crbegin(); rit != mydeque.crend(); ++rit)
    std::cout << ' ' << *rit;
  std::cout << '\n';

  return 0;
}

Edit & Run

Output:

mydeque backwards: 5 4 3 2 1

Complexity

Constant.

Iterator validity

No changes.

Data races

The container is accessed.
No contained elements are accessed by the call, but the iterator returned can be used to access them. Concurrently accessing or modifying different elements is safe.

容器的元素不会被访问，但是返回的迭代器可以被用来访问元素，同时访问以及修改其他元素是安全的。