Usage for loop: as the declaration of the loop range-based for loop: as the declaration of the loop (since C++11)

iterator end(); const_iterator end() const; const_iterator cend() const; (since C++11) Returns an iterator to the element following the last element of the container. This element acts as a placeholder; attempting to access it results in undefined behavior. Parameters (none). Return value Iterator to the element following the last element. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. See also begin

Deleter& get_deleter(); (since C++11) const Deleter& get_deleter() const; (since C++11) Returns the deleter object which would be used for destruction of the managed object. Parameters (none). Return value The stored deleter object. Exceptions noexcept specification: noexcept Example #include <iostream> #include <memory> struct Foo { Foo() { std::cout << "Foo...\n"; } ~Foo() { std::cout << "~Foo...\n"; } }; struct D

Defined in header <vector> template<class Allocator> class vector<bool, Allocator>; std::vector<bool> is a space-efficient specialization of std::vector for the type bool. The manner in which std::vector<bool> is made space efficient (as well as whether it is optimized at all) is implementation defined. One potential optimization involves coalescing vector elements such that each element occupies a single bit instead of sizeof(bool) bytes. std::vect

template< class... Args > iterator emplace( const_iterator pos, Args&&... args ); (since C++11) Inserts a new element into the container directly before pos. The element is constructed through std::allocator_traits::construct, which typically uses placement-new to construct the element in-place at a location provided by the container. The arguments args... are forwarded to the constructor as std::forward<Args>(args).... If the new size() is greater than capacity(),

iterator begin(); const_iterator begin() const; const_iterator cbegin() const; (since C++11) Returns an iterator to the first element of the container. If the container is empty, the returned iterator will be equal to end(). Parameters (none). Return value Iterator to the first element. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Example See also end cend returns an iterator to the end (publ

key_equal key_eq() const; (since C++11) Returns the function that compares keys for equality. Parameters (none). Return value The key comparison function. Complexity Constant. See also hash_function returns function used to hash the keys (public member function)

protected: void init( std::basic_streambuf<CharT,Traits>* sb ); Sets the associated stream buffer to sb and initializes the internal state. The postconditions are as follows: Element Value rdbuf() sb tie() NULL rdstate() goodbit if sb is not NULL, otherwise badbit exceptions() goodbit flags() skipws | dec width() ​0​ precision() 6 fill() widen(' ') getloc() a copy of the value returned by std::locale() This member function is protected: it

T sum() const; Computes the sum of the elements. The function can be used only if operator+= is defined for type T. If the std::valarray is empty, the behavior is undefined. The order in which the elements are processed by this function is unspecified. Parameters (none). Return value The sum of the elements. Example #include <iostream> #include <valarray> int main() { std::valarray<int> a = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; std::cout << a.sum(

slice_array( const slice_array& other ); slice_array() = delete; Constructs a slice_array from another slice_array other. The default constructor is implicitly deleted. Parameters other - slice_array to initialize with