std::integral_constant

Defined in header <type_traits> template< class T, T v > struct integral_constant; (since C++11) std::integral_constant wraps a static constant of specified type. It is the base class for the C++ type traits. Helper templates A helper alias template std::bool_constant is defined for the common case where T is bool. template <bool B> using bool_constant = integral_constant<bool, B>; (since C++17) Two specializations for the type bool are provid

std::integer_sequence

Defined in header <utility> template< class T, T... Ints > class integer_sequence; (since C++14) The class template std::integer_sequence represents a compile-time sequence of integers. When used as an argument to a function template, the parameter pack Ints can be deduced and used in pack expansion. Template parameters T - an integer type to use for the elements of the sequence ...Ints - a non-type parameter pack representing the sequence Member ty

std::insert_iterator::insert_iterator

explicit insert_iterator( Container& c, typename Container::iterator i ); Initializes the underlying pointer to the container to std::addressof(c) and the interlying iterator to iter. Parameters c - container to initialize the inserter with iter - iterator to initialize the inserter with

std::insert_iterator

Defined in header <iterator> template< class Container > class insert_iterator : public std::iterator< std::output_iterator_tag, void,void,void,void > std::insert_iterator is an OutputIterator that inserts elements into a container for which it was constructed, at the position pointed to by the supplied iterator. The container's insert() member function is called whenever the iterator (whether dereferenced or not) is

std::inserter

Defined in header <iterator> template< class Container > std::insert_iterator<Container> inserter( Container& c, typename Container::iterator i ); inserter is a convenience function template that constructs a std::insert_iterator for the container c and its iterator i with the type deduced from the type of the argument. Parameters c - container that supports a insert operation i - iterator in c indicating the insertion position Return valu

std::input_iterator_tag

Defined in header <iterator> struct input_iterator_tag { }; struct output_iterator_tag { }; struct forward_iterator_tag : public input_iterator_tag { }; struct bidirectional_iterator_tag : public forward_iterator_tag { }; struct random_access_iterator_tag : public bidirectional_iterator_tag { }; Defines the category of an iterator. Each tag is an empty type and corresponds to one of the five iterator categories: input_iterator_tag corresponds to Inp

std::inplace_merge

Defined in header <algorithm> template< class BidirIt > void inplace_merge( BidirIt first, BidirIt middle, BidirIt last ); (1) template< class BidirIt, class Compare> void inplace_merge( BidirIt first, BidirIt middle, BidirIt last, Compare comp ); (2) Merges two consecutive sorted ranges [first, middle) and [middle, last) into one sorted range [first, last). The order of equal elements is guaranteed to be preserved. The first version uses operator< to c

std::inner_product

Defined in header <numeric> template< class InputIt1, class InputIt2, class T > T inner_product( InputIt1 first1, InputIt1 last1, InputIt2 first2, T value ); (1) template<class InputIt1, class InputIt2, class T, class BinaryOperation1, class BinaryOperation2> T inner_product( InputIt1 first1, InputIt1 last1, InputIt2 first2, T value, BinaryOperation1 op1, BinaryOperation2 op2 ); (2)

std::initializer_list::size

size_type size() const; (since C++11) (until C++14) constexpr size_type size() const; (since C++14) Returns the number of elements in the initializer list, i.e. std::distance(begin(), end()). Parameters (none). Return value the number of elements in the initializer list. Exceptions noexcept specification: noexcept Complexity Constant.

std::initializer_list::initializer_list

initializer_list(); (since C++11) (until C++14) constexpr initializer_list(); (since C++14) Constructs an empty initializer list. Parameters (none). Exceptions noexcept specification: noexcept Complexity Constant. Example #include <iostream> #include <initializer_list> int main() { std::initializer_list<int> empty_list; std::cout << "empty_list.size(): " << empty_list.size() << '\n'; // create initializer lists u