| 44 | } |
| 45 | |
| 46 | void test_dataBlockAddItem() { |
| 47 | DataBlock *dataBlock = DataBlock_New(DATABLOCK_BLOCK_CAP, 1024, sizeof(int), NULL); |
| 48 | size_t itemCount = 512; |
| 49 | DataBlock_Accommodate(dataBlock, itemCount); |
| 50 | TEST_ASSERT(dataBlock->itemCap >= itemCount); |
| 51 | |
| 52 | // Set items. |
| 53 | for(int i = 0 ; i < itemCount; i++) { |
| 54 | int *value = (int *)DataBlock_AllocateItem(dataBlock, NULL); |
| 55 | *value = i; |
| 56 | } |
| 57 | |
| 58 | // Read items. |
| 59 | for(int i = 0 ; i < itemCount; i++) { |
| 60 | int *value = (int *)DataBlock_GetItem(dataBlock, i); |
| 61 | TEST_ASSERT(*value == i); |
| 62 | } |
| 63 | |
| 64 | // Add enough item to cause datablock to re-allocate. |
| 65 | size_t prevItemCount = dataBlock->itemCount; |
| 66 | itemCount *= 64; |
| 67 | DataBlock_Accommodate(dataBlock, itemCount); |
| 68 | TEST_ASSERT(dataBlock->itemCap >= prevItemCount + itemCount); |
| 69 | |
| 70 | // Set items. |
| 71 | for(int i = 0 ; i < itemCount; i++) { |
| 72 | int *value = (int *)DataBlock_AllocateItem(dataBlock, NULL); |
| 73 | *value = prevItemCount + i; |
| 74 | } |
| 75 | |
| 76 | // Read items. |
| 77 | for(int i = 0 ; i < dataBlock->itemCount; i++) { |
| 78 | int *value = (int *)DataBlock_GetItem(dataBlock, i); |
| 79 | TEST_ASSERT(*value == i); |
| 80 | } |
| 81 | |
| 82 | DataBlock_Free(dataBlock); |
| 83 | } |
| 84 | |
| 85 | void test_dataBlockScan() { |
| 86 | DataBlock *dataBlock = DataBlock_New(DATABLOCK_BLOCK_CAP, 1024, sizeof(int), NULL); |
nothing calls this directly
no test coverage detected