File: non_member_swap.pass.cpp

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.7-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,245,064 kB
  • sloc: cpp: 7,619,731; ansic: 1,434,018; asm: 1,058,748; python: 252,740; f90: 94,671; objc: 70,685; lisp: 42,813; pascal: 18,401; sh: 8,601; ml: 5,111; perl: 4,720; makefile: 3,676; awk: 3,523; javascript: 2,409; xml: 892; fortran: 770
file content (104 lines) | stat: -rw-r--r-- 2,728 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

// <set>

// class set

// void swap(set& m);

#include <set>
#include <cassert>
#include "test_macros.h"
#include "test_allocator.h"
#include "../../../test_compare.h"

int main(int, char**) {
  typedef int V;
  {
    typedef std::set<int> M;
    {
      M m1;
      M m2;
      M m1_save = m1;
      M m2_save = m2;
      swap(m1, m2);
      assert(m1 == m2_save);
      assert(m2 == m1_save);
    }
    {
      V 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);
    }
    {
      V 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);
    }
    {
      V ar1[] = {1, 2, 3, 4};
      V 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);
    }
  }
  {
    typedef test_allocator<V> A;
    typedef test_less<int> C;
    typedef std::set<int, C, A> M;
    V ar1[] = {1, 2, 3, 4};
    V ar2[] = {5, 6, 7, 8, 9, 10, 11, 12};
    M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0]), C(1), A(1, 1));
    M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0]), C(2), A(1, 2));
    M m1_save = m1;
    M m2_save = m2;
    swap(m1, m2);
    assert(m1 == m2_save);
    assert(m2 == m1_save);
    assert(m1.key_comp() == C(2));
    assert(m1.get_allocator().get_id() == 1);
    assert(m2.key_comp() == C(1));
    assert(m2.get_allocator().get_id() == 2);
  }
  {
    typedef other_allocator<V> A;
    typedef test_less<int> C;
    typedef std::set<int, C, A> M;
    V ar1[] = {1, 2, 3, 4};
    V ar2[] = {5, 6, 7, 8, 9, 10, 11, 12};
    M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0]), C(1), A(1));
    M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0]), C(2), A(2));
    M m1_save = m1;
    M m2_save = m2;
    swap(m1, m2);
    assert(m1 == m2_save);
    assert(m2 == m1_save);
    assert(m1.key_comp() == C(2));
    assert(m1.get_allocator() == A(2));
    assert(m2.key_comp() == C(1));
    assert(m2.get_allocator() == A(1));
  }

  return 0;
}