|
21 | 21 | import static org.junit.Assert.assertEquals; |
22 | 22 | import static org.junit.Assert.assertNull; |
23 | 23 | import static org.junit.Assert.assertTrue; |
| 24 | +import static org.junit.Assert.assertFalse; |
24 | 25 |
|
25 | 26 | import org.apache.arrow.memory.BufferAllocator; |
26 | 27 | import org.apache.arrow.memory.RootAllocator; |
@@ -234,6 +235,198 @@ public void testSplitAndTransfer2() throws Exception { |
234 | 235 | } |
235 | 236 | } |
236 | 237 |
|
| 238 | + @Test |
| 239 | + public void testReallocAfterVectorTransfer1() { |
| 240 | + try (final BitVector vector = new BitVector(EMPTY_SCHEMA_PATH, allocator)) { |
| 241 | + vector.allocateNew(4096); |
| 242 | + int valueCapacity = vector.getValueCapacity(); |
| 243 | + assertEquals(4096, valueCapacity); |
| 244 | + |
| 245 | + final BitVector.Mutator mutator = vector.getMutator(); |
| 246 | + final BitVector.Accessor accessor = vector.getAccessor(); |
| 247 | + |
| 248 | + for (int i = 0; i < valueCapacity; i++) { |
| 249 | + if ((i & 1) == 1) { |
| 250 | + mutator.setToOne(i); |
| 251 | + } |
| 252 | + } |
| 253 | + |
| 254 | + for (int i = 0; i < valueCapacity; i++) { |
| 255 | + int val = accessor.get(i); |
| 256 | + if ((i & 1) == 1) { |
| 257 | + assertEquals("unexpected cleared bit at index: " + i, 1, val); |
| 258 | + } |
| 259 | + else { |
| 260 | + assertEquals("unexpected set bit at index: " + i, 0, val); |
| 261 | + } |
| 262 | + } |
| 263 | + |
| 264 | + /* trigger first realloc */ |
| 265 | + mutator.setSafeToOne(valueCapacity); |
| 266 | + assertEquals(valueCapacity * 2, vector.getValueCapacity()); |
| 267 | + |
| 268 | + for (int i = valueCapacity; i < valueCapacity*2; i++) { |
| 269 | + if ((i & 1) == 1) { |
| 270 | + mutator.setToOne(i); |
| 271 | + } |
| 272 | + } |
| 273 | + |
| 274 | + for (int i = 0; i < valueCapacity*2; i++) { |
| 275 | + int val = accessor.get(i); |
| 276 | + if (((i & 1) == 1) || (i == valueCapacity)) { |
| 277 | + assertEquals("unexpected cleared bit at index: " + i, 1, val); |
| 278 | + } |
| 279 | + else { |
| 280 | + assertEquals("unexpected set bit at index: " + i, 0, val); |
| 281 | + } |
| 282 | + } |
| 283 | + |
| 284 | + /* trigger second realloc */ |
| 285 | + mutator.setSafeToOne(valueCapacity*2); |
| 286 | + assertEquals(valueCapacity * 4, vector.getValueCapacity()); |
| 287 | + |
| 288 | + for (int i = valueCapacity*2; i < valueCapacity*4; i++) { |
| 289 | + if ((i & 1) == 1) { |
| 290 | + mutator.setToOne(i); |
| 291 | + } |
| 292 | + } |
| 293 | + |
| 294 | + for (int i = 0; i < valueCapacity*4; i++) { |
| 295 | + int val = accessor.get(i); |
| 296 | + if (((i & 1) == 1) || (i == valueCapacity) || (i == valueCapacity*2)) { |
| 297 | + assertEquals("unexpected cleared bit at index: " + i, 1, val); |
| 298 | + } |
| 299 | + else { |
| 300 | + assertEquals("unexpected set bit at index: " + i, 0, val); |
| 301 | + } |
| 302 | + } |
| 303 | + |
| 304 | + /* now transfer the vector */ |
| 305 | + TransferPair transferPair = vector.getTransferPair(allocator); |
| 306 | + transferPair.transfer(); |
| 307 | + final BitVector toVector = (BitVector)transferPair.getTo(); |
| 308 | + final BitVector.Accessor toAccessor = toVector.getAccessor(); |
| 309 | + final BitVector.Mutator toMutator = toVector.getMutator(); |
| 310 | + |
| 311 | + assertEquals(valueCapacity * 4, toVector.getValueCapacity()); |
| 312 | + |
| 313 | + /* realloc the toVector */ |
| 314 | + toMutator.setSafeToOne(valueCapacity * 4); |
| 315 | + |
| 316 | + for (int i = 0; i < toVector.getValueCapacity(); i++) { |
| 317 | + int val = toAccessor.get(i); |
| 318 | + if (i <= valueCapacity * 4) { |
| 319 | + if (((i & 1) == 1) || (i == valueCapacity) || |
| 320 | + (i == valueCapacity*2) || (i == valueCapacity*4)) { |
| 321 | + assertEquals("unexpected cleared bit at index: " + i, 1, val); |
| 322 | + } |
| 323 | + else { |
| 324 | + assertEquals("unexpected set bit at index: " + i, 0, val); |
| 325 | + } |
| 326 | + } |
| 327 | + else { |
| 328 | + assertEquals("unexpected set bit at index: " + i, 0, val); |
| 329 | + } |
| 330 | + } |
| 331 | + |
| 332 | + toVector.close(); |
| 333 | + } |
| 334 | + } |
| 335 | + |
| 336 | + @Test |
| 337 | + public void testReallocAfterVectorTransfer2() { |
| 338 | + try (final NullableBitVector vector = new NullableBitVector(EMPTY_SCHEMA_PATH, allocator)) { |
| 339 | + vector.allocateNew(4096); |
| 340 | + int valueCapacity = vector.getValueCapacity(); |
| 341 | + assertEquals(4096, valueCapacity); |
| 342 | + |
| 343 | + final NullableBitVector.Mutator mutator = vector.getMutator(); |
| 344 | + final NullableBitVector.Accessor accessor = vector.getAccessor(); |
| 345 | + |
| 346 | + for (int i = 0; i < valueCapacity; i++) { |
| 347 | + if ((i & 1) == 1) { |
| 348 | + mutator.set(i, 1); |
| 349 | + } |
| 350 | + } |
| 351 | + |
| 352 | + for (int i = 0; i < valueCapacity; i++) { |
| 353 | + if ((i & 1) == 1) { |
| 354 | + assertFalse("unexpected cleared bit at index: " + i, accessor.isNull(i)); |
| 355 | + } |
| 356 | + else { |
| 357 | + assertTrue("unexpected set bit at index: " + i, accessor.isNull(i)); |
| 358 | + } |
| 359 | + } |
| 360 | + |
| 361 | + /* trigger first realloc */ |
| 362 | + mutator.setSafe(valueCapacity, 1, 1); |
| 363 | + assertEquals(valueCapacity * 2, vector.getValueCapacity()); |
| 364 | + |
| 365 | + for (int i = valueCapacity; i < valueCapacity*2; i++) { |
| 366 | + if ((i & 1) == 1) { |
| 367 | + mutator.set(i, 1); |
| 368 | + } |
| 369 | + } |
| 370 | + |
| 371 | + for (int i = 0; i < valueCapacity*2; i++) { |
| 372 | + if (((i & 1) == 1) || (i == valueCapacity)) { |
| 373 | + assertFalse("unexpected cleared bit at index: " + i, accessor.isNull(i)); |
| 374 | + } |
| 375 | + else { |
| 376 | + assertTrue("unexpected set bit at index: " + i, accessor.isNull(i)); |
| 377 | + } |
| 378 | + } |
| 379 | + |
| 380 | + /* trigger second realloc */ |
| 381 | + mutator.setSafe(valueCapacity*2, 1, 1); |
| 382 | + assertEquals(valueCapacity * 4, vector.getValueCapacity()); |
| 383 | + |
| 384 | + for (int i = valueCapacity*2; i < valueCapacity*4; i++) { |
| 385 | + if ((i & 1) == 1) { |
| 386 | + mutator.set(i, 1); |
| 387 | + } |
| 388 | + } |
| 389 | + |
| 390 | + for (int i = 0; i < valueCapacity*4; i++) { |
| 391 | + if (((i & 1) == 1) || (i == valueCapacity) || (i == valueCapacity*2)) { |
| 392 | + assertFalse("unexpected cleared bit at index: " + i, accessor.isNull(i)); |
| 393 | + } |
| 394 | + else { |
| 395 | + assertTrue("unexpected set bit at index: " + i, accessor.isNull(i)); |
| 396 | + } |
| 397 | + } |
| 398 | + |
| 399 | + /* now transfer the vector */ |
| 400 | + TransferPair transferPair = vector.getTransferPair(allocator); |
| 401 | + transferPair.transfer(); |
| 402 | + final NullableBitVector toVector = (NullableBitVector)transferPair.getTo(); |
| 403 | + final NullableBitVector.Accessor toAccessor = toVector.getAccessor(); |
| 404 | + final NullableBitVector.Mutator toMutator = toVector.getMutator(); |
| 405 | + |
| 406 | + assertEquals(valueCapacity * 4, toVector.getValueCapacity()); |
| 407 | + |
| 408 | + /* realloc the toVector */ |
| 409 | + toMutator.setSafe(valueCapacity * 4, 1, 1); |
| 410 | + |
| 411 | + for (int i = 0; i < toVector.getValueCapacity(); i++) { |
| 412 | + if (i <= valueCapacity * 4) { |
| 413 | + if (((i & 1) == 1) || (i == valueCapacity) || |
| 414 | + (i == valueCapacity*2) || (i == valueCapacity*4)) { |
| 415 | + assertFalse("unexpected cleared bit at index: " + i, toAccessor.isNull(i)); |
| 416 | + } |
| 417 | + else { |
| 418 | + assertTrue("unexpected set bit at index: " + i, toAccessor.isNull(i)); |
| 419 | + } |
| 420 | + } |
| 421 | + else { |
| 422 | + assertTrue("unexpected set bit at index: " + i, toAccessor.isNull(i)); |
| 423 | + } |
| 424 | + } |
| 425 | + |
| 426 | + toVector.close(); |
| 427 | + } |
| 428 | + } |
| 429 | + |
237 | 430 | @Test |
238 | 431 | public void testBitVector() { |
239 | 432 | // Create a new value vector for 1024 integers |
|
0 commit comments