HomeSort by relevance Sort by last modified time
    Searched defs:KeyMayMatch (Results 1 - 5 of 5) 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.cc 95 bool FilterBlockReader::KeyMayMatch(uint64_t block_offset, const Slice& key) {
102 return policy_->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 {
  /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);
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);

Completed in 30 milliseconds