rel.pass.cpp 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. // <memory>
  9. // unique_ptr
  10. // template <class T1, class D1, class T2, class D2>
  11. // bool
  12. // operator< (const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
  13. // template <class T1, class D1, class T2, class D2>
  14. // bool
  15. // operator> (const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
  16. // template <class T1, class D1, class T2, class D2>
  17. // bool
  18. // operator<=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
  19. // template <class T1, class D1, class T2, class D2>
  20. // bool
  21. // operator>=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
  22. #include <memory>
  23. #include <cassert>
  24. #include "test_macros.h"
  25. #include "deleter_types.h"
  26. struct A
  27. {
  28. static int count;
  29. A() {++count;}
  30. A(const A&) {++count;}
  31. virtual ~A() {--count;}
  32. };
  33. int A::count = 0;
  34. struct B
  35. : public A
  36. {
  37. static int count;
  38. B() {++count;}
  39. B(const B&) {++count;}
  40. virtual ~B() {--count;}
  41. };
  42. int B::count = 0;
  43. int main(int, char**)
  44. {
  45. {
  46. const std::unique_ptr<A, Deleter<A> > p1(new A);
  47. const std::unique_ptr<A, Deleter<A> > p2(new A);
  48. assert((p1 < p2) == !(p1 > p2));
  49. assert((p1 < p2) == (p1 <= p2));
  50. assert((p1 < p2) == !(p1 >= p2));
  51. }
  52. {
  53. const std::unique_ptr<A, Deleter<A> > p1(new A);
  54. const std::unique_ptr<B, Deleter<B> > p2(new B);
  55. assert((p1 < p2) == !(p1 > p2));
  56. assert((p1 < p2) == (p1 <= p2));
  57. assert((p1 < p2) == !(p1 >= p2));
  58. }
  59. {
  60. const std::unique_ptr<A[], Deleter<A[]> > p1(new A[3]);
  61. const std::unique_ptr<A[], Deleter<A[]> > p2(new A[3]);
  62. assert((p1 < p2) == !(p1 > p2));
  63. assert((p1 < p2) == (p1 <= p2));
  64. assert((p1 < p2) == !(p1 >= p2));
  65. }
  66. {
  67. const std::unique_ptr<A[], Deleter<A[]> > p1(new A[3]);
  68. const std::unique_ptr<B[], Deleter<B[]> > p2(new B[3]);
  69. assert((p1 < p2) == !(p1 > p2));
  70. assert((p1 < p2) == (p1 <= p2));
  71. assert((p1 < p2) == !(p1 >= p2));
  72. }
  73. {
  74. const std::unique_ptr<A, Deleter<A> > p1;
  75. const std::unique_ptr<A, Deleter<A> > p2;
  76. assert((p1 < p2) == (p1 > p2));
  77. assert((p1 < p2) == !(p1 <= p2));
  78. assert((p1 < p2) == !(p1 >= p2));
  79. }
  80. {
  81. const std::unique_ptr<A, Deleter<A> > p1;
  82. const std::unique_ptr<B, Deleter<B> > p2;
  83. assert((p1 < p2) == (p1 > p2));
  84. assert((p1 < p2) == !(p1 <= p2));
  85. assert((p1 < p2) == !(p1 >= p2));
  86. }
  87. return 0;
  88. }