| /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());
|
| minimize.h | 233 ArcIterator<Fst<RevA> >* aiter = aiter_queue_->top(); local
235 if (aiter->Done()) {
236 delete aiter;
240 const RevA& arc = aiter->Value();
241 StateId from_state = aiter->Value().nextstate - 1;
251 aiter->Next();
252 if (aiter->Done())
253 delete aiter;
255 aiter_queue_->push(aiter);
456 for (MutableArcIterator<MutableFst<A> > aiter(fst, s)
[all...] |
| relabel.h | 65 for (MutableArcIterator<MutableFst<A> > aiter(fst, s);
66 !aiter.Done(); aiter.Next()) {
67 A arc = aiter.Value();
79 aiter.SetValue(arc);
275 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) {
276 A arc = aiter.Value();
|
| shortest-path.h | 112 for (ArcIterator< Fst<Arc> > aiter(ifst, s);
113 !aiter.Done();
114 aiter.Next()) {
115 const Arc &arc = aiter.Value();
307 for (ArcIterator< Fst<ReverseArc> > aiter(rfst, p.first);
308 !aiter.Done();
309 aiter.Next()) {
310 const ReverseArc &rarc = aiter.Value();
|
| shortest-distance.h | 141 for (ArcIterator< Fst<Arc> > aiter(*fst_, s);
142 !aiter.Done();
143 aiter.Next()) {
144 const Arc &arc = aiter.Value();
|
| test-properties.h | 133 for (ArcIterator< Fst<Arc> > aiter(fst, s);
134 !aiter.Done();
135 aiter.Next()) {
136 const Arc &arc =aiter.Value();
|
| const-fst.h | 132 for (ArcIterator< Fst<A> > aiter(fst, s);
133 !aiter.Done();
134 aiter.Next())
146 for (ArcIterator< Fst<A> > aiter(fst, s);
147 !aiter.Done();
148 aiter.Next()) {
149 const A &arc = aiter.Value();
|
| map.h | 98 for (MutableArcIterator< MutableFst<A> > aiter(fst, s);
99 !aiter.Done(); aiter.Next()) {
100 const A &arc = aiter.Value();
101 aiter.SetValue((*mapper)(arc));
184 for (ArcIterator< Fst<A> > aiter(ifst, s); !aiter.Done(); aiter.Next())
185 ofst->AddArc(s, (*mapper)(aiter.Value()));
362 for (ArcIterator< Fst<A> > aiter(*fst_, FindIState(s))
[all...] |
| determinize.h | 311 for (ArcIterator< Fst<A> > aiter(*fst_, src_element.state_id);
312 !aiter.Done();
313 aiter.Next()) {
314 const A &arc = aiter.Value();
499 for (ArcIterator<FromFst> aiter(*from_fst_, s);
500 !aiter.Done();
501 aiter.Next())
502 CacheImpl<A>::AddArc(s, aiter.Value());
|
| replace.h | 185 for (ArcIterator<Fst<A> > aiter(*(fst_array_[i]), siter.Value());
186 !aiter.Done(); aiter.Next()) {
187 const A& arc = aiter.Value();
317 for (ArcIterator< Fst<A> > aiter(*fst, fst_state);
318 !aiter.Done(); aiter.Next()) {
319 const Arc& arc = aiter.Value();
|
| compose.h | 590 // Finds matches to MATCH_LABEL in arcs given by AITER
592 bool FindLabel(ArcIterator< Fst<A> > *aiter, size_t numarcs,
599 aiter->Seek(mid);
601 aiter->Value().ilabel : aiter->Value().olabel;
609 aiter->Seek(i - 1);
610 label = find_input ? aiter->Value().ilabel : aiter->Value().olabel;
612 aiter->Seek(i);
[all...] |
| vector-fst.h | 336 for (ArcIterator< Fst<A> > aiter(fst, s);
337 !aiter.Done();
338 aiter.Next()) {
339 const A &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...] |
| fst-io.h | 109 for (ArcIterator< Fst<A> > aiter(fst_, s);
110 !aiter.Done();
111 aiter.Next()) {
112 Arc arc = aiter.Value();
|
| /external/icu4c/i18n/ |
| dtptngen.cpp | 80 static void ures_a_open(UResourceBundleAIterator *aiter, UResourceBundle *bund, UErrorCode *status) {
84 aiter->bund = bund;
85 aiter->num = ures_getSize(aiter->bund);
86 aiter->cursor = 0;
88 aiter->entries = NULL;
90 aiter->entries = (UResAEntry*)uprv_malloc(sizeof(UResAEntry)*aiter->num);
91 for(int i=0;i<aiter->num;i++) {
92 aiter->entries[i].item = ures_getByIndex(aiter->bund, i, NULL, status)
618 UResourceBundleAIterator aiter; local
660 UResourceBundleAIterator aiter; local
[all...] |
