/hardware/qcom/media/mm-video-legacy/vidc/vdec/inc/ |
queue.h | 31 typedef struct Queue Queue; 33 Queue *alloc_queue(); 34 void free_queue(Queue *q); 35 void free_queue_and_qelement(Queue *q); 36 int push(Queue *q, void * element); 37 void *pop(Queue *q);
|
/hardware/qcom/media/mm-video-v4l2/vidc/vdec/inc/ |
queue.h | 31 typedef struct Queue Queue; 33 Queue *alloc_queue(); 34 void free_queue(Queue *q); 35 void free_queue_and_qelement(Queue *q); 36 int push(Queue *q, void * element); 37 void *pop(Queue *q);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
TestQueueGenerator.java | 19 import java.util.Queue; 30 Queue<E> create(Object... elements);
|
TestStringQueueGenerator.java | 22 import java.util.Queue; 25 * Create queue of strings for tests. 40 public Queue<String> create(Object... elements) { 49 protected abstract Queue<String> create(String[] elements);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
AbstractQueueTester.java | 21 import java.util.Queue; 24 * Base class for queue collection tests. 31 protected final Queue<E> getQueue() { 32 return (Queue<E>) collection;
|
/external/chromium_org/media/base/ |
serial_runner.h | 8 #include <queue> 31 // Serial queue of bound functions to run. 32 class MEDIA_EXPORT Queue { 34 Queue(); 35 ~Queue(); 47 std::queue<BoundPipelineStatusCB> bound_fns_; 65 const Queue& bound_fns, const PipelineStatusCB& done_cb); 70 SerialRunner(const Queue& bound_fns, const PipelineStatusCB& done_cb); 76 Queue bound_fns_;
|
decoder_buffer_queue.h | 18 // Maintains a queue of DecoderBuffers in increasing timestamp order. 21 // queue i.e., the queue must have at least 2 in-order buffers to calculate 30 // Push |buffer| to the end of the queue. If |buffer| is queued out of order 36 // Pops a DecoderBuffer from the front of the queue. 38 // It is invalid to call Pop() on an empty queue. 44 // Returns true if this queue is empty. 47 // Returns the duration of encoded data stored in this queue as measured by 51 // Returns zero if the queue is empty. 54 // Returns the total size of buffers inside the queue [all...] |
serial_runner.cc | 42 SerialRunner::Queue::Queue() {} 43 SerialRunner::Queue::~Queue() {} 45 void SerialRunner::Queue::Push(const base::Closure& closure) { 49 void SerialRunner::Queue::Push( 54 void SerialRunner::Queue::Push( 59 SerialRunner::BoundPipelineStatusCB SerialRunner::Queue::Pop() { 65 bool SerialRunner::Queue::empty() { 69 SerialRunner::SerialRunner(const Queue& bound_fns [all...] |
/external/protobuf/gtest/samples/ |
sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list. 44 class Queue; 46 // QueueNode is a node in a Queue, which consists of an element of 50 friend class Queue<E>; 56 // Gets the next node in the queue. 74 class Queue { 77 // Creates an empty queue. 78 Queue() : head_(NULL), last_(NULL), size_(0) {} 80 // D'tor. Clears the queue [all...] |
sample3_unittest.cc | 95 // A helper function for testing Queue::Map(). 96 void MapTester(const Queue<int> * q) { 97 // Creates a new queue, where each element is twice as big as the 99 const Queue<int> * const new_q = q->Map(Double); 101 // Verifies that the new queue has the same size as q. 114 Queue<int> q0_; 115 Queue<int> q1_; 116 Queue<int> q2_; 146 // Tests the Queue::Map() function.
|
/hardware/qcom/media/mm-video-legacy/vidc/vdec/src/ |
queue.c | 29 Queue with Linked list 32 #include "queue.h" 43 struct Queue 50 Queue *alloc_queue() 52 Queue *q = (Queue *) malloc(sizeof(Queue)); 61 void free_queue(Queue *q) 69 void free_queue_and_qelement(Queue *q) 79 int push(Queue *q, void * element [all...] |
/hardware/qcom/media/mm-video-v4l2/vidc/vdec/src/ |
queue.c | 29 Queue with Linked list 32 #include "queue.h" 42 struct Queue { 48 Queue *alloc_queue() 50 Queue *q = (Queue *) malloc(sizeof(Queue)); 60 void free_queue(Queue *q) 67 void free_queue_and_qelement(Queue *q) 77 int push(Queue *q, void * element [all...] |
/packages/apps/Nfc/nci/jni/ |
DataQueue.h | 18 * Store data bytes in a variable-size queue. 59 ** Description: Append data to the queue. 73 ** Description: Retrieve and remove data from the front of the queue. 88 ** Description: Whether the queue is empty. 101 typedef std::list<tHeader*> Queue; 103 Queue mQueue;
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/multiprocessing/dummy/ |
connection.py | 37 from Queue import Queue 46 self._backlog_queue = Queue(backlog) 58 _in, _out = Queue(), Queue() 64 a, b = Queue(), Queue()
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/multiprocessing/dummy/ |
connection.py | 37 from Queue import Queue 46 self._backlog_queue = Queue(backlog) 58 _in, _out = Queue(), Queue() 64 a, b = Queue(), Queue()
|
/external/chromium_org/testing/gtest/samples/ |
sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list. 44 class Queue; 46 // QueueNode is a node in a Queue, which consists of an element of 50 friend class Queue<E>; 56 // Gets the next node in the queue. 74 class Queue { 76 // Creates an empty queue. 77 Queue() : head_(NULL), last_(NULL), size_(0) {} 79 // D'tor. Clears the queue [all...] |
sample3_unittest.cc | 95 // A helper function for testing Queue::Map(). 96 void MapTester(const Queue<int> * q) { 97 // Creates a new queue, where each element is twice as big as the 99 const Queue<int> * const new_q = q->Map(Double); 101 // Verifies that the new queue has the same size as q. 114 Queue<int> q0_; 115 Queue<int> q1_; 116 Queue<int> q2_; 146 // Tests the Queue::Map() function.
|
/ndk/sources/third_party/googletest/googletest/samples/ |
sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list. 44 class Queue; 46 // QueueNode is a node in a Queue, which consists of an element of 50 friend class Queue<E>; 56 // Gets the next node in the queue. 74 class Queue { 76 // Creates an empty queue. 77 Queue() : head_(NULL), last_(NULL), size_(0) {} 79 // D'tor. Clears the queue [all...] |
sample3_unittest.cc | 95 // A helper function for testing Queue::Map(). 96 void MapTester(const Queue<int> * q) { 97 // Creates a new queue, where each element is twice as big as the 99 const Queue<int> * const new_q = q->Map(Double); 101 // Verifies that the new queue has the same size as q. 114 Queue<int> q0_; 115 Queue<int> q1_; 116 Queue<int> q2_; 146 // Tests the Queue::Map() function.
|
/libcore/luni/src/main/java/java/util/ |
Queue.java | 21 * specifically for use with capacity-restricted <tt>Queue</tt> 54 * Whatever the ordering used, the <em>head</em> of the queue is that 56 * {@link #poll()}. In a FIFO queue, all new elements are inserted at 57 * the <em> tail</em> of the queue. Other kinds of queues may use 58 * different placement rules. Every <tt>Queue</tt> implementation 70 * return the head of the queue. 71 * Exactly which element is removed from the queue is a 72 * function of the queue's ordering policy, which differs from 75 * queue is empty: the <tt>remove()</tt> method throws an exception, 79 * not remove, the head of the queue [all...] |
/external/openfst/src/include/fst/script/ |
shortest-path.h | 71 typedef AutoQueue<StateId> Queue; 72 Queue *queue = QueueConstructor<Queue, Arc, local 74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( 75 queue, ArcFilter(), opts.nshortest, opts.unique, 79 delete queue; 83 typedef FifoQueue<StateId> Queue; 84 Queue *queue = QueueConstructor<Queue, Arc local 96 Queue *queue = QueueConstructor<Queue, Arc, local 108 Queue *queue = QueueConstructor<Queue, Arc, local 120 Queue *queue = QueueConstructor<Queue, Arc, local 132 Queue *queue = QueueConstructor<Queue, Arc, local [all...] |
shortest-distance.h | 27 #include <fst/queue.h> // for QueueType 57 template<class Queue, class Arc, class ArcFilter> 60 static Queue *Construct(const Fst<Arc> &, 62 return new Queue(); 101 template<class Arc, class Queue> 110 Queue *queue = local 111 QueueConstructor<Queue, Arc, AnyArcFilter<Arc> >::Construct( 113 fst::ShortestDistanceOptions<Arc, Queue, AnyArcFilter<Arc> > sdopts( 114 queue, AnyArcFilter<Arc>(), opts.source, opts.delta) 120 Queue *queue = local 131 Queue *queue = local 142 Queue *queue = local [all...] |
/external/llvm/lib/CodeGen/ |
LatencyPriorityQueue.cpp | 1 //===---- LatencyPriorityQueue.cpp - A latency-oriented priority queue ----===// 84 Queue.push_back(SU); 112 // Since it is available, it must be in the priority queue. First remove it. 115 // Reinsert the node into the priority queue, which recomputes its 122 std::vector<SUnit *>::iterator Best = Queue.begin(); 123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), 124 E = Queue.end(); I != E; ++I) 128 if (Best != std::prev(Queue.end())) 129 std::swap(*Best, Queue.back()); 130 Queue.pop_back() [all...] |
/external/guava/guava/src/com/google/common/collect/ |
ForwardingQueue.java | 23 import java.util.Queue; 26 * A queue which forwards all its method calls to another queue. Subclasses 28 * queue as desired per the <a 47 implements Queue<E> { 52 @Override protected abstract Queue<E> delegate();
|
/libcore/luni/src/main/java/java/util/concurrent/ |
BlockingQueue.java | 10 import java.util.Queue; 17 * A {@link java.util.Queue} that additionally supports operations 18 * that wait for the queue to become non-empty when retrieving an 19 * element, and wait for space to become available in the queue when 78 * possible to remove an arbitrary element from a queue using 107 * private final BlockingQueue queue; 108 * Producer(BlockingQueue q) { queue = q; } 111 * while (true) { queue.put(produce()); } 118 * private final BlockingQueue queue; 119 * Consumer(BlockingQueue q) { queue = q; [all...] |