| /external/webkit/Tools/QueueStatusServer/handlers/ |
| 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/webkit/Tools/QueueStatusServer/model/ |
| 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...] |
| /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/ |
| mock.py | 35 import Queue
116 self._queue = Queue.Queue()
|
| test_mock.py | 36 import Queue
87 queue.
90 def __init__(self, conn, queue):
92 self._queue = queue
103 queue = Queue.Queue()
104 reader = LineReader(conn, queue)
105 self.failUnless(queue.empty())
107 read = queue.get(
[all...] |
| mux_client_for_testing.py | 43 import Queue
367 self.queue = Queue.Queue()
464 self._logical_channels[channel_id].queue.put(inner_frame)
686 inner_frame = self._logical_channels[channel_id].queue.get(
688 except Queue.Empty, e:
720 inner_frame = self._logical_channels[channel_id].queue.get(
722 except Queue.Empty, e:
|
| test_mux.py | 35 import Queue
|
| /external/libppp/src/ |
| link.h | 49 struct mqueue Queue[2]; /* Our output queue of mbufs */
61 #define LINK_QUEUES(link) (sizeof (link)->Queue / sizeof (link)->Queue[0])
62 #define LINK_HIGHQ(link) ((link)->Queue + LINK_QUEUES(link) - 1)
|
| ipcp.h | 100 struct mqueue Queue[3]; /* Output packet queues */
104 #define IPCP_QUEUES(ipcp) (sizeof ipcp->Queue / sizeof ipcp->Queue[0])
|
| /external/llvm/include/llvm/CodeGen/ |
| 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(); }
|
| MachineScheduler.h | 147 std::vector<SUnit*> Queue;
156 // SU is in this queue if it's NodeQueueID is a superset of this ID.
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)
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocBasic.cpp | 39 #include <queue>
68 CompSpillWeight> Queue;
92 Queue.push(LI);
96 if (Queue.empty())
98 LiveInterval *LI = Queue.top();
99 Queue.pop();
|
| /external/openfst/src/include/fst/script/ |
| shortest-path.h | 71 typedef AutoQueue<StateId> Queue;
72 Queue *queue = QueueConstructor<Queue, Arc, local
74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts(
75 queue, ArcFilter(), opts.nshortest, opts.unique,
79 delete queue;
83 typedef FifoQueue<StateId> Queue;
84 Queue *queue = QueueConstructor<Queue, Arc local
96 Queue *queue = QueueConstructor<Queue, Arc, local
108 Queue *queue = QueueConstructor<Queue, Arc, local
120 Queue *queue = QueueConstructor<Queue, Arc, local
132 Queue *queue = QueueConstructor<Queue, Arc, local
[all...] |
| /external/webkit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| message_broker2.py | 37 queues themselves are provided by the caller, as the queue's implementation
63 import Queue
102 Queue interface (put()/get()).
120 queue = self._get_queue_for_topic(topic_name)
121 queue.put(_Message.dumps(message))
135 queue = self._get_queue_for_topic(topic_name)
138 s = queue.get(block, delay_secs)
139 except Queue.Empty:
|
| manager_worker_broker.py | 49 import Queue
104 queue_class = Queue.Queue
107 queue_class = Queue.Queue
110 queue_class = multiprocessing.Queue
|
| manager_worker_broker_unittest.py | 30 import Queue
193 starting_queue = self.queue()
194 stopping_queue = self.queue()
244 def queue(self): member in class:InlineBrokerTests.MultiProcessBrokerTests
245 return multiprocessing.Queue()
253 def queue(self): member in class:ThreadedBrokerTests
254 return Queue.Queue()
|
| test_runner.py | 44 import Queue
233 self._result_queue = Queue.Queue()
730 except Queue.Empty:
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| pdtscript.h | 221 FSTERROR() << "Unknown queue type: " << opts.queue_type;
223 typedef FifoQueue<StateId> Queue;
224 fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,
230 typedef LifoQueue<StateId> Queue;
231 fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,
237 typedef StateOrderQueue<StateId> Queue;
238 fst::PdtShortestPathOptions<Arc, Queue> spopts(opts.keep_parentheses,
|
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 212 // encounter a module with no incoming edges, push it into the queue
213 // to seed the queue.
214 SmallVector<ModuleFile *, 4> Queue;
215 Queue.reserve(N);
223 Queue.push_back(*M);
230 while (QueueStart < Queue.size()) {
231 ModuleFile *CurrentModule = Queue[QueueStart++];
243 // queue to be visited.
246 Queue.push_back(*M);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 72 std::deque<WorkListUnit> Queue;
75 return !Queue.empty();
79 Queue.push_back(U);
83 WorkListUnit U = Queue.front();
84 Queue.pop_front();
90 I = Queue.begin(), E = Queue.end(); I != E; ++I) {
109 std::deque<WorkListUnit> Queue;
113 return !Queue.empty() || !Stack.empty();
118 Queue.push_front(U)
[all...] |
| /frameworks/base/tests/touchlag/ |
| touchlag.cpp | 189 struct Queue {
195 Queue() : index(0) { }
251 Queue queue; local
277 queue.push(x, y);
278 queue.get(lag, &lag_x, &lag_y);
|
| /external/clang/lib/AST/ |
| CXXInheritance.cpp | 139 SmallVector<const CXXRecordDecl*, 8> Queue;
163 Queue.push_back(Base);
171 if (Queue.empty()) break;
172 Record = Queue.back(); // not actually a queue.
173 Queue.pop_back();
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 36 /// A priority queue, implemented as a heap.
135 /// A type which sorts a priority queue by the number of unprocessed
149 /// A queue of unified blocks to process.
150 PriorityQueue<BlockPair, QueueSorter, 20> Queue;
169 Queue.insert(BlockPair(L, R));
186 while (!Queue.empty()) {
187 BlockPair Pair = Queue.remove_min();
459 Engine(Engine), Queue(QueueSorter(*this_())) {}
655 SmallVector<std::pair<Function*,Function*>, 20> Queue;
662 Queue.push_back(std::make_pair(LFn, RFn))
[all...] |
| /external/sonivox/jet_tools/JetCreator/ |
| JetUtils.py | 99 def Queue (jet, queueSeg):
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| queue.h | 0 // queue.h
35 // class Queue {
40 // Queue(...);
41 // // Returns the head of the queue
45 // // Removes the head of the queue
49 // // Does the queue contain no elements?
51 // // Remove all states from queue
55 // State queue types.
57 TRIVIAL_QUEUE = 0, // Single state queue
58 FIFO_QUEUE = 1, // First-in, first-out queue
[all...] |
