| /external/webkit/Tools/QueueStatusServer/model/ |
| 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
|
| 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...] |
| attachment.py | 33 from model.queues import Queue
90 def position_in_queue(self, queue):
91 return self._queue_positions().get(queue.name())
93 def status_for_queue(self, queue):
95 queue_summary = self.summary().get(queue.name_with_underscores())
111 all_work_items = WorkItems.all().fetch(limit=len(Queue.all()))
112 return dict([(items.queue.name(), items.display_position_for_attachment(self.id)) for items in all_work_items])
124 for queue in Queue.all():
125 summary[queue.name_with_underscores()] = Non
[all...] |
| queues.py | 36 class Queue(object):
40 "commit-queue",
41 "style-queue",
59 return Queue(queue_name)
63 return [Queue(name) for name in cls._all_queue_names]
67 return [queue for queue in cls.all() if queue.is_ews()]
87 short_name = short_name.replace("-queue", "")
106 # Note: The style-queue is just like an EWS in that it has an EW
[all...] |
| /development/tools/axl/ |
| chewie.py | 16 class Queue:
18 self.queue = []
21 self.queue.append([url, time])
24 for x in range(len(self.queue)):
25 rec = self.queue[x]
27 del self.queue[x]
30 ## pull out request lag -- queue to start to done
56 queued = Queue()
|
| /external/webkit/Tools/QueueStatusServer/handlers/ |
| nextpatch.py | 34 from model.queues import Queue
41 queue = Queue.queue_with_name(queue_name)
42 if not queue:
45 # FIXME: Patch assignment should probably move into Queue.
46 patch_id = db.run_in_transaction(self._assign_patch, queue.active_work_items().key(), queue.work_items().item_ids)
|
| queuestatus_unittest.py | 32 from model.queues import Queue
|
| releasepatch.py | 34 from model.queues import Queue
43 # FIXME: This queue lookup should be shared between handlers.
44 queue = Queue.queue_with_name(queue_name)
45 if not queue:
51 last_status = attachment.status_for_queue(queue)
56 # Only remove it from the queue if the last message is not a retry request.
57 # Allow removing it from the queue even if there is no last_status for easier testing.
59 queue.work_items().remove_work_item(attachment_id)
62 queue.active_work_items().expire_item(attachment_id
[all...] |
| statusbubble.py | 36 from model.queues import Queue
40 _queues_to_display = [queue for queue in Queue.all() if queue.is_ews()]
42 def _build_bubble(self, queue, attachment):
43 queue_status = attachment.status_for_queue(queue)
45 "name": queue.short_name().lower(),
47 "queue_position": attachment.position_in_queue(queue),
55 bubbles = [self._build_bubble(queue, attachment) for queue in self._queues_to_display
[all...] |
| statusbubble_unittest.py | 33 from model.queues import Queue
40 def status_for_queue(self, queue):
43 def position_in_queue(self, queue):
50 queue = Queue("mac-ews")
52 bubble_dict = bubble._build_bubble(queue, attachment)
|
| dashboard.py | 35 from model.queues import Queue
40 _ordered_queues = Queue.all()
41 _header_names = [queue.short_name() for queue in _ordered_queues]
43 def _build_bubble(self, attachment, queue):
44 queue_status = attachment.status_for_queue(queue)
55 "bubbles": [self._build_bubble(attachment, queue) for queue in self._ordered_queues],
|
| queuestatus.py | 35 from model.queues import Queue
40 def _rows_for_work_items(self, queue):
41 queued_items = queue.work_items()
42 active_items = queue.active_work_items()
60 def _fetch_statuses(self, queue, bot_id):
62 statuses.filter("queue_name =", queue.name())
67 def _fetch_last_message_matching(self, queue, bot_id, message):
69 statuses.filter("queue_name =", queue.name())
75 def _fetch_trailing_days_pass_count(self, queue, bot_id, days):
77 statuses.filter("queue_name =", queue.name()
[all...] |
| submittoews.py | 34 from model.queues import Queue
41 def _should_add_to_ews_queue(self, queue, attachment):
42 # This assert() is here to make sure we're not submitting to the commit-queue.
43 # The commit-queue clients check each patch anyway, but there is not sense
44 # in adding things to the commit-queue when they won't be processed by it.
45 assert(queue.is_ews())
46 latest_status = attachment.status_for_queue(queue)
50 # This allows us to restart the EWS feeder queue, without all r? patches
57 for queue in Queue.all_ews(): # all_ews() currently includes the style-queu
[all...] |
| updateworkitems.py | 33 from model.queues import Queue
50 queue = Queue.queue_with_name(queue_name)
51 if not queue:
52 self.response.out.write("\"%s\" is not in queues %s" % (queue_name, Queue.all()))
56 work_items = queue.work_items()
|
| recentstatus.py | 34 from model.queues import Queue
41 def __init__(self, queue):
42 self._queue = queue
43 self._work_items = queue.work_items()
44 self._last_status = QueueStatus.all().filter("queue_name =", queue.name()).order("-date").get()
46 # FIXME: name and display_name should be replaced by a .queue() accessor.
92 "queues": [QueueBubble(queue) for queue in Queue.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;
|
| /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...] |
| /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/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...] |
| /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...] |
| /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...] |
| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 1 //===---- LatencyPriorityQueue.h - A latency-oriented priority queue ------===//
24 /// Sorting functions for the Available queue.
37 /// Queue, the number of nodes that the node is the sole unscheduled
42 /// Queue - The queue.
43 std::vector<SUnit*> Queue;
78 bool empty() const { return Queue.empty(); }
|
| /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/mod_pywebsocket/ |
| msgutil.py | 41 import Queue
127 self._queue = Queue.Queue()
160 except Queue.Empty:
193 self._queue = Queue.Queue()
|
| /external/libppp/src/ |
| ipv6cp.h | 56 struct mqueue Queue[2]; /* Output packet queues */
60 #define IPV6CP_QUEUES(ipv6cp) (sizeof ipv6cp->Queue / sizeof ipv6cp->Queue[0])
|
