f3ae3d07cc
Summary: 1. Add some more implementation-aware tests for PlainTable 2. move from a hard-coded one index per 16 rows in one prefix to a configurable number. Also, make hash table ratio = 0 means binary search only. Also fixes some divide 0 risks. 3. Explicitly support total order (only use binary search) 4. some code cleaning up. Test Plan: make all check Reviewers: haobo, kailiu Reviewed By: haobo CC: leveldb Differential Revision: https://reviews.facebook.net/D16023
49 lines
2.1 KiB
C++
49 lines
2.1 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.
|
|
|
|
#include "table/plain_table_factory.h"
|
|
|
|
#include <memory>
|
|
#include <stdint.h>
|
|
#include "db/dbformat.h"
|
|
#include "table/plain_table_builder.h"
|
|
#include "table/plain_table_reader.h"
|
|
#include "port/port.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
Status PlainTableFactory::NewTableReader(const Options& options,
|
|
const EnvOptions& soptions,
|
|
const InternalKeyComparator& icomp,
|
|
unique_ptr<RandomAccessFile>&& file,
|
|
uint64_t file_size,
|
|
unique_ptr<TableReader>* table) const {
|
|
return PlainTableReader::Open(options, soptions, icomp, std::move(file),
|
|
file_size, table, bloom_bits_per_key_,
|
|
hash_table_ratio_, index_sparseness_);
|
|
}
|
|
|
|
TableBuilder* PlainTableFactory::NewTableBuilder(
|
|
const Options& options, const InternalKeyComparator& internal_comparator,
|
|
WritableFile* file, CompressionType compression_type) const {
|
|
return new PlainTableBuilder(options, file, user_key_len_);
|
|
}
|
|
|
|
extern TableFactory* NewPlainTableFactory(uint32_t user_key_len,
|
|
int bloom_bits_per_key,
|
|
double hash_table_ratio,
|
|
size_t index_sparseness) {
|
|
return new PlainTableFactory(user_key_len, bloom_bits_per_key,
|
|
hash_table_ratio, index_sparseness);
|
|
}
|
|
|
|
extern TableFactory* NewTotalOrderPlainTableFactory(uint32_t user_key_len,
|
|
int bloom_bits_per_key,
|
|
size_t index_sparseness) {
|
|
return new PlainTableFactory(user_key_len, bloom_bits_per_key, 0,
|
|
index_sparseness);
|
|
}
|
|
|
|
} // namespace rocksdb
|