void reserve( size_type new_cap ); Increase the capacity of the container to a value that's greater or equal to new_cap. If new_cap is greater than the current capacity(), new storage is allocated, otherwise the method does nothing. If new_cap is greater than capacity(), all iterators and references, including the past-the-end iterator, are invalidated. Otherwise, no iterators or references are invalidated. Parameters new_cap - new capacity of the container Type requirements

This header was originally in the C standard library as <string.h>. This header is for C-style null-terminated byte strings. Macros NULL implementation-defined null pointer constant (macro constant) Types size_t unsigned integer type returned by the sizeof operator (typedef) Functions String manipulation strcpy copies one string to another (function) strncpy copies a certain amount of characters from one string to another (function) strcat concat

Defined in header <valarray> template< class T > valarray<T> sinh( const valarray<T>& va ); For each element in va computes hyperbolic sine of the value of the element. Parameters va - value array to apply the operation to Return value Value array containing hyperbolic sine of the values in va. Notes Unqualified function (sinh) is used to perform the computation. If such function is not available, std::sinh is used due to argument depe

const Engine& base() const; (since C++11) Returns the underlying engine. Parameters (none). Return value The underlying engine. Exceptions noexcept specification: noexcept

Defined in header <map> template< class Key, class T, class Compare = std::less<Key>, class Allocator = std::allocator<std::pair<const Key, T> > > class map; std::map is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by using the comparison function Compare. Search, removal, and insertion operations have logarithmic complexity. Maps are usually implemented as red-black trees. Everywhere

void lock(); (since C++11) Locks the mutex. If another thread has already locked the mutex, a call to lock will block execution until the lock is acquired. A thread may call lock on a recursive mutex repeatedly. Ownership will only be released after the thread makes a matching number of calls to unlock. The maximum number of levels of ownership is unspecified. An exception of type std::system_error will be thrown if this number is exceeded. Prior unlock() operation on the same mutex syn

result_type max() const; (since C++11) Returns the maximum value potentially generated by the distribution. Parameters (none). Return value The maximum value potentially generated by the distribution. Complexity Constant. See also min returns the minimum potentially generated value (public member function)

Defined in header <locale> template< class charT > bool ispunct( charT ch, const locale& loc ); Checks if the given character is classified as an punctuation character by the given locale's std::ctype facet. Parameters ch - character loc - locale Return value Returns true if the character is classified as punctuation, false otherwise. Possible implementation template< class charT > bool ispunct( charT ch, const std::locale& loc )

Usage this pointer

Defined in header <locale> public: result in( StateT& state, const ExternT* from, const ExternT* from_end, const ExternT*& from_next, InternT* to, InternT* to_end, InternT*& to_next ) const; (1) protected: virtual result do_in( StateT& state, const ExternT* from, const ExternT* from_end, const ExternT*& from_next,