Home
last modified time | relevance | path

Searched refs:front_index_ (Results 1 – 4 of 4) sorted by relevance

/external/tensorflow/tensorflow/core/common_runtime/
Dsimple_propagator_state.h74 TaggedNodeReadyQueue() : front_index_(0) {} in TaggedNodeReadyQueue()
78 DCHECK_LT(front_index_, ready_.size()); in front()
79 return ready_[front_index_]; in front()
82 DCHECK_LT(front_index_, ready_.size()); in pop_front()
83 front_index_++; in pop_front()
84 if ((front_index_ == ready_.size()) || (front_index_ > kSpillThreshold)) { in pop_front()
85 if (front_index_ == ready_.size()) { in pop_front()
90 ready_.erase(ready_.begin(), ready_.begin() + front_index_); in pop_front()
92 front_index_ = 0; in pop_front()
102 int front_index_; variable
Dpropagator_state.h87 TaggedNodeReadyQueue() : front_index_(0) {} in TaggedNodeReadyQueue()
91 DCHECK_LT(front_index_, ready_.size()); in front()
92 return ready_[front_index_]; in front()
95 DCHECK_LT(front_index_, ready_.size()); in pop_front()
96 front_index_++; in pop_front()
97 if ((front_index_ == ready_.size()) || (front_index_ > kSpillThreshold)) { in pop_front()
98 if (front_index_ == ready_.size()) { in pop_front()
103 ready_.erase(ready_.begin(), ready_.begin() + front_index_); in pop_front()
105 front_index_ = 0; in pop_front()
115 int front_index_; variable
/external/tensorflow/tensorflow/lite/micro/examples/micro_speech/
Drecognize_commands.h34 : error_reporter_(error_reporter), front_index_(0), size_(0) {} in PreviousResultsQueue()
51 Result& front() { return results_[front_index_]; } in front()
53 int back_index = front_index_ + (size_ - 1); in back()
78 front_index_ += 1; in pop_front()
79 if (front_index_ >= kMaxResults) { in pop_front()
80 front_index_ = 0; in pop_front()
95 int index = front_index_ + offset; in from_front()
107 int front_index_; variable
/external/libchrome/base/task/sequence_manager/
Dlazily_deallocated_deque.h217 front_index_(0), in Ring()
231 bool empty() const { return back_index_ == front_index_; } in empty()
236 return front_index_ != CircularIncrement(back_index_); in CanPush()
241 DCHECK_NE(CircularDecrement(front_index_), back_index_); in push_front()
242 new (&data_[front_index_]) T(std::move(t)); in push_front()
243 front_index_ = CircularDecrement(front_index_); in push_front()
252 bool CanPop() const { return front_index_ != back_index_; } in CanPop()
256 front_index_ = CircularIncrement(front_index_); in pop_front()
257 data_[front_index_].~T(); in pop_front()
262 return data_[CircularIncrement(front_index_)]; in front()
[all …]