3c9cef1eed
Summary: This diff is a collection of cleanups that were initially part of D43179. Additionally it adds a unified way of defining key-value maps that use a Comparator for sorting (this was previously implemented in four different places). Test Plan: make clean check all Reviewers: rven, anthony, yhchiang, sdong, igor Reviewed By: igor Subscribers: dhruba, leveldb Differential Revision: https://reviews.facebook.net/D45993
47 lines
1.2 KiB
C++
47 lines
1.2 KiB
C++
// Copyright (c) 2013, Facebook, Inc. All rights reserved.
|
|
// This source code is licensed under the BSD-style license found in the
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
#pragma once
|
|
|
|
#include <map>
|
|
#include <string>
|
|
|
|
#include "rocksdb/comparator.h"
|
|
#include "rocksdb/memtablerep.h"
|
|
#include "rocksdb/slice.h"
|
|
#include "util/coding.h"
|
|
#include "util/murmurhash.h"
|
|
|
|
namespace rocksdb {
|
|
namespace stl_wrappers {
|
|
|
|
class Base {
|
|
protected:
|
|
const MemTableRep::KeyComparator& compare_;
|
|
explicit Base(const MemTableRep::KeyComparator& compare)
|
|
: compare_(compare) {}
|
|
};
|
|
|
|
struct Compare : private Base {
|
|
explicit Compare(const MemTableRep::KeyComparator& compare) : Base(compare) {}
|
|
inline bool operator()(const char* a, const char* b) const {
|
|
return compare_(a, b) < 0;
|
|
}
|
|
};
|
|
|
|
struct LessOfComparator {
|
|
explicit LessOfComparator(const Comparator* c = BytewiseComparator())
|
|
: cmp(c) {}
|
|
|
|
bool operator()(const std::string& a, const std::string& b) const {
|
|
return cmp->Compare(Slice(a), Slice(b)) < 0;
|
|
}
|
|
|
|
const Comparator* cmp;
|
|
};
|
|
|
|
typedef std::map<std::string, std::string, LessOfComparator> KVMap;
|
|
}
|
|
}
|