/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...] |
/external/openfst/src/include/fst/ |
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...] |
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...] |
statesort.h | 37 template <class Arc> 38 void StateSort(MutableFst<Arc> *fst, 39 const vector<typename Arc::StateId> &order) { 40 typedef typename Arc::StateId StateId; 41 typedef typename Arc::Weight Weight; 55 vector<Arc> arcsa, arcsb; 56 vector<Arc> *arcs1 = &arcsa, *arcs2 = &arcsb; 60 for (StateIterator< MutableFst<Arc> > siter(*fst); 68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s1); 77 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2) 85 Arc arc = (*arcs1)[i]; 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...] |
push.h | 29 #include <fst/arc-map.h> 43 template <class Arc> 44 typename Arc::Weight ComputeTotalWeight( 45 const Fst<Arc> &fst, 46 const vector<typename Arc::Weight> &distance, 50 distance[fst.Start()] : Arc::Weight::Zero(); 52 typename Arc::Weight sum = Arc::Weight::Zero(); 53 for (typename Arc::StateId s = 0; s < distance.size(); ++s) 61 template <class Arc> 79 Arc arc = ait.Value(); local [all...] |
concat.h | 46 template<class Arc> 47 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 48 typedef typename Arc::StateId StateId; 49 typedef typename Arc::Label Label; 50 typedef typename Arc::Weight Weight; 75 for (StateIterator< Fst<Arc> > siter2(fst2); 82 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 85 Arc arc = aiter.Value() local 152 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...] |
equivalent.h | 47 // disjoint, we map Arc::StateId on the type MappedId. The states of 54 template <class Arc> 56 typedef typename Arc::StateId StateId; 57 typedef typename Arc::Weight Weight; 83 static bool IsFinal(const Fst<Arc> &fa, MappedId s) { 101 template <class Arc> const 102 typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kDeadState; 104 template <class Arc> const 105 typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kInvalidId 228 const Arc &arc = arc_iter.Value(); local 240 const Arc &arc = arc_iter.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; 136 for (ArcIterator< Fst<Arc> > aiter(fst, s); 139 const Arc &arc =aiter.Value() local [all...] |
union.h | 43 template <class Arc> 44 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 45 typedef typename Arc::StateId StateId; 46 typedef typename Arc::Label Label; 47 typedef typename Arc::Weight Weight; 75 for (StateIterator< Fst<Arc> > siter(fst2); 82 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 85 Arc arc = aiter.Value() local [all...] |
/packages/apps/Gallery2/src/com/android/gallery3d/util/ |
AccessibilityUtils.java | 45 AccessibilityRecordCompat arc = new AccessibilityRecordCompat(event); local 46 arc.setSource(view);
|
/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/openfst/src/include/fst/extensions/pdt/ |
info.h | 41 typedef A Arc; 108 const A &arc = aiter.Value(); local 111 = paren_map.find(arc.ilabel); 115 if (arc.ilabel == open_paren) { 121 if (!open_paren_state_set.count(arc.nextstate)) { 123 open_paren_state_set.insert(arc.nextstate); 149 cout << "arc type" << pdtinfo.ArcType().c_str() << endl;
|