Lines Matching refs:kNoStateId
106 TrivialQueue() : QueueBase<S>(TRIVIAL_QUEUE), front_(kNoStateId) {}
109 void Dequeue() { front_ = kNoStateId; }
111 bool Empty() const { return front_ == kNoStateId; }
112 void Clear() { front_ = kNoStateId; }
292 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
299 state_.resize(order_.size(), kNoStateId);
305 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
306 order_(order), state_(order.size(), kNoStateId) {}
318 state_[front_] = kNoStateId;
319 while ((front_ <= back_) && (state_[front_] == kNoStateId)) ++front_;
327 for (StateId i = front_; i <= back_; ++i) state_[i] = kNoStateId;
328 back_ = kNoStateId;
356 : QueueBase<S>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}
380 back_ = kNoStateId;
412 back_(kNoStateId) {}
419 || (trivial_queue_[front_] == kNoStateId)))))
437 trivial_queue_.push_back(kNoStateId);
448 trivial_queue_[front_] = kNoStateId;
465 || (trivial_queue_[front_] == kNoStateId);
473 trivial_queue_[i] = kNoStateId;
475 back_ = kNoStateId;
513 if ((props & kTopSorted) || fst.Start() == kNoStateId) {
