[Improvement](sort) improve partial sort algorithm (#12349)
* [Improvement](sort) improve partial sort algorithm
This commit is contained in:
@ -35,6 +35,7 @@
|
||||
#include "vec/common/nan_utils.h"
|
||||
#include "vec/common/sip_hash.h"
|
||||
#include "vec/common/unaligned.h"
|
||||
#include "vec/core/sort_block.h"
|
||||
|
||||
namespace doris::vectorized {
|
||||
|
||||
@ -111,6 +112,13 @@ void ColumnVector<T>::update_hashes_with_value(std::vector<SipHash>& hashes,
|
||||
SIP_HASHES_FUNCTION_COLUMN_IMPL();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void ColumnVector<T>::sort_column(const ColumnSorter* sorter, EqualFlags& flags,
|
||||
IColumn::Permutation& perms, EqualRange& range,
|
||||
bool last_column) const {
|
||||
sorter->template sort_column(static_cast<const Self&>(*this), flags, perms, range, last_column);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
struct ColumnVector<T>::less {
|
||||
const Self& parent;
|
||||
|
||||
Reference in New Issue
Block a user