Searched refs:num_keys (Results 1 - 25 of 36) sorted by relevance

12

/external/chromium/chrome/browser/safe_browsing/
H A Dbloom_filter.cc110 int num_keys; local
111 bytes_read = filter.Read(reinterpret_cast<char*>(&num_keys),
112 sizeof(num_keys), NULL);
113 if (bytes_read != sizeof(num_keys) ||
114 num_keys < 1 || num_keys > kNumHashKeys) {
120 for (int i = 0; i < num_keys; ++i) {
171 int num_keys = static_cast<int>(hash_keys_.size()); local
172 bytes_written = filter.Write(reinterpret_cast<char*>(&num_keys),
173 sizeof(num_keys), NUL
[all...]
/external/chromium_org/third_party/leveldatabase/src/table/
H A Dfilter_block.cc53 const size_t num_keys = start_.size(); local
54 if (num_keys == 0) {
62 tmp_keys_.resize(num_keys);
63 for (size_t i = 0; i < num_keys; i++) {
71 policy_->CreateFilter(&tmp_keys_[0], num_keys, &result_);
/external/marisa-trie/tools/
H A Dmarisa-predict.cc66 std::size_t num_keys = trie.predict(str); local
67 if (num_keys != 0) {
68 std::cout << num_keys << " found" << std::endl;
73 num_keys = trie.predict_depth_first(
76 num_keys = trie.predict_breadth_first(
84 for (std::size_t i = 0; i < num_keys; ++i) {
H A Dmarisa-find.cc42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths); local
43 if (num_keys != 0) {
44 std::cout << num_keys << " found" << std::endl;
45 for (std::size_t i = 0; (i < num_keys) && (i < max_num_results); ++i) {
H A Dmarisa-benchmark.cc113 void print_time_info(std::size_t num_keys, double elasped) { argument
118 std::printf(" %7.2f", num_keys / elasped / 1000.0);
121 if (num_keys == 0) {
124 std::printf(" %7.3f", 1000000.0 * elasped / num_keys);
220 const std::size_t num_keys = trie.find(keys[i].first, &found_key_ids); local
221 if ((num_keys == 0) || (found_key_ids.back() != key_ids[i])) {
240 const std::size_t num_keys = trie.predict_breadth_first( local
242 if ((num_keys == 0) || (found_key_ids.front() != key_ids[i])) {
261 const std::size_t num_keys = trie.predict_depth_first( local
263 if ((num_keys
[all...]
H A Dmarisa-build.cc87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
/external/marisa-trie/v0_1_5/tools/
H A Dmarisa_alpha-predict.cc66 std::size_t num_keys = trie.predict(str); local
67 if (num_keys != 0) {
68 std::cout << num_keys << " found" << std::endl;
73 num_keys = trie.predict_depth_first(
76 num_keys = trie.predict_breadth_first(
84 for (std::size_t i = 0; i < num_keys; ++i) {
H A Dmarisa_alpha-find.cc42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths); local
43 if (num_keys != 0) {
44 std::cout << num_keys << " found" << std::endl;
45 for (std::size_t i = 0; (i < num_keys) && (i < max_num_results); ++i) {
H A Dmarisa_alpha-benchmark.cc113 void print_time_info(std::size_t num_keys, double elasped) { argument
118 std::printf(" %7.2f", num_keys / elasped / 1000.0);
121 if (num_keys == 0) {
124 std::printf(" %7.3f", 1000000.0 * elasped / num_keys);
220 const std::size_t num_keys = trie.find(keys[i].first, &found_key_ids); local
221 if ((num_keys == 0) || (found_key_ids.back() != key_ids[i])) {
240 const std::size_t num_keys = trie.predict_breadth_first( local
242 if ((num_keys == 0) || (found_key_ids.front() != key_ids[i])) {
261 const std::size_t num_keys = trie.predict_depth_first( local
263 if ((num_keys
[all...]
H A Dmarisa_alpha-build.cc87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
/external/chromium_org/third_party/leveldatabase/src/issues/
H A Dissue178_test.cc76 size_t num_keys = 0; local
78 num_keys++;
81 ASSERT_EQ(kNumKeys, num_keys) << "Bad number of keys";
/external/marisa-trie/tests/
H A Dc-test.c60 int callback_for_find(void *num_keys, argument
62 ASSERT(*(size_t *)num_keys == 0);
65 ++*(size_t *)num_keys;
69 int callback_for_predict(void *num_keys, argument
71 ASSERT(*(size_t *)num_keys < 2);
72 switch (*(size_t *)num_keys) {
86 ++*(size_t *)num_keys;
H A Dtrie-test.cc59 ASSERT(trie.num_keys() == 0);
66 ASSERT(trie.num_keys() == 0);
79 ASSERT(trie.num_keys() == 4);
103 ASSERT(trie.num_keys() == 0);
110 ASSERT(trie.num_keys() == 4);
196 ASSERT(trie.num_keys() == 4);
227 ASSERT(trie.num_keys() == 4);
256 ASSERT(trie.num_keys() == 4);
275 ASSERT(trie.num_keys() == 4);
293 ASSERT(trie.num_keys()
[all...]
/external/marisa-trie/v0_1_5/tests/
H A Dc-test.c65 int callback_for_find(void *num_keys, argument
67 ASSERT(*(size_t *)num_keys == 0);
70 ++*(size_t *)num_keys;
74 int callback_for_predict(void *num_keys, argument
76 ASSERT(*(size_t *)num_keys < 2);
77 switch (*(size_t *)num_keys) {
91 ++*(size_t *)num_keys;
H A Dtrie-test.cc59 ASSERT(trie.num_keys() == 0);
66 ASSERT(trie.num_keys() == 0);
80 ASSERT(trie.num_keys() == 4);
104 ASSERT(trie.num_keys() == 0);
112 ASSERT(trie.num_keys() == 4);
198 ASSERT(trie.num_keys() == 4);
229 ASSERT(trie.num_keys() == 4);
258 ASSERT(trie.num_keys() == 4);
277 ASSERT(trie.num_keys() == 4);
295 ASSERT(trie.num_keys()
[all...]
/external/chromium_org/chrome/browser/sync/test/integration/performance/
H A Dautofill_sync_perf_test.cc53 // Adds |num_keys| new autofill keys to the sync profile |profile|.
54 void AddKeys(int profile, int num_keys);
117 void AutofillSyncPerfTest::AddKeys(int profile, int num_keys) { argument
119 for (int i = 0; i < num_keys; ++i) {
/external/openssh/
H A Dmisc.c569 u_int num_keys, i, j; local
579 for (num_keys = 0; num_keys < EXPAND_MAX_KEYS; num_keys++) {
580 keys[num_keys].key = va_arg(ap, char *);
581 if (keys[num_keys].key == NULL)
583 keys[num_keys].repl = va_arg(ap, char *);
584 if (keys[num_keys].repl == NULL)
587 if (num_keys == EXPAND_MAX_KEYS && va_arg(ap, char *) != NULL)
606 for (j = 0; j < num_keys;
[all...]
/external/chromium/net/base/
H A Ddnssec_chain_verifier.cc466 uint8 num_keys; local
467 if (!U8(&num_keys))
470 for (unsigned i = 0; i < num_keys; i++) {
484 uint8 num_keys; local
485 if (!U8(&num_keys))
488 for (unsigned i = 0; i < num_keys; i++) {
/external/marisa-trie/lib/marisa/
H A Dtrie-c.cc81 size_t num_keys, const size_t *key_lengths, const double *key_weights,
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
324 return (h != NULL) ? h->trie.num_keys() : 0;
80 marisa_build(marisa_trie *h, const char * const *keys, size_t num_keys, const size_t *key_lengths, const double *key_weights, marisa_uint32 *key_ids, int flags) argument
H A Dtrie-build.cc11 void Trie::build(const char * const *keys, std::size_t num_keys, argument
14 MARISA_THROW_IF((keys == NULL) && (num_keys != 0), MARISA_PARAM_ERROR);
16 temp_keys.resize(num_keys);
/external/bluetooth/bluedroid/stack/btm/
H A Dbtm_devctl.c2184 ** Parameters: num_keys - Number of link keys
2191 tBTM_STATUS BTM_WriteStoredLinkKey (UINT8 num_keys, argument
2200 BTM_TRACE_EVENT1 ("BTM: BTM_WriteStoredLinkKey: num_keys: %d", num_keys);
2203 if(num_keys > HCI_MAX_NUM_OF_LINK_KEYS_PER_CMMD)
2204 num_keys = HCI_MAX_NUM_OF_LINK_KEYS_PER_CMMD;
2208 if (btsnd_hcic_write_stored_key (num_keys, bd_addr, link_key))
2328 STREAM_TO_UINT8 (result.num_keys, p);
2361 STREAM_TO_UINT16 (result.num_keys, p);
2391 for (i=0; i<result->num_keys;
[all...]
/external/chromium_org/base/debug/
H A Dcrash_logging_unittest.cc129 size_t num_keys = base::debug::InitCrashKeys(keys, arraysize(keys), 5); local
131 EXPECT_EQ(10u, num_keys);
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dtrie-c.cc81 const char * const *keys, size_t num_keys, const size_t *key_lengths,
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
361 return (h != NULL) ? h->trie.num_keys() : 0;
80 marisa_alpha_build(marisa_alpha_trie *h, const char * const *keys, size_t num_keys, const size_t *key_lengths, const double *key_weights, marisa_alpha_uint32 *key_ids, int flags) argument
H A Dtrie-build.cc11 void Trie::build(const char * const *keys, std::size_t num_keys, argument
14 MARISA_ALPHA_THROW_IF((keys == NULL) && (num_keys != 0),
17 temp_keys.resize(num_keys);
/external/chromium_org/third_party/leveldatabase/src/include/leveldb/
H A Dc.h230 int num_keys,

Completed in 705 milliseconds

12