std::deque<T,Allocator>::begin, std::deque<T,Allocator>::cbegin
来自 cppreference.com
iterator begin(); |
(1) | (从 C++11 开始是 noexcept) |
const_iterator begin() const; |
(2) | (从 C++11 开始是 noexcept) |
const_iterator cbegin() const noexcept; |
(3) | (从 C++11 开始) |
返回指向 deque
中第一个元素的迭代器。
如果 deque
为空,则返回的迭代器将等于 end().
内容 |
[编辑] 参数
(无)
[编辑] 返回值
指向第一个元素的迭代器。
[编辑] 复杂度
常数。
注释
libc++ 将 cbegin()
反向移植到 C++98 模式。
[编辑] 示例
运行此代码
#include <algorithm> #include <iostream> #include <numeric> #include <string> #include <deque> int main() { std::deque<int> nums{1, 2, 4, 8, 16}; std::deque<std::string> fruits{"orange", "apple", "raspberry"}; std::deque<char> empty; // Print deque. std::for_each(nums.begin(), nums.end(), [](const int n) { std::cout << n << ' '; }); std::cout << '\n'; // Sums all integers in the deque nums (if any), printing only the result. std::cout << "Sum of nums: " << std::accumulate(nums.begin(), nums.end(), 0) << '\n'; // Prints the first fruit in the deque fruits, checking if there is any. if (!fruits.empty()) std::cout << "First fruit: " << *fruits.begin() << '\n'; if (empty.begin() == empty.end()) std::cout << "deque 'empty' is indeed empty.\n"; }
输出
1 2 4 8 16 Sum of nums: 31 First fruit: orange deque 'empty' is indeed empty.
[编辑] 另请参见
(C++11) |
返回指向结尾的迭代器 (公有成员函数) |
(C++11)(C++14) |
返回指向容器或数组开头的迭代器 (函数模板) |