| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| shortest-path.h | 26 #include "fst/lib/queue.h"
32 template <class Arc, class Queue, class ArcFilter>
34 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> {
42 ShortestPathOptions(Queue *q, ArcFilter filt, size_t n = 1, bool u = false,
44 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d),
53 // such as the queue discipline, the arc filter and delta.
60 template<class Arc, class Queue, class ArcFilter>
64 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
80 Queue *state_queue = opts.state_queue;
211 // strings, the queue discipline, the arc filter and the convergenc
[all...] |
| rmepsilon.h | 34 #include "fst/lib/queue.h"
40 template <class Arc, class Queue>
42 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
47 RmEpsilonOptions(Queue *q, float d = kDelta, bool c = true)
48 : ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> >(
55 template <class Arc, class Queue>
64 const RmEpsilonOptions<Arc, Queue> &opts)
119 ShortestDistanceState<Arc, Queue, EpsilonArcFilter<Arc> > sd_state_;
126 stack<StateId> eps_queue_; // Queue used to visit the epsilon-closure
136 template <class Arc, class Queue>
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocBasic.cpp | 41 #include <queue>
74 CompSpillWeight> Queue;
98 Queue.push(LI);
102 if (Queue.empty())
104 LiveInterval *LI = Queue.top();
105 Queue.pop();
|
| /frameworks/support/volley/src/com/android/volley/ |
| RequestQueue.java | 28 import java.util.Queue;
34 * A request dispatch queue with a thread pool of dispatchers.
56 private final Map<String, Queue<Request>> mWaitingRequests =
57 new HashMap<String, Queue<Request>>();
61 * will be in this set if it is waiting in any queue or currently being processed by
66 /** The cache triage queue. */
70 /** The queue of requests that are actually going out to the network. */
131 * Starts the dispatchers in this queue.
178 * Cancels all requests in this queue for which the given filter applies.
192 * Cancels all requests in this queue with the given tag. Tag must be non-nul
[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...] |
| /external/webkit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| manager_worker_broker.py | 49 import Queue
104 queue_class = Queue.Queue
107 queue_class = Queue.Queue
110 queue_class = multiprocessing.Queue
|
| 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_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()
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 55 protected Queue<object> nodes;
65 nodes = new Queue<object>();
126 nodes.Enqueue(eof); // add to queue, might have UP nodes in there
133 nodes.Enqueue(tree); // add to queue, might have UP nodes in there
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeIterator.cs | 58 protected Queue<object> nodes;
70 nodes = new Queue<object>();
149 nodes.Enqueue( eof ); // add to queue, might have UP nodes in there
158 nodes.Enqueue( tree ); // add to queue, might have UP nodes in there
|
| /external/apache-http/src/org/apache/http/impl/conn/tsccm/ |
| RouteSpecificPool.java | 35 import java.util.Queue;
68 protected final Queue<WaitingThread> waitingThreads;
279 * Returns the next thread in the queue.
|
| ConnPoolByRoute.java | 36 import java.util.Queue;
77 protected Queue<BasicPoolEntry> freeConnections;
80 protected Queue<WaitingThread> waitingThreads;
114 * Creates the queue for {@link #freeConnections}.
117 * @return a queue
119 protected Queue<BasicPoolEntry> createFreeConnQueue() {
124 * Creates the queue for {@link #waitingThreads}.
127 * @return a queue
129 protected Queue<WaitingThread> createWaitingThreadQueue() {
|
| /external/webkit/Tools/QueueStatusServer/handlers/ |
| queuestatus.py | 35 from model.queues import Queue
40 def _rows_for_work_items(self, queue):
41 queued_items = queue.work_items()
42 active_items = queue.active_work_items()
60 def _fetch_statuses(self, queue, bot_id):
62 statuses.filter("queue_name =", queue.name())
67 def _fetch_last_message_matching(self, queue, bot_id, message):
69 statuses.filter("queue_name =", queue.name())
75 def _fetch_trailing_days_pass_count(self, queue, bot_id, days):
77 statuses.filter("queue_name =", queue.name()
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/android/animation/ |
| AnimationThread.java | 32 import java.util.Queue;
70 private Queue<MessageBundle> mQueue = new PriorityQueue<MessageBundle>();
|
| /packages/providers/DownloadProvider/tests/src/com/android/providers/downloads/ |
| FakeSystemFacade.java | 15 import java.util.Queue;
27 Queue<Thread> mStartedThreads = new LinkedList<Thread>();
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 38 /// A priority queue, implemented as a heap.
137 /// A type which sorts a priority queue by the number of unprocessed
151 /// A queue of unified blocks to process.
152 PriorityQueue<BlockPair, QueueSorter, 20> Queue;
171 Queue.insert(BlockPair(L, R));
188 while (!Queue.empty()) {
189 BlockPair Pair = Queue.remove_min();
461 Engine(Engine), Queue(QueueSorter(*this_())) {}
657 SmallVector<std::pair<Function*,Function*>, 20> Queue;
664 Queue.push_back(std::make_pair(LFn, RFn))
[all...] |
| /external/openfst/src/include/fst/ |
| shortest-path.h | 32 #include <fst/queue.h>
39 template <class Arc, class Queue, class ArcFilter>
41 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> {
56 ShortestPathOptions(Queue *q, ArcFilter filt, size_t n = 1, bool u = false,
60 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d),
70 // such as the queue discipline, the arc filter and delta.
77 template<class Arc, class Queue, class ArcFilter>
81 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
98 Queue *state_queue = opts.state_queue;
394 // strings, the queue discipline, the arc filter and the convergenc
[all...] |
| partition.h | 29 #include <fst/queue.h>
199 // partition, create new once and update the queue of active classes
201 template <class Queue>
202 void FinalizeSplit(Queue* L) {
|
| /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,
|
| /cts/tests/tests/accessibilityservice/src/android/accessibilityservice/cts/ |
| AccessibilityFocusAndInputFocusSyncTest.java | 27 import java.util.Queue;
173 Queue<AccessibilityNodeInfo> workQueue = new LinkedList<AccessibilityNodeInfo>();
|
| /development/tools/axl/ |
| chewie.py | 16 class Queue:
18 self.queue = []
21 self.queue.append([url, time])
24 for x in range(len(self.queue)):
25 rec = self.queue[x]
27 del self.queue[x]
30 ## pull out request lag -- queue to start to done
56 queued = Queue()
|
| /frameworks/base/services/tests/servicestests/src/com/android/server/ |
| MockAccessibilityService.java | 28 import java.util.Queue;
40 private final Queue<AccessibilityEvent> mExpectedEvents = new LinkedList<AccessibilityEvent>();
|
| /packages/providers/DownloadProvider/src/com/android/providers/downloads/ |
| SizeLimitActivity.java | 32 import java.util.Queue;
42 private Queue<Intent> mDownloadsToShow = new LinkedList<Intent>();
|
| /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/dropbear/ |
| session.h | 35 #include "queue.h"
105 struct Queue writequeue; /* A queue of encrypted packets to send */
|
