[libcxx-commits] [libcxx] [libc++][NFC] Run the container tests through clang-format (PR #126499)

via libcxx-commits libcxx-commits at lists.llvm.org
Mon Feb 10 02:18:20 PST 2025


llvmbot wrote:


<!--LLVM PR SUMMARY COMMENT-->

@llvm/pr-subscribers-libcxx

Author: Louis Dionne (ldionne)

<details>
<summary>Changes</summary>

We've been improving these the tests for vector quite a bit and we are probably not done improving our container tests. Formatting everything at once will make subsequent reviews easier.

---

Patch is 5.37 MiB, truncated to 20.00 KiB below, full version: https://github.com/llvm/llvm-project/pull/126499.diff


1364 Files Affected:

- (modified) libcxx/test/libcxx/containers/associative/map/at.abort.pass.cpp (+5-8) 
- (modified) libcxx/test/libcxx/containers/associative/map/at.const.abort.pass.cpp (+5-8) 
- (modified) libcxx/test/libcxx/containers/associative/map/find.modules.compile.pass.mm (+1-3) 
- (modified) libcxx/test/libcxx/containers/associative/non_const_comparator.incomplete.verify.cpp (+12-10) 
- (modified) libcxx/test/libcxx/containers/associative/tree_balance_after_insert.pass.cpp (+1334-1346) 
- (modified) libcxx/test/libcxx/containers/associative/tree_key_value_traits.pass.cpp (+2-4) 
- (modified) libcxx/test/libcxx/containers/associative/tree_left_rotate.pass.cpp (+67-73) 
- (modified) libcxx/test/libcxx/containers/associative/tree_remove.pass.cpp (+1325-1335) 
- (modified) libcxx/test/libcxx/containers/associative/tree_right_rotate.pass.cpp (+67-73) 
- (modified) libcxx/test/libcxx/containers/gnu_cxx/hash_map_name_lookup.pass.cpp (-1) 
- (modified) libcxx/test/libcxx/containers/sequences/array/triviality.pass.cpp (+25-28) 
- (modified) libcxx/test/libcxx/containers/sequences/deque/asan.pass.cpp (+41-44) 
- (modified) libcxx/test/libcxx/containers/sequences/deque/assert.pop_back.empty.pass.cpp (+5-5) 
- (modified) libcxx/test/libcxx/containers/sequences/deque/incomplete.pass.cpp (+2-3) 
- (modified) libcxx/test/libcxx/containers/sequences/deque/segmented_iterator.compile.pass.cpp (-1) 
- (modified) libcxx/test/libcxx/containers/sequences/deque/spare_block_handling.pass.cpp (+16-12) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.cons/debug.copy.pass.cpp (+8-6) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/assert.erase_iter.end.pass.cpp (+5-5) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/assert.pop_back.empty.pass.cpp (+10-10) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/debug.emplace.pass.cpp (+5-5) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/debug.erase.iter.pass.cpp (+6-6) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/debug.erase.iter_iter.pass.cpp (+36-36) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/debug.insert.iter_iter_iter.pass.cpp (+6-6) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/debug.insert.iter_rvalue.pass.cpp (+5-5) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/debug.insert.iter_size_value.pass.cpp (+5-5) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.modifiers/debug.insert.iter_value.pass.cpp (+6-6) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.ops/debug.splice.pos_list.pass.cpp (+2-2) 
- (modified) libcxx/test/libcxx/containers/sequences/list/list.ops/debug.splice.pos_list_iter.pass.cpp (+5-5) 
- (modified) libcxx/test/libcxx/containers/sequences/vector.bool/trivial_for_purposes_of_call.pass.cpp (+6-6) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/asan.pass.cpp (+2-5) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/asan_throw.pass.cpp (+11-14) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/asan_turning_off.pass.cpp (+3-3) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/assert.pop_back.empty.pass.cpp (+5-5) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/erase.modules.compile.pass.mm (+1-3) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/exception_safety_exceptions_disabled.pass.cpp (+1-1) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/invalid_allocator.verify.cpp (+4-3) 
- (modified) libcxx/test/libcxx/containers/sequences/vector/robust_against_adl.pass.cpp (+28-25) 
- (modified) libcxx/test/libcxx/containers/unord/key_value_traits.pass.cpp (+2-4) 
- (modified) libcxx/test/libcxx/containers/unord/next_pow2.pass.cpp (+38-51) 
- (modified) libcxx/test/libcxx/containers/unord/next_prime.pass.cpp (+20-26) 
- (modified) libcxx/test/libcxx/containers/unord/non_const_comparator.incomplete.verify.cpp (+12-11) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/assert.bucket.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/assert.bucket_size.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/assert.max_load_factor.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/at.abort.pass.cpp (+4-5) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/at.const.abort.pass.cpp (+4-5) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/debug.insert.hint_const_lvalue.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/debug.insert.hint_rvalue.pass.cpp (+9-9) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/debug.swap.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/unord.map.modifiers/debug.erase.iter.pass.cpp (+22-22) 
- (modified) libcxx/test/libcxx/containers/unord/unord.map/unord.map.modifiers/debug.erase.iter_iter.pass.cpp (+39-39) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/assert.bucket.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/assert.bucket_size.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/assert.max_load_factor.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/debug.insert.hint_const_lvalue.pass.cpp (+10-10) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/debug.insert.hint_rvalue.pass.cpp (+9-9) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/debug.swap.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/unord.multimap.modifiers/debug.erase.iter.pass.cpp (+22-22) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multimap/unord.multimap.modifiers/debug.erase.iter_iter.pass.cpp (+39-39) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multiset/assert.bucket.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multiset/assert.bucket_size.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multiset/assert.max_load_factor.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multiset/debug.erase.iter.pass.cpp (+20-20) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multiset/debug.erase.iter_iter.pass.cpp (+39-39) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multiset/debug.insert.hint_const_lvalue.pass.cpp (+10-10) 
- (modified) libcxx/test/libcxx/containers/unord/unord.multiset/debug.swap.pass.cpp (+12-12) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/assert.bucket.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/assert.bucket_size.pass.cpp (+4-4) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/assert.max_load_factor.pass.cpp (+4-5) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/debug.erase.iter.pass.cpp (+20-20) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/debug.erase.iter_iter.pass.cpp (+39-39) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/debug.insert.hint_const_lvalue.pass.cpp (+10-10) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/debug.swap.pass.cpp (+12-12) 
- (modified) libcxx/test/libcxx/containers/unord/unord.set/missing_hash_specialization.verify.cpp (+9-9) 
- (modified) libcxx/test/libcxx/containers/views/mdspan/extents/assert.ctor_from_array.pass.cpp (+2-5) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.cons/assert.iter_sent.pass.cpp (+27-17) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.cons/assert.other_span.pass.cpp (+8-5) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.cons/assert.range.pass.cpp (+10-4) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.elem/assert.back.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.elem/assert.front.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.elem/assert.op_idx.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.sub/assert.first.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.sub/assert.last.pass.cpp (+13-13) 
- (modified) libcxx/test/libcxx/containers/views/views.span/span.sub/assert.subspan.pass.cpp (+26-26) 
- (modified) libcxx/test/std/containers/Copyable.h (+1-2) 
- (modified) libcxx/test/std/containers/Emplaceable.h (+24-22) 
- (modified) libcxx/test/std/containers/NotConstructible.h (+5-8) 
- (modified) libcxx/test/std/containers/associative/from_range_associative_containers.h (+24-40) 
- (modified) libcxx/test/std/containers/associative/iterator_types.pass.cpp (+1-5) 
- (modified) libcxx/test/std/containers/associative/map/PR28469_undefined_behavior_segfault.sh.cpp (+4-4) 
- (modified) libcxx/test/std/containers/associative/map/allocator_mismatch.verify.cpp (+1-1) 
- (modified) libcxx/test/std/containers/associative/map/compare.pass.cpp (+26-26) 
- (modified) libcxx/test/std/containers/associative/map/get_allocator.pass.cpp (+12-13) 
- (modified) libcxx/test/std/containers/associative/map/incomplete_type.pass.cpp (+7-7) 
- (modified) libcxx/test/std/containers/associative/map/iterator_concept_conformance.compile.pass.cpp (+6-6) 
- (modified) libcxx/test/std/containers/associative/map/map.access/at.pass.cpp (+115-132) 
- (modified) libcxx/test/std/containers/associative/map/map.access/empty.pass.cpp (+5-6) 
- (modified) libcxx/test/std/containers/associative/map/map.access/empty.verify.cpp (+2-2) 
- (modified) libcxx/test/std/containers/associative/map/map.access/index_key.pass.cpp (+45-49) 
- (modified) libcxx/test/std/containers/associative/map/map.access/index_rv_key.pass.cpp (+25-26) 
- (modified) libcxx/test/std/containers/associative/map/map.access/index_tuple.pass.cpp (+3-3) 
- (modified) libcxx/test/std/containers/associative/map/map.access/iterator.pass.cpp (+114-219) 
- (modified) libcxx/test/std/containers/associative/map/map.access/max_size.pass.cpp (+3-6) 
- (modified) libcxx/test/std/containers/associative/map/map.access/size.pass.cpp (+5-6) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/alloc.pass.cpp (+7-8) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/assign_initializer_list.pass.cpp (+12-38) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/compare.pass.cpp (+5-6) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/compare_alloc.pass.cpp (+7-8) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/compare_copy_constructible.compile.fail.cpp (+6-6) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/copy.pass.cpp (+97-101) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/copy_alloc.pass.cpp (+13-17) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/copy_assign.pass.cpp (+230-281) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/deduct.pass.cpp (+73-73) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/deduct.verify.cpp (+66-65) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/deduct_const.pass.cpp (+33-33) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/default.pass.cpp (+18-19) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/default_noexcept.pass.cpp (+22-24) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/dtor_noexcept.pass.cpp (+22-24) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/from_range.pass.cpp (+3-7) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/initializer_list.pass.cpp (+8-30) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/initializer_list_compare.pass.cpp (+8-28) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/initializer_list_compare_alloc.pass.cpp (+16-53) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/iter_iter.pass.cpp (+10-12) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/iter_iter_comp.pass.cpp (+9-12) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/iter_iter_comp_alloc.pass.cpp (+34-38) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/move.pass.cpp (+88-91) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/move_alloc.pass.cpp (+119-241) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/move_assign.pass.cpp (+73-162) 
- (modified) libcxx/test/std/containers/associative/map/map.cons/move_noexcept.pass.cpp (+22-24) 
- (modified) libcxx/test/std/containers/associative/map/map.erasure/erase_if.pass.cpp (+30-33) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/clear.pass.cpp (+39-42) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/emplace.pass.cpp (+123-134) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/emplace_hint.pass.cpp (+109-130) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/erase_iter.pass.cpp (+210-214) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/erase_iter_iter.pass.cpp (+125-128) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/erase_key.pass.cpp (+233-236) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/extract_iterator.pass.cpp (+36-42) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/extract_key.pass.cpp (+37-44) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_and_emplace_allocator_requirements.pass.cpp (+1-2) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_cv.pass.cpp (+39-41) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_initializer_list.pass.cpp (+15-32) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_iter_cv.pass.cpp (+35-37) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_iter_iter.pass.cpp (+49-52) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_iter_rv.pass.cpp (+48-51) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_node_type.pass.cpp (+53-59) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_node_type_hint.pass.cpp (+30-36) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_or_assign.pass.cpp (+249-251) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_range.pass.cpp (+1-1) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/insert_rv.pass.cpp (+53-55) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/merge.pass.cpp (+83-94) 
- (modified) libcxx/test/std/containers/associative/map/map.modifiers/try.emplace.pass.cpp (+142-145) 
- (modified) libcxx/test/std/containers/associative/map/map.nonmember/op_compare.pass.cpp (+39-39) 
- (modified) libcxx/test/std/containers/associative/map/map.observers/key_comp.pass.cpp (+8-8) 
- (modified) libcxx/test/std/containers/associative/map/map.observers/value_comp.pass.cpp (+8-8) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/contains.pass.cpp (+36-37) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/contains_transparent.pass.cpp (+5-12) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/count0.pass.cpp (+5-7) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/count1.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/count2.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/count3.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/count_transparent.pass.cpp (+6-14) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/equal_range.pass.cpp (+235-286) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/equal_range0.pass.cpp (+5-7) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/equal_range1.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/equal_range2.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/equal_range3.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/equal_range_transparent.pass.cpp (+5-13) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/find.pass.cpp (+103-154) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/find0.pass.cpp (+5-7) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/find1.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/find2.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/find3.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/lower_bound.pass.cpp (+168-219) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/lower_bound0.pass.cpp (+5-7) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/lower_bound1.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/lower_bound2.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/lower_bound3.compile.fail.cpp (+3-4) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/upper_bound.pass.cpp (+167-218) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/upper_bound0.pass.cpp (+5-7) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/upper_bound1.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/upper_bound2.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.ops/upper_bound3.compile.fail.cpp (+3-5) 
- (modified) libcxx/test/std/containers/associative/map/map.special/member_swap.pass.cpp (+70-135) 
- (modified) libcxx/test/std/containers/associative/map/map.special/non_member_swap.pass.cpp (+124-237) 
- (modified) libcxx/test/std/containers/associative/map/map.special/swap_noexcept.pass.cpp (+66-73) 
- (modified) libcxx/test/std/containers/associative/map/map.value_compare/invoke.pass.cpp (+16-16) 
- (modified) libcxx/test/std/containers/associative/map/map.value_compare/types.pass.cpp (+7-7) 
- (modified) libcxx/test/std/containers/associative/map/range_concept_conformance.compile.pass.cpp (-1) 
- (modified) libcxx/test/std/containers/associative/map/types.pass.cpp (+6-7) 
- (modified) libcxx/test/std/containers/associative/multimap/allocator_mismatch.verify.cpp (+1-1) 
- (modified) libcxx/test/std/containers/associative/multimap/empty.pass.cpp (+5-6) 
- (modified) libcxx/test/std/containers/associative/multimap/empty.verify.cpp (+2-2) 
- (modified) libcxx/test/std/containers/associative/multimap/get_allocator.pass.cpp (+12-13) 
- (modified) libcxx/test/std/containers/associative/multimap/incomplete_type.pass.cpp (+7-7) 
- (modified) libcxx/test/std/containers/associative/multimap/iterator.pass.cpp (+126-231) 
- (modified) libcxx/test/std/containers/associative/multimap/iterator_concept_conformance.compile.pass.cpp (+6-6) 
- (modified) libcxx/test/std/containers/associative/multimap/max_size.pass.cpp (+3-6) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/alloc.pass.cpp (+7-8) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/assign_initializer_list.pass.cpp (+7-30) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/compare.pass.cpp (+5-6) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/compare_alloc.pass.cpp (+7-8) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/compare_copy_constructible.compile.fail.cpp (+6-6) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/copy.pass.cpp (+70-74) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/copy_alloc.pass.cpp (+13-17) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/copy_assign.pass.cpp (+92-97) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/deduct.pass.cpp (+73-73) 
- (modified) libcxx/test/std/containers/associative/multimap/multimap.cons/deduct.verify.cpp (+66-65) 


``````````diff
diff --git a/libcxx/test/libcxx/containers/associative/map/at.abort.pass.cpp b/libcxx/test/libcxx/containers/associative/map/at.abort.pass.cpp
index 36aa644abb596d1..d68ee5f5285991b 100644
--- a/libcxx/test/libcxx/containers/associative/map/at.abort.pass.cpp
+++ b/libcxx/test/libcxx/containers/associative/map/at.abort.pass.cpp
@@ -23,14 +23,11 @@
 
 #include "test_macros.h"
 
-
-void exit_success(int) {
-    std::_Exit(EXIT_SUCCESS);
-}
+void exit_success(int) { std::_Exit(EXIT_SUCCESS); }
 
 int main(int, char**) {
-    std::signal(SIGABRT, exit_success);
-    std::map<int, int> map;
-    map.at(1);
-    return EXIT_FAILURE;
+  std::signal(SIGABRT, exit_success);
+  std::map<int, int> map;
+  map.at(1);
+  return EXIT_FAILURE;
 }
diff --git a/libcxx/test/libcxx/containers/associative/map/at.const.abort.pass.cpp b/libcxx/test/libcxx/containers/associative/map/at.const.abort.pass.cpp
index f3dcca888f2b0d7..bbc8c7c4d726ac6 100644
--- a/libcxx/test/libcxx/containers/associative/map/at.const.abort.pass.cpp
+++ b/libcxx/test/libcxx/containers/associative/map/at.const.abort.pass.cpp
@@ -23,14 +23,11 @@
 
 #include "test_macros.h"
 
-
-void exit_success(int) {
-    std::_Exit(EXIT_SUCCESS);
-}
+void exit_success(int) { std::_Exit(EXIT_SUCCESS); }
 
 int main(int, char**) {
-    std::signal(SIGABRT, exit_success);
-    std::map<int, int> const map;
-    map.at(1);
-    return EXIT_FAILURE;
+  std::signal(SIGABRT, exit_success);
+  std::map<int, int> const map;
+  map.at(1);
+  return EXIT_FAILURE;
 }
diff --git a/libcxx/test/libcxx/containers/associative/map/find.modules.compile.pass.mm b/libcxx/test/libcxx/containers/associative/map/find.modules.compile.pass.mm
index 8b2f0057bcbc169..82b1c494c95666d 100644
--- a/libcxx/test/libcxx/containers/associative/map/find.modules.compile.pass.mm
+++ b/libcxx/test/libcxx/containers/associative/map/find.modules.compile.pass.mm
@@ -13,6 +13,4 @@
 
 #include <map>
 
-void f(std::map<int, int> const& map, int key) {
-    (void)map.find(key);
-}
+void f(std::map<int, int> const& map, int key) { (void)map.find(key); }
diff --git a/libcxx/test/libcxx/containers/associative/non_const_comparator.incomplete.verify.cpp b/libcxx/test/libcxx/containers/associative/non_const_comparator.incomplete.verify.cpp
index 3f7086f7e37f340..bae78ba4b78c68c 100644
--- a/libcxx/test/libcxx/containers/associative/non_const_comparator.incomplete.verify.cpp
+++ b/libcxx/test/libcxx/containers/associative/non_const_comparator.incomplete.verify.cpp
@@ -17,31 +17,33 @@
 #include <map>
 #include <functional>
 
-template <template <typename ...> class Container>
+template <template <typename...> class Container>
 void test_set() {
-  struct KeyBase { };
-  struct KeyDerived;  // derives from KeyBase, but incomplete at this point
+  struct KeyBase {};
+  struct KeyDerived; // derives from KeyBase, but incomplete at this point
 
   // Name the type but don't instantiate it.
   using C = Container<KeyDerived*, std::less<KeyBase*>>;
 
   // Instantiate it but don't ODR use any members.
-  typename C::value_type dummy; (void)dummy;
+  typename C::value_type dummy;
+  (void)dummy;
 
   // Complete the types.
-  struct KeyDerived : KeyBase { };
+  struct KeyDerived : KeyBase {};
 
   C c; // ODR use it, which should be OK
 }
 
-template <template <typename ...> class Container>
+template <template <typename...> class Container>
 void test_map() {
-  struct Value { };
-  struct KeyBase { };
+  struct Value {};
+  struct KeyBase {};
   struct KeyDerived;
   using C = Container<KeyDerived*, Value, std::less<KeyBase*>>;
-  typename C::value_type dummy; (void)dummy;
-  struct KeyDerived : KeyBase { };
+  typename C::value_type dummy;
+  (void)dummy;
+  struct KeyDerived : KeyBase {};
   C c;
 }
 
diff --git a/libcxx/test/libcxx/containers/associative/tree_balance_after_insert.pass.cpp b/libcxx/test/libcxx/containers/associative/tree_balance_after_insert.pass.cpp
index a99f4fff1300e00..ccd84af44c3a5f2 100644
--- a/libcxx/test/libcxx/containers/associative/tree_balance_after_insert.pass.cpp
+++ b/libcxx/test/libcxx/containers/associative/tree_balance_after_insert.pass.cpp
@@ -20,1021 +20,315 @@
 
 #include "test_macros.h"
 
-struct Node
-{
-    Node* __left_;
-    Node* __right_;
-    Node* __parent_;
-    bool __is_black_;
+struct Node {
+  Node* __left_;
+  Node* __right_;
+  Node* __parent_;
+  bool __is_black_;
 
-    Node* __parent_unsafe() const { return __parent_; }
-    void __set_parent(Node* x) { __parent_ = x;}
+  Node* __parent_unsafe() const { return __parent_; }
+  void __set_parent(Node* x) { __parent_ = x; }
 
-    Node() : __left_(), __right_(), __parent_(), __is_black_() {}
+  Node() : __left_(), __right_(), __parent_(), __is_black_() {}
 };
 
-void
-test1()
-{
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = &a;
-        b.__right_ = 0;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = 0;
-        d.__right_ = 0;
-        d.__is_black_ = false;
-
-        a.__parent_ = &b;
-        a.__left_ = 0;
-        a.__right_ = 0;
-        a.__is_black_ = false;
-
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == &a);
-        assert(b.__right_ == 0);
-        assert(b.__is_black_ == true);
-
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == 0);
-        assert(d.__right_ == 0);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &b);
-        assert(a.__left_ == 0);
-        assert(a.__right_ == 0);
-        assert(a.__is_black_ == false);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = 0;
-        b.__right_ = &a;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = 0;
-        d.__right_ = 0;
-        d.__is_black_ = false;
-
-        a.__parent_ = &b;
-        a.__left_ = 0;
-        a.__right_ = 0;
-        a.__is_black_ = false;
-
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == 0);
-        assert(b.__right_ == &a);
-        assert(b.__is_black_ == true);
-
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == 0);
-        assert(d.__right_ == 0);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &b);
-        assert(a.__left_ == 0);
-        assert(a.__right_ == 0);
-        assert(a.__is_black_ == false);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = 0;
-        b.__right_ = 0;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = &a;
-        d.__right_ = 0;
-        d.__is_black_ = false;
-
-        a.__parent_ = &d;
-        a.__left_ = 0;
-        a.__right_ = 0;
-        a.__is_black_ = false;
-
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == 0);
-        assert(b.__right_ == 0);
-        assert(b.__is_black_ == true);
-
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == &a);
-        assert(d.__right_ == 0);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &d);
-        assert(a.__left_ == 0);
-        assert(a.__right_ == 0);
-        assert(a.__is_black_ == false);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = 0;
-        b.__right_ = 0;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = 0;
-        d.__right_ = &a;
-        d.__is_black_ = false;
-
-        a.__parent_ = &d;
-        a.__left_ = 0;
-        a.__right_ = 0;
-        a.__is_black_ = false;
-
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == 0);
-        assert(b.__right_ == 0);
-        assert(b.__is_black_ == true);
-
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == 0);
-        assert(d.__right_ == &a);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &d);
-        assert(a.__left_ == 0);
-        assert(a.__right_ == 0);
-        assert(a.__is_black_ == false);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-        Node e;
-        Node f;
-        Node g;
-        Node h;
-        Node i;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = &a;
-        b.__right_ = &g;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = &h;
-        d.__right_ = &i;
-        d.__is_black_ = false;
-
-        a.__parent_ = &b;
-        a.__left_ = &e;
-        a.__right_ = &f;
-        a.__is_black_ = false;
-
-        e.__parent_ = &a;
-        e.__is_black_ = true;
-
-        f.__parent_ = &a;
-        f.__is_black_ = true;
-
-        g.__parent_ = &b;
-        g.__is_black_ = true;
-
-        h.__parent_ = &d;
-        h.__is_black_ = true;
-
-        i.__parent_ = &d;
-        i.__is_black_ = true;
-
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == &a);
-        assert(b.__right_ == &g);
-        assert(b.__is_black_ == true);
-
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == &h);
-        assert(d.__right_ == &i);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &b);
-        assert(a.__left_ == &e);
-        assert(a.__right_ == &f);
-        assert(a.__is_black_ == false);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-        Node e;
-        Node f;
-        Node g;
-        Node h;
-        Node i;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = &g;
-        b.__right_ = &a;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = &h;
-        d.__right_ = &i;
-        d.__is_black_ = false;
-
-        a.__parent_ = &b;
-        a.__left_ = &e;
-        a.__right_ = &f;
-        a.__is_black_ = false;
-
-        e.__parent_ = &a;
-        e.__is_black_ = true;
-
-        f.__parent_ = &a;
-        f.__is_black_ = true;
-
-        g.__parent_ = &b;
-        g.__is_black_ = true;
-
-        h.__parent_ = &d;
-        h.__is_black_ = true;
-
-        i.__parent_ = &d;
-        i.__is_black_ = true;
-
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == &g);
-        assert(b.__right_ == &a);
-        assert(b.__is_black_ == true);
-
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == &h);
-        assert(d.__right_ == &i);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &b);
-        assert(a.__left_ == &e);
-        assert(a.__right_ == &f);
-        assert(a.__is_black_ == false);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-        Node e;
-        Node f;
-        Node g;
-        Node h;
-        Node i;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = &g;
-        b.__right_ = &h;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = &a;
-        d.__right_ = &i;
-        d.__is_black_ = false;
-
-        a.__parent_ = &d;
-        a.__left_ = &e;
-        a.__right_ = &f;
-        a.__is_black_ = false;
-
-        e.__parent_ = &a;
-        e.__is_black_ = true;
-
-        f.__parent_ = &a;
-        f.__is_black_ = true;
-
-        g.__parent_ = &b;
-        g.__is_black_ = true;
-
-        h.__parent_ = &b;
-        h.__is_black_ = true;
-
-        i.__parent_ = &d;
-        i.__is_black_ = true;
-
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == &g);
-        assert(b.__right_ == &h);
-        assert(b.__is_black_ == true);
-
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == &a);
-        assert(d.__right_ == &i);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &d);
-        assert(a.__left_ == &e);
-        assert(a.__right_ == &f);
-        assert(a.__is_black_ == false);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-        Node e;
-        Node f;
-        Node g;
-        Node h;
-        Node i;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &b;
-        c.__right_ = &d;
-        c.__is_black_ = true;
-
-        b.__parent_ = &c;
-        b.__left_ = &g;
-        b.__right_ = &h;
-        b.__is_black_ = false;
-
-        d.__parent_ = &c;
-        d.__left_ = &i;
-        d.__right_ = &a;
-        d.__is_black_ = false;
-
-        a.__parent_ = &d;
-        a.__left_ = &e;
-        a.__right_ = &f;
-        a.__is_black_ = false;
-
-        e.__parent_ = &a;
-        e.__is_black_ = true;
+void test1() {
+  {
+    Node root;
+    Node a;
+    Node b;
+    Node c;
+    Node d;
 
-        f.__parent_ = &a;
-        f.__is_black_ = true;
-
-        g.__parent_ = &b;
-        g.__is_black_ = true;
-
-        h.__parent_ = &b;
-        h.__is_black_ = true;
-
-        i.__parent_ = &d;
-        i.__is_black_ = true;
+    root.__left_ = &c;
 
-        std::__tree_balance_after_insert(root.__left_, &a);
-
-        assert(std::__tree_invariant(root.__left_));
+    c.__parent_   = &root;
+    c.__left_     = &b;
+    c.__right_    = &d;
+    c.__is_black_ = true;
 
-        assert(root.__left_ == &c);
-
-        assert(c.__parent_ == &root);
-        assert(c.__left_ == &b);
-        assert(c.__right_ == &d);
-        assert(c.__is_black_ == true);
-
-        assert(b.__parent_ == &c);
-        assert(b.__left_ == &g);
-        assert(b.__right_ == &h);
-        assert(b.__is_black_ == true);
+    b.__parent_   = &c;
+    b.__left_     = &a;
+    b.__right_    = 0;
+    b.__is_black_ = false;
 
-        assert(d.__parent_ == &c);
-        assert(d.__left_ == &i);
-        assert(d.__right_ == &a);
-        assert(d.__is_black_ == true);
-
-        assert(a.__parent_ == &d);
-        assert(a.__left_ == &e);
-        assert(a.__right_ == &f);
-        assert(a.__is_black_ == false);
-    }
-}
+    d.__parent_   = &c;
+    d.__left_     = 0;
+    d.__right_    = 0;
+    d.__is_black_ = false;
 
-void
-test2()
-{
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &a;
-        c.__right_ = 0;
-        c.__is_black_ = true;
-
-        a.__parent_ = &c;
-        a.__left_ = 0;
-        a.__right_ = &b;
-        a.__is_black_ = false;
-
-        b.__parent_ = &a;
-        b.__left_ = 0;
-        b.__right_ = 0;
-        b.__is_black_ = false;
-
-        std::__tree_balance_after_insert(root.__left_, &b);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &b);
-
-        assert(c.__parent_ == &b);
-        assert(c.__left_ == 0);
-        assert(c.__right_ == 0);
-        assert(c.__is_black_ == false);
-
-        assert(a.__parent_ == &b);
-        assert(a.__left_ == 0);
-        assert(a.__right_ == 0);
-        assert(a.__is_black_ == false);
-
-        assert(b.__parent_ == &root);
-        assert(b.__left_ == &a);
-        assert(b.__right_ == &c);
-        assert(b.__is_black_ == true);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-
-        root.__left_ = &a;
-
-        a.__parent_ = &root;
-        a.__left_ = 0;
-        a.__right_ = &c;
-        a.__is_black_ = true;
-
-        c.__parent_ = &a;
-        c.__left_ = &b;
-        c.__right_ = 0;
-        c.__is_black_ = false;
-
-        b.__parent_ = &c;
-        b.__left_ = 0;
-        b.__right_ = 0;
-        b.__is_black_ = false;
-
-        std::__tree_balance_after_insert(root.__left_, &b);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &b);
-
-        assert(a.__parent_ == &b);
-        assert(a.__left_ == 0);
-        assert(a.__right_ == 0);
-        assert(a.__is_black_ == false);
-
-        assert(c.__parent_ == &b);
-        assert(c.__left_ == 0);
-        assert(c.__right_ == 0);
-        assert(c.__is_black_ == false);
-
-        assert(b.__parent_ == &root);
-        assert(b.__left_ == &a);
-        assert(b.__right_ == &c);
-        assert(b.__is_black_ == true);
-    }
-    {
-        Node root;
-        Node a;
-        Node b;
-        Node c;
-        Node d;
-        Node e;
-        Node f;
-        Node g;
-
-        root.__left_ = &c;
-
-        c.__parent_ = &root;
-        c.__left_ = &a;
-        c.__right_ = &g;
-        c.__is_black_ = true;
+    a.__parent_   = &b;
+    a.__left_     = 0;
+    a.__right_    = 0;
+    a.__is_black_ = false;
 
-        a.__parent_ = &c;
-        a.__left_ = &d;
-        a.__right_ = &b;
-        a.__is_black_ = false;
-
-        b.__parent_ = &a;
-        b.__left_ = &e;
-        b.__right_ = &f;
-        b.__is_black_ = false;
-
-        d.__parent_ = &a;
-        d.__is_black_ = true;
-
-        e.__parent_ = &b;
-        e.__is_black_ = true;
-
-        f.__parent_ = &b;
-        f.__is_black_ = true;
-
-        g.__parent_ = &c;
-        g.__is_black_ = true;
-
-        std::__tree_balance_after_insert(root.__left_, &b);
-
-        assert(std::__tree_invariant(root.__left_));
-
-        assert(root.__left_ == &b);
-
-        assert...
[truncated]

``````````

</details>


https://github.com/llvm/llvm-project/pull/126499


More information about the libcxx-commits mailing list