Home
last modified time | relevance | path

Searched refs:filter (Results 1 – 10 of 10) sorted by relevance

/leveldb-1.20/doc/
H A Dtable_format.md55 ## "filter" Meta Block
59 an entry that maps from `filter.<N>` to the BlockHandle for the filter
63 The filter block stores a sequence of filters, where filter i contains
72 resulting filter will be stored as the first filter in the filter
75 The filter block is formatted as follows:
77 [filter 0]
78 [filter 1]
79 [filter 2]
81 [filter N-1]
83 [offset of filter 0] : 4 bytes
[all …]
H A Dindex.md408 The preceding code associates a Bloom filter based filtering policy with the
409 database. Bloom filter based filtering relies on keeping some number of bits of
411 we passed to `NewBloomFilterPolicy`). This filter will reduce the number of
415 fit in memory and that do a lot of random reads set a filter policy.
417 If you are using a custom comparator, you should ensure that the filter policy
421 application should provide a custom filter policy that also ignores trailing
436 // Use builtin bloom filter code after removing trailing spaces
446 Advanced applications may provide a filter policy that does not use a bloom
447 filter but uses some other mechanism for summarizing a set of keys. See
/leveldb-1.20/table/
H A Dtable.cc22 delete filter; in ~Rep()
31 FilterBlockReader* filter; member
81 rep->filter = NULL; in Open()
140 rep_->filter = new FilterBlockReader(rep_->options.filter_policy, block.data); in ReadFilter()
234 FilterBlockReader* filter = rep_->filter; in InternalGet() local
236 if (filter != NULL && in InternalGet()
238 !filter->KeyMayMatch(handle.offset(), k)) { in InternalGet()
H A Dfilter_block_test.cc30 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const { in KeyMayMatch()
32 for (size_t i = 0; i + 4 <= filter.size(); i += 4) { in KeyMayMatch()
33 if (h == DecodeFixed32(filter.data() + i)) { in KeyMayMatch()
H A Dfilter_block.cc101 Slice filter = Slice(data_ + start, limit - start); in KeyMayMatch() local
102 return policy_->KeyMayMatch(key, filter); in KeyMayMatch()
/leveldb-1.20/db/
H A Dc.cc98 const char* filter, size_t filter_length);
116 char* filter = (*create_)(state_, &key_pointers[0], &key_sizes[0], n, &len); in CreateFilter() local
117 dst->append(filter, len); in CreateFilter()
118 free(filter); in CreateFilter()
121 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const { in KeyMayMatch()
123 filter.data(), filter.size()); in KeyMayMatch()
484 const char* filter, size_t filter_length), in leveldb_filterpolicy_create() argument
495 void leveldb_filterpolicy_destroy(leveldb_filterpolicy_t* filter) { in leveldb_filterpolicy_destroy() argument
496 delete filter; in leveldb_filterpolicy_destroy()
510 bool KeyMayMatch(const Slice& key, const Slice& filter) const { in leveldb_filterpolicy_create_bloom()
[all …]
H A Dc_test.c151 const char* filter, size_t filter_length) { in FilterKeyMatch() argument
153 CheckCondition(memcmp(filter, "fake", 4) == 0); in FilterKeyMatch()
H A Ddbformat.h138 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const;
/leveldb-1.20/include/leveldb/
H A Dfilter_policy.h49 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const = 0;
H A Dc.h234 const char* filter, size_t filter_length),