2016-02-10 00:12:00 +01:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2017-07-16 01:03:42 +02:00
|
|
|
// 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).
|
2016-12-14 19:21:54 +01:00
|
|
|
|
2014-05-10 19:49:33 +02:00
|
|
|
#include <cstdio>
|
|
|
|
#include <string>
|
|
|
|
|
|
|
|
#include "rocksdb/db.h"
|
|
|
|
#include "rocksdb/slice.h"
|
|
|
|
#include "rocksdb/options.h"
|
|
|
|
|
2022-01-12 18:28:09 +01:00
|
|
|
using ROCKSDB_NAMESPACE::DB;
|
|
|
|
using ROCKSDB_NAMESPACE::Options;
|
|
|
|
using ROCKSDB_NAMESPACE::PinnableSlice;
|
|
|
|
using ROCKSDB_NAMESPACE::ReadOptions;
|
|
|
|
using ROCKSDB_NAMESPACE::Status;
|
|
|
|
using ROCKSDB_NAMESPACE::WriteBatch;
|
|
|
|
using ROCKSDB_NAMESPACE::WriteOptions;
|
2014-05-10 19:49:33 +02:00
|
|
|
|
2020-09-02 03:02:25 +02:00
|
|
|
#if defined(OS_WIN)
|
|
|
|
std::string kDBPath = "C:\\Windows\\TEMP\\rocksdb_simple_example";
|
|
|
|
#else
|
2014-05-10 19:49:33 +02:00
|
|
|
std::string kDBPath = "/tmp/rocksdb_simple_example";
|
2020-09-02 03:02:25 +02:00
|
|
|
#endif
|
2014-05-10 19:49:33 +02:00
|
|
|
|
|
|
|
int main() {
|
|
|
|
DB* db;
|
|
|
|
Options options;
|
|
|
|
// Optimize RocksDB. This is the easiest way to get RocksDB to perform well
|
|
|
|
options.IncreaseParallelism();
|
|
|
|
options.OptimizeLevelStyleCompaction();
|
|
|
|
// create the DB if it's not already present
|
|
|
|
options.create_if_missing = true;
|
|
|
|
|
|
|
|
// open DB
|
|
|
|
Status s = DB::Open(options, kDBPath, &db);
|
|
|
|
assert(s.ok());
|
|
|
|
|
|
|
|
// Put key-value
|
2015-01-28 01:37:36 +01:00
|
|
|
s = db->Put(WriteOptions(), "key1", "value");
|
2014-05-10 19:49:33 +02:00
|
|
|
assert(s.ok());
|
|
|
|
std::string value;
|
|
|
|
// get value
|
2015-01-28 01:37:36 +01:00
|
|
|
s = db->Get(ReadOptions(), "key1", &value);
|
2014-05-10 19:49:33 +02:00
|
|
|
assert(s.ok());
|
|
|
|
assert(value == "value");
|
|
|
|
|
2015-01-28 01:37:36 +01:00
|
|
|
// atomically apply a set of updates
|
|
|
|
{
|
|
|
|
WriteBatch batch;
|
|
|
|
batch.Delete("key1");
|
|
|
|
batch.Put("key2", value);
|
|
|
|
s = db->Write(WriteOptions(), &batch);
|
|
|
|
}
|
|
|
|
|
|
|
|
s = db->Get(ReadOptions(), "key1", &value);
|
|
|
|
assert(s.IsNotFound());
|
|
|
|
|
|
|
|
db->Get(ReadOptions(), "key2", &value);
|
|
|
|
assert(value == "value");
|
|
|
|
|
2017-08-24 21:20:15 +02:00
|
|
|
{
|
|
|
|
PinnableSlice pinnable_val;
|
|
|
|
db->Get(ReadOptions(), db->DefaultColumnFamily(), "key2", &pinnable_val);
|
|
|
|
assert(pinnable_val == "value");
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
std::string string_val;
|
|
|
|
// If it cannot pin the value, it copies the value to its internal buffer.
|
|
|
|
// The intenral buffer could be set during construction.
|
|
|
|
PinnableSlice pinnable_val(&string_val);
|
|
|
|
db->Get(ReadOptions(), db->DefaultColumnFamily(), "key2", &pinnable_val);
|
|
|
|
assert(pinnable_val == "value");
|
|
|
|
// If the value is not pinned, the internal buffer must have the value.
|
|
|
|
assert(pinnable_val.IsPinned() || string_val == "value");
|
|
|
|
}
|
|
|
|
|
|
|
|
PinnableSlice pinnable_val;
|
2020-06-19 02:58:24 +02:00
|
|
|
s = db->Get(ReadOptions(), db->DefaultColumnFamily(), "key1", &pinnable_val);
|
2017-08-24 21:20:15 +02:00
|
|
|
assert(s.IsNotFound());
|
|
|
|
// Reset PinnableSlice after each use and before each reuse
|
|
|
|
pinnable_val.Reset();
|
|
|
|
db->Get(ReadOptions(), db->DefaultColumnFamily(), "key2", &pinnable_val);
|
|
|
|
assert(pinnable_val == "value");
|
|
|
|
pinnable_val.Reset();
|
|
|
|
// The Slice pointed by pinnable_val is not valid after this point
|
|
|
|
|
2014-05-10 19:49:33 +02:00
|
|
|
delete db;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|