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
|
// { dg-do run { target c++11 } }
// Copyright (C) 2008-2018 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// 20.8.13.4 Template class owner_less [util.smartptr.ownerless]
#include <memory>
#include <algorithm>
#include <testsuite_hooks.h>
struct A { };
struct B { A a[2]; };
// 20.8.13.4 Template class owner_less [util.smartptr.ownerless]
int
test01()
{
// test empty shared_ptrs compare equivalent
std::owner_less<std::shared_ptr<A>> less;
std::owner_less<std::weak_ptr<A>> wless;
std::shared_ptr<A> p1;
std::shared_ptr<A> p2;
VERIFY( !less(p1, p2) && !less(p2, p1) );
std::weak_ptr<A> p3;
VERIFY( !less(p1, p3) && !less(p3, p1) );
VERIFY( !wless(p1, p3) && !wless(p3, p1) );
return 0;
}
// Construction from pointer
int
test02()
{
std::owner_less<std::shared_ptr<A>> less;
std::owner_less<std::weak_ptr<A>> wless;
std::shared_ptr<A> empty;
std::shared_ptr<A> a1(new A);
VERIFY( less(empty, a1) || less(a1, empty) );
std::shared_ptr<A> a2(new A);
VERIFY( less(a1, a2) || less(a2, a1) );
std::weak_ptr<A> w1(a1);
VERIFY( !less(a1, w1) && !less(w1, a1) );
std::weak_ptr<A> w2(a2);
VERIFY( wless(w1, w2) || wless(w2, w1) );
a1.reset();
VERIFY( !less(empty, a1) && !less(a1, empty) );
VERIFY( less(a1, w1) || less(w1, a1) );
a2.reset();
VERIFY( !less(a2, a1) && !less(a1, a2) );
return 0;
}
// aliasing
int
test03()
{
std::owner_less<std::shared_ptr<A>> less;
std::owner_less<std::weak_ptr<A>> wless;
std::shared_ptr<B> b(new B);
std::shared_ptr<A> a0(b, &b->a[0]);
std::shared_ptr<A> a1(b, &b->a[1]);
// values are different but owners are equivalent:
VERIFY( a0 < a1 && !less(a0, a1) && !less(a1, a0) );
std::weak_ptr<A> w0(a0);
std::weak_ptr<A> w1(a1);
VERIFY( !wless(w0, w1) && !wless(w1, w0) );
VERIFY( !less(a0, w1) && !less(w1, a0) );
VERIFY( !wless(w0, a1) && !wless(a1, w0) );
return 0;
}
// strict weak ordering
int
test04()
{
std::owner_less<std::shared_ptr<A>> less;
std::shared_ptr<A> a[3];
a[0].reset(new A);
a[1].reset(new A);
a[2].reset(new A);
std::sort(a, a+3, less);
VERIFY( !less(a[0], a[0]) );
VERIFY( less(a[0], a[1]) && !less(a[1], a[0]) );
VERIFY( less(a[0], a[1]) && less(a[1], a[2]) && less(a[0], a[2]) );
return 0;
}
int
main()
{
test01();
test02();
test03();
test04();
return 0;
}
|
