std::flat_set<Key,Compare,KeyContainer>:: replace

Replaces the underlying container c . Equivalent to: c = std :: move ( cont ) ; .

The elements of cont must be sorted with respect to compare , and cont must not contain equal elements. Otherwise, the behavior is undefined.

Parameters

Return value

(none)

Complexity

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

Example

#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_set<int> set;
    assert(set.empty());
 
    set.replace(keys);
    assert(set.size() == 3);
    assert(keys.empty());
 
    std::println("{}", set); // set.keys()
}

[1, 2, 3]

See also