| /hardware/qcom/media/mm-video/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/dropbear/ |
| queue.h | 35 struct Queue {
43 void initqueue(struct Queue* queue);
44 int isempty(struct Queue* queue);
45 void* dequeue(struct Queue* queue);
46 void *examine(struct Queue* queue);
47 void enqueue(struct Queue* queue, void* item)
[all...] |
| queue.c | 27 #include "queue.h"
29 void initqueue(struct Queue* queue) {
31 queue->head = NULL;
32 queue->tail = NULL;
33 queue->count = 0;
36 int isempty(struct Queue* queue) {
38 return (queue->head == NULL);
41 void* dequeue(struct Queue* queue)
[all...] |
| /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/webkit/Tools/QueueStatusServer/model/ |
| queues_unittest.py | 32 from model.queues import Queue
37 mac_ews = Queue("mac-ews")
41 self.assertEqual(Queue.queue_with_name("bogus"), None)
42 self.assertEqual(Queue.queue_with_name("mac-ews").name(), "mac-ews")
43 self.assertRaises(AssertionError, Queue, ("bogus"))
46 self.assertEquals(Queue(queue_name).short_name(), short_name)
51 self._assert_short_name("commit-queue", "Commit")
52 self._assert_short_name("style-queue", "Style")
55 self.assertEquals(Queue(queue_name).display_name(), short_name)
60 self._assert_display_name("commit-queue", "Commit Queue"
[all...] |
| queuepropertymixin.py | 33 from model.queues import Queue
34 return Queue.queue_with_name(self.queue_name)
36 def _queue_setter(self, queue):
37 self.queue_name = queue.name() if queue else None
39 queue = property(_queue_getter, _queue_setter) variable in class:QueuePropertyMixin
|
| queuepropertymixin_unittest.py | 32 from model.queues import Queue
43 mac_ews = Queue("mac-ews")
44 test_object.queue = mac_ews
45 self.assertEquals(test_object.queue.name(), "mac-ews")
47 test_object.queue = None
|
| /external/chromium/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 {
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.
|
| /external/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.
|
| /external/libvpx/libvpx/third_party/googletest/src/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.
|
| /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/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...] |
| /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;
|
| /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...] |
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 1 //===---- LatencyPriorityQueue.cpp - A latency-oriented priority queue ----===//
83 Queue.push_back(SU);
111 // Since it is available, it must be in the priority queue. First remove it.
114 // Reinsert the node into the priority queue, which recomputes its
121 std::vector<SUnit *>::iterator Best = Queue.begin();
122 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()),
123 E = Queue.end(); I != E; ++I)
127 if (Best != prior(Queue.end()))
128 std::swap(*Best, Queue.back());
129 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...] |
| /external/libppp/src/ |
| link.h | 49 struct mqueue Queue[2]; /* Our output queue of mbufs */
61 #define LINK_QUEUES(link) (sizeof (link)->Queue / sizeof (link)->Queue[0])
62 #define LINK_HIGHQ(link) ((link)->Queue + LINK_QUEUES(link) - 1)
|
