/external/chromium_org/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();
|
/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();
|
/external/chromium_org/net/spdy/ |
H A D | spdy_read_queue.h | 37 size_t Dequeue(char* out, size_t len);
|
H A D | spdy_write_queue_unittest.cc | 129 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 134 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 139 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 144 EXPECT_FALSE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 170 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 175 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 180 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 185 EXPECT_FALSE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 209 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream)); 218 EXPECT_FALSE(write_queue.Dequeue( [all...] |
H A D | spdy_write_queue.h | 31 // i.e. whether the next call to Dequeue will return true. 48 bool Dequeue(SpdyFrameType* frame_type,
|
/external/chromium_org/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/chromium_org/tools/relocation_packer/src/ |
H A D | packer.cc | 57 CHECK(decoder.Dequeue() == 'A' && 58 decoder.Dequeue() == 'P' && 59 decoder.Dequeue() == 'R' && 60 decoder.Dequeue() == '1');
|
H A D | leb128.cc | 47 ELF::Xword Leb128Decoder::Dequeue() { function in class:relocation_packer::Leb128Decoder 66 values->push_back(Dequeue());
|
H A D | sleb128.cc | 67 ELF::Sxword Sleb128Decoder::Dequeue() { function in class:Sleb128Decoder 92 values->push_back(Dequeue());
|
H A D | leb128.h | 58 ELF::Xword Dequeue();
|
H A D | sleb128.h | 59 ELF::Sxword Dequeue();
|
/external/chromium_org/v8/src/ |
H A D | unbound-queue.h | 27 INLINE(bool Dequeue(Record* rec));
|
/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/chromium_org/third_party/android_crazy_linker/src/src/ |
H A D | crazy_linker_leb128.h | 20 size_t Dequeue() { function in class:crazy::Leb128Decoder 45 ssize_t Dequeue() { function in class:crazy::Sleb128Decoder
|
/external/chromium_org/native_client_sdk/src/libraries/sdk_util/ |
H A D | thread_safe_queue.h | 39 T* Dequeue(bool block) { function in class:sdk_util::ThreadSafeQueue
|
/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/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_org/base/synchronization/ |
H A D | waitable_event.h | 131 // two Waiters to be considered equal. In WaitableEvent::Dequeue, if the 159 bool Dequeue(Waiter* waiter, void* tag);
|