ClickHouse/src/Storages/MergeTree/MergeTreeIndexHypothesis.h
2021-11-21 22:49:34 +03:00

82 lines
2.1 KiB
C++

#pragma once
#include <Storages/MergeTree/MergeTreeIndices.h>
#include <Storages/MergeTree/MergeTreeData.h>
#include <memory>
namespace DB
{
class MergeTreeIndexHyposesis;
struct MergeTreeIndexGranuleHypothesis : public IMergeTreeIndexGranule
{
explicit MergeTreeIndexGranuleHypothesis(
const String & index_name_);
MergeTreeIndexGranuleHypothesis(
const String & index_name_,
const bool met_);
void serializeBinary(WriteBuffer & ostr) const override;
void deserializeBinary(ReadBuffer & istr, MergeTreeIndexVersion version) override;
bool empty() const override { return is_empty; }
~MergeTreeIndexGranuleHypothesis() override = default;
const String & index_name;
bool is_empty = true;
bool met = true;
};
struct MergeTreeIndexAggregatorHypothesis : IMergeTreeIndexAggregator
{
explicit MergeTreeIndexAggregatorHypothesis(
const String & index_name_, const String & column_name_);
~MergeTreeIndexAggregatorHypothesis() override = default;
bool empty() const override { return is_empty; }
MergeTreeIndexGranulePtr getGranuleAndReset() override;
void update(const Block & block, size_t * pos, size_t limit) override;
private:
const String & index_name;
String column_name;
bool met = true;
bool is_empty = true;
};
class MergeTreeIndexHypothesis : public IMergeTreeIndex
{
public:
MergeTreeIndexHypothesis(
const IndexDescription & index_)
: IMergeTreeIndex(index_)
{}
~MergeTreeIndexHypothesis() override = default;
bool isMergeable() const override { return true; }
MergeTreeIndexGranulePtr createIndexGranule() const override;
MergeTreeIndexAggregatorPtr createIndexAggregator() const override;
MergeTreeIndexConditionPtr createIndexCondition(
const SelectQueryInfo & query, ContextPtr context) const override;
MergeTreeIndexMergedConditionPtr createIndexMergedCondtition(
const SelectQueryInfo & query_info, StorageMetadataPtr storage_metadata) const override;
bool mayBenefitFromIndexForIn(const ASTPtr & node) const override;
size_t max_rows = 0;
};
}