Searched refs:queue (Results 176 - 200 of 851) sorted by relevance

1234567891011>>

/external/guava/guava/src/com/google/common/collect/
H A DMinMaxPriorityQueue.java42 * 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
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 automatically
79 * <li>If you only access one end of the queue, an
222 private Object[] queue; field in class:MinMaxPriorityQueue
[all...]
/external/mesa3d/src/gallium/state_trackers/clover/core/
H A Devent.cpp86 pipe_screen *screen = queue()->dev.pipe;
92 pipe_screen *screen = queue()->dev.pipe;
108 hard_event::queue() const { function in class:hard_event
119 pipe_screen *screen = queue()->dev.pipe;
122 queue()->flush();
131 pipe_screen *screen = queue()->dev.pipe;
159 soft_event::queue() const { function in class:soft_event
/external/dhcpcd/
H A Deloop.c54 int queue; member in struct:timeout
113 add_q_timeout_tv(int queue, argument
152 t->queue = queue;
174 add_q_timeout_sec(int queue, time_t when, void (*callback)(void *), void *arg) argument
180 add_q_timeout_tv(queue, &tv, callback, arg);
187 v_delete_q_timeouts(int queue, void *arg, void (*callback)(void *), va_list v) argument
194 if (t->queue == queue && t->arg == arg &&
217 delete_q_timeouts(int queue, voi argument
227 delete_q_timeout(int queue, void (*callback)(void *), void *arg) argument
[all...]
/external/stlport/stlport/stl/
H A D_queue.h59 class queue class in inherits:__stlport_class
62 : public __stlport_class<queue<_Tp> >
64 : public __stlport_class<queue<_Tp, _Sequence> >
70 typedef queue<_Tp> _Self;
72 typedef queue<_Tp, _Sequence> _Self;
86 queue() : c() {} function in class:queue
87 explicit queue(const _Sequence& __c) : c(__c) {} function in class:queue
90 queue(__move_source<_Self> src) function in class:queue
122 operator==(const queue<_STLP_QUEUE_ARGS >& __x, const queue<_STLP_QUEUE_ARG
[all...]
/external/qemu/distrib/mini-glib/src/
H A Dglib-mini.c705 GQueue* queue = g_new0(GQueue, 1); local
706 return queue;
709 void g_queue_free(GQueue* queue) { argument
710 GQueueNode* node = queue->head;
716 queue->head = queue->tail = NULL;
717 queue->length = 0;
718 g_free(queue);
721 gboolean g_queue_is_empty(GQueue* queue) { argument
722 return queue
725 g_queue_push_tail(GQueue* queue, void* data) argument
734 g_queue_peek_head(GQueue* queue) argument
738 g_queue_peek_tail(GQueue* queue) argument
742 g_queue_pop_head(GQueue* queue) argument
[all...]
/external/apache-http/src/org/apache/commons/logging/impl/
H A DWeakHashtable.java130 private ReferenceQueue queue = new ReferenceQueue(); field in class:WeakHashtable
246 Referenced keyRef = new Referenced(key, queue);
326 synchronized (queue) {
328 while ((key = (WeakKey) queue.poll()) != null) {
340 synchronized (queue) {
341 WeakKey key = (WeakKey) queue.poll();
415 private Referenced(Object key, ReferenceQueue queue) { argument
416 reference = new WeakKey(key, queue, this);
473 ReferenceQueue queue,
475 super(key, queue);
472 WeakKey(Object key, ReferenceQueue queue, Referenced referenced) argument
[all...]
/external/chromium_org/components/crash/tools/
H A Dgenerate_breakpad_symbols.py143 queue = Queue.Queue()
148 binary = queue.get()
164 queue.task_done()
190 queue.task_done()
193 queue.put(binary)
200 queue.join()
245 queue = [options.binary]
247 while queue:
248 deps = GetSharedLibraryDependencies(options, queue.pop(0), exe_path)
251 queue
[all...]
/external/chromium_org/components/keyed_service/core/
H A Ddependency_graph.cc66 std::deque<DependencyNode*> queue; local
67 std::copy(all_nodes_.begin(), all_nodes_.end(), std::back_inserter(queue));
69 std::deque<DependencyNode*>::iterator queue_end = queue.end();
71 queue_end = std::remove(queue.begin(), queue_end, it->second);
73 queue.erase(queue_end, queue.end());
78 while (!queue.empty()) {
79 DependencyNode* node = queue.front();
80 queue.pop_front();
101 queue
[all...]
/external/openfst/src/include/fst/script/
H A Dshortest-distance.h27 #include <fst/queue.h> // for QueueType
110 Queue *queue = local
114 queue, AnyArcFilter<Arc>(), opts.source, opts.delta);
116 delete queue;
120 Queue *queue = local
125 queue, EpsilonArcFilter<Arc>(), opts.source, opts.delta);
127 delete queue;
131 Queue *queue = local
136 queue, InputEpsilonArcFilter<Arc>(), opts.source, opts.delta);
138 delete queue;
142 Queue *queue = local
[all...]
/external/chromium_org/chrome/browser/net/
H A Dpredictor_unittest.cc574 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
601 Predictor::HostNameQueue queue; local
[all...]
/external/chromium_org/cc/resources/
H A Draster_worker_pool_perftest.cc202 void BuildRasterTaskQueue(RasterTaskQueue* queue, argument
209 queue->items.push_back(
304 // Avoid unnecessary heap allocations by reusing the same queue.
305 RasterTaskQueue queue; local
309 queue.Reset();
310 BuildRasterTaskQueue(&queue, raster_tasks);
311 raster_worker_pool_->AsRasterizer()->ScheduleTasks(&queue);
340 // Avoid unnecessary heap allocations by reusing the same queue.
341 RasterTaskQueue queue; local
346 queue
375 RasterTaskQueue queue; local
498 RasterTaskQueue queue; local
[all...]
H A Dtile_manager_perftest.cc42 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
271 EvictionTilePriorityQueue queue; local
308 EvictionTilePriorityQueue queue; local
[all...]
H A Dbitmap_skpicture_content_layer_updater.cc22 ResourceUpdateQueue* queue,
36 queue->AppendPartialUpload(upload);
38 queue->AppendFullUpload(upload);
21 Update( ResourceUpdateQueue* queue, const gfx::Rect& source_rect, const gfx::Vector2d& dest_offset, bool partial_update) argument
/external/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/
H A Dtest_mock.py87 queue.
90 def __init__(self, conn, queue):
92 self._queue = queue
103 queue = Queue.Queue()
104 reader = LineReader(conn, queue)
105 self.failUnless(queue.empty())
107 read = queue.get()
/external/glide/library/src/main/java/com/bumptech/glide/
H A DListPreloader.java144 private final Queue<PreloadTarget> queue; field in class:ListPreloader.PreloadTargetQueue
149 queue = new ArrayDeque<PreloadTarget>(size);
151 queue = new LinkedList<PreloadTarget>();
155 queue.offer(new PreloadTarget());
160 final PreloadTarget result = queue.poll();
161 queue.offer(result);
/external/chromium_org/cc/test/
H A Dfake_tile_manager.cc22 virtual void ScheduleTasks(RasterTaskQueue* queue) OVERRIDE {
24 queue->items.begin();
25 it != queue->items.end();
/external/chromium_org/device/hid/
H A Dhid_connection_mac.h11 #include <queue>
71 std::queue<PendingHidReport> pending_reports_;
72 std::queue<PendingHidRead> pending_reads_;
/external/chromium_org/storage/browser/fileapi/
H A Drecursive_operation_delegate.h8 #include <queue>
142 std::stack<std::queue<FileSystemURL> > pending_directory_stack_;
143 std::queue<FileSystemURL> pending_files_;
/external/glide/library/src/main/java/com/bumptech/glide/volley/
H A DRequestQueueWrapper.java50 RequestQueue queue = new RequestQueue(diskCache, network);
51 queue.start();
52 return queue;
/external/lldb/source/Plugins/Process/Utility/
H A DThreadMemory.cpp36 const char *queue,
47 if (queue)
48 m_queue = queue;
33 ThreadMemory(Process &process, lldb::tid_t tid, const char *name, const char *queue, lldb::addr_t register_data_addr) argument
/external/chromium_org/cc/layers/
H A Dio_surface_layer.h22 virtual bool Update(ResourceUpdateQueue* queue,
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/testing/
H A Dspoken_list_builder.js38 cvox.SpokenListBuilder.prototype.queue = function(expectedText) {
/external/chromium_org/chrome/renderer/spellchecker/
H A Dspellcheck_language.h8 #include <queue>
/external/chromium_org/content/public/test/android/javatests/src/org/chromium/content/browser/test/
H A DNestedSystemMessageHandler.java37 * Processes messages from the current MessageQueue till the queue becomes idle.
44 MessageQueue queue = Looper.myQueue();
45 queue.addIdleHandler(new MessageQueue.IdleHandler() {
53 Class<?> messageQueueClazz = queue.getClass();
69 msg = (Message) nextMethod.invoke(queue);
/external/chromium_org/sandbox/mac/
H A Ddispatch_source_mach_unittest.cc89 dispatch_queue_t queue = local
93 dispatch_async(queue, ^{
107 dispatch_async(queue, ^{
116 dispatch_release(queue);

Completed in 8104 milliseconds

1234567891011>>