| /packages/apps/Launcher3/src/com/android/launcher3/ |
| DeferredHandler.java | 29 * Queue of things to run on a looper thread. Items posted with {@link #post} will not
78 /** Schedule runnable to run after everything that's on the queue right now. */
91 /** Schedule runnable to run when the queue goes idle. */
125 LinkedList<Pair<Runnable, Integer>> queue = new LinkedList<Pair<Runnable, Integer>>(); local
127 queue.addAll(mQueue);
130 for (Pair<Runnable, Integer> p : queue) {
|
| /packages/apps/Mms/src/com/android/mms/util/ |
| BackgroundLoaderManager.java | 72 final LinkedBlockingQueue<Runnable> queue = new LinkedBlockingQueue<Runnable>(); local
75 poolSize, poolSize, 5, TimeUnit.SECONDS, queue,
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{queue}
81 * wrapper is what enforces strict first-in-first-out %queue behavior.
90 * @c pop, which are standard %queue/FIFO operations.
93 class queue class
104 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
108 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
134 queue(const _Sequence& __c = _Sequence() function in class:queue
138 queue(const _Sequence& __c) function in class:queue
142 queue(_Sequence&& __c = _Sequence()) function in class:queue
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{queue}
81 * wrapper is what enforces strict first-in-first-out %queue behavior.
90 * @c pop, which are standard %queue/FIFO operations.
93 class queue class
104 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
108 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
134 queue(const _Sequence& __c = _Sequence() function in class:queue
138 queue(const _Sequence& __c) function in class:queue
142 queue(_Sequence&& __c = _Sequence()) function in class:queue
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{queue}
80 * wrapper is what enforces strict first-in-first-out %queue behavior.
89 * @c pop, which are standard %queue/FIFO operations.
92 class queue class
103 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
107 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
133 queue(const _Sequence& __c = _Sequence() function in class:queue
137 queue(const _Sequence& __c) function in class:queue
141 queue(_Sequence&& __c = _Sequence()) function in class:queue
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{queue}
80 * wrapper is what enforces strict first-in-first-out %queue behavior.
89 * @c pop, which are standard %queue/FIFO operations.
92 class queue class
103 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
107 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
133 queue(const _Sequence& __c = _Sequence() function in class:queue
137 queue(const _Sequence& __c) function in class:queue
141 queue(_Sequence&& __c = _Sequence()) function in class:queue
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{queue}
81 * wrapper is what enforces strict first-in-first-out %queue behavior.
90 * @c pop, which are standard %queue/FIFO operations.
93 class queue class
104 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
108 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
134 queue(const _Sequence& __c = _Sequence() function in class:queue
138 queue(const _Sequence& __c) function in class:queue
142 queue(_Sequence&& __c = _Sequence()) function in class:queue
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{queue}
81 * wrapper is what enforces strict first-in-first-out %queue behavior.
90 * @c pop, which are standard %queue/FIFO operations.
93 class queue class
104 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
108 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
134 queue(const _Sequence& __c = _Sequence() function in class:queue
138 queue(const _Sequence& __c) function in class:queue
142 queue(_Sequence&& __c = _Sequence()) function in class:queue
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/request/ |
| GenericRequest.java | 22 import java.util.Queue;
64 private static final Queue<GenericRequest> queue = new ArrayDeque<GenericRequest>(); field in class:GenericRequest
88 GenericRequest request = queue.poll();
138 queue.offer(this);
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
| AACTrackImpl.java | 109 LinkedList<Integer> queue = new LinkedList<Integer>(); local
113 queue.add(size);
114 while (queue.size() > packetsPerSecond) {
115 queue.pop();
117 if (queue.size() == (int) packetsPerSecond) {
119 for (int j = 0 ; j < queue.size(); j++) {
120 currSize += queue.get(j);
122 double currBitrate = 8.0 * currSize / queue.size() * packetsPerSecond;
|
| /frameworks/support/v4/api21/android/support/v4/media/session/ |
| MediaSessionCompatApi21.java | 120 ArrayList<MediaSession.QueueItem> queue = new ArrayList<MediaSession.QueueItem>(); local
122 queue.add((MediaSession.QueueItem) itemObj);
124 ((MediaSession) sessionObj).setQueue(queue);
|
| /frameworks/base/core/java/android/hardware/ |
| SystemSensorManager.java | 116 SensorEventQueue queue = mSensorListeners.get(listener); local
117 if (queue == null) {
119 queue = new SensorEventQueue(listener, looper, this);
120 if (!queue.addSensor(sensor, delayUs, maxBatchReportLatencyUs, reservedFlags)) {
121 queue.dispose();
124 mSensorListeners.put(listener, queue);
127 return queue.addSensor(sensor, delayUs, maxBatchReportLatencyUs, reservedFlags);
141 SensorEventQueue queue = mSensorListeners.get(listener); local
142 if (queue != null) {
145 result = queue.removeAllSensors()
165 TriggerEventQueue queue = mTriggerListeners.get(listener); local
188 TriggerEventQueue queue = mTriggerListeners.get(listener); local
210 SensorEventQueue queue = mSensorListeners.get(listener); local
[all...] |
| /cts/tests/tests/media/src/android/media/cts/ |
| MediaSessionTest.java | 127 ArrayList<MediaSession.QueueItem> queue = new ArrayList<MediaSession.QueueItem>(); local
130 queue.add(item);
131 session.setQueue(queue);
|
| /development/samples/USB/MissileLauncher/src/com/android/missilelauncher/ |
| MissileLauncherActivity.java | 222 // queue a request on the interrupt endpoint
223 request.queue(buffer, 1);
|
| /external/chromium_org/apps/ |
| launcher.cc | 96 // has outstanding tasks on a message queue it will be retained; once all
249 // the lazy background task queue is used to load the extension and then
251 extensions::LazyBackgroundTaskQueue* const queue = member in class:apps::__anon6461::PlatformAppPathLauncher::extensions
253 if (queue->ShouldEnqueueTask(profile_, extension_)) {
254 queue->AddPendingTask(
|
| /external/chromium_org/cc/resources/ |
| raster_worker_pool_unittest.cc | 211 RasterTaskQueue queue; local
218 queue.items.push_back(RasterTaskQueue::Item(it->get(), task_sets));
221 raster_worker_pool_->AsRasterizer()->ScheduleTasks(&queue);
|
| tile_manager_perftest.cc | 42 virtual void ScheduleTasks(RasterTaskQueue* queue) OVERRIDE {
44 queue->items.begin();
45 it != queue->items.end();
199 RasterTilePriorityQueue queue; local
200 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]);
230 RasterTilePriorityQueue queue; local
231 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]);
233 ASSERT_FALSE(queue.IsEmpty());
234 ASSERT_TRUE(queue.Top() != NULL);
235 queue.Pop()
271 EvictionTilePriorityQueue queue; local
308 EvictionTilePriorityQueue queue; local
[all...] |
| /external/chromium_org/chrome/browser/chromeos/file_manager/ |
| file_browser_handlers.cc | 338 extensions::LazyBackgroundTaskQueue* queue = local
341 if (!queue->ShouldEnqueueTask(profile_, extension_.get())) {
345 queue->AddPendingTask(
|
| /external/chromium_org/chrome/browser/extensions/activity_log/ |
| counting_policy.cc | 208 // queue, flush the queue out now to prevent any false merging (actions
236 ActionQueue queue; local
237 queue.swap(queued_actions_);
247 if (queue.empty() && !clean_database)
285 for (ActionQueue::iterator i = queue.begin(); i != queue.end(); ++i) {
|
| /external/chromium_org/chrome/browser/net/ |
| predictor_unittest.cc | 574 Predictor::HostNameQueue queue; local
578 // First check high priority queue FIFO functionality.
579 EXPECT_TRUE(queue.IsEmpty());
580 queue.Push(first, UrlInfo::LEARNED_REFERAL_MOTIVATED);
581 EXPECT_FALSE(queue.IsEmpty());
582 queue.Push(second, UrlInfo::MOUSE_OVER_MOTIVATED);
583 EXPECT_FALSE(queue.IsEmpty());
584 EXPECT_EQ(queue.Pop(), first);
585 EXPECT_FALSE(queue.IsEmpty());
586 EXPECT_EQ(queue.Pop(), second)
601 Predictor::HostNameQueue queue; local
[all...] |
| url_info.cc | 86 case QUEUED: // In queue.
119 DLogResultsStats("DNS Prefetch in queue");
311 MinMaxAverage queue, when; local
315 queue.sample((it->queue_duration_.InMilliseconds()));
329 "Prefetch Queue Durations: min=%d, avg=%d, max=%d<br><br>",
330 queue.minimum(), queue.average(), queue.maximum());
|
| /external/chromium_org/components/url_matcher/ |
| substring_set_matcher.cc | 8 #include <queue>
193 std::queue<uint32> queue; local
202 queue.push(leads_to);
205 while (!queue.empty()) {
206 AhoCorasickNode& current_node = tree_[queue.front()];
207 queue.pop();
212 queue.push(leads_to);
|
| /external/chromium_org/content/browser/frame_host/ |
| frame_tree.cc | 7 #include <queue>
131 std::queue<FrameTreeNode*> queue; local
132 queue.push(root_.get());
134 while (!queue.empty()) {
135 FrameTreeNode* node = queue.front();
136 queue.pop();
141 queue.push(node->child_at(i));
217 // ForEach does not add a node's children to the queue until after visiting
|
| /external/chromium_org/content/browser/renderer_host/input/ |
| gesture_event_queue_unittest.cc | 77 queue()->set_debounce_interval_time_ms_for_testing(interval_ms);
84 if (queue()->ShouldForward(gesture_with_latency)) {
125 queue()->ProcessGestureAck(ack, type, ui::LatencyInfo());
159 return queue()->coalesced_gesture_events_.size();
163 return queue()->coalesced_gesture_events_.at(
168 return queue()->coalesced_gesture_events_.back().event;
172 return queue()->debouncing_deferral_queue_.size();
176 return queue()->coalesced_gesture_events_.at(i).event;
180 return queue()->scrolling_in_progress_;
184 return queue()->fling_in_progress_
191 GestureEventQueue* queue() const { function in class:content::GestureEventQueueTest
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/qunit/qunit/ |
| qunit.js | 221 queue: function() {
293 test.queue();
436 // The queue of tests to run
437 queue: [],
503 queue: [],
676 // Initialize the config, saving the execution queue
853 config.queue.push( callback );
863 while ( config.queue.length && !config.blocking ) {
865 config.queue.shift()();
871 if (!config.blocking && !config.queue.length)
[all...] |
