Searched refs:front_ (Results 1 – 5 of 5) sorted by relevance
23 front_ = new QueueNode(nullptr); in InitQueue()24 if (front_ == nullptr) { in InitQueue()28 rear_ = front_; in InitQueue()34 if (front_ == rear_ && length_ == 0) { in IsEmpty()75 if (front_ == nullptr || IsEmpty()) { in Dequeue()82 delete front_; in Dequeue()83 front_ = tmp; in Dequeue()90 return front_ ? front_->GetNodeNext() : nullptr; in GetNext()95 QueueNode *tmp = front_; in FreeNode()98 front_ = front_->GetNodeNext(); in FreeNode()[all …]
74 return front_; in GetFront()107 QueueNode *front_;
33 retSize = (back_ - front_ + realcap) % realcap; in GetSize()40 if (realcap != 0 && front_ == (back_ + 1) % realcap) { in Push()41 front_ = (front_ + 1) % realcap; in Push()54 front_ = 0; in Clear()158 return Iter(&queue_, front_); in begin()178 return RevertIter(&queue_, (front_ + cap) % realcap); in rend()186 int front_ = 0; variable
57 front_(false), in AsyncTaskManager()95 if (!front_) { in Callback()213 front_ = front; in SetFront()
64 return front_; in IsFront()80 bool front_; variable