|
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
#include "CondFormats/DTObjects/interface/DTBufferTree.h"
#include <cassert>
#include <iostream>
#include <memory>
int main() {
std::cout << "testDTBufferTree\n";
DTBufferTree<int, int> buf;
DTBufferTree<int, int> const* pBuf = &buf;
std::vector<int> keys;
int i;
assert(buf.find(keys.end(), keys.end(), i) == 0);
assert(i == 0);
keys.push_back(1);
assert(buf.find(keys.begin(), keys.end(), i) == 1);
assert(i == 0);
assert(buf.find(1, i) == 1);
assert(i == 0);
assert(pBuf->find(keys.end(), keys.end(), i) == 0);
assert(i == 0);
assert(pBuf->find(keys.begin(), keys.end(), i) == 1);
assert(i == 0);
assert(pBuf->find(1, i) == 1);
assert(i == 0);
keys.push_back(2);
keys.push_back(3);
assert(buf.insert(keys.begin(), keys.end(), 11) == 0);
assert(buf.find(keys.begin(), keys.end(), i) == 0);
assert(i == 11);
assert(pBuf->find(keys.begin(), keys.end(), i) == 0);
assert(i == 11);
assert(buf.insert(keys.begin(), keys.end(), 12) == 1);
assert(buf.find(keys.begin(), keys.end(), i) == 0);
assert(i == 12);
assert(pBuf->find(keys.begin(), keys.end(), i) == 0);
assert(i == 12);
assert(buf.insert(100, 111) == 0);
assert(buf.find(100, i) == 0);
assert(i == 111);
assert(pBuf->find(100, i) == 0);
assert(i == 111);
assert(buf.insert(100, 112) == 1);
assert(buf.find(100, i) == 0);
assert(i == 112);
assert(pBuf->find(100, i) == 0);
assert(i == 112);
assert(buf.insert(keys.end(), keys.end(), 1000) == 1);
assert(buf.find(keys.end(), keys.end(), i) == 0);
assert(i == 1000);
assert(pBuf->find(keys.end(), keys.end(), i) == 0);
assert(i == 1000);
buf.clear();
assert(buf.find(keys.end(), keys.end(), i) == 0);
assert(i == 0);
assert(pBuf->find(keys.end(), keys.end(), i) == 0);
assert(i == 0);
assert(buf.find(keys.begin(), keys.end(), i) == 1);
assert(i == 0);
assert(pBuf->find(keys.begin(), keys.end(), i) == 1);
assert(i == 0);
assert(buf.insert(keys.begin(), keys.end(), 7) == 0);
assert(buf.find(keys.begin(), keys.end(), i) == 0);
assert(i == 7);
// ********************************************
// Repeat with unique_ptr template parameter
// Running this under valgrind checks for leaks
// (which was done when the test was created)
DTBufferTreeUniquePtr buf2;
DTBufferTreeUniquePtr const* pBuf2 = &buf2;
keys.clear();
std::vector<int> v;
std::vector<int>* ptr = &v;
std::vector<int> const* cptr = &v;
assert(buf2.find(keys.end(), keys.end(), ptr) == 0);
assert(ptr == nullptr);
keys.push_back(1);
assert(buf2.find(keys.begin(), keys.end(), ptr) == 1);
assert(ptr == nullptr);
assert(buf2.find(1, ptr) == 1);
assert(ptr == nullptr);
assert(pBuf2->find(keys.end(), keys.end(), cptr) == 0);
assert(cptr == nullptr);
assert(pBuf2->find(keys.begin(), keys.end(), cptr) == 1);
assert(cptr == nullptr);
assert(pBuf2->find(1, cptr) == 1);
assert(cptr == nullptr);
keys.push_back(2);
keys.push_back(3);
std::unique_ptr<std::vector<int> > uptr(new std::vector<int>);
uptr->push_back(101);
uptr->push_back(102);
assert(buf2.insert(keys.begin(), keys.end(), std::move(uptr)) == 0);
assert(buf2.find(keys.begin(), keys.end(), ptr) == 0);
assert(ptr->at(0) == 101 && ptr->at(1) == 102);
ptr->push_back(103);
assert(pBuf2->find(keys.begin(), keys.end(), cptr) == 0);
assert(cptr->at(0) == 101 && cptr->at(1) == 102 && cptr->at(2) == 103);
std::unique_ptr<std::vector<int> > uptr2(new std::vector<int>);
uptr2->push_back(21);
assert(buf2.insert(keys.begin(), keys.end(), std::move(uptr2)) == 1);
assert(buf2.find(keys.begin(), keys.end(), ptr) == 0);
assert(ptr->at(0) == 21);
assert(pBuf2->find(keys.begin(), keys.end(), cptr) == 0);
assert(cptr->at(0) == 21);
std::unique_ptr<std::vector<int> > uptr3(new std::vector<int>);
uptr3->push_back(31);
assert(buf2.insert(100, std::move(uptr3)) == 0);
assert(buf2.find(100, ptr) == 0);
assert(ptr->at(0) == 31);
assert(pBuf2->find(100, cptr) == 0);
assert(cptr->at(0) == 31);
std::unique_ptr<std::vector<int> > uptr4(new std::vector<int>);
uptr4->push_back(41);
assert(buf2.insert(100, std::move(uptr4)) == 1);
assert(buf2.find(100, ptr) == 0);
assert(ptr->at(0) == 41);
assert(pBuf2->find(100, cptr) == 0);
assert(cptr->at(0) == 41);
std::unique_ptr<std::vector<int> > uptr5(new std::vector<int>);
uptr5->push_back(51);
assert(buf2.insert(keys.end(), keys.end(), std::move(uptr5)) == 1);
assert(buf2.find(keys.end(), keys.end(), ptr) == 0);
assert(ptr->at(0) == 51);
assert(pBuf2->find(keys.end(), keys.end(), cptr) == 0);
assert(cptr->at(0) == 51);
buf2.clear();
assert(buf2.find(keys.end(), keys.end(), ptr) == 0);
assert(ptr == nullptr);
assert(pBuf2->find(keys.end(), keys.end(), cptr) == 0);
assert(cptr == nullptr);
assert(buf2.find(keys.begin(), keys.end(), ptr) == 1);
assert(ptr == nullptr);
assert(pBuf2->find(keys.begin(), keys.end(), cptr) == 1);
assert(cptr == nullptr);
std::unique_ptr<std::vector<int> > uptr6(new std::vector<int>);
uptr6->push_back(61);
assert(buf2.insert(keys.begin(), keys.end(), std::move(uptr6)) == 0);
assert(buf2.find(keys.begin(), keys.end(), ptr) == 0);
assert(ptr->at(0) == 61);
}
|