1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
#include <Storages/MergeTree/ActiveDataPartSet.h>
#include <Common/Exception.h>
#include <Common/logger_useful.h>
#include <algorithm>
#include <cassert>
namespace DB
{
namespace ErrorCodes
{
extern const int LOGICAL_ERROR;
}
ActiveDataPartSet::ActiveDataPartSet(MergeTreeDataFormatVersion format_version_, const Strings & names)
: format_version(format_version_)
{
for (const auto & name : names)
add(name);
}
bool ActiveDataPartSet::add(const String & name, Strings * out_replaced_parts)
{
auto part_info = MergeTreePartInfo::fromPartName(name, format_version);
return add(part_info, name, out_replaced_parts);
}
bool ActiveDataPartSet::add(const MergeTreePartInfo & part_info, const String & name, Strings * out_replaced_parts)
{
/// TODO make it exception safe (out_replaced_parts->push_back(...) may throw)
if (getContainingPartImpl(part_info) != part_info_to_name.end())
return false;
/// Parts contained in `part` are located contiguously in `part_info_to_name`, overlapping with the place where the part itself would be inserted.
auto it = part_info_to_name.lower_bound(part_info);
if (out_replaced_parts)
out_replaced_parts->clear();
/// Let's go left.
while (it != part_info_to_name.begin())
{
--it;
if (!part_info.contains(it->first))
{
if (!part_info.isDisjoint(it->first))
throw Exception(ErrorCodes::LOGICAL_ERROR,
"Part {} intersects previous part {}. "
"It is a bug or a result of manual intervention in the ZooKeeper data.",
part_info.getPartNameForLogs(), it->first.getPartNameForLogs());
++it;
break;
}
if (out_replaced_parts)
out_replaced_parts->push_back(it->second);
it = part_info_to_name.erase(it);
}
if (out_replaced_parts)
std::reverse(out_replaced_parts->begin(), out_replaced_parts->end());
/// Let's go to the right.
while (it != part_info_to_name.end() && part_info.contains(it->first))
{
assert(part_info != it->first);
if (out_replaced_parts)
out_replaced_parts->push_back(it->second);
it = part_info_to_name.erase(it);
}
if (it != part_info_to_name.end() && !part_info.isDisjoint(it->first))
throw Exception(ErrorCodes::LOGICAL_ERROR,
"Part {} intersects part {}. It is a bug or a result of manual intervention "
"in the ZooKeeper data.", name, it->first.getPartNameForLogs());
part_info_to_name.emplace(part_info, name);
return true;
}
bool ActiveDataPartSet::add(const MergeTreePartInfo & part_info, Strings * out_replaced_parts)
{
return add(part_info, part_info.getPartNameAndCheckFormat(format_version), out_replaced_parts);
}
String ActiveDataPartSet::getContainingPart(const MergeTreePartInfo & part_info) const
{
auto it = getContainingPartImpl(part_info);
if (it != part_info_to_name.end())
return it->second;
return {};
}
String ActiveDataPartSet::getContainingPart(const String & name) const
{
auto it = getContainingPartImpl(MergeTreePartInfo::fromPartName(name, format_version));
if (it != part_info_to_name.end())
return it->second;
return {};
}
std::map<MergeTreePartInfo, String>::const_iterator
ActiveDataPartSet::getContainingPartImpl(const MergeTreePartInfo & part_info) const
{
/// A part can only be covered/overlapped by the previous or next one in `part_info_to_name`.
auto it = part_info_to_name.lower_bound(part_info);
if (it != part_info_to_name.end())
{
if (it->first.contains(part_info))
return it;
}
if (it != part_info_to_name.begin())
{
--it;
if (it->first.contains(part_info))
return it;
}
return part_info_to_name.end();
}
Strings ActiveDataPartSet::getPartsCoveredBy(const MergeTreePartInfo & part_info) const
{
auto it_middle = part_info_to_name.lower_bound(part_info);
auto begin = it_middle;
while (begin != part_info_to_name.begin())
{
auto prev = std::prev(begin);
if (!part_info.contains(prev->first))
{
if (prev->first.contains(part_info))
return {};
break;
}
begin = prev;
}
auto end = it_middle;
while (end != part_info_to_name.end())
{
if (!part_info.contains(end->first))
{
if (end->first.contains(part_info))
return {};
break;
}
++end;
}
Strings covered;
for (auto it = begin; it != end; ++it)
covered.push_back(it->second);
return covered;
}
Strings ActiveDataPartSet::getParts() const
{
Strings res;
res.reserve(part_info_to_name.size());
for (const auto & kv : part_info_to_name)
res.push_back(kv.second);
return res;
}
std::vector<MergeTreePartInfo> ActiveDataPartSet::getPartInfos() const
{
std::vector<MergeTreePartInfo> res;
res.reserve(part_info_to_name.size());
for (const auto & kv : part_info_to_name)
res.push_back(kv.first);
return res;
}
size_t ActiveDataPartSet::size() const
{
return part_info_to_name.size();
}
}
|
