| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/speculative/ |
| 18-2.c | 10 * Basic test that if the queue already has room, then mq_timedsend()
35 mqd_t queue; local
39 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
40 if (queue == (mqd_t) - 1) {
48 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) == -1) {
50 mq_close(queue);
55 mq_close(queue);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
| pop_back.invalidation.pass.cpp | 40 std::deque<int> queue; local
42 queue.push_back(i);
44 while (queue.size() > 1)
46 test(queue);
47 queue.pop_back();
|
| pop_front.invalidation.pass.cpp | 40 std::deque<int> queue; local
42 queue.push_back(i);
44 while (queue.size() > 1)
46 test(queue);
47 queue.pop_back();
|
| /external/volley/src/main/java/com/android/volley/toolbox/ |
| Volley.java | 90 RequestQueue queue = new RequestQueue(new DiskBasedCache(cacheDir), network); local
91 queue.start();
92 return queue;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| EvictingQueueTest.java | 44 EvictingQueue<String> queue = EvictingQueue.create(0); local
45 assertEquals(0, queue.size());
47 assertTrue(queue.add("hi"));
48 assertEquals(0, queue.size());
50 assertTrue(queue.offer("hi"));
51 assertEquals(0, queue.size());
53 assertFalse(queue.remove("hi"));
54 assertEquals(0, queue.size());
57 queue.element();
61 assertNull(queue.peek())
70 EvictingQueue<String> queue = EvictingQueue.create(0); local
75 EvictingQueue<String> queue = EvictingQueue.create(1); local
82 EvictingQueue<String> queue = EvictingQueue.create(3); local
93 EvictingQueue<String> queue = EvictingQueue.create(1); local
115 EvictingQueue<String> queue = EvictingQueue.create(3); local
139 EvictingQueue<String> queue = EvictingQueue.create(3); local
164 EvictingQueue<String> queue = EvictingQueue.create(5); local
[all...] |
| /libcore/benchmarks/src/benchmarks/ |
| ReferenceBenchmark.java | 34 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); local
36 new PhantomReference(object, queue);
42 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); local
44 (new PhantomReference<Object>(object, queue)).enqueue();
50 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); local
52 (new PhantomReference<Object>(object, queue)).enqueue();
55 queue.poll();
61 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); local
63 (new PhantomReference<Object>(object, queue)).enqueue();
67 queue.remove()
77 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| 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...] |
| /external/guava/guava/src/com/google/common/base/ |
| FinalizablePhantomReference.java | 38 * @param queue that should finalize the referent
40 protected FinalizablePhantomReference(T referent, FinalizableReferenceQueue queue) {
41 super(referent, queue.queue);
42 queue.cleanUp();
|
| FinalizableSoftReference.java | 36 * @param queue that should finalize the referent
38 protected FinalizableSoftReference(T referent, FinalizableReferenceQueue queue) {
39 super(referent, queue.queue);
40 queue.cleanUp();
|
| FinalizableWeakReference.java | 36 * @param queue that should finalize the referent
38 protected FinalizableWeakReference(T referent, FinalizableReferenceQueue queue) {
39 super(referent, queue.queue);
40 queue.cleanUp();
|
| /external/libcxx/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();
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/ |
| 13-1.c | 30 mqd_t queue; local
38 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
39 if (queue == (mqd_t) - 1) {
45 if (mq_getattr(queue, &attrget) != 0) {
48 mq_close(queue);
60 mq_close(queue);
65 mq_close(queue);
|
| 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);
|
| 25-2.c | 35 mqd_t queue; local
44 queue = mq_open(qname, O_CREAT | O_RDWR,
46 if (queue != (mqd_t) - 1) {
49 mq_close(queue);
74 queue = mq_open(qname, O_CREAT | O_RDWR,
76 if (queue != (mqd_t) - 1) {
79 mq_close(queue);
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_send/ |
| 11-1.c | 11 * message queue descriptor.
31 mqd_t queue; local
36 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
37 if (queue == (mqd_t) - 1) {
42 if (mq_send(queue + 1, msgptr, strlen(msgptr), 1) != -1) {
43 printf("mq_send() did not return -1 on invalid queue\n");
52 if (mq_close(queue) != 0) {
|
| 11-2.c | 31 mqd_t queue; local
36 queue = mq_open(qname, O_CREAT | O_RDONLY, S_IRUSR | S_IWUSR, NULL);
37 if (queue == (mqd_t) - 1) {
42 if (mq_send(queue, msgptr, strlen(msgptr), 1) != -1) {
43 printf("mq_send() did not return -1 on invalid queue\n");
52 if (mq_close(queue) != 0) {
|
| 2-1.c | 30 mqd_t queue; local
39 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
40 if (queue == (mqd_t) - 1) {
45 if (mq_send(queue, msgptr, strlen(msgptr), 1) == 0) {
50 if (mq_close(queue) != 0) {
|
| 4-1.c | 30 mqd_t queue; local
35 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
36 if (queue == (mqd_t) - 1) {
41 if (mq_send(queue, msgptr, strlen(msgptr), MQ_PRIO_MAX + 1) == 0) {
46 if (mq_close(queue) != 0) {
|
| 4-2.c | 30 mqd_t queue; local
35 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
36 if (queue == (mqd_t) - 1) {
41 if (mq_send(queue, msgptr, strlen(msgptr), MQ_PRIO_MAX) == 0) {
46 if (mq_close(queue) != 0) {
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/ |
| 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) {
|
| 4-1.c | 32 mqd_t queue; local
37 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
38 if (queue == (mqd_t) - 1) {
45 if (mq_timedsend(queue, msgptr, strlen(msgptr), MQ_PRIO_MAX + 1, &ts)
51 if (mq_close(queue) != 0) {
|
| 4-2.c | 32 mqd_t queue; local
37 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
38 if (queue == (mqd_t) - 1) {
45 if (mq_timedsend(queue, msgptr, strlen(msgptr), MQ_PRIO_MAX, &ts)
51 if (mq_close(queue) != 0) {
|
| /external/python/cpython2/Lib/ |
| 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...] |
