/external/libcxx/test/containers/container.adaptors/queue/queue.cons/ |
H A D | ctor_container.pass.cpp | 10 // <queue> 12 // explicit queue(const container_type& c); 14 #include <queue> 30 std::queue<int> q(d);
|
/external/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
H A D | pop.pass.cpp | 10 // <queue> 14 #include <queue> 19 std::queue<int> q;
|
H A D | push_rv.pass.cpp | 10 // <queue> 14 #include <queue> 22 std::queue<MoveOnly> q;
|
/external/openfst/src/include/fst/script/ |
H A D | shortest-path.h | 72 Queue *queue = QueueConstructor<Queue, Arc, local 75 queue, ArcFilter(), opts.nshortest, opts.unique, 79 delete queue; 84 Queue *queue = QueueConstructor<Queue, Arc, local 87 queue, ArcFilter(), opts.nshortest, opts.unique, 91 delete queue; 96 Queue *queue = QueueConstructor<Queue, Arc, local 99 queue, ArcFilter(), opts.nshortest, opts.unique, 103 delete queue; 108 Queue *queue local 120 Queue *queue = QueueConstructor<Queue, Arc, local 132 Queue *queue = QueueConstructor<Queue, Arc, local [all...] |
/external/libnl/src/ |
H A D | nf-queue.c | 2 * src/nf-queue.c Monitor netfilter queue events 19 #include <netlink/netfilter/queue.h> 26 struct nfnl_queue *queue; local 28 queue = nfnl_queue_alloc(); 29 if (!queue) 30 nl_cli_fatal(ENOMEM, "Unable to allocate queue object"); 32 return queue; 87 struct nfnl_queue *queue; local 101 printf("Usage: nf-queue famil [all...] |
/external/strace/ |
H A D | unwind.c | 88 static void queue_print(struct queue_t *queue); 110 tcp->queue = malloc(sizeof(*tcp->queue)); 111 if (!tcp->queue) 113 tcp->queue->head = NULL; 114 tcp->queue->tail = NULL; 120 queue_print(tcp->queue); 121 free(tcp->queue); 122 tcp->queue = NULL; 481 * queue manipulator 484 queue_put(struct queue_t *queue, const char *binary_filename, const char *symbol_name, unw_word_t function_offset, unsigned long true_offset, const char *error) argument 514 queue_put_call(void *queue, const char *binary_filename, const char *symbol_name, unw_word_t function_offset, unsigned long true_offset) argument 529 queue_put_error(void *queue, const char *error, unsigned long ip) argument 537 queue_print(struct queue_t *queue) argument [all...] |
/external/chromium_org/net/spdy/ |
H A D | spdy_write_queue_unittest.cc | 56 RequeingBufferProducer(SpdyWriteQueue* queue) { argument 59 base::Bind(RequeingBufferProducer::ConsumeCallback, queue)); 66 static void ConsumeCallback(SpdyWriteQueue* queue, argument 73 queue->Enqueue( 265 // Enqueue a bunch of writes and then call Clear(). The write queue 285 SpdyWriteQueue queue; local 286 queue.Enqueue( 289 scoped_ptr<SpdyBufferProducer>(new RequeingBufferProducer(&queue)), 296 EXPECT_TRUE(queue.Dequeue(&frame_type, &producer, &stream)); 297 EXPECT_TRUE(queue 312 SpdyWriteQueue queue; local 334 SpdyWriteQueue queue; local 356 SpdyWriteQueue queue; local [all...] |
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | RemoveTree.cpp | 15 std::queue<TIntermNode*> nodeQueue;
|
/external/chromium_org/third_party/webrtc/base/ |
H A D | socketserver.h | 28 // called to allow the socket server to use the thread's message queue for 30 virtual void SetMessageQueue(MessageQueue* queue) {} argument
|
/external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
H A D | ctor_comp.pass.cpp | 10 // <queue> 14 #include <queue>
|
H A D | ctor_default.pass.cpp | 10 // <queue> 14 #include <queue>
|
H A D | ctor_iter_iter.pass.cpp | 10 // <queue> 15 #include <queue>
|
H A D | ctor_iter_iter_comp.pass.cpp | 10 // <queue> 15 #include <queue>
|
H A D | ctor_iter_iter_comp_cont.pass.cpp | 10 // <queue> 16 #include <queue>
|
/external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.members/ |
H A D | emplace.pass.cpp | 10 // <queue> 16 #include <queue>
|
H A D | push.pass.cpp | 10 // <queue> 16 #include <queue>
|
H A D | push_rvalue.pass.cpp | 10 // <queue> 16 #include <queue>
|
H A D | swap.pass.cpp | 10 // <queue> 16 #include <queue>
|
H A D | top.pass.cpp | 10 // <queue> 16 #include <queue>
|
/external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.special/ |
H A D | swap.pass.cpp | 10 // <queue> 18 #include <queue>
|
/external/stlport/stlport/ |
H A D | queue | 42 # include_next <queue> 44 # include _STLP_NATIVE_HEADER(queue)
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
H A D | Analyzer.java | 133 IntQueue queue = new IntQueue(); 141 queue.add(iter.next()); 142 while (!queue.isEmpty()) { 143 analyzeNextEntry(method, iter, queue, executor); 168 IntQueue queue, Executor executor) throws BadBytecode { 169 int pos = queue.take(); 185 mergeTableSwitch(queue, pos, iter, frame); 187 mergeLookupSwitch(queue, pos, iter, frame); 189 mergeRet(queue, iter, pos, frame, subroutine); 195 mergeJsr(queue, frame 167 analyzeNextEntry(MethodInfo method, CodeIterator iter, IntQueue queue, Executor executor) argument 276 merge(IntQueue queue, Frame frame, int target) argument 292 mergeExceptionHandlers(IntQueue queue, MethodInfo method, int pos, Frame frame) argument 306 mergeJsr(IntQueue queue, Frame frame, Subroutine sub, int pos, int next) argument 347 mergeLookupSwitch(IntQueue queue, int pos, CodeIterator iter, Frame frame) argument 361 mergeRet(IntQueue queue, CodeIterator iter, int pos, Frame frame, Subroutine subroutine) argument 400 mergeTableSwitch(IntQueue queue, int pos, CodeIterator iter, Frame frame) argument [all...] |
/external/chromium_org/cc/resources/ |
H A D | image_layer_updater.cc | 17 void ImageLayerUpdater::Resource::Update(ResourceUpdateQueue* queue, argument 22 queue, texture(), source_rect, dest_offset, partial_update); 36 void ImageLayerUpdater::UpdateTexture(ResourceUpdateQueue* queue, argument 54 queue->AppendPartialUpload(upload); 56 queue->AppendFullUpload(upload);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | MinMaxPriorityQueueTest.java | 52 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue 54 assertEquals(11, queue.capacity()); 55 checkUnbounded(queue); 56 checkNatural(queue); 60 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue 63 assertEquals(11, queue.capacity()); 64 checkUnbounded(queue); 65 assertSame(SOME_COMPARATOR, queue.comparator()); 69 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue 72 assertEquals(8, queue 175 checkNatural(MinMaxPriorityQueue<Integer> queue) argument 179 checkUnbounded(MinMaxPriorityQueue<Integer> queue) argument [all...] |
/external/chromium_org/cc/layers/ |
H A D | ui_resource_layer_unittest.cc | 60 ResourceUpdateQueue queue; local 64 test_layer->Update(&queue, &occlusion_tracker); 73 test_layer->Update(&queue, &occlusion_tracker); 88 ResourceUpdateQueue queue; local 92 test_layer->Update(&queue, &occlusion_tracker); 100 test_layer->Update(&queue, &occlusion_tracker);
|