| /external/v8/testing/gtest/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {}
79 // D'tor. Clears the queue
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {}
79 // D'tor. Clears the queue
[all...] |
| /prebuilts/ndk/r16/sources/third_party/googletest/googletest/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {}
79 // D'tor. Clears the queue
[all...] |
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/tests/gtest-1.7.0/samples/ |
| sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list.
44 class Queue;
46 // QueueNode is a node in a Queue, which consists of an element of
50 friend class Queue<E>;
56 // Gets the next node in the queue.
74 class Queue {
76 // Creates an empty queue.
77 Queue() : head_(NULL), last_(NULL), size_(0) {}
79 // D'tor. Clears the queue
[all...] |
| /external/llvm/unittests/ExecutionEngine/Orc/ |
| RPCUtilsTest.cpp | 14 #include <queue>
20 class Queue : public std::queue<char> {
30 QueueChannel(Queue &InQueue, Queue &OutQueue)
60 Queue &InQueue;
61 Queue &OutQueue;
81 Queue Q1, Q2;
87 EXPECT_TRUE(!!ResOrErr) << "Simple call over queue failed";
95 EXPECT_FALSE(EC) << "Simple expect over queue failed"
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 1 //===---- LatencyPriorityQueue.h - A latency-oriented priority queue ------===//
24 /// Sorting functions for the Available queue.
37 /// Queue, the number of nodes that the node is the sole unscheduled
42 /// Queue - The queue.
43 std::vector<SUnit*> Queue;
78 bool empty() const { return Queue.empty(); }
|
| /hardware/qcom/media/msm8974/mm-video-legacy/vidc/vdec/src/ |
| queue.c | 29 Queue with Linked list
32 #include "queue.h"
43 struct Queue
50 Queue *alloc_queue()
52 Queue *q = (Queue *) malloc(sizeof(Queue));
61 void free_queue(Queue *q)
69 void free_queue_and_qelement(Queue *q)
79 int push(Queue *q, void * element
[all...] |
| /hardware/qcom/media/msm8974/mm-video-v4l2/vidc/vdec/src/ |
| queue.c | 29 Queue with Linked list
32 #include "queue.h"
42 struct Queue {
48 Queue *alloc_queue()
50 Queue *q = (Queue *) malloc(sizeof(Queue));
60 void free_queue(Queue *q)
67 void free_queue_and_qelement(Queue *q)
77 int push(Queue *q, void * element
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| 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:
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/python/cpython2/Lib/ |
| 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:
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/python/cpython3/Lib/ |
| 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:
22 '''Create a queue object with a given maximum size.
24 If maxsize is <= 0, the queue size is infinite.
31 # mutex must be held whenever the queue is mutating. All methods
37 # Notify not_empty whenever an item is added to the queue; a
41 # Notify not_full whenever an item is removed from the queue;
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| 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:
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...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| 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:
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...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| 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:
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...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| 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:
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...] |
| /device/google/cuttlefish_common/common/vsoc/shm/ |
| socket_forward_layout.h | 36 // If both are closed then the queue goes back to INACTIVE
42 struct Queue {
46 CircularPacketQueue<16, kMaxPacketSize> queue; member in struct:vsoc::layout::socket_forward::Queue
51 return queue.Recover();
54 ASSERT_SHM_COMPATIBLE(Queue);
57 static constexpr size_t layout_size = 2 * Queue::layout_size + 8;
60 Queue host_to_guest;
62 Queue guest_to_host;
|
| /device/linaro/bootloader/OpenPlatformPkg/Drivers/Net/Pp2Dxe/ |
| Mvpp2Lib.h | 625 * Update Rx Queue status with the number of occupied and available
695 INT32 Queue = Mvpp2Fls(Cause) - 1;
697 return &Port->Rxqs[Queue];
708 INT32 Queue = Mvpp2Fls(Cause) - 1;
710 return &Port->Txqs[Queue];
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| vktSparseResourcesBase.hpp | 41 struct Queue
78 const Queue& getQueue (const vk::VkQueueFlags queueFlags, const deUint32 queueIndex) const;
89 std::map<vk::VkQueueFlags, std::vector<Queue> > m_queues;
|
| /external/llvm/include/llvm/CodeGen/ |
| ResourcePriorityQueue.h | 1 //===----- ResourcePriorityQueue.h - A DFA-oriented priority queue -------===//
30 /// Sorting functions for the Available queue.
43 /// Queue, the number of nodes that the node is the sole unscheduled
48 /// Queue - The queue.
49 std::vector<SUnit*> Queue;
115 bool empty() const override { return Queue.empty(); }
|
| /external/llvm/lib/CodeGen/ |
| RegAllocBasic.cpp | 38 #include <queue>
69 CompSpillWeight> Queue;
91 Queue.push(LI);
95 if (Queue.empty())
97 LiveInterval *LI = Queue.top();
98 Queue.pop();
|
| /external/llvm/lib/Target/Hexagon/ |
| RDFDeadCode.cpp | 21 #include <queue>
27 // SetVector as a work queue, and popping the first element from it.
29 SetQueue() : Set(), Queue() {}
32 return Queue.empty();
35 T V = Queue.front();
36 Queue.pop();
43 Queue.push(V);
49 std::queue<T> Queue;
|
| /external/python/cpython2/Lib/multiprocessing/ |
| __init__.py | 51 'Event', 'Queue', 'JoinableQueue', 'Pool', 'Value', 'Array',
94 The managers methods such as `Lock()`, `Condition()` and `Queue()`
213 def Queue(maxsize=0):
215 Returns a queue object
217 from multiprocessing.queues import Queue
218 return Queue(maxsize)
222 Returns a queue object
|
| queues.py | 35 __all__ = ['Queue', 'SimpleQueue', 'JoinableQueue']
45 from Queue import Empty, Full
53 # Queue type using a pipe, buffer and thread
56 class Queue(object):
74 register_after_fork(self, Queue._after_fork)
87 debug('Queue._after_fork()')
168 debug('Queue.join_thread()')
174 debug('Queue.cancel_join_thread()')
182 debug('Queue._start_thread()')
187 target=Queue._feed
[all...] |
| /external/python/cpython3/Lib/asyncio/ |
| queues.py | 3 __all__ = ['Queue', 'PriorityQueue', 'LifoQueue', 'QueueFull', 'QueueEmpty']
15 """Exception raised when Queue.get_nowait() is called on a Queue object
22 """Exception raised when the Queue.put_nowait() method is called on a Queue
28 class Queue:
29 """A queue, useful for coordinating producer and consumer coroutines.
31 If maxsize is less than or equal to zero, the queue size is infinite. If it
33 queue reaches maxsize, until an item is removed by get().
35 Unlike the standard library Queue, you can reliably know this Queue's siz
[all...] |
| /external/python/cpython3/Lib/multiprocessing/ |
| queues.py | 10 __all__ = ['Queue', 'SimpleQueue', 'JoinableQueue']
20 from queue import Empty, Full
31 # Queue type using a pipe, buffer and thread
34 class Queue(object):
55 register_after_fork(self, Queue._after_fork)
68 debug('Queue._after_fork()')
142 debug('Queue.join_thread()')
148 debug('Queue.cancel_join_thread()')
156 debug('Queue._start_thread()')
161 target=Queue._feed
[all...] |
