| /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();
|
| /external/chromium_org/net/spdy/ |
| spdy_read_queue.h | 37 size_t Dequeue(char* out, size_t len);
|
| spdy_write_queue_unittest.cc | 95 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
100 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
105 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
110 EXPECT_FALSE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
136 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
141 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
146 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
151 EXPECT_FALSE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
175 ASSERT_TRUE(write_queue.Dequeue(&frame_type, &frame_producer, &stream));
184 EXPECT_FALSE(write_queue.Dequeue(&frame_type, &frame_producer, &stream))
[all...] |
| 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/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();
|
| /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();
|
| /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();
|
| /ndk/sources/third_party/googletest/googletest/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();
|
| /external/chromium_org/v8/src/ |
| unbound-queue.h | 49 INLINE(bool Dequeue(Record* rec));
|
| /external/v8/src/ |
| unbound-queue.h | 49 INLINE(void Dequeue(Record* rec));
|
| /external/chromium_org/v8/test/cctest/ |
| test-unbound-queue.cc | 44 cq.Dequeue(&rec);
63 cq.Dequeue(&rec);
72 cq.Dequeue(&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/chromium_org/native_client_sdk/src/libraries/sdk_util/ |
| thread_safe_queue.h | 39 T* Dequeue(bool block) {
|
| /external/openfst/src/include/fst/ |
| queue.h | 50 // void Dequeue();
84 void Dequeue() { Dequeue_(); }
119 void Dequeue() { front_ = kNoStateId; }
131 virtual void Dequeue_() { Dequeue(); }
155 void Dequeue() { pop_back(); }
166 virtual void Dequeue_() { Dequeue(); }
188 void Dequeue() { pop_front(); }
199 virtual void Dequeue_() { Dequeue(); }
232 void Dequeue() {
265 virtual void Dequeue_() { Dequeue(); }
[all...] |
| /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();
|
