
- 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++ initializer_list::end() Function
The std::initializer_list::end() function return an iterator pointing to the last element in the initializer_list. This function is particularly useful for iterating over the elements of an initializer_list, providing an end marker for loops. It is used in conjunction with begin() to enable range-based operations, such as for loops that requires start and end iterators.
Syntax
Following is the syntax for std::initializer_list::end() function.
const T* end() const noexcept;
Parameters
It does not accepts any parameters
Return value
This function returns a pointer to the pst the end element in the initializer_list.
Time complexity
The time complexity of this function is Constant i.e. O(1)
Example
In the following example, we are going to consider the basic usage of the end() function.
#include <iostream> #include <initializer_list> void a(std::initializer_list < int > b) { for (auto x = b.begin(); x != b.end(); ++x) { std::cout << * x << " "; } std::cout << std::endl; } int main() { a({1,3,5}); return 0; }
Output
Output of the above code is as follows −
1 3 5
Example
Consider the following example, where we are going to find the maximum value in the initializer_list.
#include <iostream> #include <initializer_list> #include <algorithm> int a(std::initializer_list < int > b) { if (b.size() == 0) return 0; return * std::max_element(b.begin(), b.end()); } int main() { int x = a({1,3,5,2,6}); std::cout << "Result : " << x << std::endl; return 0; }
Output
Following is the output of the above code −
Result : 6
Example
Let's look at the following example, where we are going to count the total number of elements in the initializer_list.
#include <iostream> #include <initializer_list> size_t a(std::initializer_list < int > b) { return std::distance(b.begin(), b.end()); } int main() { size_t x = a({11,2,31,2}); std::cout << "Result : " << x << std::endl; return 0; }
Output
If we run the above code it will generate the following output −
Result : 4