ClickHouse/dbms/src/Interpreters/sortBlock.h

33 lines
1.2 KiB
C++
Raw Normal View History

2012-07-17 20:06:38 +00:00
#pragma once
#include <Core/Block.h>
#include <Core/SortDescription.h>
2012-07-17 20:06:38 +00:00
namespace DB
{
2017-06-02 21:37:28 +00:00
/// Sort one block by `description`. If limit != 0, then the partial sort of the first `limit` rows is produced.
void sortBlock(Block & block, const SortDescription & description, size_t limit = 0);
2012-07-17 20:06:38 +00:00
2013-11-29 22:10:15 +00:00
2017-06-02 21:37:28 +00:00
/** Used only in StorageMergeTree to sort the data with INSERT.
* Sorting is stable. This is important for keeping the order of rows in the CollapsingMergeTree engine
* - because based on the order of rows it is determined whether to delete or leave groups of rows when collapsing.
* Collations are not supported. Partial sorting is not supported.
*/
2013-11-29 22:10:15 +00:00
void stableSortBlock(Block & block, const SortDescription & description);
2017-06-02 21:37:28 +00:00
/** Same as stableSortBlock, but do not sort the block, but only calculate the permutation of the values,
* so that you can rearrange the column values yourself.
*/
void stableGetPermutation(const Block & block, const SortDescription & description, IColumn::Permutation & out_permutation);
2017-06-02 21:37:28 +00:00
/** Quickly check whether the block is already sorted. If the block is not sorted - returns false as fast as possible.
* Collations are not supported.
*/
bool isAlreadySorted(const Block & block, const SortDescription & description);
2012-07-17 20:06:38 +00:00
}