| /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/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.
|
| sample5_unittest.cc | 164 Queue<int> q0_;
165 Queue<int> q1_;
166 Queue<int> q2_;
|
| /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.
|
| sample5_unittest.cc | 164 Queue<int> q0_;
165 Queue<int> q1_;
166 Queue<int> q2_;
|
| /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...] |
| /external/guava/src/com/google/common/collect/ |
| ForwardingQueue.java | 21 import java.util.Queue;
24 * A queue which forwards all its method calls to another queue. Subclasses
26 * queue as desired per the <a
35 implements Queue<E> {
37 @Override protected abstract Queue<E> delegate();
|
| /libcore/luni/src/main/java/java/util/ |
| Queue.java | 23 * Generally, a queue orders its elements by means of first-in-first-out.
24 * However, a priority queue orders its elements according to a comparator
28 * A typical queue does not allow {@code null} to be inserted as its element,
32 * in the queue.
34 * {@code Queue} does not provide blocking queue methods, which would block
37 * blocking queue methods.
39 public interface Queue<E> extends Collection<E> {
42 * Inserts the specified element into the queue provided that the condition
48 * the specified element to insert into the queue
[all...] |
| Deque.java | 22 * ended queue"). Mostly a deque has no limit of its size.
24 * <p>Extending from Queue, a deque can be used as a Queue which behavior is
40 public interface Deque<E> extends Queue<E> {
|
| AbstractQueue.java | 21 * {@link Queue}. The provided implementations of {@code add, remove} and
30 Queue<E> {
40 * Adds an element to the queue.
43 * the element to be added to the queue.
46 * if the element is not allowed to be added to the queue.
60 * Adds all the elements of a collection to the queue. If the collection is
61 * the queue itself, then an IllegalArgumentException will be thrown. If
64 * in the queue. The result of the method is undefined if the collection is
68 * the collection to be added to the queue.
73 * If the collection to be added to the queue is the queu
[all...] |
| /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/srec/tools/thirdparty/OpenFst/fst/lib/ |
| shortest-distance.h | 27 #include "fst/lib/queue.h"
33 template <class Arc, class Queue, class ArcFilter>
37 Queue *state_queue; // Queue discipline used; owned by caller
42 ShortestDistanceOptions(Queue *q, ArcFilter filt, StateId src = kNoStateId,
54 template<class Arc, class Queue, class ArcFilter>
63 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts,
80 Queue *state_queue_;
93 template <class Arc, class Queue, class ArcFilter>
94 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance
[all...] |
| shortest-path.h | 26 #include "fst/lib/queue.h"
32 template <class Arc, class Queue, class ArcFilter>
34 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> {
42 ShortestPathOptions(Queue *q, ArcFilter filt, size_t n = 1, bool u = false,
44 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d),
53 // such as the queue discipline, the arc filter and delta.
60 template<class Arc, class Queue, class ArcFilter>
64 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
80 Queue *state_queue = opts.state_queue;
211 // strings, the queue discipline, the arc filter and the convergenc
[all...] |
| rmepsilon.h | 34 #include "fst/lib/queue.h"
40 template <class Arc, class Queue>
42 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
47 RmEpsilonOptions(Queue *q, float d = kDelta, bool c = true)
48 : ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> >(
55 template <class Arc, class Queue>
64 const RmEpsilonOptions<Arc, Queue> &opts)
119 ShortestDistanceState<Arc, Queue, EpsilonArcFilter<Arc> > sd_state_;
126 stack<StateId> eps_queue_; // Queue used to visit the epsilon-closure
136 template <class Arc, class Queue>
[all...] |
| /external/webkit/WebKitTools/pywebsocket/mod_pywebsocket/ |
| msgutil.py | 40 import Queue
162 self._queue = Queue.Queue()
192 except Queue.Empty:
224 self._queue = Queue.Queue()
|
| /external/guava/src/com/google/common/io/ |
| LineReader.java | 25 import java.util.Queue;
41 private final Queue<String> lines = new LinkedList<String>();
|
| /external/webkit/WebKitTools/pywebsocket/test/ |
| test_msgutil.py | 36 import Queue
115 onmessage_queue = Queue.Queue()
135 # Use a queue to check the bytes written by MessageSender.
138 send_queue = Queue.Queue()
|
| mock.py | 35 import Queue
112 self._queue = Queue.Queue()
|
| test_mock.py | 36 import Queue
75 def __init__(self, conn, queue):
77 self._queue = queue
86 queue = Queue.Queue()
87 reader = LineReader(conn, queue)
88 self.failUnless(queue.empty())
90 read = queue.get()
|
| /packages/providers/DownloadProvider/tests/src/com/android/providers/downloads/ |
| FakeSystemFacade.java | 14 import java.util.Queue;
25 Queue<Thread> mStartedThreads = new LinkedList<Thread>();
|
| /external/apache-http/src/org/apache/http/impl/conn/tsccm/ |
| RouteSpecificPool.java | 35 import java.util.Queue;
68 protected final Queue<WaitingThread> waitingThreads;
279 * Returns the next thread in the queue.
|
