| /external/webkit/Tools/QueueStatusServer/handlers/ |
| 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...] |
| queuestatus_unittest.py | 32 from model.queues import Queue
|
| 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()],
|
| /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/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...] |
| Deque.java | 16 * both ends. The name <i>deque</i> is short for "double ended queue"
72 * <p>This interface extends the {@link Queue} interface. When a deque is
73 * used as a queue, FIFO (First-In-First-Out) behavior results. Elements are
75 * inherited from the <tt>Queue</tt> interface are precisely equivalent to
81 * <td ALIGN=CENTER> <b><tt>Queue</tt> Method</b></td>
85 * <td>{@link java.util.Queue#add add(e)}</td>
89 * <td>{@link java.util.Queue#offer offer(e)}</td>
93 * <td>{@link java.util.Queue#remove remove()}</td>
97 * <td>{@link java.util.Queue#poll poll()}</td>
101 * <td>{@link java.util.Queue#element element()}</td
[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(); }
|
| ResourcePriorityQueue.h | 1 //===----- ResourcePriorityQueue.h - A DFA-oriented priority queue -------===//
30 /// Sorting functions for the Available queue.
43 /// Queue, the number of nodes that the node is the sole unscheduled
48 /// Queue - The queue.
49 std::vector<SUnit*> Queue;
119 bool empty() const { return Queue.empty(); }
|
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 110 // encounter a module with no incoming edges, push it into the queue
111 // to seed the queue.
112 SmallVector<ModuleFile *, 4> Queue;
113 Queue.reserve(N);
119 Queue.push_back(*M);
124 while (QueueStart < Queue.size()) {
125 ModuleFile *CurrentModule = Queue[QueueStart++];
165 // queue to be visited.
168 Queue.push_back(*M);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 70 std::deque<WorkListUnit> Queue;
73 return !Queue.empty();
77 Queue.push_front(U);
81 WorkListUnit U = Queue.front();
82 Queue.pop_front();
88 I = Queue.begin(), E = Queue.end(); I != E; ++I) {
107 std::deque<WorkListUnit> Queue;
111 return !Queue.empty() || !Stack.empty();
116 Queue.push_front(U)
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 1 //===- ResourcePriorityQueue.cpp - A DFA-oriented priority queue -*- C++ -*-==//
242 Queue.push_back(SU);
589 // Since it is available, it must be in the priority queue. First remove it.
592 // Reinsert the node into the priority queue, which recomputes its
604 std::vector<SUnit *>::iterator Best = Queue.begin();
607 for (std::vector<SUnit *>::iterator I = Queue.begin(),
608 E = Queue.end(); I != E; ++I) {
620 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()),
621 E = Queue.end(); I != E; ++I)
627 if (Best != prior(Queue.end())
[all...] |
