| /external/webkit/Tools/QueueStatusServer/handlers/ |
| 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_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)
|
| 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()
|
| 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],
|
| 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...] |
| 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...] |
| /external/chromium/testing/gtest/samples/ |
| sample5_unittest.cc | 164 Queue<int> q0_;
165 Queue<int> q1_;
166 Queue<int> q2_;
|
| /external/gtest/samples/ |
| sample5_unittest.cc | 164 Queue<int> q0_;
165 Queue<int> q1_;
166 Queue<int> q2_;
|
| /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])
|
| ipcp.h | 100 struct mqueue Queue[3]; /* Output packet queues */
104 #define IPCP_QUEUES(ipcp) (sizeof ipcp->Queue / sizeof ipcp->Queue[0])
|
| link.c | 97 struct mqueue *queue, *highest; local
102 for (queue = l->Queue; queue < highest; queue++)
103 while (queue->len)
104 m_enqueue(highest, m_dequeue(queue));
110 struct mqueue *queue, *highest; local
113 for (queue = l->Queue; queue <= highest; queue++
153 struct mqueue *queue, *highest; local
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.h | 82 std::vector<SUnit*> Queue;
91 // SU is in this queue if it's NodeQueueID is a superset of this ID.
94 bool empty() const { return Queue.empty(); }
96 unsigned size() const { return Queue.size(); }
100 iterator begin() { return Queue.begin(); }
102 iterator end() { return Queue.end(); }
105 return std::find(Queue.begin(), Queue.end(), SU);
109 Queue.push_back(SU);
115 *I = Queue.back()
[all...] |
| /external/protobuf/gtest/samples/ |
| sample5_unittest.cc | 164 Queue<int> q0_;
165 Queue<int> q1_;
166 Queue<int> q2_;
|
| /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...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestsForQueuesInJavaUtil.java | 30 import java.util.Queue;
37 * Generates a test suite covering the {@link Queue} implementations in the
81 @Override public Queue<String> create(String[] elements) {
99 @Override public Queue<String> create(String[] elements) {
116 @Override public Queue<String> create(String[] elements) {
133 @Override public Queue<String> create(String[] elements) {
155 @Override public Queue<String> create(String[] elements) {
171 @Override public Queue<String> create(String[] elements) {
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| shortest-path.h | 40 template <class Arc, class Queue>
364 // algorithm that removes a state s from a queue (defined by a
365 // user-provided queue type) and relaxes the destination states of
379 template<class Arc, class Queue>
395 const PdtShortestPathOptions<Arc, Queue> &opts)
471 Queue *state_queue_; // current state queue
485 template<class Arc, class Queue>
486 void PdtShortestPath<Arc, Queue>::Init(MutableFst<Arc> *ofst) {
526 template<class Arc, class Queue>
[all...] |
| /external/webkit/Tools/QueueStatusServer/model/ |
| 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...] |
| /libcore/luni/src/main/java/java/util/ |
| AbstractQueue.java | 14 * This class provides skeletal implementations of some {@link Queue}
23 * <p>A <tt>Queue</tt> implementation that extends this class must
24 * minimally define a method {@link Queue#offer} which does not permit
26 * Queue#peek}, {@link Queue#poll}, {@link Collection#size}, and
37 implements Queue<E> {
46 * Inserts the specified element into this queue if it is possible to do so
59 * prevents it from being added to this queue
61 * this queue does not permit null elements
63 * prevents it from being added to this queue
[all...] |
| /external/openfst/src/include/fst/ |
| shortest-distance.h | 30 #include <fst/queue.h>
37 template <class Arc, class Queue, class ArcFilter>
41 Queue *state_queue; // Queue discipline used; owned by caller
51 // queue discipline is shortest-first and all the
55 ShortestDistanceOptions(Queue *q, ArcFilter filt, StateId src = kNoStateId,
70 template<class Arc, class Queue, class ArcFilter>
79 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts,
97 Queue *state_queue_;
114 template <class Arc, class Queue, class ArcFilter
[all...] |
| rmepsilon.h | 41 #include <fst/queue.h>
48 template <class Arc, class Queue>
50 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
59 explicit RmEpsilonOptions(Queue *q, float d = kDelta, bool c = true,
62 : ShortestDistanceOptions< Arc, Queue, EpsilonArcFilter<Arc> >(
70 template <class Arc, class Queue>
79 const RmEpsilonOptions<Arc, Queue> &opts)
137 ShortestDistanceState<Arc, Queue, EpsilonArcFilter<Arc> > sd_state_;
144 stack<StateId> eps_queue_; // Queue used to visit the epsilon-closure
154 template <class Arc, class Queue>
[all...] |
| /external/guava/guava/src/com/google/common/io/ |
| LineReader.java | 26 import java.util.Queue;
43 private final Queue<String> lines = new LinkedList<String>();
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| ExecutionList.java | 22 import java.util.Queue;
52 private final Queue<RunnableExecutorPair> runnables = Lists.newLinkedList();
|
| /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(); }
|
| /packages/providers/DownloadProvider/tests/src/com/android/providers/downloads/ |
| FakeSystemFacade.java | 11 import java.util.Queue;
21 Queue<Thread> mStartedThreads = new LinkedList<Thread>();
|
| /frameworks/support/volley/src/com/android/volley/ |
| RequestQueue.java | 26 import java.util.Queue;
32 * A request dispatch queue with a thread pool of dispatchers.
54 private final Map<String, Queue<Request>> mWaitingRequests =
55 new HashMap<String, Queue<Request>>();
59 * will be in this set if it is waiting in any queue or currently being processed by
64 /** The cache triage queue. */
68 /** The queue of requests that are actually going out to the network. */
129 * Starts the dispatchers in this queue.
176 * Cancels all requests in this queue for which the given filter applies.
190 * Cancels all requests in this queue with the given tag. Tag must be non-nul
[all...] |
