Lines Matching refs:kNoStateId
116 TrivialQueue() : QueueBase<S>(TRIVIAL_QUEUE), front_(kNoStateId) {}
119 void Dequeue() { front_ = kNoStateId; }
121 bool Empty() const { return front_ == kNoStateId; }
122 void Clear() { front_ = kNoStateId; }
322 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
331 state_.resize(order_.size(), kNoStateId);
337 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
338 order_(order), state_(order.size(), kNoStateId) {}
350 state_[front_] = kNoStateId;
351 while ((front_ <= back_) && (state_[front_] == kNoStateId)) ++front_;
359 for (StateId i = front_; i <= back_; ++i) state_[i] = kNoStateId;
360 back_ = kNoStateId;
390 : QueueBase<S>(STATE_ORDER_QUEUE), front_(0), back_(kNoStateId) {}
414 back_ = kNoStateId;
449 back_(kNoStateId) {}
456 || (trivial_queue_[front_] == kNoStateId)))))
472 trivial_queue_.push_back(kNoStateId);
481 trivial_queue_[front_] = kNoStateId;
498 || (trivial_queue_[front_] == kNoStateId);
506 trivial_queue_[i] = kNoStateId;
508 back_ = kNoStateId;
551 if ((props & kTopSorted) || fst.Start() == kNoStateId) {
