/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...] |
project.h | 31 // Mapper to implement projection per arc. 37 A operator()(const A &arc) { 39 ? arc.ilabel : arc.olabel; 40 return A(label, label, arc.weight, arc.nextstate); 62 template<class Arc> inline 63 void Project(MutableFst<Arc> *fst, ProjectType project_type) { 64 Map(fst, ProjectMapper<Arc>(project_type)); 68 // Projects an FST onto its domain or range by either copying each arc' [all...] |
statesort.h | 32 template <class Arc> 33 void StateSort(MutableFst<Arc> *fst, 34 const vector<typename Arc::StateId> &order) { 35 typedef typename Arc::StateId StateId; 36 typedef typename Arc::Weight Weight; 46 vector<Arc> arcsa, arcsb; 47 vector<Arc> *arcs1 = &arcsa, *arcs2 = &arcsb; 51 for (StateIterator< MutableFst<Arc> > siter(*fst); 59 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s1); 68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2) 76 Arc arc = (*arcs1)[i]; local [all...] |
encode.h | 46 // Encoded data consists of arc input/output labels and arc weight 111 // Given an arc encode either input/ouptut labels or input/costs or both 112 Label Encode(const A &arc) { 113 const Tuple tuple(arc.ilabel, 114 flags_ & kEncodeLabels ? arc.olabel : 0, 115 flags_ & kEncodeWeights ? arc.weight : Weight::One()); 126 // Given an encode arc Label decode back to input/output labels and costs 230 A operator()(const A &arc) { 232 if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) | [all...] |
vector-fst.h | 36 class VectorFstBaseImpl : public FstImpl<typename State::Arc> { 38 typedef typename State::Arc Arc; 39 typedef typename Arc::Weight Weight; 40 typedef typename Arc::StateId StateId; 71 void AddArc(StateId s, const Arc &arc) { 72 states_[s]->arcs.push_back(arc); 92 vector<Arc> &arcs = states_[s]->arcs; 138 void InitStateIterator(StateIteratorData<Arc> *data) const 339 const A &arc = aiter.Value(); local 371 A arc; local 435 const A &arc = state->arcs[a]; local [all...] |
arc.h | 0 // arc.h 17 // Commonly used Fst arc types. 28 // Arc with integer labels and state Ids and float weights over the 40 static const string &Type() { // Arc type name 52 // Arc with integer labels and state Ids and float weights over the 64 static const string &Type() { // Arc type name 76 // Arc with integer labels and state Ids and string weights. 89 static const string &Type() { // Arc type name 105 // Arc with label and state Id type the same as template arg and with 109 typedef A 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...] |
fst-io.h | 27 // on the arc type to support multiple and extensible arc types. 43 typedef A Arc; 100 PrintId(l, isyms_, "arc input label"); 104 PrintId(l, osyms_, "arc output label"); 112 Arc arc = aiter.Value(); local 115 PrintStateId(arc.nextstate); 117 PrintILabel(arc.ilabel); 120 PrintOLabel(arc.olabel) 239 Arc arc; local [all...] |
sub_supp.cpp | 29 #define ARC_COMPARE(x,y) (arc[x]->Compare(arc[y])) 30 #define ARC_COMPARE_REV(x,y) (arc[x]->CompareReverse(arc[y])) 31 #define ARC_COMPARE_MIN(x,y) (arc[x]->CompareForMin(arc[y])) 212 direction= element - arc[forwardList[rix]]->GetFromId(); 218 assert (arc[forwardList[rix]]->GetFromId() == element); 219 while (rix > 0 && arc[forwardList[rix-1]]->GetFromId() == element) 221 assert (arc[forwardList[rix]]->GetFromId() == element) [all...] |
sub_grph.cpp | 298 ruleId= arc[ii]->GetInput(); 300 initialId= arc[ii]->GetFromId(); 301 finalId= arc[ii]->GetToId(); 306 arc[ii]->AssignInput (DISCARD_LABEL); // Clear down the rule 328 vertId= arc[ii]->GetFromId(); 331 vertId= arc[ii]->GetToId(); 479 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) { 480 if (arc[forwardList[rix]]->GetInput() == procLabel) { 481 PullUpBegins (arc[forwardList[rix]]->GetToId(), baseId, 484 else if (arc[forwardList[rix]]->GetInput() != DISCARD_LABEL [all...] |
grxmlcompile.cpp | 26 #include "fst/lib/arc.h" 366 fst::StdArc arc = aiter.Value(); local 367 if( arc.ilabel >= max_ilabels || 368 (float)arc.ilabel + ((float)max_ilabels)*arc.olabel > INT_MAX) { 372 arc.ilabel = arc.ilabel + max_ilabels * arc.olabel; 373 arc.olabel = 0; 374 aiter.SetValue( arc); 406 fst::StdArc arc = aiter.Value(); local 429 fst::StdArc arc = aiter.Value(); local 461 fst::StdArc arc = aiter.Value(); local 498 fst::StdArc arc = aiter.Value(); local 555 fst::StdArc arc = aiter.Value(); local [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...] |
/external/freetype/src/base/ |
ftbbox.c | 109 if ( y1 <= y3 && y2 == y1 ) /* flat arc */ 114 if ( y2 >= y1 && y2 <= y3 ) /* ascending arc */ 119 if ( y2 >= y3 && y2 <= y1 ) /* descending arc */ 159 /* In the case of a non-monotonous arc, we compute directly the */ 225 FT_Pos stack[32*3 + 1], *arc; 228 arc = stack; 230 arc[0] = p1; 231 arc[1] = p2; 232 arc[2] = p3; 233 arc[3] = p4 [all...] |