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
|
/** @file
Intrusive pointer test.
@section license License
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include <ts/IntrusivePtr.h>
#include <ts/IntrusiveDList.h>
#include <ts/TestBox.h>
namespace
{ // Hide our local defintions
// Test class for pointers and lists.
class A : public IntrusivePtrCounter
{
public:
A() : _data(0) {}
static A *&
nextPtr(A *a)
{
return a->_next;
}
static A *&
prevPtr(A *a)
{
return a->_prev;
}
int _data;
A *_next;
A *_prev;
};
// Definitions to test compilation.
typedef IntrusivePtrQueue<A, IntrusivePtrLinkFunction<A, &A::nextPtr, &A::prevPtr>> AList;
}
REGRESSION_TEST(IntrusivePtr_Test_Basic)(RegressionTest *t, int atype, int *pstatus)
{
IntrusivePtr<A> ptr1;
IntrusivePtr<A> ptr2(new A);
TestBox tb(t, pstatus);
tb = REGRESSION_TEST_PASSED;
tb.check(!ptr1, "Default construct pointer is not empty.");
tb.check(ptr2, "Construction from pointer was empty.");
AList alist1;
tb.check(ptr2->useCount() == 1, "Bad use count: expected 1 got %d", ptr2->useCount());
alist1.append(ptr2);
tb.check(ptr2->useCount() == 2, "Bad use count: expected 2 got %d", ptr2->useCount());
alist1.remove(ptr2);
tb.check(ptr2->useCount() == 1, "Bad use count: expected 1 got %d", ptr2->useCount());
alist1.prepend(ptr2);
tb.check(ptr2->useCount() == 2, "Bad use count: expected 2 got %d", ptr2->useCount());
for (AList::iterator spot = alist1.begin(), limit = alist1.end(); spot != limit; ++spot) {
if (spot->_data)
break;
}
}
|
