std::vector<T,Allocator>::end, std::vector<T,Allocator>::cend
來自 cppreference.com
(1) | ||
iterator end(); |
(C++11 前) | |
iterator end() noexcept; |
(C++11 起) (C++20 起為 constexpr) |
|
(2) | ||
const_iterator end() const; |
(C++11 前) | |
const_iterator end() const noexcept; |
(C++11 起) (C++20 起為 constexpr) |
|
const_iterator cend() const noexcept; |
(3) | (C++11 起) (C++20 起為 constexpr) |
返回一個迭代器,指向 vector 中最後一個元素的後一個位置。
此元素充當佔位符;嘗試訪問它將導致未定義行為。
目錄 |
[edit] 返回值
指向最後一個元素之後的迭代器。
[edit] 複雜度
常數時間。
注意
libc++ 將 cend()
反向移植到 C++98 模式。
[edit] 示例
執行此程式碼
#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.begin(), nums.end(), [](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.begin(), nums.end(), 0) << '\n'; // Prints the first fruit in the vector fruits, checking if there is any. if (!fruits.empty()) std::cout << "First fruit: " << *fruits.begin() << '\n'; if (empty.begin() == empty.end()) std::cout << "vector 'empty' is indeed empty.\n"; }
輸出
1 2 4 8 16 Sum of nums: 31 First fruit: orange vector 'empty' is indeed empty.
[edit] 參見
(C++11) |
返回指向起始的迭代器 (public member function) |
(C++11)(C++14) |
返回指向容器或陣列末尾的迭代器 (function template) |