| /external/sonivox/jet_tools/JetCreator/ |
| JetPreview.py | 141 # queue first segment and start playback
143 Queue(self.jet, self.queueSegs[index])
159 # if less than 2 segs queued - queue another one
161 Queue(self.jet, self.queueSegs[index])
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| partition.h | 25 #include "fst/lib/queue.h"
194 // partition, create new once and update the queue of active classes
196 template <class Queue>
197 void FinalizeSplit(Queue* L) {
|
| 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...] |
| /frameworks/base/core/java/android/view/accessibility/ |
| AccessibilityNodeInfoCache.java | 26 import java.util.Queue;
288 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>();
|
| AccessibilityInteractionClient.java | 38 import java.util.Queue;
736 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>();
|
| /packages/apps/Email/tests/src/com/android/email/activity/ |
| ContactStatusLoaderTest.java | 34 import java.util.Queue;
190 public final Queue<Cursor> mCursors = new LinkedBlockingQueue<Cursor>();
|
| /external/clang/lib/AST/ |
| CXXInheritance.cpp | 125 SmallVector<const CXXRecordDecl*, 8> Queue;
147 Queue.push_back(Base);
155 if (Queue.empty()) break;
156 Record = Queue.back(); // not actually a queue.
157 Queue.pop_back();
|
| /external/guava/guava/src/com/google/common/collect/ |
| Iterables.java | 39 import java.util.Queue;
[all...] |
| Queues.java | 23 import java.util.Queue;
34 * Static utility methods pertaining to {@link Queue}
72 * @param elements the elements that the queue should contain, in order
80 ConcurrentLinkedQueue<E> queue = new ConcurrentLinkedQueue<E>(); local
81 Iterables.addAll(queue, elements);
82 return queue;
101 * @param capacity the capacity of this queue
112 * @param elements the elements that the queue should contain, in order
119 LinkedBlockingQueue<E> queue = new LinkedBlockingQueue<E>(); local
120 Iterables.addAll(queue, elements)
148 PriorityBlockingQueue<E> queue = new PriorityBlockingQueue<E>(); local
174 PriorityQueue<E> queue = new PriorityQueue<E>(); local
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Iterables.java | 36 import java.util.Queue;
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGFast.cpp | 39 /// FastPriorityQueue - A degenerate priority queue that considers
43 SmallVector<SUnit *, 16> Queue;
45 bool empty() const { return Queue.empty(); }
48 Queue.push_back(U);
53 SUnit *V = Queue.back();
54 Queue.pop_back();
64 /// AvailableQueue - The priority queue to use for the available SUnits.
176 /// the Available queue.
527 // Add root to Available queue.
535 // While Available queue is not empty, grab the node with the highes
[all...] |
| ScheduleDAGRRList.cpp | 12 // queue of available nodes to schedule. One at a time, nodes are taken from
13 // the priority queue (thus in priority order), checked for legality to
116 /// AvailableQueue - The priority queue to use for the available SUnits.
375 // CapturePred and others may have left the node in the pending queue, avoid
548 /// so, add them to the available queue.
555 // If the available queue is empty, it is safe to reset MinAvailableCycle.
560 // so, add them to the available queue.
682 /// the Available queue.
[all...] |
| /frameworks/base/services/input/ |
| InputDispatcher.h | 600 // Generic queue implementation.
602 struct Queue {
606 inline Queue() : head(NULL), tail(NULL) {
806 // Queue of events that need to be published to the connection.
807 Queue<DispatchEntry> outboundQueue;
809 // Queue of events that have been published to the connection but that have not
811 Queue<DispatchEntry> waitQueue;
843 Queue<EventEntry> mInboundQueue;
844 Queue<CommandEntry> mCommandQueue;
[all...] |
| /cts/tests/tests/accessibilityservice/src/android/accessibilityservice/cts/ |
| AccessibilityWindowQueryTest.java | 38 import java.util.Queue;
103 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>();
|
| /external/jmonkeyengine/engine/src/blender/com/jme3/asset/ |
| BlenderKey.java | 55 import java.util.Queue;
700 protected void breadthFirstTraversal(SceneGraphVisitor visitor, Queue<Spatial> queue) {}
|
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/ |
| Geometry.java | 48 import java.util.Queue;
464 protected void breadthFirstTraversal(SceneGraphVisitor visitor, Queue<Spatial> queue) {
|
| Node.java | 46 import java.util.Queue;
639 protected void breadthFirstTraversal(SceneGraphVisitor visitor, Queue<Spatial> queue) {
640 queue.addAll(children);
|
| /frameworks/base/core/java/android/speech/ |
| SpeechRecognizer.java | 36 import java.util.Queue;
141 * Temporary queue, saving the messages until the connection will be established, afterwards,
144 private final Queue<Message> mPendingTasks = new LinkedList<Message>();
|
| /frameworks/base/core/java/android/view/textservice/ |
| SpellCheckerSession.java | 36 import java.util.Queue;
229 private final Queue<SpellCheckerParams> mPendingTasks =
403 // all close tasks from the queue
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| CollectionsTest.java | 37 import java.util.Queue;
[all...] |
| /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/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 424 SmallVector<EnqueueJob, 16> Queue;
425 Queue.push_back(S);
427 while (!Queue.empty()) {
428 EnqueueJob &job = Queue.back();
431 Queue.pop_back();
444 Queue.push_back(*job.StmtIt);
446 Queue.pop_back();
450 Queue.pop_back();
[all...] |
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTreeImpl.java | 34 import java.util.Queue;
270 Queue<RadixTreeNode<T>> queue = new LinkedList<RadixTreeNode<T>>(); local
272 queue.addAll(parent.getChildern());
274 while (!queue.isEmpty()) {
275 RadixTreeNode<T> node = queue.remove();
284 queue.addAll(node.getChildern());
|
| /frameworks/base/core/tests/coretests/src/android/accessibilityservice/ |
| InterrogationActivityTest.java | 36 import java.util.Queue;
201 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>();
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 14 import java.util.Queue;
21 * An unbounded thread-safe {@linkplain Queue queue} based on linked nodes.
22 * This queue orders elements FIFO (first-in-first-out).
23 * The <em>head</em> of the queue is that element that has been on the
24 * queue the longest time.
25 * The <em>tail</em> of the queue is that element that has been on the
26 * queue the shortest time. New elements
27 * are inserted at the tail of the queue, and the queue retrieva
[all...] |
