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

  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/
bloom_filter.cpp 17 #include "suggest/core/dictionary/bloom_filter.h"
multi_bigram_map.h 24 #include "suggest/core/dictionary/bloom_filter.h"
  /external/chromium/chrome/browser/safe_browsing/
filter_false_positive_perftest.cc 71 #include "chrome/browser/safe_browsing/bloom_filter.h"
106 BloomFilter** bloom_filter) {
111 *bloom_filter = new BloomFilter(filter_size);
115 (*bloom_filter)->Insert(prefixes[i]);
119 << ", size (bytes): " << (*bloom_filter)->size()
163 BloomFilter* bloom_filter,
180 if (bloom_filter->Exists(prefix))
216 BloomFilter* bloom_filter = NULL; local
217 BuildBloomFilter(size_multiplier, prefix_list, &bloom_filter);
218 scoped_refptr<BloomFilter> scoped_filter(bloom_filter);
335 BloomFilter* bloom_filter = NULL; local
    [all...]
bloom_filter_unittest.cc 5 #include "chrome/browser/safe_browsing/bloom_filter.h"
bloom_filter.cc 5 #include "chrome/browser/safe_browsing/bloom_filter.h"
safe_browsing_database.cc 17 #include "chrome/browser/safe_browsing/bloom_filter.h"
    [all...]
  /external/chromium_org/third_party/leveldatabase/src/util/
bloom.cc 63 virtual bool KeyMayMatch(const Slice& key, const Slice& bloom_filter) const {
64 const size_t len = bloom_filter.size();
67 const char* array = bloom_filter.data();
  /packages/inputmethods/LatinIME/native/jni/
Android.mk 57 bloom_filter.cpp \
  /external/guava/guava/src/com/google/common/hash/
BloomFilter.java 203 * See http://en.wikipedia.org/wiki/Bloom_filter#Probability_of_false_positives for the formula.
  /external/chromium_org/third_party/leveldatabase/src/doc/
index.html 419 <a href="http://en.wikipedia.org/wiki/Bloom_filter">Bloom filter</a>

Completed in 84 milliseconds