HomeSort by relevance Sort by last modified time
    Searched defs:Queue (Results 51 - 75 of 89) sorted by null

1 23 4

  /ndk/
ndk-gdb.py 36 from Queue import Queue, Empty
38 from queue import Queue, Empty # python 3.x
269 def async_stdout(out, queue, output_fn):
274 def async_stderr(out, queue, output_fn):
285 qo = Queue()
  /external/chromium/chrome/browser/extensions/
extension_host.cc 70 // Add a host to the queue for RenderView creation.
76 // Remove a host from the queue (in case it's being deleted).
78 Queue::iterator it = std::find(queue_.begin(), queue_.end(), host);
90 // Queue up a delayed task to process the next ExtensionHost in the queue.
100 // Create the RenderView for the next host in the queue.
113 typedef std::list<ExtensionHost*> Queue;
114 Queue queue_;
  /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/
test_msgutil.py 37 import Queue
    [all...]
  /external/clang/include/clang/AST/
RecursiveASTVisitor.h 425 SmallVector<EnqueueJob, 16> Queue;
426 Queue.push_back(S);
428 while (!Queue.empty()) {
429 EnqueueJob &job = Queue.back();
432 Queue.pop_back();
441 Queue.pop_back();
450 Queue.push_back(*job.StmtIt);
452 Queue.pop_back();
456 Queue.pop_back();
    [all...]
  /external/llvm/lib/CodeGen/
RegAllocGreedy.cpp 44 #include <queue>
82 std::priority_queue<std::pair<unsigned, unsigned> > Queue;
357 // Unassigned virtreg is probably in the priority queue.
366 // Register is assigned, put it back on the queue for reassignment.
394 // The queue holds (size, reg) pairs.
419 Queue.push(std::make_pair(Prio, ~Reg));
423 if (Queue.empty())
425 LiveInterval *LI = &LIS->getInterval(~Queue.top().second);
426 Queue.pop();
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 44 /// FastPriorityQueue - A degenerate priority queue that considers
48 SmallVector<SUnit *, 16> Queue;
50 bool empty() const { return Queue.empty(); }
53 Queue.push_back(U);
58 SUnit *V = Queue.back();
59 Queue.pop_back();
69 /// AvailableQueue - The priority queue to use for the available SUnits.
181 /// the Available queue.
532 // Add root to Available queue.
540 // While Available queue is not empty, grab the node with the highes
    [all...]
  /external/openfst/src/include/fst/
queue.h 0 // queue.h
39 // class Queue {
44 // Queue(...);
45 // // Returns the head of the queue
49 // // Removes the head of the queue
53 // // Does the queue contain no elements?
55 // // Remove all states from queue
59 // State queue types.
61 TRIVIAL_QUEUE = 0, // Single state queue
62 FIFO_QUEUE = 1, // First-in, first-out queue
    [all...]
  /external/webkit/Tools/Scripts/webkitpy/layout_tests/
run_webkit_tests_unittest.py 39 import Queue
  /external/clang/lib/Sema/
SemaAccess.cpp 285 SmallVector<const CXXRecordDecl*, 8> Queue; // actually a stack
313 Queue.push_back(RD);
316 if (Queue.empty()) break;
318 Derived = Queue.back();
319 Queue.pop_back();
    [all...]
SemaLookup.cpp 155 SmallVector<DeclContext*,4> queue; local
163 queue.push_back(NS);
167 if (queue.empty())
170 DC = queue.back();
171 queue.pop_back();
    [all...]
SemaDeclCXX.cpp     [all...]
  /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>
394 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/clang/lib/Format/
Format.cpp 28 #include <queue>
    [all...]
  /external/v8/tools/
test.py 44 from Queue import Queue, Empty
59 self.queue = Queue(len(cases))
61 self.queue.put_nowait(case)
109 test = self.queue.get_nowait()
    [all...]
  /frameworks/base/services/input/
InputDispatcher.h 604 // Generic queue implementation.
606 struct Queue {
610 inline Queue() : head(NULL), tail(NULL) {
811 // Queue of events that need to be published to the connection.
812 Queue<DispatchEntry> outboundQueue;
814 // Queue of events that have been published to the connection but that have not
816 Queue<DispatchEntry> waitQueue;
848 Queue<EventEntry> mInboundQueue;
849 Queue<CommandEntry> mCommandQueue;
    [all...]
  /external/clang/lib/AST/
ExprConstant.cpp     [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.core.jobs_3.5.1.R36x_v20100824.jar 
org.eclipse.equinox.util_1.0.200.v20100503.jar 
org.eclipse.core.databinding_1.3.100.I20100601-0800.jar 
org.eclipse.core.databinding.observable_1.3.0.I20100601-0800.jar 
org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar 
org.apache.jasper_5.5.17.v201004212143.jar 
  /prebuilts/tools/common/netbeans-visual/
org-openide-util.jar 
  /prebuilts/devtools/tools/lib/
jython-2.5.3.jar 
  /prebuilts/misc/common/jython/
jython.jar 

Completed in 2059 milliseconds

1 23 4