Program termination The following functions manage program termination and resource cleanup. Defined in header <cstdlib> abort causes abnormal program termination (without cleaning up) (function) exit causes normal program termination with cleaning up (function) quick_exit (C++11) causes quick program termination without completely cleaning up (function) _Exit (C++11) causes normal program termination without cleaning up (function) atexit registers a func

template< class T, class U > std::shared_ptr<T> static_pointer_cast( const std::shared_ptr<U>& r ); (1) (since C++11) template< class T, class U > std::shared_ptr<T> dynamic_pointer_cast( const std::shared_ptr<U>& r ); (2) (since C++11) template< class T, class U > std::shared_ptr<T> const_pointer_cast( const std::shared_ptr<U>& r ); (3) (since C++11) Creates a new instance of std::shared_ptr whose managed

Defined in header <locale> (1) public: iter_type put( iter_type out, std::ios_base& str, char_type fill, bool v ) const; iter_type put( iter_type out, std::ios_base& str, char_type fill, long v ) const; iter_type put( iter_type out, std::ios_base& str, char_type fill, long long v ) const; iter_type put( iter_type out, std::ios_base& str, char_type fill, unsigned long v ) const; iter_type put( iter_type out, std::ios_base& str, char_type fi

const CharT* data() const; Returns pointer to the underlying array serving as character storage. The pointer is such that the range [data(); data() + size()) is valid and the values in it correspond to the values stored in the string. The returned array is not required to be null-terminated. If empty() returns true, the pointer is a non-null pointer that should not be dereferenced. (until C++11) The returned array is null-terminated, that is, data() and c_str() perform the same func

Defined in header <iterator> template< class CharT, class Traits = std::char_traits<CharT> > class ostreambuf_iterator : public std::iterator<std::output_iterator_tag, void, void, void, void> (until C++17) template< class CharT, class Traits = std::char_traits<CharT> > class ostreambuf_iterator; (since C++17) std::ostreambuf_iterator is a single-pass OutputIterator that writes successive ch

Defined in header <string> int stoi( const std::string& str, std::size_t* pos = 0, int base = 10 ); int stoi( const std::wstring& str, std::size_t* pos = 0, int base = 10 ); (1) (since C++11) long stol( const std::string& str, std::size_t* pos = 0, int base = 10 ); long stol( const std::wstring& str, std::size_t* pos = 0, int base = 10 ); (2) (since C++11) long long stoll( const std::string& str, std::size_t* pos = 0, int base

This header is part of the iterator library. Classes Primitives iterator_traits provides uniform interface to the properties of an iterator (class template) input_iterator_tagoutput_iterator_tagforward_iterator_tagbidirectional_iterator_tagrandom_access_iterator_tag empty class types used to indicate iterator categories (class) iterator the basic iterator (class template) Adaptors reverse_iterator iterator adaptor for reverse-order traversal (class template)

Defined in header <functional> /*see below*/ _1; /*see below*/ _2; . . /*see below*/ _N; The std::placeholders namespace contains the placeholder objects [_1, . . . _N] where N is an implementation defined maximum number. When used as an argument in a std::bind expression, the placeholder objects are stored in the generated function object, and when that function object is invoked with unbound arguments, each placeholder _N is replaced by the corresponding Nth unbound argum

reference operator[]( size_type pos ); (since C++11) const_reference operator[]( size_type pos ) const; (since C++11) (until C++14) constexpr const_reference operator[]( size_type pos ) const; (since C++14) Returns a reference to the element at specified location pos. No bounds checking is performed. Parameters pos - position of the element to return Return value Reference to the requested element. Complexity Constant. Notes Unlike std::map::operato

Defined in header <iterator> template< class InputIt > typename std::iterator_traits<InputIt>::difference_type distance( InputIt first, InputIt last ); Returns the number of elements between first and last. The behavior is undefined if last is not reachable from first by (possibly repeatedly) incrementing first. (until C++11) If InputIt is not RandomAccessIterator, the behavior is undefined if last is not reachable from first by (possibly repeatedly) inc