Searched defs:aiter (Results 1 - 10 of 10) sorted by relevance

/external/openfst/src/include/fst/
H A Ddfs-visit.h131 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();
H A Dvisit.h123 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;
H A Dlabel-reachable.h132 // 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, argument
314 uint32 flags = aiter->Flags(); // save flags to restore them on exit
315 aiter->SetFlags(kArcNoCache, kArcNoCache); // make caching optional
316 aiter
507 LowerBound(Iterator *aiter, ssize_t aiter_begin, ssize_t aiter_end, bool aiter_input, Label match_label) const argument
[all...]
H A Dminimize.h246 ArcIterator<Fst<RevA> >* aiter = aiter_queue_->top(); local
248 if (aiter->Done()) {
249 delete aiter;
253 const RevA& arc = aiter->Value();
254 StateId from_state = aiter->Value().nextstate - 1;
264 aiter->Next();
265 if (aiter->Done())
266 delete aiter;
268 aiter_queue_->push(aiter);
469 for (MutableArcIterator<MutableFst<A> > aiter(fs
[all...]
H A Daccumulator.h61 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin, argument
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, argument
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, argument
225 aiter
498 Sum(Weight w, Iterator *aiter, ssize_t begin, ssize_t end) argument
518 LowerBound(double w, Iterator *aiter) argument
719 Sum(Weight w, ArcIterator *aiter, ssize_t begin, ssize_t end) argument
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Ddfs-visit.h107 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();
H A Dminimize.h233 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(fs
[all...]
H A Dcompose.h592 bool FindLabel(ArcIterator< Fst<A> > *aiter, size_t numarcs, argument
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);
/external/openfst/src/include/fst/extensions/pdt/
H A Dreplace.h99 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/icu4c/i18n/
H A Ddtptngen.cpp80 static void ures_a_open(UResourceBundleAIterator *aiter, UResourceBundle *bund, UErrorCode *status) { argument
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
102 ures_a_close(UResourceBundleAIterator *aiter) argument
111 ures_a_getNextString(UResourceBundleAIterator *aiter, int32_t *len, const char **key, UErrorCode *err) argument
619 UResourceBundleAIterator aiter; local
661 UResourceBundleAIterator aiter; local
[all...]

Completed in 142 milliseconds