/external/google-breakpad/src/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 | 131 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/vulkan-validation-layers/tests/gtest-1.7.0/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();
|
/external/v8/src/ |
H A D | locked-queue.h | 25 inline bool Dequeue(Record* record);
|
H A D | locked-queue-inl.h | 57 inline bool LockedQueue<Record>::Dequeue(Record* record) { function in class:v8::internal::LockedQueue
|
/external/v8/test/unittests/ |
H A D | locked-queue-unittest.cc | 29 bool success = queue.Dequeue(&a); 46 success = queue.Dequeue(&a); 74 queue.Dequeue(&rec); 83 queue.Dequeue(&rec);
|
/external/v8/test/cctest/ |
H A D | test-unbound-queue.cc | 45 cq.Dequeue(&rec); 64 cq.Dequeue(&rec); 73 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/profiler/ |
H A D | unbound-queue.h | 27 INLINE(bool Dequeue(Record* rec));
|
H A D | unbound-queue-inl.h | 46 bool 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/openfst/src/include/fst/ |
H A D | queue.h | 50 // void Dequeue(); 84 void Dequeue() { Dequeue_(); } function in class:fst::QueueBase 119 void Dequeue() { front_ = kNoStateId; } function in class:fst::TrivialQueue 131 virtual void Dequeue_() { Dequeue(); } 155 void Dequeue() { pop_back(); } function in class:fst::FifoQueue 166 virtual void Dequeue_() { Dequeue(); } 188 void Dequeue() { pop_front(); } function in class:fst::LifoQueue 199 virtual void Dequeue_() { Dequeue(); } 232 void Dequeue() { function in class:fst::ShortestFirstQueue 265 virtual void Dequeue_() { Dequeue(); } 349 void Dequeue() { function in class:fst::TopOrderQueue 402 void Dequeue() { function in class:fst::StateOrderQueue 477 void Dequeue() { function in class:fst::SccQueue 638 void Dequeue() { queue_->Dequeue(); } function in class:fst::AutoQueue 834 void Dequeue() { queue_->Dequeue(); } function in class:fst::PruneQueue 913 void Dequeue() { queue_->Dequeue(); } function in class:fst::FilterQueue [all...] |
/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/libchrome/base/synchronization/ |
H A D | waitable_event.h | 127 // two Waiters to be considered equal. In WaitableEvent::Dequeue, if the 155 bool Dequeue(Waiter* waiter, void* tag);
|
H A D | waitable_event_posix.cc | 201 // WaitableEvent now: |Dequeue| is called even when |sw.fired()| is true, 206 kernel_->Dequeue(&sw, &sw); 295 raw_waitables[i]->kernel_->Dequeue(&sw, &sw); 403 bool WaitableEvent::WaitableEventKernel::Dequeue(Waiter* waiter, void* tag) { function in class:base::WaitableEvent::WaitableEventKernel
|
H A D | waitable_event_watcher_posix.cc | 212 // We have a possible ABA issue here. If Dequeue was to compare only the 218 // To stop this, Dequeue also takes a tag argument which is passed to the 224 if (kernel_->Dequeue(waiter_, cancel_flag_.get())) {
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | VirtualCallChecker.cpp | 82 WorkListUnit Dequeue() { function in class:__anon1733::WalkAST 89 WorkListUnit WLUnit = Dequeue();
|