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 (76 lines) | stat: -rw-r--r-- 2,811 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
//===----------------------------------------------------------------------===//
//
// 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>

// shared_ptr

// template<class T, class U> bool operator==(const shared_ptr<T>& a, const shared_ptr<U>& b);
// template<class T, class U> bool operator!=(const shared_ptr<T>& a, const shared_ptr<U>& b);
// template<class T, class U> bool operator< (const shared_ptr<T>& a, const shared_ptr<U>& b);
// template<class T, class U> bool operator<=(const shared_ptr<T>& a, const shared_ptr<U>& b);
// template<class T, class U> bool operator> (const shared_ptr<T>& a, const shared_ptr<U>& b);
// template<class T, class U> bool operator>=(const shared_ptr<T>& a, const shared_ptr<U>& b);
// 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 "test_comparisons.h"

void do_nothing(int*) {}

int main(int, char**) {
  AssertComparisonsAreNoexcept<std::shared_ptr<int> >();
  AssertComparisonsReturnBool<std::shared_ptr<int> >();
#if TEST_STD_VER > 17
  AssertOrderAreNoexcept<std::shared_ptr<int>>();
  AssertOrderReturn<std::strong_ordering, std::shared_ptr<int>>();
#endif

  int* ptr1(new int);
  int* ptr2(new int);
  const std::shared_ptr<int> p1(ptr1);
  const std::shared_ptr<int> p2(ptr2);

  assert(!(p1 == p2));
  assert(p1 != p2);
  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

  // The deleter does not influence the comparisons
  // of the `shared_ptr`
  const std::shared_ptr<int> p3(ptr2, do_nothing);
  assert(p2 == p3);
  assert(!(p1 == p3));
  assert(!(p2 != p3));
  assert(p1 != p3);
  assert((p1 < p3) == (ptr1 < ptr2));
  assert((p1 <= p3) == (ptr1 <= ptr2));
  assert((p1 > p3) == (ptr1 > ptr2));
  assert((p1 >= p3) == (ptr1 >= ptr2));
#if TEST_STD_VER > 17
  assert((p2 <=> p3) == std::strong_ordering::equal);
  assert((p1 <=> p3) != std::strong_ordering::equal);
  assert((p1 <=> p3) == (ptr1 <=> ptr2));
#endif

  return 0;
}