thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-12-04 21:42:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

ssize_t -> size_t

Browse Source
This commit is contained in:
Igor Markelov 2024-05-22 10:38:52 +00:00
parent 0d6e9acf85
commit 9e42da4966
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/Interpreters/BestCompressionPermutation.cpp
View File

@ -1,10 +1,10 @@
#include <Interpreters/BestCompressionPermutation.h> #include <Interpreters/BestCompressionPermutation.h>
#include <base/sort.h>
#include <Columns/IColumn.h> #include <Columns/IColumn.h>
#include <Common/iota.h>
#include <Common/PODArray.h>
#include <Interpreters/sortBlock.h> #include <Interpreters/sortBlock.h>
#include <base/sort.h>
#include <Common/PODArray.h>
#include <Common/iota.h>
#include <numeric> #include <numeric>
@ -101,16 +101,16 @@ std::vector<size_t> getNotAlreadySortedColumnsIndex(const Block & block, const S
EqualRanges getEqualRanges(const Block & block, const SortDescription & description, const IColumn::Permutation & permutation) EqualRanges getEqualRanges(const Block & block, const SortDescription & description, const IColumn::Permutation & permutation)
{ {
EqualRanges ranges; EqualRanges ranges;
const ssize_t rows = block.rows(); const size_t rows = block.rows();
if (description.empty()) if (description.empty())
{ {
ranges.push_back({0, rows}); ranges.push_back({0, rows});
} }
else else
{ {
for (ssize_t i = 0; i < rows;) for (size_t i = 0; i < rows;)
{ {
ssize_t j = i; size_t j = i;
for (; j < rows && isEqual(block, description, permutation[i], permutation[j]); ++j) for (; j < rows && isEqual(block, description, permutation[i], permutation[j]); ++j)
{ {
} }