| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| D | randgen.h | 72 for (ArcIterator< Fst<A> > aiter(fst, s); !aiter.Done(); in operator()
73 aiter.Next()) { in operator()
74 const A &arc = aiter.Value(); in operator()
82 for (ArcIterator< Fst<A> > aiter(fst, s); !aiter.Done(); in operator()
83 aiter.Next(), ++n) { in operator()
84 const A &arc = aiter.Value(); in operator()
143 ArcIterator< Fst<Arc> > aiter(ifst, opts.source); in RandGen()
144 aiter.Seek(n); in RandGen()
145 const Arc &iarc = aiter.Value(); in RandGen()
|
| D | statesort.h | 59 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s1); in StateSort()
60 !aiter.Done(); in StateSort()
61 aiter.Next()) in StateSort()
62 arcs1->push_back(aiter.Value()); in StateSort()
68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2); in StateSort()
69 !aiter.Done(); in StateSort()
70 aiter.Next()) in StateSort()
71 arcs2->push_back(aiter.Value()); in StateSort()
|
| D | rmfinalepsilon.h | 50 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) { in RmFinalEpsilon()
51 const A& arc = aiter.Value(); in RmFinalEpsilon()
70 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) { in RmFinalEpsilon()
71 const A& arc = aiter.Value(); in RmFinalEpsilon()
|
| D | dfs-visit.h | 107 ArcIterator< Fst<Arc> > &aiter = dfs_state->arc_iter; in DfsVisit() local
108 if (!dfs || aiter.Done()) { in DfsVisit()
123 const Arc &arc = aiter.Value(); in DfsVisit()
125 aiter.Next(); in DfsVisit()
140 aiter.Next(); in DfsVisit()
144 aiter.Next(); in DfsVisit()
|
| D | minimize.h | 233 ArcIterator<Fst<RevA> >* aiter = aiter_queue_->top(); in Split() local
235 if (aiter->Done()) { in Split()
236 delete aiter; in Split() local
240 const RevA& arc = aiter->Value(); in Split()
241 StateId from_state = aiter->Value().nextstate - 1; in Split()
251 aiter->Next(); in Split()
252 if (aiter->Done()) in Split()
253 delete aiter; in Split() local
255 aiter_queue_->push(aiter); in Split()
456 for (MutableArcIterator<MutableFst<A> > aiter(fst, s); in MergeStates()
[all …]
|
| D | reverse.h | 64 for (ArcIterator< Fst<Arc> > aiter(ifst, is); in Reverse()
65 !aiter.Done(); in Reverse()
66 aiter.Next()) { in Reverse()
67 const Arc &iarc = aiter.Value(); in Reverse()
|
| D | arcsort.h | 54 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s); in ArcSort()
55 !aiter.Done(); in ArcSort()
56 aiter.Next()) in ArcSort()
57 arcs.push_back(aiter.Value()); in ArcSort()
151 for (ArcIterator< Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) in Expand()
152 AddArc(s, aiter.Value()); in Expand()
|
| D | arcsum.h | 68 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); in ArcSum()
69 aiter.Next()) in ArcSum()
70 arcs.push_back(aiter.Value()); in ArcSum()
|
| D | verify.h | 58 for (ArcIterator< Fst<Arc> > aiter(fst, s); in Verify()
59 !aiter.Done(); in Verify()
60 aiter.Next()) { in Verify()
61 const Arc &arc =aiter.Value(); in Verify()
|
| D | relabel.h | 65 for (MutableArcIterator<MutableFst<A> > aiter(fst, s); in Relabel()
66 !aiter.Done(); aiter.Next()) { in Relabel()
67 A arc = aiter.Value(); in Relabel()
79 aiter.SetValue(arc); in Relabel()
275 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) { in Expand()
276 A arc = aiter.Value(); in Expand()
|
| D | shortest-path.h | 112 for (ArcIterator< Fst<Arc> > aiter(ifst, s); in SingleShortestPath()
113 !aiter.Done(); in SingleShortestPath()
114 aiter.Next()) { in SingleShortestPath()
115 const Arc &arc = aiter.Value(); in SingleShortestPath()
307 for (ArcIterator< Fst<ReverseArc> > aiter(rfst, p.first); in ShortestPath()
308 !aiter.Done(); in ShortestPath()
309 aiter.Next()) { in ShortestPath()
310 const ReverseArc &rarc = aiter.Value(); in ShortestPath()
|
| D | concat.h | 59 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); in Concat()
60 !aiter.Done(); in Concat()
61 aiter.Next()) { in Concat()
62 Arc arc = aiter.Value(); in Concat()
|
| D | union.h | 57 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); in Union()
58 !aiter.Done(); in Union()
59 aiter.Next()) { in Union()
60 Arc arc = aiter.Value(); in Union()
|
| D | const-fst.h | 132 for (ArcIterator< Fst<A> > aiter(fst, s); in ConstFstImpl()
133 !aiter.Done(); in ConstFstImpl()
134 aiter.Next()) in ConstFstImpl()
146 for (ArcIterator< Fst<A> > aiter(fst, s); in ConstFstImpl()
147 !aiter.Done(); in ConstFstImpl()
148 aiter.Next()) { in ConstFstImpl()
149 const A &arc = aiter.Value(); in ConstFstImpl()
|
| D | test-properties.h | 133 for (ArcIterator< Fst<Arc> > aiter(fst, s); in ComputeProperties()
134 !aiter.Done(); in ComputeProperties()
135 aiter.Next()) { in ComputeProperties()
136 const Arc &arc =aiter.Value(); in ComputeProperties()
|
| D | map.h | 98 for (MutableArcIterator< MutableFst<A> > aiter(fst, s); in Map()
99 !aiter.Done(); aiter.Next()) { in Map()
100 const A &arc = aiter.Value(); in Map()
101 aiter.SetValue((*mapper)(arc)); in Map()
184 for (ArcIterator< Fst<A> > aiter(ifst, s); !aiter.Done(); aiter.Next()) in Map()
185 ofst->AddArc(s, (*mapper)(aiter.Value())); in Map()
362 for (ArcIterator< Fst<A> > aiter(*fst_, FindIState(s)); in Expand()
363 !aiter.Done(); aiter.Next()) { in Expand()
364 A aarc(aiter.Value()); in Expand()
|
| D | replace.h | 185 for (ArcIterator<Fst<A> > aiter(*(fst_array_[i]), siter.Value()); in CyclicDependencies()
186 !aiter.Done(); aiter.Next()) { in CyclicDependencies()
187 const A& arc = aiter.Value(); in CyclicDependencies()
317 for (ArcIterator< Fst<A> > aiter(*fst, fst_state); in Expand()
318 !aiter.Done(); aiter.Next()) { in Expand()
319 const Arc& arc = aiter.Value(); in Expand()
|
| D | shortest-distance.h | 141 for (ArcIterator< Fst<Arc> > aiter(*fst_, s); in ShortestDistance()
142 !aiter.Done(); in ShortestDistance()
143 aiter.Next()) { in ShortestDistance()
144 const Arc &arc = aiter.Value(); in ShortestDistance()
|
| D | determinize.h | 311 for (ArcIterator< Fst<A> > aiter(*fst_, src_element.state_id); in LabelSubsets()
312 !aiter.Done(); in LabelSubsets()
313 aiter.Next()) { in LabelSubsets()
314 const A &arc = aiter.Value(); in LabelSubsets()
499 for (ArcIterator<FromFst> aiter(*from_fst_, s); in Expand()
500 !aiter.Done(); in Expand()
501 aiter.Next()) in Expand()
502 CacheImpl<A>::AddArc(s, aiter.Value()); in Expand()
|
| D | compose.h | 592 bool FindLabel(ArcIterator< Fst<A> > *aiter, size_t numarcs, in FindLabel() argument
599 aiter->Seek(mid); in FindLabel()
601 aiter->Value().ilabel : aiter->Value().olabel; in FindLabel()
609 aiter->Seek(i - 1); in FindLabel()
610 label = find_input ? aiter->Value().ilabel : aiter->Value().olabel; in FindLabel()
612 aiter->Seek(i); in FindLabel()
|
| D | vector-fst.h | 336 for (ArcIterator< Fst<A> > aiter(fst, s); in VectorFstImpl()
337 !aiter.Done(); in VectorFstImpl()
338 aiter.Next()) { in VectorFstImpl()
339 const A &arc = aiter.Value(); in VectorFstImpl()
|
| /external/srec/tools/grxmlcompile/ |
| D | grxmlcompile.cpp | 364 for(fst::MutableArcIterator<fst::StdVectorFst> aiter(&fst_, s); in FstMergeOLabelsToILabels() local
365 !aiter.Done(); aiter.Next()) { in FstMergeOLabelsToILabels()
366 fst::StdArc arc = aiter.Value(); in FstMergeOLabelsToILabels()
374 aiter.SetValue( arc); in FstMergeOLabelsToILabels()
385 for(fst::MutableArcIterator<fst::StdVectorFst> aiter(&fst_, siter.Value()); in FstMergeOLabelsToILabels_GetMax() local
386 !aiter.Done(); aiter.Next()) { in FstMergeOLabelsToILabels_GetMax()
387 if( aiter.Value().ilabel > max_ilabel) in FstMergeOLabelsToILabels_GetMax()
388 max_ilabel = aiter.Value().ilabel; in FstMergeOLabelsToILabels_GetMax()
404 for(fst::MutableArcIterator<fst::StdVectorFst> aiter(&fst_, s); in FstSplitOLabelsFromILabels() local
405 !aiter.Done(); aiter.Next()) { in FstSplitOLabelsFromILabels()
[all …]
|
| D | fst-io.h | 109 for (ArcIterator< Fst<A> > aiter(fst_, s); in PrintState()
110 !aiter.Done(); in PrintState()
111 aiter.Next()) { in PrintState()
112 Arc arc = aiter.Value(); in PrintState()
|
| /external/chromium/third_party/icu/source/i18n/ |
| D | dtptngen.cpp | 85 static void ures_a_open(UResourceBundleAIterator *aiter, UResourceBundle *bund, UErrorCode *status)… in ures_a_open() argument
89 aiter->bund = bund; in ures_a_open()
90 aiter->num = ures_getSize(aiter->bund); in ures_a_open()
91 aiter->cursor = 0; in ures_a_open()
93 aiter->entries = NULL; in ures_a_open()
95 aiter->entries = (UResAEntry*)uprv_malloc(sizeof(UResAEntry)*aiter->num); in ures_a_open()
96 for(int i=0;i<aiter->num;i++) { in ures_a_open()
97 aiter->entries[i].item = ures_getByIndex(aiter->bund, i, NULL, status); in ures_a_open()
98 const char *akey = ures_getKey(aiter->entries[i].item); in ures_a_open()
100 aiter->entries[i].key = (UChar*)uprv_malloc(len*sizeof(UChar)); in ures_a_open()
[all …]
|
| /external/icu4c/i18n/ |
| D | dtptngen.cpp | 80 static void ures_a_open(UResourceBundleAIterator *aiter, UResourceBundle *bund, UErrorCode *status)… in ures_a_open() argument
84 aiter->bund = bund; in ures_a_open()
85 aiter->num = ures_getSize(aiter->bund); in ures_a_open()
86 aiter->cursor = 0; in ures_a_open()
88 aiter->entries = NULL; in ures_a_open()
90 aiter->entries = (UResAEntry*)uprv_malloc(sizeof(UResAEntry)*aiter->num); in ures_a_open()
91 for(int i=0;i<aiter->num;i++) { in ures_a_open()
92 aiter->entries[i].item = ures_getByIndex(aiter->bund, i, NULL, status); in ures_a_open()
93 const char *akey = ures_getKey(aiter->entries[i].item); in ures_a_open()
95 aiter->entries[i].key = (UChar*)uprv_malloc(len*sizeof(UChar)); in ures_a_open()
[all …]
|