std::move_if_noexcept

Defined in header <utility> template< class T > typename std::conditional< !std::is_nothrow_move_constructible<T>::value && std::is_copy_constructible<T>::value, const T&, T&& >::type move_if_noexcept(T& x); (since C++11) (until C++14) template< class T > constexpr typename std::conditional< !std::is_nothrow_move_constructible<T>::value && std::is_copy_constructible<T>::value,

std::move_backward

Defined in header <algorithm> template< class BidirIt1, class BidirIt2 > BidirIt2 move_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ); (since C++11) Moves the elements from the range [first, last), to another range ending at d_last. The elements are moved in reverse order (the last element is moved first), but their relative order is preserved. The behavior is undefined if d_last is within (first, last]. std::move must be used instead of std::move_backwar

std::move

Defined in header <algorithm> template< class InputIt, class OutputIt > OutputIt move( InputIt first, InputIt last, OutputIt d_first ); (since C++11) Moves the elements in the range [first, last), to another range beginning at d_first. After this operation the elements in the moved-from range will still contain valid values of the appropriate type, but not necessarily the same values as before the move. Parameters first, last - the range of elements to move

std::move

Defined in header <utility> template< class T > typename std::remove_reference<T>::type&& move( T&& t ); (since C++11) (until C++14) template< class T > constexpr typename std::remove_reference<T>::type&& move( T&& t ); (since C++14) std::move is used to indicate that an object t may be "moved from", i.e. allowing the efficient transfer of resources from t to another object. In particular, std::move produces an x

std::money_put::put

Defined in header <locale> public: iter_type put(iter_type out, bool intl, std::ios_base& f, char_type fill, long double quant) const; (1) iter_type put(iter_type out, bool intl, std::ios_base& f, char_type fill, const string_type& quant) const; (2) protected: virtual iter_type do_put(iter_type out, bool intl, std::ios_base& str, char_type fill, long double units) const; (3) virtual iter_type do_

std::money_put::money_put

Defined in header <locale> explicit money_put( std::size_t refs = 0 ); Creates a std::money_put facet and forwards the starting reference count refs to the base class constructor, locale::facet::facet(). Parameters refs - starting reference count

std::money_put

Defined in header <locale> template< class CharT, class OutputIt = std::ostreambuf_iterator<CharT> > class money_put; Class std::money_put encapsulates the rules for formatting monetary values as strings. The standard I/O manipulator std::put_money uses the std::money_put facet of the I/O stream's locale. Inheritance diagram. Type requirements - InputIt must meet the requirements of InputIterator. Specializations Two standalone (locale-i

std::money_get::money_get

Defined in header <locale> explicit money_get( std::size_t refs = 0 ); Creates a std::money_get facet and forwards the starting reference count refs to the base class constructor, locale::facet::facet(). Parameters refs - starting reference count

std::money_get::get

Defined in header <locale> public: iter_type get(iter_type beg, iter_type end, bool intl, std::ios_base& str, std::ios_base::iostate& err, long double& units) const; (1) iter_type get(iter_type beg, iter_type end, bool intl, std::ios_base& str, std::ios_base::iostate& err, string_type& digits) const; (2) protected: virtual iter_type do_get(iter_type beg, iter_type end, bool intl, std::ios_base& str,

std::money_get

Defined in header <locale> template< class CharT, class InputIt = std::istreambuf_iterator<CharT> > class money_get; Class template std::money_get encapsulates the rules for parsing monetary values from character streams. The standard I/O manipulator std::get_money uses the std::money_get facet of the I/O stream's locale. Inheritance diagram. Type requirements - InputIt must meet the requirements of InputIterator. Specializations Two sta