HomeSort by relevance Sort by last modified time
    Searched defs:queue (Results 51 - 75 of 530) sorted by null

1 23 4 5 6 7 8 91011>>

  /developers/samples/android/media/MediaBrowserService/Application/src/main/java/com/example/android/mediabrowserservice/utils/
QueueHelper.java 31 * Utility class to help on queue related tasks.
45 LogHelper.e(TAG, "Could not build a playing queue for this mediaId: ", mediaId);
50 LogHelper.e(TAG, "Creating playing queue for musics of genre ", categoryValue);
52 List<MediaSession.QueueItem> queue = convertToQueue( local
55 return queue;
61 LogHelper.e(TAG, "Creating playing queue for musics from search ", query);
67 public static final int getMusicIndexOnQueue(Iterable<MediaSession.QueueItem> queue,
70 for (MediaSession.QueueItem item: queue) {
79 public static final int getMusicIndexOnQueue(Iterable<MediaSession.QueueItem> queue,
82 for (MediaSession.QueueItem item: queue) {
93 List<MediaSession.QueueItem> queue = new ArrayList<>(); local
    [all...]
  /development/ndk/platforms/android-3/include/linux/
msm_adsp.h 22 uint16_t queue; member in struct:adsp_command_t
  /development/samples/browseable/MediaBrowserService/src/com.example.android.mediabrowserservice/utils/
QueueHelper.java 31 * Utility class to help on queue related tasks.
45 LogHelper.e(TAG, "Could not build a playing queue for this mediaId: ", mediaId);
50 LogHelper.e(TAG, "Creating playing queue for musics of genre ", categoryValue);
52 List<MediaSession.QueueItem> queue = convertToQueue( local
55 return queue;
61 LogHelper.e(TAG, "Creating playing queue for musics from search ", query);
67 public static final int getMusicIndexOnQueue(Iterable<MediaSession.QueueItem> queue,
70 for (MediaSession.QueueItem item: queue) {
79 public static final int getMusicIndexOnQueue(Iterable<MediaSession.QueueItem> queue,
82 for (MediaSession.QueueItem item: queue) {
93 List<MediaSession.QueueItem> queue = new ArrayList<>(); local
    [all...]
  /external/apache-http/src/org/apache/commons/logging/impl/
WeakHashtable.java 130 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) {
416 reference = new WeakKey(key, queue, this);
473 ReferenceQueue queue,
475 super(key, queue);
    [all...]
  /external/bluetooth/bluedroid/osi/src/
thread.c 114 // of queue space, we should abort this operation, otherwise we'll
117 // Queue item is freed either when the queue itself is destroyed
118 // or when the item is removed from the queue for dispatch.
180 ALOGD("%s growing event queue on shutdown.", __func__);
188 fixed_queue_t *queue = (fixed_queue_t *)context; local
189 work_item_t *item = fixed_queue_dequeue(queue);
  /external/chromium_org/net/socket/
websocket_endpoint_lock_manager.cc 34 lock_info_in_map.queue.reset(new LockInfo::WaiterQueue);
38 lock_info_in_map.queue->Append(waiter);
92 DCHECK(!rhs.queue);
106 LockInfo::WaiterQueue* queue = lock_info_it->second.queue.get(); local
107 DCHECK(queue);
108 if (queue->empty()) {
116 Waiter* next_job = queue->head()->value();
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/
svga_state_rss.c 48 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
58 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
83 struct rs_queue queue; local
86 queue.rs_count = 0;
268 if (queue.rs_count) {
273 queue.rs_count ) != PIPE_OK)
277 queue.rs,
278 queue.rs_count * sizeof queue.rs[0]);
  /external/chromium_org/third_party/webrtc/base/
natsocketfactory.h 123 MessageQueue* queue() { return msg_queue_; } function in class:rtc::NATSocketServer
137 virtual void SetMessageQueue(MessageQueue* queue) {
138 msg_queue_ = queue;
139 server_->SetMessageQueue(queue);
  /external/javassist/src/main/javassist/scopedpool/
SoftValueHashMap.java 62 /* Reference queue for cleared WeakKeys */
63 private ReferenceQueue queue = new ReferenceQueue(); field in class:SoftValueHashMap
71 while ((ref = (SoftValueRef)queue.poll()) != null) {
204 Object rtn = hash.put(key, SoftValueRef.create(key, value, queue));
  /external/libnl/src/
nf-queue.c 2 * src/nf-queue.c Monitor netfilter queue events
19 #include <netlink/netfilter/queue.h>
26 struct nfnl_queue *queue; local
28 queue = nfnl_queue_alloc();
29 if (!queue)
30 nl_cli_fatal(ENOMEM, "Unable to allocate queue object");
32 return queue;
51 printf("Warning: %d Out of order packets. Queue or socket overload \n", packet_id - next_packet_id);
87 struct nfnl_queue *queue; local
    [all...]
  /external/mesa3d/src/gallium/drivers/svga/
svga_state_rss.c 48 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
58 svga_queue_rs( &queue, SVGA3D_RS_##token, value ); \
83 struct rs_queue queue; local
86 queue.rs_count = 0;
268 if (queue.rs_count) {
273 queue.rs_count ) != PIPE_OK)
277 queue.rs,
278 queue.rs_count * sizeof queue.rs[0]);
  /external/openfst/src/include/fst/script/
rmepsilon.h 28 #include <fst/queue.h>
76 AutoQueue<StateId> queue(*fst, distance, EpsilonArcFilter<Arc>());
78 &queue, opts.delta, opts.connect, weight_thresh,
84 FifoQueue<StateId> queue; local
86 &queue, opts.delta, opts.connect, weight_thresh,
92 LifoQueue<StateId> queue; local
94 &queue, opts.delta, opts.connect, weight_thresh,
100 NaturalShortestFirstQueue<StateId, Weight> queue(*distance);
103 &queue, opts.delta, opts.connect, weight_thresh,
109 StateOrderQueue<StateId> queue; local
    [all...]
shortest-distance.h 27 #include <fst/queue.h> // for QueueType
57 template<class Queue, class Arc, class ArcFilter>
60 static Queue *Construct(const Fst<Arc> &,
62 return new Queue();
101 template<class Arc, class Queue>
110 Queue *queue = local
111 QueueConstructor<Queue, Arc, AnyArcFilter<Arc> >::Construct(
113 fst::ShortestDistanceOptions<Arc, Queue, AnyArcFilter<Arc> > sdopts(
114 queue, AnyArcFilter<Arc>(), opts.source, opts.delta)
120 Queue *queue = local
131 Queue *queue = local
142 Queue *queue = local
    [all...]
shortest-path.h 71 typedef AutoQueue<StateId> Queue;
72 Queue *queue = QueueConstructor<Queue, Arc, local
74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts(
75 queue, ArcFilter(), opts.nshortest, opts.unique,
79 delete queue;
83 typedef FifoQueue<StateId> Queue;
84 Queue *queue = QueueConstructor<Queue, Arc local
96 Queue *queue = QueueConstructor<Queue, Arc, local
108 Queue *queue = QueueConstructor<Queue, Arc, local
120 Queue *queue = QueueConstructor<Queue, Arc, local
132 Queue *queue = QueueConstructor<Queue, Arc, local
    [all...]
  /external/stlport/stlport/stl/
_queue.h 59 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_ARGS >& __y)
    [all...]
  /frameworks/av/media/libstagefright/rtsp/
AH263Assembler.cpp 54 List<sp<ABuffer> > *queue = source->queue(); local
56 if (queue->empty()) {
61 List<sp<ABuffer> >::iterator it = queue->begin();
62 while (it != queue->end()) {
67 it = queue->erase(it);
70 if (queue->empty()) {
75 sp<ABuffer> buffer = *queue->begin();
99 queue->erase(queue->begin())
    [all...]
  /frameworks/native/services/surfaceflinger/
MessageQueue.cpp 178 MessageQueue* queue = reinterpret_cast<MessageQueue *>(data); local
179 return queue->eventReceiver(fd, events);
  /hardware/intel/common/wrs_omxil_core/utils/src/
queue.c 2 * queue.c, queue
21 #include <queue.h>
23 inline void __queue_init(struct queue *queue)
25 queue->head = NULL;
26 queue->tail = NULL;
27 queue->length = 0;
30 struct queue *queue_alloc(void)
32 struct queue *queue local
    [all...]
  /hardware/libhardware/modules/sensors/tests/
SensorEventQueue_test.cpp 16 bool checkWritableBufferSize(SensorEventQueue* queue, int requested, int expected) {
18 int actual = queue->getWritableRegion(requested, &buffer);
26 bool checkSize(SensorEventQueue* queue, int expected) {
27 int actual = queue->getSize();
29 printf("Expected queue size was %d; actual was %d\n", expected, actual);
45 SensorEventQueue* queue = new SensorEventQueue(10); local
46 if (!checkSize(queue, 0)) return false;
47 if (!checkWritableBufferSize(queue, 11, 10)) return false;
48 if (!checkWritableBufferSize(queue, 10, 10)) return false;
49 if (!checkWritableBufferSize(queue, 9, 9)) return false
67 SensorEventQueue* queue = new SensorEventQueue(10); local
95 SensorEventQueue* queue; member in struct:TaskContext
106 SensorEventQueue* queue = ctx->queue; local
145 SensorEventQueue* queue = ctx->queue; local
167 SensorEventQueue* queue = new SensorEventQueue(FULL_QUEUE_CAPACITY); local
    [all...]
  /hardware/qcom/msm8960/kernel-headers/linux/
msm_adsp.h 26 uint16_t queue; member in struct:adsp_command_t
  /hardware/qcom/msm8960/original-kernel-headers/linux/
msm_adsp.h 26 uint16_t queue; member in struct:adsp_command_t
  /hardware/qcom/msm8x74/kernel-headers/linux/
msm_adsp.h 26 uint16_t queue; member in struct:adsp_command_t
  /hardware/qcom/msm8x74/original-kernel-headers/linux/
msm_adsp.h 26 uint16_t queue; member in struct:adsp_command_t
  /hardware/qcom/msm8x84/kernel-headers/linux/
msm_adsp.h 26 uint16_t queue; member in struct:adsp_command_t
  /hardware/qcom/msm8x84/original-kernel-headers/linux/
msm_adsp.h 25 uint16_t queue; member in struct:adsp_command_t

Completed in 1995 milliseconds

1 23 4 5 6 7 8 91011>>