Lines Matching defs:TASKS
178 * when tasks complete
400 * getTaskCount increases, but doesn't overestimate, when tasks submitted
403 final int TASKS = 3;
421 for (int i = 0; i < TASKS; i++) {
426 assertEquals(1 + TASKS, p.getTaskCount());
430 assertEquals(1 + TASKS, p.getTaskCount());
433 assertEquals(1 + TASKS, p.getTaskCount());
434 assertEquals(1 + TASKS, p.getCompletedTaskCount());
541 * getQueue returns the work queue, which contains queued tasks
552 FutureTask[] tasks = new FutureTask[5];
553 for (int i = 0; i < tasks.length; i++) {
561 tasks[i] = new FutureTask(task);
562 p.execute(tasks[i]);
566 assertFalse(q.contains(tasks[0]));
567 assertTrue(q.contains(tasks[tasks.length - 1]));
568 assertEquals(tasks.length - 1, q.size());
583 Runnable[] tasks = new Runnable[6];
585 for (int i = 0; i < tasks.length; i++) {
586 tasks[i] = new CheckedRunnable() {
591 p.execute(tasks[i]);
594 assertFalse(p.remove(tasks[0]));
595 assertTrue(q.contains(tasks[4]));
596 assertTrue(q.contains(tasks[3]));
597 assertTrue(p.remove(tasks[4]));
598 assertFalse(p.remove(tasks[4]));
599 assertFalse(q.contains(tasks[4]));
600 assertTrue(q.contains(tasks[3]));
601 assertTrue(p.remove(tasks[3]));
602 assertFalse(q.contains(tasks[3]));
607 * purge removes cancelled tasks from the queue
618 FutureTask[] tasks = new FutureTask[5];
619 for (int i = 0; i < tasks.length; i++) {
626 tasks[i] = new FutureTask(task);
627 p.execute(tasks[i]);
630 assertEquals(tasks.length, p.getTaskCount());
631 assertEquals(tasks.length - 1, q.size());
634 tasks[4].cancel(true);
635 tasks[3].cancel(false);
637 assertEquals(tasks.length - 3, q.size());
638 assertEquals(tasks.length - 2, p.getTaskCount());
640 assertEquals(tasks.length - 3, q.size());
641 assertEquals(tasks.length - 2, p.getTaskCount());
646 * shutdownNow returns a list containing tasks that were not run,
647 * and those tasks are drained from the queue
1149 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5];
1150 for (int i = 0; i < tasks.length; i++)
1151 tasks[i] = new TrackedNoOpRunnable();
1152 for (int i = 0; i < tasks.length; i++)
1153 p.execute(tasks[i]);
1154 for (int i = 1; i < tasks.length; i++)
1155 assertTrue(tasks[i].done);
1156 assertFalse(tasks[0].done); // waiting in queue
1166 final TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5];
1167 for (int i = 0; i < tasks.length; ++i)
1168 tasks[i] = new TrackedNoOpRunnable();
1177 for (TrackedNoOpRunnable task : tasks)
1179 for (int i = 1; i < tasks.length; i++)
1180 assertFalse(tasks[i].done);
1182 for (int i = 1; i < tasks.length; i++)
1183 assertFalse(tasks[i].done);
1184 assertTrue(tasks[0].done); // was waiting in queue
1641 * invokeAll(c) returns results of all completed tasks
1864 * timed invokeAll(c) returns results of all completed tasks
1884 * timed invokeAll(c) cancels tasks not completed by timeout
1899 List<Callable<String>> tasks = new ArrayList<>();
1900 tasks.add(new StringTask("0"));
1901 tasks.add(waiter);
1902 tasks.add(new StringTask("2"));
1905 p.invokeAll(tasks, timeout, MILLISECONDS);
1906 assertEquals(tasks.size(), futures.size());
1935 final int TASKS = 100;
1936 final CountDownLatch done = new CountDownLatch(TASKS);
1937 for (int k = 0; k < TASKS; ++k)
2034 // enough time to run all tasks
