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
|
/*
*
* 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 "qpid/InlineVector.h"
#include "unit_test.h"
namespace qpid {
namespace tests {
QPID_AUTO_TEST_SUITE(InlineVectorTestSuite)
using namespace qpid;
using namespace std;
typedef InlineVector<int, 3> Vec;
bool isInline(const Vec& v) {
// If nothing, give it the benefit of the doubt;
// can't take address of nothing.
if (v.size() <= 0)
return true;
return (const char*)&v <= (const char*)(&v[0]) &&
(const char*)(&v[0]) < (const char*)&v+sizeof(v);
}
QPID_AUTO_TEST_CASE(testCtor) {
{
Vec v;
BOOST_CHECK(isInline(v));
BOOST_CHECK(v.empty());
}
{
Vec v(3, 42);
BOOST_CHECK(isInline(v));
BOOST_CHECK_EQUAL(3u, v.size());
BOOST_CHECK_EQUAL(v[0], 42);
BOOST_CHECK_EQUAL(v[2], 42);
Vec u(v);
BOOST_CHECK(isInline(u));
BOOST_CHECK_EQUAL(3u, u.size());
BOOST_CHECK_EQUAL(u[0], 42);
BOOST_CHECK_EQUAL(u[2], 42);
}
{
Vec v(4, 42);
BOOST_CHECK_EQUAL(v.size(), 4u);
BOOST_CHECK(!isInline(v));
Vec u(v);
BOOST_CHECK_EQUAL(u.size(), 4u);
BOOST_CHECK(!isInline(u));
}
}
QPID_AUTO_TEST_CASE(testInsert) {
{
Vec v;
v.push_back(1);
BOOST_CHECK_EQUAL(v.size(), 1u);
BOOST_CHECK_EQUAL(v.back(), 1);
BOOST_CHECK(isInline(v));
v.insert(v.begin(), 2);
BOOST_CHECK_EQUAL(v.size(), 2u);
BOOST_CHECK_EQUAL(v.back(), 1);
BOOST_CHECK(isInline(v));
v.push_back(3);
BOOST_CHECK(isInline(v));
v.push_back(4);
BOOST_CHECK(!isInline(v));
}
{
Vec v(3,42);
v.insert(v.begin(), 9);
BOOST_CHECK_EQUAL(v.size(), 4u);
BOOST_CHECK(!isInline(v));
}
{
Vec v(3,42);
v.insert(v.begin()+1, 9);
BOOST_CHECK(!isInline(v));
BOOST_CHECK_EQUAL(v.size(), 4u);
}
}
QPID_AUTO_TEST_CASE(testAssign) {
Vec v(3,42);
Vec u;
u = v;
BOOST_CHECK(isInline(u));
u.push_back(4);
BOOST_CHECK(!isInline(u));
v = u;
BOOST_CHECK(!isInline(v));
}
QPID_AUTO_TEST_CASE(testResize) {
Vec v;
v.resize(5);
BOOST_CHECK(!isInline(v));
}
QPID_AUTO_TEST_SUITE_END()
}} // namespace qpid::tests
|
