
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <multimap>
- C++ Library - <queue>
- C++ Library - <priority_queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- The C++ Advanced Library
- C++ Library - <any>
- C++ Library - <barrier>
- C++ Library - <bit>
- C++ Library - <chrono>
- C++ Library - <cinttypes>
- C++ Library - <clocale>
- C++ Library - <condition_variable>
- C++ Library - <coroutine>
- C++ Library - <cstdlib>
- C++ Library - <cstring>
- C++ Library - <cuchar>
- C++ Library - <charconv>
- C++ Library - <cfenv>
- C++ Library - <cmath>
- C++ Library - <ccomplex>
- C++ Library - <expected>
- C++ Library - <format>
- C++ Library - <future>
- C++ Library - <flat_set>
- C++ Library - <flat_map>
- C++ Library - <filesystem>
- C++ Library - <generator>
- C++ Library - <initializer_list>
- C++ Library - <latch>
- C++ Library - <memory_resource>
- C++ Library - <mutex>
- C++ Library - <mdspan>
- C++ Library - <optional>
- C++ Library - <print>
- C++ Library - <ratio>
- C++ Library - <scoped_allocator>
- C++ Library - <semaphore>
- C++ Library - <source_location>
- C++ Library - <span>
- C++ Library - <spanstream>
- C++ Library - <stacktrace>
- C++ Library - <stop_token>
- C++ Library - <syncstream>
- C++ Library - <system_error>
- C++ Library - <string_view>
- C++ Library - <stdatomic>
- C++ Library - <variant>
- C++ STL Library Cheat Sheet
- C++ STL - Cheat Sheet
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ Deque::end() Function
The C++ std::deque::end() function is used to return an iterator pointing to the past the end element in the deque. This element acts as a placeholder and does not hold any valid value. The end() function is used to define a range that includes all the elements of the deque except the last one.
Syntax
Following is the syntax for std::deque::end() function.
iterator end() noexcept; const_iterator end() const noexcept;
Parameters
It does not accepts any parameter.
Return value
It returns an iterator pointing to the past the end element.
Exceptions
This function never throws exception.
Time complexity
The time complexity of this function is Constant i.e. O(1)
Example
Let's look at the following example, where we are going to insert the element at the end of the deque using insert() along with end().
#include <iostream> #include <deque> int main() { std::deque<char> x = {'A', 'B', 'C', 'D'}; x.insert(x.end(), 'E'); for (std::deque<char>::iterator a = x.begin(); a != x.end(); ++a) { std::cout << *a << " "; } std::cout << std::endl; return 0; }
Output
Output of the above code is as follows −
A B C D E
Example
Consider the following example, where we are going to append a range of elements from another container to the end of the deque.
#include <iostream> #include <deque> #include <vector> int main() { std::deque<char> a = {'A', 'B', 'C'}; std::vector<char> b = {'X', 'Y', 'Z'}; a.insert(a.end(), b.begin(), b.end()); for (std::deque<char>::iterator x = a.begin(); x != a.end(); ++x) { std::cout << *x << " "; } std::cout << std::endl; return 0; }
Output
Following is the output of the above code −
A B C X Y Z
Example
In the following example, we are going to erase the last element of the deque using the erase() along with end().
#include <iostream> #include <deque> int main() { std::deque<int> x = {1, 22, 333, 4444}; x.erase(x.end() - 1); for (std::deque<int>::iterator a = x.begin(); a != x.end(); ++a) { std::cout << *a << " "; } std::cout << std::endl; return 0; }
Output
If we run the above code it will generate the following output −
1 22 333