Adjacent internal btree pages can now contain the same keys at different versions.
This commit is contained in:
parent
1a71df1871
commit
c508e8bdf9
|
@ -280,17 +280,6 @@ private:
|
|||
results.push_back( {0, {{lowerBoundKey, root}}} );
|
||||
}
|
||||
|
||||
// Verify that no consecutive split keys are equal
|
||||
// TODO: Is this still needed or do keys already have version suffixes?
|
||||
StringRef lastSplitKey(LiteralStringRef("\xff\xff\xff"));
|
||||
for(auto const &p : pages) {
|
||||
if(p.first != 0) {
|
||||
StringRef splitKey = merged[p.first].key;
|
||||
ASSERT(splitKey != lastSplitKey);
|
||||
lastSplitKey = splitKey;
|
||||
}
|
||||
}
|
||||
|
||||
// For each IPage of data, assign a logical pageID.
|
||||
std::vector<LogicalPageID> logicalPages;
|
||||
|
||||
|
|
Loading…
Reference in New Issue