[libcxx-commits] [libcxx] [libc++] implement std::flat_set (PR #125241)
via libcxx-commits
libcxx-commits at lists.llvm.org
Fri Jan 31 07:58:23 PST 2025
https://github.com/huixie90 updated https://github.com/llvm/llvm-project/pull/125241
>From a0f80fcd8c55154c89535488479872de34e5c8dd Mon Sep 17 00:00:00 2001
From: Hui Xie <hui.xie1990 at gmail.com>
Date: Fri, 31 Jan 2025 15:53:09 +0000
Subject: [PATCH] [libc++] implement std::flat_set
---
libcxx/include/CMakeLists.txt | 2 +
libcxx/include/__flat_set/flat_set.h | 853 ++++++++++++++++++
libcxx/include/flat_set | 59 ++
libcxx/include/module.modulemap | 11 +
.../flat.set/flat.set.capacity/empty.pass.cpp | 48 +
.../flat.set.capacity/empty.verify.cpp | 20 +
.../flat.set.capacity/max_size.pass.cpp | 63 ++
.../flat.set/flat.set.capacity/size.pass.cpp | 66 ++
.../flat.set/flat.set.cons/alloc.pass.cpp | 60 ++
.../assign_initializer_list.pass.cpp | 56 ++
.../flat.set/flat.set.cons/compare.pass.cpp | 83 ++
.../flat.set.cons/containers.pass.cpp | 158 ++++
.../flat.set/flat.set.cons/copy.pass.cpp | 64 ++
.../flat.set.cons/copy_alloc.pass.cpp | 63 ++
.../copy_assign.addressof.compile.pass.cpp | 30 +
.../flat.set.cons/copy_assign.pass.cpp | 85 ++
.../flat.set.cons/deduct.compile.pass.cpp | 49 +
.../flat.set/flat.set.cons/deduct.pass.cpp | 341 +++++++
.../flat.set.cons/deduct_pmr.pass.cpp | 94 ++
.../flat.set/flat.set.cons/default.pass.cpp | 65 ++
.../flat.set.cons/default_noexcept.pass.cpp | 58 ++
.../flat.set.cons/dtor_noexcept.pass.cpp | 57 ++
.../flat.set.cons/initializer_list.pass.cpp | 151 ++++
.../flat.set/flat.set.cons/iter_iter.pass.cpp | 136 +++
.../flat.set/flat.set.cons/move.pass.cpp | 83 ++
.../flat.set.cons/move_alloc.pass.cpp | 75 ++
.../flat.set.cons/move_assign.pass.cpp | 69 ++
.../flat.set.cons/move_assign_clears.pass.cpp | 101 +++
.../move_assign_noexcept.pass.cpp | 85 ++
.../flat.set.cons/move_exceptions.pass.cpp | 58 ++
.../flat.set.cons/move_noexcept.pass.cpp | 94 ++
.../flat.set/flat.set.cons/pmr.pass.cpp | 322 +++++++
.../flat.set/flat.set.cons/range.pass.cpp | 173 ++++
.../flat.set.cons/sorted_container.pass.cpp | 143 +++
.../sorted_initializer_list.pass.cpp | 150 +++
.../flat.set.cons/sorted_iter_iter.pass.cpp | 156 ++++
.../flat.set.erasure/erase_if.pass.cpp | 89 ++
.../erase_if_exceptions.pass.cpp | 128 +++
.../flat.set.iterators/iterator.pass.cpp | 93 ++
.../iterator_comparison.pass.cpp | 154 ++++
...rator_concept_conformance.compile.pass.cpp | 77 ++
...range_concept_conformance.compile.pass.cpp | 52 ++
.../reverse_iterator.pass.cpp | 87 ++
.../flat.set.modifiers/clear.pass.cpp | 62 ++
.../flat.set.modifiers/emplace.pass.cpp | 141 +++
.../flat.set.modifiers/emplace_hint.pass.cpp | 154 ++++
.../flat.set.modifiers/erase_iter.pass.cpp | 121 +++
.../erase_iter_iter.pass.cpp | 91 ++
.../flat.set.modifiers/erase_key.pass.cpp | 91 ++
.../erase_key_transparent.pass.cpp | 142 +++
.../flat.set.modifiers/extract.pass.cpp | 83 ++
.../flat.set.modifiers/insert_cv.pass.cpp | 78 ++
.../insert_initializer_list.pass.cpp | 67 ++
.../insert_iter_cv.pass.cpp | 74 ++
.../insert_iter_iter.pass.cpp | 87 ++
.../insert_iter_rv.pass.cpp | 73 ++
.../flat.set.modifiers/insert_range.pass.cpp | 105 +++
.../flat.set.modifiers/insert_rv.pass.cpp | 80 ++
.../insert_sorted_initializer_list.pass.cpp | 58 ++
.../insert_sorted_iter_iter.pass.cpp | 77 ++
.../insert_transparent.pass.cpp | 169 ++++
.../flat.set.modifiers/replace.pass.cpp | 72 ++
.../swap_exception.pass.cpp | 61 ++
.../flat.set.modifiers/swap_free.pass.cpp | 94 ++
.../flat.set.modifiers/swap_member.pass.cpp | 92 ++
.../flat.set/flat.set.observers/comp.pass.cpp | 72 ++
.../flat.set.operations/contains.pass.cpp | 69 ++
.../contains_transparent.pass.cpp | 70 ++
.../flat.set.operations/count.pass.cpp | 69 ++
.../count_transparent.pass.cpp | 71 ++
.../flat.set.operations/equal_range.pass.cpp | 77 ++
.../equal_range_transparent.pass.cpp | 97 ++
.../flat.set.operations/find.pass.cpp | 53 ++
.../find_transparent.pass.cpp | 88 ++
.../flat.set.operations/lower_bound.pass.cpp | 70 ++
.../lower_bound_transparent.pass.cpp | 94 ++
.../flat.set.operations/upper_bound.pass.cpp | 71 ++
.../upper_bound_transparent.pass.cpp | 93 ++
.../container.adaptors/flat.set/helpers.h | 294 ++++++
.../flat.set/incomplete_type.pass.cpp | 33 +
.../flat.set/op_compare.pass.cpp | 105 +++
.../flat.set/types.compile.pass.cpp | 94 ++
82 files changed, 8453 insertions(+)
create mode 100644 libcxx/include/__flat_set/flat_set.h
create mode 100644 libcxx/include/flat_set
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.verify.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/max_size.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/size.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/alloc.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/assign_initializer_list.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/compare.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/containers.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_alloc.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.addressof.compile.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.compile.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct_pmr.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default_noexcept.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/dtor_noexcept.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/initializer_list.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/iter_iter.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_alloc.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_clears.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_noexcept.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_exceptions.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_noexcept.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/pmr.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/range.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_container.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_initializer_list.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_iter_iter.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if_exceptions.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_comparison.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_concept_conformance.compile.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/range_concept_conformance.compile.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/reverse_iterator.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/clear.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace_hint.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter_iter.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/extract.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_cv.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_initializer_list.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_cv.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_iter.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_rv.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_range.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_rv.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_initializer_list.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_iter_iter.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/replace.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_exception.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_free.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_member.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.observers/comp.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound_transparent.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/helpers.h
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/incomplete_type.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/op_compare.pass.cpp
create mode 100644 libcxx/test/std/containers/container.adaptors/flat.set/types.compile.pass.cpp
diff --git a/libcxx/include/CMakeLists.txt b/libcxx/include/CMakeLists.txt
index 8dac823503d73f5..75acf9f7899ff66 100644
--- a/libcxx/include/CMakeLists.txt
+++ b/libcxx/include/CMakeLists.txt
@@ -367,6 +367,7 @@ set(files
__flat_map/sorted_equivalent.h
__flat_map/sorted_unique.h
__flat_map/utils.h
+ __flat_set/flat_set.h
__format/buffer.h
__format/concepts.h
__format/container_adaptor.h
@@ -986,6 +987,7 @@ set(files
fenv.h
filesystem
flat_map
+ flat_set
float.h
format
forward_list
diff --git a/libcxx/include/__flat_set/flat_set.h b/libcxx/include/__flat_set/flat_set.h
new file mode 100644
index 000000000000000..c920632c453bf5e
--- /dev/null
+++ b/libcxx/include/__flat_set/flat_set.h
@@ -0,0 +1,853 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FLAT_set_FLAT_SET_H
+#define _LIBCPP___FLAT_set_FLAT_SET_H
+
+#include <__algorithm/lexicographical_compare_three_way.h>
+#include <__algorithm/min.h>
+#include <__algorithm/ranges_adjacent_find.h>
+#include <__algorithm/ranges_equal.h>
+#include <__algorithm/ranges_inplace_merge.h>
+#include <__algorithm/ranges_lower_bound.h>
+#include <__algorithm/ranges_partition_point.h>
+#include <__algorithm/ranges_sort.h>
+#include <__algorithm/ranges_unique.h>
+#include <__algorithm/ranges_upper_bound.h>
+#include <__algorithm/remove_if.h>
+#include <__assert>
+#include <__compare/synth_three_way.h>
+#include <__concepts/swappable.h>
+#include <__config>
+#include <__cstddef/byte.h>
+#include <__cstddef/ptrdiff_t.h>
+#include <__flat_map/sorted_unique.h>
+#include <__functional/invoke.h>
+#include <__functional/is_transparent.h>
+#include <__functional/operations.h>
+#include <__fwd/vector.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/ranges_iterator_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/uses_allocator.h>
+#include <__memory/uses_allocator_construction.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/container_compatible_range.h>
+#include <__ranges/drop_view.h>
+#include <__ranges/from_range.h>
+#include <__ranges/ref_view.h>
+#include <__ranges/size.h>
+#include <__ranges/subrange.h>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/container_traits.h>
+#include <__type_traits/invoke.h>
+#include <__type_traits/is_allocator.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_same.h>
+#include <__utility/exception_guard.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/scope_guard.h>
+#include <__vector/vector.h>
+#include <initializer_list>
+#include <stdexcept>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+# pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if _LIBCPP_STD_VER >= 23
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Key, class _Compare = less<_Key>, class _KeyContainer = vector<_Key>>
+class flat_set {
+ template <class, class, class>
+ friend class flat_set;
+
+ static_assert(is_same_v<_Key, typename _KeyContainer::value_type>);
+ static_assert(!is_same_v<_KeyContainer, std::vector<bool>>, "vector<bool> is not a sequence container");
+
+public:
+ // types
+ using key_type = _Key;
+ using value_type = _Key;
+ using key_compare = __type_identity_t<_Compare>;
+ using value_compare = _Compare;
+ using reference = value_type&;
+ using const_reference = const value_type&;
+ using size_type = typename _KeyContainer::size_type;
+ using difference_type = typename _KeyContainer::difference_type;
+ using iterator = typename _KeyContainer::const_iterator;
+ using const_iterator = iterator;
+ using reverse_iterator = std::reverse_iterator<iterator>;
+ using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+ using container_type = _KeyContainer;
+
+private:
+ template <class _Allocator>
+ _LIBCPP_HIDE_FROM_ABI static constexpr bool __allocator_ctor_constraint =
+ uses_allocator<container_type, _Allocator>::value;
+
+ _LIBCPP_HIDE_FROM_ABI static constexpr bool __is_compare_transparent = __is_transparent_v<_Compare>;
+
+public:
+ // [flat.set.cons], construct/copy/destroy
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set() noexcept(is_nothrow_default_constructible_v<_KeyContainer> && is_nothrow_default_constructible_v<_Compare>)
+ : __keys_(), __compare_() {}
+
+ _LIBCPP_HIDE_FROM_ABI flat_set(const flat_set&) = default;
+
+ _LIBCPP_HIDE_FROM_ABI flat_set(flat_set&& __other) noexcept(
+ is_nothrow_move_constructible_v<_KeyContainer> && is_nothrow_move_constructible_v<_Compare>)
+# if _LIBCPP_HAS_EXCEPTIONS
+ try
+# endif // _LIBCPP_HAS_EXCEPTIONS
+ : __keys_(std::move(__other.__keys_)), __compare_(std::move(__other.__compare_)) {
+ __other.clear();
+# if _LIBCPP_HAS_EXCEPTIONS
+ } catch (...) {
+ __other.clear();
+ // gcc does not like the `throw` keyword in a conditionally noexcept function
+ if constexpr (!(is_nothrow_move_constructible_v<_KeyContainer> && is_nothrow_move_constructible_v<_Compare>)) {
+ throw;
+ }
+# endif // _LIBCPP_HAS_EXCEPTIONS
+ }
+
+ _LIBCPP_HIDE_FROM_ABI explicit flat_set(const key_compare& __comp) : __keys_(), __compare_(__comp) {}
+
+ _LIBCPP_HIDE_FROM_ABI explicit flat_set(container_type __keys, const key_compare& __comp = key_compare())
+ : __keys_(std::move(__keys)), __compare_(__comp) {
+ __sort_and_unique();
+ }
+
+ _LIBCPP_HIDE_FROM_ABI flat_set(sorted_unique_t, container_type __keys, const key_compare& __comp = key_compare())
+ : __keys_(std::move(__keys)), __compare_(__comp) {
+ _LIBCPP_ASSERT_SEMANTIC_REQUIREMENT(
+ __is_sorted_and_unique(__keys_), "Either the key container is not sorted or it contains duplicates");
+ }
+
+ template <class _InputIterator>
+ requires __has_input_iterator_category<_InputIterator>::value
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(_InputIterator __first, _InputIterator __last, const key_compare& __comp = key_compare())
+ : __keys_(), __compare_(__comp) {
+ insert(__first, __last);
+ }
+
+ template <class _InputIterator>
+ requires __has_input_iterator_category<_InputIterator>::value
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(sorted_unique_t, _InputIterator __first, _InputIterator __last, const key_compare& __comp = key_compare())
+ : __keys_(__first, __last), __compare_(__comp) {
+ _LIBCPP_ASSERT_SEMANTIC_REQUIREMENT(
+ __is_sorted_and_unique(__keys_), "Either the key container is not sorted or it contains duplicates");
+ }
+
+ template <_ContainerCompatibleRange<value_type> _Range>
+ _LIBCPP_HIDE_FROM_ABI flat_set(from_range_t, _Range&& __rg)
+ : flat_set(from_range, std::forward<_Range>(__rg), key_compare()) {}
+
+ template <_ContainerCompatibleRange<value_type> _Range>
+ _LIBCPP_HIDE_FROM_ABI flat_set(from_range_t, _Range&& __rg, const key_compare& __comp) : flat_set(__comp) {
+ insert_range(std::forward<_Range>(__rg));
+ }
+
+ _LIBCPP_HIDE_FROM_ABI flat_set(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
+ : flat_set(__il.begin(), __il.end(), __comp) {}
+
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(sorted_unique_t, initializer_list<value_type> __il, const key_compare& __comp = key_compare())
+ : flat_set(sorted_unique, __il.begin(), __il.end(), __comp) {}
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI explicit flat_set(const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc) {}
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(const key_compare& __comp, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc, __comp) {}
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(const container_type& __keys, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_tag{}, __alloc, __keys) {
+ __sort_and_unique();
+ }
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(const container_type& __keys, const key_compare& __comp, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_tag{}, __alloc, __keys, __comp) {
+ __sort_and_unique();
+ }
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(sorted_unique_t, const container_type& __keys, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_tag{}, __alloc, __keys) {
+ _LIBCPP_ASSERT_SEMANTIC_REQUIREMENT(
+ __is_sorted_and_unique(__keys_), "Either the key container is not sorted or it contains duplicates");
+ }
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(sorted_unique_t, const container_type& __keys, const key_compare& __comp, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_tag{}, __alloc, __keys, __comp) {
+ _LIBCPP_ASSERT_SEMANTIC_REQUIREMENT(
+ __is_sorted_and_unique(__keys_), "Either the key container is not sorted or it contains duplicates");
+ }
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(const flat_set& __other, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_tag{}, __alloc, __other.__keys_, __other.__compare_) {}
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(flat_set&& __other, const _Allocator& __alloc)
+# if _LIBCPP_HAS_EXCEPTIONS
+ try
+# endif // _LIBCPP_HAS_EXCEPTIONS
+ : flat_set(__ctor_uses_allocator_tag{}, __alloc, std::move(__other.__keys_), std::move(__other.__compare_)) {
+ __other.clear();
+# if _LIBCPP_HAS_EXCEPTIONS
+ } catch (...) {
+ __other.clear();
+ throw;
+# endif // _LIBCPP_HAS_EXCEPTIONS
+ }
+
+ template <class _InputIterator, class _Allocator>
+ requires(__has_input_iterator_category<_InputIterator>::value && __allocator_ctor_constraint<_Allocator>)
+ _LIBCPP_HIDE_FROM_ABI flat_set(_InputIterator __first, _InputIterator __last, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc) {
+ insert(__first, __last);
+ }
+
+ template <class _InputIterator, class _Allocator>
+ requires(__has_input_iterator_category<_InputIterator>::value && __allocator_ctor_constraint<_Allocator>)
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(_InputIterator __first, _InputIterator __last, const key_compare& __comp, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc, __comp) {
+ insert(__first, __last);
+ }
+
+ template <class _InputIterator, class _Allocator>
+ requires(__has_input_iterator_category<_InputIterator>::value && __allocator_ctor_constraint<_Allocator>)
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(sorted_unique_t, _InputIterator __first, _InputIterator __last, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc) {
+ insert(sorted_unique, __first, __last);
+ }
+
+ template <class _InputIterator, class _Allocator>
+ requires(__has_input_iterator_category<_InputIterator>::value && __allocator_ctor_constraint<_Allocator>)
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(sorted_unique_t,
+ _InputIterator __first,
+ _InputIterator __last,
+ const key_compare& __comp,
+ const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc, __comp) {
+ insert(sorted_unique, __first, __last);
+ }
+
+ template <_ContainerCompatibleRange<value_type> _Range, class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(from_range_t, _Range&& __rg, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc) {
+ insert_range(std::forward<_Range>(__rg));
+ }
+
+ template <_ContainerCompatibleRange<value_type> _Range, class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(from_range_t, _Range&& __rg, const key_compare& __comp, const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc, __comp) {
+ insert_range(std::forward<_Range>(__rg));
+ }
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(initializer_list<value_type> __il, const _Allocator& __alloc)
+ : flat_set(__il.begin(), __il.end(), __alloc) {}
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(initializer_list<value_type> __il, const key_compare& __comp, const _Allocator& __alloc)
+ : flat_set(__il.begin(), __il.end(), __comp, __alloc) {}
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(sorted_unique_t, initializer_list<value_type> __il, const _Allocator& __alloc)
+ : flat_set(sorted_unique, __il.begin(), __il.end(), __alloc) {}
+
+ template <class _Allocator>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(sorted_unique_t, initializer_list<value_type> __il, const key_compare& __comp, const _Allocator& __alloc)
+ : flat_set(sorted_unique, __il.begin(), __il.end(), __comp, __alloc) {}
+
+ _LIBCPP_HIDE_FROM_ABI flat_set& operator=(initializer_list<value_type> __il) {
+ clear();
+ insert(__il);
+ return *this;
+ }
+
+ _LIBCPP_HIDE_FROM_ABI flat_set& operator=(const flat_set&) = default;
+
+ _LIBCPP_HIDE_FROM_ABI flat_set& operator=(flat_set&& __other) noexcept(
+ is_nothrow_move_assignable_v<_KeyContainer> && is_nothrow_move_assignable_v<_Compare>) {
+ // No matter what happens, we always want to clear the other container before returning
+ // since we moved from it
+ auto __clear_other_guard = std::__make_scope_guard([&]() noexcept { __other.clear() /* noexcept */; });
+ {
+ // If an exception is thrown, we have no choice but to clear *this to preserve invariants
+ auto __on_exception = std::__make_exception_guard([&]() noexcept { clear() /* noexcept */; });
+ __keys_ = std::move(__other.__keys_);
+ __compare_ = std::move(__other.__compare_);
+ __on_exception.__complete();
+ }
+ return *this;
+ }
+
+ // iterators
+ _LIBCPP_HIDE_FROM_ABI iterator begin() noexcept { return __keys_.begin(); }
+
+ _LIBCPP_HIDE_FROM_ABI const_iterator begin() const noexcept { return __keys_.begin(); }
+
+ _LIBCPP_HIDE_FROM_ABI iterator end() noexcept { return __keys_.end(); }
+
+ _LIBCPP_HIDE_FROM_ABI const_iterator end() const noexcept { return __keys_.end(); }
+
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() noexcept { return reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const noexcept { return const_reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() noexcept { return reverse_iterator(begin()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const noexcept { return const_reverse_iterator(begin()); }
+
+ _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const noexcept { return begin(); }
+ _LIBCPP_HIDE_FROM_ABI const_iterator cend() const noexcept { return end(); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const noexcept { return const_reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const noexcept { return const_reverse_iterator(begin()); }
+
+ // [flat.set.capacity], capacity
+ [[nodiscard]] _LIBCPP_HIDE_FROM_ABI bool empty() const noexcept { return __keys_.empty(); }
+
+ _LIBCPP_HIDE_FROM_ABI size_type size() const noexcept { return __keys_.size(); }
+
+ _LIBCPP_HIDE_FROM_ABI size_type max_size() const noexcept { return __keys_.max_size(); }
+
+ // [flat.set.modifiers], modifiers
+ template <class... _Args>
+ _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> emplace(_Args&&... __args) {
+ if constexpr (sizeof...(__args) == 1 && (is_same_v<remove_cvref_t<_Args>, _Key> && ...)) {
+ return __try_emplace(std::forward<_Args>(__args)...);
+ } else {
+ return __try_emplace(_Key(std::forward<_Args>(__args)...));
+ }
+ }
+
+ template <class... _Args>
+ _LIBCPP_HIDE_FROM_ABI iterator emplace_hint(const_iterator __hint, _Args&&... __args) {
+ if constexpr (sizeof...(__args) == 1 && (is_same_v<remove_cvref_t<_Args>, _Key> && ...)) {
+ return __emplace_hint(std::move(__hint), std::forward<_Args>(__args)...);
+ } else {
+ return __emplace_hint(std::move(__hint), _Key(std::forward<_Args>(__args)...));
+ }
+ }
+
+ _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> insert(const value_type& __x) { return emplace(__x); }
+
+ _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> insert(value_type&& __x) { return emplace(std::move(__x)); }
+
+ template <class _Kp>
+ requires(__is_compare_transparent && is_constructible_v<value_type, _Kp>)
+ _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> insert(_Kp&& __x) {
+ return emplace(std::forward<_Kp>(__x));
+ }
+ _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __hint, const value_type& __x) {
+ return emplace_hint(__hint, __x);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __hint, value_type&& __x) {
+ return emplace_hint(__hint, std::move(__x));
+ }
+
+ template <class _Kp>
+ requires(__is_compare_transparent && is_constructible_v<value_type, _Kp>)
+ _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __hint, _Kp&& __x) {
+ return emplace_hint(__hint, std::forward<_Kp>(__x));
+ }
+
+ template <class _InputIterator>
+ requires __has_input_iterator_category<_InputIterator>::value
+ _LIBCPP_HIDE_FROM_ABI void insert(_InputIterator __first, _InputIterator __last) {
+ if constexpr (sized_sentinel_for<_InputIterator, _InputIterator>) {
+ __reserve(__last - __first);
+ }
+ __append_sort_merge_unique</*WasSorted = */ false>(std::move(__first), std::move(__last));
+ }
+
+ template <class _InputIterator>
+ requires __has_input_iterator_category<_InputIterator>::value
+ _LIBCPP_HIDE_FROM_ABI void insert(sorted_unique_t, _InputIterator __first, _InputIterator __last) {
+ if constexpr (sized_sentinel_for<_InputIterator, _InputIterator>) {
+ __reserve(__last - __first);
+ }
+
+ __append_sort_merge_unique</*WasSorted = */ true>(std::move(__first), std::move(__last));
+ }
+
+ template <_ContainerCompatibleRange<value_type> _Range>
+ _LIBCPP_HIDE_FROM_ABI void insert_range(_Range&& __range) {
+ if constexpr (ranges::sized_range<_Range>) {
+ __reserve(ranges::size(__range));
+ }
+
+ __append_sort_merge_unique</*WasSorted = */ false>(ranges::begin(__range), ranges::end(__range));
+ }
+
+ _LIBCPP_HIDE_FROM_ABI void insert(initializer_list<value_type> __il) { insert(__il.begin(), __il.end()); }
+
+ _LIBCPP_HIDE_FROM_ABI void insert(sorted_unique_t, initializer_list<value_type> __il) {
+ insert(sorted_unique, __il.begin(), __il.end());
+ }
+
+ _LIBCPP_HIDE_FROM_ABI container_type extract() && {
+ auto __guard = std::__make_scope_guard([&]() noexcept { clear() /* noexcept */; });
+ auto __ret = std::move(__keys_);
+ return __ret;
+ }
+
+ _LIBCPP_HIDE_FROM_ABI void replace(container_type&& __keys) {
+ _LIBCPP_ASSERT_SEMANTIC_REQUIREMENT(
+ __is_sorted_and_unique(__keys), "Either the key container is not sorted or it contains duplicates");
+ auto __guard = std::__make_exception_guard([&]() noexcept { clear() /* noexcept */; });
+ __keys_ = std::move(__keys);
+ __guard.__complete();
+ }
+
+ _LIBCPP_HIDE_FROM_ABI iterator erase(iterator __position) {
+ auto __on_failure = std::__make_exception_guard([&]() noexcept { clear() /* noexcept */; });
+ auto __key_iter = __keys_.erase(__position);
+ __on_failure.__complete();
+ return __key_iter;
+ }
+
+ // The following overload is the same as the iterator overload
+ // iterator erase(const_iterator __position);
+
+ _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __x) {
+ auto __iter = find(__x);
+ if (__iter != end()) {
+ erase(__iter);
+ return 1;
+ }
+ return 0;
+ }
+
+ template <class _Kp>
+ requires(__is_compare_transparent && !is_convertible_v<_Kp &&, iterator> &&
+ !is_convertible_v<_Kp &&, const_iterator>)
+ _LIBCPP_HIDE_FROM_ABI size_type erase(_Kp&& __x) {
+ auto [__first, __last] = equal_range(__x);
+ auto __res = __last - __first;
+ erase(__first, __last);
+ return __res;
+ }
+
+ _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __first, const_iterator __last) {
+ auto __on_failure = std::__make_exception_guard([&]() noexcept { clear() /* noexcept */; });
+ auto __key_it = __keys_.erase(__first, __last);
+ __on_failure.__complete();
+ return __key_it;
+ }
+
+ _LIBCPP_HIDE_FROM_ABI void swap(flat_set& __y) noexcept {
+ // warning: The spec has unconditional noexcept, which means that
+ // if any of the following functions throw an exception,
+ // std::terminate will be called.
+ // This is discussed in P2767, which hasn't been voted on yet.
+ ranges::swap(__compare_, __y.__compare_);
+ ranges::swap(__keys_, __y.__keys_);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI void clear() noexcept { __keys_.clear(); }
+
+ // observers
+ _LIBCPP_HIDE_FROM_ABI key_compare key_comp() const { return __compare_; }
+ _LIBCPP_HIDE_FROM_ABI value_compare value_comp() const { return __compare_; }
+
+ // set operations
+ _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __x) { return __find_impl(*this, __x); }
+
+ _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __x) const { return __find_impl(*this, __x); }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI iterator find(const _Kp& __x) {
+ return __find_impl(*this, __x);
+ }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI const_iterator find(const _Kp& __x) const {
+ return __find_impl(*this, __x);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __x) const { return contains(__x) ? 1 : 0; }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI size_type count(const _Kp& __x) const {
+ return contains(__x) ? 1 : 0;
+ }
+
+ _LIBCPP_HIDE_FROM_ABI bool contains(const key_type& __x) const { return find(__x) != end(); }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI bool contains(const _Kp& __x) const {
+ return find(__x) != end();
+ }
+
+ _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __x) {
+ return ranges::lower_bound(__keys_, __x, __compare_);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __x) const {
+ return ranges::lower_bound(__keys_, __x, __compare_);
+ }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const _Kp& __x) {
+ return ranges::lower_bound(__keys_, __x, __compare_);
+ }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const _Kp& __x) const {
+ return ranges::lower_bound(__keys_, __x, __compare_);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI iterator upper_bound(const key_type& __x) {
+ return ranges::upper_bound(__keys_, __x, __compare_);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const key_type& __x) const {
+ return ranges::upper_bound(__keys_, __x, __compare_);
+ }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI iterator upper_bound(const _Kp& __x) {
+ return ranges::upper_bound(__keys_, __x, __compare_);
+ }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const _Kp& __x) const {
+ return ranges::upper_bound(__keys_, __x, __compare_);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> equal_range(const key_type& __x) {
+ return __equal_range_impl(*this, __x);
+ }
+
+ _LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> equal_range(const key_type& __x) const {
+ return __equal_range_impl(*this, __x);
+ }
+
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> equal_range(const _Kp& __x) {
+ return __equal_range_impl(*this, __x);
+ }
+ template <class _Kp>
+ requires __is_compare_transparent
+ _LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> equal_range(const _Kp& __x) const {
+ return __equal_range_impl(*this, __x);
+ }
+
+ friend _LIBCPP_HIDE_FROM_ABI bool operator==(const flat_set& __x, const flat_set& __y) {
+ return ranges::equal(__x, __y);
+ }
+
+ friend _LIBCPP_HIDE_FROM_ABI auto operator<=>(const flat_set& __x, const flat_set& __y) {
+ return std::lexicographical_compare_three_way(
+ __x.begin(), __x.end(), __y.begin(), __y.end(), std::__synth_three_way);
+ }
+
+ friend _LIBCPP_HIDE_FROM_ABI void swap(flat_set& __x, flat_set& __y) noexcept { __x.swap(__y); }
+
+private:
+ struct __ctor_uses_allocator_tag {
+ explicit _LIBCPP_HIDE_FROM_ABI __ctor_uses_allocator_tag() = default;
+ };
+ struct __ctor_uses_allocator_empty_tag {
+ explicit _LIBCPP_HIDE_FROM_ABI __ctor_uses_allocator_empty_tag() = default;
+ };
+
+ template <class _Allocator, class _KeyCont, class... _CompArg>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI
+ flat_set(__ctor_uses_allocator_tag, const _Allocator& __alloc, _KeyCont&& __key_cont, _CompArg&&... __comp)
+ : __keys_(std::make_obj_using_allocator<container_type>(__alloc, std::forward<_KeyCont>(__key_cont))),
+ __compare_(std::forward<_CompArg>(__comp)...) {}
+
+ template <class _Allocator, class... _CompArg>
+ requires __allocator_ctor_constraint<_Allocator>
+ _LIBCPP_HIDE_FROM_ABI flat_set(__ctor_uses_allocator_empty_tag, const _Allocator& __alloc, _CompArg&&... __comp)
+ : __keys_(std::make_obj_using_allocator<container_type>(__alloc)),
+ __compare_(std::forward<_CompArg>(__comp)...) {}
+
+ _LIBCPP_HIDE_FROM_ABI bool __is_sorted_and_unique(auto&& __key_container) const {
+ auto __greater_or_equal_to = [this](const auto& __x, const auto& __y) { return !__compare_(__x, __y); };
+ return ranges::adjacent_find(__key_container, __greater_or_equal_to) == ranges::end(__key_container);
+ }
+
+ // This function is only used in constructors. So there is not exception handling in this function.
+ // If the function exits via an exception, there will be no flat_set object constructed, thus, there
+ // is no invariant state to preserve
+ _LIBCPP_HIDE_FROM_ABI void __sort_and_unique() {
+ ranges::sort(__keys_, __compare_);
+ auto __dup_start = ranges::unique(__keys_, __key_equiv(__compare_)).begin();
+ __keys_.erase(__dup_start, __keys_.end());
+ }
+
+ template <bool _WasSorted, class _InputIterator, class _Sentinel>
+ _LIBCPP_HIDE_FROM_ABI void __append_sort_merge_unique(_InputIterator __first, _Sentinel __last) {
+ auto __on_failure = std::__make_exception_guard([&]() noexcept { clear() /* noexcept */; });
+ size_type __old_size = size();
+ if constexpr (requires { __keys_.insert(__keys_.end(), std::move(__first), std::move(__last)); }) {
+ __keys_.insert(__keys_.end(), std::move(__first), std::move(__last));
+ } else {
+ for (; __first != __last; ++__first) {
+ __keys_.insert(__keys_.end(), *__first);
+ }
+ }
+ if (size() != __old_size) {
+ if constexpr (!_WasSorted) {
+ ranges::sort(__keys_.begin() + __old_size, __keys_.end(), __compare_);
+ } else {
+ _LIBCPP_ASSERT_SEMANTIC_REQUIREMENT(__is_sorted_and_unique(__keys_ | ranges::views::drop(__old_size)),
+ "Either the key container is not sorted or it contains duplicates");
+ }
+ ranges::inplace_merge(__keys_.begin(), __keys_.begin() + __old_size, __keys_.end(), __compare_);
+
+ auto __dup_start = ranges::unique(__keys_, __key_equiv(__compare_)).begin();
+ __keys_.erase(__dup_start, __keys_.end());
+ }
+ __on_failure.__complete();
+ }
+
+ template <class _Self, class _Kp>
+ _LIBCPP_HIDE_FROM_ABI static auto __find_impl(_Self&& __self, const _Kp& __key) {
+ auto __it = __self.lower_bound(__key);
+ auto __last = __self.end();
+ if (__it == __last || __self.__compare_(__key, *__it)) {
+ return __last;
+ }
+ return __it;
+ }
+
+ template <class _Self, class _Kp>
+ _LIBCPP_HIDE_FROM_ABI static auto __equal_range_impl(_Self&& __self, const _Kp& __key) {
+ auto __it = ranges::lower_bound(__self.__keys_, __key, __self.__compare_);
+ auto __last = __self.__keys_.end();
+ if (__it == __last || __self.__compare_(__key, *__it)) {
+ return std::make_pair(__it, __it);
+ }
+ return std::make_pair(__it, std::next(__it));
+ }
+
+ template <class _KeyArg>
+ _LIBCPP_HIDE_FROM_ABI iterator __emplace_exact_pos(const_iterator __it, _KeyArg&& __key) {
+ auto __on_failure = std::__make_exception_guard([&]() noexcept {
+ if constexpr (!__container_traits<_KeyContainer>::__emplacement_has_strong_exception_safety_guarantee) {
+ clear() /* noexcept */;
+ }
+ });
+ auto __key_it = __keys_.emplace(__it, std::forward<_KeyArg>(__key));
+ __on_failure.__complete();
+ return __key_it;
+ }
+
+ template <class _Kp>
+ _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __try_emplace(_Kp&& __key) {
+ auto __it = lower_bound(__key);
+ if (__it == end() || __compare_(__key, *__it)) {
+ return pair<iterator, bool>(__emplace_exact_pos(__it, std::forward<_Kp>(__key)), true);
+ } else {
+ return pair<iterator, bool>(std::move(__it), false);
+ }
+ }
+
+ template <class _Kp>
+ _LIBCPP_HIDE_FROM_ABI bool __is_hint_correct(const_iterator __hint, _Kp&& __key) {
+ if (__hint != cbegin() && !__compare_(*(__hint - 1), __key)) {
+ return false;
+ }
+ if (__hint != cend() && __compare_(*__hint, __key)) {
+ return false;
+ }
+ return true;
+ }
+
+ template <class _Kp>
+ _LIBCPP_HIDE_FROM_ABI iterator __emplace_hint(const_iterator __hint, _Kp&& __key) {
+ if (__is_hint_correct(__hint, __key)) {
+ if (__hint == cend() || __compare_(__key, *__hint)) {
+ return __emplace_exact_pos(__hint, std::forward<_Kp>(__key));
+ } else {
+ // key equals
+ return __hint;
+ }
+ } else {
+ return __try_emplace(std::forward<_Kp>(__key)).first;
+ }
+ }
+
+ _LIBCPP_HIDE_FROM_ABI void __reserve(size_t __size) {
+ if constexpr (requires { __keys_.reserve(__size); }) {
+ __keys_.reserve(__size);
+ }
+ }
+
+ template <class _Key2, class _Compare2, class _KeyContainer2, class _Predicate>
+ friend typename flat_set<_Key2, _Compare2, _KeyContainer2>::size_type
+ erase_if(flat_set<_Key2, _Compare2, _KeyContainer2>&, _Predicate);
+
+ _KeyContainer __keys_;
+ _LIBCPP_NO_UNIQUE_ADDRESS key_compare __compare_;
+
+ struct __key_equiv {
+ _LIBCPP_HIDE_FROM_ABI __key_equiv(key_compare __c) : __comp_(__c) {}
+ _LIBCPP_HIDE_FROM_ABI bool operator()(const_reference __x, const_reference __y) const {
+ return !__comp_(__x, __y) && !__comp_(__y, __x);
+ }
+ key_compare __comp_;
+ };
+};
+
+template <class _KeyContainer, class _Compare = less<typename _KeyContainer::value_type>>
+ requires(!__is_allocator<_Compare>::value && !__is_allocator<_KeyContainer>::value &&
+ is_invocable_v<const _Compare&,
+ const typename _KeyContainer::value_type&,
+ const typename _KeyContainer::value_type&>)
+flat_set(_KeyContainer, _Compare = _Compare()) -> flat_set<typename _KeyContainer::value_type, _Compare, _KeyContainer>;
+
+template <class _KeyContainer, class _Allocator>
+ requires(uses_allocator_v<_KeyContainer, _Allocator> && !__is_allocator<_KeyContainer>::value)
+flat_set(_KeyContainer, _Allocator)
+ -> flat_set<typename _KeyContainer::value_type, less<typename _KeyContainer::value_type>, _KeyContainer>;
+
+template <class _KeyContainer, class _Compare, class _Allocator>
+ requires(!__is_allocator<_Compare>::value && !__is_allocator<_KeyContainer>::value &&
+ uses_allocator_v<_KeyContainer, _Allocator> &&
+ is_invocable_v<const _Compare&,
+ const typename _KeyContainer::value_type&,
+ const typename _KeyContainer::value_type&>)
+flat_set(_KeyContainer, _Compare, _Allocator) -> flat_set<typename _KeyContainer::value_type, _Compare, _KeyContainer>;
+
+template <class _KeyContainer, class _Compare = less<typename _KeyContainer::value_type>>
+ requires(!__is_allocator<_Compare>::value && !__is_allocator<_KeyContainer>::value &&
+ is_invocable_v<const _Compare&,
+ const typename _KeyContainer::value_type&,
+ const typename _KeyContainer::value_type&>)
+flat_set(sorted_unique_t, _KeyContainer, _Compare = _Compare())
+ -> flat_set<typename _KeyContainer::value_type, _Compare, _KeyContainer>;
+
+template <class _KeyContainer, class _Allocator>
+ requires(uses_allocator_v<_KeyContainer, _Allocator> && !__is_allocator<_KeyContainer>::value)
+flat_set(sorted_unique_t, _KeyContainer, _Allocator)
+ -> flat_set<typename _KeyContainer::value_type, less<typename _KeyContainer::value_type>, _KeyContainer>;
+
+template <class _KeyContainer, class _Compare, class _Allocator>
+ requires(!__is_allocator<_Compare>::value && !__is_allocator<_KeyContainer>::value &&
+ uses_allocator_v<_KeyContainer, _Allocator> &&
+ is_invocable_v<const _Compare&,
+ const typename _KeyContainer::value_type&,
+ const typename _KeyContainer::value_type&>)
+flat_set(sorted_unique_t, _KeyContainer, _Compare, _Allocator)
+ -> flat_set<typename _KeyContainer::value_type, _Compare, _KeyContainer>;
+
+template <class _InputIterator, class _Compare = less<__iter_value_type<_InputIterator>>>
+ requires(__has_input_iterator_category<_InputIterator>::value && !__is_allocator<_Compare>::value)
+flat_set(_InputIterator, _InputIterator, _Compare = _Compare())
+ -> flat_set<__iter_value_type<_InputIterator>, _Compare>;
+
+template <class _InputIterator, class _Compare = less<__iter_value_type<_InputIterator>>>
+ requires(__has_input_iterator_category<_InputIterator>::value && !__is_allocator<_Compare>::value)
+flat_set(sorted_unique_t, _InputIterator, _InputIterator, _Compare = _Compare())
+ -> flat_set<__iter_value_type<_InputIterator>, _Compare>;
+
+template <ranges::input_range _Range,
+ class _Compare = less<ranges::range_value_t<_Range>>,
+ class _Allocator = allocator<byte>,
+ class = __enable_if_t<!__is_allocator<_Compare>::value && __is_allocator<_Allocator>::value>>
+flat_set(from_range_t, _Range&&, _Compare = _Compare(), _Allocator = _Allocator()) -> flat_set<
+ ranges::range_value_t<_Range>,
+ _Compare,
+ vector<ranges::range_value_t<_Range>, __allocator_traits_rebind_t<_Allocator, ranges::range_value_t<_Range>>>>;
+
+template <ranges::input_range _Range, class _Allocator, class = __enable_if_t<__is_allocator<_Allocator>::value>>
+flat_set(from_range_t, _Range&&, _Allocator) -> flat_set<
+ ranges::range_value_t<_Range>,
+ less<ranges::range_value_t<_Range>>,
+ vector<ranges::range_value_t<_Range>, __allocator_traits_rebind_t<_Allocator, ranges::range_value_t<_Range>>>>;
+
+template <class _Key, class _Compare = less<_Key>>
+ requires(!__is_allocator<_Compare>::value)
+flat_set(initializer_list<_Key>, _Compare = _Compare()) -> flat_set<_Key, _Compare>;
+
+template <class _Key, class _Compare = less<_Key>>
+ requires(!__is_allocator<_Compare>::value)
+flat_set(sorted_unique_t, initializer_list<_Key>, _Compare = _Compare()) -> flat_set<_Key, _Compare>;
+
+template <class _Key, class _Compare, class _KeyContainer, class _Allocator>
+struct uses_allocator<flat_set<_Key, _Compare, _KeyContainer>, _Allocator>
+ : bool_constant<uses_allocator_v<_KeyContainer, _Allocator>> {};
+
+ template <class _Key, class _Compare, class _KeyContainer, class _Predicate>
+ _LIBCPP_HIDE_FROM_ABI typename flat_set<_Key, _Compare, _KeyContainer>::size_type
+ erase_if(flat_set<_Key, _Compare, _KeyContainer>& __flat_set, _Predicate __pred) {
+ auto __guard = std::__make_exception_guard([&] { __flat_set.clear(); });
+ auto __it = std::remove_if(__flat_set.__keys_.begin(), __flat_set.__keys_.end(), [&](const auto& e) -> bool {
+ return static_cast<bool>(__pred(e));
+ });
+ auto __res = __flat_set.__keys_.end() - __it;
+ __flat_set.__keys_.erase(__it, __flat_set.__keys_.end());
+ __guard.__complete();
+ return __res;
+ }
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 23
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___FLAT_set_FLAT_SET_H
diff --git a/libcxx/include/flat_set b/libcxx/include/flat_set
new file mode 100644
index 000000000000000..d03645fafafdba0
--- /dev/null
+++ b/libcxx/include/flat_set
@@ -0,0 +1,59 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FLAT_SET
+#define _LIBCPP_FLAT_SET
+
+/*
+ Header <flat_set> synopsis
+
+#include <compare> // see [compare.syn]
+#include <initializer_list> // see [initializer.list.syn]
+
+namespace std {
+ // [flat.set], class template flat_set
+ template<class Key, class Compare = less<Key>, class KeyContainer = vector<Key>>
+ class flat_set;
+
+ struct sorted_unique_t { explicit sorted_unique_t() = default; };
+ inline constexpr sorted_unique_t sorted_unique{};
+
+ template<class Key, class Compare, class KeyContainer, class Allocator>
+ struct uses_allocator<flat_set<Key, Compare, KeyContainer>, Allocator>;
+
+ // [flat.set.erasure], erasure for flat_set
+ template<class Key, class Compare, class KeyContainer, class Predicate>
+ typename flat_set<Key, Compare, KeyContainer>::size_type
+ erase_if(flat_set<Key, Compare, KeyContainer>& c, Predicate pred);
+}
+*/
+
+#if __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS)
+# include <__cxx03/__config>
+#else
+# include <__config>
+
+# if _LIBCPP_STD_VER >= 23
+# include <__flat_map/sorted_unique.h>
+# include <__flat_set/flat_set.h>
+# endif
+
+// for feature-test macros
+# include <version>
+
+// standard required includes
+# include <compare>
+# include <initializer_list>
+
+# if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+# pragma GCC system_header
+# endif
+#endif // __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS)
+
+#endif // _LIBCPP_FLAT_SET
diff --git a/libcxx/include/module.modulemap b/libcxx/include/module.modulemap
index 4bae02137b37b21..abc351d5923963d 100644
--- a/libcxx/include/module.modulemap
+++ b/libcxx/include/module.modulemap
@@ -1263,6 +1263,17 @@ module std [system] {
export *
}
+ module flat_set {
+ module flat_set {
+ header "__flat_set/flat_set.h"
+ export std.vector.vector
+ export std.vector.fwd
+ }
+
+ header "flat_set"
+ export *
+ }
+
module format {
module buffer {
header "__format/buffer.h"
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.pass.cpp
new file mode 100644
index 000000000000000..204df1d681af1bc
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.pass.cpp
@@ -0,0 +1,48 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// [[nodiscard]] bool empty() const noexcept;
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<int>, KeyContainer>;
+ M m;
+ ASSERT_SAME_TYPE(decltype(m.empty()), bool);
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ assert(std::as_const(m).empty());
+ m = {1};
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.verify.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.verify.cpp
new file mode 100644
index 000000000000000..161fe533eabacb0
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.verify.cpp
@@ -0,0 +1,20 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// [[nodiscard]] bool empty() const noexcept;
+
+#include <flat_set>
+
+void f() {
+ std::flat_set<int> c;
+ c.empty(); // expected-warning {{ignoring return value of function declared with 'nodiscard' attribute}}
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/max_size.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/max_size.pass.cpp
new file mode 100644
index 000000000000000..cd7f424e00ece23
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/max_size.pass.cpp
@@ -0,0 +1,63 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// size_type max_size() const noexcept;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <limits>
+#include <type_traits>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "test_allocator.h"
+#include "test_macros.h"
+
+int main(int, char**) {
+ {
+ using A1 = limited_allocator<int, 10>;
+ using C = std::flat_set<int, std::less<int>, std::vector<int, A1>>;
+ ASSERT_SAME_TYPE(C::difference_type, std::ptrdiff_t);
+ ASSERT_SAME_TYPE(C::size_type, std::size_t);
+ const C c;
+ ASSERT_NOEXCEPT(c.max_size());
+ ASSERT_SAME_TYPE(decltype(c.max_size()), C::size_type);
+ assert(c.max_size() <= 10);
+ LIBCPP_ASSERT(c.max_size() == 10);
+ }
+ {
+ using A = limited_allocator<int, (size_t)-1>;
+ using C = std::flat_set<int, std::less<int>, std::vector<int, A>>;
+ ASSERT_SAME_TYPE(C::difference_type, std::ptrdiff_t);
+ ASSERT_SAME_TYPE(C::size_type, std::size_t);
+ const C::size_type max_dist = static_cast<C::size_type>(std::numeric_limits<C::difference_type>::max());
+ const C c;
+ ASSERT_NOEXCEPT(c.max_size());
+ ASSERT_SAME_TYPE(decltype(c.max_size()), C::size_type);
+ assert(c.max_size() <= max_dist);
+ LIBCPP_ASSERT(c.max_size() == max_dist);
+ }
+ {
+ typedef std::flat_set<char> C;
+ ASSERT_SAME_TYPE(C::difference_type, std::ptrdiff_t);
+ ASSERT_SAME_TYPE(C::size_type, std::size_t);
+ const C::size_type max_dist = static_cast<C::size_type>(std::numeric_limits<C::difference_type>::max());
+ const C c;
+ ASSERT_NOEXCEPT(c.max_size());
+ ASSERT_SAME_TYPE(decltype(c.max_size()), C::size_type);
+ assert(c.max_size() <= max_dist);
+ assert(c.max_size() <= alloc_max_size(std::allocator<char>()));
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/size.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/size.pass.cpp
new file mode 100644
index 000000000000000..7c156e95ecb1c86
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/size.pass.cpp
@@ -0,0 +1,66 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// size_type size() const noexcept;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using M = std::flat_set<int, std::less<int>, KeyContainer>;
+ using S = typename M::size_type;
+ {
+ const M m = {1, 1, 4, 5, 5};
+ ASSERT_SAME_TYPE(decltype(m.size()), S);
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 3);
+ }
+ {
+ const M m = {1};
+ ASSERT_SAME_TYPE(decltype(m.size()), S);
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 1);
+ }
+ {
+ const M m;
+ ASSERT_SAME_TYPE(decltype(m.size()), S);
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ }
+ {
+ M m;
+ S s = 1000000;
+ for (auto i = 0u; i < s; ++i) {
+ m.emplace(i);
+ }
+ ASSERT_SAME_TYPE(decltype(m.size()), S);
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == s);
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/alloc.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/alloc.pass.cpp
new file mode 100644
index 000000000000000..acc0817d7cac4d6
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/alloc.pass.cpp
@@ -0,0 +1,60 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class Allocator>
+// explicit flat_set(const Allocator& a);
+
+#include <cassert>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "test_macros.h"
+#include "test_allocator.h"
+#include "../../../test_compare.h"
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ static_assert(std::is_constructible_v<M1, const A1&>);
+ static_assert(std::is_constructible_v<M2, const A2&>);
+ static_assert(!std::is_constructible_v<M1, const A2&>);
+ static_assert(!std::is_constructible_v<M2, const A1&>);
+ }
+ {
+ // explicit
+ using M = std::flat_set<int, std::less<int>, std::vector<int, test_allocator<int>>>;
+
+ static_assert(std::is_constructible_v<M, test_allocator<int>>);
+ static_assert(!std::is_convertible_v<test_allocator<int>, M>);
+ }
+ {
+ using A = test_allocator<short>;
+ using M = std::flat_set<int, std::less<int>, std::vector<int, test_allocator<int>>>;
+ M m(A(0, 5));
+ assert(m.empty());
+ assert(m.begin() == m.end());
+ auto v = std::move(m).extract();
+ assert(v.get_allocator().get_id() == 5);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/assign_initializer_list.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/assign_initializer_list.pass.cpp
new file mode 100644
index 000000000000000..7f75f1e1611e3b4
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/assign_initializer_list.pass.cpp
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set& operator=(initializer_list<value_type> il);
+
+#include <algorithm>
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ {
+ M m = {8, 10};
+ assert(m.size() == 2);
+ m = {3, 1, 2, 2, 3, 4, 3, 5, 6, 5};
+ int expected[] = {1, 2, 3, 4, 5, 6};
+ assert(std::ranges::equal(m, expected));
+ LIBCPP_ASSERT(std::ranges::equal(m, expected));
+ }
+ {
+ M m = {10, 8};
+ assert(m.size() == 2);
+ m = {3};
+ int expected[] = {3};
+ assert(std::ranges::equal(m, expected));
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/compare.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/compare.pass.cpp
new file mode 100644
index 000000000000000..b3bee18f5a936b1
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/compare.pass.cpp
@@ -0,0 +1,83 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// explicit flat_set(const key_compare& comp);
+// template <class Alloc>
+// flat_set(const key_compare& comp, const Alloc& a);
+
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <type_traits>
+#include <vector>
+
+#include "test_macros.h"
+#include "../../../test_compare.h"
+#include "test_allocator.h"
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ static_assert(std::is_constructible_v<M1, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, const C&, const A1&>);
+ }
+ {
+ using C = test_less<int>;
+ auto m = std::flat_set<int, C>(C(3));
+ assert(m.empty());
+ assert(m.begin() == m.end());
+ assert(m.key_comp() == C(3));
+ }
+ {
+ // The one-argument ctor is explicit.
+ using C = test_less<int>;
+ static_assert(std::is_constructible_v<std::flat_set<int, C>, C>);
+ static_assert(!std::is_convertible_v<C, std::flat_set<int, C>>);
+
+ static_assert(std::is_constructible_v<std::flat_set<int>, std::less<int>>);
+ static_assert(!std::is_convertible_v<std::less<int>, std::flat_set<int>>);
+ }
+ {
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ auto m = std::flat_set<int, C, std::vector<int, A1>>(C(4), A1(5));
+ assert(m.empty());
+ assert(m.begin() == m.end());
+ assert(m.key_comp() == C(4));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == A1(5));
+ }
+ {
+ // explicit(false)
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ std::flat_set<int, C, std::deque<int, A1>> m = {C(4), A1(5)};
+ assert(m.empty());
+ assert(m.begin() == m.end());
+ assert(m.key_comp() == C(4));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == A1(5));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/containers.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/containers.pass.cpp
new file mode 100644
index 000000000000000..3d1e6240c952e8c
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/containers.pass.cpp
@@ -0,0 +1,158 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// explicit flat_set(container_type key_cont, const key_compare& comp = key_compare());
+// template<class Allocator>
+// flat_set(const container_type& key_cont, const Allocator& a);
+// template<class Alloc>
+// flat_set(const container_type& key_cont, const key_compare& comp, const Alloc& a);
+
+#include <algorithm>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <type_traits>
+#include <vector>
+
+#include "min_allocator.h"
+#include "MoveOnly.h"
+#include "test_allocator.h"
+#include "test_iterators.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+
+template <class T>
+void conversion_test(T);
+
+template <class T, class... Args>
+concept ImplicitlyConstructible = requires(Args&&... args) { conversion_test<T>({std::forward<Args>(args)...}); };
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ static_assert(std::is_constructible_v<M1, const V1&, const A1&>);
+ static_assert(std::is_constructible_v<M2, const V2&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, const V1&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, const V2&, const A1&>);
+
+ static_assert(std::is_constructible_v<M1, const V1&, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, const V2&, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, const V1&, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, const V2&, const C&, const A1&>);
+ }
+ {
+ // flat_set(container_type)
+ using M = std::flat_set<int>;
+ std::vector<int> ks = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ auto m = M(ks);
+ assert(std::ranges::equal(m, std::vector<int>{1, 2, 3}));
+
+ // explicit
+ static_assert(std::is_constructible_v<M, const std::vector<int>&>);
+ static_assert(!ImplicitlyConstructible<M, const std::vector<int>&>);
+ }
+ {
+ // flat_set(container_type)
+ // move-only
+ MoveOnly expected[] = {3, 2, 1};
+ using Ks = std::deque<MoveOnly, min_allocator<MoveOnly>>;
+ using M = std::flat_set<MoveOnly, std::greater<MoveOnly>, Ks>;
+ Ks ks;
+ ks.push_back(1);
+ ks.push_back(3);
+ ks.push_back(2);
+ auto m = M(std::move(ks));
+ assert(ks.empty()); // it was moved-from
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ // flat_set(container_type)
+ // container's allocator is used
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A>>;
+ auto ks = std::deque<int, A>({1, 1, 1, 2, 2, 3, 2, 3, 3}, A(5));
+ auto m = M(std::move(ks));
+ assert(ks.empty()); // it was moved-from
+ assert((m == M{1, 2, 3}));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == A(5));
+ }
+ {
+ // flat_set(container_type , key_compare)
+ using C = test_less<int>;
+ using M = std::flat_set<int, C>;
+ std::vector<int> ks = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ auto m = M(ks, C(4));
+ assert(std::ranges::equal(m, std::vector<int>{1, 2, 3}));
+ assert(m.key_comp() == C(4));
+
+ // explicit
+ static_assert(std::is_constructible_v<M, const std::vector<int>&, const C&>);
+ static_assert(!ImplicitlyConstructible<M, const std::vector<int>&, const C&>);
+ }
+ {
+ // flat_set(container_type , const Allocator&)
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A>>;
+ auto ks = std::deque<int, A>({1, 1, 1, 2, 2, 3, 2, 3, 3}, A(5));
+ auto m = M(ks, A(4)); // replaces the allocators
+ assert(!ks.empty()); // it was an lvalue above
+ assert((m == M{1, 2, 3}));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == A(4));
+ }
+ {
+ // flat_set(container_type , const Allocator&)
+ // explicit(false)
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A>>;
+ static_assert(ImplicitlyConstructible<M, const std::deque<int, A>&, const A&>);
+ auto ks = std::deque<int, A>({1, 1, 1, 2, 2, 3, 2, 3, 3}, A(5));
+ M m = {ks, A(4)}; // implicit ctor
+ assert(!ks.empty()); // it was an lvalue above
+ assert((m == M{1, 2, 3}));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == A(4));
+ }
+ {
+ // flat_set(container_type , key_compare, const Allocator&)
+ using C = test_less<int>;
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, C, std::vector<int, A>>;
+ std::vector<int, A> ks = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ auto m = M(ks, C(4), A(5));
+ assert(std::ranges::equal(m, std::vector<int, A>{1, 2, 3}));
+ assert(m.key_comp() == C(4));
+ auto m_copy = m;
+ auto keys = std::move(m_copy).extract();
+ assert(keys.get_allocator() == A(5));
+
+ // explicit(false)
+ static_assert(ImplicitlyConstructible<M, const std::vector<int, A>&, const A&>);
+ M m2 = {ks, C(4), A(5)};
+ assert(m2 == m);
+ assert(m2.key_comp() == C(4));
+ keys = std::move(m2).extract();
+ assert(keys.get_allocator() == A(5));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy.pass.cpp
new file mode 100644
index 000000000000000..f1dbc955e1b0de7
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy.pass.cpp
@@ -0,0 +1,64 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set(const flat_set& m);
+
+#include <algorithm>
+#include <cassert>
+#include <flat_set>
+#include <vector>
+
+#include "test_macros.h"
+#include "../../../test_compare.h"
+#include "test_allocator.h"
+
+int main(int, char**) {
+ {
+ using C = test_less<int>;
+ std::vector<int, test_allocator<int>> ks({1, 3, 5}, test_allocator<int>(6));
+ using M = std::flat_set<int, C, decltype(ks)>;
+ auto mo = M(ks, C(5));
+ auto m = mo;
+
+ assert(m.key_comp() == C(5));
+ assert(std::ranges::equal(m, ks));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == test_allocator<int>(6));
+
+ // mo is unchanged
+ assert(mo.key_comp() == C(5));
+ assert(std::ranges::equal(mo, ks));
+ auto keys2 = std::move(mo).extract();
+ assert(keys2.get_allocator() == test_allocator<int>(6));
+ }
+ {
+ using C = test_less<int>;
+ using Ks = std::vector<int, other_allocator<int>>;
+ auto ks = Ks({1, 3, 5}, other_allocator<int>(6));
+ using M = std::flat_set<int, C, Ks>;
+ auto mo = M(Ks(ks, other_allocator<int>(6)), C(5));
+ auto m = mo;
+
+ assert(m.key_comp() == C(5));
+ assert(std::ranges::equal(m, ks));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == other_allocator<int>(-2));
+
+ // mo is unchanged
+ assert(mo.key_comp() == C(5));
+ assert(std::ranges::equal(mo, ks));
+ auto keys2 = std::move(mo).extract();
+ assert(keys2.get_allocator() == other_allocator<int>(6));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_alloc.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_alloc.pass.cpp
new file mode 100644
index 000000000000000..59fb9d0a38366fe
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_alloc.pass.cpp
@@ -0,0 +1,63 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set(const flat_set&, const allocator_type&);
+
+#include <algorithm>
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "test_macros.h"
+#include "../../../test_compare.h"
+#include "test_allocator.h"
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ static_assert(std::is_constructible_v<M1, const M1&, const A1&>);
+ static_assert(std::is_constructible_v<M2, const M2&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, const M1&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, const M2&, const A1&>);
+ }
+ {
+ using C = test_less<int>;
+ std::vector<int, test_allocator<int>> ks({1, 3, 5}, test_allocator<int>(6));
+ using M = std::flat_set<int, C, decltype(ks)>;
+ auto mo = M(ks, C(5));
+ auto m = M(mo, test_allocator<int>(3));
+
+ assert(m.key_comp() == C(5));
+ assert(std::ranges::equal(m, ks));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == test_allocator<int>(3));
+
+ // mo is unchanged
+ assert(mo.key_comp() == C(5));
+ assert(std::ranges::equal(mo, ks));
+ auto keys2 = std::move(mo).extract();
+ assert(keys2.get_allocator() == test_allocator<int>(6));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.addressof.compile.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.addressof.compile.pass.cpp
new file mode 100644
index 000000000000000..169b469f3bca68b
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.addressof.compile.pass.cpp
@@ -0,0 +1,30 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set& operator=(const flat_set& s);
+
+// Validate whether the container can be copy-assigned (move-assigned, swapped)
+// with an ADL-hijacking operator&
+
+#include <flat_set>
+#include <utility>
+
+#include "test_macros.h"
+#include "operator_hijacker.h"
+
+void test() {
+ std::flat_set<operator_hijacker> so;
+ std::flat_set<operator_hijacker> s;
+ s = so;
+ s = std::move(so);
+ swap(s, so);
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.pass.cpp
new file mode 100644
index 000000000000000..cdd5045f4bb9f7e
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.pass.cpp
@@ -0,0 +1,85 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set& operator=(const flat_set& m);
+
+#include <algorithm>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "test_macros.h"
+#include "../../../test_compare.h"
+#include "test_allocator.h"
+
+int main(int, char**) {
+ {
+ // test_allocator is not propagated
+ using C = test_less<int>;
+ std::vector<int, test_allocator<int>> ks({1, 3, 5}, test_allocator<int>(6));
+ using M = std::flat_set<int, C, decltype(ks)>;
+ auto mo = M(ks, C(5));
+ auto m = M({{3, 4, 5}}, C(3), test_allocator<int>(2));
+ m = mo;
+
+ assert(m.key_comp() == C(5));
+ assert(std::ranges::equal(m, ks));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == test_allocator<int>(2));
+
+ // mo is unchanged
+ assert(mo.key_comp() == C(5));
+ assert(std::ranges::equal(mo, ks));
+ auto keys2 = std::move(mo).extract();
+ assert(keys2.get_allocator() == test_allocator<int>(6));
+ }
+ {
+ // other_allocator is propagated
+ using C = test_less<int>;
+ using Ks = std::vector<int, other_allocator<int>>;
+ auto ks = Ks({1, 3, 5}, other_allocator<int>(6));
+ using M = std::flat_set<int, C, Ks>;
+ auto mo = M(Ks(ks, other_allocator<int>(6)), C(5));
+ auto m = M({3, 4, 5}, C(3), other_allocator<int>(2));
+ m = mo;
+
+ assert(m.key_comp() == C(5));
+ assert(std::ranges::equal(m, ks));
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == other_allocator<int>(6));
+
+ // mo is unchanged
+ assert(mo.key_comp() == C(5));
+ assert(std::ranges::equal(mo, ks));
+ auto keys2 = std::move(mo).extract();
+ assert(keys2.get_allocator() == other_allocator<int>(6));
+ }
+ {
+ // comparator is copied and invariant is preserved
+ using M = std::flat_set<int, std::function<bool(int, int)>>;
+ M mo = M({1, 2}, std::less<int>());
+ M m = M({1, 2}, std::greater<int>());
+ assert(m.key_comp()(2, 1) == true);
+ assert(m != mo);
+ m = mo;
+ assert(m.key_comp()(2, 1) == false);
+ assert(m == mo);
+ }
+ {
+ // self-assignment
+ using M = std::flat_set<int>;
+ M m = {{1, 2}};
+ m = static_cast<const M&>(m);
+ assert((m == M{{1, 2}}));
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.compile.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.compile.pass.cpp
new file mode 100644
index 000000000000000..5db8c4ca7224665
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.compile.pass.cpp
@@ -0,0 +1,49 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// Test CTAD on cases where deduction should fail.
+
+#include <flat_set>
+#include <functional>
+#include <memory>
+#include <utility>
+#include <vector>
+
+struct NotAnAllocator {
+ friend bool operator<(NotAnAllocator, NotAnAllocator) { return false; }
+};
+
+template <class... Args>
+concept CanDeductFlatSet = requires { std::flat_set{std::declval<Args>()...}; };
+
+static_assert(CanDeductFlatSet<std::vector<int>, std::vector<int>>);
+
+// cannot deduce Key and T from nothing
+static_assert(!CanDeductFlatSet<>);
+
+// cannot deduce Key and T from just (KeyContainer), even if it's a container of pairs
+static_assert(!CanDeductFlatSet<std::vector<std::pair<int, int>>>);
+
+// cannot deduce Key and T from just (KeyContainer, Allocator)
+static_assert(!CanDeductFlatSet<std::vector<int>, std::allocator<std::pair<const int, int>>>);
+
+// cannot deduce Key and T from just (Compare)
+static_assert(!CanDeductFlatSet<std::less<int>>);
+
+// cannot deduce Key and T from just (Compare, Allocator)
+static_assert(!CanDeductFlatSet<std::less<int>, std::allocator<PC>>);
+
+// cannot deduce Key and T from just (Allocator)
+static_assert(!CanDeductFlatSet<std::allocator<PC>>);
+
+// cannot convert from some arbitrary unrelated type
+static_assert(!CanDeductFlatSet<NotAnAllocator>);
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.pass.cpp
new file mode 100644
index 000000000000000..612e64a7c42f23e
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.pass.cpp
@@ -0,0 +1,341 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+#include <algorithm>
+#include <cassert>
+#include <climits>
+#include <deque>
+#include <initializer_list>
+#include <list>
+#include <flat_set>
+#include <functional>
+#include <ranges>
+#include <type_traits>
+#include <utility>
+#include <vector>
+
+#include "deduction_guides_sfinae_checks.h"
+#include "test_allocator.h"
+
+using P = std::pair<int, long>;
+using PC = std::pair<const int, long>;
+
+void test_copy() {
+ {
+ std::flat_set<long, short> source = {{1, 2}, {2, 3}};
+ std::flat_set s(source);
+ ASSERT_SAME_TYPE(decltype(s), decltype(source));
+ assert(s == source);
+ }
+ {
+ std::flat_set<long, short, std::greater<long>> source = {{1, 2}, {2, 3}};
+ std::flat_set s{source}; // braces instead of parens
+ ASSERT_SAME_TYPE(decltype(s), decltype(source));
+ assert(s == source);
+ }
+ {
+ std::flat_set<long, short, std::greater<long>> source = {{1, 2}, {2, 3}};
+ std::flat_set s(source, std::allocator<int>());
+ ASSERT_SAME_TYPE(decltype(s), decltype(source));
+ assert(s == source);
+ }
+}
+
+void test_containers() {
+ std::deque<int, test_allocator<int>> ks({1, 2, 1, INT_MAX, 3}, test_allocator<int>(0, 42));
+ std::deque<short, test_allocator<short>> vs({1, 2, 1, 4, 5}, test_allocator<int>(0, 43));
+ std::deque<int, test_allocator<int>> sorted_ks({1, 2, 3, INT_MAX}, test_allocator<int>(0, 42));
+ std::deque<short, test_allocator<short>> sorted_vs({1, 2, 5, 4}, test_allocator<int>(0, 43));
+ const std::pair<int, short> expected[] = {{1, 1}, {2, 2}, {3, 5}, {INT_MAX, 4}};
+ {
+ std::flat_set s(ks, vs);
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::less<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 42);
+ assert(s.values().get_allocator().get_id() == 43);
+ }
+ {
+ std::flat_set s(std::sorted_unique, sorted_ks, sorted_vs);
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::less<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 42);
+ assert(s.values().get_allocator().get_id() == 43);
+ }
+ {
+ std::flat_set s(ks, vs, test_allocator<long>(0, 44));
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::less<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 44);
+ assert(s.values().get_allocator().get_id() == 44);
+ }
+ {
+ std::flat_set s(std::sorted_unique, sorted_ks, sorted_vs, test_allocator<long>(0, 44));
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::less<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 44);
+ assert(s.values().get_allocator().get_id() == 44);
+ }
+}
+
+void test_containers_compare() {
+ std::deque<int, test_allocator<int>> ks({1, 2, 1, INT_MAX, 3}, test_allocator<int>(0, 42));
+ std::deque<short, test_allocator<short>> vs({1, 2, 1, 4, 5}, test_allocator<int>(0, 43));
+ std::deque<int, test_allocator<int>> sorted_ks({INT_MAX, 3, 2, 1}, test_allocator<int>(0, 42));
+ std::deque<short, test_allocator<short>> sorted_vs({4, 5, 2, 1}, test_allocator<int>(0, 43));
+ const std::pair<int, short> expected[] = {{INT_MAX, 4}, {3, 5}, {2, 2}, {1, 1}};
+ {
+ std::flat_set s(ks, vs, std::greater<int>());
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::greater<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 42);
+ assert(s.values().get_allocator().get_id() == 43);
+ }
+ {
+ std::flat_set s(std::sorted_unique, sorted_ks, sorted_vs, std::greater<int>());
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::greater<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 42);
+ assert(s.values().get_allocator().get_id() == 43);
+ }
+ {
+ std::flat_set s(ks, vs, std::greater<int>(), test_allocator<long>(0, 44));
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::greater<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 44);
+ assert(s.values().get_allocator().get_id() == 44);
+ }
+ {
+ std::flat_set s(std::sorted_unique, sorted_ks, sorted_vs, std::greater<int>(), test_allocator<long>(0, 44));
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::greater<int>, decltype(ks), decltype(vs)>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 44);
+ assert(s.values().get_allocator().get_id() == 44);
+ }
+}
+
+void test_iter_iter() {
+ const P arr[] = {{1, 1L}, {2, 2L}, {1, 1L}, {INT_MAX, 1L}, {3, 1L}};
+ const P sorted_arr[] = {{1, 1L}, {2, 2L}, {3, 1L}, {INT_MAX, 1L}};
+ const PC arrc[] = {{1, 1L}, {2, 2L}, {1, 1L}, {INT_MAX, 1L}, {3, 1L}};
+ const PC sorted_arrc[] = {{1, 1L}, {2, 2L}, {3, 1L}, {INT_MAX, 1L}};
+ {
+ std::flat_set m(std::begin(arr), std::end(arr));
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::begin(arrc), std::end(arrc));
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::sorted_unique, std::begin(sorted_arr), std::end(sorted_arr));
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::sorted_unique, std::begin(sorted_arrc), std::end(sorted_arrc));
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set<int, short> mo;
+ std::flat_set m(mo.begin(), mo.end());
+ ASSERT_SAME_TYPE(decltype(m), decltype(mo));
+ }
+ {
+ std::flat_set<int, short> mo;
+ std::flat_set m(mo.cbegin(), mo.cend());
+ ASSERT_SAME_TYPE(decltype(m), decltype(mo));
+ }
+ {
+ std::pair<int, int> source[3] = {{1, 1}, {2, 2}, {3, 3}};
+ std::flat_set s = {source, source + 3}; // flat_set(InputIterator, InputIterator)
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, int>);
+ assert(s.size() == 3);
+ }
+ {
+ std::pair<int, int> source[3] = {{1, 1}, {2, 2}, {3, 3}};
+ std::flat_set s{source, source + 3}; // flat_set(InputIterator, InputIterator)
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, int>);
+ assert(s.size() == 3);
+ }
+ {
+ std::pair<int, int> source[3] = {{1, 1}, {2, 2}, {3, 3}};
+ std::flat_set s{std::sorted_unique, source, source + 3}; // flat_set(sorted_unique_t, InputIterator, InputIterator)
+ static_assert(std::is_same_v<decltype(s), std::flat_set<int, int>>);
+ assert(s.size() == 3);
+ }
+}
+
+void test_iter_iter_compare() {
+ const P arr[] = {{1, 1L}, {2, 2L}, {1, 1L}, {INT_MAX, 1L}, {3, 1L}};
+ const P sorted_arr[] = {{INT_MAX, 1L}, {3, 1L}, {2, 2L}, {1, 1L}};
+ const PC arrc[] = {{1, 1L}, {2, 2L}, {1, 1L}, {INT_MAX, 1L}, {3, 1L}};
+ const PC sorted_arrc[] = {{INT_MAX, 1L}, {3, 1L}, {2, 2L}, {1, 1L}};
+ using C = std::greater<long long>;
+ {
+ std::flat_set m(std::begin(arr), std::end(arr), C());
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long, C>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::begin(arrc), std::end(arrc), C());
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long, C>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::sorted_unique, std::begin(sorted_arr), std::end(sorted_arr), C());
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long, C>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::sorted_unique, std::begin(sorted_arrc), std::end(sorted_arrc), C());
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long, C>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set<int, short> mo;
+ std::flat_set m(mo.begin(), mo.end(), C());
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, short, C>);
+ }
+ {
+ std::flat_set<int, short> mo;
+ std::flat_set m(mo.cbegin(), mo.cend(), C());
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, short, C>);
+ }
+}
+
+void test_initializer_list() {
+ const P sorted_arr[] = {{1, 1L}, {2, 2L}, {3, 1L}, {INT_MAX, 1L}};
+ {
+ std::flat_set m{std::pair{1, 1L}, {2, 2L}, {1, 1L}, {INT_MAX, 1L}, {3, 1L}};
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::sorted_unique, {std::pair{1, 1L}, {2, 2L}, {3, 1L}, {INT_MAX, 1L}});
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set s = {std::make_pair(1, 'a')}; // flat_set(initializer_list<pair<int, char>>)
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, char>);
+ assert(s.size() == 1);
+ }
+ {
+ using M = std::flat_set<int, short>;
+ M m;
+ std::flat_set s = {std::make_pair(m, m)}; // flat_set(initializer_list<pair<M, M>>)
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<M, M>);
+ assert(s.size() == 1);
+ assert(s[m] == m);
+ }
+}
+
+void test_initializer_list_compare() {
+ const P sorted_arr[] = {{INT_MAX, 1L}, {3, 1L}, {2, 2L}, {1, 1L}};
+ using C = std::greater<long long>;
+ {
+ std::flat_set m({std::pair{1, 1L}, {2, 2L}, {1, 1L}, {INT_MAX, 1L}, {3, 1L}}, C());
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long, C>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+ {
+ std::flat_set m(std::sorted_unique, {std::pair{INT_MAX, 1L}, {3, 1L}, {2, 2L}, {1, 1L}}, C());
+
+ ASSERT_SAME_TYPE(decltype(m), std::flat_set<int, long, C>);
+ assert(std::ranges::equal(m, sorted_arr));
+ }
+}
+
+void test_from_range() {
+ std::list<std::pair<int, short>> r = {{1, 1}, {2, 2}, {1, 1}, {INT_MAX, 4}, {3, 5}};
+ const std::pair<int, short> expected[] = {{1, 1}, {2, 2}, {3, 5}, {INT_MAX, 4}};
+ {
+ std::flat_set s(std::from_range, r);
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::less<int>>);
+ assert(std::ranges::equal(s, expected));
+ }
+ {
+ std::flat_set s(std::from_range, r, test_allocator<long>(0, 42));
+ ASSERT_SAME_TYPE(
+ decltype(s),
+ std::flat_set<int,
+ short,
+ std::less<int>,
+ std::vector<int, test_allocator<int>>,
+ std::vector<short, test_allocator<short>>>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 42);
+ assert(s.values().get_allocator().get_id() == 42);
+ }
+}
+
+void test_from_range_compare() {
+ std::list<std::pair<int, short>> r = {{1, 1}, {2, 2}, {1, 1}, {INT_MAX, 4}, {3, 5}};
+ const std::pair<int, short> expected[] = {{INT_MAX, 4}, {3, 5}, {2, 2}, {1, 1}};
+ {
+ std::flat_set s(std::from_range, r, std::greater<int>());
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, short, std::greater<int>>);
+ assert(std::ranges::equal(s, expected));
+ }
+ {
+ std::flat_set s(std::from_range, r, std::greater<int>(), test_allocator<long>(0, 42));
+ ASSERT_SAME_TYPE(
+ decltype(s),
+ std::flat_set<int,
+ short,
+ std::greater<int>,
+ std::vector<int, test_allocator<int>>,
+ std::vector<short, test_allocator<short>>>);
+ assert(std::ranges::equal(s, expected));
+ assert(s.keys().get_allocator().get_id() == 42);
+ assert(s.values().get_allocator().get_id() == 42);
+ }
+}
+
+int main(int, char**) {
+ // Each test function also tests the sorted_unique-prefixed and allocator-suffixed overloads.
+ test_copy();
+ test_containers();
+ test_containers_compare();
+ test_iter_iter();
+ test_iter_iter_compare();
+ test_initializer_list();
+ test_initializer_list_compare();
+ test_from_range();
+ test_from_range_compare();
+
+ AssociativeContainerDeductionGuidesSfinaeAway<std::flat_set, std::flat_set<int, short>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct_pmr.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct_pmr.pass.cpp
new file mode 100644
index 000000000000000..df8d6d885ee5246
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct_pmr.pass.cpp
@@ -0,0 +1,94 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+// UNSUPPORTED: availability-pmr-missing
+
+// <flat_set>
+
+#include <algorithm>
+#include <cassert>
+#include <climits>
+#include <deque>
+#include <initializer_list>
+#include <list>
+#include <flat_set>
+#include <functional>
+#include <memory_resource>
+#include <ranges>
+#include <type_traits>
+#include <utility>
+#include <vector>
+
+#include "test_allocator.h"
+
+using P = std::pair<int, long>;
+using PC = std::pair<const int, long>;
+
+void test_containers() {
+ std::deque<int, test_allocator<int>> ks({1, 2, 1, INT_MAX, 3}, test_allocator<int>(0, 42));
+ std::deque<int, test_allocator<int>> sorted_ks({1, 2, 3, INT_MAX}, test_allocator<int>(0, 42));
+ const int expected[] = {1, 2, 3, INT_MAX};
+ {
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::monotonic_buffer_resource mr2;
+ std::pmr::deque<int> pks(ks.begin(), ks.end(), &mr);
+ std::flat_set s(std::move(pks), &mr2);
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, std::less<int>, std::pmr::deque<int>>);
+ assert(std::ranges::equal(s, expected));
+ auto keys = std::move(s).extract();
+ assert(keys.get_allocator().resource() == &mr2);
+ }
+ {
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::monotonic_buffer_resource mr2;
+ std::pmr::deque<int> pks(sorted_ks.begin(), sorted_ks.end(), &mr);
+ std::flat_set s(std::sorted_unique, std::move(pks), &mr2);
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, std::less<int>, std::pmr::deque<int>>);
+ assert(std::ranges::equal(s, expected));
+ auto keys = std::move(s).extract();
+ assert(keys.get_allocator().resource() == &mr2);
+ }
+}
+
+void test_containers_compare() {
+ std::deque<int, test_allocator<int>> ks({1, 2, 1, INT_MAX, 3}, test_allocator<int>(0, 42));
+ std::deque<int, test_allocator<int>> sorted_ks({INT_MAX, 3, 2, 1}, test_allocator<int>(0, 42));
+ const int expected[] = {INT_MAX, 3, 2, 1};
+ {
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::monotonic_buffer_resource mr2;
+ std::pmr::deque<int> pks(ks.begin(), ks.end(), &mr);
+ std::flat_set s(std::move(pks), std::greater<int>(), &mr2);
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, std::greater<int>, std::pmr::deque<int>>);
+ assert(std::ranges::equal(s, expected));
+ auto keys = std::move(s).extract();
+ assert(keys.get_allocator().resource() == &mr2);
+ }
+ {
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::monotonic_buffer_resource mr2;
+ std::pmr::deque<int> pks(sorted_ks.begin(), sorted_ks.end(), &mr);
+ std::flat_set s(std::sorted_unique, std::move(pks), std::greater<int>(), &mr2);
+
+ ASSERT_SAME_TYPE(decltype(s), std::flat_set<int, std::greater<int>, std::pmr::deque<int>>);
+ assert(std::ranges::equal(s, expected));
+ auto keys = std::move(s).extract();
+ assert(keys.get_allocator().resource() == &mr2);
+ }
+}
+
+int main(int, char**) {
+ test_containers();
+ test_containers_compare();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default.pass.cpp
new file mode 100644
index 000000000000000..64b0bfcb383a720
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default.pass.cpp
@@ -0,0 +1,65 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set();
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <type_traits>
+#include <vector>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+#include "test_allocator.h"
+
+struct DefaultCtableComp {
+ explicit DefaultCtableComp() { default_constructed_ = true; }
+ bool operator()(int, int) const { return false; }
+ bool default_constructed_ = false;
+};
+
+int main(int, char**) {
+ {
+ std::flat_set<int> m;
+ assert(m.empty());
+ }
+ {
+ // explicit(false)
+ std::flat_set<int> m = {};
+ assert(m.empty());
+ }
+ {
+ std::flat_set<int, DefaultCtableComp, std::deque<int, min_allocator<int>>> m;
+ assert(m.empty());
+ assert(m.begin() == m.end());
+ assert(m.key_comp().default_constructed_);
+ }
+ {
+ using A1 = explicit_allocator<int>;
+ using A2 = explicit_allocator<char*>;
+ {
+ std::flat_set<int, DefaultCtableComp, std::vector<int, A1>> m;
+ assert(m.empty());
+ assert(m.key_comp().default_constructed_);
+ }
+ {
+ A1 a1;
+ std::flat_set<int, DefaultCtableComp, std::vector<int, A1>> m(a1);
+ assert(m.empty());
+ assert(m.key_comp().default_constructed_);
+ }
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default_noexcept.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default_noexcept.pass.cpp
new file mode 100644
index 000000000000000..b4a3b6de205a31b
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default_noexcept.pass.cpp
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set()
+// noexcept(
+// is_nothrow_default_constructible_v<container_type> &&
+// is_nothrow_default_constructible_v<key_compare>);
+
+// This tests a conforming extension
+
+#include <cassert>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "test_macros.h"
+#include "MoveOnly.h"
+#include "test_allocator.h"
+
+struct ThrowingCtorComp {
+ ThrowingCtorComp() noexcept(false) {}
+ bool operator()(const auto&, const auto&) const { return false; }
+};
+
+int main(int, char**) {
+#if defined(_LIBCPP_VERSION)
+ {
+ using C = std::flat_set<MoveOnly>;
+ static_assert(std::is_nothrow_default_constructible_v<C>);
+ C c;
+ }
+ {
+ using C = std::flat_set<MoveOnly, std::less<MoveOnly>, std::vector<MoveOnly, test_allocator<MoveOnly>>>;
+ static_assert(std::is_nothrow_default_constructible_v<C>);
+ C c;
+ }
+#endif // _LIBCPP_VERSION
+ {
+ using C = std::flat_set<MoveOnly, std::less<MoveOnly>, std::vector<MoveOnly, other_allocator<MoveOnly>>>;
+ static_assert(!std::is_nothrow_default_constructible_v<C>);
+ C c;
+ }
+ {
+ using C = std::flat_set<MoveOnly, ThrowingCtorComp>;
+ static_assert(!std::is_nothrow_default_constructible_v<C>);
+ C c;
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/dtor_noexcept.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/dtor_noexcept.pass.cpp
new file mode 100644
index 000000000000000..c0d315c0ce74b4b
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/dtor_noexcept.pass.cpp
@@ -0,0 +1,57 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// ~flat_set();
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "test_macros.h"
+#include "MoveOnly.h"
+#include "test_allocator.h"
+
+struct ThrowingDtorComp {
+ bool operator()(const auto&, const auto&) const;
+ ~ThrowingDtorComp() noexcept(false) {}
+};
+
+int main(int, char**) {
+ {
+ using C = std::flat_set<MoveOnly, MoveOnly>;
+ static_assert(std::is_nothrow_destructible_v<C>);
+ C c;
+ }
+ {
+ using V = std::vector<MoveOnly, test_allocator<MoveOnly>>;
+ using C = std::flat_set<MoveOnly, std::less<MoveOnly>, V>;
+ static_assert(std::is_nothrow_destructible_v<C>);
+ C c;
+ }
+ {
+ using V = std::deque<MoveOnly, other_allocator<MoveOnly>>;
+ using C = std::flat_set<MoveOnly, std::greater<MoveOnly>, V>;
+ static_assert(std::is_nothrow_destructible_v<C>);
+ C c;
+ }
+#if defined(_LIBCPP_VERSION)
+ {
+ using C = std::flat_set<MoveOnly, ThrowingDtorComp>;
+ static_assert(!std::is_nothrow_destructible_v<C>);
+ C c;
+ }
+#endif // _LIBCPP_VERSION
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/initializer_list.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/initializer_list.pass.cpp
new file mode 100644
index 000000000000000..cd2319e91f760d9
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/initializer_list.pass.cpp
@@ -0,0 +1,151 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set(initializer_list<value_type> il, const key_compare& comp = key_compare());
+// template<class Alloc>
+// flat_set(initializer_list<value_type> il, const Alloc& a);
+// template<class Alloc>
+// flat_set(initializer_list<value_type> il, const key_compare& comp, const Alloc& a);
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <type_traits>
+#include <vector>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+#include "test_allocator.h"
+
+#include "../../../test_compare.h"
+
+struct DefaultCtableComp {
+ explicit DefaultCtableComp() { default_constructed_ = true; }
+ bool operator()(int, int) const { return false; }
+ bool default_constructed_ = false;
+};
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ using IL = std::initializer_list<int>;
+ static_assert(std::is_constructible_v<M1, IL, const A1&>);
+ static_assert(std::is_constructible_v<M2, IL, const A2&>);
+ static_assert(!std::is_constructible_v<M1, IL, const A2&>);
+ static_assert(!std::is_constructible_v<M2, IL, const A1&>);
+
+ static_assert(std::is_constructible_v<M1, IL, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, IL, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, IL, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, IL, const C&, const A1&>);
+ }
+
+ {
+ // initializer_list<value_type> needs to match exactly
+ using M = std::flat_set<int>;
+ using C = typename M::key_compare;
+ static_assert(std::is_constructible_v<M, std::initializer_list<int>>);
+ static_assert(std::is_constructible_v<M, std::initializer_list<int>, C>);
+ static_assert(std::is_constructible_v<M, std::initializer_list<int>, C, std::allocator<int>>);
+ static_assert(std::is_constructible_v<M, std::initializer_list<int>, std::allocator<int>>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>, C>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>, C, std::allocator<int>>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>, std::allocator<int>>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>, C>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>, C, std::allocator<int>>);
+ static_assert(!std::is_constructible_v<M, std::initializer_list<const int>, std::allocator<int>>);
+ }
+
+ int expected[] = {1, 2, 3, 5};
+ {
+ // flat_set(initializer_list<value_type>);
+ using M = std::flat_set<int>;
+ std::initializer_list<int> il = {5, 2, 2, 3, 1, 3};
+ M m(il);
+ assert(std::equal(m.begin(), m.end(), expected, expected + 4));
+ }
+ {
+ // flat_set(initializer_list<value_type>);
+ // explicit(false)
+ using M = std::flat_set<int>;
+ M m = {5, 2, 2, 3, 1, 3};
+ assert(std::equal(m.begin(), m.end(), expected, expected + 4));
+ }
+ {
+ // flat_set(initializer_list<value_type>);
+ using M = std::flat_set<int, std::greater<int>, std::deque<int, min_allocator<int>>>;
+ M m = {5, 2, 2, 3, 1, 3};
+ assert(std::equal(m.rbegin(), m.rend(), expected, expected + 4));
+ }
+ {
+ using A = explicit_allocator<int>;
+ {
+ // flat_set(initializer_list<value_type>);
+ // different comparator
+ using M = std::flat_set<int, DefaultCtableComp, std::vector<int, A>>;
+ M m = {1, 2, 3};
+ assert(m.size() == 1);
+ LIBCPP_ASSERT(*m.begin() == 1);
+ assert(m.key_comp().default_constructed_);
+ }
+ {
+ // flat_set(initializer_list<value_type>, const Allocator&);
+ using M = std::flat_set<int, std::greater<int>, std::deque<int, A>>;
+ A a;
+ M m({5, 2, 2, 3, 1, 3}, a);
+ assert(std::equal(m.rbegin(), m.rend(), expected, expected + 4));
+ }
+ }
+ {
+ // flat_set(initializer_list<value_type>, const key_compare&);
+ using C = test_less<int>;
+ using M = std::flat_set<int, C>;
+ auto m = M({5, 2, 2, 3, 1, 3}, C(10));
+ assert(std::equal(m.begin(), m.end(), expected, expected + 4));
+ assert(m.key_comp() == C(10));
+
+ // explicit(false)
+ M m2 = {{5, 2, 2, 1, 3, 3}, C(10)};
+ assert(m2 == m);
+ assert(m2.key_comp() == C(10));
+ }
+ {
+ // flat_set(initializer_list<value_type>, const key_compare&);
+ // Sorting uses the comparator that was passed in
+ using M = std::flat_set<int, std::function<bool(int, int)>, std::deque<int, min_allocator<int>>>;
+ auto m = M({5, 2, 2, 1, 3, 1}, std::greater<int>());
+ assert(std::equal(m.rbegin(), m.rend(), expected, expected + 4));
+ assert(m.key_comp()(2, 1) == true);
+ }
+ {
+ // flat_set(initializer_list<value_type> il, const key_compare& comp, const Alloc& a);
+ using A = explicit_allocator<int>;
+ using M = std::flat_set<int, std::greater<int>, std::deque<int, A>>;
+ A a;
+ M m({5, 2, 2, 3, 1, 3}, {}, a);
+ assert(std::equal(m.rbegin(), m.rend(), expected, expected + 4));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/iter_iter.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/iter_iter.pass.cpp
new file mode 100644
index 000000000000000..65eebc21a66c4cb
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/iter_iter.pass.cpp
@@ -0,0 +1,136 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template <class InputIterator>
+// flat_set(InputIterator first, InputIterator last, const key_compare& comp = key_compare());
+// template<class InputIterator, class Allocator>
+// flat_set(InputIterator first, InputIterator last, const Allocator& a);
+// template<class InputIterator, class Allocator>
+// flat_set(InputIterator first, InputIterator last, const key_compare& comp, const Allocator& a);
+
+#include <algorithm>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "min_allocator.h"
+#include "test_allocator.h"
+#include "test_iterators.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ using Iter1 = typename M1::iterator;
+ using Iter2 = typename M2::iterator;
+ static_assert(std::is_constructible_v<M1, Iter1, Iter1, const A1&>);
+ static_assert(std::is_constructible_v<M2, Iter2, Iter2, const A2&>);
+ static_assert(!std::is_constructible_v<M1, Iter1, Iter1, const A2&>);
+ static_assert(!std::is_constructible_v<M2, Iter2, Iter2, const A1&>);
+
+ static_assert(std::is_constructible_v<M1, Iter1, Iter1, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, Iter2, Iter2, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, Iter1, Iter1, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, Iter2, Iter2, const C&, const A1&>);
+ }
+
+ int ar[] = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ int expected[] = {1, 2, 3};
+ {
+ // flat_set(InputIterator , InputIterator)
+ // cpp17_input_iterator
+ using M = std::flat_set<int>;
+ auto m = M(cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 9));
+ assert(std::ranges::equal(m, expected));
+
+ // explicit(false)
+ M m2 = {cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 9)};
+ assert(m2 == m);
+ }
+ {
+ // flat_set(InputIterator , InputIterator)
+ // greater
+ using M = std::flat_set<int, std::greater<int>, std::deque<int, min_allocator<int>>>;
+ auto m = M(cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 9));
+ assert(std::ranges::equal(m, std::deque<int, min_allocator<int>>{3, 2, 1}));
+ }
+ {
+ // flat_set(InputIterator , InputIterator)
+ // Test when the operands are of array type (also contiguous iterator type)
+ using M = std::flat_set<int, std::greater<int>, std::vector<int, min_allocator<int>>>;
+ auto m = M(ar, ar);
+ assert(m.empty());
+ }
+ {
+ // flat_set(InputIterator , InputIterator, const key_compare&)
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::vector<int>>;
+ auto m = M(ar, ar + 9, C(3));
+ assert(std::ranges::equal(m, expected));
+ assert(m.key_comp() == C(3));
+
+ // explicit(false)
+ M m2 = {ar, ar + 9, C(3)};
+ assert(m2 == m);
+ assert(m2.key_comp() == C(3));
+ }
+ {
+ // flat_set(InputIterator , InputIterator, const Allocator&)
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::vector<int, A1>>;
+ auto m = M(ar, ar + 9, A1(5));
+ assert(std::ranges::equal(m, expected));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(InputIterator , InputIterator, const Allocator&)
+ // explicit(false)
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::vector<int, A1>>;
+ M m = {ar, ar + 9, A1(5)}; // implicit ctor
+ assert(std::ranges::equal(m, expected));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(InputIterator , InputIterator, const key_compare&, const Allocator&)
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, C, std::vector<int, A1>>;
+ auto m = M(ar, ar + 9, C(3), A1(5));
+ assert(std::ranges::equal(m, expected));
+ assert(m.key_comp() == C(3));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(InputIterator , InputIterator, const key_compare&, const Allocator&)
+ // explicit(false)
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A1>>;
+ M m = {ar, ar + 9, {}, A1(5)}; // implicit ctor
+ assert(std::ranges::equal(m, expected));
+ LIBCPP_ASSERT(std::ranges::equal(m, expected));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move.pass.cpp
new file mode 100644
index 000000000000000..69b340ad09fe158
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move.pass.cpp
@@ -0,0 +1,83 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set(flat_set&&);
+
+#include <algorithm>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "../helpers.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+#include "test_allocator.h"
+#include "min_allocator.h"
+
+int main(int, char**) {
+ {
+ using C = test_less<int>;
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, C, std::deque<int, A>>;
+ M mo = M({1, 2, 3}, C(5), A(7));
+ M m = std::move(mo);
+ assert((m == M{1, 2, 3}));
+ assert(m.key_comp() == C(5));
+ assert(std::move(m).extract().get_allocator() == A(7));
+
+ assert(mo.empty());
+ assert(mo.key_comp() == C(5));
+ assert(std::move(mo).extract().get_allocator().get_id() == test_alloc_base::moved_value);
+ }
+ {
+ using C = test_less<int>;
+ using A = min_allocator<int>;
+ using M = std::flat_set<int, C, std::vector<int, A>>;
+ M mo = M({1, 2, 3}, C(5), A());
+ M m = std::move(mo);
+ assert((m == M{1, 2, 3}));
+ assert(m.key_comp() == C(5));
+ assert(std::move(m).extract().get_allocator() == A());
+
+ assert(mo.empty());
+ assert(mo.key_comp() == C(5));
+ assert(std::move(mo).extract().get_allocator() == A());
+ }
+ {
+ // A moved-from flat_set maintains its class invariant in the presence of moved-from comparators.
+ using M = std::flat_set<int, std::function<bool(int, int)>>;
+ M mo = M({1, 2, 3}, std::less<int>());
+ M m = std::move(mo);
+ assert(m.size() == 3);
+ assert(std::is_sorted(m.begin(), m.end(), m.value_comp()));
+ assert(m.key_comp()(1, 2) == true);
+
+ assert(std::is_sorted(mo.begin(), mo.end(), mo.value_comp()));
+ LIBCPP_ASSERT(m.key_comp()(1, 2) == true);
+ LIBCPP_ASSERT(mo.empty());
+ mo.insert({1, 2, 3}); // insert has no preconditions
+ assert(m == mo);
+ }
+ {
+ // moved-from object maintains invariant if the underlying container does not clear after move
+ using M = std::flat_set<int, std::less<>, CopyOnlyVector<int>>;
+ M m1 = M({1, 2, 3});
+ M m2 = std::move(m1);
+ assert(m2.size() == 3);
+ check_invariant(m1);
+ LIBCPP_ASSERT(m1.empty());
+ LIBCPP_ASSERT(m1.size() == 0);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_alloc.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_alloc.pass.cpp
new file mode 100644
index 000000000000000..fc7f68d8c967ad2
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_alloc.pass.cpp
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set(flat_set&&, const allocator_type&);
+
+#include <algorithm>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <ranges>
+#include <vector>
+
+#include "../helpers.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+#include "test_allocator.h"
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ static_assert(std::is_constructible_v<M1, M1&&, const A1&>);
+ static_assert(std::is_constructible_v<M2, M2&&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, M1&&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, M2&&, const A1&>);
+ }
+ {
+ int expected[] = {1, 2, 3};
+ using C = test_less<int>;
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, C, std::deque<int, A>>;
+ auto mo = M(expected, expected + 3, C(5), A(7));
+ auto m = M(std::move(mo), A(3));
+
+ assert(m.key_comp() == C(5));
+ assert(m.size() == 3);
+ auto keys = std::move(m).extract();
+ assert(keys.get_allocator() == A(3));
+ assert(std::ranges::equal(keys, expected ));
+
+ // The original flat_set is moved-from.
+ assert(std::is_sorted(mo.begin(), mo.end(), mo.value_comp()));
+ assert(mo.empty());
+ assert(mo.key_comp() == C(5));
+ assert(std::move(mo).extract().get_allocator() == A(7));
+ }
+ {
+ // moved-from object maintains invariant if one of underlying container does not clear after move
+ using M = std::flat_set<int, std::less<>, CopyOnlyVector<int>>;
+ M m1 = M({1, 2, 3});
+ M m2(std::move(m1), std::allocator<int>{});
+ assert(m2.size() == 3);
+ check_invariant(m1);
+ LIBCPP_ASSERT(m1.empty());
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign.pass.cpp
new file mode 100644
index 000000000000000..b16dc38dd402859
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign.pass.cpp
@@ -0,0 +1,69 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set& operator=(flat_set&&);
+
+#include <algorithm>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "test_macros.h"
+#include "MoveOnly.h"
+#include "../../../test_compare.h"
+#include "test_allocator.h"
+#include "min_allocator.h"
+
+int main(int, char**) {
+ {
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, C, std::vector<int, A1>>;
+ M mo = M({1, 2, 3}, C(5), A1(7));
+ M m = M({}, C(3), A1(7));
+ m = std::move(mo);
+ assert((m == M{1, 2, 3}));
+ assert(m.key_comp() == C(5));
+ auto ks = std::move(m).extract();
+ assert(ks.get_allocator() == A1(7));
+ assert(mo.empty());
+ }
+ {
+ using C = test_less<int>;
+ using A1 = other_allocator<int>;
+ using M = std::flat_set<int, C, std::deque<int, A1>>;
+ M mo = M({4, 5}, C(5), A1(7));
+ M m = M({1, 2, 3, 4}, C(3), A1(7));
+ m = std::move(mo);
+ assert((m == M{4, 5}));
+ assert(m.key_comp() == C(5));
+ auto ks = std::move(m).extract();
+ assert(ks.get_allocator() == A1(7));
+ assert(mo.empty());
+ }
+ {
+ using A = min_allocator<int>;
+ using M = std::flat_set<int, std::greater<int>, std::vector<int, A>>;
+ M mo = M({5, 4, 3}, A());
+ M m = M({4, 3, 2, 1}, A());
+ m = std::move(mo);
+ assert((m == M{5, 4, 3}));
+ auto ks = std::move(m).extract();
+ assert(ks.get_allocator() == A());
+ assert(mo.empty());
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_clears.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_clears.pass.cpp
new file mode 100644
index 000000000000000..50817f4be8a8125
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_clears.pass.cpp
@@ -0,0 +1,101 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set& operator=(flat_set&&);
+// Preserves the class invariant for the moved-from flat_set.
+
+#include <algorithm>
+#include <cassert>
+#include <compare>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "../helpers.h"
+#include "test_macros.h"
+
+struct MoveNegates {
+ int value_ = 0;
+ MoveNegates() = default;
+ MoveNegates(int v) : value_(v) {}
+ MoveNegates(MoveNegates&& rhs) : value_(rhs.value_) { rhs.value_ = -rhs.value_; }
+ MoveNegates& operator=(MoveNegates&& rhs) {
+ value_ = rhs.value_;
+ rhs.value_ = -rhs.value_;
+ return *this;
+ }
+ ~MoveNegates() = default;
+ auto operator<=>(const MoveNegates&) const = default;
+};
+
+struct MoveClears {
+ int value_ = 0;
+ MoveClears() = default;
+ MoveClears(int v) : value_(v) {}
+ MoveClears(MoveClears&& rhs) : value_(rhs.value_) { rhs.value_ = 0; }
+ MoveClears& operator=(MoveClears&& rhs) {
+ value_ = rhs.value_;
+ rhs.value_ = 0;
+ return *this;
+ }
+ ~MoveClears() = default;
+ auto operator<=>(const MoveClears&) const = default;
+};
+
+int main(int, char**) {
+ {
+ const int expected[] = {1, 2, 3, 4, 5, 6, 7, 8};
+ using M = std::flat_set<MoveNegates, std::less<MoveNegates>>;
+ M m = M(expected, expected + 8);
+ M m2 = M(expected, expected + 3);
+
+ m2 = std::move(m);
+
+ assert(std::equal(m2.begin(), m2.end(), expected, expected + 8));
+ LIBCPP_ASSERT(m.empty());
+ assert(std::is_sorted(m.begin(), m.end(), m.key_comp())); // still sorted
+ assert(std::adjacent_find(m.begin(), m.end(), m.key_comp()) == m.end()); // still contains no duplicates
+ m.insert(1);
+ m.insert(2);
+ assert(m.contains(1));
+ assert(m.find(2) != m.end());
+ }
+ {
+ const int expected[] = {1, 2, 3, 4, 5, 6, 7, 8};
+ using M = std::flat_set<MoveClears, std::less<MoveClears>>;
+ M m = M(expected, expected + 8);
+ M m2 = M(expected, expected + 3);
+
+ m2 = std::move(m);
+
+ assert(std::equal(m2.begin(), m2.end(), expected, expected + 8));
+ LIBCPP_ASSERT(m.empty());
+ assert(std::is_sorted(m.begin(), m.end(), m.key_comp())); // still sorted
+ assert(std::adjacent_find(m.begin(), m.end(), m.key_comp()) == m.end()); // still contains no duplicates
+ m.insert(1);
+ m.insert(2);
+ assert(m.contains(1));
+ assert(m.find(2) != m.end());
+ }
+ {
+ // moved-from object maintains invariant if one of underlying container does not clear after move
+ using M = std::flat_set<int, std::less<>, std::vector<int>>;
+ M m1 = M({1, 2, 3});
+ M m2 = M({1, 2});
+ m2 = std::move(m1);
+ assert(m2.size() == 3);
+ check_invariant(m1);
+ LIBCPP_ASSERT(m1.empty());
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_noexcept.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_noexcept.pass.cpp
new file mode 100644
index 000000000000000..86f3568f0d67a6b
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign_noexcept.pass.cpp
@@ -0,0 +1,85 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set& operator=(flat_set&& c)
+// noexcept(
+// is_nothrow_move_assignable<key_container_type>::value &&
+// is_nothrow_move_assignable<mapped_container_type>::value &&
+// is_nothrow_copy_assignable<key_compare>::value);
+
+// This tests a conforming extension
+
+#include <flat_set>
+#include <functional>
+#include <memory_resource>
+#include <type_traits>
+#include <vector>
+
+#include "MoveOnly.h"
+#include "test_allocator.h"
+#include "test_macros.h"
+
+struct MoveSensitiveComp {
+ MoveSensitiveComp() noexcept(false) = default;
+ MoveSensitiveComp(const MoveSensitiveComp&) noexcept(false) = default;
+ MoveSensitiveComp(MoveSensitiveComp&& rhs) { rhs.is_moved_from_ = true; }
+ MoveSensitiveComp& operator=(const MoveSensitiveComp&) noexcept = default;
+ MoveSensitiveComp& operator=(MoveSensitiveComp&& rhs) {
+ rhs.is_moved_from_ = true;
+ return *this;
+ }
+ bool operator()(const auto&, const auto&) const { return false; }
+ bool is_moved_from_ = false;
+};
+
+struct MoveThrowsComp {
+ MoveThrowsComp(MoveThrowsComp&&) noexcept(false);
+ MoveThrowsComp(const MoveThrowsComp&) noexcept(true);
+ MoveThrowsComp& operator=(MoveThrowsComp&&) noexcept(false);
+ MoveThrowsComp& operator=(const MoveThrowsComp&) noexcept(true);
+ bool operator()(const auto&, const auto&) const;
+};
+
+int main(int, char**) {
+ {
+ using C = std::flat_set<int, int>;
+ LIBCPP_STATIC_ASSERT(std::is_nothrow_move_assignable_v<C>);
+ }
+ {
+ using C = std::flat_set<MoveOnly, std::less<MoveOnly>, std::vector<MoveOnly, test_allocator<MoveOnly>>>;
+ static_assert(!std::is_nothrow_move_assignable_v<C>);
+ }
+ {
+ using C = std::flat_set<int, std::less<int>, std::vector<int, test_allocator<int>>>;
+ static_assert(!std::is_nothrow_move_assignable_v<C>);
+ }
+ {
+ using C = std::flat_set<MoveOnly, std::less<MoveOnly>, std::vector<MoveOnly, other_allocator<MoveOnly>>>;
+ LIBCPP_STATIC_ASSERT(std::is_nothrow_move_assignable_v<C>);
+ }
+ {
+ using C = std::flat_set<int, std::less<int>, std::vector<int, other_allocator<int>>>;
+ LIBCPP_STATIC_ASSERT(std::is_nothrow_move_assignable_v<C>);
+ }
+ {
+ // Test with a comparator that throws on move-assignment.
+ using C = std::flat_set<int, MoveThrowsComp>;
+ LIBCPP_STATIC_ASSERT(!std::is_nothrow_move_assignable_v<C>);
+ }
+ {
+ // Test with a container that throws on move-assignment.
+ using C = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ static_assert(!std::is_nothrow_move_assignable_v<C>);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_exceptions.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_exceptions.pass.cpp
new file mode 100644
index 000000000000000..17e4e40387606ce
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_exceptions.pass.cpp
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+// UNSUPPORTED: no-exceptions
+
+// <flat_set>
+
+// flat_set(flat_set&& s);
+// If any member function in [flat.map.defn] exits via an exception, the invariant is restored.
+
+#include <algorithm>
+#include <cassert>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "../helpers.h"
+#include "test_macros.h"
+
+static int countdown = 0;
+
+struct EvilContainer : std::vector<int> {
+ EvilContainer() = default;
+ EvilContainer(EvilContainer&& rhs) {
+ // Throw on move-construction.
+ if (--countdown == 0) {
+ rhs.insert(rhs.end(), 0);
+ rhs.insert(rhs.end(), 0);
+ throw 42;
+ }
+ }
+};
+
+int main(int, char**) {
+ {
+ using M = std::flat_set<int, std::less<int>, EvilContainer>;
+ M mo = {1, 2, 3};
+ countdown = 1;
+ try {
+ M m = std::move(mo);
+ assert(false); // not reached
+ } catch (int x) {
+ assert(x == 42);
+ }
+ // The source flat_set maintains its class invariant.
+ check_invariant(mo);
+ LIBCPP_ASSERT(mo.empty());
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_noexcept.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_noexcept.pass.cpp
new file mode 100644
index 000000000000000..49d1151fd8a993c
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_noexcept.pass.cpp
@@ -0,0 +1,94 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set(flat_set&&)
+// noexcept(is_nothrow_move_constructible<key_container_type>::value &&
+// is_nothrow_move_constructible<mapped_container_type>::value &&
+// is_nothrow_copy_constructible<key_compare>::value);
+
+// This tests a conforming extension
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <memory>
+#include <type_traits>
+#include <vector>
+
+#include "test_macros.h"
+#include "MoveOnly.h"
+#include "test_allocator.h"
+
+template <class T>
+struct ThrowingMoveAllocator {
+ using value_type = T;
+ explicit ThrowingMoveAllocator() = default;
+ ThrowingMoveAllocator(const ThrowingMoveAllocator&) = default;
+ ThrowingMoveAllocator(ThrowingMoveAllocator&&) noexcept(false) {}
+ T* allocate(std::ptrdiff_t n) { return std::allocator<T>().allocate(n); }
+ void deallocate(T* p, std::ptrdiff_t n) { return std::allocator<T>().deallocate(p, n); }
+ friend bool operator==(ThrowingMoveAllocator, ThrowingMoveAllocator) = default;
+};
+
+struct ThrowingMoveComp {
+ ThrowingMoveComp() = default;
+ ThrowingMoveComp(const ThrowingMoveComp&) noexcept(true) {}
+ ThrowingMoveComp(ThrowingMoveComp&&) noexcept(false) {}
+ bool operator()(const auto&, const auto&) const { return false; }
+};
+
+struct MoveSensitiveComp {
+ MoveSensitiveComp() noexcept(false) = default;
+ MoveSensitiveComp(const MoveSensitiveComp&) noexcept = default;
+ MoveSensitiveComp(MoveSensitiveComp&& rhs) { rhs.is_moved_from_ = true; }
+ MoveSensitiveComp& operator=(const MoveSensitiveComp&) noexcept(false) = default;
+ MoveSensitiveComp& operator=(MoveSensitiveComp&& rhs) {
+ rhs.is_moved_from_ = true;
+ return *this;
+ }
+ bool operator()(const auto&, const auto&) const { return false; }
+ bool is_moved_from_ = false;
+};
+
+int main(int, char**) {
+ {
+ using C = std::flat_set<int>;
+ LIBCPP_STATIC_ASSERT(std::is_nothrow_move_constructible_v<C>);
+ C c;
+ C d = std::move(c);
+ }
+ {
+ using C = std::flat_set<int, std::less<int>, std::deque<int, test_allocator<int>>>;
+ LIBCPP_STATIC_ASSERT(std::is_nothrow_move_constructible_v<C>);
+ C c;
+ C d = std::move(c);
+ }
+#if _LIBCPP_VERSION
+ {
+ // Container fails to be nothrow-move-constructible; this relies on libc++'s support for non-nothrow-copyable allocators
+ using C = std::flat_set<int, std::less<int>, std::deque<int, ThrowingMoveAllocator<int>>>;
+ static_assert(!std::is_nothrow_move_constructible_v<std::deque<int, ThrowingMoveAllocator<int>>>);
+ static_assert(!std::is_nothrow_move_constructible_v<C>);
+ C c;
+ C d = std::move(c);
+ }
+#endif // _LIBCPP_VERSION
+ {
+ // Comparator fails to be nothrow-move-constructible
+ using C = std::flat_set<int, ThrowingMoveComp>;
+ static_assert(!std::is_nothrow_move_constructible_v<C>);
+ C c;
+ C d = std::move(c);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/pmr.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/pmr.pass.cpp
new file mode 100644
index 000000000000000..785718d2eed333f
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/pmr.pass.cpp
@@ -0,0 +1,322 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+// UNSUPPORTED: availability-pmr-missing
+
+// <flat_set>
+
+// Test various constructors with pmr
+
+#include <algorithm>
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <memory_resource>
+#include <ranges>
+#include <vector>
+#include <string>
+
+#include "test_iterators.h"
+#include "test_macros.h"
+#include "test_allocator.h"
+#include "../../../test_compare.h"
+
+int main(int, char**) {
+ {
+ // flat_set(const Allocator& a);
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::polymorphic_allocator<int> pa = &mr;
+ auto m1 = M(pa);
+ assert(m1.empty());
+ assert(std::move(m1).extract().get_allocator() == pa);
+ auto m2 = M(&mr);
+ assert(m2.empty());
+ assert(std::move(m2).extract().get_allocator() == pa);
+ }
+ {
+ // flat_set(const key_compare& comp, const Alloc& a);
+ using M = std::flat_set<int, std::function<bool(int, int)>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ vm.emplace_back(std::greater<int>());
+ assert(vm[0] == M{});
+ assert(vm[0].key_comp()(2, 1) == true);
+ assert(vm[0].value_comp()(2, 1) == true);
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(const key_container_type& key_cont, const mapped_container_type& mapped_cont,
+ // const Allocator& a);
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ std::pmr::vector<int> ks = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ assert(ks.get_allocator().resource() != &mr);
+ vm.emplace_back(ks);
+ assert(ks.size() == 9); // ks' value is unchanged, since it was an lvalue above
+ assert((vm[0] == M{1, 2, 3}));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(const flat_set&, const allocator_type&);
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr1;
+ std::pmr::monotonic_buffer_resource mr2;
+ M mo = M({1, 2, 3}, C(5), &mr1);
+ M m = {mo, &mr2}; // also test the implicitness of this constructor
+
+ assert(m.key_comp() == C(5));
+ auto keys = std::move(m).extract();
+ assert((keys == std::pmr::vector<int>{1, 2, 3}));
+ assert(keys.get_allocator().resource() == &mr2);
+
+ // mo is unchanged
+ assert(mo.key_comp() == C(5));
+ auto keys2 = std::move(mo).extract();
+ assert((keys2 == std::pmr::vector<int>{1, 2, 3}));
+ assert(keys2.get_allocator().resource() == &mr1);
+ }
+ {
+ // flat_set(const flat_set&, const allocator_type&);
+ using M = std::flat_set<int, std::less<>, std::pmr::vector<int>>;
+ std::pmr::vector<M> vs;
+ M m = {1, 2, 3};
+ vs.push_back(m);
+ assert(vs[0] == m);
+ }
+ {
+ // flat_set& operator=(const flat_set& m);
+ // pmr allocator is not propagated
+ using M = std::flat_set<int, std::less<>, std::pmr::deque<int>>;
+ std::pmr::monotonic_buffer_resource mr1;
+ std::pmr::monotonic_buffer_resource mr2;
+ M mo = M({1, 2, 3}, &mr1);
+ M m = M({4, 5}, &mr2);
+ m = mo;
+ assert((m == M{1, 2, 3}));
+ assert(std::move(m).extract().get_allocator().resource() == &mr2);
+
+ // mo is unchanged
+ assert((mo == M{1, 2, 3}));
+ assert(std::move(mo).extract().get_allocator().resource() == &mr1);
+ }
+ {
+ // flat_set(const flat_set& m);
+ using C = test_less<int>;
+ std::pmr::monotonic_buffer_resource mr;
+ using M = std::flat_set<int, C, std::pmr::vector<int>>;
+ auto mo = M({1, 2, 3}, C(5), &mr);
+ auto m = mo;
+
+ assert(m.key_comp() == C(5));
+ assert((m == M{1, 2, 3}));
+ auto ks = std::move(m).extract();
+ assert(ks.get_allocator().resource() == std::pmr::get_default_resource());
+
+ // mo is unchanged
+ assert(mo.key_comp() == C(5));
+ assert((mo == M{1, 2, 3}));
+ auto kso = std::move(mo).extract();
+ assert(kso.get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(initializer_list<value_type> il, const Alloc& a);
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ std::initializer_list<M::value_type> il = {3, 1, 4, 1, 5};
+ vm.emplace_back(il);
+ assert((vm[0] == M{1, 3, 4, 5}));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(initializer_list<value_type> il, const key_compare& comp, const Alloc& a);
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::pmr::deque<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ std::initializer_list<M::value_type> il = {3, 1, 4, 1, 5};
+ vm.emplace_back(il, C(5));
+ assert((vm[0] == M{1, 3, 4, 5}));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ assert(vm[0].key_comp() == C(5));
+ }
+ {
+ // flat_set(InputIterator first, InputIterator last, const Allocator& a);
+ int ar[] = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ int expected[] = {1, 2, 3};
+ {
+ // cpp17 iterator
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ vm.emplace_back(cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 9));
+ assert(std::ranges::equal(vm[0], expected));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ vm.emplace_back(ar, ar);
+ assert(vm[0].empty());
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ }
+ {
+ // flat_set(flat_set&&, const allocator_type&);
+ int expected[] = {1, 2, 3};
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr1;
+ std::pmr::monotonic_buffer_resource mr2;
+ M mo = M({1, 3, 1, 2}, C(5), &mr1);
+ M m = {std::move(mo), &mr2}; // also test the implicitness of this constructor
+
+ assert(m.key_comp() == C(5));
+ assert(m.size() == 3);
+ assert(std::equal(m.begin(), m.end(), expected, expected + 3));
+ assert(std::move(m).extract().get_allocator().resource() == &mr2);
+
+ // The original flat_set is moved-from.
+ assert(std::is_sorted(mo.begin(), mo.end(), mo.value_comp()));
+ assert(mo.key_comp() == C(5));
+ assert(std::move(mo).extract().get_allocator().resource() == &mr1);
+ }
+ {
+ // flat_set(flat_set&&, const allocator_type&);
+ using M = std::flat_set<int, std::less<>, std::pmr::deque<int>>;
+ std::pmr::vector<M> vs;
+ M m = {1, 3, 1, 2};
+ vs.push_back(std::move(m));
+ assert((std::move(vs[0]).extract() == std::pmr::deque<int>{1, 2, 3}));
+ }
+ {
+ // flat_set& operator=(flat_set&&);
+ using M = std::flat_set<std::pmr::string, std::less<>, std::pmr::vector<std::pmr::string>>;
+ std::pmr::monotonic_buffer_resource mr1;
+ std::pmr::monotonic_buffer_resource mr2;
+ M mo =
+ M({"short", "very long string that definitely won't fit in the SSO buffer and therefore becomes empty on move"},
+ &mr1);
+ M m = M({"don't care"}, &mr2);
+ m = std::move(mo);
+ assert(m.size() == 2);
+ assert(std::is_sorted(m.begin(), m.end(), m.value_comp()));
+ assert(m.begin()->get_allocator().resource() == &mr2);
+
+ assert(std::is_sorted(mo.begin(), mo.end(), mo.value_comp()));
+ mo.insert("foo");
+ assert(mo.begin()->get_allocator().resource() == &mr1);
+ }
+ {
+ // flat_set(from_range_t, R&&, const Alloc&);
+ int ar[] = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ int expected[] = {1, 2, 3};
+ {
+ // input_range
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ using Iter = cpp20_input_iterator<const int*>;
+ using Sent = sentinel_wrapper<Iter>;
+ using R = std::ranges::subrange<Iter, Sent>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ vm.emplace_back(std::from_range, R(Iter(ar), Sent(Iter(ar + 9))));
+ assert(std::ranges::equal(vm[0], expected));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ using R = std::ranges::subrange<const int*>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ vm.emplace_back(std::from_range, R(ar, ar));
+ assert(vm[0].empty());
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ }
+ {
+ // flat_set(sorted_unique_t, const container_type& key_cont, const Alloc& a);
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ std::pmr::vector<int> ks = {1, 2, 4, 10};
+ vm.emplace_back(std::sorted_unique, ks);
+ assert(!ks.empty()); // it was an lvalue above
+ assert((vm[0] == M{1, 2, 4, 10}));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(sorted_unique_t, const container_type& key_cont,const Alloc& a);
+ using M = std::flat_set<int, std::less<int>, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ std::pmr::vector<int> ks({1, 2, 4, 10}, &mr);
+ vm.emplace_back(std::sorted_unique, ks);
+ assert((vm[0] == M{1, 2, 4, 10}));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type> il, const Alloc& a);
+ // cpp_17
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ int ar[] = {1, 2, 4, 5};
+ vm.emplace_back(
+ std::sorted_unique, cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 4), C(3));
+ assert((vm[0] == M{1, 2, 4, 5}));
+ assert(vm[0].key_comp() == C(3));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type> il, const Alloc& a);
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ int ar[1] = {42};
+ vm.emplace_back(std::sorted_unique, ar, ar, C(4));
+ assert(vm[0] == M{});
+ assert(vm[0].key_comp() == C(4));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(InputIterator first, InputIterator last, const Alloc& a);
+ // cpp_17
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ int ar[] = {1, 2, 4, 5};
+ vm.emplace_back(
+ std::sorted_unique, cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 4), C(3));
+ assert((vm[0] == M{1, 2, 4, 5}));
+ assert(vm[0].key_comp() == C(3));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+ {
+ // flat_set(InputIterator first, InputIterator last, const Alloc& a);
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::pmr::vector<int>>;
+ std::pmr::monotonic_buffer_resource mr;
+ std::pmr::vector<M> vm(&mr);
+ int ar[1] = {42};
+ vm.emplace_back(std::sorted_unique, ar, ar, C(4));
+ assert(vm[0] == M{});
+ assert(vm[0].key_comp() == C(4));
+ assert(std::move(vm[0]).extract().get_allocator().resource() == &mr);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/range.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/range.pass.cpp
new file mode 100644
index 000000000000000..bb9f99c228bfecc
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/range.pass.cpp
@@ -0,0 +1,173 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<container-compatible-range<value_type> R>
+// flat_set(from_range_t, R&&)
+// template<container-compatible-range<value_type> R>
+// flat_set(from_range_t, R&&, const key_compare&)
+// template<container-compatible-range<value_type> R, class Alloc>
+// flat_set(from_range_t, R&&, const Alloc&);
+// template<container-compatible-range<value_type> R, class Alloc>
+// flat_set(from_range_t, R&&, const key_compare&, const Alloc&);
+
+#include <algorithm>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <string>
+#include <vector>
+
+#include "min_allocator.h"
+#include "test_allocator.h"
+#include "test_iterators.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+
+// test constraint container-compatible-range
+
+template <class V>
+using RangeOf = std::ranges::subrange<V*>;
+using Set = std::flat_set<int>;
+
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<int>>);
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<short>>);
+static_assert(!std::is_constructible_v<Set, std::from_range_t, RangeOf<std::pair<int, int>>>);
+
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<int>, std::less<int>>);
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<short>, std::less<int>>);
+static_assert(!std::is_constructible_v<Set, std::from_range_t, RangeOf<std::pair<int, int>>, std::less<int>>);
+
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<int>, std::allocator<int>>);
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<short>, std::allocator<int>>);
+static_assert(!std::is_constructible_v<Set, std::from_range_t, RangeOf<std::pair<int, int>>, std::allocator<int>>);
+
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<int>, std::less<int>, std::allocator<int>>);
+static_assert(std::is_constructible_v<Set, std::from_range_t, RangeOf<int>, std::less<int>, std::allocator<int>>);
+static_assert(
+ !std::
+ is_constructible_v<Set, std::from_range_t, RangeOf<std::pair<int, int>>, std::less<int>, std::allocator<int>>);
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ static_assert(std::is_constructible_v<M1, std::from_range_t, M1, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::from_range_t, M2, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::from_range_t, M1, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::from_range_t, M2, const A1&>);
+
+ static_assert(std::is_constructible_v<M1, std::from_range_t, M1, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::from_range_t, M2, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::from_range_t, M1, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::from_range_t, M2, const C&, const A1&>);
+ }
+
+ int ar[] = {1, 1, 1, 2, 2, 3, 2, 3, 3};
+ int expected[] = {1, 2, 3};
+ {
+ // flat_set(from_range_t, R&&)
+ // input_range && !common
+ using M = std::flat_set<int>;
+ using Iter = cpp20_input_iterator<const int*>;
+ using Sent = sentinel_wrapper<Iter>;
+ using R = std::ranges::subrange<Iter, Sent>;
+ auto m = M(std::from_range, R(Iter(ar), Sent(Iter(ar + 9))));
+ assert(std::ranges::equal(m, expected));
+ LIBCPP_ASSERT(std::ranges::equal(m, expected));
+
+ // explicit(false)
+ M m2 = {std::from_range, R(Iter(ar), Sent(Iter(ar + 9)))};
+ assert(m2 == m);
+ }
+ {
+ // flat_set(from_range_t, R&&)
+ // greater
+ using M = std::flat_set<int, std::greater<int>, std::deque<int, min_allocator<int>>>;
+ using Iter = cpp20_input_iterator<const int*>;
+ using Sent = sentinel_wrapper<Iter>;
+ using R = std::ranges::subrange<Iter, Sent>;
+ auto m = M(std::from_range, R(Iter(ar), Sent(Iter(ar + 9))));
+ assert(std::ranges::equal(m, std::deque<int, min_allocator<int>>{3, 2, 1}));
+ }
+ {
+ // flat_set(from_range_t, R&&)
+ // contiguous range
+ using M = std::flat_set<int>;
+ using R = std::ranges::subrange<const int*>;
+ auto m = M(std::from_range, R(ar, ar + 9));
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ // flat_set(from_range_t, R&&, const key_compare&)
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::vector<int>>;
+ using R = std::ranges::subrange<const int*>;
+ auto m = M(std::from_range, R(ar, ar + 9), C(3));
+ assert(std::ranges::equal(m, expected));
+ assert(m.key_comp() == C(3));
+
+ // explicit(false)
+ M m2 = {std::from_range, R(ar, ar + 9), C(3)};
+ assert(m2 == m);
+ assert(m2.key_comp() == C(3));
+ }
+ {
+ // flat_set(from_range_t, R&&, const Allocator&)
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::vector<int, A1>>;
+ using R = std::ranges::subrange<const int*>;
+ auto m = M(std::from_range, R(ar, ar + 9), A1(5));
+ assert(std::ranges::equal(m, expected));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(from_range_t, R&&, const Allocator&)
+ // explicit(false)
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A1>>;
+ using R = std::ranges::subrange<const int*>;
+ M m = {std::from_range, R(ar, ar + 9), A1(5)}; // implicit ctor
+ assert(std::ranges::equal(m, expected));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(from_range_t, R&&, const key_compare&, const Allocator&)
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, C, std::vector<int, A1>>;
+ using R = std::ranges::subrange<const int*>;
+ auto m = M(std::from_range, R(ar, ar + 9), C(3), A1(5));
+ assert(std::ranges::equal(m, expected));
+ assert(m.key_comp() == C(3));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(from_range_t, R&&, const key_compare&, const Allocator&)
+ // explicit(false)
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A1>>;
+ using R = std::ranges::subrange<const int*>;
+ M m = {std::from_range, R(ar, ar + 9), {}, A1(5)}; // implicit ctor
+ assert(std::ranges::equal(m, expected));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_container.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_container.pass.cpp
new file mode 100644
index 000000000000000..2d442d49667bd07
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_container.pass.cpp
@@ -0,0 +1,143 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set(sorted_unique_t, container_type key_cont, const key_compare& comp = key_compare());
+//
+// template<class Alloc>
+// flat_set(sorted_unique_t, const container_type& key_cont, const Alloc& a);
+// template<class Alloc>
+// flat_set(sorted_unique_t, const container_type& key_cont,
+// const key_compare& comp, const Alloc& a);
+
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "min_allocator.h"
+#include "MoveOnly.h"
+#include "test_allocator.h"
+#include "test_iterators.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ static_assert(std::is_constructible_v<M1, std::sorted_unique_t, const V1&, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::sorted_unique_t, const V2&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::sorted_unique_t, const V1&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::sorted_unique_t, const V2&, const A1&>);
+
+ static_assert(std::is_constructible_v<M1, std::sorted_unique_t, const V1&, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::sorted_unique_t, const V2&, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::sorted_unique_t, const V1&, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::sorted_unique_t, const V2&, const C&, const A1&>);
+ }
+ {
+ // flat_set(sorted_unique_t, container_type)
+ using M = std::flat_set<int>;
+ std::vector<int> ks = {1, 2, 4, 10};
+ auto ks2 = ks;
+
+ auto m = M(std::sorted_unique, ks);
+ assert((m == M{1, 2, 4, 10}));
+ m = M(std::sorted_unique, std::move(ks));
+ assert(ks.empty()); // it was moved-from
+ assert((m == M{1, 2, 4, 10}));
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, std::move(ks2)};
+ assert(m == m2);
+ }
+ {
+ // flat_set(sorted_unique_t, container_type)
+ // non-default container, comparator and allocator type
+ using Ks = std::deque<int, min_allocator<int>>;
+ using M = std::flat_set<int, std::greater<int>, Ks>;
+ Ks ks = {10, 4, 2, 1};
+ auto m = M(std::sorted_unique, ks);
+ assert((m == M{1, 2, 4, 10}));
+ m = M(std::sorted_unique, std::move(ks));
+ assert(ks.empty()); // it was moved-from
+ assert((m == M{1, 2, 4, 10}));
+ }
+ {
+ // flat_set(sorted_unique_t, container_type)
+ // allocator copied into the containers
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A>>;
+ auto ks = std::deque<int, A>({1, 2, 4, 10}, A(4));
+ auto m = M(std::sorted_unique, std::move(ks));
+ assert(ks.empty()); // it was moved-from
+ assert((m == M{1, 2, 4, 10}));
+ assert(std::move(m).extract().get_allocator() == A(4));
+ }
+ {
+ // flat_set(sorted_unique_t, container_type , key_compare)
+ using C = test_less<int>;
+ using M = std::flat_set<int, C>;
+ std::vector<int> ks = {1, 2, 4, 10};
+
+ auto m = M(std::sorted_unique, ks, C(4));
+ assert((m == M{1, 2, 4, 10}));
+ assert(m.key_comp() == C(4));
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, ks, C(4)};
+ assert(m2 == m);
+ assert(m2.key_comp() == C(4));
+ }
+ {
+ // flat_set(sorted_unique_t, container_type , key_compare, const Allocator&)
+ using C = test_less<int>;
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, C, std::vector<int, A>>;
+ std::vector<int, A> ks = {1, 2, 4, 10};
+ auto m = M(std::sorted_unique, ks, C(4), A(5));
+ assert((m == M{1, 2, 4, 10}));
+ assert(m.key_comp() == C(4));
+ assert(M(m).extract().get_allocator() == A(5));
+
+ // explicit(false)
+ M m2 = {ks, C(4), A(5)};
+ assert(m2 == m);
+ assert(m2.key_comp() == C(4));
+ assert(std::move(m2).extract().get_allocator() == A(5));
+ }
+ {
+ // flat_set(sorted_unique_t, container_type , const Allocator&)
+ using A = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::deque<int, A>>;
+ auto ks = std::deque<int, A>({1, 2, 4, 10}, A(4));
+ auto m = M(std::sorted_unique, ks, A(6)); // replaces the allocators
+ assert(!ks.empty()); // it was an lvalue above
+ assert((m == M{1, 2, 4, 10}));
+ assert(M(m).extract().get_allocator() == A(6));
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, ks, A(6)};
+ assert(m2 == m);
+ assert(std::move(m2).extract().get_allocator() == A(6));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_initializer_list.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_initializer_list.pass.cpp
new file mode 100644
index 000000000000000..01956a78c7f48dd
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_initializer_list.pass.cpp
@@ -0,0 +1,150 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template <class InputIterator>
+// flat_set(sorted_unique_t s, initializer_list<value_type> il,
+// const key_compare& comp = key_compare())
+// template<class Alloc>
+// flat_set(sorted_unique_t, initializer_list<value_type> il, const Alloc& a);
+// template<class Alloc>
+// flat_set(sorted_unique_t, initializer_list<value_type> il,
+// const key_compare& comp, const Alloc& a);
+
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "min_allocator.h"
+#include "test_allocator.h"
+#include "test_iterators.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+
+template <class T>
+std::initializer_list<T> il = {1, 2, 4, 5};
+
+const auto il1 = il<int>;
+const auto il2 = il<short>;
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ using IL = std::initializer_list<int>;
+
+ static_assert(std::is_constructible_v<M1, std::sorted_unique_t, IL, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::sorted_unique_t, IL, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::sorted_unique_t, IL, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::sorted_unique_t, IL, const A1&>);
+
+ static_assert(std::is_constructible_v<M1, std::sorted_unique_t, IL, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::sorted_unique_t, IL, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::sorted_unique_t, IL, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::sorted_unique_t, IL, const C&, const A1&>);
+ }
+ {
+ // initializer_list<value_type> needs to match exactly
+ using M = std::flat_set<int>;
+ using C = typename M::key_compare;
+ static_assert(std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<int>>);
+ static_assert(std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<int>, C>);
+ static_assert(std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<int>, C, std::allocator<int>>);
+ static_assert(std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<int>, std::allocator<int>>);
+ static_assert(!std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>>);
+ static_assert(!std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>, C>);
+ static_assert(
+ !std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>, C, std::allocator<int>>);
+ static_assert(
+ !std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>, std::allocator<int>>);
+ static_assert(!std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>>);
+ static_assert(!std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>, C>);
+ static_assert(
+ !std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>, C, std::allocator<int>>);
+ static_assert(
+ !std::is_constructible_v<M, std::sorted_unique_t, std::initializer_list<const int>, std::allocator<int>>);
+ }
+
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type>);
+ using M = std::flat_set<int>;
+ auto m = M(std::sorted_unique, il1);
+ auto expected = M{1, 2, 4, 5};
+ assert(m == expected);
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, il1};
+ assert(m2 == m);
+ }
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type>, const key_compare&);
+ using M = std::flat_set<int, std::function<bool(int, int)>>;
+ auto m = M(std::sorted_unique, il1, std::less<int>());
+ assert(m == M({1, 2, 4, 5}, std::less<>()));
+ assert(m.key_comp()(1, 2) == true);
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, il1, std::less<int>()};
+ assert(m2 == m);
+ }
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type>, const key_compare&);
+ // greater
+ using M = std::flat_set<int, std::greater<int>, std::deque<int, min_allocator<int>>>;
+ std::initializer_list<int> il4{5, 4, 2, 1};
+ auto m = M(std::sorted_unique, il4, std::greater<int>());
+ assert((m == M{5, 4, 2, 1}));
+ }
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type>, const Allocator&)
+ using A1 = test_allocator<short>;
+ using M = std::flat_set<short, std::less<int>, std::deque<short, A1>>;
+ auto m = M(std::sorted_unique, il2, A1(5));
+ auto expected = M{1, 2, 4, 5};
+ assert(m == expected);
+ assert(M(m).extract().get_allocator() == A1(5));
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, il2, A1(5)};
+ assert(m2 == m);
+ assert(std::move(m2).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type>, const key_compare&, const Allocator&);
+ using C = test_less<int>;
+ using A1 = test_allocator<short>;
+ using M = std::flat_set<short, C, std::vector<short, A1>>;
+ auto m = M(std::sorted_unique, il2, C(3), A1(5));
+ assert((m == M{1, 2, 4, 5}));
+ assert(m.key_comp() == C(3));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(sorted_unique_t, initializer_list<value_type>, const key_compare&, const Allocator&);
+ // explicit(false)
+ using A1 = test_allocator<short>;
+ using M = std::flat_set<short, std::less<int>, std::deque<short, A1>>;
+ M m = {std::sorted_unique, il2, {}, A1(5)}; // implicit ctor
+ assert((m == M{1, 2, 4, 5}));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_iter_iter.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_iter_iter.pass.cpp
new file mode 100644
index 000000000000000..b5229a84dd51333
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_iter_iter.pass.cpp
@@ -0,0 +1,156 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template <class InputIterator>
+// flat_set(sorted_unique_t, InputIterator first, InputIterator last, const key_compare& comp = key_compare());
+// template<class InputIterator, class Alloc>
+// flat_set(sorted_unique_t, InputIterator first, InputIterator last, const Alloc& a);
+// template<class InputIterator, class Allocator>
+// flat_set(sorted_unique_t, InputIterator first, InputIterator last, const key_compare& comp, const Allocator& a);
+
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "min_allocator.h"
+#include "test_allocator.h"
+#include "test_iterators.h"
+#include "test_macros.h"
+#include "../../../test_compare.h"
+
+int main(int, char**) {
+ {
+ // The constructors in this subclause shall not participate in overload
+ // resolution unless uses_allocator_v<container_type, Alloc> is true.
+
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using A2 = other_allocator<int>;
+ using V1 = std::vector<int, A1>;
+ using V2 = std::vector<int, A2>;
+ using M1 = std::flat_set<int, C, V1>;
+ using M2 = std::flat_set<int, C, V2>;
+ using Iter1 = typename M1::iterator;
+ using Iter2 = typename M2::iterator;
+ static_assert(std::is_constructible_v<M1, std::sorted_unique_t, Iter1, Iter1, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::sorted_unique_t, Iter2, Iter2, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::sorted_unique_t, Iter1, Iter1, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::sorted_unique_t, Iter2, Iter2, const A1&>);
+
+ static_assert(std::is_constructible_v<M1, std::sorted_unique_t, Iter1, Iter1, const C&, const A1&>);
+ static_assert(std::is_constructible_v<M2, std::sorted_unique_t, Iter2, Iter2, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M1, std::sorted_unique_t, Iter1, Iter1, const C&, const A2&>);
+ static_assert(!std::is_constructible_v<M2, std::sorted_unique_t, Iter2, Iter2, const C&, const A1&>);
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator, InputIterator);
+ // cpp17_input_iterator
+ using M = std::flat_set<int>;
+ int ar[] = {1, 2, 4, 5};
+ auto m = M(std::sorted_unique, cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 4));
+ auto expected = M{1, 2, 4, 5};
+ assert(m == expected);
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 4)};
+ assert(m2 == m);
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator, InputIterator);
+ // contiguous iterator
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::vector<int, min_allocator<int>>>;
+ int ar[] = {1, 2, 4, 5};
+ auto m = M(std::sorted_unique, ar, ar + 4);
+ auto expected = M{1, 2, 4, 5};
+ assert(m == expected);
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator, InputIterator, const key_compare&);
+ // cpp_17_input_iterator
+ using M = std::flat_set<int, std::function<bool(int, int)>>;
+ int ar[] = {1, 2, 4, 5};
+ auto m = M(std::sorted_unique,
+ cpp17_input_iterator<const int*>(ar),
+ cpp17_input_iterator<const int*>(ar + 4),
+ std::less<int>());
+ assert(m == M({1, 2, 4, 5}, std::less<>()));
+ assert(m.key_comp()(1, 2) == true);
+
+ // explicit(false)
+ M m2 = {std::sorted_unique,
+ cpp17_input_iterator<const int*>(ar),
+ cpp17_input_iterator<const int*>(ar + 4),
+ std::less<int>()};
+ assert(m2 == m);
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator, InputIterator, const key_compare&);
+ // greater
+ using M = std::flat_set<int, std::greater<int>, std::deque<int, min_allocator<int>>>;
+ int ar[] = {5, 4, 2, 1};
+ auto m = M(std::sorted_unique,
+ cpp17_input_iterator<const int*>(ar),
+ cpp17_input_iterator<const int*>(ar + 4),
+ std::greater<int>());
+ assert((m == M{5, 4, 2, 1}));
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator, InputIterator, const key_compare&);
+ // contiguous iterator
+ using C = test_less<int>;
+ using M = std::flat_set<int, C, std::vector<int, min_allocator<int>>>;
+ int ar[1] = {42};
+ auto m = M(std::sorted_unique, ar, ar, C(5));
+ assert(m.empty());
+ assert(m.key_comp() == C(5));
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator , InputIterator, const Allocator&)
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, std::less<int>, std::vector<int, A1>>;
+ int ar[] = {1, 2, 4, 5};
+ auto m = M(std::sorted_unique, ar, ar + 4, A1(5));
+ auto expected = M{1, 2, 4, 5};
+ assert(m == expected);
+ assert(M(m).extract().get_allocator() == A1(5));
+
+ // explicit(false)
+ M m2 = {std::sorted_unique, ar, ar + 4, A1(5)};
+ assert(m2 == m);
+ assert(std::move(m2).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator, InputIterator, const key_compare&, const Allocator&);
+ using C = test_less<int>;
+ using A1 = test_allocator<int>;
+ using M = std::flat_set<int, C, std::deque<int, A1>>;
+ int ar[] = {1, 2, 4, 5};
+ auto m = M(std::sorted_unique, ar, ar + 4, C(3), A1(5));
+ assert((m == M{1, 2, 4, 5}));
+ assert(m.key_comp() == C(3));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+ {
+ // flat_set(sorted_unique_t, InputIterator, InputIterator, const key_compare&, const Allocator&);
+ // explicit(false)
+ using A1 = test_allocator<short>;
+ using M = std::flat_set<short, std::less<int>, std::deque<short, A1>>;
+ int ar[] = {1, 2, 4, 5};
+ M m = {std::sorted_unique, ar, ar + 4, {}, A1(5)}; // implicit ctor
+ assert((m == M{1, 2, 4, 5}));
+ assert(std::move(m).extract().get_allocator() == A1(5));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if.pass.cpp
new file mode 100644
index 000000000000000..134db83aef3cad2
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if.pass.cpp
@@ -0,0 +1,89 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class Key, class Compare, class KeyContainer, class Predicate>
+// typename flat_set<Key, Compare, KeyContainer>::size_type
+// erase_if(flat_set<Key, Compare, KeyContainer>& c, Predicate pred);
+
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <initializer_list>
+#include <vector>
+
+#include "test_macros.h"
+#include "test_allocator.h"
+#include "min_allocator.h"
+
+// Verify that `flat_set` (like `set`) does NOT support std::erase.
+//
+template <class S>
+concept HasStdErase = requires(S& s, typename S::value_type x) { std::erase(s, x); };
+static_assert(HasStdErase<std::vector<int>>);
+static_assert(!HasStdErase<std::flat_set<int>>);
+
+template <class M>
+M make(std::initializer_list<int> vals) {
+ M ret;
+ for (int v : vals)
+ ret.emplace(v);
+ return ret;
+}
+
+template <class M, class Pred>
+void test0(
+ std::initializer_list<int> vals, Pred p, std::initializer_list<int> expected, std::size_t expected_erased_count) {
+ M s = make<M>(vals);
+ ASSERT_SAME_TYPE(typename M::size_type, decltype(std::erase_if(s, p)));
+ assert(expected_erased_count == std::erase_if(s, p));
+ assert(s == make<M>(expected));
+}
+
+template <class S>
+void test() {
+ // Test all the plausible signatures for this predicate.
+ auto is1 = [](typename S::const_reference v) { return v == 1; };
+ auto is2 = [](typename S::value_type v) { return v == 2; };
+ auto is3 = [](const typename S::value_type& v) { return v == 3; };
+ auto is4 = [](auto v) { return v == 4; };
+ auto True = [](const auto&) { return true; };
+ auto False = [](auto&&) { return false; };
+
+ test0<S>({}, is1, {}, 0);
+
+ test0<S>({1}, is1, {}, 1);
+ test0<S>({1}, is2, {1}, 0);
+
+ test0<S>({1, 2}, is1, {2}, 1);
+ test0<S>({1, 2}, is2, {1}, 1);
+ test0<S>({1, 2}, is3, {1, 2}, 0);
+
+ test0<S>({1, 2, 3}, is1, {2, 3}, 1);
+ test0<S>({1, 2, 3}, is2, {1, 3}, 1);
+ test0<S>({1, 2, 3}, is3, {1, 2}, 1);
+ test0<S>({1, 2, 3}, is4, {1, 2, 3}, 0);
+
+ test0<S>({1, 2, 3}, True, {}, 3);
+ test0<S>({1, 2, 3}, False, {1, 2, 3}, 0);
+}
+
+int main(int, char**) {
+ test<std::flat_set<int>>();
+ test<std::flat_set<int, std::less<int>, std::vector<int, min_allocator<int>>>>();
+ test<std::flat_set<int, std::greater<int>, std::vector<int, test_allocator<int>>>>();
+ test<std::flat_set<int, std::less<int>, std::deque<int, min_allocator<int>>>>();
+ test<std::flat_set<int, std::greater<int>, std::deque<int, test_allocator<int>>>>();
+ test<std::flat_set<long>>();
+ test<std::flat_set<double>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if_exceptions.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if_exceptions.pass.cpp
new file mode 100644
index 000000000000000..6bbe1ad4f016705
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if_exceptions.pass.cpp
@@ -0,0 +1,128 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+// UNSUPPORTED: no-exceptions
+
+// <flat_set>
+
+// template<class Key, class Compare, class KeyContainer, class Predicate>
+// typename flat_set<Key, Compare, KeyContainer>::size_type
+// erase_if(flat_set<Key, Compare, KeyContainer>& c, Predicate pred);
+// If any member function in [flat.set.defn] exits via an exception, the invariant is restored.
+// (This is not a member function, but let's respect the invariant anyway.)
+
+#include <algorithm>
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "../helpers.h"
+#include "test_macros.h"
+
+struct Counter {
+ int c1, c2, throws;
+ void tick() {
+ c1 -= 1;
+ if (c1 == 0) {
+ c1 = c2;
+ throws += 1;
+ throw 42;
+ }
+ }
+};
+Counter g_counter = {0, 0, 0};
+
+struct ThrowingAssignment {
+ ThrowingAssignment(int i) : i_(i) {}
+ ThrowingAssignment(const ThrowingAssignment&) = default;
+ ThrowingAssignment& operator=(const ThrowingAssignment& rhs) {
+ g_counter.tick();
+ i_ = rhs.i_;
+ g_counter.tick();
+ return *this;
+ }
+ operator int() const { return i_; }
+ int i_;
+};
+
+struct ThrowingComparator {
+ bool operator()(const ThrowingAssignment& a, const ThrowingAssignment& b) const {
+ g_counter.tick();
+ return a.i_ < b.i_;
+ }
+};
+
+struct ErasurePredicate {
+ bool operator()(const auto& x) const { return (3 <= x && x <= 5); }
+};
+
+int main(int, char**) {
+ const int expected[] = {1, 2, 3, 4, 5, 6, 7, 8};
+ {
+ using M = std::flat_set<ThrowingAssignment, ThrowingComparator>;
+ for (int first_throw = 1; first_throw < 99; ++first_throw) {
+ for (int second_throw = 1; second_throw < 99; ++second_throw) {
+ g_counter = {0, 0, 0};
+ M m = M({1, 2, 3, 4, 5, 6, 7, 8});
+ try {
+ g_counter = {first_throw, second_throw, 0};
+ auto n = std::erase_if(m, ErasurePredicate());
+ assert(n == 3);
+ // If it didn't throw at all, we're done.
+ g_counter = {0, 0, 0};
+ assert((m == M{1, 2, 6, 7, 8}));
+ first_throw = 99; // "done"
+ break;
+ } catch (int ex) {
+ assert(ex == 42);
+ check_invariant(m);
+ LIBCPP_ASSERT(m.empty() || std::equal(m.begin(), m.end(), expected, expected + 8));
+ if (g_counter.throws == 1) {
+ // We reached the first throw but not the second throw.
+ break;
+ }
+ }
+ }
+ }
+ }
+
+ {
+ using M = std::flat_set<ThrowingAssignment, ThrowingComparator, std::deque<ThrowingAssignment>>;
+ for (int first_throw = 1; first_throw < 99; ++first_throw) {
+ for (int second_throw = 1; second_throw < 99; ++second_throw) {
+ g_counter = {0, 0, 0};
+ std::deque<ThrowingAssignment> container = {5, 6, 7, 8};
+ container.insert(container.begin(), {1, 2, 3, 4});
+ M m = M(std::move(container));
+ try {
+ g_counter = {first_throw, second_throw, 0};
+ auto n = std::erase_if(m, ErasurePredicate());
+ assert(n == 3);
+ // If it didn't throw at all, we're done.
+ g_counter = {0, 0, 0};
+ assert((m == M{1, 2, 6, 7, 8}));
+ first_throw = 99; // "done"
+ break;
+ } catch (int ex) {
+ assert(ex == 42);
+ check_invariant(m);
+ LIBCPP_ASSERT(m.empty() || std::equal(m.begin(), m.end(), expected, expected + 8));
+ if (g_counter.throws == 1) {
+ // We reached the first throw but not the second throw.
+ break;
+ }
+ }
+ }
+ }
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator.pass.cpp
new file mode 100644
index 000000000000000..c07297a141ad109
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator.pass.cpp
@@ -0,0 +1,93 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator begin() noexcept;
+// const_iterator begin() const noexcept
+// iterator end() noexcept;
+// const_iterator end() const noexcept;
+//
+// const_iterator cbegin() const noexcept;
+// const_iterator cend() const noexcept;
+
+#include <cassert>
+#include <cstddef>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <string>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ M m = {1, 2, 3, 4};
+ const M& cm = m;
+ ASSERT_SAME_TYPE(decltype(m.begin()), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(m.cbegin()), typename M::const_iterator);
+ ASSERT_SAME_TYPE(decltype(cm.begin()), typename M::const_iterator);
+ ASSERT_SAME_TYPE(decltype(m.end()), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(m.cend()), typename M::const_iterator);
+ ASSERT_SAME_TYPE(decltype(cm.end()), typename M::const_iterator);
+ static_assert(noexcept(m.begin()));
+ static_assert(noexcept(cm.begin()));
+ static_assert(noexcept(m.cbegin()));
+ static_assert(noexcept(m.end()));
+ static_assert(noexcept(cm.end()));
+ static_assert(noexcept(m.cend()));
+ assert(m.size() == 4);
+ assert(std::distance(m.begin(), m.end()) == 4);
+ assert(std::distance(cm.begin(), cm.end()) == 4);
+ assert(std::distance(m.cbegin(), m.cend()) == 4);
+ typename M::iterator i; // default-construct
+ i = m.begin(); // move-assignment
+ typename M::const_iterator k = i; // converting constructor
+ assert(i == k); // comparison
+ for (int j = 1; j <= 4; ++j, ++i) { // pre-increment
+ assert(*i == j); // operator*
+ }
+ assert(i == m.end());
+ for (int j = 4; j >= 1; --j) {
+ --i; // pre-decrement
+ assert((*i) == j);
+ }
+ assert(i == m.begin());
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ // N3644 testing
+ using C = std::flat_set<int, char>;
+ C::iterator ii1{}, ii2{};
+ C::iterator ii4 = ii1;
+ C::const_iterator cii{};
+ assert(ii1 == ii2);
+ assert(ii1 == ii4);
+ assert(!(ii1 != ii2));
+
+ assert((ii1 == cii));
+ assert((cii == ii1));
+ assert(!(ii1 != cii));
+ assert(!(cii != ii1));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_comparison.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_comparison.pass.cpp
new file mode 100644
index 000000000000000..29441dcc57d40e4
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_comparison.pass.cpp
@@ -0,0 +1,154 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// flat_set iterators should be C++20 random access iterators
+
+#include <compare>
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using KI = typename KeyContainer::iterator;
+ using I = M::iterator;
+ using CI = M::const_iterator;
+ using RI = M::reverse_iterator;
+ using CRI = M::const_reverse_iterator;
+
+ static_assert(std::equality_comparable<I>);
+ static_assert(std::equality_comparable<CI>);
+ static_assert(std::equality_comparable<RI>);
+ static_assert(std::equality_comparable<CRI>);
+
+ static_assert(std::totally_ordered<I>);
+ static_assert(std::totally_ordered<CI>);
+ static_assert(std::totally_ordered<RI>);
+ static_assert(std::totally_ordered<CRI>);
+
+ M m = {1, 2, 3, 4};
+
+ I i1 = m.begin();
+ I i2 = m.begin() + 1;
+
+ assert(i1 == i1);
+ assert(!(i1 != i1));
+ assert(i1 != i2);
+ assert(!(i1 == i2));
+ assert(i1 < i2);
+ assert(!(i1 < i1));
+ assert(i1 <= i1);
+ assert(i1 <= i2);
+ assert(!(i2 <= i1));
+ assert(i2 > i1);
+ assert(!(i2 > i2));
+ assert(i2 >= i1);
+ assert(i2 >= i2);
+ assert(!(i1 >= i2));
+
+ CI ci1 = m.cbegin();
+ CI ci2 = m.cbegin() + 1;
+ assert(ci1 == ci1);
+ assert(!(ci1 != ci1));
+ assert(ci1 != ci2);
+ assert(!(ci1 == ci2));
+ assert(ci1 < ci2);
+ assert(!(ci1 < ci1));
+ assert(ci1 <= ci1);
+ assert(ci1 <= ci2);
+ assert(!(ci2 <= ci1));
+ assert(ci2 > ci1);
+ assert(!(ci2 > ci2));
+ assert(ci2 >= ci1);
+ assert(ci2 >= ci2);
+ assert(!(ci1 >= ci2));
+
+ RI ri1 = m.rbegin();
+ RI ri2 = m.rbegin() + 1;
+ assert(ri1 == ri1);
+ assert(!(ri1 != ri1));
+ assert(ri1 != ri2);
+ assert(!(ri1 == ri2));
+ assert(ri1 < ri2);
+ assert(!(ri1 < ri1));
+ assert(ri1 <= ri1);
+ assert(ri1 <= ri2);
+ assert(!(ri2 <= ri1));
+ assert(ri2 > ri1);
+ assert(!(ri2 > ri2));
+ assert(ri2 >= ri1);
+ assert(ri2 >= ri2);
+ assert(!(ri1 >= ri2));
+
+ CRI cri1 = m.crbegin();
+ CRI cri2 = m.crbegin() + 1;
+ assert(cri1 == cri1);
+ assert(!(cri1 != cri1));
+ assert(cri1 != cri2);
+ assert(!(cri1 == cri2));
+ assert(cri1 < cri2);
+ assert(!(cri1 < cri1));
+ assert(cri1 <= cri1);
+ assert(cri1 <= cri2);
+ assert(!(cri2 <= cri1));
+ assert(cri2 > cri1);
+ assert(!(cri2 > cri2));
+ assert(cri2 >= cri1);
+ assert(cri2 >= cri2);
+ assert(!(cri1 >= cri2));
+
+ if constexpr (std::three_way_comparable<KI>) {
+ static_assert(std::three_way_comparable<I>); // ...of course the wrapped iterators still support <=>.
+ static_assert(std::three_way_comparable<CI>);
+ static_assert(std::three_way_comparable<RI>);
+ static_assert(std::three_way_comparable<CRI>);
+ static_assert(std::same_as<decltype(I() <=> I()), std::strong_ordering>);
+ static_assert(std::same_as<decltype(I() <=> CI()), std::strong_ordering>);
+ static_assert(std::same_as<decltype(CI() <=> CI()), std::strong_ordering>);
+ static_assert(std::same_as<decltype(RI() <=> RI()), std::strong_ordering>);
+ static_assert(std::same_as<decltype(RI() <=> CRI()), std::strong_ordering>);
+ static_assert(std::same_as<decltype(CRI() <=> CRI()), std::strong_ordering>);
+
+ assert(i1 <=> i1 == std::strong_ordering::equivalent);
+ assert(i1 <=> i2 == std::strong_ordering::less);
+ assert(i2 <=> i1 == std::strong_ordering::greater);
+
+ assert(ci1 <=> ci1 == std::strong_ordering::equivalent);
+ assert(ci1 <=> ci2 == std::strong_ordering::less);
+ assert(ci2 <=> ci1 == std::strong_ordering::greater);
+
+ assert(ri1 <=> ri1 == std::strong_ordering::equivalent);
+ assert(ri1 <=> ri2 == std::strong_ordering::less);
+ assert(ri2 <=> ri1 == std::strong_ordering::greater);
+
+ assert(cri1 <=> cri1 == std::strong_ordering::equivalent);
+ assert(cri1 <=> cri2 == std::strong_ordering::less);
+ assert(cri2 <=> cri1 == std::strong_ordering::greater);
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_concept_conformance.compile.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_concept_conformance.compile.pass.cpp
new file mode 100644
index 000000000000000..35b45b6e797233e
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_concept_conformance.compile.pass.cpp
@@ -0,0 +1,77 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator, const_iterator, reverse_iterator, const_reverse_iterator
+
+#include <flat_set>
+#include <deque>
+#include <functional>
+#include <iterator>
+#include <string>
+#include <vector>
+#include <type_traits>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using C = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using I = C::iterator;
+ using CI = C::const_iterator;
+ using RI = C::reverse_iterator;
+ using CRI = C::const_reverse_iterator;
+ static_assert(std::random_access_iterator<I>);
+ static_assert(std::random_access_iterator<CI>);
+ static_assert(std::random_access_iterator<RI>);
+ static_assert(std::random_access_iterator<CRI>);
+ static_assert(!std::contiguous_iterator<RI>);
+ static_assert(!std::contiguous_iterator<CRI>);
+ static_assert(!std::indirectly_writable<I, std::pair<int, char>>);
+ static_assert(!std::indirectly_writable<CI, std::pair<int, char>>);
+ static_assert(!std::indirectly_writable<RI, std::pair<int, char>>);
+ static_assert(!std::indirectly_writable<CRI, std::pair<int, char>>);
+ static_assert(std::sentinel_for<I, I>);
+ static_assert(std::sentinel_for<I, CI>);
+ static_assert(!std::sentinel_for<I, RI>);
+ static_assert(!std::sentinel_for<I, CRI>);
+ static_assert(std::sentinel_for<CI, I>);
+ static_assert(std::sentinel_for<CI, CI>);
+ static_assert(!std::sentinel_for<CI, RI>);
+ static_assert(!std::sentinel_for<CI, CRI>);
+ static_assert(!std::sentinel_for<RI, I>);
+ static_assert(!std::sentinel_for<RI, CI>);
+ static_assert(std::sentinel_for<RI, RI>);
+ static_assert(std::sentinel_for<RI, CRI>);
+ static_assert(!std::sentinel_for<CRI, I>);
+ static_assert(!std::sentinel_for<CRI, CI>);
+ static_assert(std::sentinel_for<CRI, RI>);
+ static_assert(std::sentinel_for<CRI, CRI>);
+ static_assert(std::indirectly_movable_storable<I, Key*>);
+ static_assert(std::indirectly_movable_storable<CI, Key*>);
+ static_assert(std::indirectly_movable_storable<RI, Key*>);
+ static_assert(std::indirectly_movable_storable<CRI, Key*>);
+
+ static_assert(std::is_same_v<typename std::iterator_traits<I>::iterator_category, std::random_access_iterator_tag>);
+ static_assert(std::is_same_v<typename std::iterator_traits<CI>::iterator_category, std::random_access_iterator_tag>);
+ static_assert(std::is_same_v<typename std::iterator_traits<RI>::iterator_category, std::random_access_iterator_tag>);
+ static_assert(std::is_same_v<typename std::iterator_traits<CRI>::iterator_category, std::random_access_iterator_tag>);
+}
+
+void test() {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/range_concept_conformance.compile.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/range_concept_conformance.compile.pass.cpp
new file mode 100644
index 000000000000000..4ec64e706b70218
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/range_concept_conformance.compile.pass.cpp
@@ -0,0 +1,52 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <ranges>
+#include <string>
+#include <vector>
+#include "MinSequenceContainer.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ {
+ using Key = typename KeyContainer::value_type;
+ using C = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ static_assert(std::same_as<std::ranges::iterator_t<C>, typename C::iterator>);
+ static_assert(std::ranges::random_access_range<C>);
+ static_assert(std::ranges::common_range<C>);
+ static_assert(std::ranges::input_range<C>);
+ static_assert(!std::ranges::view<C>);
+ static_assert(std::ranges::sized_range<C>);
+ static_assert(!std::ranges::borrowed_range<C>);
+ static_assert(std::ranges::viewable_range<C>);
+
+ static_assert(std::same_as<std::ranges::iterator_t<const C>, typename C::const_iterator>);
+ static_assert(std::ranges::random_access_range<const C>);
+ static_assert(std::ranges::common_range<const C>);
+ static_assert(std::ranges::input_range<const C>);
+ static_assert(!std::ranges::view<const C>);
+ static_assert(std::ranges::sized_range<const C>);
+ static_assert(!std::ranges::borrowed_range<const C>);
+ static_assert(!std::ranges::viewable_range<const C>);
+ }
+}
+
+void test() {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/reverse_iterator.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/reverse_iterator.pass.cpp
new file mode 100644
index 000000000000000..a16383cdcf53830
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/reverse_iterator.pass.cpp
@@ -0,0 +1,87 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// reverse_iterator rbegin() noexcept;
+// const_reverse_iterator rbegin() const noexcept;
+// reverse_iterator rend() noexcept;
+// const_reverse_iterator rend() const noexcept;
+//
+// const_reverse_iterator crbegin() const noexcept;
+// const_reverse_iterator crend() const noexcept;
+
+#include <cassert>
+#include <cstddef>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include <iterator>
+
+#include "test_macros.h"
+#include <iostream>
+
+int main(int, char**) {
+ {
+ using M = std::flat_set<int, std::less<int>, std::deque<int>>;
+ M m = {1, 2, 3, 4};
+ const M& cm = m;
+ ASSERT_SAME_TYPE(decltype(m.rbegin()), M::reverse_iterator);
+ ASSERT_SAME_TYPE(decltype(m.crbegin()), M::const_reverse_iterator);
+ ASSERT_SAME_TYPE(decltype(cm.rbegin()), M::const_reverse_iterator);
+ ASSERT_SAME_TYPE(decltype(m.rend()), M::reverse_iterator);
+ ASSERT_SAME_TYPE(decltype(m.crend()), M::const_reverse_iterator);
+ ASSERT_SAME_TYPE(decltype(cm.rend()), M::const_reverse_iterator);
+ static_assert(noexcept(m.rbegin()));
+ static_assert(noexcept(cm.rbegin()));
+ static_assert(noexcept(m.crbegin()));
+ static_assert(noexcept(m.rend()));
+ static_assert(noexcept(cm.rend()));
+ static_assert(noexcept(m.crend()));
+ assert(m.size() == 4);
+ assert(std::distance(m.rbegin(), m.rend()) == 4);
+ assert(std::distance(cm.rbegin(), cm.rend()) == 4);
+ assert(std::distance(m.crbegin(), m.crend()) == 4);
+ assert(std::distance(cm.crbegin(), cm.crend()) == 4);
+ M::reverse_iterator i; // default-construct
+ ASSERT_SAME_TYPE(decltype(*i), const int&);
+ i = m.rbegin(); // move-assignment
+ M::const_reverse_iterator k = i; // converting constructor
+ assert(i == k); // comparison
+ for (int j = 4; j >= 1; --j, ++i) { // pre-increment
+ assert(*i == j);
+ }
+ assert(i == m.rend());
+ for (int j = 1; j <= 4; ++j) {
+ --i; // pre-decrement
+ assert(*i == j);
+ }
+ assert(i == m.rbegin());
+ }
+ {
+ // N3644 testing
+ using C = std::flat_set<int, char>;
+ C::reverse_iterator ii1{}, ii2{};
+ C::reverse_iterator ii4 = ii1;
+ C::const_reverse_iterator cii{};
+ assert(ii1 == ii2);
+ assert(ii1 == ii4);
+ assert(!(ii1 != ii2));
+
+ assert((ii1 == cii));
+ assert((cii == ii1));
+ assert(!(ii1 != cii));
+ assert(!(cii != ii1));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/clear.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/clear.pass.cpp
new file mode 100644
index 000000000000000..221a13fa057577a
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/clear.pass.cpp
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// class flat_set
+
+// void clear() noexcept;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// test noexcept
+
+template <class T>
+concept NoExceptClear = requires(T t) {
+ { t.clear() } noexcept;
+};
+
+static_assert(NoExceptClear<std::flat_set<int>>);
+#ifndef TEST_HAS_NO_EXCEPTIONS
+static_assert(NoExceptClear<std::flat_set<int, std::less<int>, ThrowOnMoveContainer<int>>>);
+#endif
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ M m = {1, 2, 3, 4, 5};
+ assert(m.size() == 5);
+ ASSERT_NOEXCEPT(m.clear());
+ ASSERT_SAME_TYPE(decltype(m.clear()), void);
+ m.clear();
+ assert(m.size() == 0);
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace.pass.cpp
new file mode 100644
index 000000000000000..95f7a3c5f5d34a2
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace.pass.cpp
@@ -0,0 +1,141 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template <class... Args>
+// pair<iterator, bool> emplace(Args&&... args);
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+#include <tuple>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "../../../Emplaceable.h"
+#include "DefaultOnly.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using R = std::pair<typename M::iterator, bool>;
+ {
+ // was empty
+ M m;
+ std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 1);
+ assert(*r.first == 2);
+ }
+ {
+ // key does not exist and inserted at the begin
+ M m = {3, 5, 6, 7};
+ std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 5);
+ assert(*r.first == 2);
+ }
+ {
+ // key does not exist and inserted in the middle
+ M m = {0, 1, 3, 4};
+ std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
+ assert(r.second);
+ assert(r.first == m.begin() + 2);
+ assert(m.size() == 5);
+ assert(*r.first == 2);
+ }
+ {
+ // key does not exist and inserted at the end
+ M m = {0, 1};
+ std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
+ assert(r.second);
+ assert(r.first == m.begin() + 2);
+ assert(m.size() == 3);
+ assert(*r.first == 2);
+ }
+ {
+ // key already exists and original at the begin
+ M m = {2, 3, 5, 6};
+ std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
+ assert(!r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 4);
+ assert(*r.first == 2);
+ }
+ {
+ // key already exists and original in the middle
+ M m = {0, 2, 3, 4};
+ std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
+ assert(!r.second);
+ assert(r.first == m.begin() + 1);
+ assert(m.size() == 4);
+ assert(*r.first == 2);
+ }
+ {
+ // key already exists and original at the end
+ M m = {0, 1, 2};
+ std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2));
+ assert(!r.second);
+ assert(r.first == m.begin() + 2);
+ assert(m.size() == 3);
+ assert(*r.first == 2);
+ }
+}
+
+template <class KeyContainer>
+void test_emplaceable() {
+ using M = std::flat_set<Emplaceable, std::less<Emplaceable>, KeyContainer>;
+ using R = std::pair<typename M::iterator, bool>;
+
+ M m;
+ ASSERT_SAME_TYPE(decltype(m.emplace()), R);
+ R r = m.emplace(2, 0.0);
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 1);
+ assert(*m.begin() == Emplaceable(2, 0.0));
+ r = m.emplace(1, 3.5);
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 2);
+ assert(*m.begin() == Emplaceable(1, 3.5));
+ r = m.emplace(1, 3.5);
+ assert(!r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 2);
+ assert(*m.begin() == Emplaceable(1, 3.5));
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ test_emplaceable<std::vector<Emplaceable>>();
+ test_emplaceable<std::deque<Emplaceable>>();
+ test_emplaceable<MinSequenceContainer<Emplaceable>>();
+ test_emplaceable<std::vector<Emplaceable, min_allocator<Emplaceable>>>();
+
+ {
+ auto emplace_func = [](auto& m, auto key_arg) { m.emplace(key_arg); };
+ test_emplace_exception_guarantee(emplace_func);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace_hint.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace_hint.pass.cpp
new file mode 100644
index 000000000000000..de855d5e5c30097
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace_hint.pass.cpp
@@ -0,0 +1,154 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template <class... Args>
+// iterator emplace_hint(const_iterator position, Args&&... args);
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "../../../Emplaceable.h"
+#include "DefaultOnly.h"
+#include "min_allocator.h"
+#include "../helpers.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using R = M::iterator;
+ {
+ // was empty
+ M m;
+ std::same_as<R> decltype(auto) r = m.emplace_hint(m.end(), typename M::value_type(2));
+ assert(r == m.begin());
+ assert(m.size() == 1);
+ assert(*r == 2);
+ }
+ {
+ // hints correct at the begin
+ M m = {3, 4};
+ auto hint = m.begin();
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin());
+ assert(m.size() == 3);
+ assert(*r == 2);
+ }
+ {
+ // hints correct in the middle
+ M m = {0, 1, 3, 4};
+ auto hint = m.begin() + 2;
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin() + 2);
+ assert(m.size() == 5);
+ assert(*r == 2);
+ }
+ {
+ // hints correct at the end
+ M m = {0, 1};
+ auto hint = m.end();
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin() + 2);
+ assert(m.size() == 3);
+ assert(*r == 2);
+ }
+ {
+ // hints correct but key already exists
+ M m = {0, 1, 2, 3, 4};
+ auto hint = m.begin() + 2;
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin() + 2);
+ assert(m.size() == 5);
+ assert(*r == 2);
+ }
+ {
+ // hints incorrectly at the begin
+ M m = {1, 4};
+ auto hint = m.begin();
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin() + 1);
+ assert(m.size() == 3);
+ assert(*r == 2);
+ }
+ {
+ // hints incorrectly in the middle
+ M m = {0, 1, 3, 4};
+ auto hint = m.begin() + 1;
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin() + 2);
+ assert(m.size() == 5);
+ assert(*r == 2);
+ }
+ {
+ // hints incorrectly at the end
+ M m = {0, 3};
+ auto hint = m.end();
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin() + 1);
+ assert(m.size() == 3);
+ assert(*r == 2);
+ }
+ {
+ // hints incorrect and key already exists
+ M m = {0, 1, 2, 3, 4};
+ auto hint = m.begin();
+ std::same_as<R> decltype(auto) r = m.emplace_hint(hint, typename M::value_type(2));
+ assert(r == m.begin() + 2);
+ assert(m.size() == 5);
+ assert(*r == 2);
+ }
+}
+
+template <class KeyContainer>
+void test_emplaceable() {
+ using M = std::flat_set<Emplaceable, std::less<Emplaceable>, KeyContainer>;
+ using R = M::iterator;
+
+ M m;
+ ASSERT_SAME_TYPE(decltype(m.emplace_hint(m.cbegin())), R);
+ R r = m.emplace_hint(m.end(), 2, 0.0);
+ assert(r == m.begin());
+ assert(m.size() == 1);
+ assert(*m.begin() == Emplaceable(2, 0.0));
+ r = m.emplace_hint(m.end(), 1, 3.5);
+ assert(r == m.begin());
+ assert(m.size() == 2);
+ assert(*m.begin() == Emplaceable(1, 3.5));
+ r = m.emplace_hint(m.end(), 1, 3.5);
+ assert(r == m.begin());
+ assert(m.size() == 2);
+ assert(*m.begin() == Emplaceable(1, 3.5));
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ test_emplaceable<std::vector<Emplaceable>>();
+ test_emplaceable<std::vector<Emplaceable>>();
+ test_emplaceable<MinSequenceContainer<Emplaceable>>();
+ test_emplaceable<std::vector<Emplaceable, min_allocator<Emplaceable>>>();
+
+ {
+ auto emplace_func = [](auto& m, auto key_arg) { m.emplace_hint(m.begin(), key_arg); };
+ test_emplace_exception_guarantee(emplace_func);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter.pass.cpp
new file mode 100644
index 000000000000000..386af04d26e9a2e
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter.pass.cpp
@@ -0,0 +1,121 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator erase(iterator position);
+// iterator erase(const_iterator position);
+
+#include <compare>
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using I = M::iterator;
+
+ int ar[] = {
+ 1,
+ 2,
+ 3,
+ 4,
+ 5,
+ 6,
+ 7,
+ 8,
+ };
+ M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
+ assert(m.size() == 8);
+ std::same_as<I> decltype(auto) i1 = m.erase(std::next(m.cbegin(), 3));
+ assert(m.size() == 7);
+ assert(i1 == std::next(m.begin(), 3));
+ assert(*m.begin() == 1);
+ assert(*std::next(m.begin()) == 2);
+ assert(*std::next(m.begin(), 2) == 3);
+ assert(*std::next(m.begin(), 3) == 5);
+ assert(*std::next(m.begin(), 4) == 6);
+ assert(*std::next(m.begin(), 5) == 7);
+ assert(*std::next(m.begin(), 6) == 8);
+
+ std::same_as<I> decltype(auto) i2 = m.erase(std::next(m.begin(), 0));
+ assert(m.size() == 6);
+ assert(i2 == m.begin());
+ assert(*m.begin() == 2);
+ assert(*std::next(m.begin()) == 3);
+ assert(*std::next(m.begin(), 2) == 5);
+ assert(*std::next(m.begin(), 3) == 6);
+ assert(*std::next(m.begin(), 4) == 7);
+ assert(*std::next(m.begin(), 5) == 8);
+
+ std::same_as<I> decltype(auto) i3 = m.erase(std::next(m.cbegin(), 5));
+ assert(m.size() == 5);
+ assert(i3 == m.end());
+ assert(*m.begin() == 2);
+ assert(*std::next(m.begin()) == 3);
+ assert(*std::next(m.begin(), 2) == 5);
+ assert(*std::next(m.begin(), 3) == 6);
+ assert(*std::next(m.begin(), 4) == 7);
+
+ std::same_as<I> decltype(auto) i4 = m.erase(std::next(m.begin(), 1));
+ assert(m.size() == 4);
+ assert(i4 == std::next(m.begin()));
+ assert(*m.begin() == 2);
+ assert(*std::next(m.begin()) == 5);
+ assert(*std::next(m.begin(), 2) == 6);
+ assert(*std::next(m.begin(), 3) == 7);
+
+ std::same_as<I> decltype(auto) i5 = m.erase(std::next(m.cbegin(), 2));
+ assert(m.size() == 3);
+ assert(i5 == std::next(m.begin(), 2));
+ assert(*m.begin() == 2);
+ assert(*std::next(m.begin()) == 5);
+ assert(*std::next(m.begin(), 2) == 7);
+
+ std::same_as<I> decltype(auto) i6 = m.erase(std::next(m.begin(), 2));
+ assert(m.size() == 2);
+ assert(i6 == std::next(m.begin(), 2));
+ assert(*m.begin() == 2);
+ assert(*std::next(m.begin()) == 5);
+
+ std::same_as<I> decltype(auto) i7 = m.erase(std::next(m.cbegin(), 0));
+ assert(m.size() == 1);
+ assert(i7 == std::next(m.begin(), 0));
+ assert(*m.begin() == 5);
+
+ std::same_as<I> decltype(auto) i8 = m.erase(m.begin());
+ assert(m.size() == 0);
+ assert(i8 == m.begin());
+ assert(i8 == m.end());
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto erase_function = [](auto& m, auto) { m.erase(m.begin() + 2); };
+ test_erase_exception_guarantee(erase_function);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter_iter.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter_iter.pass.cpp
new file mode 100644
index 000000000000000..7416977844e5df2
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter_iter.pass.cpp
@@ -0,0 +1,91 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator erase(const_iterator first, const_iterator last);
+
+#include <compare>
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using I = M::iterator;
+
+ int ar[] = {
+ 1,
+ 2,
+ 3,
+ 4,
+ 5,
+ 6,
+ 7,
+ 8,
+ };
+ M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
+ assert(m.size() == 8);
+ std::same_as<I> decltype(auto) i1 = m.erase(m.cbegin(), m.cbegin());
+ assert(m.size() == 8);
+ assert(i1 == m.begin());
+ assert(*m.begin() == 1);
+ assert(*std::next(m.begin()) == 2);
+ assert(*std::next(m.begin(), 2) == 3);
+ assert(*std::next(m.begin(), 3) == 4);
+ assert(*std::next(m.begin(), 4) == 5);
+ assert(*std::next(m.begin(), 5) == 6);
+ assert(*std::next(m.begin(), 6) == 7);
+ assert(*std::next(m.begin(), 7) == 8);
+
+ std::same_as<I> decltype(auto) i2 = m.erase(m.cbegin(), std::next(m.cbegin(), 2));
+ assert(m.size() == 6);
+ assert(i2 == m.begin());
+ assert(*std::next(m.begin(), 0) == 3);
+ assert(*std::next(m.begin(), 1) == 4);
+ assert(*std::next(m.begin(), 2) == 5);
+ assert(*std::next(m.begin(), 3) == 6);
+ assert(*std::next(m.begin(), 4) == 7);
+ assert(*std::next(m.begin(), 5) == 8);
+
+ std::same_as<I> decltype(auto) i3 = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 6));
+ assert(m.size() == 2);
+ assert(i3 == std::next(m.begin(), 2));
+ assert(*std::next(m.begin(), 0) == 3);
+ assert(*std::next(m.begin(), 1) == 4);
+
+ std::same_as<I> decltype(auto) i4 = m.erase(m.cbegin(), m.cend());
+ assert(m.size() == 0);
+ assert(i4 == m.begin());
+ assert(i4 == m.end());
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto erase_function = [](auto& m, auto) { m.erase(m.begin(), m.begin() + 2); };
+ test_erase_exception_guarantee(erase_function);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key.pass.cpp
new file mode 100644
index 000000000000000..25d4f4af19608b4
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key.pass.cpp
@@ -0,0 +1,91 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// size_type erase(const key_type& k);
+
+#include <compare>
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer, class Compare = std::less<>>
+void test() {
+ using M = std::flat_set<int, Compare, KeyContainer>;
+
+ auto make = [](std::initializer_list<int> il) {
+ M m;
+ for (int i : il) {
+ m.emplace(i);
+ }
+ return m;
+ };
+ M m = make({1, 2, 3, 4, 5, 6, 7, 8});
+ ASSERT_SAME_TYPE(decltype(m.erase(9)), typename M::size_type);
+ auto n = m.erase(9);
+ assert(n == 0);
+ assert(m == make({1, 2, 3, 4, 5, 6, 7, 8}));
+ n = m.erase(4);
+ assert(n == 1);
+ assert(m == make({1, 2, 3, 5, 6, 7, 8}));
+ n = m.erase(1);
+ assert(n == 1);
+ assert(m == make({2, 3, 5, 6, 7, 8}));
+ n = m.erase(8);
+ assert(n == 1);
+ assert(m == make({2, 3, 5, 6, 7}));
+ n = m.erase(3);
+ assert(n == 1);
+ assert(m == make({2, 5, 6, 7}));
+ n = m.erase(4);
+ assert(n == 0);
+ assert(m == make({2, 5, 6, 7}));
+ n = m.erase(6);
+ assert(n == 1);
+ assert(m == make({2, 5, 7}));
+ n = m.erase(7);
+ assert(n == 1);
+ assert(m == make({2, 5}));
+ n = m.erase(2);
+ assert(n == 1);
+ assert(m == make({5}));
+ n = m.erase(5);
+ assert(n == 1);
+ assert(m.empty());
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::vector<int>, std::greater<>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto erase_function = [](auto& m, auto key_arg) {
+ using Map = std::decay_t<decltype(m)>;
+ using Key = typename Map::key_type;
+ const Key key{key_arg};
+ m.erase(key);
+ };
+ test_erase_exception_guarantee(erase_function);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key_transparent.pass.cpp
new file mode 100644
index 000000000000000..cbf7cac603806d7
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key_transparent.pass.cpp
@@ -0,0 +1,142 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// size_type erase(K&& k);
+
+#include <compare>
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
+template <class M>
+concept CanErase = requires(M m, Transparent<int> k) { m.erase(k); };
+using TransparentSet = std::flat_set<int, TransparentComparator>;
+using NonTransparentSet = std::flat_set<int, NonTransparentComparator>;
+static_assert(CanErase<TransparentSet>);
+static_assert(!CanErase<const TransparentSet>);
+static_assert(!CanErase<NonTransparentSet>);
+static_assert(!CanErase<const NonTransparentSet>);
+
+template <class Key, class It>
+struct HeterogeneousKey {
+ explicit HeterogeneousKey(Key key, It it) : key_(key), it_(it) {}
+ operator It() && { return it_; }
+ auto operator<=>(Key key) const { return key_ <=> key; }
+ friend bool operator<(const HeterogeneousKey&, const HeterogeneousKey&) {
+ assert(false);
+ return false;
+ }
+ Key key_;
+ It it_;
+};
+
+template <class KeyContainer>
+void test_simple() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ M m = {1, 2, 3, 4};
+ ASSERT_SAME_TYPE(decltype(m.erase(9)), typename M::size_type);
+ auto n = m.erase(3); // erase(K&&) [with K=int]
+ assert(n == 1);
+ assert((m == M{1, 2, 4}));
+ typename M::key_type lvalue = 2;
+ n = m.erase(lvalue); // erase(K&&) [with K=int&]
+ assert(n == 1);
+ assert((m == M{1, 4}));
+ const typename M::key_type const_lvalue = 1;
+ n = m.erase(const_lvalue); // erase(const key_type&)
+ assert(n == 1);
+ assert((m == M{4}));
+}
+
+template <class KeyContainer>
+void test_transparent_comparator() {
+ using M = std::flat_set<std::string, TransparentComparator, KeyContainer>;
+ M m = {"alpha", "beta", "epsilon", "eta", "gamma"};
+ ASSERT_SAME_TYPE(decltype(m.erase(Transparent<std::string>{"abc"})), typename M::size_type);
+
+ auto n = m.erase(Transparent<std::string>{"epsilon"});
+ assert(n == 1);
+
+ M expected = {"alpha", "beta", "eta", "gamma"};
+ assert(m == expected);
+
+ auto n2 = m.erase(Transparent<std::string>{"aaa"});
+ assert(n2 == 0);
+ assert(m == expected);
+}
+
+int main(int, char**) {
+ test_simple<std::vector<int>>();
+ test_simple<std::deque<int>>();
+ test_simple<MinSequenceContainer<int>>();
+ test_simple<std::vector<int, min_allocator<int>>>();
+
+ test_transparent_comparator<std::vector<std::string>>();
+ test_transparent_comparator<std::deque<std::string>>();
+ test_transparent_comparator<MinSequenceContainer<std::string>>();
+ test_transparent_comparator<std::vector<std::string, min_allocator<std::string>>>();
+
+ {
+ // P2077's HeterogeneousKey example
+ using M = std::flat_set<int, std::less<>>;
+ M m = {1, 2, 3, 4, 5, 6, 7, 8};
+ auto h1 = HeterogeneousKey<int, M::iterator>(8, m.begin());
+ std::same_as<M::size_type> auto n = m.erase(h1); // lvalue is not convertible to It; erase(K&&) is the best match
+ assert(n == 1);
+ assert((m == M{1, 2, 3, 4, 5, 6, 7}));
+ std::same_as<M::iterator> auto it = m.erase(std::move(h1)); // rvalue is convertible to It; erase(K&&) drops out
+ assert(it == m.begin());
+ assert((m == M{2, 3, 4, 5, 6, 7}));
+ }
+ {
+ using M = std::flat_set<int, std::less<>>;
+ M m = {1, 2, 3, 4, 5, 6, 7, 8};
+ auto h1 = HeterogeneousKey<int, M::const_iterator>(8, m.begin());
+ std::same_as<M::size_type> auto n = m.erase(h1); // lvalue is not convertible to It; erase(K&&) is the best match
+ assert(n == 1);
+ assert((m == M{1, 2, 3, 4, 5, 6, 7}));
+ std::same_as<M::iterator> auto it = m.erase(std::move(h1)); // rvalue is convertible to It; erase(K&&) drops out
+ assert(it == m.begin());
+ assert((m == M{2, 3, 4, 5, 6, 7}));
+ }
+ {
+ bool transparent_used = false;
+ TransparentComparator c(transparent_used);
+ std::flat_set<int, TransparentComparator> m(std::sorted_unique, {1, 2, 3}, c);
+ assert(!transparent_used);
+ auto n = m.erase(Transparent<int>{3});
+ assert(n == 1);
+ assert(transparent_used);
+ }
+ {
+ auto erase_transparent = [](auto& m, auto key_arg) {
+ using Set = std::decay_t<decltype(m)>;
+ using Key = typename Set::key_type;
+ m.erase(Transparent<Key>{key_arg});
+ };
+ test_erase_exception_guarantee(erase_transparent);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/extract.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/extract.pass.cpp
new file mode 100644
index 000000000000000..c3bbffabb90a08f
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/extract.pass.cpp
@@ -0,0 +1,83 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// containers extract() &&;
+
+#include <algorithm>
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class T>
+concept CanExtract = requires(T&& t) { std::forward<T>(t).extract(); };
+
+static_assert(CanExtract<std::flat_set<int>&&>);
+static_assert(!CanExtract<std::flat_set<int>&>);
+static_assert(!CanExtract<std::flat_set<int> const&>);
+static_assert(!CanExtract<std::flat_set<int> const&&>);
+
+template <class KeyContainer>
+void test() {
+ using M = std::flat_set<int, std::less<int>, KeyContainer>;
+ M m = M({1, 2, 3});
+
+ std::same_as<KeyContainer> auto keys = std::move(m).extract();
+
+ auto expected_keys = {1, 2, 3};
+ assert(std::ranges::equal(keys, expected_keys));
+ check_invariant(m);
+ LIBCPP_ASSERT(m.empty());
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+ {
+ // extracted object maintains invariant if the underlying container does not clear after move
+ using M = std::flat_set<int, std::less<>, CopyOnlyVector<int>>;
+ M m = M({1, 2, 3});
+ std::same_as<M::container_type> auto keys = std::move(m).extract();
+ assert(keys.size() == 3);
+ check_invariant(m);
+ LIBCPP_ASSERT(m.empty());
+ }
+
+ {
+#ifndef TEST_HAS_NO_EXCEPTIONS
+ using KeyContainer = ThrowOnMoveContainer<int>;
+ using M = std::flat_set<int, std::ranges::less, KeyContainer>;
+
+ M m;
+ m.emplace(1);
+ m.emplace(2);
+ try {
+ auto c = std::move(m).extract();
+ assert(false);
+ } catch (int) {
+ check_invariant(m);
+ // In libc++, we try to erase the key after value emplacement failure.
+ // and after erasure failure, we clear the flat_set
+ LIBCPP_ASSERT(m.size() == 0);
+ }
+#endif
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_cv.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_cv.pass.cpp
new file mode 100644
index 000000000000000..c0ddadc30069872
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_cv.pass.cpp
@@ -0,0 +1,78 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// pair<iterator, bool> insert(const value_type& v);
+
+#include <flat_set>
+#include <deque>
+#include <cassert>
+#include <functional>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "../helpers.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using R = std::pair<typename M::iterator, bool>;
+ using VT = typename M::value_type;
+ M m;
+
+ const VT v1(2);
+ std::same_as<R> decltype(auto) r = m.insert(v1);
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 1);
+ assert(*r.first == 2);
+
+ const VT v2(1);
+ r = m.insert(v2);
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 2);
+ assert(*r.first == 1);
+
+ const VT v3(3);
+ r = m.insert(v3);
+ assert(r.second);
+ assert(r.first == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r.first == 3);
+
+ const VT v4(3);
+ r = m.insert(v4);
+ assert(!r.second);
+ assert(r.first == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r.first == 3);
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto insert_func = [](auto& m, auto key_arg) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ using value_type = typename FlatSet::value_type;
+ const value_type p(key_arg);
+ m.insert(p);
+ };
+ test_emplace_exception_guarantee(insert_func);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_initializer_list.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_initializer_list.pass.cpp
new file mode 100644
index 000000000000000..7381514a70eabbb
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_initializer_list.pass.cpp
@@ -0,0 +1,67 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// void insert(initializer_list<value_type> il);
+
+#include <flat_set>
+#include <cassert>
+#include <functional>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using V = typename M::value_type;
+
+ M m = {1,1,1,3,3,3};
+ m.insert({
+ 4,
+ 4,
+ 4,
+ 1,
+ 1,
+ 1,
+ 2,
+ 2,
+ 2,
+ });
+ assert(m.size() == 4);
+ assert(std::distance(m.begin(), m.end()) == 4);
+ assert(*m.begin() == V(1));
+ assert(*std::next(m.begin()) == V(2));
+ assert(*std::next(m.begin(), 2) == V(3));
+ assert(*std::next(m.begin(), 3) == V(4));
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto insert_func = [](auto& m, const auto& newValues) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ using value_type = typename FlatSet::value_type;
+ std::initializer_list<value_type> il = {newValues[0]};
+ m.insert(il);
+ };
+ test_insert_range_exception_guarantee(insert_func);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_cv.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_cv.pass.cpp
new file mode 100644
index 000000000000000..c343d53a62215a8
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_cv.pass.cpp
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator insert(const_iterator position, const value_type& v);
+
+#include <flat_set>
+#include <cassert>
+#include <functional>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "../helpers.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using R = typename M::iterator;
+ using VT = typename M::value_type;
+
+ M m;
+ const VT v1(2);
+ std::same_as<R> decltype(auto) r = m.insert(m.end(), v1);
+ assert(r == m.begin());
+ assert(m.size() == 1);
+ assert(*r == 2);
+
+ const VT v2(1);
+ r = m.insert(m.end(), v2);
+ assert(r == m.begin());
+ assert(m.size() == 2);
+ assert(*r == 1);
+
+ const VT v3(3);
+ r = m.insert(m.end(), v3);
+ assert(r == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r == 3);
+
+ const VT v4(3);
+ r = m.insert(m.end(), v4);
+ assert(r == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r == 3);
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto insert_func = [](auto& m, auto key_arg) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ using value_type = typename FlatSet::value_type;
+ const value_type p(key_arg);
+ m.insert(m.begin(), p);
+ };
+ test_emplace_exception_guarantee(insert_func);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_iter.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_iter.pass.cpp
new file mode 100644
index 000000000000000..d20a8ef8fdd92d8
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_iter.pass.cpp
@@ -0,0 +1,87 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template <class InputIterator>
+// void insert(InputIterator first, InputIterator last);
+
+#include <flat_set>
+#include <cassert>
+#include <functional>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "test_iterators.h"
+#include "min_allocator.h"
+
+// test constraint InputIterator
+template <class M, class... Args>
+concept CanInsert = requires(M m, Args&&... args) { m.insert(std::forward<Args>(args)...); };
+
+using Set = std::flat_set<int>;
+
+static_assert(CanInsert<Set, int*, int*>);
+static_assert(CanInsert<Set, cpp17_input_iterator<int*>, cpp17_input_iterator<int*>>);
+static_assert(!CanInsert<Set, int, int>);
+static_assert(!CanInsert<Set, cpp20_input_iterator<int*>, cpp20_input_iterator<int*>>);
+
+template <class KeyContainer>
+void test() {
+ using M = std::flat_set<int, std::less<int>, KeyContainer>;
+
+ int ar1[] = {
+ 2,
+ 2,
+ 2,
+ 1,
+ 1,
+ 1,
+ 3,
+ 3,
+ 3,
+ };
+ int ar2[] = {
+ 4,
+ 4,
+ 4,
+ 1,
+ 1,
+ 1,
+ 0,
+ 0,
+ 0,
+ };
+
+ M m;
+ m.insert(cpp17_input_iterator<int*>(ar1), cpp17_input_iterator<int*>(ar1 + sizeof(ar1) / sizeof(ar1[0])));
+ assert(m.size() == 3);
+ M expected{1, 2, 3};
+ assert(m == expected);
+
+ m.insert(cpp17_input_iterator<int*>(ar2), cpp17_input_iterator<int*>(ar2 + sizeof(ar2) / sizeof(ar2[0])));
+ assert(m.size() == 5);
+ M expected2{0, 1, 2, 3, 4};
+ assert(m == expected2);
+}
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto insert_func = [](auto& m, const auto& newValues) { m.insert(newValues.begin(), newValues.end()); };
+ test_insert_range_exception_guarantee(insert_func);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_rv.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_rv.pass.cpp
new file mode 100644
index 000000000000000..84b6c7fc1d34f62
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_rv.pass.cpp
@@ -0,0 +1,73 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+// iterator insert(const_iterator position, value_type&&);
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "MoveOnly.h"
+#include "min_allocator.h"
+#include "../helpers.h"
+#include "test_macros.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using V = Key;
+ using R = typename M::iterator;
+ M m;
+ std::same_as<R> decltype(auto) r = m.insert(m.end(), V(2));
+ assert(r == m.begin());
+ assert(m.size() == 1);
+ assert(*r == V(2));
+
+ r = m.insert(m.end(), V(1));
+ assert(r == m.begin());
+ assert(m.size() == 2);
+ assert(*r == V(1));
+
+ r = m.insert(m.end(), V(3));
+ assert(r == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r == V(3));
+
+ r = m.insert(m.end(), V(3));
+ assert(r == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r == V(3));
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::vector<MoveOnly>>();
+ test<std::deque<int>>();
+ test<std::deque<MoveOnly>>();
+ test<MinSequenceContainer<int>>();
+ test<MinSequenceContainer<MoveOnly>>();
+ test<std::vector<int, min_allocator<int>>>();
+ test<std::vector<MoveOnly, min_allocator<MoveOnly>>>();
+
+ {
+ auto insert_func = [](auto& m, auto key_arg) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ using value_type = typename FlatSet::value_type;
+ value_type p(key_arg);
+ m.insert(m.begin(), std::move(p));
+ };
+ test_emplace_exception_guarantee(insert_func);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_range.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_range.pass.cpp
new file mode 100644
index 000000000000000..536307252c64058
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_range.pass.cpp
@@ -0,0 +1,105 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<container-compatible-range<value_type> R>
+// void insert_range(R&& rg);
+
+#include <algorithm>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <ranges>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "MoveOnly.h"
+#include "test_macros.h"
+#include "test_iterators.h"
+#include "min_allocator.h"
+
+// test constraint container-compatible-range
+template <class M, class R>
+concept CanInsertRange = requires(M m, R&& r) { m.insert_range(std::forward<R>(r)); };
+
+using Set = std::flat_set<int, double>;
+
+static_assert(CanInsertRange<Set, std::ranges::subrange<int*>>);
+static_assert(CanInsertRange<Set, std::ranges::subrange<short*>>);
+static_assert(!CanInsertRange<Set, std::ranges::subrange<std::pair<int, int>*>>);
+static_assert(!CanInsertRange<Set, std::ranges::subrange<std::pair<short, short>*>>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+
+ {
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using It = forward_iterator<const int*>;
+ M m = {10, 8, 5, 2, 1};
+ int ar[] = {3, 1, 4, 1, 5, 9};
+ std::ranges::subrange r = {It(ar), It(ar + 6)};
+ static_assert(std::ranges::common_range<decltype(r)>);
+ m.insert_range(r);
+ assert((m == M{1, 2, 3, 4, 5, 8, 9, 10}));
+ }
+ {
+ using M = std::flat_set<Key, std::greater<>, KeyContainer>;
+ using It = cpp20_input_iterator<const int*>;
+ M m = {8, 5, 3, 2};
+ int ar[] = {3, 1, 4, 1, 5, 9};
+ std::ranges::subrange r = {It(ar), sentinel_wrapper<It>(It(ar + 6))};
+ static_assert(!std::ranges::common_range<decltype(r)>);
+ m.insert_range(r);
+ assert((m == M{1, 2, 3, 4, 5, 8, 9}));
+ }
+ {
+ // The "uniquing" part uses the comparator, not operator==.
+ struct ModTen {
+ bool operator()(int a, int b) const { return (a % 10) < (b % 10); }
+ };
+ using M = std::flat_set<Key, ModTen, KeyContainer>;
+ M m = {21, 43, 15, 37};
+ int ar[] = {33, 18, 55, 18, 42};
+ m.insert_range(ar);
+ assert((m == M{21, 42, 43, 15, 37, 18}));
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+ {
+ // Items are forwarded correctly from the input range (P2767).
+ MoveOnly a[] = {3, 1, 4, 1, 5};
+ std::flat_set<MoveOnly> m;
+ m.insert_range(a | std::views::as_rvalue);
+ MoveOnly expected[] = {1, 3, 4, 5};
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ // The element type of the range doesn't need to be std::pair (P2767).
+ int pa[] = {3, 1, 4, 1, 5};
+ std::deque<std::reference_wrapper<int>> a(pa, pa + 5);
+ std::flat_set<int> m;
+ m.insert_range(a);
+ int expected[] = {1, 3, 4, 5};
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ auto insert_func = [](auto& m, const auto& newValues) { m.insert_range(newValues); };
+ test_insert_range_exception_guarantee(insert_func);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_rv.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_rv.pass.cpp
new file mode 100644
index 000000000000000..7d95f0521eb1f67
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_rv.pass.cpp
@@ -0,0 +1,80 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// class flat_set
+
+// pair<iterator, bool> insert( value_type&& v);
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "MoveOnly.h"
+#include "min_allocator.h"
+#include "test_macros.h"
+#include "../helpers.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, TransparentComparator, KeyContainer>;
+ using R = std::pair<typename M::iterator, bool>;
+ using V = typename M::value_type;
+
+ M m;
+ std::same_as<R> decltype(auto) r = m.insert(V(2));
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 1);
+ assert(*r.first == V(2));
+
+ r = m.insert(V(1));
+ assert(r.second);
+ assert(r.first == m.begin());
+ assert(m.size() == 2);
+ assert(*r.first == V(1));
+
+ r = m.insert(V(3));
+ assert(r.second);
+ assert(r.first == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r.first == V(3));
+
+ r = m.insert(V(3));
+ assert(!r.second);
+ assert(r.first == std::ranges::prev(m.end()));
+ assert(m.size() == 3);
+ assert(*r.first == V(3));
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::vector<MoveOnly>>();
+ test<std::deque<int>>();
+ test<std::deque<MoveOnly>>();
+ test<MinSequenceContainer<int>>();
+ test<MinSequenceContainer<MoveOnly>>();
+ test<std::vector<int, min_allocator<int>>>();
+ test<std::vector<MoveOnly, min_allocator<MoveOnly>>>();
+ {
+ auto insert_func = [](auto& m, auto key_arg) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ using value_type = typename FlatSet::value_type;
+ value_type p(key_arg);
+ m.insert(std::move(p));
+ };
+ test_emplace_exception_guarantee(insert_func);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_initializer_list.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_initializer_list.pass.cpp
new file mode 100644
index 000000000000000..fa5bf86830daecd
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_initializer_list.pass.cpp
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// void insert(sorted_unique_t, initializer_list<value_type> il);
+
+#include <flat_set>
+#include <cassert>
+#include <functional>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ using V = Key;
+ M m = {1, 1, 1, 3, 3, 3};
+ m.insert(std::sorted_unique, {0, 1, 2, 4});
+ assert(m.size() == 5);
+ assert(std::distance(m.begin(), m.end()) == 5);
+ assert(*m.begin() == V(0));
+ assert(*std::next(m.begin()) == V(1));
+ assert(*std::next(m.begin(), 2) == V(2));
+ assert(*std::next(m.begin(), 3) == V(3));
+ assert(*std::next(m.begin(), 4) == V(4));
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto insert_func = [](auto& m, const auto& newValues) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ using value_type = typename FlatSet::value_type;
+ std::initializer_list<value_type> il = {newValues[0]};
+ m.insert(std::sorted_unique, il);
+ };
+ test_insert_range_exception_guarantee(insert_func);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_iter_iter.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_iter_iter.pass.cpp
new file mode 100644
index 000000000000000..ef7b8391cee33c1
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_iter_iter.pass.cpp
@@ -0,0 +1,77 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template <class InputIterator>
+// void insert(sorted_unique_t, InputIterator first, InputIterator last);
+
+#include <flat_set>
+#include <cassert>
+#include <functional>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "test_iterators.h"
+#include "min_allocator.h"
+
+// test constraint InputIterator
+template <class M, class... Args>
+concept CanInsert = requires(M m, Args&&... args) { m.insert(std::forward<Args>(args)...); };
+
+using Set = std::flat_set<int>;
+
+static_assert(CanInsert<Set, std::sorted_unique_t, int*, int*>);
+static_assert(CanInsert<Set, std::sorted_unique_t, cpp17_input_iterator<int*>, cpp17_input_iterator<int*>>);
+static_assert(!CanInsert<Set, std::sorted_unique_t, int, int>);
+static_assert(!CanInsert<Set, std::sorted_unique_t, cpp20_input_iterator<int*>, cpp20_input_iterator<int*>>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ int ar1[] = {1, 2, 3};
+
+ int ar2[] = {0, 2, 4};
+
+ M m;
+ m.insert(std::sorted_unique,
+ cpp17_input_iterator<int*>(ar1),
+ cpp17_input_iterator<int*>(ar1 + sizeof(ar1) / sizeof(ar1[0])));
+ assert(m.size() == 3);
+ M expected{1, 2, 3};
+ assert(m == expected);
+
+ m.insert(std::sorted_unique,
+ cpp17_input_iterator<int*>(ar2),
+ cpp17_input_iterator<int*>(ar2 + sizeof(ar2) / sizeof(ar2[0])));
+ assert(m.size() == 5);
+ M expected2{0, 1, 2, 3, 4};
+ assert(m == expected2);
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ auto insert_func = [](auto& m, const auto& newValues) {
+ m.insert(std::sorted_unique, newValues.begin(), newValues.end());
+ };
+ test_insert_range_exception_guarantee(insert_func);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_transparent.pass.cpp
new file mode 100644
index 000000000000000..72d7261a1825477
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_transparent.pass.cpp
@@ -0,0 +1,169 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class K> pair<iterator, bool> insert(P&& x);
+// template<class K> iterator insert(const_iterator hint, P&& x);
+
+#include <algorithm>
+#include <compare>
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <tuple>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "test_iterators.h"
+#include "min_allocator.h"
+
+// Constraints: is_constructible_v<value_type, K> is true.
+template <class M, class... Args>
+concept CanInsert = requires(M m, Args&&... args) { m.insert(std::forward<Args>(args)...); };
+
+using Set = std::flat_set<int>;
+using Iter = Set::const_iterator;
+
+static_assert(CanInsert<Set, short&&>);
+static_assert(CanInsert<Set, Iter, short&&>);
+static_assert(!CanInsert<Set, std::string>);
+static_assert(!CanInsert<Set, Iter, std::string>);
+
+static int expensive_comparisons = 0;
+static int cheap_comparisons = 0;
+
+struct CompareCounter {
+ int i_ = 0;
+ CompareCounter(int i) : i_(i) {}
+ friend auto operator<=>(const CompareCounter& x, const CompareCounter& y) {
+ expensive_comparisons += 1;
+ return x.i_ <=> y.i_;
+ }
+ bool operator==(const CompareCounter&) const = default;
+ friend auto operator<=>(const CompareCounter& x, int y) {
+ cheap_comparisons += 1;
+ return x.i_ <=> y;
+ }
+};
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ const int expected[] = {1, 2, 3, 4, 5};
+ {
+ // insert(P&&)
+ // Unlike flat_set, here we can't use key_compare to compare value_type versus P,
+ // so we must eagerly convert to value_type.
+ M m = {1, 2, 4, 5};
+ expensive_comparisons = 0;
+ cheap_comparisons = 0;
+ std::same_as<std::pair<typename M::iterator, bool>> auto p = m.insert(3); // conversion happens first
+ assert(expensive_comparisons >= 2);
+ assert(cheap_comparisons == 0);
+ assert(p == std::make_pair(m.begin() + 2, true));
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ // insert(const_iterator, P&&)
+ M m = {1, 2, 4, 5};
+ expensive_comparisons = 0;
+ cheap_comparisons = 0;
+ std::same_as<typename M::iterator> auto it = m.insert(m.begin(), 3);
+ assert(expensive_comparisons >= 2);
+ assert(cheap_comparisons == 0);
+ assert(it == m.begin() + 2);
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ // insert(value_type&&)
+ M m = {1, 2, 4, 5};
+ expensive_comparisons = 0;
+ cheap_comparisons = 0;
+ std::same_as<std::pair<typename M::iterator, bool>> auto p = m.insert(3); // conversion happens last
+ assert(expensive_comparisons >= 2);
+ assert(cheap_comparisons == 0);
+ assert(p == std::make_pair(m.begin() + 2, true));
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ // insert(const_iterator, value_type&&)
+ M m = {1, 2, 4, 5};
+ expensive_comparisons = 0;
+ cheap_comparisons = 0;
+ std::same_as<typename M::iterator> auto it = m.insert(m.begin(), 3);
+ assert(expensive_comparisons >= 2);
+ assert(cheap_comparisons == 0);
+ assert(it == m.begin() + 2);
+ assert(std::ranges::equal(m, expected));
+ }
+ {
+ // emplace(Args&&...)
+ M m = {1, 2, 4, 5};
+ expensive_comparisons = 0;
+ cheap_comparisons = 0;
+ std::same_as<std::pair<typename M::iterator, bool>> auto p = m.emplace(3); // conversion happens first
+ assert(expensive_comparisons >= 2);
+ assert(cheap_comparisons == 0);
+ assert(p == std::make_pair(m.begin() + 2, true));
+ assert(std::ranges::equal(m, expected));
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<CompareCounter>>();
+ test<std::deque<CompareCounter>>();
+ test<MinSequenceContainer<CompareCounter>>();
+ test<std::vector<CompareCounter, min_allocator<CompareCounter>>>();
+
+ {
+ // no ambiguity between insert(pos, P&&) and insert(first, last)
+ using M = std::flat_set<int>;
+ struct Evil {
+ operator M::value_type() const;
+ operator M::const_iterator() const;
+ };
+ std::flat_set<int> m;
+ ASSERT_SAME_TYPE(decltype(m.insert(Evil())), std::pair<M::iterator, bool>);
+ ASSERT_SAME_TYPE(decltype(m.insert(m.begin(), Evil())), M::iterator);
+ ASSERT_SAME_TYPE(decltype(m.insert(m.begin(), m.end())), void);
+ }
+ {
+ auto insert_func = [](auto& m, auto key_arg) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ struct T {
+ typename FlatSet::key_type key;
+ T(typename FlatSet::key_type key) : key(key) {}
+ operator typename FlatSet::value_type() const { return key; }
+ };
+ T t(key_arg);
+ m.insert(t);
+ };
+ test_emplace_exception_guarantee(insert_func);
+ }
+ {
+ auto insert_func_iter = [](auto& m, auto key_arg) {
+ using FlatSet = std::decay_t<decltype(m)>;
+ struct T {
+ typename FlatSet::key_type key;
+ T(typename FlatSet::key_type key) : key(key) {}
+ operator typename FlatSet::value_type() const { return key; }
+ };
+ T t(key_arg);
+ m.insert(m.begin(), t);
+ };
+ test_emplace_exception_guarantee(insert_func_iter);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/replace.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/replace.pass.cpp
new file mode 100644
index 000000000000000..49cb6eb6163c903
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/replace.pass.cpp
@@ -0,0 +1,72 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// void replace(container_type&& key_cont);
+
+#include <algorithm>
+#include <deque>
+#include <concepts>
+#include <flat_set>
+#include <functional>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class T, class... Args>
+concept CanReplace = requires(T t, Args&&... args) { t.replace(std::forward<Args>(args)...); };
+
+using Set = std::flat_set<int, int>;
+static_assert(CanReplace<Set, std::vector<int>>);
+static_assert(!CanReplace<Set, const std::vector<int>&>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ M m = M({1, 2, 3});
+ KeyContainer new_keys = {7, 8};
+ auto expected_keys = new_keys;
+ m.replace(std::move(new_keys));
+ assert(m.size() == 2);
+ assert(std::ranges::equal(m, expected_keys));
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+#ifndef TEST_HAS_NO_EXCEPTIONS
+ using KeyContainer = ThrowOnMoveContainer<int>;
+ using M = std::flat_set<int, std::ranges::less, KeyContainer>;
+
+ M m;
+ m.emplace(1);
+ m.emplace(2);
+ try {
+ KeyContainer new_keys{3, 4};
+ m.replace(std::move(new_keys));
+ assert(false);
+ } catch (int) {
+ check_invariant(m);
+ // In libc++, we clear the map
+ LIBCPP_ASSERT(m.size() == 0);
+ }
+#endif
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_exception.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_exception.pass.cpp
new file mode 100644
index 000000000000000..23a2dc85989bb7f
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_exception.pass.cpp
@@ -0,0 +1,61 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+// `check_assertion.h` requires Unix headers and regex support.
+// REQUIRES: has-unix-headers
+// UNSUPPORTED: no-localization
+// UNSUPPORTED: no-exceptions
+
+// <flat_set>
+
+// void swap(flat_set& y) noexcept;
+// friend void swap(flat_set& x, flat_set& y) noexcept
+
+// Test that std::terminate is called if any exception is thrown during swap
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+#include <functional>
+#include <vector>
+
+#include "test_macros.h"
+#include "../helpers.h"
+#include "check_assertion.h"
+
+template <class F>
+void test_swap_exception_guarantee([[maybe_unused]] F&& swap_function) {
+ {
+ // key swap throws
+ using KeyContainer = ThrowOnMoveContainer<int>;
+ using M = std::flat_set<int, TransparentComparator, KeyContainer>;
+
+ M m1, m2;
+ m1.emplace(1);
+ m1.emplace(2);
+ m2.emplace(3);
+ m2.emplace(4);
+ // swap is noexcept
+ EXPECT_STD_TERMINATE([&] { swap_function(m1, m2); });
+ }
+}
+
+int main(int, char**) {
+ {
+ auto swap_func = [](auto& m1, auto& m2) { swap(m1, m2); };
+ test_swap_exception_guarantee(swap_func);
+ }
+
+ {
+ auto swap_func = [](auto& m1, auto& m2) { m1.swap(m2); };
+ test_swap_exception_guarantee(swap_func);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_free.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_free.pass.cpp
new file mode 100644
index 000000000000000..bc7baa67e52a599
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_free.pass.cpp
@@ -0,0 +1,94 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// friend void swap(flat_set& x, flat_set& y) noexcept
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "MoveOnly.h"
+#include "min_allocator.h"
+#include "test_macros.h"
+#include "../helpers.h"
+
+// test noexcept
+
+template <class T>
+concept NoExceptAdlSwap = requires(T t1, T t2) {
+ { swap(t1, t2) } noexcept;
+};
+
+static_assert(NoExceptAdlSwap<std::flat_set<int>>);
+
+#ifndef TEST_HAS_NO_EXCEPTIONS
+static_assert(NoExceptAdlSwap<std::flat_set<int, std::less<int>, ThrowOnMoveContainer<int>>>);
+#endif
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+
+ {
+ M m1;
+ M m2;
+ M m1_save = m1;
+ M m2_save = m2;
+ swap(m1, m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+ {
+ int ar2[] = {5, 6, 7, 8, 9, 10, 11, 12};
+ M m1;
+ M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0]));
+ M m1_save = m1;
+ M m2_save = m2;
+ swap(m1, m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+ {
+ int ar1[] = {1, 2, 3, 4};
+ M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0]));
+ M m2;
+ M m1_save = m1;
+ M m2_save = m2;
+ swap(m1, m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+ {
+ int ar1[] = {1, 2, 3, 4};
+ int ar2[] = {5, 6, 7, 8, 9, 10, 11, 12};
+ M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0]));
+ M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0]));
+ M m1_save = m1;
+ M m2_save = m2;
+ swap(m1, m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_member.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_member.pass.cpp
new file mode 100644
index 000000000000000..b0b06a9499efc7a
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_member.pass.cpp
@@ -0,0 +1,92 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// void swap(flat_set& y) noexcept;
+
+#include <flat_set>
+#include <cassert>
+#include <deque>
+#include <functional>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "MoveOnly.h"
+#include "min_allocator.h"
+#include "test_macros.h"
+#include "../helpers.h"
+
+// test noexcept
+
+template <class T>
+concept NoExceptMemberSwap = requires(T t1, T t2) {
+ { t1.swap(t2) } noexcept;
+};
+
+static_assert(NoExceptMemberSwap<std::flat_set<int>>);
+#ifndef TEST_HAS_NO_EXCEPTIONS
+static_assert(NoExceptMemberSwap<std::flat_set<int, std::less<int>, ThrowOnMoveContainer<int>>>);
+#endif
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<Key>, KeyContainer>;
+ {
+ M m1;
+ M m2;
+ M m1_save = m1;
+ M m2_save = m2;
+ m1.swap(m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+ {
+ int ar2[] = {5, 6, 7, 8, 9, 10, 11, 12};
+ M m1;
+ M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0]));
+ M m1_save = m1;
+ M m2_save = m2;
+ m1.swap(m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+ {
+ int ar1[] = {1, 2, 3, 4};
+ M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0]));
+ M m2;
+ M m1_save = m1;
+ M m2_save = m2;
+ m1.swap(m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+ {
+ int ar1[] = {1, 2, 3, 4};
+ int ar2[] = {5, 6, 7, 8, 9, 10, 11, 12};
+ M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0]));
+ M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0]));
+ M m1_save = m1;
+ M m2_save = m2;
+ m1.swap(m2);
+ assert(m1 == m2_save);
+ assert(m2 == m1_save);
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.observers/comp.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.observers/comp.pass.cpp
new file mode 100644
index 000000000000000..971b5e1c338dd11
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.observers/comp.pass.cpp
@@ -0,0 +1,72 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// key_compare key_comp() const;
+// value_compare value_comp() const;
+
+#include <cassert>
+#include <flat_set>
+#include <functional>
+#include <utility>
+#include <vector>
+
+#include "test_macros.h"
+
+int main(int, char**) {
+ {
+ using M = std::flat_set<int>;
+ using Comp = std::less<int>; // the default
+ M m = {};
+ ASSERT_SAME_TYPE(M::key_compare, Comp);
+ ASSERT_SAME_TYPE(decltype(m.key_comp()), Comp);
+ ASSERT_SAME_TYPE(decltype(m.value_comp()), Comp);
+ Comp kc = m.key_comp();
+ assert(kc(1, 2));
+ assert(!kc(2, 1));
+ auto vc = m.value_comp();
+ assert(vc(1, 2));
+ assert(!vc(2, 1));
+ }
+ {
+ using Comp = std::function<bool(int, int)>;
+ using M = std::flat_set<int, Comp>;
+ Comp comp = std::greater<int>();
+ M m({}, comp);
+ ASSERT_SAME_TYPE(M::key_compare, Comp);
+ ASSERT_SAME_TYPE(decltype(m.key_comp()), Comp);
+ ASSERT_SAME_TYPE(decltype(m.value_comp()), Comp);
+ Comp kc = m.key_comp();
+ assert(!kc(1, 2));
+ assert(kc(2, 1));
+ auto vc = m.value_comp();
+ assert(!vc(1, 2));
+ assert(vc(2, 1));
+ }
+ {
+ using Comp = std::less<>;
+ using M = std::flat_set<int, Comp>;
+ M m = {};
+ ASSERT_SAME_TYPE(M::key_compare, Comp);
+ ASSERT_SAME_TYPE(decltype(m.key_comp()), Comp);
+ ASSERT_SAME_TYPE(decltype(m.value_comp()), Comp);
+ Comp kc = m.key_comp();
+ assert(kc(1, 2));
+ assert(!kc(2, 1));
+ auto vc = m.value_comp();
+ auto a = std::make_pair(1, 2);
+ ASSERT_SAME_TYPE(decltype(vc(a, a)), bool);
+ assert(vc(1, 2));
+ assert(!vc(2, 1));
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains.pass.cpp
new file mode 100644
index 000000000000000..b14da66f611301e
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains.pass.cpp
@@ -0,0 +1,69 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// bool contains(const key_type& x) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ {
+ using M = std::flat_set<Key, std::less<>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ assert(!m.contains(0));
+ assert(m.contains(1));
+ assert(m.contains(2));
+ assert(!m.contains(3));
+ assert(m.contains(4));
+ assert(m.contains(5));
+ assert(!m.contains(6));
+ assert(!m.contains(7));
+ assert(std::as_const(m).contains(8));
+ assert(!std::as_const(m).contains(9));
+ m.clear();
+ assert(!m.contains(1));
+ }
+ {
+ using M = std::flat_set<Key, std::greater<int>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ assert(!m.contains(0));
+ assert(m.contains(1));
+ assert(m.contains(2));
+ assert(!m.contains(3));
+ assert(m.contains(4));
+ assert(m.contains(5));
+ assert(!m.contains(6));
+ assert(!m.contains(7));
+ assert(std::as_const(m).contains(8));
+ assert(!std::as_const(m).contains(9));
+ m.clear();
+ assert(!m.contains(1));
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains_transparent.pass.cpp
new file mode 100644
index 000000000000000..507560608952b01
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains_transparent.pass.cpp
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class K> bool contains(const K& x) const;
+
+#include <cassert>
+#include <flat_set>
+#include <string>
+#include <utility>
+#include <deque>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
+template <class M>
+concept CanContains = requires(M m, Transparent<int> k) { m.contains(k); };
+using TransparentSet = std::flat_set<int, TransparentComparator>;
+using NonTransparentSet = std::flat_set<int, NonTransparentComparator>;
+static_assert(CanContains<TransparentSet>);
+static_assert(CanContains<const TransparentSet>);
+static_assert(!CanContains<NonTransparentSet>);
+static_assert(!CanContains<const NonTransparentSet>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, TransparentComparator, KeyContainer>;
+
+ M m = {"alpha", "beta", "epsilon", "eta", "gamma"};
+ ASSERT_SAME_TYPE(decltype(m.contains(Transparent<std::string>{"abc"})), bool);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).contains(Transparent<std::string>{"b"})), bool);
+ assert(m.contains(Transparent<std::string>{"alpha"}) == true);
+ assert(m.contains(Transparent<std::string>{"beta"}) == true);
+ assert(m.contains(Transparent<std::string>{"epsilon"}) == true);
+ assert(m.contains(Transparent<std::string>{"eta"}) == true);
+ assert(m.contains(Transparent<std::string>{"gamma"}) == true);
+ assert(m.contains(Transparent<std::string>{"al"}) == false);
+ assert(m.contains(Transparent<std::string>{""}) == false);
+ assert(m.contains(Transparent<std::string>{"g"}) == false);
+}
+
+int main(int, char**) {
+ test<std::vector<std::string>>();
+ test<std::deque<std::string>>();
+ test<MinSequenceContainer<std::string>>();
+ test<std::vector<std::string, min_allocator<std::string>>>();
+
+ {
+ bool transparent_used = false;
+ TransparentComparator c(transparent_used);
+ std::flat_set<int, TransparentComparator> m(std::sorted_unique, {1, 2, 3}, c);
+ assert(!transparent_used);
+ auto b = m.contains(Transparent<int>{3});
+ assert(b);
+ assert(transparent_used);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count.pass.cpp
new file mode 100644
index 000000000000000..478f615358b6068
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count.pass.cpp
@@ -0,0 +1,69 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// size_type count(const key_type& x) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using S = typename KeyContainer::size_type;
+
+ {
+ using M = std::flat_set<Key, std::less<>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.count(0)), S);
+ assert(m.count(0) == 0);
+ assert(m.count(1) == 1);
+ assert(m.count(2) == 1);
+ assert(m.count(3) == 0);
+ assert(m.count(4) == 1);
+ assert(m.count(5) == 1);
+ assert(m.count(6) == 0);
+ assert(m.count(7) == 0);
+ assert(std::as_const(m).count(8) == 1);
+ assert(std::as_const(m).count(9) == 0);
+ }
+ {
+ using M = std::flat_set<Key, std::greater<int>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.count(0)), S);
+ assert(m.count(0) == 0);
+ assert(m.count(1) == 1);
+ assert(m.count(2) == 1);
+ assert(m.count(3) == 0);
+ assert(m.count(4) == 1);
+ assert(m.count(5) == 1);
+ assert(m.count(6) == 0);
+ assert(m.count(7) == 0);
+ assert(std::as_const(m).count(8) == 1);
+ assert(std::as_const(m).count(9) == 0);
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count_transparent.pass.cpp
new file mode 100644
index 000000000000000..b591258f74399c8
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count_transparent.pass.cpp
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class K> size_type count(const K& x) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <string>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
+template <class M>
+concept CanCount = requires(M m, Transparent<int> k) { m.count(k); };
+using TransparentSet = std::flat_set<int, TransparentComparator>;
+using NonTransparentSet = std::flat_set<int, NonTransparentComparator>;
+static_assert(CanCount<TransparentSet>);
+static_assert(CanCount<const TransparentSet>);
+static_assert(!CanCount<NonTransparentSet>);
+static_assert(!CanCount<const NonTransparentSet>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, TransparentComparator, KeyContainer>;
+
+ M m = {"alpha", "beta", "epsilon", "eta", "gamma"};
+ ASSERT_SAME_TYPE(decltype(m.count(Transparent<std::string>{"abc"})), typename M::size_type);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).count(Transparent<std::string>{"b"})), typename M::size_type);
+ assert(m.count(Transparent<std::string>{"alpha"}) == 1);
+ assert(m.count(Transparent<std::string>{"beta"}) == 1);
+ assert(m.count(Transparent<std::string>{"epsilon"}) == 1);
+ assert(m.count(Transparent<std::string>{"eta"}) == 1);
+ assert(m.count(Transparent<std::string>{"gamma"}) == 1);
+ assert(m.count(Transparent<std::string>{"al"}) == 0);
+ assert(m.count(Transparent<std::string>{""}) == 0);
+ assert(m.count(Transparent<std::string>{"g"}) == 0);
+}
+
+int main(int, char**) {
+ test<std::vector<std::string>>();
+ test<std::deque<std::string>>();
+ test<MinSequenceContainer<std::string>>();
+ test<std::vector<std::string, min_allocator<std::string>>>();
+
+ {
+ bool transparent_used = false;
+ TransparentComparator c(transparent_used);
+ std::flat_set<int, TransparentComparator> m(std::sorted_unique, {1, 2, 3}, c);
+ assert(!transparent_used);
+ auto n = m.count(Transparent<int>{3});
+ assert(n == 1);
+ assert(transparent_used);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range.pass.cpp
new file mode 100644
index 000000000000000..a088b7fee17d2ca
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range.pass.cpp
@@ -0,0 +1,77 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// pair<iterator,iterator> equal_range(const key_type& k);
+// pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ {
+ using M = std::flat_set<Key, std::less<>, KeyContainer>;
+ using R = std::pair<typename M::iterator, typename M::iterator>;
+ using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR);
+ auto begin = m.begin();
+ assert(m.equal_range(0) == std::pair(begin, begin));
+ assert(m.equal_range(1) == std::pair(begin, begin + 1));
+ assert(m.equal_range(2) == std::pair(begin + 1, begin + 2));
+ assert(m.equal_range(3) == std::pair(begin + 2, begin + 2));
+ assert(m.equal_range(4) == std::pair(begin + 2, begin + 3));
+ assert(m.equal_range(5) == std::pair(begin + 3, begin + 4));
+ assert(m.equal_range(6) == std::pair(begin + 4, begin + 4));
+ assert(m.equal_range(7) == std::pair(begin + 4, begin + 4));
+ assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin() + 4, m.cbegin() + 5));
+ assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin() + 5, m.cbegin() + 5));
+ }
+
+ {
+ using M = std::flat_set<Key, std::greater<int>, KeyContainer>;
+ using R = std::pair<typename M::iterator, typename M::iterator>;
+ using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR);
+ auto begin = m.begin();
+ assert(m.equal_range(0) == std::pair(begin + 5, begin + 5));
+ assert(m.equal_range(1) == std::pair(begin + 4, begin + 5));
+ assert(m.equal_range(2) == std::pair(begin + 3, begin + 4));
+ assert(m.equal_range(3) == std::pair(begin + 3, begin + 3));
+ assert(m.equal_range(4) == std::pair(begin + 2, begin + 3));
+ assert(m.equal_range(5) == std::pair(begin + 1, begin + 2));
+ assert(m.equal_range(6) == std::pair(begin + 1, begin + 1));
+ assert(m.equal_range(7) == std::pair(begin + 1, begin + 1));
+ assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin(), m.cbegin() + 1));
+ assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin(), m.cbegin()));
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range_transparent.pass.cpp
new file mode 100644
index 000000000000000..ede5d91e19b9fdd
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range_transparent.pass.cpp
@@ -0,0 +1,97 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class K> pair<iterator,iterator> equal_range(const K& x);
+// template<class K> pair<const_iterator,const_iterator> equal_range(const K& x) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <string>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
+template <class M>
+concept CanEqualRange = requires(M m, Transparent<int> k) { m.equal_range(k); };
+using TransparentSet = std::flat_set<int, TransparentComparator>;
+using NonTransparentSet = std::flat_set<int, NonTransparentComparator>;
+static_assert(CanEqualRange<TransparentSet>);
+static_assert(CanEqualRange<const TransparentSet>);
+static_assert(!CanEqualRange<NonTransparentSet>);
+static_assert(!CanEqualRange<const NonTransparentSet>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, TransparentComparator, KeyContainer>;
+
+ using R = std::pair<typename M::iterator, typename M::iterator>;
+ using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
+ M m = {"alpha", "beta", "epsilon", "eta", "gamma"};
+ const auto& cm = m;
+ ASSERT_SAME_TYPE(decltype(m.equal_range(Transparent<std::string>{"abc"})), R);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(Transparent<std::string>{"b"})), CR);
+
+ auto test_found = [&](auto&& map, const std::string& expected_key) {
+ auto [first, last] = map.equal_range(Transparent<std::string>{expected_key});
+ assert(last - first == 1);
+ assert(*first == expected_key);
+ };
+
+ auto test_not_found = [&](auto&& map, const std::string& expected_key, long expected_offset) {
+ auto [first, last] = map.equal_range(Transparent<std::string>{expected_key});
+ assert(first == last);
+ assert(first - m.begin() == expected_offset);
+ };
+
+ test_found(m, "alpha");
+ test_found(m, "beta");
+ test_found(m, "epsilon");
+ test_found(m, "eta");
+ test_found(m, "gamma");
+ test_found(cm, "alpha");
+ test_found(cm, "beta");
+ test_found(cm, "epsilon");
+ test_found(cm, "eta");
+ test_found(cm, "gamma");
+
+ test_not_found(m, "charlie", 2);
+ test_not_found(m, "aaa", 0);
+ test_not_found(m, "zzz", 5);
+ test_not_found(cm, "charlie", 2);
+ test_not_found(cm, "aaa", 0);
+ test_not_found(cm, "zzz", 5);
+}
+
+int main(int, char**) {
+ test<std::vector<std::string>>();
+ test<std::deque<std::string>>();
+ test<MinSequenceContainer<std::string>>();
+ test<std::vector<std::string, min_allocator<std::string>>>();
+
+ {
+ bool transparent_used = false;
+ TransparentComparator c(transparent_used);
+ std::flat_set<int, TransparentComparator> m(std::sorted_unique, {1, 2, 3}, c);
+ assert(!transparent_used);
+ auto p = m.equal_range(Transparent<int>{3});
+ assert(p.first != p.second);
+ assert(transparent_used);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find.pass.cpp
new file mode 100644
index 000000000000000..cf0dd2d1dd831c8
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find.pass.cpp
@@ -0,0 +1,53 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator find(const key_type& k);
+// const_iterator find(const key_type& k) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <string>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, std::less<>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.find(0)), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).find(0)), typename M::const_iterator);
+ assert(m.find(0) == m.end());
+ assert(m.find(1) == m.begin());
+ assert(m.find(2) == m.begin() + 1);
+ assert(m.find(3) == m.end());
+ assert(m.find(4) == m.begin() + 2);
+ assert(m.find(5) == m.begin() + 3);
+ assert(m.find(6) == m.end());
+ assert(m.find(7) == m.end());
+ assert(std::as_const(m).find(8) == m.begin() + 4);
+ assert(std::as_const(m).find(9) == m.end());
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find_transparent.pass.cpp
new file mode 100644
index 000000000000000..730a57b0a6cb855
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find_transparent.pass.cpp
@@ -0,0 +1,88 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class K> iterator find(const K& x);
+// template<class K> const_iterator find(const K& x) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <string>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
+template <class M>
+concept CanFind = requires(M m, Transparent<int> k) { m.find(k); };
+using TransparentSet = std::flat_set<int, TransparentComparator>;
+using NonTransparentSet = std::flat_set<int, NonTransparentComparator>;
+static_assert(CanFind<TransparentSet>);
+static_assert(CanFind<const TransparentSet>);
+static_assert(!CanFind<NonTransparentSet>);
+static_assert(!CanFind<const NonTransparentSet>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, TransparentComparator, KeyContainer>;
+
+ M m = {"alpha", "beta", "epsilon", "eta", "gamma"};
+
+ const auto& cm = m;
+ ASSERT_SAME_TYPE(decltype(m.find(Transparent<std::string>{"abc"})), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).find(Transparent<std::string>{"b"})), typename M::const_iterator);
+
+ auto test_find = [&](auto&& map, const std::string& expected_key, long expected_offset) {
+ auto iter = map.find(Transparent<std::string>{expected_key});
+ assert(iter - map.begin() == expected_offset);
+ };
+
+ test_find(m, "alpha", 0);
+ test_find(m, "beta", 1);
+ test_find(m, "epsilon", 2);
+ test_find(m, "eta", 3);
+ test_find(m, "gamma", 4);
+ test_find(m, "charlie", 5);
+ test_find(m, "aaa", 5);
+ test_find(m, "zzz", 5);
+ test_find(cm, "alpha", 0);
+ test_find(cm, "beta", 1);
+ test_find(cm, "epsilon", 2);
+ test_find(cm, "eta", 3);
+ test_find(cm, "gamma", 4);
+ test_find(cm, "charlie", 5);
+ test_find(cm, "aaa", 5);
+ test_find(cm, "zzz", 5);
+}
+
+int main(int, char**) {
+ test<std::vector<std::string>>();
+ test<std::deque<std::string>>();
+ test<MinSequenceContainer<std::string>>();
+ test<std::vector<std::string, min_allocator<std::string>>>();
+
+ {
+ bool transparent_used = false;
+ TransparentComparator c(transparent_used);
+ std::flat_set<int, TransparentComparator> m(std::sorted_unique, {1, 2, 3}, c);
+ assert(!transparent_used);
+ auto it = m.find(Transparent<int>{3});
+ assert(it != m.end());
+ assert(transparent_used);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound.pass.cpp
new file mode 100644
index 000000000000000..093c32e537ed35f
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound.pass.cpp
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator lower_bound(const key_type& k);
+// const_iterator lower_bound(const key_type& k) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ {
+ using M = std::flat_set<Key, std::less<>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.lower_bound(0)), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).lower_bound(0)), typename M::const_iterator);
+ assert(m.lower_bound(0) == m.begin());
+ assert(m.lower_bound(1) == m.begin());
+ assert(m.lower_bound(2) == m.begin() + 1);
+ assert(m.lower_bound(3) == m.begin() + 2);
+ assert(m.lower_bound(4) == m.begin() + 2);
+ assert(m.lower_bound(5) == m.begin() + 3);
+ assert(m.lower_bound(6) == m.begin() + 4);
+ assert(m.lower_bound(7) == m.begin() + 4);
+ assert(std::as_const(m).lower_bound(8) == m.begin() + 4);
+ assert(std::as_const(m).lower_bound(9) == m.end());
+ }
+ {
+ using M = std::flat_set<Key, std::greater<int>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.lower_bound(0)), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).lower_bound(0)), typename M::const_iterator);
+ assert(m.lower_bound(0) == m.end());
+ assert(m.lower_bound(1) == m.begin() + 4);
+ assert(m.lower_bound(2) == m.begin() + 3);
+ assert(m.lower_bound(3) == m.begin() + 3);
+ assert(m.lower_bound(4) == m.begin() + 2);
+ assert(m.lower_bound(5) == m.begin() + 1);
+ assert(m.lower_bound(6) == m.begin() + 1);
+ assert(m.lower_bound(7) == m.begin() + 1);
+ assert(std::as_const(m).lower_bound(8) == m.begin());
+ assert(std::as_const(m).lower_bound(9) == m.begin());
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound_transparent.pass.cpp
new file mode 100644
index 000000000000000..18f9bc6dd329553
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound_transparent.pass.cpp
@@ -0,0 +1,94 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class K> iterator lower_bound(const K& x);
+// template<class K> const_iterator lower_bound(const K& x) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <string>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
+template <class M>
+concept CanLowerBound = requires(M m, Transparent<int> k) { m.lower_bound(k); };
+using TransparentSet = std::flat_set<int, TransparentComparator>;
+using NonTransparentSet = std::flat_set<int, NonTransparentComparator>;
+static_assert(CanLowerBound<TransparentSet>);
+static_assert(CanLowerBound<const TransparentSet>);
+static_assert(!CanLowerBound<NonTransparentSet>);
+static_assert(!CanLowerBound<const NonTransparentSet>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, TransparentComparator, KeyContainer>;
+
+ M m = {"alpha", "beta", "epsilon", "eta", "gamma"};
+ const auto& cm = m;
+ ASSERT_SAME_TYPE(decltype(m.lower_bound(Transparent<std::string>{"abc"})), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).lower_bound(Transparent<std::string>{"b"})), typename M::const_iterator);
+
+ auto test_lower_bound = [&](auto&& map, const std::string& expected_key, long expected_offset) {
+ auto iter = map.lower_bound(Transparent<std::string>{expected_key});
+ assert(iter - map.begin() == expected_offset);
+ };
+
+ test_lower_bound(m, "abc", 0);
+ test_lower_bound(m, "alpha", 0);
+ test_lower_bound(m, "beta", 1);
+ test_lower_bound(m, "bets", 2);
+ test_lower_bound(m, "charlie", 2);
+ test_lower_bound(m, "echo", 2);
+ test_lower_bound(m, "epsilon", 2);
+ test_lower_bound(m, "eta", 3);
+ test_lower_bound(m, "gamma", 4);
+ test_lower_bound(m, "golf", 5);
+ test_lower_bound(m, "zzz", 5);
+
+ test_lower_bound(cm, "abc", 0);
+ test_lower_bound(cm, "alpha", 0);
+ test_lower_bound(cm, "beta", 1);
+ test_lower_bound(cm, "bets", 2);
+ test_lower_bound(cm, "charlie", 2);
+ test_lower_bound(cm, "echo", 2);
+ test_lower_bound(cm, "epsilon", 2);
+ test_lower_bound(cm, "eta", 3);
+ test_lower_bound(cm, "gamma", 4);
+ test_lower_bound(cm, "golf", 5);
+ test_lower_bound(cm, "zzz", 5);
+}
+
+int main(int, char**) {
+ test<std::vector<std::string>>();
+ test<std::deque<std::string>>();
+ test<MinSequenceContainer<std::string>>();
+ test<std::vector<std::string, min_allocator<std::string>>>();
+
+ {
+ bool transparent_used = false;
+ TransparentComparator c(transparent_used);
+ std::flat_set<int, TransparentComparator> m(std::sorted_unique, {1, 2, 3}, c);
+ assert(!transparent_used);
+ auto it = m.lower_bound(Transparent<int>{3});
+ assert(it != m.end());
+ assert(transparent_used);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound.pass.cpp
new file mode 100644
index 000000000000000..ab34de851031756
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound.pass.cpp
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// iterator upper_bound(const key_type& k);
+// const_iterator upper_bound(const key_type& k) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ {
+ using M = std::flat_set<Key, std::less<>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.upper_bound(0)), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).upper_bound(0)), typename M::const_iterator);
+ assert(m.upper_bound(0) == m.begin());
+ assert(m.upper_bound(1) == m.begin() + 1);
+ assert(m.upper_bound(2) == m.begin() + 2);
+ assert(m.upper_bound(3) == m.begin() + 2);
+ assert(m.upper_bound(4) == m.begin() + 3);
+ assert(m.upper_bound(5) == m.begin() + 4);
+ assert(m.upper_bound(6) == m.begin() + 4);
+ assert(std::as_const(m).upper_bound(7) == m.begin() + 4);
+ assert(std::as_const(m).upper_bound(8) == m.end());
+ assert(std::as_const(m).upper_bound(9) == m.end());
+ }
+
+ {
+ using M = std::flat_set<Key, std::greater<int>, KeyContainer>;
+ M m = {1, 2, 4, 5, 8};
+ ASSERT_SAME_TYPE(decltype(m.upper_bound(0)), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).upper_bound(0)), typename M::const_iterator);
+ assert(m.upper_bound(0) == m.end());
+ assert(m.upper_bound(1) == m.end());
+ assert(m.upper_bound(2) == m.begin() + 4);
+ assert(m.upper_bound(3) == m.begin() + 3);
+ assert(m.upper_bound(4) == m.begin() + 3);
+ assert(m.upper_bound(5) == m.begin() + 2);
+ assert(m.upper_bound(6) == m.begin() + 1);
+ assert(m.upper_bound(7) == m.begin() + 1);
+ assert(std::as_const(m).upper_bound(8) == m.begin() + 1);
+ assert(std::as_const(m).upper_bound(9) == m.begin());
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound_transparent.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound_transparent.pass.cpp
new file mode 100644
index 000000000000000..69ce2ae926a305e
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound_transparent.pass.cpp
@@ -0,0 +1,93 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// template<class K> iterator upper_bound(const K& x);
+// template<class K> const_iterator upper_bound(const K& x) const;
+
+#include <cassert>
+#include <deque>
+#include <flat_set>
+#include <string>
+#include <utility>
+
+#include "MinSequenceContainer.h"
+#include "../helpers.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+
+// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
+template <class M>
+concept CanUpperBound = requires(M m, Transparent<int> k) { m.upper_bound(k); };
+using TransparentSet = std::flat_set<int, TransparentComparator>;
+using NonTransparentSet = std::flat_set<int, NonTransparentComparator>;
+static_assert(CanUpperBound<TransparentSet>);
+static_assert(CanUpperBound<const TransparentSet>);
+static_assert(!CanUpperBound<NonTransparentSet>);
+static_assert(!CanUpperBound<const NonTransparentSet>);
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+ using M = std::flat_set<Key, TransparentComparator, KeyContainer>;
+
+ M m = {"alpha", "beta", "epsilon", "eta", "gamma"};
+ const auto& cm = m;
+ ASSERT_SAME_TYPE(decltype(m.lower_bound(Transparent<std::string>{"abc"})), typename M::iterator);
+ ASSERT_SAME_TYPE(decltype(std::as_const(m).lower_bound(Transparent<std::string>{"b"})), typename M::const_iterator);
+
+ auto test_upper_bound = [&](auto&& map, const std::string& expected_key, long expected_offset) {
+ auto iter = map.upper_bound(Transparent<std::string>{expected_key});
+ assert(iter - map.begin() == expected_offset);
+ };
+
+ test_upper_bound(m, "abc", 0);
+ test_upper_bound(m, "alpha", 1);
+ test_upper_bound(m, "beta", 2);
+ test_upper_bound(m, "bets", 2);
+ test_upper_bound(m, "charlie", 2);
+ test_upper_bound(m, "echo", 2);
+ test_upper_bound(m, "epsilon", 3);
+ test_upper_bound(m, "eta", 4);
+ test_upper_bound(m, "gamma", 5);
+ test_upper_bound(m, "golf", 5);
+ test_upper_bound(m, "zzz", 5);
+
+ test_upper_bound(cm, "abc", 0);
+ test_upper_bound(cm, "alpha", 1);
+ test_upper_bound(cm, "beta", 2);
+ test_upper_bound(cm, "bets", 2);
+ test_upper_bound(cm, "charlie", 2);
+ test_upper_bound(cm, "echo", 2);
+ test_upper_bound(cm, "epsilon", 3);
+ test_upper_bound(cm, "eta", 4);
+ test_upper_bound(cm, "gamma", 5);
+ test_upper_bound(cm, "golf", 5);
+ test_upper_bound(cm, "zzz", 5);
+}
+
+int main(int, char**) {
+ test<std::vector<std::string>>();
+ test<std::deque<std::string>>();
+ test<MinSequenceContainer<std::string>>();
+ test<std::vector<std::string, min_allocator<std::string>>>();
+ {
+ bool transparent_used = false;
+ TransparentComparator c(transparent_used);
+ std::flat_set<int, TransparentComparator> m(std::sorted_unique, {1, 2, 3}, c);
+ assert(!transparent_used);
+ auto it = m.upper_bound(Transparent<int>{2});
+ assert(it != m.end());
+ assert(transparent_used);
+ }
+
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/helpers.h b/libcxx/test/std/containers/container.adaptors/flat.set/helpers.h
new file mode 100644
index 000000000000000..9fff262d84234e9
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/helpers.h
@@ -0,0 +1,294 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef SUPPORT_flat_set_HELPERS_H
+#define SUPPORT_flat_set_HELPERS_H
+
+#include <algorithm>
+#include <cassert>
+#include <string>
+#include <vector>
+#include <flat_set>
+
+#include "test_allocator.h"
+#include "test_macros.h"
+
+template <class... Args>
+void check_invariant(const std::flat_set<Args...>& m) {
+ assert(std::is_sorted(m.begin(), m.end(), m.key_comp()));
+ auto key_equal = [&](const auto& x, const auto& y) {
+ const auto& c = m.key_comp();
+ return !c(x, y) && !c(y, x);
+ };
+ assert(std::adjacent_find(m.begin(), m.end(), key_equal) == m.end());
+}
+
+struct StartsWith {
+ explicit StartsWith(char ch) : lower_(1, ch), upper_(1, ch + 1) {}
+ StartsWith(const StartsWith&) = delete;
+ void operator=(const StartsWith&) = delete;
+ struct Less {
+ using is_transparent = void;
+ bool operator()(const std::string& a, const std::string& b) const { return a < b; }
+ bool operator()(const StartsWith& a, const std::string& b) const { return a.upper_ <= b; }
+ bool operator()(const std::string& a, const StartsWith& b) const { return a < b.lower_; }
+ bool operator()(const StartsWith&, const StartsWith&) const {
+ assert(false); // should not be called
+ return false;
+ }
+ };
+
+private:
+ std::string lower_;
+ std::string upper_;
+};
+
+template <class T>
+struct CopyOnlyVector : std::vector<T> {
+ using std::vector<T>::vector;
+
+ CopyOnlyVector(const CopyOnlyVector&) = default;
+ CopyOnlyVector(CopyOnlyVector&& other) : CopyOnlyVector(other) {}
+ CopyOnlyVector(CopyOnlyVector&& other, std::vector<T>::allocator_type alloc) : CopyOnlyVector(other, alloc) {}
+
+ CopyOnlyVector& operator=(const CopyOnlyVector&) = default;
+ CopyOnlyVector& operator=(CopyOnlyVector& other) { return this->operator=(other); }
+};
+
+template <class T, bool ConvertibleToT = false>
+struct Transparent {
+ T t;
+
+ operator T() const
+ requires ConvertibleToT
+ {
+ return t;
+ }
+};
+
+template <class T>
+using ConvertibleTransparent = Transparent<T, true>;
+
+template <class T>
+using NonConvertibleTransparent = Transparent<T, false>;
+
+struct TransparentComparator {
+ using is_transparent = void;
+
+ bool* transparent_used = nullptr;
+ TransparentComparator() = default;
+ TransparentComparator(bool& used) : transparent_used(&used) {}
+
+ template <class T, bool Convertible>
+ bool operator()(const T& t, const Transparent<T, Convertible>& transparent) const {
+ if (transparent_used != nullptr) {
+ *transparent_used = true;
+ }
+ return t < transparent.t;
+ }
+
+ template <class T, bool Convertible>
+ bool operator()(const Transparent<T, Convertible>& transparent, const T& t) const {
+ if (transparent_used != nullptr) {
+ *transparent_used = true;
+ }
+ return transparent.t < t;
+ }
+
+ template <class T>
+ bool operator()(const T& t1, const T& t2) const {
+ return t1 < t2;
+ }
+};
+
+struct NonTransparentComparator {
+ template <class T, bool Convertible>
+ bool operator()(const T&, const Transparent<T, Convertible>&) const;
+
+ template <class T, bool Convertible>
+ bool operator()(const Transparent<T, Convertible>&, const T&) const;
+
+ template <class T>
+ bool operator()(const T&, const T&) const;
+};
+
+struct NoDefaultCtr {
+ NoDefaultCtr() = delete;
+};
+
+#ifndef TEST_HAS_NO_EXCEPTIONS
+template <class T>
+struct EmplaceUnsafeContainer : std::vector<T> {
+ using std::vector<T>::vector;
+
+ template <class... Args>
+ auto emplace(Args&&... args) -> decltype(std::declval<std::vector<T>>().emplace(std::forward<Args>(args)...)) {
+ if (this->size() > 1) {
+ auto it1 = this->begin();
+ auto it2 = it1 + 1;
+ // messing up the container
+ std::iter_swap(it1, it2);
+ }
+
+ throw 42;
+ }
+
+ template <class... Args>
+ auto insert(Args&&... args) -> decltype(std::declval<std::vector<T>>().insert(std::forward<Args>(args)...)) {
+ if (this->size() > 1) {
+ auto it1 = this->begin();
+ auto it2 = it1 + 1;
+ // messing up the container
+ std::iter_swap(it1, it2);
+ }
+
+ throw 42;
+ }
+};
+
+template <class T>
+struct ThrowOnEraseContainer : std::vector<T> {
+ using std::vector<T>::vector;
+
+ template <class... Args>
+ auto erase(Args&&... args) -> decltype(std::declval<std::vector<T>>().erase(std::forward<Args>(args)...)) {
+ throw 42;
+ }
+};
+
+template <class T>
+struct ThrowOnMoveContainer : std::vector<T> {
+ using std::vector<T>::vector;
+
+ ThrowOnMoveContainer(ThrowOnMoveContainer&&) { throw 42; }
+
+ ThrowOnMoveContainer& operator=(ThrowOnMoveContainer&&) { throw 42; }
+};
+
+#endif
+
+template <class F>
+void test_emplace_exception_guarantee([[maybe_unused]] F&& emplace_function) {
+#ifndef TEST_HAS_NO_EXCEPTIONS
+ using C = TransparentComparator;
+ {
+ // Throw on emplace the key, and underlying has strong exception guarantee
+ using KeyContainer = std::vector<int, test_allocator<int>>;
+ using M = std::flat_set<int, C, KeyContainer>;
+
+ LIBCPP_STATIC_ASSERT(std::__container_traits<KeyContainer>::__emplacement_has_strong_exception_safety_guarantee);
+
+ test_allocator_statistics stats;
+
+ KeyContainer a({1, 2, 3, 4}, test_allocator<int>{&stats});
+ [[maybe_unused]] auto expected_keys = a;
+ M m(std::sorted_unique, std::move(a));
+
+ stats.throw_after = 1;
+ try {
+ emplace_function(m, 0);
+ assert(false);
+ } catch (const std::bad_alloc&) {
+ check_invariant(m);
+ // In libc++, the flat_set is unchanged
+ LIBCPP_ASSERT(m.size() == 4);
+ LIBCPP_ASSERT(std::ranges::equal(m, expected_keys));
+ }
+ }
+ {
+ // Throw on emplace the key, and underlying has no strong exception guarantee
+ using KeyContainer = EmplaceUnsafeContainer<int>;
+ using M = std::flat_set<int, C, KeyContainer>;
+
+ LIBCPP_STATIC_ASSERT(!std::__container_traits<KeyContainer>::__emplacement_has_strong_exception_safety_guarantee);
+ KeyContainer a = {1, 2, 3, 4};
+ M m(std::sorted_unique, std::move(a));
+ try {
+ emplace_function(m, 0);
+ assert(false);
+ } catch (int) {
+ check_invariant(m);
+ // In libc++, the flat_set is cleared
+ LIBCPP_ASSERT(m.size() == 0);
+ }
+ }
+#endif
+}
+
+template <class F>
+void test_insert_range_exception_guarantee([[maybe_unused]] F&& insert_function) {
+#ifndef TEST_HAS_NO_EXCEPTIONS
+ using KeyContainer = EmplaceUnsafeContainer<int>;
+ using M = std::flat_set<int, std::ranges::less, KeyContainer>;
+ test_allocator_statistics stats;
+ KeyContainer a{1, 2, 3, 4};
+ M m(std::sorted_unique, std::move(a));
+
+ std::vector<int> newValues = {0, 1, 5, 6, 7, 8};
+ stats.throw_after = 1;
+ try {
+ insert_function(m, newValues);
+ assert(false);
+ } catch (int) {
+ check_invariant(m);
+ // In libc++, we clear if anything goes wrong when inserting a range
+ LIBCPP_ASSERT(m.size() == 0);
+ }
+#endif
+}
+
+template <class F>
+void test_erase_exception_guarantee([[maybe_unused]] F&& erase_function) {
+#ifndef TEST_HAS_NO_EXCEPTIONS
+ {
+ // key erase throws
+ using KeyContainer = ThrowOnEraseContainer<int>;
+ using M = std::flat_set<int, TransparentComparator, KeyContainer>;
+
+ KeyContainer a{1, 2, 3, 4};
+ M m(std::sorted_unique, std::move(a));
+ try {
+ erase_function(m, 3);
+ assert(false);
+ } catch (int) {
+ check_invariant(m);
+ // In libc++, we clear if anything goes wrong when erasing
+ LIBCPP_ASSERT(m.size() == 0);
+ }
+ }
+#endif
+}
+class Moveable {
+ int int_;
+ double double_;
+
+public:
+ Moveable() : int_(0), double_(0) {}
+ Moveable(int i, double d) : int_(i), double_(d) {}
+ Moveable(Moveable&& x) : int_(x.int_), double_(x.double_) {
+ x.int_ = -1;
+ x.double_ = -1;
+ }
+ Moveable& operator=(Moveable&& x) {
+ int_ = x.int_;
+ x.int_ = -1;
+ double_ = x.double_;
+ x.double_ = -1;
+ return *this;
+ }
+
+ Moveable(const Moveable&) = delete;
+ Moveable& operator=(const Moveable&) = delete;
+ bool operator==(const Moveable& x) const { return int_ == x.int_ && double_ == x.double_; }
+ bool operator<(const Moveable& x) const { return int_ < x.int_ || (int_ == x.int_ && double_ < x.double_); }
+
+ int get() const { return int_; }
+ bool moved() const { return int_ == -1; }
+};
+
+#endif // SUPPORT_flat_set_HELPERS_H
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/incomplete_type.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/incomplete_type.pass.cpp
new file mode 100644
index 000000000000000..c4a9810016536bd
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/incomplete_type.pass.cpp
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// Check that std::flat_set and its iterators can be instantiated with an incomplete
+// type.
+
+#include <flat_set>
+#include <vector>
+
+struct A {
+ using Set = std::flat_set<A>;
+ int data;
+ Set m;
+ Set::iterator it;
+ Set::const_iterator cit;
+};
+
+// Implement the operator< required in order to instantiate flat_set<A>
+bool operator<(A const& L, A const& R) { return L.data < R.data; }
+
+int main(int, char**) {
+ A a;
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/op_compare.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/op_compare.pass.cpp
new file mode 100644
index 000000000000000..f6d08bb736d3004
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/op_compare.pass.cpp
@@ -0,0 +1,105 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// <flat_set>
+
+// friend bool operator==(const flat_set& x, const flat_set& y);
+// friend synth-three-way-result<value_type>
+// operator<=>(const flat_set& x, const flat_set& y);
+
+#include <algorithm>
+#include <cassert>
+#include <deque>
+#include <compare>
+#include <flat_set>
+#include <functional>
+#include <limits>
+#include <vector>
+
+#include "MinSequenceContainer.h"
+#include "test_macros.h"
+#include "min_allocator.h"
+#include "test_allocator.h"
+#include "test_comparisons.h"
+#include "test_container_comparisons.h"
+
+template <class KeyContainer>
+void test() {
+ using Key = typename KeyContainer::value_type;
+
+ {
+ using C = std::flat_set<Key>;
+ C s1 = {1};
+ C s2 = {2};
+ ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::strong_ordering);
+ AssertComparisonsReturnBool<C>();
+ assert(testComparisons(s1, s2, false, true));
+ s2 = {1};
+ assert(testComparisons(s1, s2, true, false));
+ s2 = {1, 2};
+ assert(testComparisons(s1, s2, false, true));
+ s1 = {0, 1, 2};
+ assert(testComparisons(s1, s2, false, true));
+ s2 = {0, 1, 3};
+ assert(testComparisons(s1, s2, false, true));
+ }
+ {
+ // Comparisons use value_type's native operators, not the comparator
+ using C = std::flat_set<Key, std::greater<Key>>;
+ C s1 = {1};
+ C s2 = {2};
+ ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::strong_ordering);
+ AssertComparisonsReturnBool<C>();
+ assert(testComparisons(s1, s2, false, true));
+ s2 = {1};
+ assert(testComparisons(s1, s2, true, false));
+ s2 = {1, 2};
+ assert(testComparisons(s1, s2, false, true));
+ s1 = {0, 1, 2};
+ assert(testComparisons(s1, s2, false, false));
+ s2 = {0, 1, 3};
+ assert(testComparisons(s1, s2, false, true));
+ }
+}
+
+int main(int, char**) {
+ test<std::vector<int>>();
+ test<std::deque<int>>();
+ test<MinSequenceContainer<int>>();
+ test<std::vector<int, min_allocator<int>>>();
+
+ {
+ using C = std::flat_set<double>;
+ C s1 = {1};
+ C s2 = C(std::sorted_unique, {std::numeric_limits<double>::quiet_NaN()});
+ ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::partial_ordering);
+ AssertComparisonsReturnBool<C>();
+ assert(testComparisonsComplete(s1, s2, false, false, false));
+ }
+ {
+ // Comparisons use value_type's native operators, not the comparator
+ struct StrongComp {
+ bool operator()(double a, double b) const { return std::strong_order(a, b) < 0; }
+ };
+ using C = std::flat_set<double, StrongComp>;
+ C s1 = {1};
+ C s2 = {std::numeric_limits<double>::quiet_NaN(), std::numeric_limits<double>::quiet_NaN()};
+ ASSERT_SAME_TYPE(decltype(s1 <=> s2), std::partial_ordering);
+ AssertComparisonsReturnBool<C>();
+ assert(testComparisonsComplete(s1, s2, false, false, false));
+ s1 = {1, std::numeric_limits<double>::quiet_NaN(), 1};
+ s2 = {std::numeric_limits<double>::quiet_NaN(), 1};
+ assert(std::lexicographical_compare_three_way(s1.begin(), s1.end(), s2.begin(), s2.end(), std::strong_order) ==
+ std::strong_ordering::equal);
+ assert(s1 != s2);
+ assert((s1 <=> s2) == std::partial_ordering::unordered);
+ }
+ return 0;
+}
diff --git a/libcxx/test/std/containers/container.adaptors/flat.set/types.compile.pass.cpp b/libcxx/test/std/containers/container.adaptors/flat.set/types.compile.pass.cpp
new file mode 100644
index 000000000000000..a845b2b81e89d35
--- /dev/null
+++ b/libcxx/test/std/containers/container.adaptors/flat.set/types.compile.pass.cpp
@@ -0,0 +1,94 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
+
+// using key_type = Key;
+// using value_type = Key;
+// using key_compare = Compare;
+// using value_compare = Compare;
+// using reference = value_type&;
+// using const_reference = const value_type&;
+// using size_type = typename KeyContainer::size_type;
+// using difference_type = typename KeyContainer::difference_type;
+// using iterator = implementation-defined; // see [container.requirements]
+// using const_iterator = implementation-defined; // see [container.requirements]
+// using reverse_iterator = std::reverse_iterator<iterator>;
+// using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+// using container_type = KeyContainer;
+
+#include <concepts>
+#include <deque>
+#include <flat_set>
+#include <functional>
+#include <ranges>
+#include <string>
+#include <vector>
+#include "min_allocator.h"
+
+void test() {
+ {
+ using M = std::flat_set<int>;
+ static_assert(std::is_same_v<typename M::key_type, int>);
+ static_assert(std::is_same_v<typename M::value_type, int>);
+ static_assert(std::is_same_v<typename M::key_compare, std::less<int>>);
+ static_assert(std::is_same_v<typename M::value_compare, std::less<int>>);
+ static_assert(std::is_same_v<typename M::reference, int&>);
+ static_assert(std::is_same_v<typename M::const_reference, const int&>);
+ static_assert(std::is_same_v<typename M::size_type, size_t>);
+ static_assert(std::is_same_v<typename M::difference_type, ptrdiff_t>);
+ static_assert(requires { typename M::iterator; });
+ static_assert(requires { typename M::const_iterator; });
+ static_assert(std::is_same_v<typename M::reverse_iterator, std::reverse_iterator<typename M::iterator>>);
+ static_assert(
+ std::is_same_v<typename M::const_reverse_iterator, std::reverse_iterator<typename M::const_iterator>>);
+ static_assert(std::is_same_v<typename M::container_type, std::vector<int>>);
+ static_assert(requires { typename M::value_compare; });
+ }
+
+ {
+ struct A {};
+ struct Compare {
+ bool operator()(const std::string&, const std::string&) const;
+ };
+ using M = std::flat_set<std::string, Compare, std::deque<std::string>>;
+ static_assert(std::is_same_v<typename M::key_type, std::string>);
+ static_assert(std::is_same_v<typename M::value_type, std::string>);
+ static_assert(std::is_same_v<typename M::key_compare, Compare>);
+ static_assert(std::is_same_v<typename M::value_compare, Compare>);
+ static_assert(std::is_same_v<typename M::reference, std::string&>);
+ static_assert(std::is_same_v<typename M::const_reference, const std::string&>);
+ static_assert(std::is_same_v<typename M::size_type, size_t>);
+ static_assert(std::is_same_v<typename M::difference_type, ptrdiff_t>);
+ static_assert(requires { typename M::iterator; });
+ static_assert(requires { typename M::const_iterator; });
+ static_assert(std::is_same_v<typename M::reverse_iterator, std::reverse_iterator<typename M::iterator>>);
+ static_assert(
+ std::is_same_v<typename M::const_reverse_iterator, std::reverse_iterator<typename M::const_iterator>>);
+ static_assert(std::is_same_v<typename M::container_type, std::deque<std::string>>);
+ }
+ {
+ using C = std::flat_set<short, std::greater<long>, std::deque<short, min_allocator<short>>>;
+ static_assert(std::is_same_v<C::key_type, short>);
+ static_assert(std::is_same_v<C::value_type, short>);
+ static_assert(std::is_same_v<C::key_compare, std::greater<long>>);
+ static_assert(std::is_same_v<C::value_compare, std::greater<long>>);
+ static_assert(std::is_same_v<C::reference, short&>);
+ static_assert(std::is_same_v<C::const_reference, const short&>);
+ static_assert(std::random_access_iterator<C::iterator>);
+ static_assert(std::random_access_iterator<C::const_iterator>);
+ static_assert(std::random_access_iterator<C::reverse_iterator>);
+ static_assert(std::random_access_iterator<C::const_reverse_iterator>);
+ static_assert(std::is_same_v<C::reverse_iterator, std::reverse_iterator<C::iterator>>);
+ static_assert(std::is_same_v<C::const_reverse_iterator, std::reverse_iterator<C::const_iterator>>);
+ // size_type is invariably size_t
+ static_assert(std::is_same_v<C::size_type, std::size_t>);
+ static_assert(std::is_same_v<C::difference_type, std::ptrdiff_t>);
+ static_assert(std::is_same_v<C::container_type, std::deque<short, min_allocator<short>>>);
+ }
+}
More information about the libcxx-commits
mailing list