HomeSort by relevance Sort by last modified time
    Searched refs:front_ (Results 1 - 2 of 2) sorted by null

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
queue.h 106 TrivialQueue() : QueueBase<S>(TRIVIAL_QUEUE), front_(kNoStateId) {}
107 StateId Head() const { return front_; }
108 void Enqueue(StateId s) { front_ = s; }
109 void Dequeue() { front_ = kNoStateId; }
111 bool Empty() const { return front_ == kNoStateId; }
112 void Clear() { front_ = kNoStateId; }
123 StateId front_; member in class:fst::TrivialQueue
292 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
305 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId),
308 StateId Head() const { return state_[front_]; }
333 StateId front_; member in class:fst::TopOrderQueue
384 StateId front_; member in class:fst::StateOrderQueue
481 mutable StateId front_; member in class:fst::SccQueue
    [all...]
  /external/v8/src/
heap.h 261 PromotionQueue() : front_(NULL), rear_(NULL) { }
264 front_ = rear_ = reinterpret_cast<intptr_t*>(start_address);
267 bool is_empty() { return front_ <= rear_; }
272 *target = reinterpret_cast<HeapObject*>(*(--front_));
273 *size = static_cast<int>(*(--front_));
275 ASSERT(front_ >= rear_);
280 intptr_t* front_; member in class:v8::internal::PromotionQueue
    [all...]

Completed in 107 milliseconds