If the data is not sorted, but we pre-calculated the permutation, after which they will be sorted. * This method is used to save RAM, since you do not need to keep two blocks at once - the source and the sorted. */
| 85 | * This method is used to save RAM, since you do not need to keep two blocks at once - the source and the sorted. |
| 86 | */ |
| 87 | void MergedBlockOutputStream::writeWithPermutation(const Block & block, const IColumn::Permutation * permutation) |
| 88 | { |
| 89 | writeImpl(block, permutation); |
| 90 | } |
| 91 | |
| 92 | void MergedBlockOutputStream::writeSuffix() |
| 93 | { |
no outgoing calls
no test coverage detected