This header is part of the containers library. Includes <initializer_list>(C++11) Classes forward_list (since C++11) singly-linked list (class template) Functions operator==operator!=operator<operator<=operator>operator>= lexicographically compares the values in the forward_list (function template) std::swap(std::forward_list) (C++11) specializes the std::swap algorithm (function template) Synopsis namespace std { #include <initializ

Defined in header <memory> template< class InputIt, class ForwardIt > ForwardIt uninitialized_copy( InputIt first, InputIt last, ForwardIt d_first ); Copies elements from the range [first, last) to an uninitialized memory area beginning at d_first as if by. for (; first != last; ++d_first, (void) ++first) ::new (static_cast<void*>(std::addressof(*d_first))) typename iterator_traits<ForwardIterator>::value_type(*first); If an exception is thrown du

explicit basic_istringstream( ios_base::openmode mode = ios_base::in ); (1) explicit basic_istringstream( const std::basic_string<CharT,Traits,Allocator>& str, ios_base::openmode mode = ios_base::in ); (2) basic_istringstream( basic_istringstream&& other ); (3) (since C++11) Constructs new string stream. 1) Constructs new underlying string device. The underlying basic_stringbuf object is constructed as basic_stringbuf<Char,Traits,All

template< class Clock, class Duration > std::future_status wait_until( const std::chrono::time_point<Clock,Duration>& timeout_time ) const; (since C++11) wait_until waits for a result to become available. It blocks until specified timeout_time has been reached or the result becomes available, whichever comes first. The return value indicates why wait_until returned. The behavior is undefined if valid()== false before the call to this function. Parameters timeout_time

iterator begin(); (since C++11) const_iterator begin() const; (since C++11) 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 noexcept specification: noexcept Complexity Constant. Example See also end cend returns an iterator to the end (public member

Defined in header <type_traits> template< class T > struct is_standard_layout; (since C++11) If T is a standard layout type (that is, a scalar type, a standard-layout class, or an array of such type/class, possibly cv-qualified), provides the member constant value equal true. For any other type, value is false. A standard-layout class is a class that satisfies StandardLayoutType. The behavior is undefined if std::remove_all_extents_t<T> is an incomplete type and

Defined in header <regex> static constexpr std::regex_constants::syntax_option_type icase = std::regex_constants::icase; static constexpr std::regex_constants::syntax_option_type nosubs = std::regex_constants::nosubs; static constexpr std::regex_constants::syntax_option_type optimize = std::regex_constants::optimize; static constexpr std::regex_constants::syntax_option_type collate = std::regex_constants::collate; static constexpr std::regex_constants::syntax_optio

template< class Fn > class binder1st : public std::unary_function<typename Fn::second_argument_type, typename Fn::result_type> { protected: Fn op; typename Fn::first_argument_type value; public: binder1st(const Fn& fn, const typename Fn::first_argument_type& value); typename Fn::result_type operator()(const typename Fn::second_argument_type& x) const; typename Fn::result_t

This header is part of the containers library. Classes list doubly-linked list (class template) Functions operator==operator!=operator<operator<=operator>operator>= lexicographically compares the values in the list (function template) std::swap(std::list) specializes the std::swap algorithm (function template) Synopsis namespace std { #include <initializer_list> template <class T, class Allocator = allocator<T> > class list; templ

This header is part of the containers library. Includes <initializer_list> (C++11) Classes unordered_map (since C++11) collection of key-value pairs, hashed by keys, keys are unique (class template) unordered_multimap (since C++11) collection of key-value pairs, hashed by keys (class template) Functions operator==operator!= compares the values in the unordered_map (function template) std::swap(std::unordered_map) (C++11) specializes the std::swap al