blob: cab75e5fdb46dba141182d2c50ff0670c21e902f (
plain)
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
|
// { 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.6.11 Template class unique_ptr [unique.ptr]
#include <memory>
#include <testsuite_hooks.h>
struct A
{
virtual ~A() { }
};
struct B : A
{
};
// 20.6.11.5 unqiue_ptr specialized algorithms [unique.ptr.special]
void
test01()
{
std::unique_ptr<A[]> p1;
std::unique_ptr<A[]> p2;
VERIFY( p1 == p2 );
VERIFY( !(p1 != p2) );
VERIFY( !(p1 < p2) && !(p1 > p2) );
}
void
test02()
{
std::unique_ptr<A[]> p1;
std::unique_ptr<A[]> p2(new A[3]);
VERIFY( p1 != p2 );
VERIFY( !(p1 == p2) );
VERIFY( (p1 < p2) || (p1 > p2) );
VERIFY( ((p1 <= p2) && (p1 != p2)) || ((p1 >= p2) && (p1 != p2)) );
}
int main()
{
test01();
test02();
return 0;
}
|
