Skip to content

Commit 0cce96e

Browse files
vinay-deshmukhvinay-deshmukh
committed
git-clang-format upstream/main
1 parent e2f3b8f commit 0cce96e

File tree

7 files changed

+6534
-6449
lines changed

7 files changed

+6534
-6449
lines changed

‎libcxx/include/__tree‎

Lines changed: 33 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -952,9 +952,15 @@ public:
952952
}
953953

954954
private:
955-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const __node_allocator& __node_alloc() const _NOEXCEPT { return __node_alloc_; }
956-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __end_node_pointer& __begin_node() _NOEXCEPT { return __begin_node_; }
957-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const __end_node_pointer& __begin_node() const _NOEXCEPT { return __begin_node_; }
955+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const __node_allocator& __node_alloc() const _NOEXCEPT {
956+
return __node_alloc_;
957+
}
958+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __end_node_pointer& __begin_node() _NOEXCEPT {
959+
return __begin_node_;
960+
}
961+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const __end_node_pointer& __begin_node() const _NOEXCEPT {
962+
return __begin_node_;
963+
}
958964

959965
public:
960966
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 allocator_type __alloc() const _NOEXCEPT {
@@ -1169,12 +1175,13 @@ public:
11691175
// new (std::addressof(kk))(__key_type)(__value.first);
11701176
// __emplace_hint_unique(__p, std::move(kk), std::move(__value.second));
11711177
// } else {
1172-
__emplace_hint_unique(__p, const_cast<__key_type&&>(__value.first), std::move(__value.second));
1178+
__emplace_hint_unique(__p, const_cast<__key_type&&>(__value.first), std::move(__value.second));
11731179
// }
11741180
}
11751181

11761182
template <class _ValueT = _Tp, __enable_if_t<!__is_tree_value_type<_ValueT>::value, int> = 0>
1177-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 void __insert_unique_from_orphaned_node(const_iterator __p, _Tp&& __value) {
1183+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 void
1184+
__insert_unique_from_orphaned_node(const_iterator __p, _Tp&& __value) {
11781185
__emplace_hint_unique(__p, std::move(__value));
11791186
}
11801187

@@ -1205,7 +1212,8 @@ public:
12051212
}
12061213

12071214
template <class _ValueT = _Tp, __enable_if_t<!__is_tree_value_type<_ValueT>::value, int> = 0>
1208-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 void __insert_multi_from_orphaned_node(const_iterator __p, _Tp&& __value) {
1215+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 void
1216+
__insert_multi_from_orphaned_node(const_iterator __p, _Tp&& __value) {
12091217
__emplace_hint_multi(__p, std::move(__value));
12101218
}
12111219

@@ -1266,7 +1274,8 @@ public:
12661274
return __lower_bound(__v, __root(), __end_node());
12671275
}
12681276
template <class _Key>
1269-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 iterator __lower_bound(const _Key& __v, __node_pointer __root, __end_node_pointer __result);
1277+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 iterator
1278+
__lower_bound(const _Key& __v, __node_pointer __root, __end_node_pointer __result);
12701279
template <class _Key>
12711280
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const_iterator lower_bound(const _Key& __v) const {
12721281
return __lower_bound(__v, __root(), __end_node());
@@ -1279,7 +1288,8 @@ public:
12791288
return __upper_bound(__v, __root(), __end_node());
12801289
}
12811290
template <class _Key>
1282-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 iterator __upper_bound(const _Key& __v, __node_pointer __root, __end_node_pointer __result);
1291+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 iterator
1292+
__upper_bound(const _Key& __v, __node_pointer __root, __end_node_pointer __result);
12831293
template <class _Key>
12841294
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const_iterator upper_bound(const _Key& __v) const {
12851295
return __upper_bound(__v, __root(), __end_node());
@@ -1330,8 +1340,10 @@ public:
13301340
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 void __copy_assign_alloc(const __tree&, false_type) {}
13311341

13321342
private:
1333-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __node_base_pointer& __find_leaf_low(__parent_pointer& __parent, const key_type& __v);
1334-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __node_base_pointer& __find_leaf_high(__parent_pointer& __parent, const key_type& __v);
1343+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __node_base_pointer&
1344+
__find_leaf_low(__parent_pointer& __parent, const key_type& __v);
1345+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __node_base_pointer&
1346+
__find_leaf_high(__parent_pointer& __parent, const key_type& __v);
13351347
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __node_base_pointer&
13361348
__find_leaf(const_iterator __hint, __parent_pointer& __parent, const key_type& __v);
13371349

@@ -1358,11 +1370,12 @@ private:
13581370
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 void __move_assign_alloc(__tree&, false_type) _NOEXCEPT {}
13591371

13601372
template <class _From, class _ValueT = _Tp, __enable_if_t<__is_tree_value_type<_ValueT>::value, int> = 0>
1361-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 static void __assign_value(__get_node_value_type_t<value_type>& __lhs, _From&& __rhs) {
1373+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 static void
1374+
__assign_value(__get_node_value_type_t<value_type>& __lhs, _From&& __rhs) {
13621375
using __key_type = typename _NodeTypes::key_type;
13631376

1364-
if(std::is_constant_evaluated()){
1365-
__get_node_value_type_t<value_type> tmp {__rhs.first, __rhs.second};
1377+
if (std::is_constant_evaluated()) {
1378+
__get_node_value_type_t<value_type> tmp{__rhs.first, __rhs.second};
13661379
// tmp.first = const_cast<__copy_cvref_t<_From, __key_type>&&>(__rhs.first);
13671380
// tmp.second = std::forward<_From>(__rhs).second;
13681381
// __lhs = pair<const int, double>
@@ -1371,7 +1384,7 @@ private:
13711384
// const_cast is not allowed at constexpr time.
13721385
// we get around this by deleting and creating a new node value
13731386
__lhs.~foo_type();
1374-
new (std::addressof(__lhs))(foo_type) (tmp);
1387+
new (std::addressof(__lhs))(foo_type)(tmp);
13751388
// __lhs = std::move(tmp);
13761389
} else {
13771390
// This is technically UB, since the object was constructed as `const`.
@@ -2301,8 +2314,8 @@ __tree<_Tp, _Compare, _Allocator>::__count_multi(const _Key& __k) const {
23012314

23022315
template <class _Tp, class _Compare, class _Allocator>
23032316
template <class _Key>
2304-
typename __tree<_Tp, _Compare, _Allocator>::iterator
2305-
_LIBCPP_CONSTEXPR_SINCE_CXX26 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v, __node_pointer __root, __end_node_pointer __result) {
2317+
typename __tree<_Tp, _Compare, _Allocator>::iterator _LIBCPP_CONSTEXPR_SINCE_CXX26
2318+
__tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v, __node_pointer __root, __end_node_pointer __result) {
23062319
while (__root != nullptr) {
23072320
if (!value_comp()(__root->__value_, __v)) {
23082321
__result = static_cast<__end_node_pointer>(__root);
@@ -2315,7 +2328,8 @@ _LIBCPP_CONSTEXPR_SINCE_CXX26 __tree<_Tp, _Compare, _Allocator>::__lower_bound(c
23152328

23162329
template <class _Tp, class _Compare, class _Allocator>
23172330
template <class _Key>
2318-
_LIBCPP_CONSTEXPR_SINCE_CXX26 typename __tree<_Tp, _Compare, _Allocator>::const_iterator __tree<_Tp, _Compare, _Allocator>::__lower_bound(
2331+
_LIBCPP_CONSTEXPR_SINCE_CXX26 typename __tree<_Tp, _Compare, _Allocator>::const_iterator
2332+
__tree<_Tp, _Compare, _Allocator>::__lower_bound(
23192333
const _Key& __v, __node_pointer __root, __end_node_pointer __result) const {
23202334
while (__root != nullptr) {
23212335
if (!value_comp()(__root->__value_, __v)) {
@@ -2343,7 +2357,8 @@ __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v, __node_pointer
23432357

23442358
template <class _Tp, class _Compare, class _Allocator>
23452359
template <class _Key>
2346-
_LIBCPP_CONSTEXPR_SINCE_CXX26 typename __tree<_Tp, _Compare, _Allocator>::const_iterator __tree<_Tp, _Compare, _Allocator>::__upper_bound(
2360+
_LIBCPP_CONSTEXPR_SINCE_CXX26 typename __tree<_Tp, _Compare, _Allocator>::const_iterator
2361+
__tree<_Tp, _Compare, _Allocator>::__upper_bound(
23472362
const _Key& __v, __node_pointer __root, __end_node_pointer __result) const {
23482363
while (__root != nullptr) {
23492364
if (value_comp()(__v, __root->__value_)) {

‎libcxx/include/map‎

Lines changed: 15 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -686,9 +686,15 @@ public:
686686
: __comp_(__c) {}
687687
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const _Compare& key_comp() const _NOEXCEPT { return __comp_; }
688688

689-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 bool operator()(const _CP& __x, const _CP& __y) const { return __comp_(__x.first, __y.first); }
690-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 bool operator()(const _CP& __x, const _Key& __y) const { return __comp_(__x.first, __y); }
691-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 bool operator()(const _Key& __x, const _CP& __y) const { return __comp_(__x, __y.first); }
689+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 bool operator()(const _CP& __x, const _CP& __y) const {
690+
return __comp_(__x.first, __y.first);
691+
}
692+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 bool operator()(const _CP& __x, const _Key& __y) const {
693+
return __comp_(__x.first, __y);
694+
}
695+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 bool operator()(const _Key& __x, const _CP& __y) const {
696+
return __comp_(__x, __y.first);
697+
}
692698
_LIBCPP_CONSTEXPR_SINCE_CXX26 void swap(__map_value_compare& __y) _NOEXCEPT_(__is_nothrow_swappable_v<_Compare>) {
693699
using std::swap;
694700
swap(__comp_, __y.__comp_);
@@ -777,7 +783,9 @@ public:
777783
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __map_iterator(_TreeIterator __i) _NOEXCEPT : __i_(__i) {}
778784

779785
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 reference operator*() const { return *__i_; }
780-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 pointer operator->() const { return pointer_traits<pointer>::pointer_to(*__i_); }
786+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 pointer operator->() const {
787+
return pointer_traits<pointer>::pointer_to(*__i_);
788+
}
781789

782790
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __map_iterator& operator++() {
783791
++__i_;
@@ -837,7 +845,9 @@ public:
837845
__map_const_iterator(__map_iterator< typename _TreeIterator::__non_const_iterator> __i) _NOEXCEPT : __i_(__i.__i_) {}
838846

839847
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 reference operator*() const { return *__i_; }
840-
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 pointer operator->() const { return pointer_traits<pointer>::pointer_to(*__i_); }
848+
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 pointer operator->() const {
849+
return pointer_traits<pointer>::pointer_to(*__i_);
850+
}
841851

842852
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __map_const_iterator& operator++() {
843853
++__i_;

‎libcxx/test/std/containers/associative/map/map.cons/copy_assign.pass.cpp‎

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -244,12 +244,11 @@ TEST_CONSTEXPR_CXX26 bool test() {
244244
assert(*std::next(mo.begin(), 2) == V(3, 1));
245245
}
246246

247-
248-
// Following code uses global vectors ca_allocs and ca_deallocs
249-
// Using globals/statics at compile time is not possible, so we exit early.
250-
#if TEST_STD_VER >= 26
247+
// Following code uses global vectors ca_allocs and ca_deallocs
248+
// Using globals/statics at compile time is not possible, so we exit early.
249+
# if TEST_STD_VER >= 26
251250
return true;
252-
#endif
251+
# endif
253252

254253
assert(balanced_allocs());
255254
{

‎libcxx/test/std/containers/associative/map/map.modifiers/emplace.pass.cpp‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -25,8 +25,7 @@
2525
#include "min_allocator.h"
2626

2727
TEST_CONSTEXPR_CXX26 bool test() {
28-
if(!TEST_IS_CONSTANT_EVALUATED)
29-
{
28+
if (!TEST_IS_CONSTANT_EVALUATED) {
3029
{
3130
typedef std::map<int, DefaultOnly> M;
3231
typedef std::pair<M::iterator, bool> R;
@@ -91,8 +90,7 @@ TEST_CONSTEXPR_CXX26 bool test() {
9190
assert(m.begin()->second == 3.5);
9291
}
9392

94-
if(!TEST_IS_CONSTANT_EVALUATED)
95-
{
93+
if (!TEST_IS_CONSTANT_EVALUATED) {
9694
{
9795
typedef std::map<int, DefaultOnly, std::less<int>, min_allocator<std::pair<const int, DefaultOnly>>> M;
9896
typedef std::pair<M::iterator, bool> R;

‎libcxx/test/std/containers/associative/map/map.modifiers/emplace_hint.pass.cpp‎

Lines changed: 2 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -24,9 +24,7 @@
2424
#include "min_allocator.h"
2525

2626
TEST_CONSTEXPR_CXX26 bool test() {
27-
28-
if(!TEST_IS_CONSTANT_EVALUATED)
29-
{
27+
if (!TEST_IS_CONSTANT_EVALUATED) {
3028
{
3129
typedef std::map<int, DefaultOnly> M;
3230
typedef M::iterator R;
@@ -85,8 +83,7 @@ TEST_CONSTEXPR_CXX26 bool test() {
8583
assert(m.begin()->second == 3.5);
8684
}
8785

88-
if(!TEST_IS_CONSTANT_EVALUATED)
89-
{
86+
if (!TEST_IS_CONSTANT_EVALUATED) {
9087
{
9188
typedef std::map<int, DefaultOnly, std::less<int>, min_allocator<std::pair<const int, DefaultOnly>>> M;
9289
typedef M::iterator R;

‎libcxx/test/std/language.support/support.limits/support.limits.general/map.version.compile.pass.cpp‎

Lines changed: 45 additions & 45 deletions
Original file line numberDiff line numberDiff line change
@@ -45,13 +45,13 @@
4545
# error "__cpp_lib_associative_heterogeneous_insertion should not be defined before c++26"
4646
# endif
4747

48-
# ifdef __cpp_lib_constexpr_map
49-
# error "__cpp_lib_constexpr_map should not be defined before c++26"
50-
# endif
48+
# ifdef __cpp_lib_constexpr_map
49+
# error "__cpp_lib_constexpr_map should not be defined before c++26"
50+
# endif
5151

52-
# ifdef __cpp_lib_containers_ranges
53-
# error "__cpp_lib_containers_ranges should not be defined before c++23"
54-
# endif
52+
# ifdef __cpp_lib_containers_ranges
53+
# error "__cpp_lib_containers_ranges should not be defined before c++23"
54+
# endif
5555

5656
# ifdef __cpp_lib_erase_if
5757
# error "__cpp_lib_erase_if should not be defined before c++20"
@@ -91,13 +91,13 @@
9191
# error "__cpp_lib_associative_heterogeneous_insertion should not be defined before c++26"
9292
# endif
9393

94-
# ifdef __cpp_lib_constexpr_map
95-
# error "__cpp_lib_constexpr_map should not be defined before c++26"
96-
# endif
94+
# ifdef __cpp_lib_constexpr_map
95+
# error "__cpp_lib_constexpr_map should not be defined before c++26"
96+
# endif
9797

98-
# ifdef __cpp_lib_containers_ranges
99-
# error "__cpp_lib_containers_ranges should not be defined before c++23"
100-
# endif
98+
# ifdef __cpp_lib_containers_ranges
99+
# error "__cpp_lib_containers_ranges should not be defined before c++23"
100+
# endif
101101

102102
# ifdef __cpp_lib_erase_if
103103
# error "__cpp_lib_erase_if should not be defined before c++20"
@@ -143,13 +143,13 @@
143143
# error "__cpp_lib_associative_heterogeneous_insertion should not be defined before c++26"
144144
# endif
145145

146-
# ifdef __cpp_lib_constexpr_map
147-
# error "__cpp_lib_constexpr_map should not be defined before c++26"
148-
# endif
146+
# ifdef __cpp_lib_constexpr_map
147+
# error "__cpp_lib_constexpr_map should not be defined before c++26"
148+
# endif
149149

150-
# ifdef __cpp_lib_containers_ranges
151-
# error "__cpp_lib_containers_ranges should not be defined before c++23"
152-
# endif
150+
# ifdef __cpp_lib_containers_ranges
151+
# error "__cpp_lib_containers_ranges should not be defined before c++23"
152+
# endif
153153

154154
# ifdef __cpp_lib_erase_if
155155
# error "__cpp_lib_erase_if should not be defined before c++20"
@@ -204,13 +204,13 @@
204204
# error "__cpp_lib_associative_heterogeneous_insertion should not be defined before c++26"
205205
# endif
206206

207-
# ifdef __cpp_lib_constexpr_map
208-
# error "__cpp_lib_constexpr_map should not be defined before c++26"
209-
# endif
207+
# ifdef __cpp_lib_constexpr_map
208+
# error "__cpp_lib_constexpr_map should not be defined before c++26"
209+
# endif
210210

211-
# ifdef __cpp_lib_containers_ranges
212-
# error "__cpp_lib_containers_ranges should not be defined before c++23"
213-
# endif
211+
# ifdef __cpp_lib_containers_ranges
212+
# error "__cpp_lib_containers_ranges should not be defined before c++23"
213+
# endif
214214

215215
# ifndef __cpp_lib_erase_if
216216
# error "__cpp_lib_erase_if should be defined in c++20"
@@ -277,16 +277,16 @@
277277
# error "__cpp_lib_associative_heterogeneous_insertion should not be defined before c++26"
278278
# endif
279279

280-
# ifdef __cpp_lib_constexpr_map
281-
# error "__cpp_lib_constexpr_map should not be defined before c++26"
282-
# endif
280+
# ifdef __cpp_lib_constexpr_map
281+
# error "__cpp_lib_constexpr_map should not be defined before c++26"
282+
# endif
283283

284-
# ifndef __cpp_lib_containers_ranges
285-
# error "__cpp_lib_containers_ranges should be defined in c++23"
286-
# endif
287-
# if __cpp_lib_containers_ranges != 202202L
288-
# error "__cpp_lib_containers_ranges should have the value 202202L in c++23"
289-
# endif
284+
# ifndef __cpp_lib_containers_ranges
285+
# error "__cpp_lib_containers_ranges should be defined in c++23"
286+
# endif
287+
# if __cpp_lib_containers_ranges != 202202L
288+
# error "__cpp_lib_containers_ranges should have the value 202202L in c++23"
289+
# endif
290290

291291
# ifndef __cpp_lib_erase_if
292292
# error "__cpp_lib_erase_if should be defined in c++23"
@@ -371,19 +371,19 @@
371371
# endif
372372
# endif
373373

374-
# ifndef __cpp_lib_constexpr_map
375-
# error "__cpp_lib_constexpr_map should be defined in c++26"
376-
# endif
377-
# if __cpp_lib_constexpr_map != 202502L
378-
# error "__cpp_lib_constexpr_map should have the value 202502L in c++26"
379-
# endif
374+
# ifndef __cpp_lib_constexpr_map
375+
# error "__cpp_lib_constexpr_map should be defined in c++26"
376+
# endif
377+
# if __cpp_lib_constexpr_map != 202502L
378+
# error "__cpp_lib_constexpr_map should have the value 202502L in c++26"
379+
# endif
380380

381-
# ifndef __cpp_lib_containers_ranges
382-
# error "__cpp_lib_containers_ranges should be defined in c++26"
383-
# endif
384-
# if __cpp_lib_containers_ranges != 202202L
385-
# error "__cpp_lib_containers_ranges should have the value 202202L in c++26"
386-
# endif
381+
# ifndef __cpp_lib_containers_ranges
382+
# error "__cpp_lib_containers_ranges should be defined in c++26"
383+
# endif
384+
# if __cpp_lib_containers_ranges != 202202L
385+
# error "__cpp_lib_containers_ranges should have the value 202202L in c++26"
386+
# endif
387387

388388
# ifndef __cpp_lib_erase_if
389389
# error "__cpp_lib_erase_if should be defined in c++26"

0 commit comments

Comments
 (0)