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