thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-12-01 03:52:15 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix optimization of replacing algorithm

Browse Source
This commit is contained in:
Anton Popov 2024-10-25 14:01:55 +00:00
parent 30d3f5e7df
commit 54a00e8751
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/Processors/Merges/Algorithms/ReplacingSortedAlgorithm.cpp
View File

@ -132,15 +132,15 @@ IMergingAlgorithm::Status ReplacingSortedAlgorithm::merge()
/// and current chunk has no duplicates (we assume that parts with non-zero level have no duplicates)
/// We want to insert current cursor chunk directly in merged data.
size_t source_num = current->order;
auto current_chunk = std::move(*sources[source_num].chunk);
size_t chunk_num_rows = current_chunk.getNumRows();
/// First if merged_data is not empty we need to flush it.
/// We will get into the same condition on next merge call.
if (merged_data->mergedRows() != 0)
return Status(merged_data->pull());
size_t source_num = current->order;
auto current_chunk = std::move(*sources[source_num].chunk);
size_t chunk_num_rows = current_chunk.getNumRows();
/// We will get the next block from the corresponding source, if there is one.
queue.removeTop();