Summary: When dynamically linking two binaries together, different builds of RocksDB from two sources might cause errors. To provide a tool for user to solve the problem, the RocksDB namespace is changed to a flag which can be overridden in build time. Pull Request resolved: https://github.com/facebook/rocksdb/pull/6433 Test Plan: Build release, all and jtest. Try to build with ROCKSDB_NAMESPACE with another flag. Differential Revision: D19977691 fbshipit-source-id: aa7f2d0972e1c31d75339ac48478f34f6cfcfb3e
1847 lines
50 KiB
C++
1847 lines
50 KiB
C++
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
|
// This source code is licensed under both the GPLv2 (found in the
|
|
// COPYING file in the root directory) and Apache 2.0 License
|
|
// (found in the LICENSE.Apache file in the root directory).
|
|
//
|
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
#include "rocksdb/utilities/write_batch_with_index.h"
|
|
#include <map>
|
|
#include <memory>
|
|
#include "db/column_family.h"
|
|
#include "port/stack_trace.h"
|
|
#include "test_util/testharness.h"
|
|
#include "util/random.h"
|
|
#include "util/string_util.h"
|
|
#include "utilities/merge_operators.h"
|
|
#include "utilities/merge_operators/string_append/stringappend.h"
|
|
|
|
namespace ROCKSDB_NAMESPACE {
|
|
|
|
namespace {
|
|
class ColumnFamilyHandleImplDummy : public ColumnFamilyHandleImpl {
|
|
public:
|
|
explicit ColumnFamilyHandleImplDummy(int id, const Comparator* comparator)
|
|
: ColumnFamilyHandleImpl(nullptr, nullptr, nullptr),
|
|
id_(id),
|
|
comparator_(comparator) {}
|
|
uint32_t GetID() const override { return id_; }
|
|
const Comparator* GetComparator() const override { return comparator_; }
|
|
|
|
private:
|
|
uint32_t id_;
|
|
const Comparator* comparator_;
|
|
};
|
|
|
|
struct Entry {
|
|
std::string key;
|
|
std::string value;
|
|
WriteType type;
|
|
};
|
|
|
|
struct TestHandler : public WriteBatch::Handler {
|
|
std::map<uint32_t, std::vector<Entry>> seen;
|
|
Status PutCF(uint32_t column_family_id, const Slice& key,
|
|
const Slice& value) override {
|
|
Entry e;
|
|
e.key = key.ToString();
|
|
e.value = value.ToString();
|
|
e.type = kPutRecord;
|
|
seen[column_family_id].push_back(e);
|
|
return Status::OK();
|
|
}
|
|
Status MergeCF(uint32_t column_family_id, const Slice& key,
|
|
const Slice& value) override {
|
|
Entry e;
|
|
e.key = key.ToString();
|
|
e.value = value.ToString();
|
|
e.type = kMergeRecord;
|
|
seen[column_family_id].push_back(e);
|
|
return Status::OK();
|
|
}
|
|
void LogData(const Slice& /*blob*/) override {}
|
|
Status DeleteCF(uint32_t column_family_id, const Slice& key) override {
|
|
Entry e;
|
|
e.key = key.ToString();
|
|
e.value = "";
|
|
e.type = kDeleteRecord;
|
|
seen[column_family_id].push_back(e);
|
|
return Status::OK();
|
|
}
|
|
};
|
|
} // namespace anonymous
|
|
|
|
class WriteBatchWithIndexTest : public testing::Test {};
|
|
|
|
void TestValueAsSecondaryIndexHelper(std::vector<Entry> entries,
|
|
WriteBatchWithIndex* batch) {
|
|
// In this test, we insert <key, value> to column family `data`, and
|
|
// <value, key> to column family `index`. Then iterator them in order
|
|
// and seek them by key.
|
|
|
|
// Sort entries by key
|
|
std::map<std::string, std::vector<Entry*>> data_map;
|
|
// Sort entries by value
|
|
std::map<std::string, std::vector<Entry*>> index_map;
|
|
for (auto& e : entries) {
|
|
data_map[e.key].push_back(&e);
|
|
index_map[e.value].push_back(&e);
|
|
}
|
|
|
|
ColumnFamilyHandleImplDummy data(6, BytewiseComparator());
|
|
ColumnFamilyHandleImplDummy index(8, BytewiseComparator());
|
|
for (auto& e : entries) {
|
|
if (e.type == kPutRecord) {
|
|
batch->Put(&data, e.key, e.value);
|
|
batch->Put(&index, e.value, e.key);
|
|
} else if (e.type == kMergeRecord) {
|
|
batch->Merge(&data, e.key, e.value);
|
|
batch->Put(&index, e.value, e.key);
|
|
} else {
|
|
assert(e.type == kDeleteRecord);
|
|
std::unique_ptr<WBWIIterator> iter(batch->NewIterator(&data));
|
|
iter->Seek(e.key);
|
|
ASSERT_OK(iter->status());
|
|
auto write_entry = iter->Entry();
|
|
ASSERT_EQ(e.key, write_entry.key.ToString());
|
|
ASSERT_EQ(e.value, write_entry.value.ToString());
|
|
batch->Delete(&data, e.key);
|
|
batch->Put(&index, e.value, "");
|
|
}
|
|
}
|
|
|
|
// Iterator all keys
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch->NewIterator(&data));
|
|
for (int seek_to_first : {0, 1}) {
|
|
if (seek_to_first) {
|
|
iter->SeekToFirst();
|
|
} else {
|
|
iter->Seek("");
|
|
}
|
|
for (auto pair : data_map) {
|
|
for (auto v : pair.second) {
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
auto write_entry = iter->Entry();
|
|
ASSERT_EQ(pair.first, write_entry.key.ToString());
|
|
ASSERT_EQ(v->type, write_entry.type);
|
|
if (write_entry.type != kDeleteRecord) {
|
|
ASSERT_EQ(v->value, write_entry.value.ToString());
|
|
}
|
|
iter->Next();
|
|
}
|
|
}
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
iter->SeekToLast();
|
|
for (auto pair = data_map.rbegin(); pair != data_map.rend(); ++pair) {
|
|
for (auto v = pair->second.rbegin(); v != pair->second.rend(); v++) {
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
auto write_entry = iter->Entry();
|
|
ASSERT_EQ(pair->first, write_entry.key.ToString());
|
|
ASSERT_EQ((*v)->type, write_entry.type);
|
|
if (write_entry.type != kDeleteRecord) {
|
|
ASSERT_EQ((*v)->value, write_entry.value.ToString());
|
|
}
|
|
iter->Prev();
|
|
}
|
|
}
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
// Iterator all indexes
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch->NewIterator(&index));
|
|
for (int seek_to_first : {0, 1}) {
|
|
if (seek_to_first) {
|
|
iter->SeekToFirst();
|
|
} else {
|
|
iter->Seek("");
|
|
}
|
|
for (auto pair : index_map) {
|
|
for (auto v : pair.second) {
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
auto write_entry = iter->Entry();
|
|
ASSERT_EQ(pair.first, write_entry.key.ToString());
|
|
if (v->type != kDeleteRecord) {
|
|
ASSERT_EQ(v->key, write_entry.value.ToString());
|
|
ASSERT_EQ(v->value, write_entry.key.ToString());
|
|
}
|
|
iter->Next();
|
|
}
|
|
}
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
iter->SeekToLast();
|
|
for (auto pair = index_map.rbegin(); pair != index_map.rend(); ++pair) {
|
|
for (auto v = pair->second.rbegin(); v != pair->second.rend(); v++) {
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
auto write_entry = iter->Entry();
|
|
ASSERT_EQ(pair->first, write_entry.key.ToString());
|
|
if ((*v)->type != kDeleteRecord) {
|
|
ASSERT_EQ((*v)->key, write_entry.value.ToString());
|
|
ASSERT_EQ((*v)->value, write_entry.key.ToString());
|
|
}
|
|
iter->Prev();
|
|
}
|
|
}
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
// Seek to every key
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch->NewIterator(&data));
|
|
|
|
// Seek the keys one by one in reverse order
|
|
for (auto pair = data_map.rbegin(); pair != data_map.rend(); ++pair) {
|
|
iter->Seek(pair->first);
|
|
ASSERT_OK(iter->status());
|
|
for (auto v : pair->second) {
|
|
ASSERT_TRUE(iter->Valid());
|
|
auto write_entry = iter->Entry();
|
|
ASSERT_EQ(pair->first, write_entry.key.ToString());
|
|
ASSERT_EQ(v->type, write_entry.type);
|
|
if (write_entry.type != kDeleteRecord) {
|
|
ASSERT_EQ(v->value, write_entry.value.ToString());
|
|
}
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
}
|
|
}
|
|
}
|
|
|
|
// Seek to every index
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch->NewIterator(&index));
|
|
|
|
// Seek the keys one by one in reverse order
|
|
for (auto pair = index_map.rbegin(); pair != index_map.rend(); ++pair) {
|
|
iter->Seek(pair->first);
|
|
ASSERT_OK(iter->status());
|
|
for (auto v : pair->second) {
|
|
ASSERT_TRUE(iter->Valid());
|
|
auto write_entry = iter->Entry();
|
|
ASSERT_EQ(pair->first, write_entry.key.ToString());
|
|
ASSERT_EQ(v->value, write_entry.key.ToString());
|
|
if (v->type != kDeleteRecord) {
|
|
ASSERT_EQ(v->key, write_entry.value.ToString());
|
|
}
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
}
|
|
}
|
|
}
|
|
|
|
// Verify WriteBatch can be iterated
|
|
TestHandler handler;
|
|
batch->GetWriteBatch()->Iterate(&handler);
|
|
|
|
// Verify data column family
|
|
{
|
|
ASSERT_EQ(entries.size(), handler.seen[data.GetID()].size());
|
|
size_t i = 0;
|
|
for (auto e : handler.seen[data.GetID()]) {
|
|
auto write_entry = entries[i++];
|
|
ASSERT_EQ(e.type, write_entry.type);
|
|
ASSERT_EQ(e.key, write_entry.key);
|
|
if (e.type != kDeleteRecord) {
|
|
ASSERT_EQ(e.value, write_entry.value);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Verify index column family
|
|
{
|
|
ASSERT_EQ(entries.size(), handler.seen[index.GetID()].size());
|
|
size_t i = 0;
|
|
for (auto e : handler.seen[index.GetID()]) {
|
|
auto write_entry = entries[i++];
|
|
ASSERT_EQ(e.key, write_entry.value);
|
|
if (write_entry.type != kDeleteRecord) {
|
|
ASSERT_EQ(e.value, write_entry.key);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestValueAsSecondaryIndex) {
|
|
Entry entries[] = {
|
|
{"aaa", "0005", kPutRecord},
|
|
{"b", "0002", kPutRecord},
|
|
{"cdd", "0002", kMergeRecord},
|
|
{"aab", "00001", kPutRecord},
|
|
{"cc", "00005", kPutRecord},
|
|
{"cdd", "0002", kPutRecord},
|
|
{"aab", "0003", kPutRecord},
|
|
{"cc", "00005", kDeleteRecord},
|
|
};
|
|
std::vector<Entry> entries_list(entries, entries + 8);
|
|
|
|
WriteBatchWithIndex batch(nullptr, 20);
|
|
|
|
TestValueAsSecondaryIndexHelper(entries_list, &batch);
|
|
|
|
// Clear batch and re-run test with new values
|
|
batch.Clear();
|
|
|
|
Entry new_entries[] = {
|
|
{"aaa", "0005", kPutRecord},
|
|
{"e", "0002", kPutRecord},
|
|
{"add", "0002", kMergeRecord},
|
|
{"aab", "00001", kPutRecord},
|
|
{"zz", "00005", kPutRecord},
|
|
{"add", "0002", kPutRecord},
|
|
{"aab", "0003", kPutRecord},
|
|
{"zz", "00005", kDeleteRecord},
|
|
};
|
|
|
|
entries_list = std::vector<Entry>(new_entries, new_entries + 8);
|
|
|
|
TestValueAsSecondaryIndexHelper(entries_list, &batch);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestComparatorForCF) {
|
|
ColumnFamilyHandleImplDummy cf1(6, nullptr);
|
|
ColumnFamilyHandleImplDummy reverse_cf(66, ReverseBytewiseComparator());
|
|
ColumnFamilyHandleImplDummy cf2(88, BytewiseComparator());
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 20);
|
|
|
|
batch.Put(&cf1, "ddd", "");
|
|
batch.Put(&cf2, "aaa", "");
|
|
batch.Put(&cf2, "eee", "");
|
|
batch.Put(&cf1, "ccc", "");
|
|
batch.Put(&reverse_cf, "a11", "");
|
|
batch.Put(&cf1, "bbb", "");
|
|
|
|
Slice key_slices[] = {"a", "3", "3"};
|
|
Slice value_slice = "";
|
|
batch.Put(&reverse_cf, SliceParts(key_slices, 3),
|
|
SliceParts(&value_slice, 1));
|
|
batch.Put(&reverse_cf, "a22", "");
|
|
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch.NewIterator(&cf1));
|
|
iter->Seek("");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("bbb", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("ccc", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("ddd", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch.NewIterator(&cf2));
|
|
iter->Seek("");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("aaa", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("eee", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch.NewIterator(&reverse_cf));
|
|
iter->Seek("");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("z");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a33", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a22", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a11", iter->Entry().key.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("a22");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a22", iter->Entry().key.ToString());
|
|
|
|
iter->Seek("a13");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a11", iter->Entry().key.ToString());
|
|
}
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestOverwriteKey) {
|
|
ColumnFamilyHandleImplDummy cf1(6, nullptr);
|
|
ColumnFamilyHandleImplDummy reverse_cf(66, ReverseBytewiseComparator());
|
|
ColumnFamilyHandleImplDummy cf2(88, BytewiseComparator());
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 20, true);
|
|
|
|
batch.Put(&cf1, "ddd", "");
|
|
batch.Merge(&cf1, "ddd", "");
|
|
batch.Delete(&cf1, "ddd");
|
|
batch.Put(&cf2, "aaa", "");
|
|
batch.Delete(&cf2, "aaa");
|
|
batch.Put(&cf2, "aaa", "aaa");
|
|
batch.Put(&cf2, "eee", "eee");
|
|
batch.Put(&cf1, "ccc", "");
|
|
batch.Put(&reverse_cf, "a11", "");
|
|
batch.Delete(&cf1, "ccc");
|
|
batch.Put(&reverse_cf, "a33", "a33");
|
|
batch.Put(&reverse_cf, "a11", "a11");
|
|
Slice slices[] = {"a", "3", "3"};
|
|
batch.Delete(&reverse_cf, SliceParts(slices, 3));
|
|
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch.NewIterator(&cf1));
|
|
iter->Seek("");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("ccc", iter->Entry().key.ToString());
|
|
ASSERT_TRUE(iter->Entry().type == WriteType::kDeleteRecord);
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("ddd", iter->Entry().key.ToString());
|
|
ASSERT_TRUE(iter->Entry().type == WriteType::kDeleteRecord);
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch.NewIterator(&cf2));
|
|
iter->SeekToLast();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("eee", iter->Entry().key.ToString());
|
|
ASSERT_EQ("eee", iter->Entry().value.ToString());
|
|
iter->Prev();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("aaa", iter->Entry().key.ToString());
|
|
ASSERT_EQ("aaa", iter->Entry().value.ToString());
|
|
iter->Prev();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->SeekToFirst();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("aaa", iter->Entry().key.ToString());
|
|
ASSERT_EQ("aaa", iter->Entry().value.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("eee", iter->Entry().key.ToString());
|
|
ASSERT_EQ("eee", iter->Entry().value.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
{
|
|
std::unique_ptr<WBWIIterator> iter(batch.NewIterator(&reverse_cf));
|
|
iter->Seek("");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("z");
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a33", iter->Entry().key.ToString());
|
|
ASSERT_TRUE(iter->Entry().type == WriteType::kDeleteRecord);
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a11", iter->Entry().key.ToString());
|
|
ASSERT_EQ("a11", iter->Entry().value.ToString());
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->SeekToLast();
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a11", iter->Entry().key.ToString());
|
|
ASSERT_EQ("a11", iter->Entry().value.ToString());
|
|
iter->Prev();
|
|
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ("a33", iter->Entry().key.ToString());
|
|
ASSERT_TRUE(iter->Entry().type == WriteType::kDeleteRecord);
|
|
iter->Prev();
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
}
|
|
|
|
namespace {
|
|
typedef std::map<std::string, std::string> KVMap;
|
|
|
|
class KVIter : public Iterator {
|
|
public:
|
|
explicit KVIter(const KVMap* map) : map_(map), iter_(map_->end()) {}
|
|
bool Valid() const override { return iter_ != map_->end(); }
|
|
void SeekToFirst() override { iter_ = map_->begin(); }
|
|
void SeekToLast() override {
|
|
if (map_->empty()) {
|
|
iter_ = map_->end();
|
|
} else {
|
|
iter_ = map_->find(map_->rbegin()->first);
|
|
}
|
|
}
|
|
void Seek(const Slice& k) override {
|
|
iter_ = map_->lower_bound(k.ToString());
|
|
}
|
|
void SeekForPrev(const Slice& k) override {
|
|
iter_ = map_->upper_bound(k.ToString());
|
|
Prev();
|
|
}
|
|
void Next() override { ++iter_; }
|
|
void Prev() override {
|
|
if (iter_ == map_->begin()) {
|
|
iter_ = map_->end();
|
|
return;
|
|
}
|
|
--iter_;
|
|
}
|
|
|
|
Slice key() const override { return iter_->first; }
|
|
Slice value() const override { return iter_->second; }
|
|
Status status() const override { return Status::OK(); }
|
|
|
|
private:
|
|
const KVMap* const map_;
|
|
KVMap::const_iterator iter_;
|
|
};
|
|
|
|
void AssertIter(Iterator* iter, const std::string& key,
|
|
const std::string& value) {
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ(key, iter->key().ToString());
|
|
ASSERT_EQ(value, iter->value().ToString());
|
|
}
|
|
|
|
void AssertItersEqual(Iterator* iter1, Iterator* iter2) {
|
|
ASSERT_EQ(iter1->Valid(), iter2->Valid());
|
|
if (iter1->Valid()) {
|
|
ASSERT_EQ(iter1->key().ToString(), iter2->key().ToString());
|
|
ASSERT_EQ(iter1->value().ToString(), iter2->value().ToString());
|
|
}
|
|
}
|
|
} // namespace
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestRandomIteraratorWithBase) {
|
|
std::vector<std::string> source_strings = {"a", "b", "c", "d", "e",
|
|
"f", "g", "h", "i", "j"};
|
|
for (int rand_seed = 301; rand_seed < 366; rand_seed++) {
|
|
Random rnd(rand_seed);
|
|
|
|
ColumnFamilyHandleImplDummy cf1(6, BytewiseComparator());
|
|
ColumnFamilyHandleImplDummy cf2(2, BytewiseComparator());
|
|
ColumnFamilyHandleImplDummy cf3(8, BytewiseComparator());
|
|
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 20, true);
|
|
|
|
if (rand_seed % 2 == 0) {
|
|
batch.Put(&cf2, "zoo", "bar");
|
|
}
|
|
if (rand_seed % 4 == 1) {
|
|
batch.Put(&cf3, "zoo", "bar");
|
|
}
|
|
|
|
KVMap map;
|
|
KVMap merged_map;
|
|
for (auto key : source_strings) {
|
|
std::string value = key + key;
|
|
int type = rnd.Uniform(6);
|
|
switch (type) {
|
|
case 0:
|
|
// only base has it
|
|
map[key] = value;
|
|
merged_map[key] = value;
|
|
break;
|
|
case 1:
|
|
// only delta has it
|
|
batch.Put(&cf1, key, value);
|
|
map[key] = value;
|
|
merged_map[key] = value;
|
|
break;
|
|
case 2:
|
|
// both has it. Delta should win
|
|
batch.Put(&cf1, key, value);
|
|
map[key] = "wrong_value";
|
|
merged_map[key] = value;
|
|
break;
|
|
case 3:
|
|
// both has it. Delta is delete
|
|
batch.Delete(&cf1, key);
|
|
map[key] = "wrong_value";
|
|
break;
|
|
case 4:
|
|
// only delta has it. Delta is delete
|
|
batch.Delete(&cf1, key);
|
|
map[key] = "wrong_value";
|
|
break;
|
|
default:
|
|
// Neither iterator has it.
|
|
break;
|
|
}
|
|
}
|
|
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(&cf1, new KVIter(&map)));
|
|
std::unique_ptr<Iterator> result_iter(new KVIter(&merged_map));
|
|
|
|
bool is_valid = false;
|
|
for (int i = 0; i < 128; i++) {
|
|
// Random walk and make sure iter and result_iter returns the
|
|
// same key and value
|
|
int type = rnd.Uniform(6);
|
|
ASSERT_OK(iter->status());
|
|
switch (type) {
|
|
case 0:
|
|
// Seek to First
|
|
iter->SeekToFirst();
|
|
result_iter->SeekToFirst();
|
|
break;
|
|
case 1:
|
|
// Seek to last
|
|
iter->SeekToLast();
|
|
result_iter->SeekToLast();
|
|
break;
|
|
case 2: {
|
|
// Seek to random key
|
|
auto key_idx = rnd.Uniform(static_cast<int>(source_strings.size()));
|
|
auto key = source_strings[key_idx];
|
|
iter->Seek(key);
|
|
result_iter->Seek(key);
|
|
break;
|
|
}
|
|
case 3: {
|
|
// SeekForPrev to random key
|
|
auto key_idx = rnd.Uniform(static_cast<int>(source_strings.size()));
|
|
auto key = source_strings[key_idx];
|
|
iter->SeekForPrev(key);
|
|
result_iter->SeekForPrev(key);
|
|
break;
|
|
}
|
|
case 4:
|
|
// Next
|
|
if (is_valid) {
|
|
iter->Next();
|
|
result_iter->Next();
|
|
} else {
|
|
continue;
|
|
}
|
|
break;
|
|
default:
|
|
assert(type == 5);
|
|
// Prev
|
|
if (is_valid) {
|
|
iter->Prev();
|
|
result_iter->Prev();
|
|
} else {
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
AssertItersEqual(iter.get(), result_iter.get());
|
|
is_valid = iter->Valid();
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestIteraratorWithBase) {
|
|
ColumnFamilyHandleImplDummy cf1(6, BytewiseComparator());
|
|
ColumnFamilyHandleImplDummy cf2(2, BytewiseComparator());
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 20, true);
|
|
|
|
{
|
|
KVMap map;
|
|
map["a"] = "aa";
|
|
map["c"] = "cc";
|
|
map["e"] = "ee";
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(&cf1, new KVIter(&map)));
|
|
|
|
iter->SeekToFirst();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "e", "ee");
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->SeekToLast();
|
|
AssertIter(iter.get(), "e", "ee");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Prev();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("b");
|
|
AssertIter(iter.get(), "c", "cc");
|
|
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
|
|
iter->Seek("a");
|
|
AssertIter(iter.get(), "a", "aa");
|
|
}
|
|
|
|
// Test the case that there is one element in the write batch
|
|
batch.Put(&cf2, "zoo", "bar");
|
|
batch.Put(&cf1, "a", "aa");
|
|
{
|
|
KVMap empty_map;
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(&cf1, new KVIter(&empty_map)));
|
|
|
|
iter->SeekToFirst();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
batch.Delete(&cf1, "b");
|
|
batch.Put(&cf1, "c", "cc");
|
|
batch.Put(&cf1, "d", "dd");
|
|
batch.Delete(&cf1, "e");
|
|
|
|
{
|
|
KVMap map;
|
|
map["b"] = "";
|
|
map["cc"] = "cccc";
|
|
map["f"] = "ff";
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(&cf1, new KVIter(&map)));
|
|
|
|
iter->SeekToFirst();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "cc", "cccc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "d", "dd");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "f", "ff");
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->SeekToLast();
|
|
AssertIter(iter.get(), "f", "ff");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "d", "dd");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "cc", "cccc");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "cc", "cccc");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Prev();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("c");
|
|
AssertIter(iter.get(), "c", "cc");
|
|
|
|
iter->Seek("cb");
|
|
AssertIter(iter.get(), "cc", "cccc");
|
|
|
|
iter->Seek("cc");
|
|
AssertIter(iter.get(), "cc", "cccc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "d", "dd");
|
|
|
|
iter->Seek("e");
|
|
AssertIter(iter.get(), "f", "ff");
|
|
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "d", "dd");
|
|
|
|
iter->Next();
|
|
AssertIter(iter.get(), "f", "ff");
|
|
}
|
|
|
|
{
|
|
KVMap empty_map;
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(&cf1, new KVIter(&empty_map)));
|
|
|
|
iter->SeekToFirst();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "d", "dd");
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->SeekToLast();
|
|
AssertIter(iter.get(), "d", "dd");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
|
|
iter->Prev();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("aa");
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "d", "dd");
|
|
|
|
iter->Seek("ca");
|
|
AssertIter(iter.get(), "d", "dd");
|
|
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
}
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestIteraratorWithBaseReverseCmp) {
|
|
ColumnFamilyHandleImplDummy cf1(6, ReverseBytewiseComparator());
|
|
ColumnFamilyHandleImplDummy cf2(2, ReverseBytewiseComparator());
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 20, true);
|
|
|
|
// Test the case that there is one element in the write batch
|
|
batch.Put(&cf2, "zoo", "bar");
|
|
batch.Put(&cf1, "a", "aa");
|
|
{
|
|
KVMap empty_map;
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(&cf1, new KVIter(&empty_map)));
|
|
|
|
iter->SeekToFirst();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
}
|
|
|
|
batch.Put(&cf1, "c", "cc");
|
|
{
|
|
KVMap map;
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(&cf1, new KVIter(&map)));
|
|
|
|
iter->SeekToFirst();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->SeekToLast();
|
|
AssertIter(iter.get(), "a", "aa");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
iter->Prev();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("b");
|
|
AssertIter(iter.get(), "a", "aa");
|
|
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "c", "cc");
|
|
|
|
iter->Seek("a");
|
|
AssertIter(iter.get(), "a", "aa");
|
|
}
|
|
|
|
// default column family
|
|
batch.Put("a", "b");
|
|
{
|
|
KVMap map;
|
|
map["b"] = "";
|
|
std::unique_ptr<Iterator> iter(batch.NewIteratorWithBase(new KVIter(&map)));
|
|
|
|
iter->SeekToFirst();
|
|
AssertIter(iter.get(), "a", "b");
|
|
iter->Next();
|
|
AssertIter(iter.get(), "b", "");
|
|
iter->Next();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->SeekToLast();
|
|
AssertIter(iter.get(), "b", "");
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "a", "b");
|
|
iter->Prev();
|
|
ASSERT_OK(iter->status());
|
|
ASSERT_TRUE(!iter->Valid());
|
|
|
|
iter->Seek("b");
|
|
AssertIter(iter.get(), "b", "");
|
|
|
|
iter->Prev();
|
|
AssertIter(iter.get(), "a", "b");
|
|
|
|
iter->Seek("0");
|
|
AssertIter(iter.get(), "a", "b");
|
|
}
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestGetFromBatch) {
|
|
Options options;
|
|
WriteBatchWithIndex batch;
|
|
Status s;
|
|
std::string value;
|
|
|
|
s = batch.GetFromBatch(options, "b", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
batch.Put("a", "a");
|
|
batch.Put("b", "b");
|
|
batch.Put("c", "c");
|
|
batch.Put("a", "z");
|
|
batch.Delete("c");
|
|
batch.Delete("d");
|
|
batch.Delete("e");
|
|
batch.Put("e", "e");
|
|
|
|
s = batch.GetFromBatch(options, "b", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("b", value);
|
|
|
|
s = batch.GetFromBatch(options, "a", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("z", value);
|
|
|
|
s = batch.GetFromBatch(options, "c", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
s = batch.GetFromBatch(options, "d", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
s = batch.GetFromBatch(options, "x", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
s = batch.GetFromBatch(options, "e", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("e", value);
|
|
|
|
batch.Merge("z", "z");
|
|
|
|
s = batch.GetFromBatch(options, "z", &value);
|
|
ASSERT_NOK(s); // No merge operator specified.
|
|
|
|
s = batch.GetFromBatch(options, "b", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("b", value);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestGetFromBatchMerge) {
|
|
DB* db;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
options.create_if_missing = true;
|
|
|
|
std::string dbname = test::PerThreadDBPath("write_batch_with_index_test");
|
|
|
|
DestroyDB(dbname, options);
|
|
Status s = DB::Open(options, dbname, &db);
|
|
ASSERT_OK(s);
|
|
|
|
ColumnFamilyHandle* column_family = db->DefaultColumnFamily();
|
|
WriteBatchWithIndex batch;
|
|
std::string value;
|
|
|
|
s = batch.GetFromBatch(options, "x", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
batch.Put("x", "X");
|
|
std::string expected = "X";
|
|
|
|
for (int i = 0; i < 5; i++) {
|
|
batch.Merge("x", ToString(i));
|
|
expected = expected + "," + ToString(i);
|
|
|
|
if (i % 2 == 0) {
|
|
batch.Put("y", ToString(i / 2));
|
|
}
|
|
|
|
batch.Merge("z", "z");
|
|
|
|
s = batch.GetFromBatch(column_family, options, "x", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ(expected, value);
|
|
|
|
s = batch.GetFromBatch(column_family, options, "y", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ(ToString(i / 2), value);
|
|
|
|
s = batch.GetFromBatch(column_family, options, "z", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
}
|
|
|
|
delete db;
|
|
DestroyDB(dbname, options);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestGetFromBatchMerge2) {
|
|
DB* db;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
options.create_if_missing = true;
|
|
|
|
std::string dbname = test::PerThreadDBPath("write_batch_with_index_test");
|
|
|
|
DestroyDB(dbname, options);
|
|
Status s = DB::Open(options, dbname, &db);
|
|
ASSERT_OK(s);
|
|
|
|
ColumnFamilyHandle* column_family = db->DefaultColumnFamily();
|
|
|
|
// Test batch with overwrite_key=true
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 0, true);
|
|
std::string value;
|
|
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
batch.Put(column_family, "X", "x");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("x", value);
|
|
|
|
batch.Put(column_family, "X", "x2");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("x2", value);
|
|
|
|
batch.Merge(column_family, "X", "aaa");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
|
|
batch.Merge(column_family, "X", "bbb");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
|
|
batch.Put(column_family, "X", "x3");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("x3", value);
|
|
|
|
batch.Merge(column_family, "X", "ccc");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
|
|
batch.Delete(column_family, "X");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
batch.Merge(column_family, "X", "ddd");
|
|
s = batch.GetFromBatch(column_family, options, "X", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
|
|
delete db;
|
|
DestroyDB(dbname, options);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestGetFromBatchAndDB) {
|
|
DB* db;
|
|
Options options;
|
|
options.create_if_missing = true;
|
|
std::string dbname = test::PerThreadDBPath("write_batch_with_index_test");
|
|
|
|
DestroyDB(dbname, options);
|
|
Status s = DB::Open(options, dbname, &db);
|
|
ASSERT_OK(s);
|
|
|
|
WriteBatchWithIndex batch;
|
|
ReadOptions read_options;
|
|
WriteOptions write_options;
|
|
std::string value;
|
|
|
|
s = db->Put(write_options, "a", "a");
|
|
ASSERT_OK(s);
|
|
|
|
s = db->Put(write_options, "b", "b");
|
|
ASSERT_OK(s);
|
|
|
|
s = db->Put(write_options, "c", "c");
|
|
ASSERT_OK(s);
|
|
|
|
batch.Put("a", "batch.a");
|
|
batch.Delete("b");
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "a", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("batch.a", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "b", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "c", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("c", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "x", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
db->Delete(write_options, "x");
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "x", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
delete db;
|
|
DestroyDB(dbname, options);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestGetFromBatchAndDBMerge) {
|
|
DB* db;
|
|
Options options;
|
|
|
|
options.create_if_missing = true;
|
|
std::string dbname = test::PerThreadDBPath("write_batch_with_index_test");
|
|
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
DestroyDB(dbname, options);
|
|
Status s = DB::Open(options, dbname, &db);
|
|
assert(s.ok());
|
|
|
|
WriteBatchWithIndex batch;
|
|
ReadOptions read_options;
|
|
WriteOptions write_options;
|
|
std::string value;
|
|
|
|
s = db->Put(write_options, "a", "a0");
|
|
ASSERT_OK(s);
|
|
|
|
s = db->Put(write_options, "b", "b0");
|
|
ASSERT_OK(s);
|
|
|
|
s = db->Merge(write_options, "b", "b1");
|
|
ASSERT_OK(s);
|
|
|
|
s = db->Merge(write_options, "c", "c0");
|
|
ASSERT_OK(s);
|
|
|
|
s = db->Merge(write_options, "d", "d0");
|
|
ASSERT_OK(s);
|
|
|
|
batch.Merge("a", "a1");
|
|
batch.Merge("a", "a2");
|
|
batch.Merge("b", "b2");
|
|
batch.Merge("d", "d1");
|
|
batch.Merge("e", "e0");
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "a", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("a0,a1,a2", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "b", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("b0,b1,b2", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "c", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("c0", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "d", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("d0,d1", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "e", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("e0", value);
|
|
|
|
s = db->Delete(write_options, "x");
|
|
ASSERT_OK(s);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "x", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
const Snapshot* snapshot = db->GetSnapshot();
|
|
ReadOptions snapshot_read_options;
|
|
snapshot_read_options.snapshot = snapshot;
|
|
|
|
s = db->Delete(write_options, "a");
|
|
ASSERT_OK(s);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "a", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("a1,a2", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, snapshot_read_options, "a", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("a0,a1,a2", value);
|
|
|
|
batch.Delete("a");
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "a", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
s = batch.GetFromBatchAndDB(db, snapshot_read_options, "a", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
s = db->Merge(write_options, "c", "c1");
|
|
ASSERT_OK(s);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "c", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("c0,c1", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, snapshot_read_options, "c", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("c0", value);
|
|
|
|
s = db->Put(write_options, "e", "e1");
|
|
ASSERT_OK(s);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "e", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("e1,e0", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, snapshot_read_options, "e", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("e0", value);
|
|
|
|
s = db->Delete(write_options, "e");
|
|
ASSERT_OK(s);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "e", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("e0", value);
|
|
|
|
s = batch.GetFromBatchAndDB(db, snapshot_read_options, "e", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("e0", value);
|
|
|
|
db->ReleaseSnapshot(snapshot);
|
|
delete db;
|
|
DestroyDB(dbname, options);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestGetFromBatchAndDBMerge2) {
|
|
DB* db;
|
|
Options options;
|
|
|
|
options.create_if_missing = true;
|
|
std::string dbname = test::PerThreadDBPath("write_batch_with_index_test");
|
|
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
DestroyDB(dbname, options);
|
|
Status s = DB::Open(options, dbname, &db);
|
|
assert(s.ok());
|
|
|
|
// Test batch with overwrite_key=true
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 0, true);
|
|
|
|
ReadOptions read_options;
|
|
WriteOptions write_options;
|
|
std::string value;
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "A", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
batch.Merge("A", "xxx");
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "A", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
|
|
batch.Merge("A", "yyy");
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "A", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
|
|
s = db->Put(write_options, "A", "a0");
|
|
ASSERT_OK(s);
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "A", &value);
|
|
ASSERT_TRUE(s.IsMergeInProgress());
|
|
|
|
batch.Delete("A");
|
|
|
|
s = batch.GetFromBatchAndDB(db, read_options, "A", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
delete db;
|
|
DestroyDB(dbname, options);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, TestGetFromBatchAndDBMerge3) {
|
|
DB* db;
|
|
Options options;
|
|
|
|
options.create_if_missing = true;
|
|
std::string dbname = test::PerThreadDBPath("write_batch_with_index_test");
|
|
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
DestroyDB(dbname, options);
|
|
Status s = DB::Open(options, dbname, &db);
|
|
assert(s.ok());
|
|
|
|
ReadOptions read_options;
|
|
WriteOptions write_options;
|
|
FlushOptions flush_options;
|
|
std::string value;
|
|
|
|
WriteBatchWithIndex batch;
|
|
|
|
ASSERT_OK(db->Put(write_options, "A", "1"));
|
|
ASSERT_OK(db->Flush(flush_options, db->DefaultColumnFamily()));
|
|
ASSERT_OK(batch.Merge("A", "2"));
|
|
|
|
ASSERT_OK(batch.GetFromBatchAndDB(db, read_options, "A", &value));
|
|
ASSERT_EQ(value, "1,2");
|
|
|
|
delete db;
|
|
DestroyDB(dbname, options);
|
|
}
|
|
|
|
void AssertKey(std::string key, WBWIIterator* iter) {
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ(key, iter->Entry().key.ToString());
|
|
}
|
|
|
|
void AssertValue(std::string value, WBWIIterator* iter) {
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ(value, iter->Entry().value.ToString());
|
|
}
|
|
|
|
// Tests that we can write to the WBWI while we iterate (from a single thread).
|
|
// iteration should see the newest writes
|
|
TEST_F(WriteBatchWithIndexTest, MutateWhileIteratingCorrectnessTest) {
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 0, true);
|
|
for (char c = 'a'; c <= 'z'; ++c) {
|
|
batch.Put(std::string(1, c), std::string(1, c));
|
|
}
|
|
|
|
std::unique_ptr<WBWIIterator> iter(batch.NewIterator());
|
|
iter->Seek("k");
|
|
AssertKey("k", iter.get());
|
|
iter->Next();
|
|
AssertKey("l", iter.get());
|
|
batch.Put("ab", "cc");
|
|
iter->Next();
|
|
AssertKey("m", iter.get());
|
|
batch.Put("mm", "kk");
|
|
iter->Next();
|
|
AssertKey("mm", iter.get());
|
|
AssertValue("kk", iter.get());
|
|
batch.Delete("mm");
|
|
|
|
iter->Next();
|
|
AssertKey("n", iter.get());
|
|
iter->Prev();
|
|
AssertKey("mm", iter.get());
|
|
ASSERT_EQ(kDeleteRecord, iter->Entry().type);
|
|
|
|
iter->Seek("ab");
|
|
AssertKey("ab", iter.get());
|
|
batch.Delete("x");
|
|
iter->Seek("x");
|
|
AssertKey("x", iter.get());
|
|
ASSERT_EQ(kDeleteRecord, iter->Entry().type);
|
|
iter->Prev();
|
|
AssertKey("w", iter.get());
|
|
}
|
|
|
|
void AssertIterKey(std::string key, Iterator* iter) {
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ(key, iter->key().ToString());
|
|
}
|
|
|
|
void AssertIterValue(std::string value, Iterator* iter) {
|
|
ASSERT_TRUE(iter->Valid());
|
|
ASSERT_EQ(value, iter->value().ToString());
|
|
}
|
|
|
|
// same thing as above, but testing IteratorWithBase
|
|
TEST_F(WriteBatchWithIndexTest, MutateWhileIteratingBaseCorrectnessTest) {
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 0, true);
|
|
for (char c = 'a'; c <= 'z'; ++c) {
|
|
batch.Put(std::string(1, c), std::string(1, c));
|
|
}
|
|
|
|
KVMap map;
|
|
map["aa"] = "aa";
|
|
map["cc"] = "cc";
|
|
map["ee"] = "ee";
|
|
map["em"] = "me";
|
|
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(new KVIter(&map)));
|
|
iter->Seek("k");
|
|
AssertIterKey("k", iter.get());
|
|
iter->Next();
|
|
AssertIterKey("l", iter.get());
|
|
batch.Put("ab", "cc");
|
|
iter->Next();
|
|
AssertIterKey("m", iter.get());
|
|
batch.Put("mm", "kk");
|
|
iter->Next();
|
|
AssertIterKey("mm", iter.get());
|
|
AssertIterValue("kk", iter.get());
|
|
batch.Delete("mm");
|
|
iter->Next();
|
|
AssertIterKey("n", iter.get());
|
|
iter->Prev();
|
|
// "mm" is deleted, so we're back at "m"
|
|
AssertIterKey("m", iter.get());
|
|
|
|
iter->Seek("ab");
|
|
AssertIterKey("ab", iter.get());
|
|
iter->Prev();
|
|
AssertIterKey("aa", iter.get());
|
|
iter->Prev();
|
|
AssertIterKey("a", iter.get());
|
|
batch.Delete("aa");
|
|
iter->Next();
|
|
AssertIterKey("ab", iter.get());
|
|
iter->Prev();
|
|
AssertIterKey("a", iter.get());
|
|
|
|
batch.Delete("x");
|
|
iter->Seek("x");
|
|
AssertIterKey("y", iter.get());
|
|
iter->Next();
|
|
AssertIterKey("z", iter.get());
|
|
iter->Prev();
|
|
iter->Prev();
|
|
AssertIterKey("w", iter.get());
|
|
|
|
batch.Delete("e");
|
|
iter->Seek("e");
|
|
AssertIterKey("ee", iter.get());
|
|
AssertIterValue("ee", iter.get());
|
|
batch.Put("ee", "xx");
|
|
// still the same value
|
|
AssertIterValue("ee", iter.get());
|
|
iter->Next();
|
|
AssertIterKey("em", iter.get());
|
|
iter->Prev();
|
|
// new value
|
|
AssertIterValue("xx", iter.get());
|
|
}
|
|
|
|
// stress testing mutations with IteratorWithBase
|
|
TEST_F(WriteBatchWithIndexTest, MutateWhileIteratingBaseStressTest) {
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 0, true);
|
|
for (char c = 'a'; c <= 'z'; ++c) {
|
|
batch.Put(std::string(1, c), std::string(1, c));
|
|
}
|
|
|
|
KVMap map;
|
|
for (char c = 'a'; c <= 'z'; ++c) {
|
|
map[std::string(2, c)] = std::string(2, c);
|
|
}
|
|
|
|
std::unique_ptr<Iterator> iter(
|
|
batch.NewIteratorWithBase(new KVIter(&map)));
|
|
|
|
Random rnd(301);
|
|
for (int i = 0; i < 1000000; ++i) {
|
|
int random = rnd.Uniform(8);
|
|
char c = static_cast<char>(rnd.Uniform(26) + 'a');
|
|
switch (random) {
|
|
case 0:
|
|
batch.Put(std::string(1, c), "xxx");
|
|
break;
|
|
case 1:
|
|
batch.Put(std::string(2, c), "xxx");
|
|
break;
|
|
case 2:
|
|
batch.Delete(std::string(1, c));
|
|
break;
|
|
case 3:
|
|
batch.Delete(std::string(2, c));
|
|
break;
|
|
case 4:
|
|
iter->Seek(std::string(1, c));
|
|
break;
|
|
case 5:
|
|
iter->Seek(std::string(2, c));
|
|
break;
|
|
case 6:
|
|
if (iter->Valid()) {
|
|
iter->Next();
|
|
}
|
|
break;
|
|
case 7:
|
|
if (iter->Valid()) {
|
|
iter->Prev();
|
|
}
|
|
break;
|
|
default:
|
|
assert(false);
|
|
}
|
|
}
|
|
}
|
|
|
|
static std::string PrintContents(WriteBatchWithIndex* batch,
|
|
ColumnFamilyHandle* column_family) {
|
|
std::string result;
|
|
|
|
WBWIIterator* iter;
|
|
if (column_family == nullptr) {
|
|
iter = batch->NewIterator();
|
|
} else {
|
|
iter = batch->NewIterator(column_family);
|
|
}
|
|
|
|
iter->SeekToFirst();
|
|
while (iter->Valid()) {
|
|
WriteEntry e = iter->Entry();
|
|
|
|
if (e.type == kPutRecord) {
|
|
result.append("PUT(");
|
|
result.append(e.key.ToString());
|
|
result.append("):");
|
|
result.append(e.value.ToString());
|
|
} else if (e.type == kMergeRecord) {
|
|
result.append("MERGE(");
|
|
result.append(e.key.ToString());
|
|
result.append("):");
|
|
result.append(e.value.ToString());
|
|
} else if (e.type == kSingleDeleteRecord) {
|
|
result.append("SINGLE-DEL(");
|
|
result.append(e.key.ToString());
|
|
result.append(")");
|
|
} else {
|
|
assert(e.type == kDeleteRecord);
|
|
result.append("DEL(");
|
|
result.append(e.key.ToString());
|
|
result.append(")");
|
|
}
|
|
|
|
result.append(",");
|
|
iter->Next();
|
|
}
|
|
|
|
delete iter;
|
|
return result;
|
|
}
|
|
|
|
static std::string PrintContents(WriteBatchWithIndex* batch, KVMap* base_map,
|
|
ColumnFamilyHandle* column_family) {
|
|
std::string result;
|
|
|
|
Iterator* iter;
|
|
if (column_family == nullptr) {
|
|
iter = batch->NewIteratorWithBase(new KVIter(base_map));
|
|
} else {
|
|
iter = batch->NewIteratorWithBase(column_family, new KVIter(base_map));
|
|
}
|
|
|
|
iter->SeekToFirst();
|
|
while (iter->Valid()) {
|
|
assert(iter->status().ok());
|
|
|
|
Slice key = iter->key();
|
|
Slice value = iter->value();
|
|
|
|
result.append(key.ToString());
|
|
result.append(":");
|
|
result.append(value.ToString());
|
|
result.append(",");
|
|
|
|
iter->Next();
|
|
}
|
|
|
|
delete iter;
|
|
return result;
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, SavePointTest) {
|
|
WriteBatchWithIndex batch;
|
|
ColumnFamilyHandleImplDummy cf1(1, BytewiseComparator());
|
|
Status s;
|
|
|
|
batch.Put("A", "a");
|
|
batch.Put("B", "b");
|
|
batch.Put("A", "aa");
|
|
batch.Put(&cf1, "A", "a1");
|
|
batch.Delete(&cf1, "B");
|
|
batch.Put(&cf1, "C", "c1");
|
|
batch.Put(&cf1, "E", "e1");
|
|
|
|
batch.SetSavePoint(); // 1
|
|
|
|
batch.Put("C", "cc");
|
|
batch.Put("B", "bb");
|
|
batch.Delete("A");
|
|
batch.Put(&cf1, "B", "b1");
|
|
batch.Delete(&cf1, "A");
|
|
batch.SingleDelete(&cf1, "E");
|
|
batch.SetSavePoint(); // 2
|
|
|
|
batch.Put("A", "aaa");
|
|
batch.Put("A", "xxx");
|
|
batch.Delete("B");
|
|
batch.Put(&cf1, "B", "b2");
|
|
batch.Delete(&cf1, "C");
|
|
batch.SetSavePoint(); // 3
|
|
batch.SetSavePoint(); // 4
|
|
batch.SingleDelete("D");
|
|
batch.Delete(&cf1, "D");
|
|
batch.Delete(&cf1, "E");
|
|
|
|
ASSERT_EQ(
|
|
"PUT(A):a,PUT(A):aa,DEL(A),PUT(A):aaa,PUT(A):xxx,PUT(B):b,PUT(B):bb,DEL("
|
|
"B)"
|
|
",PUT(C):cc,SINGLE-DEL(D),",
|
|
PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_EQ(
|
|
"PUT(A):a1,DEL(A),DEL(B),PUT(B):b1,PUT(B):b2,PUT(C):c1,DEL(C),"
|
|
"DEL(D),PUT(E):e1,SINGLE-DEL(E),DEL(E),",
|
|
PrintContents(&batch, &cf1));
|
|
|
|
ASSERT_OK(batch.RollbackToSavePoint()); // rollback to 4
|
|
ASSERT_EQ(
|
|
"PUT(A):a,PUT(A):aa,DEL(A),PUT(A):aaa,PUT(A):xxx,PUT(B):b,PUT(B):bb,DEL("
|
|
"B)"
|
|
",PUT(C):cc,",
|
|
PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_EQ(
|
|
"PUT(A):a1,DEL(A),DEL(B),PUT(B):b1,PUT(B):b2,PUT(C):c1,DEL(C),"
|
|
"PUT(E):e1,SINGLE-DEL(E),",
|
|
PrintContents(&batch, &cf1));
|
|
|
|
ASSERT_OK(batch.RollbackToSavePoint()); // rollback to 3
|
|
ASSERT_EQ(
|
|
"PUT(A):a,PUT(A):aa,DEL(A),PUT(A):aaa,PUT(A):xxx,PUT(B):b,PUT(B):bb,DEL("
|
|
"B)"
|
|
",PUT(C):cc,",
|
|
PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_EQ(
|
|
"PUT(A):a1,DEL(A),DEL(B),PUT(B):b1,PUT(B):b2,PUT(C):c1,DEL(C),"
|
|
"PUT(E):e1,SINGLE-DEL(E),",
|
|
PrintContents(&batch, &cf1));
|
|
|
|
ASSERT_OK(batch.RollbackToSavePoint()); // rollback to 2
|
|
ASSERT_EQ("PUT(A):a,PUT(A):aa,DEL(A),PUT(B):b,PUT(B):bb,PUT(C):cc,",
|
|
PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_EQ(
|
|
"PUT(A):a1,DEL(A),DEL(B),PUT(B):b1,PUT(C):c1,"
|
|
"PUT(E):e1,SINGLE-DEL(E),",
|
|
PrintContents(&batch, &cf1));
|
|
|
|
batch.SetSavePoint(); // 5
|
|
batch.Put("X", "x");
|
|
|
|
ASSERT_EQ("PUT(A):a,PUT(A):aa,DEL(A),PUT(B):b,PUT(B):bb,PUT(C):cc,PUT(X):x,",
|
|
PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_OK(batch.RollbackToSavePoint()); // rollback to 5
|
|
ASSERT_EQ("PUT(A):a,PUT(A):aa,DEL(A),PUT(B):b,PUT(B):bb,PUT(C):cc,",
|
|
PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_EQ(
|
|
"PUT(A):a1,DEL(A),DEL(B),PUT(B):b1,PUT(C):c1,"
|
|
"PUT(E):e1,SINGLE-DEL(E),",
|
|
PrintContents(&batch, &cf1));
|
|
|
|
ASSERT_OK(batch.RollbackToSavePoint()); // rollback to 1
|
|
ASSERT_EQ("PUT(A):a,PUT(A):aa,PUT(B):b,", PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_EQ("PUT(A):a1,DEL(B),PUT(C):c1,PUT(E):e1,",
|
|
PrintContents(&batch, &cf1));
|
|
|
|
s = batch.RollbackToSavePoint(); // no savepoint found
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
ASSERT_EQ("PUT(A):a,PUT(A):aa,PUT(B):b,", PrintContents(&batch, nullptr));
|
|
|
|
ASSERT_EQ("PUT(A):a1,DEL(B),PUT(C):c1,PUT(E):e1,",
|
|
PrintContents(&batch, &cf1));
|
|
|
|
batch.SetSavePoint(); // 6
|
|
|
|
batch.Clear();
|
|
ASSERT_EQ("", PrintContents(&batch, nullptr));
|
|
ASSERT_EQ("", PrintContents(&batch, &cf1));
|
|
|
|
s = batch.RollbackToSavePoint(); // rollback to 6
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, SingleDeleteTest) {
|
|
WriteBatchWithIndex batch;
|
|
Status s;
|
|
std::string value;
|
|
DBOptions db_options;
|
|
|
|
batch.SingleDelete("A");
|
|
|
|
s = batch.GetFromBatch(db_options, "A", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
s = batch.GetFromBatch(db_options, "B", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
value = PrintContents(&batch, nullptr);
|
|
ASSERT_EQ("SINGLE-DEL(A),", value);
|
|
|
|
batch.Clear();
|
|
batch.Put("A", "a");
|
|
batch.Put("A", "a2");
|
|
batch.Put("B", "b");
|
|
batch.SingleDelete("A");
|
|
|
|
s = batch.GetFromBatch(db_options, "A", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
s = batch.GetFromBatch(db_options, "B", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("b", value);
|
|
|
|
value = PrintContents(&batch, nullptr);
|
|
ASSERT_EQ("PUT(A):a,PUT(A):a2,SINGLE-DEL(A),PUT(B):b,", value);
|
|
|
|
batch.Put("C", "c");
|
|
batch.Put("A", "a3");
|
|
batch.Delete("B");
|
|
batch.SingleDelete("B");
|
|
batch.SingleDelete("C");
|
|
|
|
s = batch.GetFromBatch(db_options, "A", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("a3", value);
|
|
s = batch.GetFromBatch(db_options, "B", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
s = batch.GetFromBatch(db_options, "C", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
s = batch.GetFromBatch(db_options, "D", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
value = PrintContents(&batch, nullptr);
|
|
ASSERT_EQ(
|
|
"PUT(A):a,PUT(A):a2,SINGLE-DEL(A),PUT(A):a3,PUT(B):b,DEL(B),SINGLE-DEL(B)"
|
|
",PUT(C):c,SINGLE-DEL(C),",
|
|
value);
|
|
|
|
batch.Put("B", "b4");
|
|
batch.Put("C", "c4");
|
|
batch.Put("D", "d4");
|
|
batch.SingleDelete("D");
|
|
batch.SingleDelete("D");
|
|
batch.Delete("A");
|
|
|
|
s = batch.GetFromBatch(db_options, "A", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
s = batch.GetFromBatch(db_options, "B", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("b4", value);
|
|
s = batch.GetFromBatch(db_options, "C", &value);
|
|
ASSERT_OK(s);
|
|
ASSERT_EQ("c4", value);
|
|
s = batch.GetFromBatch(db_options, "D", &value);
|
|
ASSERT_TRUE(s.IsNotFound());
|
|
|
|
value = PrintContents(&batch, nullptr);
|
|
ASSERT_EQ(
|
|
"PUT(A):a,PUT(A):a2,SINGLE-DEL(A),PUT(A):a3,DEL(A),PUT(B):b,DEL(B),"
|
|
"SINGLE-DEL(B),PUT(B):b4,PUT(C):c,SINGLE-DEL(C),PUT(C):c4,PUT(D):d4,"
|
|
"SINGLE-DEL(D),SINGLE-DEL(D),",
|
|
value);
|
|
}
|
|
|
|
TEST_F(WriteBatchWithIndexTest, SingleDeleteDeltaIterTest) {
|
|
Status s;
|
|
std::string value;
|
|
DBOptions db_options;
|
|
WriteBatchWithIndex batch(BytewiseComparator(), 20, true /* overwrite_key */);
|
|
batch.Put("A", "a");
|
|
batch.Put("A", "a2");
|
|
batch.Put("B", "b");
|
|
batch.SingleDelete("A");
|
|
batch.Delete("B");
|
|
|
|
KVMap map;
|
|
value = PrintContents(&batch, &map, nullptr);
|
|
ASSERT_EQ("", value);
|
|
|
|
map["A"] = "aa";
|
|
map["C"] = "cc";
|
|
map["D"] = "dd";
|
|
|
|
batch.SingleDelete("B");
|
|
batch.SingleDelete("C");
|
|
batch.SingleDelete("Z");
|
|
|
|
value = PrintContents(&batch, &map, nullptr);
|
|
ASSERT_EQ("D:dd,", value);
|
|
|
|
batch.Put("A", "a3");
|
|
batch.Put("B", "b3");
|
|
batch.SingleDelete("A");
|
|
batch.SingleDelete("A");
|
|
batch.SingleDelete("D");
|
|
batch.SingleDelete("D");
|
|
batch.Delete("D");
|
|
|
|
map["E"] = "ee";
|
|
|
|
value = PrintContents(&batch, &map, nullptr);
|
|
ASSERT_EQ("B:b3,E:ee,", value);
|
|
}
|
|
|
|
} // namespace ROCKSDB_NAMESPACE
|
|
|
|
int main(int argc, char** argv) {
|
|
ROCKSDB_NAMESPACE::port::InstallStackTraceHandler();
|
|
::testing::InitGoogleTest(&argc, argv);
|
|
return RUN_ALL_TESTS();
|
|
}
|
|
|
|
#else
|
|
#include <stdio.h>
|
|
|
|
int main() {
|
|
fprintf(stderr, "SKIPPED\n");
|
|
return 0;
|
|
}
|
|
|
|
#endif // !ROCKSDB_LITE
|