/external/chromium/testing/gtest/samples/ |
H A D | sample3_unittest.cc | 128 // Tests Dequeue(). 129 TEST_F(QueueTest, Dequeue) { 130 int * n = q0_.Dequeue(); 133 n = q1_.Dequeue(); 139 n = q2_.Dequeue();
|
H A D | sample5_unittest.cc | 177 // Tests Dequeue(). 178 TEST_F(QueueTest, Dequeue) { 179 int* n = q0_.Dequeue(); 182 n = q1_.Dequeue(); 188 n = q2_.Dequeue();
|
H A D | sample3-inl.h | 132 E* Dequeue() { function in class:Queue
|
/external/gtest/samples/ |
H A D | sample3_unittest.cc | 128 // Tests Dequeue(). 129 TEST_F(QueueTest, Dequeue) { 130 int * n = q0_.Dequeue(); 133 n = q1_.Dequeue(); 139 n = q2_.Dequeue();
|
H A D | sample5_unittest.cc | 177 // Tests Dequeue(). 178 TEST_F(QueueTest, Dequeue) { 179 int* n = q0_.Dequeue(); 182 n = q1_.Dequeue(); 188 n = q2_.Dequeue();
|
H A D | sample3-inl.h | 132 E* Dequeue() { function in class:Queue
|
/external/protobuf/gtest/samples/ |
H A D | sample3_unittest.cc | 128 // Tests Dequeue(). 129 TEST_F(QueueTest, Dequeue) { 130 int * n = q0_.Dequeue(); 133 n = q1_.Dequeue(); 139 n = q2_.Dequeue();
|
H A D | sample5_unittest.cc | 177 // Tests Dequeue(). 178 TEST_F(QueueTest, Dequeue) { 179 int * n = q0_.Dequeue(); 182 n = q1_.Dequeue(); 188 n = q2_.Dequeue();
|
H A D | sample3-inl.h | 132 E * Dequeue() { function in class:Queue
|
/external/v8/test/cctest/ |
H A D | test-unbound-queue.cc | 19 cq.Dequeue(&rec); 38 cq.Dequeue(&rec); 47 cq.Dequeue(&rec);
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | 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/ |
H A D | TreeIterator.cs | 114 Current = nodes.Dequeue(); 150 Current = nodes.Dequeue(); 159 Current = nodes.Dequeue();
|
/external/v8/src/ |
H A D | unbound-queue.h | 49 INLINE(void Dequeue(Record* rec));
|
H A D | unbound-queue-inl.h | 69 void UnboundQueue<Record>::Dequeue(Record* rec) { function in class:v8::internal::UnboundQueue
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
H A D | LookaheadStream.cs | 90 public override T Dequeue() { method in class:Antlr.Runtime.Misc.LookaheadStream 104 _previousElement = Dequeue();
|
H A D | FastQueue.cs | 90 public virtual T Dequeue() { method in class:Antlr.Runtime.Misc.FastQueue
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/ |
H A D | LookaheadStream.cs | 105 public override T Dequeue() method in class:Antlr.Runtime.Misc.LookaheadStream 122 _previousElement = Dequeue();
|
H A D | FastQueue.cs | 97 public virtual T Dequeue() method in class:Antlr.Runtime.Misc.FastQueue
|
/external/openfst/src/include/fst/ |
H A D | queue.h | 49 // void Dequeue(); 83 void Dequeue() { Dequeue_(); } function in class:fst::QueueBase 118 void Dequeue() { front_ = kNoStateId; } function in class:fst::TrivialQueue 130 virtual void Dequeue_() { Dequeue(); } 154 void Dequeue() { pop_back(); } function in class:fst::FifoQueue 165 virtual void Dequeue_() { Dequeue(); } 187 void Dequeue() { pop_front(); } function in class:fst::LifoQueue 198 virtual void Dequeue_() { Dequeue(); } 231 void Dequeue() { function in class:fst::ShortestFirstQueue 264 virtual void Dequeue_() { Dequeue(); } 348 void Dequeue() { function in class:fst::TopOrderQueue 401 void Dequeue() { function in class:fst::StateOrderQueue 476 void Dequeue() { function in class:fst::SccQueue 637 void Dequeue() { queue_->Dequeue(); } function in class:fst::AutoQueue 833 void Dequeue() { queue_->Dequeue(); } function in class:fst::PruneQueue [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | queue.h | 46 // void Dequeue(); 80 void Dequeue() { Dequeue_(); } function in class:fst::QueueBase 109 void Dequeue() { front_ = kNoStateId; } function in class:fst::TrivialQueue 118 virtual void Dequeue_() { Dequeue(); } 142 void Dequeue() { pop_back(); } function in class:fst::FifoQueue 150 virtual void Dequeue_() { Dequeue(); } 172 void Dequeue() { pop_front(); } function in class:fst::LifoQueue 180 virtual void Dequeue_() { Dequeue(); } 208 void Dequeue() { function in class:fst::ShortestFirstQueue 233 virtual void Dequeue_() { Dequeue(); } 317 void Dequeue() { function in class:fst::TopOrderQueue 368 void Dequeue() { function in class:fst::StateOrderQueue 442 void Dequeue() { function in class:fst::SccQueue 601 void Dequeue() { queue_->Dequeue(); } function in class:fst::AutoQueue [all...] |
/external/chromium/base/synchronization/ |
H A D | waitable_event.h | 122 // two Waiters to be considered equal. In WaitableEvent::Dequeue, if the 151 bool Dequeue(Waiter* waiter, void* tag);
|
H A D | 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) { function in class:base::WaitableEvent::WaitableEventKernel
|
H A D | 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/ |
H A D | VirtualCallChecker.cpp | 81 WorkListUnit Dequeue() { function in class:__anon3936::WalkAST 88 WorkListUnit WLUnit = Dequeue();
|
/external/skia/src/views/ |
H A D | SkEvent.cpp | 355 SkEvent* SkEvent::Dequeue() { function in class:SkEvent 419 SkEvent* evt = SkEvent::Dequeue();
|