| /external/chromium_org/net/spdy/ |
| spdy_read_queue.h | 33 void Enqueue(scoped_ptr<SpdyBuffer> buffer);
|
| spdy_write_queue_unittest.cc | 84 write_queue.Enqueue(
86 write_queue.Enqueue(
88 write_queue.Enqueue(
126 write_queue.Enqueue(DEFAULT_PRIORITY, SYN_STREAM, producer1.Pass(),
128 write_queue.Enqueue(DEFAULT_PRIORITY, SYN_REPLY, producer2.Pass(),
130 write_queue.Enqueue(DEFAULT_PRIORITY, RST_STREAM, producer3.Pass(),
154 // Enqueue a bunch of writes and then call
166 write_queue.Enqueue(DEFAULT_PRIORITY, SYN_STREAM, IntToProducer(i), stream);
187 // Enqueue a bunch of writes and then call
208 write_queue.Enqueue(DEFAULT_PRIORITY, SYN_STREAM, IntToProducer(i)
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-unbound-queue.cc | 41 cq.Enqueue(1);
54 cq.Enqueue(1);
57 cq.Enqueue(i);
67 cq.Enqueue(i);
|
| /external/v8/src/ |
| circular-queue-inl.h | 37 void* SamplingCircularQueue::Enqueue() {
|
| unbound-queue.h | 50 INLINE(void Enqueue(const Record& rec));
|
| circular-queue.h | 53 // Enqueue returns a pointer to a memory location for storing the next
55 INLINE(void* Enqueue());
|
| /external/v8/test/cctest/ |
| test-unbound-queue.cc | 16 cq.Enqueue(1);
29 cq.Enqueue(1);
32 cq.Enqueue(i);
42 cq.Enqueue(i);
|
| /external/chromium_org/v8/src/ |
| unbound-queue.h | 50 INLINE(void Enqueue(const Record& rec));
|
| circular-queue-inl.h | 37 void* SamplingCircularQueue::Enqueue() {
|
| /external/chromium/testing/gtest/samples/ |
| sample3_unittest.cc | 78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
|
| sample5_unittest.cc | 151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
|
| /external/chromium_org/testing/gtest/samples/ |
| sample3_unittest.cc | 78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
|
| sample5_unittest.cc | 151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
|
| /external/gtest/samples/ |
| sample3_unittest.cc | 78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
|
| sample5_unittest.cc | 151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
|
| /external/libvpx/libvpx/third_party/googletest/src/samples/ |
| sample3_unittest.cc | 78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
|
| sample5_unittest.cc | 151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
|
| /external/protobuf/gtest/samples/ |
| sample3_unittest.cc | 78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
|
| sample5_unittest.cc | 151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
|
| /ndk/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
|
| sample5_unittest.cc | 151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 95 nodes.Enqueue(eof);
110 nodes.Enqueue(tree); // real node is next after DOWN
118 nodes.Enqueue(up); // we're moving back up
126 nodes.Enqueue(eof); // add to queue, might have UP nodes in there
133 nodes.Enqueue(tree); // add to queue, might have UP nodes in there
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeIterator.cs | 105 nodes.Enqueue( eof );
129 nodes.Enqueue( tree ); // real node is next after DOWN
140 nodes.Enqueue( up ); // we're moving back up
149 nodes.Enqueue( eof ); // add to queue, might have UP nodes in there
158 nodes.Enqueue( tree ); // add to queue, might have UP nodes in there
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| queue.h | 44 // void Enqueue(StateId s);
79 void Enqueue(StateId s) { Enqueue_(s); }
98 // Trivial queue discipline, templated on the StateId. You may enqueue
108 void Enqueue(StateId s) { front_ = s; }
117 virtual void Enqueue_(StateId s) { Enqueue(s); }
141 void Enqueue(StateId s) { push_front(s); }
149 virtual void Enqueue_(StateId s) { Enqueue(s); }
171 void Enqueue(StateId s) { push_front(s); }
179 virtual void Enqueue_(StateId s) { Enqueue(s); }
202 void Enqueue(StateId s)
[all...] |
| /external/openfst/src/include/fst/ |
| queue.h | 48 // void Enqueue(StateId s);
83 void Enqueue(StateId s) { Enqueue_(s); }
108 // Trivial queue discipline, templated on the StateId. You may enqueue
118 void Enqueue(StateId s) { front_ = s; }
130 virtual void Enqueue_(StateId s) { Enqueue(s); }
154 void Enqueue(StateId s) { push_front(s); }
165 virtual void Enqueue_(StateId s) { Enqueue(s); }
187 void Enqueue(StateId s) { push_front(s); }
198 virtual void Enqueue_(StateId s) { Enqueue(s); }
222 void Enqueue(StateId s)
[all...] |
