Home
last modified time | relevance | path

Searched full:queue (Results 1 – 25 of 2022) sorted by relevance

12345678910>>...81

/external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/misc/
DANTLRFastQueueTest.m18 ANTLRFastQueue *queue = [[ANTLRFastQueue newANTLRFastQueue] retain];
19 STAssertNotNil(queue, @"Queue was not created and was nil");
20 [queue release];
25 ANTLRFastQueue *queue = [[ANTLRFastQueue newANTLRFastQueue] retain];
26 STAssertNotNil(queue, @"Queue was not created and was nil");
27 [queue addObject:@"My String"];
28 …STAssertTrue([[queue objectAtIndex:0] isKindOfClass:[NSString class]], @"First object is not a NSS…
29 STAssertEquals([queue objectAtIndex:0], @"My String", @"Object at index zero is invalid");
30 STAssertTrue([queue size] == 1, @"Queue is the wrong size: %d", [queue size]);
31 [queue release];
[all …]
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/sqs/
Dconnection.py25 from boto.sqs.queue import Queue
38 'queue.amazonaws.com')
70 Create an SQS Queue.
73 :param queue_name: The name of the new queue. Names are
75 account. Calling this method on an existing queue name
78 existing queue of that name. This is still an expensive
80 the existence of a queue. See the
85 all messages written in the queue. This can be overridden
88 :rtype: :class:`boto.sqs.queue.Queue`
89 :return: The newly created queue.
[all …]
/external/guava/guava-tests/test/com/google/common/collect/
DEvictingQueueTest.java44 EvictingQueue<String> queue = EvictingQueue.create(0); in testCreateWithZeroSize() local
45 assertEquals(0, queue.size()); in testCreateWithZeroSize()
47 assertTrue(queue.add("hi")); in testCreateWithZeroSize()
48 assertEquals(0, queue.size()); in testCreateWithZeroSize()
50 assertTrue(queue.offer("hi")); in testCreateWithZeroSize()
51 assertEquals(0, queue.size()); in testCreateWithZeroSize()
53 assertFalse(queue.remove("hi")); in testCreateWithZeroSize()
54 assertEquals(0, queue.size()); in testCreateWithZeroSize()
57 queue.element(); in testCreateWithZeroSize()
61 assertNull(queue.peek()); in testCreateWithZeroSize()
[all …]
/external/squashfs-tools/squashfs-tools/
Dcaches-queues-lists.c39 struct queue *queue_init(int size) in queue_init()
41 struct queue *queue = malloc(sizeof(struct queue)); in queue_init() local
43 if(queue == NULL) in queue_init()
50 queue->data = malloc(sizeof(void *) * (size + 1)); in queue_init()
51 if(queue->data == NULL) in queue_init()
54 queue->size = size + 1; in queue_init()
55 queue->readp = queue->writep = 0; in queue_init()
56 pthread_mutex_init(&queue->mutex, NULL); in queue_init()
57 pthread_cond_init(&queue->empty, NULL); in queue_init()
58 pthread_cond_init(&queue->full, NULL); in queue_init()
[all …]
/external/webrtc/webrtc/common_audio/
Dswap_queue_unittest.cc24 // Queue item verification function for the vector test.
29 // Queue item verifier for the vector test.
46 SwapQueue<std::vector<int>> queue(2, i); in TEST() local
48 EXPECT_TRUE(queue.Insert(&i)); in TEST()
50 EXPECT_TRUE(queue.Insert(&i)); in TEST()
52 EXPECT_TRUE(queue.Remove(&i)); in TEST()
54 EXPECT_TRUE(queue.Remove(&i)); in TEST()
59 SwapQueue<int> queue(2); in TEST() local
61 // Fill the queue. in TEST()
63 EXPECT_TRUE(queue.Insert(&i)); in TEST()
[all …]
/external/libnl/lib/netfilter/
Dqueue_obj.c2 * lib/netfilter/queue_obj.c Netfilter Queue
14 * @defgroup queue Queue
21 #include <netlink/netfilter/queue.h>
33 struct nfnl_queue *queue = (struct nfnl_queue *) a; in nfnl_queue_dump() local
38 if (queue->ce_mask & QUEUE_ATTR_GROUP) in nfnl_queue_dump()
39 nl_dump(p, "group=%u ", queue->queue_group); in nfnl_queue_dump()
41 if (queue->ce_mask & QUEUE_ATTR_MAXLEN) in nfnl_queue_dump()
42 nl_dump(p, "maxlen=%u ", queue->queue_maxlen); in nfnl_queue_dump()
44 if (queue->ce_mask & QUEUE_ATTR_COPY_MODE) in nfnl_queue_dump()
46 nfnl_queue_copy_mode2str(queue->queue_copy_mode, in nfnl_queue_dump()
[all …]
Dqueue.c2 * lib/netfilter/queue.c Netfilter Queue
14 * @defgroup queue Queue
25 #include <netlink/netfilter/queue.h>
50 * @name Queue Commands
111 static int nfnl_queue_build_request(const struct nfnl_queue *queue, in nfnl_queue_build_request() argument
116 if (!nfnl_queue_test_group(queue)) in nfnl_queue_build_request()
120 0, nfnl_queue_get_group(queue)); in nfnl_queue_build_request()
124 if (nfnl_queue_test_maxlen(queue) && in nfnl_queue_build_request()
126 htonl(nfnl_queue_get_maxlen(queue))) < 0) in nfnl_queue_build_request()
132 if (nfnl_queue_test_copy_mode(queue)) { in nfnl_queue_build_request()
[all …]
/external/libchrome/base/synchronization/
Dcondition_variable_unittest.cc257 WorkQueue queue(kThreadCount); // Start the threads. in TEST_F() local
264 base::AutoLock auto_lock(*queue.lock()); in TEST_F()
265 while (!queue.EveryIdWasAllocated()) in TEST_F()
266 queue.all_threads_have_ids()->Wait(); in TEST_F()
271 queue.SpinUntilAllThreadsAreWaiting(); in TEST_F()
275 base::AutoLock auto_lock(*queue.lock()); in TEST_F()
276 EXPECT_EQ(0, queue.GetNumThreadsTakingAssignments()); in TEST_F()
277 EXPECT_EQ(0, queue.GetNumThreadsCompletingTasks()); in TEST_F()
278 EXPECT_EQ(0, queue.task_count()); in TEST_F()
279 EXPECT_EQ(0, queue.GetMaxCompletionsByWorkerThread()); in TEST_F()
[all …]
/external/v8/test/unittests/
Dlocked-queue-unittest.cc5 #include "src/locked-queue-inl.h"
18 LockedQueue<Record> queue; in TEST() local
19 EXPECT_TRUE(queue.IsEmpty()); in TEST()
24 LockedQueue<Record> queue; in TEST() local
25 EXPECT_TRUE(queue.IsEmpty()); in TEST()
26 queue.Enqueue(1); in TEST()
27 EXPECT_FALSE(queue.IsEmpty()); in TEST()
29 bool success = queue.Dequeue(&a); in TEST()
32 EXPECT_TRUE(queue.IsEmpty()); in TEST()
37 LockedQueue<Record> queue; in TEST() local
[all …]
/external/guava/guava-tests/test/com/google/common/util/concurrent/
DListenerCallQueueTest.java43 ListenerCallQueue<Object> queue = in testAddAndExecute() local
47 queue.add(incrementingCallback(counter, 1)); in testAddAndExecute()
48 queue.add(incrementingCallback(counter, 2)); in testAddAndExecute()
49 queue.add(incrementingCallback(counter, 3)); in testAddAndExecute()
50 queue.add(incrementingCallback(counter, 4)); in testAddAndExecute()
52 queue.execute(); in testAddAndExecute()
58 ListenerCallQueue<Object> queue = in testAddAndExecute_withExceptions() local
62 queue.add(incrementingCallback(counter, 1)); in testAddAndExecute_withExceptions()
63 queue.add(THROWING_CALLBACK); in testAddAndExecute_withExceptions()
64 queue.add(incrementingCallback(counter, 2)); in testAddAndExecute_withExceptions()
[all …]
/external/libcxx/include/
Dqueue2 //===--------------------------- queue ------------------------------------===//
15 queue synopsis
21 class queue
34 queue() = default;
35 ~queue() = default;
37 queue(const queue& q) = default;
38 queue(queue&& q) = default;
40 queue& operator=(const queue& q) = default;
41 queue& operator=(queue&& q) = default;
43 explicit queue(const container_type& c);
[all …]
/external/v8/benchmarks/
Drichards.js51 var queue = new Packet(null, ID_WORKER, KIND_WORK);
52 queue = new Packet(queue, ID_WORKER, KIND_WORK);
53 scheduler.addWorkerTask(ID_WORKER, 1000, queue);
55 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
58 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
60 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
61 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
62 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
[all …]
/external/google-breakpad/src/testing/gtest/samples/
Dsample3-inl.h40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue; variable
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>; variable
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
79 // D'tor. Clears the queue.
80 ~Queue() { Clear(); } in ~Queue()
[all …]
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
Dsample3-inl.h40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue; variable
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>; variable
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
79 // D'tor. Clears the queue.
80 ~Queue() { Clear(); } in ~Queue()
[all …]
/external/protobuf/gtest/samples/
Dsample3-inl.h40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue; variable
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>; variable
56 // Gets the next node in the queue.
74 class Queue {
77 // Creates an empty queue.
78 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
80 // D'tor. Clears the queue.
81 ~Queue() { Clear(); } in ~Queue()
[all …]
/external/guava/guava-tests/benchmark/com/google/common/util/concurrent/
DMonitorBasedPriorityBlockingQueue.java28 import java.util.Queue;
36 * An unbounded {@linkplain BlockingQueue blocking queue} that uses
38 * blocking retrieval operations. While this queue is logically
41 * <tt>null</tt> elements. A priority queue relying on {@linkplain
118 * @param initialCapacity the initial capacity for this priority queue
131 * @param initialCapacity the initial capacity for this priority queue
133 * priority queue. If {@code null}, the {@linkplain Comparable
147 * priority queue will be ordered according to the same ordering.
148 * Otherwise, this priority queue will be ordered according to the
152 * into this priority queue
[all …]
DMonitorBasedArrayBlockingQueue.java32 * A bounded {@linkplain BlockingQueue blocking queue} backed by an
33 * array. This queue orders elements FIFO (first-in-first-out). The
34 * <em>head</em> of the queue is that element that has been on the
35 * queue the longest time. The <em>tail</em> of the queue is that
36 * element that has been on the queue the shortest time. New elements
37 * are inserted at the tail of the queue, and the queue retrieval
38 * operations obtain elements at the head of the queue.
43 * increased. Attempts to <tt>put</tt> an element into a full queue
45 * element from an empty queue will similarly block.
49 * is not guaranteed. However, a queue constructed with fairness set
[all …]
/external/guava/guava/src/com/google/common/collect/
DQueues.java24 import java.util.Queue;
35 * Static utility methods pertaining to {@link Queue} and {@link Deque} instances.
98 ConcurrentLinkedQueue<E> queue = new ConcurrentLinkedQueue<E>(); in newConcurrentLinkedQueue() local
99 Iterables.addAll(queue, elements); in newConcurrentLinkedQueue()
100 return queue; in newConcurrentLinkedQueue()
163 * @param elements the elements that the queue should contain, in order
170 LinkedBlockingQueue<E> queue = new LinkedBlockingQueue<E>(); in newLinkedBlockingQueue() local
171 Iterables.addAll(queue, elements); in newLinkedBlockingQueue()
172 return queue; in newLinkedBlockingQueue()
193 * this priority queue will be ordered according to the same ordering.
[all …]
DMinMaxPriorityQueue.java40 import java.util.Queue;
43 * A double-ended priority queue, which provides constant-time access to both
44 * its least element and its greatest element, as determined by the queue's
48 * <p>As a {@link Queue} it functions exactly as a {@link PriorityQueue}: its
51 * the queue according to the queue's comparator. But unlike a regular priority
52 * queue, the methods {@link #peekLast}, {@link #pollLast} and
54 * in the queue instead.
56 * <p>A min-max priority queue can be configured with a maximum size. If so,
57 * each time the size of the queue exceeds that value, the queue automatically
80 * <li>If you only access one end of the queue, and don't use a maximum size,
[all …]
DEvictingQueue.java29 import java.util.Queue;
32 * A non-blocking queue which automatically evicts elements from the head of the queue when
33 * attempting to add new elements onto the queue and it is full.
35 * <p>An evicting queue must be configured with a maximum size. Each time an element is added
36 * to a full queue, the queue automatically removes its head element. This is different from
48 private final Queue<E> delegate;
60 * Creates and returns a new evicting queue that will hold up to {@code maxSize} elements.
63 * queue.
70 * Returns the number of additional elements that this queue can accept without evicting;
71 * zero if the queue is currently full.
[all …]
/external/mesa3d/src/gallium/drivers/svga/
Dsvga_state_tss.c77 struct bind_queue queue; in update_tss_binding() local
79 queue.bind_count = 0; in update_tss_binding()
123 queue.bind[queue.bind_count].unit = i; in update_tss_binding()
124 queue.bind[queue.bind_count].view = view; in update_tss_binding()
125 queue.bind_count++; in update_tss_binding()
134 if (queue.bind_count) { in update_tss_binding()
139 queue.bind_count ) != PIPE_OK) in update_tss_binding()
142 for (i = 0; i < queue.bind_count; i++) { in update_tss_binding()
145 ts[i].stage = queue.bind[i].unit; in update_tss_binding()
148 if (queue.bind[i].view->v) { in update_tss_binding()
[all …]
/external/iproute2/man/man8/
Dtc-codel.83 CoDel \- Controlled-Delay Active Queue Management algorithm
19 CoDel (pronounced "coddle") is an adaptive "no-knobs" active queue management
32 CoDel comes with three major innovations. Instead of using queue size or queue
33 average, it uses the local minimum queue as a measure of the standing/persistent queue.
35 is relative to the standing queue delay. Third, instead of measuring queue size
36 in bytes or packets, it is measured in packet-sojourn time in the queue.
38 CoDel measures the minimum local queue delay (i.e. standing queue delay) and
39 compares it to the value of the given acceptable queue delay
41 As long as the minimum queue delay is less than
44 Codel enters a dropping mode when the minimum queue delay has exceeded
[all …]
Dtc-red.823 Random Early Detection is a classless qdisc which manages its queue size
28 Once the queue hits a certain average length, packets enqueued have a
32 average queue length, although the queue might get bigger.
38 The goal is to have a small queue size, which is good for interactivity
45 The average queue size is used for determining the marking
49 When the average queue size is below
56 until the average queue size hits
60 is normally not set to 100%, the queue size might
65 parameter is provided to set a hard maximum for the size of the queue.
70 Average queue size at which marking becomes a possibility. Defaults to
[all …]
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/integration/sqs/
Dtest_connection.py51 queue = c.create_queue('bad*queue*name')
52 self.fail('queue name should have been bad')
73 # now try to get queue attributes
99 # now read the message from the queue with a 10 second timeout
132 # create another queue so we can test force deletion
133 # we will also test MHMessage with this queue
158 queue = c.create_queue(queue_name)
159 self.addCleanup(c.delete_queue, queue, True)
162 response = queue.read(visibility_timeout=None,
166 "SQS queue did not block for at least %s seconds: %s" %
[all …]
/external/mesa3d/src/gallium/drivers/llvmpipe/
Dlp_scene_queue.c30 * Scene queue. We'll use two queues. One contains "full" scenes which
49 * A queue of scenes
58 /** Allocate a new scene queue */
62 struct lp_scene_queue *queue = CALLOC_STRUCT(lp_scene_queue); in lp_scene_queue_create() local
63 if (queue == NULL) in lp_scene_queue_create()
66 queue->ring = util_ringbuffer_create( MAX_SCENE_QUEUE * in lp_scene_queue_create()
68 if (queue->ring == NULL) in lp_scene_queue_create()
71 return queue; in lp_scene_queue_create()
74 FREE(queue); in lp_scene_queue_create()
79 /** Delete a scene queue */
[all …]

12345678910>>...81