2011-03-18 22:37:00 +00:00
|
|
|
// 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 STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
|
|
|
|
#define STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
|
|
|
|
|
2014-12-11 08:02:45 -08:00
|
|
|
#include "leveldb/iterator.h"
|
|
|
|
#include "leveldb/slice.h"
|
|
|
|
|
2011-03-18 22:37:00 +00:00
|
|
|
namespace leveldb {
|
|
|
|
|
|
|
|
// A internal wrapper class with an interface similar to Iterator that
|
|
|
|
// caches the valid() and key() results for an underlying iterator.
|
|
|
|
// This can help avoid virtual function calls and also gives better
|
|
|
|
// cache locality.
|
|
|
|
class IteratorWrapper {
|
|
|
|
public:
|
2019-05-02 11:01:00 -07:00
|
|
|
IteratorWrapper() : iter_(nullptr), valid_(false) {}
|
|
|
|
explicit IteratorWrapper(Iterator* iter) : iter_(nullptr) { Set(iter); }
|
2011-03-18 22:37:00 +00:00
|
|
|
~IteratorWrapper() { delete iter_; }
|
|
|
|
Iterator* iter() const { return iter_; }
|
|
|
|
|
|
|
|
// Takes ownership of "iter" and will delete it when destroyed, or
|
|
|
|
// when Set() is invoked again.
|
|
|
|
void Set(Iterator* iter) {
|
|
|
|
delete iter_;
|
|
|
|
iter_ = iter;
|
2018-04-10 16:18:06 -07:00
|
|
|
if (iter_ == nullptr) {
|
2011-03-18 22:37:00 +00:00
|
|
|
valid_ = false;
|
|
|
|
} else {
|
|
|
|
Update();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Iterator interface methods
|
2019-05-02 11:01:00 -07:00
|
|
|
bool Valid() const { return valid_; }
|
|
|
|
Slice key() const {
|
|
|
|
assert(Valid());
|
|
|
|
return key_;
|
|
|
|
}
|
|
|
|
Slice value() const {
|
|
|
|
assert(Valid());
|
|
|
|
return iter_->value();
|
|
|
|
}
|
2018-04-10 16:18:06 -07:00
|
|
|
// Methods below require iter() != nullptr
|
2019-05-02 11:01:00 -07:00
|
|
|
Status status() const {
|
|
|
|
assert(iter_);
|
|
|
|
return iter_->status();
|
|
|
|
}
|
|
|
|
void Next() {
|
|
|
|
assert(iter_);
|
|
|
|
iter_->Next();
|
|
|
|
Update();
|
|
|
|
}
|
|
|
|
void Prev() {
|
|
|
|
assert(iter_);
|
|
|
|
iter_->Prev();
|
|
|
|
Update();
|
|
|
|
}
|
|
|
|
void Seek(const Slice& k) {
|
|
|
|
assert(iter_);
|
|
|
|
iter_->Seek(k);
|
|
|
|
Update();
|
|
|
|
}
|
|
|
|
void SeekToFirst() {
|
|
|
|
assert(iter_);
|
|
|
|
iter_->SeekToFirst();
|
|
|
|
Update();
|
|
|
|
}
|
|
|
|
void SeekToLast() {
|
|
|
|
assert(iter_);
|
|
|
|
iter_->SeekToLast();
|
|
|
|
Update();
|
|
|
|
}
|
2011-03-18 22:37:00 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
void Update() {
|
|
|
|
valid_ = iter_->Valid();
|
|
|
|
if (valid_) {
|
|
|
|
key_ = iter_->key();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-28 00:53:58 +00:00
|
|
|
Iterator* iter_;
|
|
|
|
bool valid_;
|
|
|
|
Slice key_;
|
|
|
|
};
|
2011-03-18 22:37:00 +00:00
|
|
|
|
2011-05-28 00:53:58 +00:00
|
|
|
} // namespace leveldb
|
2011-03-18 22:37:00 +00:00
|
|
|
|
|
|
|
#endif // STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
|