Optimization of sorting heap

This commit is contained in:
Alexey Milovidov 2019-12-21 03:00:07 +03:00
parent 0820dc0c84
commit 6c03e1e91a

View File

@ -150,7 +150,6 @@ MergeSortingBlocksBlockInputStream::MergeSortingBlocksBlockInputStream(
blocks.swap(nonempty_blocks);
size_t size = cursors.size();
if (!has_collation)
queue_without_collation = SortingHeap<SortCursor>(cursors);
else