std::stack::size

size_type size() const; Returns the number of elements in the underlying container, that is, c.size(). Parameters (none). Return value The number of elements in the container. Complexity Constant. See also empty checks whether the underlying container is empty (public member function)

std::regex_traits::transform_primary

template< class ForwardIt > string_type transform_primary( ForwardIt first, ForwardIt last ) const; For the character sequence [first, last), obtains the primary sort key in the imbued locale's collating order, that is, the sort key that is based on the positions of the letters and collation units in the national alphabet, ignoring case, diacritics, variants, etc. If a primary sort key compares less than another primary sort key with operator<, then the character sequence that

std::pointer_safety

Defined in header <memory> enum class pointer_safety { relaxed, preferred, strict }; (since C++11) The scoped enumeration type pointer_safety lists the pointer safety modes supported by C++ Enumeration constants pointer_safety::strict Only safely-derived pointers (pointers to objects allocated with new or subobjects thereof) may be dereferenced or deallocated. Garbage collector may be active. pointer_safety::preferred All pointers are considered val

std::vector::shrink_to_fit

void shrink_to_fit(); (since C++11) Requests the removal of unused capacity. It is a non-binding request to reduce capacity() to size(). It depends on the implementation if the request is fulfilled. All iterators, including the past the end iterator, are potentially invalidated. Parameters (none). Type requirements - T must meet the requirements of MoveInsertable. Return value (none). Complexity At most linear in the size of the container. Notes If an exception is throw

std::pop_heap

Defined in header <algorithm> template< class RandomIt > void pop_heap( RandomIt first, RandomIt last ); (1) template< class RandomIt, class Compare > void pop_heap( RandomIt first, RandomIt last, Compare comp ); (2) Swaps the value in the position first and the value in the position last-1 and makes the subrange [first, last-1) into a max heap. This has the effect of removing the first (largest) element from the heap defined by the range [first, last). Th

std::isprint(std::locale)

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

std::getline

Defined in header <string> template< class CharT, class Traits, class Allocator > std::basic_istream<CharT,Traits>& getline( std::basic_istream<CharT,Traits>& input, std::basic_string<CharT,Traits,Allocator>& str, CharT delim ); (1) template< class CharT, class Traits, class Allocator > std::basic_istream<CharT,Traits>& getline( std::basic

std::chrono::duration::operators (%=)

duration& operator+=(const duration& d); (1) duration& operator-=(const duration& d); (2) duration& operator*=(const rep& rhs); (3) duration& operator/=(const rep& rhs); (4) duration& operator%=(const rep& rhs); (5) duration& operator%=(const duration& rhs); (6) Performs compound assignments between two durations with the same period or between a duration and a tick count value. If rep_ is the member variable

std::minus&lt;void&gt;

Defined in header <functional> template<> class minus<void>; (since C++14) std::minus<> is a specialization of std::minus with parameter and return type deduced. Member types Member type Definition is_transparent /* unspecified */ Member functions operator() returns the difference of two arguments (public member function) std::minus<>::operator() template< class T, class U> constexpr auto operator()( T&& lhs

std::deque::push_front

void push_front( const T& value ); void push_front( T&& value ); (since C++11) Prepends the given element value to the beginning of the container. All iterators, including the past-the-end iterator, are invalidated. No references are invalidated. Parameters value - the value of the element to prepend Return value (none). Complexity Constant. Exceptions If an exception is thrown, this function has no effect (strong exception guarantee). See also