HomeSort by relevance Sort by last modified time
    Searched refs:arc2 (Results 1 - 8 of 8) sorted by null

  /external/openfst/src/include/fst/
equal.h 74 Arc arc2 = aiter2.Value(); local
75 if (arc1.ilabel != arc2.ilabel) {
80 << ", ilabel2 = " << arc2.ilabel;
82 } else if (arc1.olabel != arc2.olabel) {
87 << ", olabel2 = " << arc2.olabel;
89 } else if (!ApproxEqual(arc1.weight, arc2.weight, delta)) {
94 << ", weight2 = " << arc2.weight;
96 } else if (arc1.nextstate != arc2.nextstate) {
101 << ", nextstate2 = " << arc2.nextstate;
compose-filter.h 186 // FilterState FilterArc(Arc *arc1, Arc *arc2) const;
258 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
262 else if (arc2->ilabel == kNoLabel)
343 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
344 if (arc2->ilabel == kNoLabel)
436 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
437 if (arc2->ilabel == kNoLabel) // Epsilon on Fst1
510 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
511 FilterState f = filter_.FilterArc(arc1, arc2);
514 arc1->ilabel = arc2->ilabel
    [all...]
arcsort.h 179 bool operator() (A arc1, A arc2) const {
180 return arc1.ilabel < arc2.ilabel;
193 bool operator() (const A &arc1, const A &arc2) const {
194 return arc1.olabel < arc2.olabel;
lookahead-filter.h 184 // This filter uses a lookahead matcher in FilterArc(arc1, arc2) to
186 // arc2.nextstate), blocking moving forward when its determined to be
248 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
251 const FilterState &f = filter_.FilterArc(arc1, arc2);
255 return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, f) :
256 LookAheadFilterArc(arc2, arc1, f);
365 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
366 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2);
378 arc2->weight = Divide(Times(arc2->weight, lweight), fweight)
    [all...]
minimize.h 90 const A& arc2 = aiter2.Value(); local
91 if (arc1.ilabel < arc2.ilabel) return true;
92 if (arc1.ilabel > arc2.ilabel) return false;
95 partition_.class_id(arc2.nextstate)) return true;
97 partition_.class_id(arc2.nextstate)) return false;
compose.h 331 void AddArc(StateId s, const Arc &arc1, const Arc &arc2,
333 StateTuple tuple(arc1.nextstate, arc2.nextstate, f);
334 Arc oarc(arc1.ilabel, arc2.olabel, Times(arc1.weight, arc2.weight),
  /external/openfst/src/include/fst/extensions/pdt/
compose.h 352 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
353 FilterState1 f1 = filter_.FilterArc(arc1, arc2);
358 if (arc1->olabel == kNoLabel && arc2->ilabel) { // arc2 parentheses
360 arc1->ilabel = arc2->ilabel;
361 } else if (arc2->ilabel) {
362 arc2->olabel = arc1->ilabel;
364 return FilterParen(arc2->ilabel, f1, f2);
365 } else if (arc2->ilabel == kNoLabel && arc1->olabel) { // arc1 parentheses
367 arc2->olabel = arc1->olabel
    [all...]
  /external/lzma/CPP/7zip/UI/Common/
OpenArchive.cpp 443 CArc arc2; local
444 RINOK(arc.GetItemPath(mainSubfile, arc2.Path));
449 setSubArchiveName->SetSubArchiveName(arc2.Path);
451 arc2.SubfileIndex = mainSubfile;
452 HRESULT result = arc2.OpenStream(codecs, formatIndex, subStream, NULL, callback);
457 RINOK(arc.GetItemMTime(mainSubfile, arc2.MTime, arc2.MTimeDefined));
458 Arcs.Add(arc2);

Completed in 1097 milliseconds