std::flat_m...set::replace(3)

📦 version 2024.07.05, in nixpkgs unstable, opensuse-leap 16.0

💅 std::flat_m...set::replace(3) 💅

okay so bestie, this page is from the C++ Standard Libary manual, and it's literally about swapping out the underlying container for a std::flat_multiset. lowkey iconic.

✨ NAME ✨

std::flat_multiset::replace — std::flat_multiset::replace

🦋 Synopsis 🦋

void replace( container_type&& cont );  (since C++23)

She replaces the underlying container c, and it's equivalent to this move moment:

c = std::move(cont);

The elements of cont must be sorted with respect to compare. Otherwise, the behavior is undefined. 🫣🚨

🌸 Parameters 🌸

  • cont — a sorted container of type KeyContainer, the contents of which will be moved into *this

💖 Return value 💖

(none) — she gives nothing back, and honestly? mood. 💅

🔥 Complexity 🔥

Equals to complexity of std::move applied to adapted container.

🌈 Example 🌈

// Run this code

#include <algorithm>
#include <cassert>
#include <flat_set>
#include <print>
#include <vector>

int main()
{
    std::vector<int> keys{1, 2, 3};
    assert(std::ranges::is_sorted(keys));

    std::flat_multiset<int> set;
    assert(set.empty());

    set.replace(keys);
    assert(set.size() == 3);
    assert(keys.empty());

    std::println("{}", set); // set.keys()
}

🖨️ Output 🖨️

[1, 2, 3]

👀 See also 👀

  • extract — extracts the underlying container (public member function)

mwah 💋 this little love letter came from http://cppreference.com, dated 2024.06.10, and the page is std::flat_m...set::replace(3) — periodt. 🎀✨

📦 where this page comes from