| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/ |
| huffman_codec.h | 23 #include <queue>
72 // The queue is sorted in ascending order by weight (or by node id if
78 queue(std::bind(&HuffmanCodec::LeftIsBigger, this,
82 // Put all leaves in the queue.
88 queue.push(node);
92 // and pushing the root of the new tree in the queue.
94 // We push a node at the end of each iteration, so the queue is never
97 assert(!queue.empty());
98 const uint32_t right = queue.top();
99 queue.pop()
182 std::queue<std::pair<uint32_t, std::string>> queue; local
359 std::queue<Context> queue; local
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldPriorityQueueTest.java | 28 PriorityQueue<Object> queue = new PriorityQueue<Object>(100); local
29 assertNotNull(queue);
30 assertEquals(0, queue.size());
31 assertNull(queue.comparator());
42 PriorityQueue<String> queue = new PriorityQueue<String>(10, local
46 queue.offer(array[i]);
48 assertFalse(queue.contains("BB"));
51 assertFalse(queue.remove("BB"));
52 assertTrue(queue.remove("AA"));
|
| /external/libchrome/base/threading/ |
| thread_collision_warner_unittest.cc | 152 explicit QueueUser(NonThreadSafeQueue* queue) : queue_(queue) {}
165 NonThreadSafeQueue queue(local_reporter);
167 QueueUser queue_user_a(&queue);
168 QueueUser queue_user_b(&queue);
183 // Queue with a 5 seconds push execution time, hopefuly the two used threads
209 explicit QueueUser(NonThreadSafeQueue* queue) : queue_(queue) {}
222 NonThreadSafeQueue queue(local_reporter);
224 QueueUser queue_user_a(&queue);
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/ |
| 20-1.c | 10 * Another basic test that mq_open() returns a valid message queue
14 * message queue descriptor returned.
40 mqd_t queue; local
47 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
48 if (queue == (mqd_t) - 1) {
61 if (mq_notify(queue, &ev) != 0) {
66 mq_close(queue);
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_send/ |
| 10-1.c | 10 * Test that if O_NONBLOCK is set and the message queue is full, mq_send()
35 mqd_t queue; local
43 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
45 if (queue == (mqd_t) - 1) {
52 if (mq_send(queue, msgptr, strlen(msgptr), 1) == -1) {
62 if (mq_close(queue) != 0) {
73 printf("Test inconclusive: Couldn't fill message queue\n");
|
| 13-1.c | 37 mqd_t queue; local
42 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
43 if (queue == (mqd_t) - 1) {
49 if (mq_send(queue, msgptr, strlen(msgptr), invalidpri[i]) == 0) {
61 if (mq_close(queue) != 0) {
|
| 14-1.c | 36 mqd_t queue; local
46 queue =
48 if (queue == (mqd_t) - 1) {
53 if (mq_send(queue, msgptr, strlen(msgptr), 1) != -1) {
63 if (mq_close(queue) != 0) {
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/ |
| 10-1.c | 10 * Test that if O_NONBLOCK is set and the message queue is full, mq_timedsend()
38 mqd_t queue; local
45 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
47 if (queue == (mqd_t) - 1) {
56 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) == -1) {
66 if (mq_close(queue) != 0) {
77 printf("Test inconclusive: Couldn't fill message queue\n");
|
| 11-1.c | 11 * message queue descriptor.
33 mqd_t queue; local
38 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
39 if (queue == (mqd_t) - 1) {
46 if (mq_timedsend(queue + 1, msgptr, strlen(msgptr), 1, &ts) != -1) {
47 printf("mq_timedsend() did not return -1 on invalid queue\n");
56 if (mq_close(queue) != 0) {
|
| 11-2.c | 33 mqd_t queue; local
38 queue = mq_open(qname, O_CREAT | O_RDONLY, S_IRUSR | S_IWUSR, NULL);
39 if (queue == (mqd_t) - 1) {
46 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) != -1) {
47 printf("mq_timedsend() did not return -1 on invalid queue\n");
56 if (mq_close(queue) != 0) {
|
| 13-1.c | 39 mqd_t queue; local
44 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
45 if (queue == (mqd_t) - 1) {
53 if (mq_timedsend(queue, msgptr,
66 if (mq_close(queue) != 0) {
|
| 14-1.c | 38 mqd_t queue; local
50 queue =
52 if (queue == (mqd_t) - 1) {
58 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) != -1) {
68 if (mq_close(queue) != 0) {
|
| 2-1.c | 32 mqd_t queue; local
41 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
42 if (queue == (mqd_t) - 1) {
49 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) == 0) {
54 if (mq_close(queue) != 0) {
|
| /system/core/adb/ |
| adb_utils.h | 59 // A thread-safe blocking queue.
64 std::vector<T> queue; member in class:BlockingQueue
70 queue.push_back(t);
81 cv.wait(lock, [this]() { return !queue.empty(); });
82 popped = std::move(queue);
83 queue.clear();
|
| /external/eigen/bench/tensors/ |
| tensor_benchmarks_sycl.cc | 14 cl::sycl::queue sycl_queue() {
15 return cl::sycl::queue(device_selector(), [=](cl::sycl::exception_list l) {
29 cl::sycl::queue q = sycl_queue<cl::sycl::gpu_selector>(); \
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.cons.alloc/ |
| ctor_alloc.pass.cpp | 10 // <queue>
13 // explicit queue(const Alloc& a);
15 #include <queue>
22 : private std::queue<int, std::deque<int, test_allocator<int> > >
24 typedef std::queue<int, std::deque<int, test_allocator<int> > > base;
|
| ctor_queue_alloc.pass.cpp | 10 // <queue>
13 // queue(const queue& q, const Alloc& a);
15 #include <queue>
34 : public std::queue<T, C>
36 typedef std::queue<T, C> base;
|
| /external/webrtc/webrtc/test/ |
| fake_network_pipe.h | 14 #include <queue>
37 // Queue length in number of packets.
76 std::queue<NetworkPacket*> capacity_link_;
77 std::queue<NetworkPacket*> delay_link_;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.cons.alloc/ |
| ctor_alloc.pass.cpp | 10 // <queue>
13 // explicit queue(const Alloc& a);
15 #include <queue>
22 : private std::queue<int, std::deque<int, test_allocator<int> > >
24 typedef std::queue<int, std::deque<int, test_allocator<int> > > base;
|
| ctor_queue_alloc.pass.cpp | 10 // <queue>
13 // queue(const queue& q, const Alloc& a);
15 #include <queue>
34 : public std::queue<T, C>
36 typedef std::queue<T, C> base;
|
| /system/bt/vendor_libs/test_vendor_lib/include/ |
| connection.h | 20 #include <queue>
61 // Add an action to the connection queue.
64 // Execute the next action in the connection queue to simulate packet
86 std::queue<TaskCallback> actions_;
89 std::queue<std::vector<uint8_t>> messages_;
|
| /test/vti/dashboard/src/main/java/com/android/vts/util/ |
| TaskQueueHelper.java | 16 import com.google.appengine.api.taskqueue.Queue;
23 /** TaskQueueHelper, a helper class for interacting with App Engine Task Queue API. */
29 * Add the list of tasks to the provided queue.
31 * @param queue The task queue in which to insert the tasks.
34 public static void addToQueue(Queue queue, List<TaskOptions> tasks) {
39 queue.addAsync(puts);
42 logger.log(Level.SEVERE, "Too many tasks batched in the task queue API.");
47 queue.addAsync(puts)
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| queue_ops.cc | 35 QueueInterface* queue; variable
38 ctx, LookupResource(ctx, HandleFromInput(ctx, 0), &queue), callback);
40 OP_REQUIRES_OK_ASYNC(ctx, GetResourceFromContext(ctx, "handle", &queue),
43 ComputeAsync(ctx, queue, [callback, queue]() {
44 queue->Unref();
50 virtual void ComputeAsync(OpKernelContext* ctx, QueueInterface* queue,
69 // tensors in the given Queue.
72 // tuples stored in the given Queue:
73 // - Input 0: queue handle
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| ICUNotifier.java | 98 * Queue a notification on the notification thread for the current
110 notifyThread.queue(listeners.toArray(new EventListener[listeners.size()]));
120 private final List<EventListener[]> queue = new ArrayList<EventListener[]>(); field in class:ICUNotifier.NotifyThread
127 * Queue the notification on the thread.
129 public void queue(EventListener[] list) { method in class:ICUNotifier.NotifyThread
131 queue.add(list);
146 while (queue.isEmpty()) {
149 list = queue.remove(0);
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| ICUNotifier.java | 96 * Queue a notification on the notification thread for the current
108 notifyThread.queue(listeners.toArray(new EventListener[listeners.size()]));
118 private final List<EventListener[]> queue = new ArrayList<EventListener[]>(); field in class:ICUNotifier.NotifyThread
125 * Queue the notification on the thread.
127 public void queue(EventListener[] list) { method in class:ICUNotifier.NotifyThread
129 queue.add(list);
144 while (queue.isEmpty()) {
147 list = queue.remove(0);
|
