| 161 | this->numTuples = numTuples; |
| 162 | } |
| 163 | uint8_t* FactorizedTable::appendEmptyTuple() { |
| 164 | auto numBytesPerTuple = tableSchema.getNumBytesPerTuple(); |
| 165 | if (flatTupleBlockCollection->needAllocation(numBytesPerTuple)) { |
| 166 | auto newBlock = std::make_unique<DataBlock>(memoryManager, flatTupleBlockSize); |
| 167 | flatTupleBlockCollection->append(std::move(newBlock)); |
| 168 | } |
| 169 | auto block = flatTupleBlockCollection->getLastBlock(); |
| 170 | uint8_t* tuplePtr = block->getWritableData(); |
| 171 | block->freeSize -= numBytesPerTuple; |
| 172 | block->numTuples++; |
| 173 | numTuples++; |
| 174 | return tuplePtr; |
| 175 | } |
| 176 | |
| 177 | void FactorizedTable::scan(std::span<ValueVector*> vectors, ft_tuple_idx_t tupleIdx, |
| 178 | uint64_t numTuplesToScan, std::span<ft_col_idx_t> colIdxesToScan) const { |
no test coverage detected