mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-26 17:41:59 +00:00
Update ReplicatedMergeTreeQuorumAddedParts.h
This commit is contained in:
parent
17aa0356e5
commit
8c413e3f1f
@ -14,113 +14,113 @@ namespace DB
|
||||
|
||||
struct ReplicatedMergeTreeQuorumAddedParts
|
||||
{
|
||||
using PartitionIdToMaxBlock = std::unordered_map<String, Int64>;
|
||||
using PartitionIdToPartName = std::unordered_map<String, String>;
|
||||
using PartitionIdToMaxBlock = std::unordered_map<String, Int64>;
|
||||
using PartitionIdToPartName = std::unordered_map<String, String>;
|
||||
|
||||
PartitionIdToPartName added_parts;
|
||||
PartitionIdToPartName added_parts;
|
||||
|
||||
MergeTreeDataFormatVersion format_version;
|
||||
MergeTreeDataFormatVersion format_version;
|
||||
|
||||
ReplicatedMergeTreeQuorumAddedParts(const std::string & added_parts_str, MergeTreeDataFormatVersion format_version_)
|
||||
: format_version(format_version_)
|
||||
{
|
||||
fromString(added_parts_str);
|
||||
}
|
||||
ReplicatedMergeTreeQuorumAddedParts(const std::string & added_parts_str, MergeTreeDataFormatVersion format_version_)
|
||||
: format_version(format_version_)
|
||||
{
|
||||
fromString(added_parts_str);
|
||||
}
|
||||
|
||||
/// Write new parts in buffer with added parts.
|
||||
void write(WriteBuffer & out)
|
||||
{
|
||||
out << "version: " << 2 << '\n';
|
||||
out << "parts count: " << added_parts.size() << '\n';
|
||||
/// Write new parts in buffer with added parts.
|
||||
void write(WriteBuffer & out)
|
||||
{
|
||||
out << "version: " << 2 << '\n';
|
||||
out << "parts count: " << added_parts.size() << '\n';
|
||||
|
||||
for (const auto & part : added_parts)
|
||||
out << part.first << '\t' << part.second << '\n';
|
||||
}
|
||||
for (const auto & part : added_parts)
|
||||
out << part.first << '\t' << part.second << '\n';
|
||||
}
|
||||
|
||||
PartitionIdToMaxBlock getMaxInsertedBlocks()
|
||||
{
|
||||
PartitionIdToMaxBlock max_added_blocks;
|
||||
PartitionIdToMaxBlock getMaxInsertedBlocks()
|
||||
{
|
||||
PartitionIdToMaxBlock max_added_blocks;
|
||||
|
||||
for (const auto & part : added_parts)
|
||||
{
|
||||
auto partition_info = MergeTreePartInfo::fromPartName(part.second, format_version);
|
||||
max_added_blocks[part.first] = partition_info.max_block;
|
||||
}
|
||||
|
||||
return max_added_blocks;
|
||||
}
|
||||
for (const auto & part : added_parts)
|
||||
{
|
||||
auto partition_info = MergeTreePartInfo::fromPartName(part.second, format_version);
|
||||
max_added_blocks[part.first] = partition_info.max_block;
|
||||
}
|
||||
|
||||
void read(ReadBuffer & in)
|
||||
{
|
||||
if (checkString("version: ", in))
|
||||
{
|
||||
size_t version;
|
||||
return max_added_blocks;
|
||||
}
|
||||
|
||||
readText(version, in);
|
||||
assertChar('\n', in);
|
||||
void read(ReadBuffer & in)
|
||||
{
|
||||
if (checkString("version: ", in))
|
||||
{
|
||||
size_t version;
|
||||
|
||||
if (version == 2)
|
||||
added_parts = read_v2(in);
|
||||
}
|
||||
else
|
||||
added_parts = read_v1(in);
|
||||
}
|
||||
readText(version, in);
|
||||
assertChar('\n', in);
|
||||
|
||||
/// Read added bloks when node in ZooKeeper supports only one partition.
|
||||
PartitionIdToPartName read_v1(ReadBuffer & in)
|
||||
{
|
||||
PartitionIdToPartName parts_in_quorum;
|
||||
if (version == 2)
|
||||
added_parts = read_v2(in);
|
||||
}
|
||||
else
|
||||
added_parts = read_v1(in);
|
||||
}
|
||||
|
||||
std::string partition_name;
|
||||
/// Read added bloks when node in ZooKeeper supports only one partition.
|
||||
PartitionIdToPartName read_v1(ReadBuffer & in)
|
||||
{
|
||||
PartitionIdToPartName parts_in_quorum;
|
||||
|
||||
readText(partition_name, in);
|
||||
std::string partition_name;
|
||||
|
||||
auto partition_info = MergeTreePartInfo::fromPartName(partition_name, format_version);
|
||||
readText(partition_name, in);
|
||||
|
||||
auto partition_info = MergeTreePartInfo::fromPartName(partition_name, format_version);
|
||||
parts_in_quorum[partition_info.partition_id] = partition_name;
|
||||
|
||||
return parts_in_quorum;
|
||||
}
|
||||
return parts_in_quorum;
|
||||
}
|
||||
|
||||
/// Read blocks when node in ZooKeeper suppors multiple partitions.
|
||||
PartitionIdToPartName read_v2(ReadBuffer & in)
|
||||
{
|
||||
assertString("parts count: ", in);
|
||||
/// Read blocks when node in ZooKeeper suppors multiple partitions.
|
||||
PartitionIdToPartName read_v2(ReadBuffer & in)
|
||||
{
|
||||
assertString("parts count: ", in);
|
||||
|
||||
PartitionIdToPartName parts_in_quorum;
|
||||
PartitionIdToPartName parts_in_quorum;
|
||||
|
||||
uint64_t parts_count;
|
||||
readText(parts_count, in);
|
||||
assertChar('\n', in);
|
||||
|
||||
for (uint64_t i = 0; i < parts_count; ++i)
|
||||
{
|
||||
std::string partition_id;
|
||||
std::string part_name;
|
||||
uint64_t parts_count;
|
||||
readText(parts_count, in);
|
||||
assertChar('\n', in);
|
||||
|
||||
readText(partition_id, in);
|
||||
assertChar('\t', in);
|
||||
readText(part_name, in);
|
||||
assertChar('\n', in);
|
||||
for (uint64_t i = 0; i < parts_count; ++i)
|
||||
{
|
||||
std::string partition_id;
|
||||
std::string part_name;
|
||||
|
||||
parts_in_quorum[partition_id] = part_name;
|
||||
}
|
||||
return parts_in_quorum;
|
||||
}
|
||||
readText(partition_id, in);
|
||||
assertChar('\t', in);
|
||||
readText(part_name, in);
|
||||
assertChar('\n', in);
|
||||
|
||||
void fromString(const std::string & str)
|
||||
{
|
||||
if (str.empty())
|
||||
return;
|
||||
ReadBufferFromString in(str);
|
||||
read(in);
|
||||
}
|
||||
parts_in_quorum[partition_id] = part_name;
|
||||
}
|
||||
return parts_in_quorum;
|
||||
}
|
||||
|
||||
std::string toString()
|
||||
{
|
||||
WriteBufferFromOwnString out;
|
||||
write(out);
|
||||
return out.str();
|
||||
}
|
||||
void fromString(const std::string & str)
|
||||
{
|
||||
if (str.empty())
|
||||
return;
|
||||
ReadBufferFromString in(str);
|
||||
read(in);
|
||||
}
|
||||
|
||||
std::string toString()
|
||||
{
|
||||
WriteBufferFromOwnString out;
|
||||
write(out);
|
||||
return out.str();
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user