std::vector<T,Allocator>::append_range

From cppreference.com
< cpp‎ | container‎ | vector

 
 
 
 
template< container-compatible-range<T> R >
constexpr void append_range( R&& rg );
(since C++23)

Inserts copies of elements in rg before end() in non-reversing order. Each iterator in the range rg is dereferenced exactly once.

Parameters

rg - a container compatible range, that is, an input_range whose elements are convertible to T.
Type requirements
-
T must be EmplaceConstructible into vector from *ranges::begin(rg). Also, T must be MoveInsertable into vector. Otherwise, the behavior is undefined.

Return value

(none)

Complexity

Linear in size of rg.

Notes

Feature-test macro Value Std Comment
__cpp_lib_containers_ranges 202202L (C++23) Ranges-aware construction and insertion

Example

#include <algorithm>
#include <cassert>
#include <vector>
#include <list>
 
int main()
{
    auto head = std::vector{1, 2, 3, 4};
    const auto tail = std::list{-5, -6, -7};
    head.append_range(tail);
    assert(std::ranges::equal(head, std::vector{1, 2, 3, 4, -5, -6, -7}));
}

See also

inserts a range of elements
(public member function)
adds an element to the end
(public member function)
constructs an element in-place at the end
(public member function)