Searched refs:queue (Results 76 - 100 of 404) sorted by relevance

1234567891011>>

/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
H A DAACTrackImpl.java109 LinkedList<Integer> queue = new LinkedList<Integer>();
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;
/external/openfst/src/include/fst/
H A Dvisit.h62 // Performs queue-dependent visitation. Visitor class argument
69 void Visit(const Fst<Arc> &fst, V *visitor, Q *queue, ArcFilter filter) { argument
111 queue->Enqueue(root);
112 while (!queue->Empty()) {
113 StateId s = queue->Head();
131 queue->Dequeue();
151 queue->Enqueue(arc.nextstate);
188 inline void Visit(const Fst<Arc> &fst, V *visitor, Q* queue) { argument
189 Visit(fst, visitor, queue, AnyArcFilter<Arc>());
192 // Copies input FST to mutable FST following queue orde
[all...]
/external/webkit/Tools/Scripts/webkitpy/tool/steps/
H A Dpostdiffforrevert.py36 marking it commit-queue+. The commit-queue will build and test \
/external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/
H A Djstemplate.js329 * [index] indexes into the call queue at that depth. We require a call
330 * queue so that a node may branch to more than one child
352 * The index into the queue for each depth. NOTE: Alternative would
367 var queue, queueIndex;
371 queue = calls[calls.length - 1];
373 if (queueIndex >= queue.length) {
379 // Run the first function in the queue.
380 method = queue[queueIndex++];
381 arg1 = queue[queueIndex++];
382 arg2 = queue[queueInde
[all...]
/external/chromium/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/
H A Djstemplate.js329 * [index] indexes into the call queue at that depth. We require a call
330 * queue so that a node may branch to more than one child
352 * The index into the queue for each depth. NOTE: Alternative would
367 var queue, queueIndex;
371 queue = calls[calls.length - 1];
373 if (queueIndex >= queue.length) {
379 // Run the first function in the queue.
380 method = queue[queueIndex++];
381 arg1 = queue[queueIndex++];
382 arg2 = queue[queueInde
[all...]
/external/webkit/Source/WebCore/storage/
H A DIDBTransactionBackendImpl.cpp184 TaskQueue queue; local
185 queue.swap(m_taskQueue);
186 while (!queue.isEmpty() && m_state != Finished) {
188 OwnPtr<ScriptExecutionContext::Task> task(queue.first().release());
189 queue.removeFirst();
201 // queue is empty. Commit the transaction.
207 // the task queue is non-empty and the timer is inactive.
/external/javassist/src/main/javassist/scopedpool/
H A DSoftValueHashMap.java62 /* 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/chromium/third_party/libevent/sample/
H A Dsignal-test.c15 #include <sys/queue.h>
/external/guava/guava/src/com/google/common/util/concurrent/
H A DUninterruptibles.java207 * Invokes {@code queue.}{@link BlockingQueue#take() take()} uninterruptibly.
209 public static <E> E takeUninterruptibly(BlockingQueue<E> queue) { argument
214 return queue.take();
227 * Invokes {@code queue.}{@link BlockingQueue#put(Object) put(element)}
230 public static <E> void putUninterruptibly(BlockingQueue<E> queue, E element) { argument
235 queue.put(element);
/external/ipsec-tools/src/racoon/
H A Dsainfo.h37 #include <sys/queue.h>
H A Dschedule.h37 #include <sys/queue.h>
/external/jmonkeyengine/engine/src/core/com/jme3/scene/debug/
H A DSkeletonDebugger.java36 import com.jme3.renderer.queue.RenderQueue.Bucket;
/external/kernel-headers/original/linux/
H A Dmsm_adsp.h21 uint16_t queue; member in struct:adsp_command_t
/external/stlport/test/unit/
H A Dstack_test.cpp3 #include <queue>
H A Dmvctor_declaration_test.cpp22 #include <queue>
260 //queue:
261 CPPUNIT_ASSERT( is_movable(queue<char>()) );
262 CPPUNIT_ASSERT( is_movable(queue<specially_allocated_struct>()) );
264 CPPUNIT_ASSERT( is_move_complete(queue<char>()) );
265 CPPUNIT_ASSERT( !is_move_complete(queue<specially_allocated_struct>()) );
267 CPPUNIT_ASSERT( !is_move_complete(queue<char>()) );
/external/webkit/Tools/DumpRenderTree/
H A DWorkQueue.cpp52 void WorkQueue::queue(WorkQueueItem* item) function in class:WorkQueue
/external/webkit/Tools/Scripts/webkitpy/layout_tests/layout_package/
H A Dmessage_broker2.py37 queues themselves are provided by the caller, as the queue's implementation
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)
/external/chromium/chrome/browser/chromeos/login/
H A Dwizard_accessibility_helper.cc88 void WizardAccessibilityHelper::MaybeSpeak(const char* str, bool queue, argument
91 accessibility_handler_->Speak(str, queue, interruptible);
/external/stressapptest/
H A DAndroid.mk15 src/queue.cc \
/external/webkit/Tools/Scripts/webkitpy/tool/bot/
H A Dfeeders_unittest.py43 MOCK setting flag 'commit-queue' to '-' on attachment '128' with comment 'Rejecting attachment 128 from commit-queue.' and additional comment 'non-committer@example.com does not have committer permissions according to http://trac.webkit.org/browser/trunk/Tools/Scripts/webkitpy/common/config/committers.py.
47 - If you have committer rights please correct the error in Tools/Scripts/webkitpy/common/config/committers.py by adding yourself to the file (no review needed). The commit-queue restarts itself every 2 hours. After restart the commit-queue will correctly respect your committer rights.'
48 MOCK: update_work_items: commit-queue [106, 197]
49 Feeding commit-queue items [106, 197]
68 queue = CommitQueueFeeder(MockTool())
69 attachments.sort(queue._patch_cmp)
/external/qemu/hw/
H A Dps2.c81 PS2Queue queue; member in struct:__anon10987
126 PS2Queue *q = &s->queue;
162 q = &s->queue;
349 (s->common.queue.count < (PS2_QUEUE_SIZE - 16))) {
496 q = &s->queue;
506 qemu_put_be32 (f, s->queue.rptr);
507 qemu_put_be32 (f, s->queue.wptr);
508 qemu_put_be32 (f, s->queue.count);
509 qemu_put_buffer (f, s->queue.data, sizeof (s->queue
[all...]
/external/doclava/src/com/google/doclava/
H A DMethodInfo.java46 private static void addInterfaces(ArrayList<ClassInfo> ifaces, ArrayList<ClassInfo> queue) { argument
48 queue.add(i);
51 addInterfaces(i.interfaces(), queue);
66 ArrayList<ClassInfo> queue = new ArrayList<ClassInfo>();
67 addInterfaces(containingClass().interfaces(), queue);
68 for (ClassInfo iface : queue) {
79 private static void addRealInterfaces(ArrayList<ClassInfo> ifaces, ArrayList<ClassInfo> queue) { argument
81 queue.add(i);
83 queue.add(i.superclass());
87 addInterfaces(i.realInterfaces(), queue);
[all...]
/external/linux-tools-perf/util/
H A Dannotate.c115 struct objdump_line *queue)
154 if (queue != NULL) {
155 list_for_each_entry_from(queue, &notes->src->source, node) {
156 if (queue == oline)
158 objdump_line__print(queue, sym, evidx, len,
185 if (queue)
512 struct objdump_line *pos, *queue = NULL; local
531 if (context && queue == NULL) {
532 queue = pos;
537 printed, max_lines, queue)) {
112 objdump_line__print(struct objdump_line *oline, struct symbol *sym, int evidx, u64 len, int min_pcnt, int printed, int max_lines, struct objdump_line *queue) argument
[all...]
/external/libppp/src/
H A Dmbuf.c70 struct mbuf *queue; member in struct:memmap
349 log_Printf(LogDEBUG, "m_dequeue: queue len = %lu\n", (u_long)q->len);
367 m_enqueue(struct mqueue *queue, struct mbuf *bp) argument
370 if (queue->last) {
371 queue->last->m_nextpkt = bp;
372 queue->last = bp;
374 queue->last = queue->top = bp;
375 queue->len++;
376 log_Printf(LogDEBUG, "m_enqueue: len = %lu\n", (unsigned long)queue
[all...]
/external/chromium/chrome/browser/net/
H A Durl_info.cc50 case QUEUED: // In queue.
100 DLogResultsStats("DNS Prefetch in queue");
290 MinMaxAverage queue, when; local
294 queue.sample((it->queue_duration_.InMilliseconds()));
309 queue.minimum(), queue.average(), queue.maximum());

Completed in 1120 milliseconds

1234567891011>>