[libcxx-commits] [libcxx] [libc++] implement std::flat_set (PR #125241)
via libcxx-commits
libcxx-commits at lists.llvm.org
Sun Feb 9 01:29:39 PST 2025
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-libcxx
Author: Hui (huixie90)
<details>
<summary>Changes</summary>
---
Patch is 336.17 KiB, truncated to 20.00 KiB below, full version: https://github.com/llvm/llvm-project/pull/125241.diff
91 Files Affected:
- (modified) libcxx/docs/ReleaseNotes/21.rst (+1)
- (modified) libcxx/docs/Status/Cxx23Papers.csv (+1-1)
- (modified) libcxx/include/CMakeLists.txt (+2)
- (added) libcxx/include/__flat_set/flat_set.h (+856)
- (added) libcxx/include/flat_set (+59)
- (modified) libcxx/include/module.modulemap (+16)
- (modified) libcxx/modules/std.compat.cppm.in (-3)
- (modified) libcxx/modules/std.cppm.in (+1-3)
- (modified) libcxx/modules/std/flat_set.inc (+3-1)
- (added) libcxx/test/libcxx/containers/container.adaptors/flat.set/assert.sorted_unique.pass.cpp (+226)
- (modified) libcxx/test/libcxx/transitive_includes/cxx03.csv (+8)
- (modified) libcxx/test/libcxx/transitive_includes/cxx11.csv (+8)
- (modified) libcxx/test/libcxx/transitive_includes/cxx14.csv (+8)
- (modified) libcxx/test/libcxx/transitive_includes/cxx17.csv (+8)
- (modified) libcxx/test/libcxx/transitive_includes/cxx20.csv (+8)
- (modified) libcxx/test/libcxx/transitive_includes/cxx23.csv (+14-1)
- (modified) libcxx/test/libcxx/transitive_includes/cxx26.csv (+14)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.pass.cpp (+52)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/empty.verify.cpp (+20)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/max_size.pass.cpp (+68)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.capacity/size.pass.cpp (+70)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/alloc.pass.cpp (+64)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/assign_initializer_list.pass.cpp (+61)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/compare.pass.cpp (+87)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/containers.pass.cpp (+157)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy.pass.cpp (+68)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_alloc.pass.cpp (+67)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/copy_assign.pass.cpp (+100)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.compile.pass.cpp (+43)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct.pass.cpp (+317)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/deduct_pmr.pass.cpp (+94)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/default.pass.cpp (+96)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/dtor_noexcept.pass.cpp (+61)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/initializer_list.pass.cpp (+155)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/iter_iter.pass.cpp (+140)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move.pass.cpp (+188)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_alloc.pass.cpp (+79)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/move_assign.pass.cpp (+241)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/pmr.pass.cpp (+326)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/range.pass.cpp (+177)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_container.pass.cpp (+147)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_initializer_list.pass.cpp (+154)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.cons/sorted_iter_iter.pass.cpp (+160)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if.pass.cpp (+93)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.erasure/erase_if_exceptions.pass.cpp (+133)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator.pass.cpp (+97)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_comparison.pass.cpp (+158)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/iterator_concept_conformance.compile.pass.cpp (+77)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/range_concept_conformance.compile.pass.cpp (+52)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.iterators/reverse_iterator.pass.cpp (+91)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/clear.pass.cpp (+66)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace.pass.cpp (+146)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/emplace_hint.pass.cpp (+159)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter.pass.cpp (+126)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_iter_iter.pass.cpp (+97)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key.pass.cpp (+96)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/erase_key_transparent.pass.cpp (+148)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/extract.pass.cpp (+92)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_cv.pass.cpp (+83)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_initializer_list.pass.cpp (+73)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_cv.pass.cpp (+80)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_iter.pass.cpp (+94)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_iter_rv.pass.cpp (+78)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_range.pass.cpp (+103)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_rv.pass.cpp (+86)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_initializer_list.pass.cpp (+63)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_sorted_iter_iter.pass.cpp (+82)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/insert_transparent.pass.cpp (+178)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/replace.pass.cpp (+78)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_exception.pass.cpp (+61)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_free.pass.cpp (+100)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.modifiers/swap_member.pass.cpp (+96)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.observers/comp.pass.cpp (+76)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains.pass.cpp (+73)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/contains_transparent.pass.cpp (+75)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count.pass.cpp (+73)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/count_transparent.pass.cpp (+75)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range.pass.cpp (+81)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/equal_range_transparent.pass.cpp (+101)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find.pass.cpp (+57)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/find_transparent.pass.cpp (+92)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound.pass.cpp (+74)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/lower_bound_transparent.pass.cpp (+98)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound.pass.cpp (+75)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/flat.set.operations/upper_bound_transparent.pass.cpp (+98)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/helpers.h (+307)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/incomplete_type.pass.cpp (+36)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/op_compare.pass.cpp (+110)
- (added) libcxx/test/std/containers/container.adaptors/flat.set/types.compile.pass.cpp (+94)
- (added) libcxx/test/std/language.support/support.limits/support.limits.general/flat_set.version.compile.pass.cpp (+80)
- (modified) libcxx/utils/libcxx/header_information.py (+1-1)
``````````diff
diff --git a/libcxx/docs/ReleaseNotes/21.rst b/libcxx/docs/ReleaseNotes/21.rst
index 82f1de6bad39423..0c1029f50a6fe7d 100644
--- a/libcxx/docs/ReleaseNotes/21.rst
+++ b/libcxx/docs/ReleaseNotes/21.rst
@@ -39,6 +39,7 @@ Implemented Papers
------------------
- N4258: Cleaning-up noexcept in the Library (`Github <https://github.com/llvm/llvm-project/issues/99937>`__)
+- P1222R4: A Standard ``flat_set`` is partially implemented and ``flat_set`` is provided (`Github <https://github.com/llvm/llvm-project/issues/105193>`__)
Improvements and New Features
-----------------------------
diff --git a/libcxx/docs/Status/Cxx23Papers.csv b/libcxx/docs/Status/Cxx23Papers.csv
index 264c5417a5c28be..bcd9c5c43a9c695 100644
--- a/libcxx/docs/Status/Cxx23Papers.csv
+++ b/libcxx/docs/Status/Cxx23Papers.csv
@@ -54,7 +54,7 @@
"`P0009R18 <https://wg21.link/P0009R18>`__","mdspan: A Non-Owning Multidimensional Array Reference","2022-07 (Virtual)","|Complete|","18",""
"`P0429R9 <https://wg21.link/P0429R9>`__","A Standard ``flat_map``","2022-07 (Virtual)","|Complete|","20",""
"`P1169R4 <https://wg21.link/P1169R4>`__","``static operator()``","2022-07 (Virtual)","|Complete|","16",""
-"`P1222R4 <https://wg21.link/P1222R4>`__","A Standard ``flat_set``","2022-07 (Virtual)","","",""
+"`P1222R4 <https://wg21.link/P1222R4>`__","A Standard ``flat_set``","2022-07 (Virtual)","|In progress|","",""
"`P1223R5 <https://wg21.link/P1223R5>`__","``ranges::find_last()``, ``ranges::find_last_if()``, and ``ranges::find_last_if_not()``","2022-07 (Virtual)","|Complete|","19",""
"`P1467R9 <https://wg21.link/P1467R9>`__","Extended ``floating-point`` types and standard names","2022-07 (Virtual)","","",""
"`P1642R11 <https://wg21.link/P1642R11>`__","Freestanding ``[utilities]``, ``[ranges]``, and ``[iterators]``","2022-07 (Virtual)","","",""
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..30fe1343e63ee9d
--- /dev/null
+++ b/libcxx/include/__flat_set/flat_set.h
@@ -0,0 +1,856 @@
+// -*- 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;
+
+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 uses_allocator<container_type, _Allocator>::value
+ _LIBCPP_HIDE_FROM_ABI explicit flat_set(const _Allocator& __alloc)
+ : flat_set(__ctor_uses_allocator_empty_tag{}, __alloc) {}
+
+ template <class _Allocator>
+ requires uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 && uses_allocator<container_type, _Allocator>::value)
+ _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 && uses_allocator<container_type, _Allocator>::value)
+ _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 && uses_allocator<container_type, _Allocator>::value)
+ _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 && uses_allocator<container_type, _Allocator>::value)
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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 uses_allocator<container_type, _Allocator>::value
+ _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_transparent_v<_Compare> && 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_transparent_v<_Compare> && 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_so...
[truncated]
``````````
</details>
https://github.com/llvm/llvm-project/pull/125241
More information about the libcxx-commits
mailing list