| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| rmfinalepsilon.h | 50 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
51 const A& arc = aiter.Value();
70 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
71 const A& arc = aiter.Value();
|
| statesort.h | 59 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s1);
60 !aiter.Done();
61 aiter.Next())
62 arcs1->push_back(aiter.Value());
68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2);
69 !aiter.Done();
70 aiter.Next())
71 arcs2->push_back(aiter.Value());
|
| randgen.h | 72 for (ArcIterator< Fst<A> > aiter(fst, s); !aiter.Done();
73 aiter.Next()) {
74 const A &arc = aiter.Value();
82 for (ArcIterator< Fst<A> > aiter(fst, s); !aiter.Done();
83 aiter.Next(), ++n) {
84 const A &arc = aiter.Value();
143 ArcIterator< Fst<Arc> > aiter(ifst, opts.source);
144 aiter.Seek(n)
[all...] |
| dfs-visit.h | 107 ArcIterator< Fst<Arc> > &aiter = dfs_state->arc_iter; local
108 if (!dfs || aiter.Done()) {
123 const Arc &arc = aiter.Value();
125 aiter.Next();
140 aiter.Next();
144 aiter.Next();
|
| arcsum.h | 68 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done();
69 aiter.Next())
70 arcs.push_back(aiter.Value());
|
| reverse.h | 64 for (ArcIterator< Fst<Arc> > aiter(ifst, is);
65 !aiter.Done();
66 aiter.Next()) {
67 const Arc &iarc = aiter.Value();
|
| verify.h | 58 for (ArcIterator< Fst<Arc> > aiter(fst, s);
59 !aiter.Done();
60 aiter.Next()) {
61 const Arc &arc =aiter.Value();
|
| concat.h | 59 for (ArcIterator< Fst<Arc> > aiter(fst2, s2);
60 !aiter.Done();
61 aiter.Next()) {
62 Arc arc = aiter.Value();
|
| union.h | 57 for (ArcIterator< Fst<Arc> > aiter(fst2, s2);
58 !aiter.Done();
59 aiter.Next()) {
60 Arc arc = aiter.Value();
|
| arcsort.h | 54 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s);
55 !aiter.Done();
56 aiter.Next())
57 arcs.push_back(aiter.Value());
151 for (ArcIterator< Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next())
152 AddArc(s, aiter.Value());
|
| /external/openfst/src/include/fst/ |
| symbol-table-ops.h | 44 ArcIterator<Fst<Arc> > aiter(fst, siter.Value());
45 for (; !aiter.Done(); aiter.Next()) {
46 typename Arc::Label sym = (input) ? aiter.Value().ilabel :
47 aiter.Value().olabel;
|
| rmfinalepsilon.h | 56 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
57 const A& arc = aiter.Value();
76 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
77 const A& arc = aiter.Value();
|
| statesort.h | 68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s1);
69 !aiter.Done();
70 aiter.Next())
71 arcs1->push_back(aiter.Value());
77 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2);
78 !aiter.Done();
79 aiter.Next())
80 arcs2->push_back(aiter.Value());
|
| label-reachable.h | 132 // Reach(aiter, ...) is true if labels on the input (output) side of
215 for (MutableArcIterator< MutableFst<Arc> > aiter(fst, s);
216 !aiter.Done();
217 aiter.Next()) {
218 Arc arc = aiter.Value();
223 aiter.SetValue(arc);
302 bool Reach(Iterator *aiter, ssize_t aiter_begin,
314 uint32 flags = aiter->Flags(); // save flags to restore them on exit
315 aiter->SetFlags(kArcNoCache, kArcNoCache); // make caching optional
316 aiter->Seek(aiter_begin)
[all...] |
| reverse.h | 73 for (ArcIterator< Fst<Arc> > aiter(ifst, is);
74 !aiter.Done();
75 aiter.Next()) {
76 const Arc &iarc = aiter.Value();
|
| dfs-visit.h | 131 ArcIterator< Fst<Arc> > &aiter = dfs_state->arc_iter; local
132 if (!dfs || aiter.Done()) {
147 const Arc &arc = aiter.Value();
153 aiter.Next();
168 aiter.Next();
172 aiter.Next();
|
| verify.h | 61 for (ArcIterator< Fst<Arc> > aiter(fst, s);
62 !aiter.Done();
63 aiter.Next()) {
64 const Arc &arc =aiter.Value();
|
| accumulator.h | 61 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
64 aiter->Seek(begin);
65 for (ssize_t pos = begin; pos < end; aiter->Next(), ++pos)
66 sum = Plus(sum, aiter->Value().weight);
100 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
103 aiter->Seek(begin);
104 for (ssize_t pos = begin; pos < end; aiter->Next(), ++pos)
105 sum = LogPlus(sum, aiter->Value().weight);
209 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
225 aiter->Seek(begin)
[all...] |
| concat.h | 82 for (ArcIterator< Fst<Arc> > aiter(fst2, s2);
83 !aiter.Done();
84 aiter.Next()) {
85 Arc arc = aiter.Value();
149 for (ArcIterator< Fst<Arc> > aiter(fst1, s1);
150 !aiter.Done();
151 aiter.Next()) {
152 Arc arc = aiter.Value();
|
| visit.h | 123 AIterator *aiter = arc_iterator[s]; local
124 if ((aiter && aiter->Done()) || !visit) {
125 delete aiter;
137 const Arc &arc = aiter->Value();
158 aiter->Next();
160 if (aiter->Done()) {
161 delete aiter;
|
| union.h | 82 for (ArcIterator< Fst<Arc> > aiter(fst2, s2);
83 !aiter.Done();
84 aiter.Next()) {
85 Arc arc = aiter.Value();
|
| /external/openfst/src/test/ |
| fst_test.h | 74 ArcIterator<G> aiter(fst, s);
75 for (; !aiter.Done(); aiter.Next());
76 for (aiter.Reset(); !aiter.Done(); aiter.Next()) {
78 const Arc &arc = aiter.Value();
89 CHECK_EQ(na, aiter.Position());
131 MutableArcIterator<G> aiter(fst, s);
132 for (; !aiter.Done(); aiter.Next())
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| replace.h | 99 for (ArcIterator< Fst<Arc> > aiter(*ifst, is);
100 !aiter.Done(); aiter.Next()) {
101 Arc arc = aiter.Value();
142 MIter *aiter = new MIter(ofst, os); local
143 for (size_t n = 0; !aiter->Done(); aiter->Next(), ++n) {
144 Arc arc = aiter->Value();
170 aiter->SetValue(sarc);
179 delete aiter;
[all...] |
| /external/openfst/src/include/fst/script/ |
| print-impl.h | 108 for (ArcIterator< Fst<A> > aiter(fst_, s);
109 !aiter.Done();
110 aiter.Next()) {
111 Arc arc = aiter.Value();
|
| /external/srec/tools/grxmlcompile/ |
| grxmlcompile.cpp | 364 for(fst::MutableArcIterator<fst::StdVectorFst> aiter(&fst_, s);
365 !aiter.Done(); aiter.Next()) {
366 fst::StdArc arc = aiter.Value();
374 aiter.SetValue( arc);
385 for(fst::MutableArcIterator<fst::StdVectorFst> aiter(&fst_, siter.Value());
386 !aiter.Done(); aiter.Next()) {
387 if( aiter.Value().ilabel > max_ilabel)
388 max_ilabel = aiter.Value().ilabel
[all...] |
