Searched refs:front_ (Results 1 - 4 of 4) sorted by relevance
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | 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/openfst/src/include/fst/ |
H A D | queue.h | 116 TrivialQueue() : QueueBase<S>(TRIVIAL_QUEUE), front_(kNoStateId) {} 117 StateId Head() const { return front_; } 118 void Enqueue(StateId s) { front_ = s; } 119 void Dequeue() { front_ = kNoStateId; } 121 bool Empty() const { return front_ == kNoStateId; } 122 void Clear() { front_ = kNoStateId; } 136 StateId front_; member in class:fst::TrivialQueue 322 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId), 337 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId), 340 StateId Head() const { return state_[front_]; } 365 StateId front_; member in class:fst::TopOrderQueue 418 StateId front_; member in class:fst::StateOrderQueue 514 mutable StateId front_; member in class:fst::SccQueue [all...] |
/external/chromium_org/v8/src/heap/ |
H A D | heap.h | 374 : front_(NULL), 415 return (front_ == rear_) && 423 if (front_ == rear_) { 430 if (NewSpacePage::IsAtStart(reinterpret_cast<Address>(front_))) { 432 NewSpacePage::FromAddress(reinterpret_cast<Address>(front_)); 434 front_ = reinterpret_cast<intptr_t*>(front_page->prev_page()->area_end()); 436 *target = reinterpret_cast<HeapObject*>(*(--front_)); 437 *size = static_cast<int>(*(--front_)); 440 reinterpret_cast<Address>(front_)); 445 intptr_t* front_; member in class:v8::internal::PromotionQueue [all...] |
H A D | heap.cc | 1365 front_ = rear_ = 1376 intptr_t* head_end = Min(front_, reinterpret_cast<intptr_t*>(p->area_end()));
|
Completed in 6076 milliseconds