/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
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...] |
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...] |
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...] |
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...] |
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...] |
concat.h | 38 template<class Arc> 39 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 40 typedef typename Arc::StateId StateId; 41 typedef typename Arc::Label Label; 42 typedef typename Arc::Weight Weight; 53 for (StateIterator< Fst<Arc> > siter2(fst2); 59 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 62 Arc arc = aiter.Value() local [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...] |
equivalent.h | 38 // disjoint, we map Arc::StateId on the type MappedId. The states of 45 template <class Arc> 47 typedef typename Arc::StateId StateId; 48 typedef typename Arc::Weight Weight; 74 static bool IsFinal(const Fst<Arc> &fa, MappedId s) { 112 template <class Arc> 113 bool Equivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2) { 114 typedef typename Arc::Weight Weight; 128 VectorFst<Arc> efst1(fst1) 193 const Arc &arc = arc_iter.Value(); local 205 const Arc &arc = arc_iter.Value(); local [all...] |
randgen.h | 31 // ARC SELECTORS - these function objects are used to select a random 74 const A &arc = aiter.Value(); local 75 sum += exp(-arc.weight.Value()); 84 const A &arc = aiter.Value(); local 85 p += exp(-arc.weight.Value()); 100 const S &arc_selector; // How an arc is selected at a state 116 template<class Arc, class ArcSelector> 117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, 119 typedef typename Arc::Weight Weight [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...] |
union.h | 36 template <class Arc> 37 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 38 typedef typename Arc::StateId StateId; 39 typedef typename Arc::Label Label; 40 typedef typename Arc::Weight Weight; 51 for (StateIterator< Fst<Arc> > siter(fst2); 57 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 60 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...] |
const-fst.h | 31 // Arc definition. 80 // Provide information needed for the generic arc iterator 149 const A &arc = aiter.Value(); local 151 if (arc.ilabel == 0) 153 if (arc.olabel == 0) 155 arcs_[pos++] = arc; 227 typedef A Arc;
|
relabel.h | 67 A arc = aiter.Value(); local 72 input_map.find(arc.ilabel); 73 if (it != input_map.end()) {arc.ilabel = it->second; } 76 it = output_map.find(arc.olabel); 77 if (it != output_map.end()) { arc.olabel = it->second; } 79 aiter.SetValue(arc); 276 A arc = aiter.Value(); local 281 input_map_.find(arc.ilabel); 282 if (it != input_map_.end()) { arc.ilabel = it->second; } 288 output_map_.find(arc.olabel) [all...] |
shortest-path.h | 32 template <class Arc, class Queue, class ArcFilter> 34 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> { 35 typedef typename Arc::StateId StateId; 44 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d), 53 // such as the queue discipline, the arc filter and delta. 60 template<class Arc, class Queue, class ArcFilter> 61 void SingleShortestPath(const Fst<Arc> &ifst, 62 MutableFst<Arc> *ofst, 63 vector<typename Arc::Weight> *distance, 64 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) 115 const Arc &arc = aiter.Value(); local [all...] |
cache.h | 53 // garbage collection of states (not in use in an arc iterator) is 61 using FstImpl<typename S::Arc>::Type; 66 typedef typename S::Arc Arc; 67 typedef typename Arc::Weight Weight; 68 typedef typename Arc::StateId StateId; 140 cache_first_state_->arcs.capacity() * sizeof(Arc); 170 void AddArc(StateId s, const Arc &arc) { 172 state->arcs.push_back(arc); 181 const Arc &arc = arcs[a]; local [all...] |
factor-weight.h | 147 typedef A Arc; 261 const A &arc = ait.Value(); local 262 Weight w = Times(e.weight, arc.weight); 265 StateId d = FindState(Element(arc.nextstate, Weight::One())); 266 AddArc(s, Arc(arc.ilabel, arc.olabel, w, d)); 270 StateId d = FindState(Element(arc.nextstate, 272 AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d)) [all...] |
minimize.h | 79 // # arcs are equal, check for arc match 213 // allocate arc iterator queue 220 // Prep priority queue. Open arc iterator for each state in C, and 229 // Now pop arc iterator from queue, split entering equivalence class 240 const RevA& arc = aiter->Value(); local 242 Label from_label = arc.ilabel; 283 // Priority queue of open arc iterators for all states in the 'splitter' 334 // invoked when tree arc examined (to undiscoverted state) 335 bool TreeArc(StateId s, const A& arc) { 339 // invoked when back arc examined (to unfinished state 458 A arc = aiter.Value(); local [all...] |
queue.h | 286 // This constructor computes the top. order. It accepts an arc filter 289 template <class Arc, class ArcFilter> 291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter) 295 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic); 504 template <class Arc, class ArcFilter> 505 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance, 507 typedef typename Arc::Weight Weight; 525 SccVisitor<Arc> scc_visitor(&scc_, 0, 0, &props); 615 template <class Arc, class ArcFilter, class Less 666 const Arc &arc = ait.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/srec/srec/crec/ |
srec_debug.c | 97 FSMarc* arc = &context->FSMarc_list[stoken->FSMarc_index]; local 105 printf("%sstoken %4d at arc %4d ilabel %4d nextnode %4d states", msg, token_index, 106 stoken->FSMarc_index, arc->ilabel, arc->to_node);
|
/external/srec/srec/Grammar/src/ |
SR_GrammarImpl.c | 714 fst->FSMarc_list[i].cost |= DISABLEcostdata; /* disable this arc */ 718 /* pfprintf(PSTDOUT, "enabling arc %d for %d %s\n", 720 fst->FSMarc_list[i].cost &= ~(DISABLEcostdata); /* enable this arc */ 727 FSMarc* arc; local 739 for (j = fst->FSMnode_list[node].un_ptr.first_next_arc; j != MAXarcID; j = arc->linkl_next_arc) 741 arc = &fst->FSMarc_list[j]; 742 if (arc->cost < mincost) mincost = arc->cost; 767 fst->FSMarc_list[i].cost &= ~(DISABLEcostdata); /* enable this arc */
|
/external/srec/tools/grxmlcompile/ |
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_grph.h | 133 delete arc[ii]; 135 delete [] arc; 215 NUANArc **arc; member in class:SubGraph
|
/external/srec/tools/test_g2g/ |
test_g2g.c | 249 FSMarc* arc = &fst->FSMarc_list[i]; local 250 nodeID fr_node = arc->fr_node; 252 ilabels_following[0] = arc->ilabel; 255 for( ; fr_node!=fst->start_node; fr_node=arc->fr_node) { 258 for( ; iarc!=MAXarcID; iarc=arc->linkl_prev_arc) { 259 arc = &fst->FSMarc_list[iarc]; 260 if(arc->fr_node != fr_node) break; 266 if(arc->ilabel == WORD_BOUNDARY) break; 267 ilabels_preceding[num_ilabels_preceding++] = arc->ilabel; 269 arc = &fst->FSMarc_list[i] [all...] |