| /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/clang/lib/Analysis/ |
| UninitializedValues.cpp | 234 // a proper queue when we pop off the end of the worklist.
495 llvm::SmallVector<const CFGBlock*, 32> Queue;
497 Queue.push_back(block);
499 // This has the dual purpose of ensuring we never add it to the queue, and
502 while (!Queue.empty()) {
503 const CFGBlock *B = Queue.back();
504 Queue.pop_back();
526 Queue.push_back(Pred);
|
| /external/libppp/src/ |
| ipv6cp.c | 297 memset(ipv6cp->Queue, '\0', sizeof ipv6cp->Queue);
414 for (q = ipv6cp->Queue; q < ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp); q++)
424 struct mqueue *queue; local
441 queue = ipv6cp->Queue + IPV6CP_QUEUES(ipv6cp) - 1;
443 if (queue->top) {
444 bp = m_dequeue(queue);
458 } while (queue-- != ipv6cp->Queue)
[all...] |
| ipcp.c | 490 memset(ipcp->Queue, '\0', sizeof ipcp->Queue);
1440 struct mqueue *queue; local
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| CollectionsTest.java | 37 import java.util.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/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/ |
| 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:
|
| /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/llvm/lib/CodeGen/SelectionDAG/ |
| 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.
376 // CapturePred and others may have left the node in the pending queue, avoid
549 /// so, add them to the available queue.
556 // If the available queue is empty, it is safe to reset MinAvailableCycle.
561 // so, add them to the available queue.
685 /// the Available queue.
[all...] |
| /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...] |
| minimize.h | 23 #include <queue>
35 #include "fst/lib/queue.h"
115 template <class A, class Queue>
213 // allocate arc iterator queue
220 // Prep priority queue. Open arc iterator for each state in C, and
221 // insert into priority queue.
229 // Now pop arc iterator from queue, split entering equivalence class
230 // re-insert updated iterator into queue.
278 Queue L_;
283 // Priority queue of open arc iterators for all states in the 'splitter
[all...] |
| /cts/tests/tests/accessibilityservice/src/android/accessibilityservice/cts/ |
| AccessibilityWindowQueryTest.java | 38 import java.util.Queue;
103 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>();
|
| /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/java/android/view/accessibility/ |
| AccessibilityInteractionClient.java | 38 import java.util.Queue;
736 Queue<AccessibilityNodeInfo> fringe = new LinkedList<AccessibilityNodeInfo>();
|
| /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...] |
| /external/libvpx/examples/includes/geshi/geshi/ |
| ruby.php | 97 'Process::Status', 'Process::Sys', 'Process::UID', 'Queue',
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MultimapsTest.java | 48 import java.util.Queue;
545 private static class QueueSupplier extends CountingSupplier<Queue<Integer>> {
546 @Override public Queue<Integer> getImpl() {
554 CountingSupplier<Queue<Integer>> factory = new QueueSupplier();
578 CountingSupplier<Queue<Integer>> factory = new QueueSupplier();
[all...] |
| IterablesTest.java | 47 import java.util.Queue;
[all...] |
| /external/oprofile/events/i386/nehalem/ |
| unit_masks | 207 0x04 iq_full Stall cycles due to a full instruction queue
354 0x01 promotion Counts the number of L2 secondary misses that hit the Super Queue
355 0x02 promotion_post_go Counts the number of L2 secondary misses during the Super Queue filling L2
356 0x04 lru_hints Counts number of Super Queue LRU hints sent to L3
|
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/testtype/ |
| CtsTest.java | 62 import java.util.Queue;
645 // treat shardQueue as a circular queue, to sequentially distribute tests among shards
646 Queue<IRemoteTest> shardQueue = new LinkedList<IRemoteTest>();
|
| /development/cmds/monkey/src/com/android/commands/monkey/ |
| MonkeySourceNetwork.java | 42 import java.util.Queue;
100 * @param queue the command queue.
103 MonkeyCommandReturn translateCommand(List<String> command, CommandQueue queue);
113 CommandQueue queue) {
117 queue.enqueueEvent(new MonkeyFlipEvent(true));
120 queue.enqueueEvent(new MonkeyFlipEvent(false));
137 CommandQueue queue) {
165 queue.enqueueEvent(new MonkeyTouchEvent(action)
181 CommandQueue queue) {
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MinMaxPriorityQueue.java | 39 import java.util.Queue;
42 * A double-ended priority queue, which provides constant-time access to both
43 * its least element and its greatest element, as determined by the queue's
47 * <p>As a {@link Queue} it functions exactly as a {@link PriorityQueue}: its
50 * the queue according to the queue's comparator. But unlike a regular priority
51 * queue, the methods {@link #peekLast}, {@link #pollLast} and
53 * in the queue instead.
55 * <p>A min-max priority queue can be configured with a maximum size. If so,
56 * each time the size of the queue exceeds that value, the queue automaticall
205 MinMaxPriorityQueue<T> queue = new MinMaxPriorityQueue<T>( local
222 private Object[] queue; field in class:MinMaxPriorityQueue
[all...] |
| /external/openfst/src/include/fst/ |
| minimize.h | 29 #include <queue>
42 #include <fst/queue.h>
128 template <class A, class Queue>
226 // allocate arc iterator queue
233 // Prep priority queue. Open arc iterator for each state in C, and
234 // insert into priority queue.
242 // Now pop arc iterator from queue, split entering equivalence class
243 // re-insert updated iterator into queue.
291 Queue L_;
296 // Priority queue of open arc iterators for all states in the 'splitter
[all...] |
| /packages/apps/Phone/src/com/android/phone/ |
| DTMFTwelveKeyDialer.java | 46 import java.util.Queue;
78 // Queue to queue the short dtmf characters.
79 private Queue<Character> mDTMFQueue = new LinkedList<Character>();
[all...] |
