19 General utilities library [utilities]

19.10 Memory [memory]

19.10.11 Specialized algorithms [specialized.algorithms]

1
#
Throughout this subclause, the names of template parameters are used to express type requirements.
  • (1.1)
    If an algorithm's template parameter is named InputIterator, the template argument shall satisfy the Cpp17InputIterator requirements ([input.iterators]).
  • (1.2)
    If an algorithm's template parameter is named ForwardIterator, the template argument shall satisfy the Cpp17ForwardIterator requirements ([forward.iterators]), and is required to have the property that no exceptions are thrown from increment, assignment, comparison, or indirection through valid iterators.
Unless otherwise specified, if an exception is thrown in the following algorithms there are no effects.

19.10.11.1 addressof [specialized.addressof]

🔗
template<class T> constexpr T* addressof(T& r) noexcept;
1
#
Returns: The actual address of the object or function referenced by r, even in the presence of an overloaded operator&.
2
#
Remarks: An expression addressof(E) is a constant subexpression if E is an lvalue constant subexpression.

19.10.11.2 uninitialized_­default_­construct [uninitialized.construct.default]

🔗
template<class ForwardIterator> void uninitialized_default_construct(ForwardIterator first, ForwardIterator last);
1
#
Effects: Equivalent to: 
for (; first != last; ++first)
  ::new (static_cast<void*>(addressof(*first)))
    typename iterator_traits<ForwardIterator>::value_type;
🔗
template<class ForwardIterator, class Size> ForwardIterator uninitialized_default_construct_n(ForwardIterator first, Size n);
2
#
Effects: Equivalent to: 
for (; n > 0; (void)++first, --n)
  ::new (static_cast<void*>(addressof(*first)))
    typename iterator_traits<ForwardIterator>::value_type;
return first;

19.10.11.3 uninitialized_­value_­construct [uninitialized.construct.value]

🔗
template<class ForwardIterator> void uninitialized_value_construct(ForwardIterator first, ForwardIterator last);
1
#
Effects: Equivalent to: 
for (; first != last; ++first)
  ::new (static_cast<void*>(addressof(*first)))
    typename iterator_traits<ForwardIterator>::value_type();
🔗
template<class ForwardIterator, class Size> ForwardIterator uninitialized_value_construct_n(ForwardIterator first, Size n);
2
#
Effects: Equivalent to: 
for (; n > 0; (void)++first, --n)
  ::new (static_cast<void*>(addressof(*first)))
    typename iterator_traits<ForwardIterator>::value_type();
return first;

19.10.11.4 uninitialized_­copy [uninitialized.copy]

🔗
template<class InputIterator, class ForwardIterator> ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator result);
1
#
Effects: As if by: 
for (; first != last; ++result, (void) ++first)
  ::new (static_cast<void*>(addressof(*result)))
    typename iterator_traits<ForwardIterator>::value_type(*first);
2
#
Returns: result.
🔗
template<class InputIterator, class Size, class ForwardIterator> ForwardIterator uninitialized_copy_n(InputIterator first, Size n, ForwardIterator result);
3
#
Effects: As if by: 
for ( ; n > 0; ++result, (void) ++first, --n) {
  ::new (static_cast<void*>(addressof(*result)))
    typename iterator_traits<ForwardIterator>::value_type(*first);
}
4
#
Returns: result.

19.10.11.5 uninitialized_­move [uninitialized.move]

🔗
template<class InputIterator, class ForwardIterator> ForwardIterator uninitialized_move(InputIterator first, InputIterator last, ForwardIterator result);
1
#
Effects: Equivalent to: 
for (; first != last; (void)++result, ++first)
  ::new (static_cast<void*>(addressof(*result)))
    typename iterator_traits<ForwardIterator>::value_type(std::move(*first));
return result;
2
#
Remarks: If an exception is thrown, some objects in the range [first, last) are left in a valid but unspecified state.
🔗
template<class InputIterator, class Size, class ForwardIterator> pair<InputIterator, ForwardIterator> uninitialized_move_n(InputIterator first, Size n, ForwardIterator result);
3
#
Effects: Equivalent to: 
for (; n > 0; ++result, (void) ++first, --n)
  ::new (static_cast<void*>(addressof(*result)))
    typename iterator_traits<ForwardIterator>::value_type(std::move(*first));
return {first,result};
4
#
Remarks: If an exception is thrown, some objects in the range [first, std​::​next(first,n)) are left in a valid but unspecified state.

19.10.11.6 uninitialized_­fill [uninitialized.fill]

🔗
template<class ForwardIterator, class T> void uninitialized_fill(ForwardIterator first, ForwardIterator last, const T& x);
1
#
Effects: As if by: 
for (; first != last; ++first)
  ::new (static_cast<void*>(addressof(*first)))
    typename iterator_traits<ForwardIterator>::value_type(x);
🔗
template<class ForwardIterator, class Size, class T> ForwardIterator uninitialized_fill_n(ForwardIterator first, Size n, const T& x);
2
#
Effects: As if by: 
for (; n--; ++first)
  ::new (static_cast<void*>(addressof(*first)))
    typename iterator_traits<ForwardIterator>::value_type(x);
return first;

19.10.11.7 destroy [specialized.destroy]

🔗
template<class T> void destroy_at(T* location);
1
#
Effects: Equivalent to: 
location->~T();
🔗
template<class ForwardIterator> void destroy(ForwardIterator first, ForwardIterator last);
2
#
Effects: Equivalent to: 
for (; first!=last; ++first)
  destroy_at(addressof(*first));
🔗
template<class ForwardIterator, class Size> ForwardIterator destroy_n(ForwardIterator first, Size n);
3
#
Effects: Equivalent to: 
for (; n > 0; (void)++first, --n)
  destroy_at(addressof(*first));
return first;