| /frameworks/base/libs/hwui/tests/unit/ |
| LayerUpdateQueueTests.cpp | 28 LayerUpdateQueue queue; local
29 EXPECT_TRUE(queue.entries().empty());
44 LayerUpdateQueue queue; local
45 queue.enqueueLayerWithDamage(a.get(), Rect(25, 25, 75, 75));
46 queue.enqueueLayerWithDamage(b.get(), Rect(100, 100, 300, 300));
47 queue.enqueueLayerWithDamage(c.get(), Rect(.5, .5, .5, .5));
49 EXPECT_EQ(3u, queue.entries().size());
51 EXPECT_EQ(a.get(), queue.entries()[0].renderNode.get());
52 EXPECT_EQ(Rect(25, 25, 75, 75), queue.entries()[0].damage);
53 EXPECT_EQ(b.get(), queue.entries()[1].renderNode.get())
62 LayerUpdateQueue queue; local
75 LayerUpdateQueue queue; local
[all...] |
| /packages/apps/Bluetooth/src/com/android/bluetooth/newavrcp/helpers/ |
| MediaData.java | 28 public List<Metadata> queue; field in class:MediaData
35 queue = q;
53 if (!Objects.equals(queue, u.queue)) {
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| sched.py | 3 Each instance of this class manages its own queue.
13 function is allowed to modify the queue. Time can be expressed as
18 way the queue can be maintained as a priority queue. Execution of the
47 """Enter a new event in the queue at an absolute time.
67 """Remove an event from the queue.
70 If the event is not in the queue, this raises ValueError.
77 """Check whether the queue is empty."""
81 """Execute events until the queue is empty.
84 delay function is called and the event is left in the queue;
123 def queue(self): member in class:scheduler
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| sched.py | 3 Each instance of this class manages its own queue.
13 function is allowed to modify the queue. Time can be expressed as
18 way the queue can be maintained as a priority queue. Execution of the
47 """Enter a new event in the queue at an absolute time.
67 """Remove an event from the queue.
70 If the event is not in the queue, this raises ValueError.
77 """Check whether the queue is empty."""
81 """Execute events until the queue is empty.
84 delay function is called and the event is left in the queue;
123 def queue(self): member in class:scheduler
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
| erase_iter.invalidation.pass.cpp | 60 std::deque<int> queue; local
62 queue.push_back(i);
64 while (queue.size() > 1)
66 del_at_start(queue);
67 del_at_end(queue);
68 queue.pop_back();
|
| erase_iter_iter.invalidation.pass.cpp | 65 std::deque<int> queue; local
67 queue.push_back(i);
69 while (queue.size() > 1)
71 for (size_t i = 1; i < queue.size(); ++i)
73 del_at_start(queue, i);
74 del_at_end (queue, i);
76 queue.pop_back();
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| sched.py | 3 Each instance of this class manages its own queue.
13 function is allowed to modify the queue. Time can be expressed as
18 way the queue can be maintained as a priority queue. Execution of the
47 """Enter a new event in the queue at an absolute time.
67 """Remove an event from the queue.
70 If the event is not in the queue, this raises ValueError.
77 """Check whether the queue is empty."""
81 """Execute events until the queue is empty.
84 delay function is called and the event is left in the queue;
123 def queue(self): member in class:scheduler
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| sched.py | 3 Each instance of this class manages its own queue.
13 function is allowed to modify the queue. Time can be expressed as
18 way the queue can be maintained as a priority queue. Execution of the
47 """Enter a new event in the queue at an absolute time.
67 """Remove an event from the queue.
70 If the event is not in the queue, this raises ValueError.
77 """Check whether the queue is empty."""
81 """Execute events until the queue is empty.
84 delay function is called and the event is left in the queue;
123 def queue(self): member in class:scheduler
[all...] |
| /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/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| MonitorBenchmark.java | 37 private BlockingQueue<String> queue; field in class:MonitorBenchmark
47 queue = (BlockingQueue<String>) constructor.newInstance(capacity);
57 BlockingQueue<String> queue = this.queue; local
61 queue.add(strings[j]);
64 queue.remove();
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/visitor/ |
| TreeVisitor.java | 28 import java.util.Queue;
87 final Queue<Node> queue = new LinkedList<>(); local
88 queue.offer(node);
89 while (queue.size() > 0) {
90 final Node head = queue.peek();
92 queue.offer(child);
94 process(queue.poll());
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| AbstractQueueTest.java | 31 private MockAbstractQueue<Object> queue; field in class:AbstractQueueTest
113 queue.add(null);
127 queue.add(o);
131 queue.add(o);
145 queue.add(o);
148 queue.add(I);
149 assertTrue(queue.contains(I));
150 Iterator iter = queue.iterator();
162 queue.addAll(null);
175 queue.addAll(list)
254 MockAbstractQueue queue = new MockAbstractQueue(); local
[all...] |
| /external/volley/src/test/java/com/android/volley/ |
| RequestQueueIntegrationTest.java | 87 RequestQueue queue = new RequestQueue(new NoCache(), mMockNetwork, 1, mDelivery); local
88 queue.addRequestFinishedListener(mMockListener);
89 queue.add(lowerPriorityReq);
90 queue.add(higherPriorityReq);
91 queue.start();
99 queue.stop();
119 RequestQueue queue = new RequestQueue(new NoCache(), mMockNetwork, 3, mDelivery); local
120 queue.addRequestFinishedListener(mMockListener);
121 queue.add(req1);
122 queue.add(req2)
144 RequestQueue queue = new RequestQueue(new NoCache(), mMockNetwork, 1, mDelivery); local
160 RequestQueue queue = new RequestQueue(new NoCache(), mMockNetwork, 1, mDelivery); local
176 RequestQueue queue = new RequestQueue(new NoCache(), mMockNetwork, 1, mDelivery); local
[all...] |
| /packages/apps/Dialer/java/com/android/voicemail/impl/scheduling/ |
| TaskQueue.java | 30 import java.util.Queue;
33 * A queue that manages priority and duplication of {@link Task}. A task is identified by a {@link
39 private final Queue<Task> queue = new ArrayDeque<>(); field in class:TaskQueue
42 List<Bundle> result = new ArrayList<>(queue.size());
43 for (Task task : queue) {
50 Assert.isTrue(queue.isEmpty());
59 * Add a new task to the queue. A new task with a TaskId collision will be discarded, and {@link
77 queue.add(task);
82 queue.remove(task)
[all...] |
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| ListenerCallQueueTest.java | 43 ListenerCallQueue<Object> queue = local
47 queue.add(incrementingCallback(counter, 1));
48 queue.add(incrementingCallback(counter, 2));
49 queue.add(incrementingCallback(counter, 3));
50 queue.add(incrementingCallback(counter, 4));
52 queue.execute();
58 ListenerCallQueue<Object> queue = local
62 queue.add(incrementingCallback(counter, 1));
63 queue.add(THROWING_CALLBACK);
64 queue.add(incrementingCallback(counter, 2))
78 ListenerCallQueue<Object> queue = local
100 ListenerCallQueue<Object> queue = local
[all...] |
| /external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/tls/ |
| CertificateChainCleaner.java | 60 Deque<Certificate> queue = new ArrayDeque<>(chain); local
62 result.add(queue.removeFirst());
86 for (Iterator<Certificate> i = queue.iterator(); i.hasNext(); ) {
|
| /external/dhcpcd-6.8.2/ |
| control.h | 33 /* Limit queue size per fd */
49 struct fd_data_head queue; member in struct:fd_list
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/ |
| 16-1.c | 11 * message queue exists are atomic.
46 mqd_t childqueue, queue; local
52 queue = (mqd_t) - 1;
105 queue = mq_open(qname, O_CREAT | O_EXCL | O_RDWR,
107 if (queue != (mqd_t) - 1) {
119 mq_close(queue);
127 mq_close(queue);
|
| 19-1.c | 10 * Test that mq_open() does not add messages to the queue or remove
11 * messages from the queue.
14 * - Call mq_open() for non-blocking queue
15 * - Verify mq_receive() fails (because nothing should be in the queue yet)
16 * - Call mq_send() to put something in the queue
17 * - Call mq_open() again for non-blocking queue
19 * still be in the queue).
42 mqd_t queue; local
52 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
54 if (queue == (mqd_t) - 1)
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_send/ |
| 1-1.c | 35 mqd_t queue; local
44 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
45 if (queue == (mqd_t) - 1) {
50 if (mq_send(queue, msgptr, strlen(msgptr), 1) != 0) {
55 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
65 if (mq_close(queue) != 0) {
|
| 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) {
|
| 4-3.c | 36 mqd_t queue; local
45 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
46 if (queue == (mqd_t) - 1) {
51 if (mq_send(queue, msgptr, strlen(msgptr), MQ_PRIO_MAX - 1) != 0) {
56 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
66 if (mq_close(queue) != 0) {
|
| 8-1.c | 35 mqd_t queue; local
44 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
45 if (queue == (mqd_t) - 1) {
50 ret = mq_send(queue, msgptr, strlen(msgptr), 1);
52 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
63 if (mq_close(queue) != 0) {
|
