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