Defined in header <regex> template< class BidirIt, class Alloc, class CharT, class Traits > bool regex_match( BidirIt first, BidirIt last, std::match_results<BidirIt,Alloc>& m, const std::basic_regex<CharT,Traits>& e, std::regex_constants::match_flag_type flags = std::regex_constants::match_default ); (1) (since C++11) template< class BidirIt, class

basic_fstream(); (1) explicit basic_fstream( const char* filename, ios_base::openmode mode = ios_base::in|ios_base::out ); (2) explicit basic_fstream( const string& filename, ios_base::openmode mode = ios_base::in|ios_base::out ); (3) (since C++11) basic_fstream( basic_fstream&& other ); (4) (since C++11) basic_fstream( const basic_fstream& rhs) = delete; (5) (since C++11) Constructs

void notify_one(); (since C++11) If any threads are waiting on *this, calling notify_one unblocks one of the waiting threads. Parameters (none). Return value (none). Exceptions noexcept specification: noexcept Notes The effects of notify_one()/notify_all() and wait()/wait_for()/wait_until() take place in a single total order, so it's impossible for notify_one() to, for example, be delayed and unblock a thread that started waiting just after the call to notify_one() was mad

template< class... Args > void emplace_back( Args&&... args ); (since C++11) Appends a new element to the end of the container. The element is constructed through std::allocator_traits::construct, which typically uses placement-new to construct the element in-place at the 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() then all iterators and referen

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

Defined in header <type_traits> template< class T > struct is_copy_assignable; (1) (since C++11) template< class T > struct is_trivially_copy_assignable; (2) (since C++11) template< class T > struct is_nothrow_copy_assignable; (3) (since C++11) 1) If T is not a referenceable type (i.e., possibly cv-qualified void or a function type with a cv-qualifier-seq or a ref-qualifier), provides a member constant value equal to false. Otherwise, provides

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

(1) void erase( iterator pos ); (until C++11) iterator erase( iterator pos ); (since C++17) iterator erase( const_iterator pos ); (since C++11) (2) void erase( iterator first, iterator last ); (until C++11) iterator erase( const_iterator first, const_iterator last ); (since C++11) size_type erase( const key_type& key ); (3) Removes specified elements from the container. 1) Removes the element at pos. 2) Removes the elements in the range [first; last),

protected: virtual int_type underflow() Reads the next character from the get area of the buffer. Specifically: 1) If the input sequence has a read position available (egptr() > gptr()), returns Traits::to_int_type(*gptr()) 2) Otherwise, if pptr() > egptr() (some characters were inserted into the stream since the last time overflow() changed egptr()) then extends the end of the get area to include the most recently inserted characters, by changing egptr() to equal pptr(), and t

Defined in header <memory> void declare_no_pointers( char *p, std::size_t n ); (since C++11) Informs the garbage collector or leak detector that the specified memory region (n bytes beginning at the byte pointed to by p) contains no traceable pointers. If any part of the region is within an allocated object, the entire region must be contained in the same object. Parameters p - pointer to the beginning of the range n - the number of bytes in the range Ret