Files
2025-10-25 03:02:53 +03:00

1.0 KiB
Raw Permalink Blame History

[flat.set.cons]

23 Containers library [containers]

23.6 Container adaptors [container.adaptors]

23.6.11 Class template flat_set [flat.set]

23.6.11.3 Constructors [flat.set.cons]

🔗

constexpr explicit flat_set(container_type cont, const key_compare& comp = key_compare());

1

#

Effects: Initializes c with std::move(cont) andcompare with comp, sorts the range [begin(), end()) with respect to compare, and finally erases all but the first element from each group of consecutive equivalent elements.

2

#

Complexity: Linear in N if cont is already sorted with respect to compare and otherwise NlogN, where N is the value of cont.size() before this call.