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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
|
/*******************************************************************************
* ============LICENSE_START==================================================
* * org.onap.dmaap
* * ===========================================================================
* * Copyright © 2017 AT&T Intellectual Property. All rights reserved.
* * ===========================================================================
* * Licensed 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.
* * ============LICENSE_END====================================================
* *
* * ECOMP is a trademark and service mark of AT&T Intellectual Property.
* *
******************************************************************************/
package datarouter.provisioning;
import static org.junit.Assert.fail;
import java.util.Iterator;
import org.junit.Test;
import org.onap.dmaap.datarouter.provisioning.utils.RLEBitSet;
public class IntegrationTestRleBitSet {
@Test
public void testBasicConstructor() {
RLEBitSet bs = new RLEBitSet();
if (!bs.isEmpty()) {
fail("bit set not empty");
}
}
@Test
public void testStringConstructor() {
RLEBitSet bs = new RLEBitSet("1-10");
if (bs.isEmpty()) {
fail("bit set is empty");
}
if (!bs.toString().equals("1-10")) {
fail("bad value");
}
bs = new RLEBitSet("69,70,71");
if (bs.isEmpty()) {
fail("bit set is empty");
}
if (!bs.toString().equals("69-71")) {
fail("bad value");
}
bs = new RLEBitSet("555 444 443 442");
if (!bs.toString().equals("442-444,555")) {
fail("bad value");
}
}
@Test
public void testLength() {
RLEBitSet bs = new RLEBitSet();
if (bs.length() != 0) {
fail("testLength fail " + bs + " " + bs.length());
}
bs = new RLEBitSet("1-10");
if (bs.length() != 11) {
fail("testLength fail " + bs + " " + bs.length());
}
bs = new RLEBitSet("1-20,100000000-100000005");
if (bs.length() != 100000006) {
fail("testLength fail " + bs + " " + bs.length());
}
}
@Test
public void testGet() {
RLEBitSet bs = new RLEBitSet("1-10");
if (!bs.get(5)) {
fail("get");
}
if (bs.get(69)) {
fail("get");
}
}
@Test
public void testSetOneBit() {
RLEBitSet bs = new RLEBitSet();
for (int i = 12; i < 200; i++) {
bs.set(i);
}
bs.set(690);
for (int i = 305; i < 309; i++) {
bs.set(i);
}
bs.set(304);
if (!bs.toString().equals("12-199,304-308,690")) {
fail("testSetOneBit fail " + bs);
}
}
@Test
public void testSetString() {
RLEBitSet bs = new RLEBitSet();
bs.set("1-100");
if (!bs.toString().equals("1-100")) {
fail("testSetString fail " + bs);
}
}
@Test
public void testSetRange() {
RLEBitSet bs = new RLEBitSet();
bs.set(50,60);
if (!bs.toString().equals("50-59")) {
fail("testSetRange fail " + bs);
}
}
@Test
public void testClearOneBit() {
RLEBitSet bs = new RLEBitSet("1-10");
bs.clear(5);
if (!bs.toString().equals("1-4,6-10")) {
fail("testClearOneBit fail");
}
bs = new RLEBitSet("1-10");
bs.clear(11);
if (!bs.toString().equals("1-10")) {
fail("testClearOneBit fail " + bs);
}
}
@Test
public void testClearRangeLeft() {
RLEBitSet bs = new RLEBitSet("100-200");
bs.clear(40,50);
if (!bs.toString().equals("100-200")) {
fail("testClearRangeLeft fail " + bs);
}
}
@Test
public void testClearRangeRight() {
RLEBitSet bs = new RLEBitSet("100-200");
bs.clear(400,500);
if (!bs.toString().equals("100-200")) {
fail("testClearRangeRight fail " + bs);
}
}
@Test
public void testClearRangeMiddle() {
RLEBitSet bs = new RLEBitSet("100-200");
bs.clear(120,130);
if (!bs.toString().equals("100-119,130-200")) {
fail("testClearRangeRight fail " + bs);
}
}
@Test
public void testClearRangeIntersect() {
RLEBitSet bs = new RLEBitSet("100-200");
bs.clear(100,200);
if (!bs.toString().equals("200")) {
fail("testClearRangeIntersect fail " + bs);
}
}
@Test
public void testClearOverlapLeft() {
RLEBitSet bs = new RLEBitSet("100-200");
bs.clear(50,150);
if (!bs.toString().equals("150-200")) {
fail("testClearOverlapLeft fail " + bs);
}
}
@Test
public void testClearOverlapRight() {
RLEBitSet bs = new RLEBitSet("100-200");
bs.clear(150,250);
if (!bs.toString().equals("100-149")) {
fail("testClearOverlapRight fail " + bs);
}
}
@Test
public void testClearOverlapAll() {
RLEBitSet bs = new RLEBitSet("100-200");
bs.clear(50,250);
if (!bs.toString().equals("")) {
fail("testClearOverlapAll fail " + bs);
}
}
@Test
public void testAnd() {
RLEBitSet bs = new RLEBitSet("100-200");
RLEBitSet b2 = new RLEBitSet("150-400");
bs.and(b2);
if (!bs.toString().equals("150-200")) {
fail("testAnd fail " + bs);
}
bs = new RLEBitSet("100-200");
b2 = new RLEBitSet("1500-4000");
bs.and(b2);
if (!bs.isEmpty()) {
fail("testAnd fail " + bs);
}
}
@Test
public void testAndNot() {
RLEBitSet bs = new RLEBitSet("100-200");
RLEBitSet b2 = new RLEBitSet("150-159");
bs.andNot(b2);
if (!bs.toString().equals("100-149,160-200")) {
fail("testAndNot fail " + bs);
}
}
@Test
public void testIsEmpty() {
RLEBitSet bs = new RLEBitSet("");
if (!bs.isEmpty()) {
fail("testIsEmpty fail " + bs);
}
bs.set(1);
if (bs.isEmpty()) {
fail("testIsEmpty fail " + bs);
}
}
@Test
public void testCardinality() {
RLEBitSet bs = new RLEBitSet("1-120,10000000-10000005");
if (bs.cardinality() != 126) {
fail("testCardinality fail 1");
}
}
@Test
public void testIterator() {
RLEBitSet rleBitSet = new RLEBitSet("1,5,10-12");
Iterator<Long[]> rleBitSetRangeIterator = rleBitSet.getRangeIterator();
if (!rleBitSetRangeIterator.hasNext()) {
fail("iterator fail 1");
}
Long[] ll = rleBitSetRangeIterator.next();
if (ll == null || ll[0] != 1 || ll[1] != 1) {
fail("iterator fail 2");
}
if (!rleBitSetRangeIterator.hasNext()) {
fail("iterator fail 3");
}
ll = rleBitSetRangeIterator.next();
if (ll == null || ll[0] != 5 || ll[1] != 5) {
fail("iterator fail 4");
}
if (!rleBitSetRangeIterator.hasNext()) {
fail("iterator fail 5");
}
ll = rleBitSetRangeIterator.next();
if (ll == null || ll[0] != 10 || ll[1] != 12) {
fail("iterator fail 6");
}
if (rleBitSetRangeIterator.hasNext()) {
fail("iterator fail 7");
}
}
@Test
public void testClone() {
RLEBitSet bs1 = new RLEBitSet("1,5,10-12");
RLEBitSet bs2 = (RLEBitSet) bs1.clone();
if (!bs1.toString().equals(bs2.toString())) {
fail("clone");
}
}
}
|
