/external/openfst/src/include/fst/ |
D | matcher.h | 155 match_label_(kNoLabel), 157 loop_(kNoLabel, 0, Weight::One(), kNoStateId), 179 match_label_(kNoLabel), 232 match_label_ = kNoLabel; in Find() 236 match_label_ = match_label == kNoLabel ? 0 : match_label; in Find() 250 match_label_ = kNoLabel; in LowerBound() 405 Label rho_label = kNoLabel, 419 rho_label_ = kNoLabel; 450 has_rho_ = rho_label_ != kNoLabel; in SetState() 454 if (match_label == rho_label_ && rho_label_ != kNoLabel) { in Find() [all …]
|
D | label-reachable.h | 52 final_label_(kNoLabel) {} in reach_input_() 67 if (final_label_ == kNoLabel) in FinalLabel() 68 final_label_ = label2index_[kNoLabel]; in FinalLabel() 324 Label reach_label = kNoLabel; in Reach() 437 if (label2state_.find(kNoLabel) == label2state_.end()) { in TransformFst() 438 label2state_[kNoLabel] = ons; in TransformFst() 442 Arc arc(kNoLabel, kNoLabel, final, label2state_[kNoLabel]); in TransformFst()
|
D | lookahead-filter.h | 471 return FilterState(filter_.Start(), FilterState2(kNoLabel)); in Start() 488 if (flabel != kNoLabel) { // Have a lookahead label? in SetState() 497 FilterState2(kNoLabel)); in FilterArc() 501 if (flabel != kNoLabel) // Have a lookahead label? in FilterArc() 510 return FilterState(f1, FilterState2(kNoLabel)); in FilterArc() 524 if (flabel != kNoLabel) in FilterFinal() 552 if (labelb != kNoLabel) { in PushedLabelFilterArc() 577 return FilterState(f1, FilterState2(kNoLabel)); in PushLabelFilterArc() 580 return FilterState(f1, FilterState2(kNoLabel)); in PushLabelFilterArc() 582 Arc larc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId); in PushLabelFilterArc() [all …]
|
D | compact-fst.h | 249 compacts_[pos++] = compactor.Compact(s, A(kNoLabel, kNoLabel, in CompactFstData() 295 if (arc.ilabel != kNoLabel) in CompactFstData() 314 if (compactor.Expand(i, *it).ilabel != kNoLabel) in CompactFstData() 318 compacts_[i] = compactor.Compact(i, Arc(kNoLabel, kNoLabel, in CompactFstData() 327 if (arc.ilabel != kNoLabel) { in CompactFstData() 343 if (arc.ilabel != kNoLabel) { in CompactFstData() 550 Arc arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId); in Final() 557 return arc.ilabel == kNoLabel ? arc.weight : Weight::Zero(); in Final() 612 if (label == kNoLabel) in CountEpsilons() 685 if (arc.ilabel == kNoLabel) in Expand() [all …]
|
D | compose-filter.h | 259 if (arc1->olabel == kNoLabel) in FilterArc() 262 else if (arc2->ilabel == kNoLabel) in FilterArc() 344 if (arc2->ilabel == kNoLabel) in FilterArc() 347 else if (arc1->olabel == kNoLabel) in FilterArc() 437 if (arc2->ilabel == kNoLabel) // Epsilon on Fst1 in FilterArc() 442 else if (arc1->olabel == kNoLabel) // Epsilon on Fst2 in FilterArc() 513 if (arc1->olabel == kNoLabel) in FilterArc() 515 if (arc2->ilabel == kNoLabel) in FilterArc()
|
D | shortest-path.h | 129 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId)); in SingleShortestPath() 133 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId)); in SingleShortestPath() 163 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), in SingleShortestPath()
|
D | arcfilter.h | 92 CompactSet<Label, kNoLabel> labels_;
|
D | string.h | 45 Label unknown_label = kNoLabel, 128 if ((n == -1) && (unknown_label_ != kNoLabel)) in ConvertSymbolToLabel()
|
D | lookahead-matcher.h | 142 prefix_arc_(kNoLabel, kNoLabel, Weight::One(), kNoStateId) {} in LookAheadMatcherBase() 358 if (matcher_.Find(kNoLabel)) { in LookAheadFst() 371 Label label = kNoLabel; in LookAheadFst()
|
D | closure.h | 66 if (start != kNoLabel) in Closure()
|
D | encode.h | 152 return kNoLabel; in GetLabel() 452 return A(kNoLabel, kNoLabel, Weight::NoWeight(), arc.nextstate); in operator()
|
D | replace.h | 293 : root(kNoLabel), in ReplaceFstOptions() 1248 loop_(fst::kNoLabel, 0, A::Weight::One(), fst::kNoStateId) { in ReplaceFstMatcher() 1260 loop_(fst::kNoLabel, 0, A::Weight::One(), fst::kNoStateId) { 1351 if (label_ == 0 || label_ == kNoLabel) { in Find_() 1359 found = current_matcher_->Find(kNoLabel) || final_arc_ || found; in Find_()
|
D | randgen.h | 355 superfinal_(kNoLabel) { in RandGenFstImpl() 371 superfinal_(kNoLabel) { in RandGenFstImpl() 476 if (superfinal_ == kNoLabel) { in Expand()
|
D | difference.h | 96 copts.matcher1 = new R(fst1, MATCH_NONE, kNoLabel, MATCHER_REWRITE_ALWAYS, in DifferenceFst()
|
D | relabel.h | 86 if (it->second == kNoLabel) { in Relabel() 98 if (it->second == kNoLabel) { in Relabel()
|
D | replace-util.h | 201 nonterminal_array_.push_back(kNoLabel); in ReplaceUtil() 224 nonterminal_array_.push_back(kNoLabel); in ReplaceUtil()
|
D | compose.h | 298 Arc loop(match_input ? 0 : kNoLabel, match_input ? kNoLabel : 0, in OrderedExpand()
|
/external/openfst/src/include/fst/extensions/pdt/ |
D | compose.h | 56 loop_.ilabel = kNoLabel; in matcher_() 60 loop_.olabel = kNoLabel; in matcher_() 167 CompactSet<Label, kNoLabel> open_parens_; 170 CompactSet<Label, kNoLabel> close_parens_; 190 if (match_label == kNoLabel && (flags_ & kParenList)) { in Find() 191 if (open_parens_.LowerBound() != kNoLabel) { in Find() 196 if (close_parens_.LowerBound() != kNoLabel) { in Find() 228 if (close_parens_.LowerBound() != kNoLabel) { in Next() 233 done_ = !matcher_.Find(kNoLabel); in Next() 238 done_ = !matcher_.Find(kNoLabel); in Next() [all …]
|
D | pdt.h | 59 : parens_(parens), min_paren_(kNoLabel), max_paren_(kNoLabel) { in PdtStack() 65 if (min_paren_ == kNoLabel || p.first < min_paren_) in PdtStack() 70 if (max_paren_ == kNoLabel || p.first > max_paren_) in PdtStack() 86 if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_) in Find()
|
D | replace.h | 68 Label max_label = kNoLabel; in Replace() 79 vector<StateId> fst_start(ifst_array.size(), kNoLabel); in Replace() 109 if (max_label == kNoLabel || arc.olabel > max_label) in Replace() 161 Label open_paren = kNoLabel, close_paren = kNoLabel; in Replace()
|
D | shortest-path.h | 94 : paren_id(kNoLabel), src_start(kNoStateId), dest_start(kNoStateId) {} in ParenSpec() 115 paren_id(kNoLabel), in SearchData() 126 paren_(kNoLabel, kNoStateId, kNoStateId), in PdtShortestPathData() 317 while (s.state != kNoLabel) { in GC() 323 if (p.start != start && p.start != kNoLabel) { // entering sub-subgraph in GC() 348 = Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId); 652 Relax(s, s, arc, w, kNoLabel); in ProcNonParen() 689 Label paren_id = kNoLabel; in GetPath() 697 if (paren_id != kNoLabel) { // paren? in GetPath() 741 Label arc_paren_id = kNoLabel; in GetPathArc() [all …]
|
/external/openfst/src/test/ |
D | fst_test.cc | 68 return p.first == kNoLabel ? in Expand() 69 Arc(kNoLabel, kNoLabel, p.second, kNoStateId) : in Expand()
|
D | fst_test.h | 96 CHECK(!matcher.Find(kNoLabel)); // no explicit epsilons in TestBase() 98 CHECK_EQ(matcher.Value().ilabel, kNoLabel); // implicit epsilon loop in TestBase()
|
/external/openfst/src/include/fst/extensions/far/ |
D | compile-strings.h | 190 typename Arc::Label unknown_label = kNoLabel; in FarCompileStrings() 202 if (unknown_label == kNoLabel) { in FarCompileStrings()
|
/external/openfst/src/include/fst/extensions/ngram/ |
D | ngram-fst.h | 406 Label label = kNoLabel; in NGramFstImpl() 760 loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) { in NGramFstMatcher() 769 loop_(kNoLabel, 0, A::Weight::One(), kNoStateId) { 798 const Label nolabel = kNoLabel; in Find_()
|