| /external/chromium/chrome/browser/safe_browsing/ |
| bloom_filter.cc | 110 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), NULL)
[all...] |
| /external/marisa-trie/tools/ |
| marisa-predict.cc | 66 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) {
|
| marisa-find.cc | 42 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) {
|
| marisa-benchmark.cc | 113 void print_time_info(std::size_t num_keys, double elasped) {
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 == 0) || (found_key_ids.front() != key_ids[i]))
[all...] |
| marisa-build.cc | 87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
|
| /external/marisa-trie/v0_1_5/tools/ |
| marisa_alpha-predict.cc | 66 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) {
|
| marisa_alpha-find.cc | 42 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) {
|
| marisa_alpha-benchmark.cc | 113 void print_time_info(std::size_t num_keys, double elasped) {
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 == 0) || (found_key_ids.front() != key_ids[i]))
[all...] |
| marisa_alpha-build.cc | 87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
|
| /external/marisa-trie/tests/ |
| c-test.c | 60 int callback_for_find(void *num_keys,
62 ASSERT(*(size_t *)num_keys == 0);
65 ++*(size_t *)num_keys;
69 int callback_for_predict(void *num_keys,
71 ASSERT(*(size_t *)num_keys < 2);
72 switch (*(size_t *)num_keys) {
86 ++*(size_t *)num_keys;
|
| trie-test.cc | 59 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() == 4)
[all...] |
| /external/marisa-trie/v0_1_5/tests/ |
| c-test.c | 65 int callback_for_find(void *num_keys,
67 ASSERT(*(size_t *)num_keys == 0);
70 ++*(size_t *)num_keys;
74 int callback_for_predict(void *num_keys,
76 ASSERT(*(size_t *)num_keys < 2);
77 switch (*(size_t *)num_keys) {
91 ++*(size_t *)num_keys;
|
| trie-test.cc | 59 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() == 4)
[all...] |
| /bootable/recovery/ |
| verifier_test.cpp | 144 int num_keys = 1; local
151 key = load_keys(argv[0], &num_keys);
157 int result = verify_file(*argv, key, num_keys);
|
| /external/openssh/ |
| misc.c | 569 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; j++)
[all...] |
| /external/chromium/net/base/ |
| dnssec_chain_verifier.cc | 466 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/ |
| trie-c.cc | 81 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;
|
| trie-build.cc | 11 void Trie::build(const char * const *keys, std::size_t num_keys,
14 MARISA_THROW_IF((keys == NULL) && (num_keys != 0), MARISA_PARAM_ERROR);
16 temp_keys.resize(num_keys);
|
| trie.h | 25 void build(const char * const *keys, std::size_t num_keys,
185 std::size_t num_keys() const;
322 size_t num_keys, const size_t *key_lengths, const double *key_weights,
|
| /external/bluetooth/bluedroid/stack/btm/ |
| btm_devctl.c | [all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie-c.cc | 81 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;
|
| trie-build.cc | 11 void Trie::build(const char * const *keys, std::size_t num_keys,
14 MARISA_ALPHA_THROW_IF((keys == NULL) && (num_keys != 0),
17 temp_keys.resize(num_keys);
|
| trie.h | 25 void build(const char * const *keys, std::size_t num_keys,
185 std::size_t num_keys() const;
322 const char * const *keys, size_t num_keys, const size_t *key_lengths,
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/X11/extensions/ |
| XInput.h | 372 short num_keys; member in struct:__anon25770
755 unsigned short num_keys; member in struct:_XKeyInfo
887 short num_keys; member in struct:__anon25803
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/X11/extensions/ |
| XInput.h | 372 short num_keys; member in struct:__anon27360
755 unsigned short num_keys; member in struct:_XKeyInfo
887 short num_keys; member in struct:__anon27393
[all...] |
