std::vector<T,Allocator>::rbegin, std::vector<T,Allocator>::crbegin
来自 cppreference.cn
reverse_iterator rbegin(); |
(1) | (noexcept since C++11) (constexpr since C++20) |
const_reverse_iterator rbegin() const; |
(2) | (noexcept since C++11) (constexpr since C++20) |
const_reverse_iterator crbegin() const noexcept; |
(3) | (since C++11) (constexpr since C++20) |
返回指向反向 vector
的首个元素的反向迭代器。它对应于非反向 vector
的末尾元素。如果 vector
为空,则返回的迭代器等于 rend()。
目录 |
[编辑] 返回值
指向首个元素的反向迭代器。
[编辑] 复杂度
常数。
[编辑] 注意事项
返回的反向迭代器的底层迭代器是end 迭代器。 因此,当 end 迭代器失效时,返回的迭代器也会失效。
libc++ 向 C++98 模式反向移植了 crbegin()
。
[编辑] 示例
运行此代码
#include <algorithm> #include <iostream> #include <numeric> #include <string> #include <vector> int main() { std::vector<int> nums{1, 2, 4, 8, 16}; std::vector<std::string> fruits{"orange", "apple", "raspberry"}; std::vector<char> empty; // Print vector. std::for_each(nums.rbegin(), nums.rend(), [](const int n) { std::cout << n << ' '; }); std::cout << '\n'; // Sums all integers in the vector nums (if any), printing only the result. std::cout << "Sum of nums: " << std::accumulate(nums.rbegin(), nums.rend(), 0) << '\n'; // Prints the first fruit in the vector fruits, checking if there is any. if (!fruits.empty()) std::cout << "First fruit: " << *fruits.rbegin() << '\n'; if (empty.rbegin() == empty.rend()) std::cout << "vector 'empty' is indeed empty.\n"; }
输出
16 8 4 2 1 Sum of nums: 31 First fruit: raspberry vector 'empty' is indeed empty.
[编辑] 参见
(C++11) |
返回指向末尾的反向迭代器 (公共成员函数) |
(C++14) |
返回指向容器或数组开头的反向迭代器 (函数模板) |