mirror of
https://github.com/google/leveldb.git
synced 2024-12-12 04:38:57 +08:00
85584d497e
In particular, we add a new FilterPolicy class. An instance of this class can be supplied in Options when opening a database. If supplied, the instance is used to generate summaries of keys (e.g., a bloom filter) which are placed in sstables. These summaries are consulted by DB::Get() so we can avoid reading sstable blocks that are guaranteed to not contain the key we are looking for. This change provides one implementation of FilterPolicy based on bloom filters. Other changes: - Updated version number to 1.4. - Some build tweaks. - C binding for CompactRange. - A few more benchmarks: deleteseq, deleterandom, readmissing, seekrandom. - Minor .gitignore update.
45 lines
1.0 KiB
C++
45 lines
1.0 KiB
C++
// 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_BLOCK_H_
|
|
#define STORAGE_LEVELDB_TABLE_BLOCK_H_
|
|
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
#include "leveldb/iterator.h"
|
|
|
|
namespace leveldb {
|
|
|
|
struct BlockContents;
|
|
class Comparator;
|
|
|
|
class Block {
|
|
public:
|
|
// Initialize the block with the specified contents.
|
|
explicit Block(const BlockContents& contents);
|
|
|
|
~Block();
|
|
|
|
size_t size() const { return size_; }
|
|
Iterator* NewIterator(const Comparator* comparator);
|
|
|
|
private:
|
|
uint32_t NumRestarts() const;
|
|
|
|
const char* data_;
|
|
size_t size_;
|
|
uint32_t restart_offset_; // Offset in data_ of restart array
|
|
bool owned_; // Block owns data_[]
|
|
|
|
// No copying allowed
|
|
Block(const Block&);
|
|
void operator=(const Block&);
|
|
|
|
class Iter;
|
|
};
|
|
|
|
} // namespace leveldb
|
|
|
|
#endif // STORAGE_LEVELDB_TABLE_BLOCK_H_
|