HomeSort by relevance Sort by last modified time
    Searched refs:KeyMayMatch (Results 1 - 10 of 10) sorted by null

  /external/chromium_org/third_party/leveldatabase/src/table/
filter_block_test.cc 30 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const {
51 ASSERT_TRUE(reader.KeyMayMatch(0, "foo"));
52 ASSERT_TRUE(reader.KeyMayMatch(100000, "foo"));
67 ASSERT_TRUE(reader.KeyMayMatch(100, "foo"));
68 ASSERT_TRUE(reader.KeyMayMatch(100, "bar"));
69 ASSERT_TRUE(reader.KeyMayMatch(100, "box"));
70 ASSERT_TRUE(reader.KeyMayMatch(100, "hello"));
71 ASSERT_TRUE(reader.KeyMayMatch(100, "foo"));
72 ASSERT_TRUE(! reader.KeyMayMatch(100, "missing"));
73 ASSERT_TRUE(! reader.KeyMayMatch(100, "other"))
    [all...]
filter_block.h 56 bool KeyMayMatch(uint64_t block_offset, const Slice& key);
filter_block.cc 95 bool FilterBlockReader::KeyMayMatch(uint64_t block_offset, const Slice& key) {
102 return policy_->KeyMayMatch(key, filter);
table.cc 228 !filter->KeyMayMatch(handle.offset(), k)) {
  /external/chromium_org/third_party/leveldatabase/src/include/leveldb/
filter_policy.h 49 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const = 0;
  /external/chromium_org/third_party/leveldatabase/src/db/
dbformat.cc 117 bool InternalFilterPolicy::KeyMayMatch(const Slice& key, const Slice& f) const {
118 return user_policy_->KeyMayMatch(ExtractUserKey(key), f);
dbformat.h 135 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const;
c.cc 121 virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const {
510 bool KeyMayMatch(const Slice& key, const Slice& filter) const {
511 return rep_->KeyMayMatch(key, filter);
  /external/chromium_org/third_party/leveldatabase/src/util/
bloom.cc 63 virtual bool KeyMayMatch(const Slice& key, const Slice& bloom_filter) const {
bloom_test.cc 73 return policy_->KeyMayMatch(s, filter_);

Completed in 2915 milliseconds