(C++17) | ||||
Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
Associative | ||||
Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
Views | ||||
(C++20) | ||||
(C++23) | ||||
Tables | ||||
Iterator invalidation | ||||
Member function table | ||||
Non-member function table |
Member types | |||||||||||||||||||||
Member functions | |||||||||||||||||||||
Non-member functions | |||||||||||||||||||||
|
| ||||||||||||||||||||
Deduction guides(C++17) |
iterator end(); | (1) | (noexcept since C++11) (constexpr since C++26) |
const_iterator end()const; | (2) | (noexcept since C++11) (constexpr since C++26) |
const_iterator cend()constnoexcept; | (3) | (since C++11) (constexpr since C++26) |
Returns an iterator past the last element of*this.
This returned iterator only acts as a sentinel. It is not guaranteed to bedereferenceable.
Contents |
Iterator past the last element.
Constant.
libc++ backportscend()
to C++98 mode.
#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(),[](constint 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";}
Output:
1 2 4 8 16Sum of nums: 31First fruit: orangedeque 'empty' is indeed empty.
(C++11) | returns an iterator to the beginning (public member function)[edit] |
(C++11)(C++14) | returns an iterator to the end of a container or array (function template)[edit] |