Searched refs:Queue (Results 1 - 25 of 145) sorted by relevance

123456

/external/dropbear/
H A Dqueue.h35 struct Queue { struct
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);
H A Dqueue.c29 void initqueue(struct Queue* queue) {
36 int isempty(struct Queue* queue) {
41 void* dequeue(struct Queue* queue) {
63 void *examine(struct Queue* queue) {
69 void enqueue(struct Queue* queue, void* item) {
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DTestQueueGenerator.java19 import java.util.Queue;
30 Queue<E> create(Object... elements);
H A DTestStringQueueGenerator.java22 import java.util.Queue;
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/
H A DAbstractQueueTester.java21 import java.util.Queue;
31 protected final Queue<E> getQueue() {
32 return (Queue<E>) collection;
/external/webkit/Tools/QueueStatusServer/model/
H A Dqueues_unittest.py32 from model.queues import Queue namespace
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)
55 self.assertEquals(Queue(queue_name).display_name(), short_name)
60 self._assert_display_name("commit-queue", "Commit Queue")
61 self._assert_display_name("style-queue", "Style Queue")
64 self.assertEquals(Queue(queue_nam
[all...]
H A Dqueuepropertymixin.py33 from model.queues import Queue namespace
34 return Queue.queue_with_name(self.queue_name)
H A Dqueuepropertymixin_unittest.py32 from model.queues import Queue namespace
43 mac_ews = Queue("mac-ews")
/external/chromium/testing/gtest/samples/
H A Dsample3-inl.h40 // 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>;
74 class Queue { class
78 Queue() : head_(NULL), last_(NULL), size_(0) {} function in class:Queue
81 ~Queue() { Clear(); }
154 Queue* Map(F function) const {
155 Queue* new_queue = new Queue();
[all...]
H A Dsample3_unittest.cc95 // A helper function for testing Queue::Map().
96 void MapTester(const Queue<int> * q) {
99 const Queue<int> * const new_q = q->Map(Double);
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
146 // Tests the Queue::Map() function.
/external/gtest/samples/
H A Dsample3-inl.h40 // 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>;
74 class Queue { class
78 Queue() : head_(NULL), last_(NULL), size_(0) {} function in class:Queue
81 ~Queue() { Clear(); }
154 Queue* Map(F function) const {
155 Queue* new_queue = new Queue();
[all...]
H A Dsample3_unittest.cc95 // A helper function for testing Queue::Map().
96 void MapTester(const Queue<int> * q) {
99 const Queue<int> * const new_q = q->Map(Double);
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/
H A Dsample3-inl.h40 // 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>;
74 class Queue { class
78 Queue() : head_(NULL), last_(NULL), size_(0) {} function in class:Queue
81 ~Queue() { Clear(); }
154 Queue* Map(F function) const {
155 Queue* new_queue = new Queue();
[all...]
H A Dsample3_unittest.cc95 // A helper function for testing Queue::Map().
96 void MapTester(const Queue<int> * q) {
99 const Queue<int> * const new_q = q->Map(Double);
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
146 // Tests the Queue::Map() function.
/external/protobuf/gtest/samples/
H A Dsample3-inl.h40 // 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>;
74 class Queue { class
78 Queue() : head_(NULL), last_(NULL), size_(0) {} function in class:Queue
81 ~Queue() { Clear(); }
154 Queue * Map(F function) const {
155 Queue * new_queue = new Queue();
[all...]
H A Dsample3_unittest.cc95 // A helper function for testing Queue::Map().
96 void MapTester(const Queue<int> * q) {
99 const Queue<int> * const new_q = q->Map(Double);
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
146 // Tests the Queue::Map() function.
/external/openfst/src/include/fst/script/
H A Dshortest-path.h71 typedef AutoQueue<StateId> Queue; typedef
72 Queue *queue = QueueConstructor<Queue, Arc,
74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts(
83 typedef FifoQueue<StateId> Queue; typedef
84 Queue *queue = QueueConstructor<Queue, Arc,
86 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts(
95 typedef LifoQueue<StateId> Queue; typedef
96 Queue *queu
107 typedef NaturalShortestFirstQueue<StateId, Weight> Queue; typedef
119 typedef StateOrderQueue<StateId> Queue; typedef
131 typedef TopOrderQueue<StateId> Queue; typedef
[all...]
/external/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp83 Queue.push_back(SU);
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();
134 assert(!Queue.empty() && "Queue is empty!");
135 std::vector<SUnit *>::iterator I = std::find(Queue
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DForwardingQueue.java23 import java.util.Queue;
47 implements Queue<E> {
52 @Override protected abstract Queue<E> delegate();
/external/webkit/Tools/QueueStatusServer/handlers/
H A Dstatusbubble_unittest.py33 from model.queues import Queue namespace
50 queue = Queue("mac-ews")
H A Ddashboard.py35 from model.queues import Queue namespace
40 _ordered_queues = Queue.all()
/external/libppp/src/
H A Dlink.h49 struct mqueue Queue[2]; /* Our output queue of mbufs */ member in struct:link
61 #define LINK_QUEUES(link) (sizeof (link)->Queue / sizeof (link)->Queue[0])
62 #define LINK_HIGHQ(link) ((link)->Queue + LINK_QUEUES(link) - 1)
/external/guava/guava-tests/test/com/google/common/collect/
H A DForwardingQueueTest.java31 import java.util.Queue;
43 private final Queue<T> backingQueue;
45 StandardImplForwardingQueue(Queue<T> backingQueue) {
49 @Override protected Queue<T> delegate() {
106 private Queue<String> forward;
107 private Queue<String> queue;
116 @Override protected Queue<String> create(String[] elements) {
137 queue = createProxyInstance(Queue.class);
139 @Override protected Queue<String> delegate() {
/external/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h147 std::vector<SUnit*> Queue; member in class:llvm::ReadyQueue
159 bool empty() const { return Queue.empty(); }
161 void clear() { Queue.clear(); }
163 unsigned size() const { return Queue.size(); }
167 iterator begin() { return Queue.begin(); }
169 iterator end() { return Queue.end(); }
171 ArrayRef<SUnit*> elements() { return Queue; }
174 return std::find(Queue.begin(), Queue.end(), SU);
178 Queue
[all...]
/external/chromium-trace/trace-viewer/third_party/pywebsocket/src/mod_pywebsocket/
H A Dmsgutil.py41 import Queue namespace
127 self._queue = Queue.Queue()
160 except Queue.Empty:
193 self._queue = Queue.Queue()

Completed in 386 milliseconds

123456