OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:link_flags_
(Results
1 - 10
of
10
) sorted by null
/external/marisa-trie/lib/marisa/
trie.cc
9
: louds_(), labels_(), terminal_flags_(),
link_flags_
(), links_(),
31
temp.
link_flags_
.map(mapper);
72
temp.
link_flags_
.read(reader);
112
link_flags_
.write(writer);
139
+ terminal_flags_.total_size() +
link_flags_
.total_size()
153
link_flags_
.swap(&rhs->
link_flags_
);
trie-build.cc
126
if (
link_flags_
.empty()) {
129
progress.test_total_size(
link_flags_
.total_size());
142
link_flags_
.push_back(true);
144
link_flags_
.build();
147
labels_[
link_flags_
.select1(i)] = (UInt8)(next_terminals[i] % 256);
150
link_flags_
.clear_select0s();
152
link_flags_
.clear_select1s();
158
progress.test_total_size(
link_flags_
.total_size());
170
link_flags_
.push_back(false);
177
const UInt32 node = (UInt32)(
link_flags_
.size() - queue.size())
[
all
...]
trie-inline.h
322
return (
link_flags_
.empty()) ? false :
link_flags_
[node];
326
return
link_flags_
.rank1(node);
338
return !
link_flags_
.empty();
trie-search.cc
284
const UInt32 link_id =
link_flags_
.rank1(node);
288
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
346
const UInt32 link_id =
link_flags_
.rank1(node);
351
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
439
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
719
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
trie.h
199
BitVector
link_flags_
;
member in class:marisa::Trie
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
trie.cc
9
: louds_(), labels_(), terminal_flags_(),
link_flags_
(), links_(),
31
temp.
link_flags_
.map(mapper);
72
temp.
link_flags_
.read(reader);
112
link_flags_
.write(writer);
139
+ terminal_flags_.total_size() +
link_flags_
.total_size()
153
link_flags_
.swap(&rhs->
link_flags_
);
trie-build.cc
135
if (
link_flags_
.empty()) {
138
progress.test_total_size(
link_flags_
.total_size());
151
link_flags_
.push_back(true);
153
link_flags_
.build();
156
labels_[
link_flags_
.select1(i)] = (UInt8)(next_terminals[i] % 256);
159
link_flags_
.clear_select0s();
161
link_flags_
.clear_select1s();
167
progress.test_total_size(
link_flags_
.total_size());
179
link_flags_
.push_back(false);
186
const UInt32 node = (UInt32)(
link_flags_
.size() - queue.size())
[
all
...]
trie-inline.h
331
return (
link_flags_
.empty()) ? false :
link_flags_
[node];
335
return
link_flags_
.rank1(node);
347
return !
link_flags_
.empty();
trie-search.cc
303
const UInt32 link_id =
link_flags_
.rank1(node);
307
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
365
const UInt32 link_id =
link_flags_
.rank1(node);
370
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
458
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
750
+ labels_[
link_flags_
.select1(link_id + 1)] - offset;
trie.h
199
BitVector
link_flags_
;
member in class:marisa_alpha::Trie
Completed in 60 milliseconds