| /external/v8/test/cctest/ |
| test-unbound-queue.cc | 19 cq.Dequeue(&rec);
38 cq.Dequeue(&rec);
47 cq.Dequeue(&rec);
|
| /external/chromium_org/net/spdy/ |
| 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,
|
| spdy_read_queue.cc | 34 size_t SpdyReadQueue::Dequeue(char* out, size_t len) {
|
| spdy_read_queue.h | 37 size_t Dequeue(char* out, size_t len);
|
| /system/core/toolbox/grep/ |
| queue.c | 57 static struct qentry *dequeue(void);
75 item = dequeue();
82 dequeue(void) function
100 while ((item = dequeue()) != NULL) {
112 while ((item = dequeue()) != NULL) {
|
| /external/chromium_org/v8/test/cctest/ |
| test-unbound-queue.cc | 44 cq.Dequeue(&rec);
63 cq.Dequeue(&rec);
72 cq.Dequeue(&rec);
|
| /packages/apps/Nfc/nci/jni/ |
| DataQueue.h | 71 ** Function: dequeue
81 bool dequeue (UINT8* buffer, UINT16 bufferMaxLen, UINT16& actualLen);
|
| DataQueue.cpp | 113 ** Function: dequeue
123 bool DataQueue::dequeue (UINT8* buffer, UINT16 bufferMaxLen, UINT16& actualLen) function in class:DataQueue
148 //adjust offset so the next dequeue() will get the remainder
|
| /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/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();
|
| /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();
|
| /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();
|
| /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();
|
| /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();
|
| /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/Java/src/main/java/org/antlr/runtime/misc/ |
| FastQueue.java | 34 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
35 * A linked list is fast at dequeue but slow at get(i). An array is
38 * List grows until you dequeue last element at end of buffer. Then
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| FastQueue.h | 34 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
35 * A linked list is fast at dequeue but slow at get(i). An array is
38 * List grows until you dequeue last element at end of buffer. Then
|
| FastQueue.m | 34 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
35 * A linked list is fast at dequeue but slow at get(i). An array is
38 * List grows until you dequeue last element at end of buffer. Then
|
| /external/bluetooth/bluedroid/hci/include/ |
| utils.h | 139 ** Description Dequeue the given buffer from the middle of the given queue
150 ** Description Dequeue the given buffer from the middle of the given queue without lock
|
| /cts/suite/audio_quality/lib/include/task/ |
| TaskSequential.h | 41 * Run all async tasks queued (= call complete) and dequeue them.
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
| 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/ |
| FastQueue.cs | 39 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
40 * A linked list is fast at dequeue but slow at get(i). An array is
43 * List grows until you dequeue last element at end of buffer. Then
97 public virtual T Dequeue()
|
| /external/chromium_org/native_client_sdk/src/libraries/sdk_util/ |
| thread_safe_queue.h | 39 T* Dequeue(bool block) {
|
| /external/dropbear/ |
| queue.h | 45 void* dequeue(struct Queue* queue);
|
