19 General utilities library [utilities]

19.10 Memory [memory]

19.10.11 Specialized algorithms [specialized.algorithms]

19.10.11.3 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 (voidify(*first))
    typename iterator_traits<ForwardIterator>::value_type;
🔗
namespace ranges { template<no-throw-forward-iterator I, no-throw-sentinel<I> S> requires DefaultConstructible<iter_value_t<I>> I uninitialized_default_construct(I first, S last); template<no-throw-forward-range R> requires DefaultConstructible<iter_value_t<iterator_t<R>>> safe_iterator_t<R> uninitialized_default_construct(R&& r); }
2
#
Effects: Equivalent to: 
for (; first != last; ++first)
  ::new (voidify(*first)) remove_reference_t<iter_reference_t<I>>;
return first;
🔗
template<class ForwardIterator, class Size> ForwardIterator uninitialized_default_construct_n(ForwardIterator first, Size n);
3
#
Effects: Equivalent to: 
for (; n > 0; (void)++first, --n)
  ::new (voidify(*first))
    typename iterator_traits<ForwardIterator>::value_type;
return first;
🔗
namespace ranges { template<no-throw-forward-iterator I> requires DefaultConstructible<iter_value_t<I>> I uninitialized_default_construct_n(I first, iter_difference_t<I> n); }
4
#
Effects: Equivalent to: 
return uninitialized_default_construct(counted_iterator(first, n),
                                       default_sentinel).base();