/external/antlr/runtime/ObjC/Framework/test/runtime/misc/ |
D | FastQueueTest.m | 18 FastQueue *queue = [[FastQueue newFastQueue] retain]; 19 STAssertNotNil(queue, @"Queue was not created and was nil"); 20 [queue release]; 25 FastQueue *queue = [[FastQueue newFastQueue] 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/mesa3d/src/util/ |
D | u_queue.c | 35 static void util_queue_killall_and_wait(struct util_queue *queue); 69 add_to_atexit_list(struct util_queue *queue) in add_to_atexit_list() argument 74 LIST_ADD(&queue->head, &queue_list); in add_to_atexit_list() 79 remove_from_atexit_list(struct util_queue *queue) in remove_from_atexit_list() argument 85 if (iter == queue) { in remove_from_atexit_list() 229 struct util_queue *queue; member 236 struct util_queue *queue = ((struct thread_input*)input)->queue; in util_queue_thread_func() local 241 if (queue->name) { in util_queue_thread_func() 243 util_snprintf(name, sizeof(name), "%s:%i", queue->name, thread_index); in util_queue_thread_func() 250 mtx_lock(&queue->lock); in util_queue_thread_func() [all …]
|
/external/guava/guava-tests/test/com/google/common/collect/ |
D | EvictingQueueTest.java | 44 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/perfetto/src/base/ |
D | circular_queue_unittest.cc | 28 CircularQueue<int> queue(/*initial_capacity=*/1); in TEST() local 29 ASSERT_EQ(queue.size(), 0u); in TEST() 30 queue.emplace_back(101); in TEST() 31 ASSERT_EQ(queue.size(), 1u); in TEST() 32 queue.emplace_back(102); in TEST() 33 queue.emplace_back(103); in TEST() 34 queue.emplace_back(104); in TEST() 35 ASSERT_EQ(queue.size(), 4u); in TEST() 37 auto it = queue.begin(); in TEST() 42 ASSERT_EQ(it, queue.end()); in TEST() [all …]
|
/external/python/cpython2/Doc/library/ |
D | queue.rst | 1 :mod:`Queue` --- A synchronized queue class 4 .. module:: Queue 5 :synopsis: A synchronized queue class. 8 The :mod:`Queue` module has been renamed to :mod:`queue` in Python 3. The 12 **Source code:** :source:`Lib/Queue.py` 16 The :mod:`Queue` module implements multi-producer, multi-consumer queues. 18 exchanged safely between multiple threads. The :class:`~Queue.Queue` class in this 23 The module implements three types of queue, which differ only in the order in 24 which the entries are retrieved. In a FIFO queue, the first tasks added are 25 the first retrieved. In a LIFO queue, the most recently added entry is [all …]
|
/external/squashfs-tools/squashfs-tools/ |
D | caches-queues-lists.c | 39 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/python/cpython3/Doc/library/ |
D | asyncio-queue.rst | 10 :mod:`queue` module. Although asyncio queues are not thread-safe, 14 use :func:`asyncio.wait_for` function to do queue operations with a 19 Queue chapter 22 .. class:: Queue(maxsize=0, \*, loop=None) 24 A first in, first out (FIFO) queue. 26 If *maxsize* is less than or equal to zero, the queue size is 28 ``await put()`` blocks when the queue reaches *maxsize* 31 Unlike the standard library threading :mod:`queue`, the size of 32 the queue is always known and can be returned by calling the 39 Number of items allowed in the queue. [all …]
|
D | queue.rst | 1 :mod:`queue` --- A synchronized queue class 4 .. module:: queue 5 :synopsis: A synchronized queue class. 7 **Source code:** :source:`Lib/queue.py` 11 The :mod:`queue` module implements multi-producer, multi-consumer queues. 13 exchanged safely between multiple threads. The :class:`Queue` class in this 18 The module implements three types of queue, which differ only in the order in 20 queue, the first tasks added are the first retrieved. In a 21 :abbr:`LIFO (last-in, first-out)` queue, the most recently added entry is 22 the first retrieved (operating like a stack). With a priority queue, [all …]
|
/external/webrtc/webrtc/common_audio/ |
D | swap_queue_unittest.cc | 24 // 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/ |
D | queue_obj.c | 2 * 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 …]
|
/external/iptables/extensions/ |
D | libxt_NFQUEUE.t | 3 -j NFQUEUE --queue-num 0;=;OK 4 -j NFQUEUE --queue-num 65535;=;OK 5 -j NFQUEUE --queue-num 65536;;FAIL 6 -j NFQUEUE --queue-num -1;;FAIL 8 # ERROR: cannot load: iptables -A INPUT -j NFQUEUE --queue-balance 0:65535 9 # -j NFQUEUE --queue-balance 0:65535;=;OK 10 -j NFQUEUE --queue-balance 0:65536;;FAIL 11 -j NFQUEUE --queue-balance -1:65535;;FAIL 12 -j NFQUEUE --queue-num 10 --queue-bypass;=;OK 13 -j NFQUEUE --queue-balance 0:6 --queue-cpu-fanout --queue-bypass;-j NFQUEUE --queue-balance 0:6 --q… [all …]
|
/external/python/cpython3/Lib/ |
D | queue.py | 1 '''A multi-producer, multi-consumer queue.''' 12 __all__ = ['Empty', 'Full', 'Queue', 'PriorityQueue', 'LifoQueue', 'SimpleQueue'] 19 'Exception raised by Queue.get(block=0)/get_nowait().' 23 'Exception raised by Queue.put(block=0)/put_nowait().' 27 class Queue: class 28 '''Create a queue object with a given maximum size. 30 If maxsize is <= 0, the queue size is infinite. 37 # mutex must be held whenever the queue is mutating. All methods 43 # Notify not_empty whenever an item is added to the queue; a 47 # Notify not_full whenever an item is removed from the queue; [all …]
|
/external/libchrome/base/synchronization/ |
D | condition_variable_unittest.cc | 259 WorkQueue queue(kThreadCount); // Start the threads. in TEST_F() local 266 base::AutoLock auto_lock(*queue.lock()); in TEST_F() 267 while (!queue.EveryIdWasAllocated()) in TEST_F() 268 queue.all_threads_have_ids()->Wait(); in TEST_F() 273 queue.SpinUntilAllThreadsAreWaiting(); in TEST_F() 277 base::AutoLock auto_lock(*queue.lock()); in TEST_F() 278 EXPECT_EQ(0, queue.GetNumThreadsTakingAssignments()); in TEST_F() 279 EXPECT_EQ(0, queue.GetNumThreadsCompletingTasks()); in TEST_F() 280 EXPECT_EQ(0, queue.task_count()); in TEST_F() 281 EXPECT_EQ(0, queue.GetMaxCompletionsByWorkerThread()); in TEST_F() [all …]
|
/external/python/cpython2/Lib/test/ |
D | test_queue.py | 1 # Some simple queue module tests, plus some failure conditions 2 # to ensure the Queue locks remain stable. 3 import Queue 11 # A thread to run a function that unclogs a blocked Queue. 36 # trigger_func must guarantee to change queue state so that block_func can make 92 raise RuntimeError, "Call this function with an empty queue" 93 # I guess we better check things actually queue correctly a little :) 97 target_order = dict(Queue = [111, 333, 222], 102 "Didn't seem to queue the correct data!") 105 self.assertTrue(not q.empty(), "Queue should not be empty") [all …]
|
/external/python/cpython2/Lib/ |
D | Queue.py | 1 """A multi-producer, multi-consumer queue.""" 11 __all__ = ['Empty', 'Full', 'Queue', 'PriorityQueue', 'LifoQueue'] 14 "Exception raised by Queue.get(block=0)/get_nowait()." 18 "Exception raised by Queue.put(block=0)/put_nowait()." 21 class Queue: class 22 """Create a queue object with a given maximum size. 24 If maxsize is <= 0, the queue size is infinite. 29 # mutex must be held whenever the queue is mutating. All methods 34 # Notify not_empty whenever an item is added to the queue; a 37 # Notify not_full whenever an item is removed from the queue; [all …]
|
/external/guava/guava-tests/test/com/google/common/util/concurrent/ |
D | ListenerCallQueueTest.java | 43 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/tensorflow/tensorflow/core/kernels/ |
D | queue_op.h | 33 // Defines a QueueOp, an abstract class for Queue construction ops. 46 Status VerifyResource(QueueInterface* queue) override; 55 Status CreateTypedQueue(TypedQueue* queue, QueueInterface** ret) { in CreateTypedQueue() argument 56 if (queue == nullptr) { in CreateTypedQueue() 57 return errors::ResourceExhausted("Failed to allocate queue."); in CreateTypedQueue() 59 *ret = queue; in CreateTypedQueue() 60 return queue->Initialize(); in CreateTypedQueue() 64 // Queue manipulator kernels 73 virtual void ComputeAsync(OpKernelContext* ctx, QueueInterface* queue, 86 // tensors in the given Queue. [all …]
|
D | queue_op.cc | 45 Status QueueOp::VerifyResource(QueueInterface* queue) { in VerifyResource() argument 46 return queue->MatchesNodeDef(def()); in VerifyResource() 54 QueueInterface* queue; in ComputeAsync() local 57 ctx, LookupResource(ctx, HandleFromInput(ctx, 0), &queue), callback); in ComputeAsync() 59 OP_REQUIRES_OK_ASYNC(ctx, GetResourceFromContext(ctx, "handle", &queue), in ComputeAsync() 62 ComputeAsync(ctx, queue, [callback, queue]() { in ComputeAsync() 63 queue->Unref(); in ComputeAsync() 77 // tensors in the given Queue. 80 // tuples stored in the given Queue: 81 // - Input 0: queue handle. [all …]
|
/external/python/cpython3/Lib/test/test_asyncio/ |
D | test_queues.py | 20 """Test Queue's repr or str. 22 fn is repr or str. expect_id is True if we expect the Queue's id to 23 appear in fn(Queue()). 34 q = asyncio.Queue(loop=loop) 35 self.assertTrue(fn(q).startswith('<Queue'), fn(q)) 40 q = asyncio.Queue(loop=loop) 52 q = asyncio.Queue(maxsize=1, loop=loop) 64 q = asyncio.Queue(loop=loop) 70 q = asyncio.Queue(loop=loop) 73 q = asyncio.Queue(loop=self.loop) [all …]
|
/external/google-breakpad/src/testing/gtest/samples/ |
D | sample3-inl.h | 40 // 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/googletest/googletest/samples/ |
D | sample3-inl.h | 38 // Queue is a simple queue implemented as a singled-linked list. 42 class Queue; variable 44 // QueueNode is a node in a Queue, which consists of an element of 48 friend class Queue<E>; variable 54 // Gets the next node in the queue. 73 class Queue { 75 // Creates an empty queue. 76 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue() function 78 // D'tor. Clears the queue. 79 ~Queue() { Clear(); } in ~Queue() [all …]
|
/external/python/cpython3/Lib/test/ |
D | test_queue.py | 1 # Some simple queue module tests, plus some failure conditions 2 # to ensure the Queue locks remain stable. 5 import queue 25 # A thread to run a function that unclogs a blocked Queue. 50 # trigger_func must guarantee to change queue state so that block_func can make 99 raise RuntimeError("Call this function with an empty queue") 102 # I guess we better check things actually queue correctly a little :) 106 target_order = dict(Queue = [111, 333, 222], 111 "Didn't seem to queue the correct data!") 114 self.assertTrue(q.qsize(), "Queue should not be empty") [all …]
|
/external/libcxx/include/ |
D | queue | 2 //===--------------------------- 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/ |
D | richards.js | 51 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/libchrome/base/task/sequence_manager/ |
D | task_queue_selector.cc | 59 void TaskQueueSelector::AddQueue(internal::TaskQueueImpl* queue) { in AddQueue() argument 61 DCHECK(queue->IsQueueEnabled()); in AddQueue() 62 prioritizing_selector_.AddQueue(queue, TaskQueue::kNormalPriority); in AddQueue() 65 void TaskQueueSelector::RemoveQueue(internal::TaskQueueImpl* queue) { in RemoveQueue() argument 67 if (queue->IsQueueEnabled()) { in RemoveQueue() 68 prioritizing_selector_.RemoveQueue(queue); in RemoveQueue() 72 void TaskQueueSelector::EnableQueue(internal::TaskQueueImpl* queue) { in EnableQueue() argument 74 DCHECK(queue->IsQueueEnabled()); in EnableQueue() 75 prioritizing_selector_.AddQueue(queue, queue->GetQueuePriority()); in EnableQueue() 77 task_queue_selector_observer_->OnTaskQueueEnabled(queue); in EnableQueue() [all …]
|