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

  /external/marisa-trie/v0_1_5/tests/
trie-test.cc 11 FindCallback(std::vector<marisa_alpha::UInt32> *key_ids,
13 : key_ids_(key_ids), key_lengths_(key_lengths) {}
33 PredictCallback(std::vector<marisa_alpha::UInt32> *key_ids,
35 : key_ids_(key_ids), keys_(keys) {}
75 std::vector<marisa_alpha::UInt32> key_ids; local
76 trie.build(keys, &key_ids,
83 ASSERT(key_ids.size() == 5);
84 ASSERT(key_ids[0] == 3);
85 ASSERT(key_ids[1] == 1);
86 ASSERT(key_ids[2] == 0)
193 std::vector<marisa_alpha::UInt32> key_ids; local
435 std::vector<marisa_alpha::UInt32> key_ids; local
533 std::vector<marisa_alpha::UInt32> key_ids; local
597 std::vector<marisa_alpha::UInt32> key_ids; local
    [all...]
c-test.c 98 marisa_alpha_uint32 key_ids[8]; local
130 ASSERT(marisa_alpha_build(trie, keys, 5, NULL, NULL, key_ids,
138 ASSERT(key_ids[0] == 3);
139 ASSERT(key_ids[1] == 1);
140 ASSERT(key_ids[2] == 0);
141 ASSERT(key_ids[3] == 3);
142 ASSERT(key_ids[4] == 2);
146 key_ids[i], key_buf, sizeof(key_buf), &key_length) == MARISA_ALPHA_OK);
152 ASSERT(key_id == key_ids[i]);
156 ASSERT(key_id == key_ids[i])
    [all...]
  /external/marisa-trie/tests/
trie-test.cc 11 FindCallback(std::vector<marisa::UInt32> *key_ids,
13 : key_ids_(key_ids), key_lengths_(key_lengths) {}
33 PredictCallback(std::vector<marisa::UInt32> *key_ids,
35 : key_ids_(key_ids), keys_(keys) {}
75 std::vector<marisa::UInt32> key_ids; local
76 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL | MARISA_LABEL_ORDER);
82 ASSERT(key_ids.size() == 5);
83 ASSERT(key_ids[0] == 3);
84 ASSERT(key_ids[1] == 1);
85 ASSERT(key_ids[2] == 0)
191 std::vector<marisa::UInt32> key_ids; local
417 std::vector<marisa::UInt32> key_ids; local
515 std::vector<marisa::UInt32> key_ids; local
579 std::vector<marisa::UInt32> key_ids; local
    [all...]
c-test.c 93 marisa_uint32 key_ids[8]; local
123 ASSERT(marisa_build(trie, keys, 5, NULL, NULL, key_ids,
130 ASSERT(key_ids[0] == 3);
131 ASSERT(key_ids[1] == 1);
132 ASSERT(key_ids[2] == 0);
133 ASSERT(key_ids[3] == 3);
134 ASSERT(key_ids[4] == 2);
138 key_ids[i], key_buf, sizeof(key_buf), &key_length) == MARISA_OK);
144 ASSERT(key_id == key_ids[i]);
148 ASSERT(key_id == key_ids[i])
    [all...]
  /external/marisa-trie/lib/marisa/
trie.h 28 UInt32 *key_ids = NULL, int flags = 0);
31 std::vector<UInt32> *key_ids = NULL, int flags = 0);
33 std::vector<UInt32> *key_ids = NULL, int flags = 0);
69 UInt32 *key_ids, std::size_t *key_lengths,
72 UInt32 *key_ids, std::size_t *key_lengths,
75 UInt32 *key_ids, std::size_t *key_lengths,
79 std::vector<UInt32> *key_ids = NULL,
83 std::vector<UInt32> *key_ids = NULL,
87 std::vector<UInt32> *key_ids = NULL,
115 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const
    [all...]
trie-search.cc 12 PredictCallback(T key_ids, U keys, std::size_t max_num_results)
13 : key_ids_(key_ids), keys_(keys),
79 UInt32 *key_ids, std::size_t *key_lengths,
84 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
88 UInt32 *key_ids, std::size_t *key_lengths,
93 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
97 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
102 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
106 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
111 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results)
    [all...]
trie-c.cc 82 marisa_uint32 *key_ids, int flags) {
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
190 marisa_uint32 *key_ids, size_t *key_lengths,
198 *num_results = h->trie.find(ptr, key_ids, key_lengths, max_num_results);
201 key_ids, key_lengths, max_num_results);
258 const char *ptr, size_t length, marisa_uint32 *key_ids,
261 key_ids, max_num_results, num_results);
265 const char *ptr, size_t length, marisa_uint32 *key_ids,
274 ptr, key_ids, NULL, max_num_results);
277 ptr, length, key_ids, NULL, max_num_results)
    [all...]
trie-inline.h 29 UInt32 *key_ids, std::size_t *key_lengths,
32 key_ids, key_lengths, max_num_results);
36 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
39 key_ids, key_lengths, max_num_results);
75 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
76 return predict(str.c_str(), str.length(), key_ids, keys, max_num_results);
80 std::vector<UInt32> *key_ids, std::vector<std::string> *keys,
82 return predict(str.c_str(), str.length(), key_ids, keys, max_num_results);
86 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
88 key_ids, keys, max_num_results)
    [all...]
trie-build.cc 13 UInt32 *key_ids, int flags) {
31 build_trie(temp_keys, key_ids, flags);
35 std::vector<UInt32> *key_ids, int flags) {
43 build_trie(temp_keys, key_ids, flags);
47 std::vector<UInt32> *key_ids, int flags) {
57 build_trie(temp_keys, key_ids, flags);
61 std::vector<UInt32> *key_ids, int flags) {
62 if (key_ids == NULL) {
68 key_ids->swap(temp_key_ids);
72 UInt32 *key_ids, int flags)
    [all...]
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
trie.h 28 UInt32 *key_ids = NULL, int flags = 0);
31 std::vector<UInt32> *key_ids = NULL, int flags = 0);
33 std::vector<UInt32> *key_ids = NULL, int flags = 0);
69 UInt32 *key_ids, std::size_t *key_lengths,
72 UInt32 *key_ids, std::size_t *key_lengths,
75 UInt32 *key_ids, std::size_t *key_lengths,
79 std::vector<UInt32> *key_ids = NULL,
83 std::vector<UInt32> *key_ids = NULL,
87 std::vector<UInt32> *key_ids = NULL,
115 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const
    [all...]
trie-search.cc 12 PredictCallback(T key_ids, U keys, std::size_t max_num_results)
13 : key_ids_(key_ids), keys_(keys),
80 UInt32 *key_ids, std::size_t *key_lengths,
85 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
89 UInt32 *key_ids, std::size_t *key_lengths,
95 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
99 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
104 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results);
108 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
114 MakeContainer(key_ids), MakeContainer(key_lengths), max_num_results)
    [all...]
trie-inline.h 29 UInt32 *key_ids, std::size_t *key_lengths,
32 key_ids, key_lengths, max_num_results);
36 std::vector<UInt32> *key_ids, std::vector<std::size_t> *key_lengths,
39 key_ids, key_lengths, max_num_results);
76 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
77 return predict(str.c_str(), str.length(), key_ids, keys, max_num_results);
81 std::vector<UInt32> *key_ids, std::vector<std::string> *keys,
83 return predict(str.c_str(), str.length(), key_ids, keys, max_num_results);
87 UInt32 *key_ids, std::string *keys, std::size_t max_num_results) const {
89 key_ids, keys, max_num_results)
    [all...]
trie-c.cc 82 const double *key_weights, marisa_alpha_uint32 *key_ids, int flags) try {
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
215 marisa_alpha_uint32 *key_ids, size_t *key_lengths,
223 *num_results = h->trie.find(ptr, key_ids, key_lengths, max_num_results);
226 key_ids, key_lengths, max_num_results);
287 const char *ptr, size_t length, marisa_alpha_uint32 *key_ids,
290 key_ids, max_num_results, num_results);
295 marisa_alpha_uint32 *key_ids, size_t max_num_results,
304 ptr, key_ids, NULL, max_num_results);
307 ptr, length, key_ids, NULL, max_num_results)
    [all...]
trie-build.cc 13 UInt32 *key_ids, int flags) {
33 build_trie(temp_keys, key_ids, flags);
37 std::vector<UInt32> *key_ids, int flags) {
46 build_trie(temp_keys, key_ids, flags);
50 std::vector<UInt32> *key_ids, int flags) {
60 build_trie(temp_keys, key_ids, flags);
64 std::vector<UInt32> *key_ids, int flags) {
65 if (key_ids == NULL) {
72 key_ids->swap(temp_key_ids);
81 UInt32 *key_ids, int flags)
    [all...]
  /external/marisa-trie/tools/
marisa-benchmark.cc 174 marisa::Trie *trie, std::vector<marisa::UInt32> *key_ids) {
176 trie->build(keys, key_ids, num_tries
185 const std::vector<marisa::UInt32> &key_ids) {
188 for (std::size_t i = 0; i < key_ids.size(); ++i) {
190 trie.restore(key_ids[i], &key);
196 print_time_info(key_ids.size(), cl.elasped());
201 const std::vector<marisa::UInt32> &key_ids) {
205 if (key_id != key_ids[i]) {
215 const std::vector<marisa::UInt32> &key_ids) {
221 if ((num_keys == 0) || (found_key_ids.back() != key_ids[i]))
274 std::vector<marisa::UInt32> key_ids; local
    [all...]
marisa-predict.cc 62 std::vector<marisa::UInt32> key_ids; local
69 key_ids.clear();
74 str, &key_ids, &keys, max_num_results);
77 str, &key_ids, &keys, max_num_results);
85 std::cout << key_ids[i] << '\t' << keys[i] << '\t' << str << '\n';
marisa-find.cc 40 static std::vector<marisa::UInt32> key_ids; local
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
46 std::cout << key_ids[i] << '\t'; local
52 key_ids.clear();
  /external/marisa-trie/v0_1_5/tools/
marisa_alpha-benchmark.cc 174 marisa_alpha::Trie *trie, std::vector<marisa_alpha::UInt32> *key_ids) {
176 trie->build(keys, key_ids, num_tries
185 const std::vector<marisa_alpha::UInt32> &key_ids) {
188 for (std::size_t i = 0; i < key_ids.size(); ++i) {
190 trie.restore(key_ids[i], &key);
196 print_time_info(key_ids.size(), cl.elasped());
201 const std::vector<marisa_alpha::UInt32> &key_ids) {
205 if (key_id != key_ids[i]) {
215 const std::vector<marisa_alpha::UInt32> &key_ids) {
221 if ((num_keys == 0) || (found_key_ids.back() != key_ids[i]))
274 std::vector<marisa_alpha::UInt32> key_ids; local
    [all...]
marisa_alpha-predict.cc 62 std::vector<marisa_alpha::UInt32> key_ids; local
69 key_ids.clear();
74 str, &key_ids, &keys, max_num_results);
77 str, &key_ids, &keys, max_num_results);
85 std::cout << key_ids[i] << '\t' << keys[i] << '\t' << str << '\n';
marisa_alpha-find.cc 40 static std::vector<marisa_alpha::UInt32> key_ids; local
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
46 std::cout << key_ids[i] << '\t'; local
52 key_ids.clear();

Completed in 205 milliseconds