std::forward_list<T,Allocator>::begin, std::forward_list<T,Allocator>::cbegin
來自 cppreference.com
< cpp | 容器 | forward_list
iterator begin() noexcept; |
(1) | (C++11 起) |
const_iterator begin() const noexcept; |
(2) | (C++11 起) |
const_iterator cbegin() const noexcept; |
(3) | (C++11 起) |
返回指向 `forward_list` 第一個元素的迭代器。
如果 `forward_list` 為空,返回的迭代器將等於 end()。
目錄 |
[編輯] 返回值
指向第一個元素的迭代器。
[編輯] 複雜度
常數時間。
[編輯] 示例
執行此程式碼
#include <algorithm> #include <iostream> #include <numeric> #include <string> #include <forward_list> int main() { std::forward_list<int> nums{1, 2, 4, 8, 16}; std::forward_list<std::string> fruits{"orange", "apple", "raspberry"}; std::forward_list<char> empty; // Print forward_list. std::for_each(nums.begin(), nums.end(), [](const int n) { std::cout << n << ' '; }); std::cout << '\n'; // Sums all integers in the forward_list 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 forward_list fruits, checking if there is any. if (!fruits.empty()) std::cout << "First fruit: " << *fruits.begin() << '\n'; if (empty.begin() == empty.end()) std::cout << "forward_list 'empty' is indeed empty.\n"; }
輸出
1 2 4 8 16 Sum of nums: 31 First fruit: orange forward_list 'empty' is indeed empty.
[編輯] 參閱
返回指向末尾的迭代器 (public 成員函式) | |
(C++11)(C++14) |
返回指向容器或陣列開頭的迭代器 (函式模板) |