| /external/googletest/googletest/samples/ |
| D | sample3_unittest.cc | 129 TEST_F(QueueTestSmpl3, Dequeue) { in TEST_F() argument
130 int * n = q0_.Dequeue(); in TEST_F()
133 n = q1_.Dequeue(); in TEST_F()
139 n = q2_.Dequeue(); in TEST_F()
|
| D | sample5_unittest.cc | 178 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
179 int* n = q0_.Dequeue(); in TEST_F()
182 n = q1_.Dequeue(); in TEST_F()
188 n = q2_.Dequeue(); in TEST_F()
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| D | sample3_unittest.cc | 129 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
130 int * n = q0_.Dequeue(); in TEST_F()
133 n = q1_.Dequeue(); in TEST_F()
139 n = q2_.Dequeue(); in TEST_F()
|
| D | sample5_unittest.cc | 178 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
179 int* n = q0_.Dequeue(); in TEST_F()
182 n = q1_.Dequeue(); in TEST_F()
188 n = q2_.Dequeue(); in TEST_F()
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| D | sample3_unittest.cc | 129 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
130 int * n = q0_.Dequeue(); in TEST_F()
133 n = q1_.Dequeue(); in TEST_F()
139 n = q2_.Dequeue(); in TEST_F()
|
| D | sample5_unittest.cc | 178 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
179 int* n = q0_.Dequeue(); in TEST_F()
182 n = q1_.Dequeue(); in TEST_F()
188 n = q2_.Dequeue(); in TEST_F()
|
| /external/v8/testing/gtest/samples/ |
| D | sample3_unittest.cc | 129 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
130 int * n = q0_.Dequeue(); in TEST_F()
133 n = q1_.Dequeue(); in TEST_F()
139 n = q2_.Dequeue(); in TEST_F()
|
| D | sample5_unittest.cc | 178 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
179 int* n = q0_.Dequeue(); in TEST_F()
182 n = q1_.Dequeue(); in TEST_F()
188 n = q2_.Dequeue(); in TEST_F()
|
| /external/protobuf/gtest/samples/ |
| D | sample3_unittest.cc | 129 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
130 int * n = q0_.Dequeue(); in TEST_F()
133 n = q1_.Dequeue(); in TEST_F()
139 n = q2_.Dequeue(); in TEST_F()
|
| D | sample5_unittest.cc | 178 TEST_F(QueueTest, Dequeue) { in TEST_F() argument
179 int* n = q0_.Dequeue(); in TEST_F()
182 n = q1_.Dequeue(); in TEST_F()
188 n = q2_.Dequeue(); in TEST_F()
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | TreeIterator.cs | 101 Current = nodes.Dequeue(); in MoveNext()
127 Current = nodes.Dequeue(); in MoveNext()
134 Current = nodes.Dequeue(); in MoveNext()
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | TreeIterator.cs | 114 Current = nodes.Dequeue(); in MoveNext()
150 Current = nodes.Dequeue(); in MoveNext()
159 Current = nodes.Dequeue(); in MoveNext()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_QueueCloseV2.pbtxt | 23 Subsequent Dequeue(Many) operations will continue to succeed if
24 sufficient elements remain in the queue. Subsequent Dequeue(Many)
|
| D | api_def_QueueClose.pbtxt | 21 Subsequent Dequeue(Many) operations will continue to succeed if
22 sufficient elements remain in the queue. Subsequent Dequeue(Many)
|
| D | api_def_Unstage.pbtxt | 3 summary: "Op is similar to a lightweight Dequeue."
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
| D | LookaheadStream.cs | 90 public override T Dequeue() { in Dequeue() method in Antlr.Runtime.Misc.LookaheadStream
104 _previousElement = Dequeue(); in Consume()
|
| D | FastQueue.cs | 90 public virtual T Dequeue() { in Dequeue() method in Antlr.Runtime.Misc.FastQueue
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/ |
| D | LookaheadStream.cs | 105 public override T Dequeue() in Dequeue() method in Antlr.Runtime.Misc.LookaheadStream
122 _previousElement = Dequeue(); in Consume()
|
| D | FastQueue.cs | 97 public virtual T Dequeue() in Dequeue() method in Antlr.Runtime.Misc.FastQueue
|
| /external/libchrome/base/synchronization/ |
| D | waitable_event_posix.cc | 215 kernel_->Dequeue(&sw, &sw); in TimedWaitUntil()
305 raw_waitables[i]->kernel_->Dequeue(&sw, &sw); in WaitMany()
424 bool WaitableEvent::WaitableEventKernel::Dequeue(Waiter* waiter, void* tag) { in Dequeue() function in base::WaitableEvent::WaitableEventKernel
|
| D | waitable_event.h | 171 bool Dequeue(Waiter* waiter, void* tag);
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | VirtualCallChecker.cpp | 82 WorkListUnit Dequeue() { in Dequeue() function in __anonb8c375050111::WalkAST
89 WorkListUnit WLUnit = Dequeue(); in Execute()
|
| /external/v8/src/ |
| D | locked-queue.h | 25 inline bool Dequeue(Record* record);
|
| /external/v8/src/profiler/ |
| D | unbound-queue.h | 27 INLINE(bool Dequeue(Record* rec));
|
| /external/mesa3d/src/gallium/drivers/swr/rasterizer/core/ |
| D | ringbuffer.h | 75 INLINE void Dequeue() in Dequeue() function
|