/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
arcfilter.h | 28 bool operator()(const A &arc) const { return true; } 36 bool operator()(const A &arc) const { 37 return arc.ilabel == 0 && arc.olabel == 0;
|
rmfinalepsilon.h | 51 const A& arc = aiter.Value(); local 52 if (coaccess[arc.nextstate]) { 71 const A& arc = aiter.Value(); local 73 if (finals.find(arc.nextstate) != finals.end()) { 75 if (arc.ilabel == 0 && arc.olabel == 0) { 76 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); 78 arcs.push_back(arc); 81 arcs.push_back(arc); [all...] |
reweight.h | 34 // An arc of weight w, with an origin state of potential p and 38 template <class Arc> 39 void Reweight(MutableFst<Arc> *fst, vector<typename Arc::Weight> potential, 41 typedef typename Arc::Weight Weight; 58 for (StateIterator< MutableFst<Arc> > sit(*fst); 61 typename Arc::StateId state = sit.Value(); 62 for (MutableArcIterator< MutableFst<Arc> > ait(fst, state); 65 Arc arc = ait.Value() local 94 Arc arc = ait.Value(); local [all...] |
verify.h | 28 template<class Arc> 29 bool Verify(const Fst<Arc> &fst) { 30 typedef typename Arc::Label Label; 31 typedef typename Arc::Weight Weight; 32 typedef typename Arc::StateId StateId; 40 for (StateIterator< Fst<Arc> > siter(fst); 53 for (StateIterator< Fst<Arc> > siter(fst); 58 for (ArcIterator< Fst<Arc> > aiter(fst, s); 61 const Arc &arc =aiter.Value() local [all...] |
map.h | 35 // A final weight is mapped to an arc to the superfinal state 40 // A final weight is mapped to an arc to the superfinal state 52 // // Maps an arc type A to arc type B. 53 // B operator()(const A &arc); 78 // Maps an arc type A using a mapper function object C, passed 100 const A &arc = aiter.Value(); local 101 aiter.SetValue((*mapper)(arc)); 146 // Maps an arc type A using a mapper function object C, passed 154 // Maps an arc type A to an arc type B using mapper functio [all...] |
dfs-visit.h | 34 // template <class Arc> 37 // typedef typename Arc::StateId StateId; 41 // void InitVisit(const Fst<Arc> &fst); 44 // // Invoked when tree arc examined (to white/undiscovered state) 45 // bool TreeArc(StateId s, const Arc &a); 46 // // Invoked when back arc examined (to grey/unfinished state) 47 // bool BackArc(StateId s, const Arc &a); 48 // // Invoked when forward or cross arc examined (to black/finished state) 49 // bool ForwardOrCrossArc(StateId s, const Arc &a); 50 // // Invoked when state finished (PARENT is kNoStateID and ARC == NUL 123 const Arc &arc = aiter.Value(); local [all...] |
invert.h | 27 // Mapper to implement inversion of an arc. 31 A operator()(const A &arc) { 32 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate); 48 template<class Arc> inline 49 void Invert(MutableFst<Arc> *fst) { Map(fst, InvertMapper<Arc>()); } 59 // time and to visit an input state or arc is assumed and exclusiv [all...] |
prune.h | 35 // Arc filter. 55 template <class Arc, class ArcFilter> 56 void Prune(MutableFst<Arc> *fst, 57 const PruneOptions<Arc, ArcFilter> &opts) { 58 typedef typename Arc::Weight Weight; 59 typedef typename Arc::StateId StateId; 97 for (MutableArcIterator< MutableFst<Arc> > it(fst, state); 100 Arc arc = it.Value(); local 101 if (!opts.filter(arc)) continue 199 Arc arc = ait.Value(); local [all...] |
test-properties.h | 73 template<class Arc> 74 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known, 76 typedef typename Arc::Label Label; 77 typedef typename Arc::Weight Weight; 78 typedef typename Arc::StateId StateId; 104 SccVisitor<Arc> scc_visitor(&comp_props); 121 for (StateIterator< Fst<Arc> > siter(fst); 126 Arc prev_arc(kNoLabel, kNoLabel, Weight::One(), 0); 133 for (ArcIterator< Fst<Arc> > aiter(fst, s); 136 const Arc &arc =aiter.Value() local [all...] |
shortest-distance.h | 33 template <class Arc, class Queue, class ArcFilter> 35 typedef typename Arc::StateId StateId; 38 ArcFilter arc_filter; // Arc filter (e.g., limit to only epsilon graph) 54 template<class Arc, class Queue, class ArcFilter> 57 typedef typename Arc::StateId StateId; 58 typedef typename Arc::Weight Weight; 61 const Fst<Arc> &fst, 63 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, 78 const Fst<Arc> *fst_; 93 template <class Arc, class Queue, class ArcFilter 144 const Arc &arc = aiter.Value(); local [all...] |
/external/openfst/src/include/fst/ |
arcfilter.h | 35 bool operator()(const A &arc) const { return true; } 43 bool operator()(const A &arc) const { 44 return arc.ilabel == 0 && arc.olabel == 0; 53 bool operator()(const A &arc) const { 54 return arc.ilabel == 0; 63 bool operator()(const A &arc) const { 64 return arc.olabel == 0; 81 bool operator()(const A &arc) const { 82 Label label = match_input_ ? arc.ilabel : arc.olabel [all...] |
reweight.h | 39 // An arc of weight w, with an origin state of potential p and 43 template <class Arc> 44 void Reweight(MutableFst<Arc> *fst, 45 const vector<typename Arc::Weight> &potential, 47 typedef typename Arc::Weight Weight; 68 StateIterator< MutableFst<Arc> > sit(*fst); 70 typename Arc::StateId state = sit.Value(); 73 typename Arc::Weight weight = potential[state]; 75 for (MutableArcIterator< MutableFst<Arc> > ait(fst, state); 78 Arc arc = ait.Value() local 114 Arc arc = ait.Value(); local [all...] |
verify.h | 31 template<class Arc> 32 bool Verify(const Fst<Arc> &fst, bool allow_negative_labels = false) { 33 typedef typename Arc::Label Label; 34 typedef typename Arc::Weight Weight; 35 typedef typename Arc::StateId StateId; 43 for (StateIterator< Fst<Arc> > siter(fst); 56 for (StateIterator< Fst<Arc> > siter(fst); 61 for (ArcIterator< Fst<Arc> > aiter(fst, s); 64 const Arc &arc =aiter.Value() local [all...] |
prune.h | 44 // Arc filter. 99 template <class Arc, class ArcFilter> 100 void Prune(MutableFst<Arc> *fst, 101 const PruneOptions<Arc, ArcFilter> &opts) { 102 typedef typename Arc::Weight Weight; 103 typedef typename Arc::StateId StateId; 153 for (MutableArcIterator< MutableFst<Arc> > ait(fst, s); 156 Arc arc = ait.Value(); local 157 if (!opts.filter(arc)) continue 282 const Arc &arc = ait.Value(); local [all...] |
rmfinalepsilon.h | 57 const A& arc = aiter.Value(); local 58 if (coaccess[arc.nextstate]) { 77 const A& arc = aiter.Value(); local 79 if (finals.find(arc.nextstate) != finals.end()) { 81 if (arc.ilabel == 0 && arc.olabel == 0) { 82 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); 84 arcs.push_back(arc); 87 arcs.push_back(arc); [all...] |
visit.h | 40 // template <class Arc> 43 // typedef typename Arc::StateId StateId; 47 // void InitVisit(const Fst<Arc> &fst); 50 // // Invoked when arc to white/undiscovered state examined 51 // bool WhiteArc(StateId s, const Arc &a); 52 // // Invoked when arc to grey/unfinished state examined 53 // bool GreyArc(StateId s, const Arc &a); 54 // // Invoked when arc to black/finished state examined 55 // bool BlackArc(StateId s, const Arc &a); 68 template <class Arc, class V, class Q, class ArcFilter 137 const Arc &arc = aiter->Value(); local [all...] |
test-properties.h | 75 template<class Arc> 76 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known, 78 typedef typename Arc::Label Label; 79 typedef typename Arc::Weight Weight; 80 typedef typename Arc::StateId StateId; 106 SccVisitor<Arc> scc_visitor(&comp_props); 123 for (StateIterator< Fst<Arc> > siter(fst); 128 Arc prev_arc(kNoLabel, kNoLabel, Weight::One(), 0); 135 for (ArcIterator< Fst<Arc> > aiter(fst, s); 138 const Arc &arc =aiter.Value() local [all...] |
dfs-visit.h | 44 // template <class Arc> 47 // typedef typename Arc::StateId StateId; 51 // void InitVisit(const Fst<Arc> &fst); 54 // // Invoked when tree arc examined (to white/undiscovered state) 55 // bool TreeArc(StateId s, const Arc &a); 56 // // Invoked when back arc examined (to grey/unfinished state) 57 // bool BackArc(StateId s, const Arc &a); 58 // // Invoked when forward or cross arc examined (to black/finished state) 59 // bool ForwardOrCrossArc(StateId s, const Arc &a); 60 // // Invoked when state finished (PARENT is kNoStateID and ARC == NUL 147 const Arc &arc = aiter.Value(); local [all...] |
arc-map.h | 0 // arc-map.h 45 // A final weight is mapped to an arc to the superfinal state 50 // A final weight is mapped to an arc to the superfinal state 79 // // Maps an arc type A to arc type B. 80 // B operator()(const A &arc); 109 // Maps an arc type A using a mapper function object C, passed 137 const A &arc = aiter.Value(); local 138 aiter.SetValue((*mapper)(arc)); 146 FSTERROR() << "ArcMap: non-zero arc labels for superfinal arc" [all...] |
/external/srec/tools/grxmlcompile/ |
sub_min.cpp | 28 #define SYMBOL_COMPARE(x,y) (arc[x]->CompareSymbol(arc[y])) 29 #define COMPARE(x,y) (arc[x]->Compare(arc[y])) 55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) { 56 arc[forwardList[rix]]->Print(); 77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId 78 && arc[forwardList[fix]]->GetToId() == DISCARD_LABEL) 80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId) 81 fnxt= arc[forwardList[fix]]->GetFromId() [all...] |
netw_dump.cpp | 37 origIndex= arc[ii]->GetInput(); 39 arc[ii]->AssignInput (sortedIndex); 61 switch ( arc[loc]->inputLabel ) { 63 outfile << arc[loc]->fromId << std::endl; 66 outfile << arc[loc]->fromId << separator << arc[loc]->toId << separator << Eps << std::endl; 78 // if (!p_Doc.findLabel( arc[loc]->inputLabel, inLabel ) ) { 79 if (!p_Doc.findSortedLabel( arc[loc]->inputLabel, inLabel ) ) { 81 ss << arc[loc]->inputLabel; 84 outfile << arc[loc]->fromId << separator << arc[loc]->toId << separator << inLabel.c_str() << std::endl [all...] |
sub_base.cpp | 35 arc= new NUANArc * [BLKSIZE]; 60 arc= new NUANArc * [BLKSIZE]; 65 new_arc[ii]= arc[ii]; 66 delete [] arc; 67 arc= new_arc; 76 arc[numArc]= arc_one; 86 arc[numArc]= arc_one; 96 arc[numArc]= arc_one; 107 arc[numArc]= arc_one; 117 arc[numArc]= arc_one [all...] |
sub_phon.cpp | 54 wordId= arc[ii]->GetInput(); 60 arcOne= CreateArc (NONE_LABEL, NONE_LABEL, arc[ii]->GetFromId(), newId); 66 // (void) CreateArc (-wordId, NONE_LABEL, arc[ii]->GetFromId(), newId); 67 arcOne= CreateArc (WB_LABEL, NONE_LABEL, nextId, arc[ii]->GetToId()); 69 // (void) CreateArc (WB_LABEL, wordId, newId, arc[ii]->GetToId()); 76 currId= arc[ii]->GetFromId(); 90 arcOne= CreateArc (WB_LABEL, wordId, currId, arc[ii]->GetToId()); 95 arc[ii]->AssignInput (DISCARD_LABEL); // Delete original arc 101 arc[ii]->AssignLeft (NONE_LABEL) [all...] |
/external/openfst/src/include/fst/script/ |
compile-impl.h | 47 typedef A Arc; 85 Arc arc; local 95 arc.nextstate = d = StrToStateId(col[1]); 96 arc.ilabel = StrToILabel(col[2]); 97 arc.olabel = arc.ilabel; 98 arc.weight = Weight::One(); 99 fst_.AddArc(s, arc); 102 arc.nextstate = d = StrToStateId(col[1]) [all...] |
/external/oprofile/libop/ |
op_alloc_counter.c | 59 counter_arc * arc = local 61 arc->counter = j; 69 list_add_tail(&arc->next, &ctr_arc[i].next); 91 counter_arc * arc = list_entry(pos, counter_arc, next); local 92 list_del(&arc->next); 93 free(arc); 143 counter_arc const * arc = list_entry(pos, counter_arc, next); local 145 if (allocated_mask & (1 << arc->counter)) 148 counter_map[depth] = arc->counter; 151 allocated_mask | (1 << arc->counter) [all...] |