std::list::append_range(3)

πŸ“¦ version 2024.07.05, in nixpkgs unstable, opensuse-leap 16.0

πŸ’– std::list::append_range(3) πŸ’–

okay bestie, welcome to the C++ Standard Libary manual β€” yes, the header spells it β€œLibary” and we are respecting the lore. This page is all about std::list::append_range, and she is lowkey iconic. πŸ’…

🌸 NAME 🌸

  • std::list::append_range β€” that’s literally the name: std::list::append_range.

✨ Synopsis ✨

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

Inserts copies of elements from the range rg before end(), in non-reversing order.

No iterators or references are invalidated.

Each iterator in 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 list from *ranges::begin(rg). Otherwise, the behavior is undefined.

🫢 Return value 🫢

(none) β€” literally nothing, bestie. No notes.

πŸ“ Complexity πŸ“

Linear in size of rg. The number of calls to the constructor of T is exactly equal to the std::ranges::size(rg)).

🚨 Exceptions 🚨

If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee). Periodt. πŸ›‘οΈ

🧠 Notes 🧠

Feature-test macro:

  • __cpp_lib_containers_ranges β€” value 202202L, Std (C++23), feature: Ranges-aware construction and insertion.

πŸ“ Example πŸ“

// Run this code

#include <algorithm>
#include <cassert>
#include <list>
#include <vector>

int main()
{
    auto head = std::list{1, 2, 3, 4};
    const auto tail = std::vector{-5, -6, -7};
#ifdef __cpp_lib_containers_ranges
    head.append_range(tail);
#else
    head.insert(head.end(), tail.cbegin(), tail.cend());
#endif
    assert(std::ranges::equal(head, std::list{1, 2, 3, 4, -5, -6,
       -7}));
}

πŸ‘‘ See also πŸ‘‘

  • prepend_range β€” adds a range of elements to the beginning (C++23) (public member function).
  • insert_range β€” inserts a range of elements (C++23) (public member function).
  • push_back β€” adds an element to the end (public member function).
  • emplace_back β€” constructs an element in-place at the end (C++11) (public member function).

source/version: cppreference.com, 2024.06.10. k bye bestie, go append that range responsibly. πŸ’–βœ¨πŸŽ€

πŸ“¦ where this page comes from