Home | History | Annotate | Download | only in fst

Lines Matching full:enqueued

132   vector<size_t> enqueued(ns, kNoKey);
142     enqueued[s] = heap.Insert(s);
149     enqueued[s] = kNoKey;
173       if (enqueued[arc.nextstate] == kNoKey) {
174         enqueued[arc.nextstate] = heap.Insert(arc.nextstate);
177         heap.Update(enqueued[arc.nextstate], arc.nextstate);
253   vector<size_t> enqueued;
266   while (enqueued.size() <= s) {
267     enqueued.push_back(kNoKey);
270   enqueued[s] = heap.Insert(s);
275     enqueued[s] = kNoKey;
303       while (enqueued.size() <= arc.nextstate) {
304         enqueued.push_back(kNoKey);
308       if (enqueued[arc.nextstate] == kNoKey)
309         enqueued[arc.nextstate] = heap.Insert(arc.nextstate);
311         heap.Update(enqueued[arc.nextstate], arc.nextstate);