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 (69 lines) | stat: -rw-r--r-- 2,296 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
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
//
// UNSUPPORTED: no-threads

// <thread>

// class thread::id

// bool operator==(thread::id x, thread::id y) noexcept;
// bool operator!=(thread::id x, thread::id y) noexcept;
// bool operator< (thread::id x, thread::id y) noexcept;
// bool operator<=(thread::id x, thread::id y) noexcept;
// bool operator> (thread::id x, thread::id y) noexcept;
// bool operator>=(thread::id x, thread::id y) noexcept;
// strong_ordering operator<=>(thread::id x, thread::id y) noexcept;

#include <thread>
#include <cassert>

#include "test_macros.h"
#include "test_comparisons.h"

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

  std::thread::id id1;
  std::thread::id id2;
  std::thread::id id3 = std::this_thread::get_id();

  // `id1` and `id2` should compare equal
  assert(testComparisons(id1, id2, /*isEqual*/ true, /*isLess*/ false));
#if TEST_STD_VER > 17
  assert(testOrder(id1, id2, std::strong_ordering::equal));
#endif

  // Test `t1` and `t3` which are not equal
  bool isLess = id1 < id3;
  assert(testComparisons(id1, id3, /*isEqual*/ false, isLess));
#if TEST_STD_VER > 17
  assert(testOrder(id1, id3, isLess ? std::strong_ordering::less : std::strong_ordering::greater));
#endif

  // Regression tests for https://github.com/llvm/llvm-project/issues/56187
  // libc++ previously declared the comparison operators as hidden friends
  // which was non-conforming.
  assert(std::operator==(id1, id2));
#if TEST_STD_VER <= 17
  assert(!std::operator!=(id1, id2));
  assert(!std::operator<(id1, id2));
  assert(std::operator<=(id1, id2));
  assert(!std::operator>(id1, id2));
  assert(std::operator>=(id1, id2));
#else
  assert(std::operator<=>(id1, id2) == std::strong_ordering::equal);
#endif

  return 0;
}