File: cmp.pass.cpp

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (166 lines) | stat: -rw-r--r-- 5,070 bytes parent folder | download | duplicates (13)
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

// <memory>

// unique_ptr

// template <class T1, class D1, class T2, class D2>
//   bool
//   operator==(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);

// template <class T1, class D1, class T2, class D2>
//   bool
//   operator!=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);

// template <class T1, class D1, class T2, class D2>
//   bool
//   operator< (const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);

// template <class T1, class D1, class T2, class D2>
//   bool
//   operator> (const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);

// template <class T1, class D1, class T2, class D2>
//   bool
//   operator<=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);

// template <class T1, class D1, class T2, class D2>
//   bool
//   operator>=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);

// template<class T1, class D1, class T2, class D2>
//   requires three_way_comparable_with<typename unique_ptr<T1, D1>::pointer,
//                                      typename unique_ptr<T2, D2>::pointer>
//   compare_three_way_result_t<typename unique_ptr<T1, D1>::pointer,
//                              typename unique_ptr<T2, D2>::pointer>
//     operator<=>(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);

#include <memory>
#include <cassert>

#include "test_macros.h"
#include "deleter_types.h"
#include "test_comparisons.h"
#include "unique_ptr_test_helper.h"

TEST_CONSTEXPR_CXX23 bool test() {
  AssertComparisonsReturnBool<std::unique_ptr<int> >();
#if TEST_STD_VER > 17
  AssertOrderReturn<std::strong_ordering, std::unique_ptr<int>>();
#endif

  // Pointers of same type
  {
    A* ptr1 = new A;
    A* ptr2 = new A;
    const std::unique_ptr<A, Deleter<A> > p1(ptr1);
    const std::unique_ptr<A, Deleter<A> > p2(ptr2);

    assert(!(p1 == p2));
    assert(p1 != p2);
    if (!TEST_IS_CONSTANT_EVALUATED) {
      assert((p1 < p2) == (ptr1 < ptr2));
      assert((p1 <= p2) == (ptr1 <= ptr2));
      assert((p1 > p2) == (ptr1 > ptr2));
      assert((p1 >= p2) == (ptr1 >= ptr2));
#if TEST_STD_VER > 17
      assert((p1 <=> p2) != std::strong_ordering::equal);
      assert((p1 <=> p2) == (ptr1 <=> ptr2));
#endif
    }
  }
  // Pointers of different type
  {
    A* ptr1 = new A;
    B* ptr2 = new B;
    const std::unique_ptr<A, Deleter<A> > p1(ptr1);
    const std::unique_ptr<B, Deleter<B> > p2(ptr2);
    assert(!(p1 == p2));
    assert(p1 != p2);
    if (!TEST_IS_CONSTANT_EVALUATED) {
      assert((p1 < p2) == (ptr1 < ptr2));
      assert((p1 <= p2) == (ptr1 <= ptr2));
      assert((p1 > p2) == (ptr1 > ptr2));
      assert((p1 >= p2) == (ptr1 >= ptr2));
#if TEST_STD_VER > 17
    assert((p1 <=> p2) != std::strong_ordering::equal);
    assert((p1 <=> p2) == (ptr1 <=> ptr2));
#endif
    }
  }
  // Pointers of same array type
  {
    A* ptr1 = new A[3];
    A* ptr2 = new A[3];
    const std::unique_ptr<A[], Deleter<A[]> > p1(ptr1);
    const std::unique_ptr<A[], Deleter<A[]> > p2(ptr2);
    assert(!(p1 == p2));
    assert(p1 != p2);
    if (!TEST_IS_CONSTANT_EVALUATED) {
      assert((p1 < p2) == (ptr1 < ptr2));
      assert((p1 <= p2) == (ptr1 <= ptr2));
      assert((p1 > p2) == (ptr1 > ptr2));
      assert((p1 >= p2) == (ptr1 >= ptr2));
#if TEST_STD_VER > 17
    assert((p1 <=> p2) != std::strong_ordering::equal);
    assert((p1 <=> p2) == (ptr1 <=> ptr2));
#endif
    }
  }
  // Pointers of different array types
  {
    A* ptr1 = new A[3];
    B* ptr2 = new B[3];
    const std::unique_ptr<A[], Deleter<A[]> > p1(ptr1);
    const std::unique_ptr<B[], Deleter<B[]> > p2(ptr2);
    assert(!(p1 == p2));
    assert(p1 != p2);
    if (!TEST_IS_CONSTANT_EVALUATED) {
      assert((p1 < p2) == (ptr1 < ptr2));
      assert((p1 <= p2) == (ptr1 <= ptr2));
      assert((p1 > p2) == (ptr1 > ptr2));
      assert((p1 >= p2) == (ptr1 >= ptr2));
#if TEST_STD_VER > 17
    assert((p1 <=> p2) != std::strong_ordering::equal);
    assert((p1 <=> p2) == (ptr1 <=> ptr2));
#endif
    }
  }
  // Default-constructed pointers of same type
  {
    const std::unique_ptr<A, Deleter<A> > p1;
    const std::unique_ptr<A, Deleter<A> > p2;
    assert(p1 == p2);
#if TEST_STD_VER > 17
    if (!TEST_IS_CONSTANT_EVALUATED)
      assert((p1 <=> p2) == std::strong_ordering::equal);
#endif
  }
  // Default-constructed pointers of different type
  {
    const std::unique_ptr<A, Deleter<A> > p1;
    const std::unique_ptr<B, Deleter<B> > p2;
    assert(p1 == p2);
#if TEST_STD_VER > 17
    if (!TEST_IS_CONSTANT_EVALUATED)
      assert((p1 <=> p2) == std::strong_ordering::equal);
#endif
  }

  return true;
}

int main(int, char**) {
  test();
#if TEST_STD_VER >= 23
  static_assert(test());
#endif

  return 0;
}