HomeSort by relevance Sort by last modified time
    Searched refs:Dequeue (Results 1 - 25 of 36) sorted by null

1 2

  /external/chromium/testing/gtest/samples/
sample3_unittest.cc 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
sample5_unittest.cc 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
sample3-inl.h 132 E* Dequeue() {
  /external/gtest/samples/
sample3_unittest.cc 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
sample5_unittest.cc 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
sample3-inl.h 132 E* Dequeue() {
  /external/protobuf/gtest/samples/
sample3_unittest.cc 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
sample5_unittest.cc 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int * n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
sample3-inl.h 132 E * Dequeue() {
  /external/v8/src/
unbound-queue.h 49 INLINE(void Dequeue(Record* rec));
unbound-queue-inl.h 69 void UnboundQueue<Record>::Dequeue(Record* rec) {
  /external/v8/test/cctest/
test-unbound-queue.cc 19 cq.Dequeue(&rec);
38 cq.Dequeue(&rec);
47 cq.Dequeue(&rec);
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
queue.h 46 // void Dequeue();
80 void Dequeue() { Dequeue_(); }
109 void Dequeue() { front_ = kNoStateId; }
118 virtual void Dequeue_() { Dequeue(); }
142 void Dequeue() { pop_back(); }
150 virtual void Dequeue_() { Dequeue(); }
172 void Dequeue() { pop_front(); }
180 virtual void Dequeue_() { Dequeue(); }
208 void Dequeue() {
233 virtual void Dequeue_() { Dequeue(); }
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeIterator.cs 101 Current = nodes.Dequeue();
127 Current = nodes.Dequeue();
134 Current = nodes.Dequeue();
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreeIterator.cs 114 Current = nodes.Dequeue();
150 Current = nodes.Dequeue();
159 Current = nodes.Dequeue();
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
LookaheadStream.cs 90 public override T Dequeue() {
104 _previousElement = Dequeue();
FastQueue.cs 38 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
39 * A linked list is fast at dequeue but slow at get(i). An array is
42 * List grows until you dequeue last element at end of buffer. Then
90 public virtual T Dequeue() {
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
LookaheadStream.cs 105 public override T Dequeue()
122 _previousElement = Dequeue();
FastQueue.cs 39 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
40 * A linked list is fast at dequeue but slow at get(i). An array is
43 * List grows until you dequeue last element at end of buffer. Then
97 public virtual T Dequeue()
  /external/openfst/src/include/fst/
queue.h 49 // void Dequeue();
83 void Dequeue() { Dequeue_(); }
118 void Dequeue() { front_ = kNoStateId; }
130 virtual void Dequeue_() { Dequeue(); }
154 void Dequeue() { pop_back(); }
165 virtual void Dequeue_() { Dequeue(); }
187 void Dequeue() { pop_front(); }
198 virtual void Dequeue_() { Dequeue(); }
231 void Dequeue() {
264 virtual void Dequeue_() { Dequeue(); }
    [all...]
  /external/chromium/base/synchronization/
waitable_event.h 113 // to dequeue the waiter from the other wait-list in time), two auto-resets
122 // two Waiters to be considered equal. In WaitableEvent::Dequeue, if the
151 bool Dequeue(Waiter* waiter, void* tag);
waitable_event_posix.cc 196 kernel_->Dequeue(&sw, &sw);
284 raw_waitables[i]->kernel_->Dequeue(&sw, &sw);
387 bool WaitableEvent::WaitableEventKernel::Dequeue(Waiter* waiter, void* tag) {
waitable_event_watcher_posix.cc 222 // We have a possible ABA issue here. If Dequeue was to compare only the
228 // To stop this, Dequeue also takes a tag argument which is passed to the
234 if (kernel_->Dequeue(waiter_, cancel_flag_.get())) {
  /external/clang/lib/StaticAnalyzer/Checkers/
VirtualCallChecker.cpp 81 WorkListUnit Dequeue() {
88 WorkListUnit WLUnit = Dequeue();
  /external/skia/include/views/
SkEvent.h 253 can be told to later call Dequeue().
290 static SkEvent* Dequeue();

Completed in 1824 milliseconds

1 2