The Linux Manuals (man pages) document is an important part of Linux documents. Linux Manuals are organized as several sections. Each section has a group of commands for a specific area in Linux usage, administration or development.
std::integer_sequence – std::integer_sequence Synopsis Defined in header <utility> template< class T, T… Ints > (since C++14) class integer_sequence; 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…
std::inserter – std::inserter Synopsis Defined in header <iterator> template< class Container > (until C++20) std::insert_iterator<Container> inserter( Container& c, typename Container::iterator i ); template< class Container > (since C++20) constexpr std::insert_iterator<Container> inserter( Container& c, ranges::iterator_t<Container> i ); inserter is a convenience function template that constructs a std::insert_iterator for the container c and its iterator i with…
std::insert_iterator<Container>::operator= – std::insert_iterator<Container>::operator= Synopsis insert_iterator<Container> &(until C++ 11) operator=(typename Container::const_reference value); insert_iterator<Container> &(since C++ 11) operator=(const typename Container::value_type &value); (until C++ 20) constexpr insert_iterator<Container> &(1)(since C++ 20) operator=(const typename Container::value_type &value); insert_iterator<Container> &(since C++ 11) operator=(typename Container::value_type &&value); (2)(until C++ 20) constexpr insert_iterator<Container> &(since C++ 20) operator=(typename Container::value_type &&value); Inserts the given value value to…
std::insert_iterator<Container>::insert_iterator – std::insert_iterator<Container>::insert_iterator Synopsis insert_iterator() = default; (1) (since C++20) insert_iterator( Container& c, typename Container::iterator i ); (2) (until C++20) constexpr insert_iterator( Container& c, ranges::iterator_t<Container> i ); (since C++20) 1) Initializes the underlying pointer to container with nullptr and value-initializes the underlying iterator. (since C++20) 2) Initializes the underlying pointer to the container to std::addressof(c)…
std::insert_iterator – std::insert_iterator Synopsis Defined in header<iterator> template <class Container> class insert_iterator : public std::iterator<std::output_iterator_tag, (until C++ 17) void, void, void, void> template <class Container> (since C++ 17) class insert_iterator; std::insert_iterator is a LegacyOutputIterator that inserts elements into a container for which it was constructed, at the position pointed to by the supplied iterator. The…
std::input_iterator_tag – Synopsis Inherited by std::forward_iterator_tag. Detailed Description Marking input iterators. Definition at line 89 of file stl_iterator_base_types.h. Author Generated automatically by Doxygen for libstdc++ from the source code.
std::input_iterator_tag,std::output_iterator_tag,std::forward_iterator_tag,std::bidirectional_iterator_tag,std::random_access_iterator_tag,std::contiguous_iterator_tag – std::input_iterator_tag,std::output_iterator_tag,std::forward_iterator_tag,std::bidirectional_iterator_tag,std::random_access_iterator_tag,std::contiguous_iterator_tag Synopsis 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 { }; struct contiguous_iterator_tag: public random_access_iterator_tag { }; (since C++20) Defines the category of an iterator. Each tag is an…
std::input_iterator_tag,std::output_iterator_tag,std::forward_iterator_tag, – std::input_iterator_tag,std::output_iterator_tag,std::forward_iterator_tag, Synopsis std::contiguous_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 { }; struct contiguous_iterator_tag : public random_access_iterator_tag { (since C++ 20) }; Defines the category of an iterator. Each tag…
std::inplace_merge – std::inplace_merge Synopsis Defined in header<algorithm> template <class BidirIt> (1) void inplace_merge(BidirIt first, BidirIt middle, BidirIt last); template <class ExecutionPolicy, class BidirIt> (2)(since C++ 17) void inplace_merge(ExecutionPolicy &&policy, BidirIt first, BidirIt middle, BidirIt last); template <class BidirIt, class Compare> (3) void inplace_merge(BidirIt first, BidirIt middle, BidirIt last, Compare comp); template <class ExecutionPolicy, class BidirIt,…
std::inner_product – std::inner_product Synopsis Defined in header <numeric> template< class InputIt1, class InputIt2, class T > T inner_product( InputIt1 first1, InputIt1 last1, (1) InputIt2 first2, T init ); template<class InputIt1, class InputIt2, class T, class BinaryOperation1, class BinaryOperation2> T inner_product( InputIt1 first1, InputIt1 last1, (2) InputIt2 first2, T init, BinaryOperation1 op1, BinaryOperation2 op2 ); Computes…
std::initializer_list<T>::size – std::initializer_list<T>::size Synopsis size_type size() const noexcept; (since C++11) (until C++14) constexpr size_type size() const noexcept; (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 Complexity Constant
std::initializer_list<T>::initializer_list – std::initializer_list<T>::initializer_list Synopsis initializer_list() noexcept; (since C++11) (until C++14) constexpr initializer_list() noexcept; (since C++14) Constructs an empty initializer list. Parameters (none) Complexity Constant Example // Run this code #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 using list-initialization std::initializer_list<int> digits{1, 2,…
std::initializer_list<T>::end – std::initializer_list<T>::end Synopsis const T *end() const noexcept; (since C++ 11)(until C++ 14) constexpr const T *end() const noexcept; (since C++ 14) Returns a pointer to one past the last element in the initializer list, i.e. begin() + size(). If the initializer list is empty, the values of begin() and end() are unspecified, but…
std::initializer_list<T>::begin – std::initializer_list<T>::begin Synopsis const T *begin() const noexcept; (since C++ 11)(until C++ 14) constexpr const T *begin() const noexcept; (since C++ 14) Returns a pointer to the first element in the initializer list. If the initializer list is empty, the values of begin() and end() are unspecified, but will be identical. Parameters (none) Return…
std::initializer_list – std::initializer_list Synopsis Defined in header <initializer_list> template< class T > (since C++11) class initializer_list; An object of type std::initializer_list<T> is a lightweight proxy object that provides access to an array of objects of type const T. A std::initializer_list object is automatically constructed when: * a braced-init-list is used to list-initialize an object, where…
std::indirect_array<T>::operator= – std::indirect_array<T>::operator= Synopsis void operator=(const T &value) const; (1) void operator=(const std::valarray<T> &val_arr) const; (2) const indirect_array & operator=(const indirect_array &sl_arr) const; (3)(since C++ 11) Assigns values to all referred elements. 1) Assigns value to all of the elements. 2) Assigns the elements of val_arr to the referred to elements of *this. 3) Assigns…
std::indirect_array<T>::~indirect_array – std::indirect_array<T>::~indirect_array Synopsis ~indirect_array(); Destroys the indexes in the array. The elements referred to by the object are not modified.
std::indirect_array – std::indirect_array Synopsis Defined in header <valarray> template< class T > class indirect_array; std::gslice_array is a helper template used by std::indirect_array subscript operator. It has reference semantics to a subset of the array specified by an indirect array (std::valarray<std::size_t> object). Member types Type Definition value_type T Member functions constructs a indirect_array constructor (public member…
std::independent_bits_engine<Engine,W,UIntType>::seed – std::independent_bits_engine<Engine,W,UIntType>::seed Synopsis void seed(); (1)(since C++ 11) void seed(result_type value); (2)(since C++ 11) template <class Sseq> (3)(since C++ 11) void seed(Sseq &seq); Reinitializes the internal state of the underlying engine using a new seed value. 1) Seeds the underlying engine with the default seed value. Effectively calls e.seed(), where e is the underlying…
std::incrementable_traits – std::incrementable_traits Synopsis Defined in header<iterator> template <class I> (1)(since C++ 20) struct incrementable_traits { }; template <class T> requires std::is_object_v<T>(2) (since C++ 20) struct incrementable_traits<T *>; template <class T> (3)(since C++ 20) struct incrementable_traits<const T> : incrementable_traits<T> { }; template <class T> requires requires { typename T::difference_type; } (4)(since C++ 20) struct incrementable_traits<T>;…