HomeSort by relevance Sort by last modified time
    Searched refs:Done (Results 101 - 125 of 252) sorted by null

1 2 3 45 6 7 8 91011

  /external/openfst/src/include/fst/
visit.h 88 const unsigned kArcIterDone = 0x08; // Arc iterator done and destroyed
122 // Deletes arc iterator if done.
124 if ((aiter && aiter->Done()) || !visit) {
129 // Dequeues state and marks black if done
160 if (aiter->Done()) {
174 for (; !siter.Done(); siter.Next()) {
closure.h 54 !siter.Done();
matcher-fst.h 229 bool Done() const { return matcher_->Done(); }
270 bool Done() const { return matcher_->Done(); }
arcsort.h 60 for (ArcIterator< Fst<Arc> > aiter(fst_, s); !aiter.Done(); aiter.Next())
65 bool Done() const { return i_ >= arcs_.size(); }
equivalent.h 227 for (; !arc_iter.Done(); arc_iter.Next()) {
239 for (; !arc_iter.Done(); arc_iter.Next()) {
push.h 69 !sit.Done();
77 !ait.Done();
string.h 219 if (aiter.Done()) {
236 if (!aiter.Done()) {
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
prune.h 98 !it.Done();
178 !sit.Done();
197 !ait.Done();
const-fst.h 128 !siter.Done();
133 !aiter.Done();
147 !aiter.Done();
345 bool Done() const { return s_ >= nstates_; }
371 bool Done() const { return i_ >= narcs_; }
arcsort.h 50 !siter.Done();
55 !aiter.Done();
151 for (ArcIterator< Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next())
map.h 99 !aiter.Done(); aiter.Next()) {
116 // Add a superfinal state if not already done.
170 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next())
179 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) {
184 for (ArcIterator< Fst<A> > aiter(ifst, s); !aiter.Done(); aiter.Next())
198 // Add a superfinal state if not already done.
363 !aiter.Done(); aiter.Next()) {
550 bool Done() const { return siter_.Done() && !superfinal_; }
556 if (!siter_.Done()) {
    [all...]
closure.h 47 !siter.Done();
dfs-visit.h 108 if (!dfs || aiter.Done()) {
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 240 bool Done = true;
249 Done = false;
254 if (Done) {
273 bool Done = true;
282 Done = false;
287 if (Done) {
  /external/eigen/Eigen/src/Eigen2Support/
Meta.h 56 bool Done = ((SupX-InfX)<=1 ? true : ((SupX*SupX <= Y) && ((SupX+1)*(SupX+1) > Y))) >
  /external/openfst/src/include/fst/extensions/far/
print-strings.h 79 for (int i = 1; !far_reader->Done(); far_reader->Next(), ++i) {
compile-strings.h 38 // for (StringReader<Arc> reader(...); !reader.Done(); reader.Next()) {
64 bool Done() {
70 if (!strm_) { // We're done if we have no more input.
86 if (!strm_ && content_.empty()) // We're also done if we read off all the
248 !reader.Done();
  /external/openfst/src/include/fst/extensions/pdt/
collection.h 65 bool Done() const { return id_ == kNoNodeId; }
info.h 101 !siter.Done();
106 !aiter.Done();
  /external/v8/test/cctest/
test-dataflow.cc 71 CHECK(iter.Done());
  /external/webkit/Source/WebCore/bindings/v8/
ScriptProfiler.cpp 73 ControlOption ReportProgressValue(int done, int total)
80 m_progress->Worked(done);
81 if (done >= total)
82 m_progress->Done();
  /frameworks/native/libs/utils/
Looper.cpp 226 goto Done;
230 goto Done;
239 goto Done;
271 Done: ;
  /external/openfst/src/include/fst/extensions/ngram/
ngram-fst.h 311 if (aiter.Done()) {
326 !aiter.Done(); aiter.Next()) {
336 !aiter.Done(); aiter.Next()) {
366 for (StateIterator<Fst<A> > siter(fst); !siter.Done(); siter.Next()) {
370 if (!aiter.Done()) {
471 !aiter.Done(); aiter.Next()) {
481 for (ArcIterator<Fst<A> > aiter(fst, state); !aiter.Done(); aiter.Next()) {
872 bool Done() const {
937 virtual bool Done_() const { return Done(); }
969 bool Done() const { return s_ >= num_states_;
    [all...]
  /external/llvm/include/llvm/Analysis/
IntervalIterator.h 94 bool IOwnMem; // If True, delete intervals when done with them
139 bool Done = ProcessInterval(getSourceGraphNode(OrigContainer, *SuccIt));
141 if (Done) return *this; // Found a new interval! Use it!
  /external/openfst/src/include/fst/script/
draw-impl.h 99 !siter.Done();
187 !aiter.Done();

Completed in 2085 milliseconds

1 2 3 45 6 7 8 91011