| /external/marisa-trie/lib/marisa/ |
| trie.cc | 10 trie_(), tail_(), num_first_branches_(0), num_keys_(0) {}
38 temp.trie_.reset(new (std::nothrow) Trie);
40 temp.trie_->map(mapper);
79 temp.trie_.reset(new (std::nothrow) Trie);
81 temp.trie_->read(reader);
118 trie_->write(writer);
123 return has_trie() ? (trie_->num_tries() + 1) : (louds_.empty() ? 0 : 1);
132 num_nodes += trie_->num_nodes();
140 + links_.total_size() + (has_trie() ? trie_->total_size() : 0)
155 Swap(&trie_, &rhs->trie_)
[all...] |
| trie-inline.h | 163 trie_->trie_match<T>(get_link(node, link_id), query, pos) :
214 trie_->trie_prefix_match<T>(
273 trie_->trie_restore(get_link(cur.node()), &key);
342 return trie_.get() != NULL;
|
| trie-search.cc | 255 trie_->trie_restore(get_link(node), key);
272 trie_->trie_restore(get_link(node), key);
303 trie_->trie_restore(get_link(node), key_buf, key_buf_size, pos);
330 trie_->trie_restore(get_link(node), key_buf, key_buf_size, pos);
386 next_pos = trie_->trie_match<T>(get_link(node), query, pos);
407 next_pos = trie_->trie_match<T>(get_link(node), query, pos);
660 next_pos = trie_->trie_prefix_match<T>(get_link(node), query, pos, key);
685 next_pos = trie_->trie_prefix_match<T>(
|
| trie-build.cc | 139 progress.test_total_size(trie_->terminal_flags_.total_size());
278 trie_.reset(new (std::nothrow) Trie);
280 trie_->build_trie(rkeys, terminals, ++progress);
294 trie_.reset(new (std::nothrow) Trie);
296 trie_->build_trie(rkeys, terminals, ++progress);
|
| trie.h | 201 std::auto_ptr<Trie> trie_; member in class:marisa::Trie
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie.cc | 10 trie_(), tail_(), num_first_branches_(0), num_keys_(0) {}
38 temp.trie_.reset(new (std::nothrow) Trie);
40 temp.trie_->map(mapper);
79 temp.trie_.reset(new (std::nothrow) Trie);
81 temp.trie_->read(reader);
118 trie_->write(writer);
123 return has_trie() ? (trie_->num_tries() + 1) : (louds_.empty() ? 0 : 1);
132 num_nodes += trie_->num_nodes();
140 + links_.total_size() + (has_trie() ? trie_->total_size() : 0)
155 Swap(&trie_, &rhs->trie_)
[all...] |
| trie-inline.h | 164 trie_->trie_match<T>(get_link(node, link_id), query, pos) :
219 trie_->trie_prefix_match<T>(
278 trie_->trie_restore(get_link(cur.node()), &key);
351 return trie_.get() != NULL;
|
| trie-build.cc | 148 progress.test_total_size(trie_->terminal_flags_.total_size());
292 trie_.reset(new (std::nothrow) Trie);
294 trie_->build_trie(rkeys, terminals, ++progress);
308 trie_.reset(new (std::nothrow) Trie);
310 trie_->build_trie(rkeys, terminals, ++progress);
|
| trie-search.cc | 267 trie_->trie_restore(get_link(node), key);
291 trie_->trie_restore(get_link(node), key);
322 trie_->trie_restore(get_link(node), key_buf, key_buf_size, pos);
349 trie_->trie_restore(get_link(node), key_buf, key_buf_size, pos);
405 next_pos = trie_->trie_match<T>(get_link(node), query, pos);
426 next_pos = trie_->trie_match<T>(get_link(node), query, pos);
691 next_pos = trie_->trie_prefix_match<T>(get_link(node), query, pos, key);
716 next_pos = trie_->trie_prefix_match<T>(
|
| trie.h | 201 std::auto_ptr<Trie> trie_; member in class:marisa_alpha::Trie
|
