HomeSort by relevance Sort by last modified time
    Searched refs:kNoLabel (Results 1 - 25 of 33) sorted by null

1 2

  /external/openfst/src/include/fst/
matcher.h 70 // // Returns true if a match found. kNoLabel matches any
134 // Arc(kNoLabel, 0, Weight::One(), current_state) as well as any
136 // Arc(0, kNoLabel, Weight::One(), current_state) is instead matched.
155 match_label_(kNoLabel),
157 loop_(kNoLabel, 0, Weight::One(), kNoStateId),
179 match_label_(kNoLabel),
232 match_label_ = kNoLabel;
236 match_label_ = match_label == kNoLabel ? 0 : match_label;
250 match_label_ = kNoLabel;
389 // kNoLabel, this special matching is not done. RhoMatcher i
    [all...]
arcfilter.h 92 CompactSet<Label, kNoLabel> labels_;
compact-fst.h 55 // i.e. ilabel = olabel = kNoLabel and nextstate = kNoStateId.
249 compacts_[pos++] = compactor.Compact(s, A(kNoLabel, kNoLabel,
295 if (arc.ilabel != kNoLabel)
314 if (compactor.Expand(i, *it).ilabel != kNoLabel)
318 compacts_[i] = compactor.Compact(i, Arc(kNoLabel, kNoLabel,
327 if (arc.ilabel != kNoLabel) {
343 if (arc.ilabel != kNoLabel) {
550 Arc arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId)
    [all...]
label-reachable.h 52 final_label_(kNoLabel) {}
67 if (final_label_ == kNoLabel)
68 final_label_ = label2index_[kNoLabel];
324 Label reach_label = kNoLabel;
393 // includes kNoLabel that is used internally for super-final
406 // final state is redirected via a transition labeled with kNoLabel
407 // to a new kNoLabel-specific final state. Creates super-initial
437 if (label2state_.find(kNoLabel) == label2state_.end()) {
438 label2state_[kNoLabel] = ons;
442 Arc arc(kNoLabel, kNoLabel, final, label2state_[kNoLabel])
    [all...]
compose-filter.h 182 // // If an arc label to be matched is kNolabel, then that side
259 if (arc1->olabel == kNoLabel)
262 else if (arc2->ilabel == kNoLabel)
344 if (arc2->ilabel == kNoLabel)
347 else if (arc1->olabel == kNoLabel)
437 if (arc2->ilabel == kNoLabel) // Epsilon on Fst1
442 else if (arc1->olabel == kNoLabel) // Epsilon on Fst2
513 if (arc1->olabel == kNoLabel)
515 if (arc2->ilabel == kNoLabel)
lookahead-filter.h 471 return FilterState(filter_.Start(), FilterState2(kNoLabel));
488 if (flabel != kNoLabel) { // Have a lookahead label?
497 FilterState2(kNoLabel));
501 if (flabel != kNoLabel) // Have a lookahead label?
510 return FilterState(f1, FilterState2(kNoLabel));
524 if (flabel != kNoLabel)
552 if (labelb != kNoLabel) {
577 return FilterState(f1, FilterState2(kNoLabel));
580 return FilterState(f1, FilterState2(kNoLabel));
582 Arc larc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId)
    [all...]
shortest-path.h 129 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
133 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
163 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(),
closure.h 66 if (start != kNoLabel)
string.h 45 Label unknown_label = kNoLabel,
128 if ((n == -1) && (unknown_label_ != kNoLabel))
encode.h 145 // Given an arc, look up its encoded label. Returns kNoLabel if not found.
152 return kNoLabel;
452 return A(kNoLabel, kNoLabel, Weight::NoWeight(), arc.nextstate);
difference.h 96 copts.matcher1 = new R(fst1, MATCH_NONE, kNoLabel, MATCHER_REWRITE_ALWAYS,
lookahead-matcher.h 142 prefix_arc_(kNoLabel, kNoLabel, Weight::One(), kNoStateId) {}
358 if (matcher_.Find(kNoLabel)) {
371 Label label = kNoLabel;
replace.h 293 : root(kNoLabel),
    [all...]
relabel.h 86 if (it->second == kNoLabel) {
98 if (it->second == kNoLabel) {
replace-util.h 201 nonterminal_array_.push_back(kNoLabel);
224 nonterminal_array_.push_back(kNoLabel);
  /external/openfst/src/include/fst/extensions/pdt/
pdt.h 59 : parens_(parens), min_paren_(kNoLabel), max_paren_(kNoLabel) {
65 if (min_paren_ == kNoLabel || p.first < min_paren_)
70 if (max_paren_ == kNoLabel || p.first > max_paren_)
86 if (min_paren_ == kNoLabel || label < min_paren_ || label > max_paren_)
replace.h 68 Label max_label = kNoLabel;
79 vector<StateId> fst_start(ifst_array.size(), kNoLabel);
109 if (max_label == kNoLabel || arc.olabel > max_label)
161 Label open_paren = kNoLabel, close_paren = kNoLabel;
compose.h 31 // Return paren arcs for Find(kNoLabel).
34 // Return a kNolabel loop for Find(paren).
56 loop_.ilabel = kNoLabel;
60 loop_.olabel = kNoLabel;
167 CompactSet<Label, kNoLabel> open_parens_;
170 CompactSet<Label, kNoLabel> close_parens_;
190 if (match_label == kNoLabel && (flags_ & kParenList)) {
191 if (open_parens_.LowerBound() != kNoLabel) {
196 if (close_parens_.LowerBound() != kNoLabel) {
228 if (close_parens_.LowerBound() != kNoLabel) {
    [all...]
shortest-path.h 58 // (c) Parent().state is kNoLabel for the 'start' state.
94 : paren_id(kNoLabel), src_start(kNoStateId), dest_start(kNoStateId) {}
115 paren_id(kNoLabel),
120 int16 paren_id; // If parent arc has paren, paren ID, o.w. kNoLabel
126 paren_(kNoLabel, kNoStateId, kNoStateId),
317 while (s.state != kNoLabel) {
323 if (p.start != start && p.start != kNoLabel) { // entering sub-subgraph
348 = Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId);
652 Relax(s, s, arc, w, kNoLabel);
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
test-properties.h 126 Arc prev_arc(kNoLabel, kNoLabel, Weight::One(), 0);
162 if (prev_arc.ilabel != kNoLabel && arc.ilabel < prev_arc.ilabel) {
166 if (prev_arc.olabel != kNoLabel && arc.olabel < prev_arc.olabel) {
shortest-path.h 99 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
103 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
120 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(),
closure.h 58 if (start != kNoLabel)
  /external/openfst/src/test/
fst_test.cc 68 return p.first == kNoLabel ?
69 Arc(kNoLabel, kNoLabel, p.second, kNoStateId) :
fst_test.h 96 CHECK(!matcher.Find(kNoLabel)); // no explicit epsilons
98 CHECK_EQ(matcher.Value().ilabel, kNoLabel); // implicit epsilon loop
  /external/openfst/src/include/fst/extensions/far/
compile-strings.h 190 typename Arc::Label unknown_label = kNoLabel;
202 if (unknown_label == kNoLabel) {

Completed in 3012 milliseconds

1 2