Lines Matching defs:TASKS
325 * when tasks complete
547 * getTaskCount increases, but doesn't overestimate, when tasks submitted
550 final int TASKS = 3;
568 for (int i = 0; i < TASKS; i++) {
573 assertEquals(1 + TASKS, p.getTaskCount());
577 assertEquals(1 + TASKS, p.getTaskCount());
580 assertEquals(1 + TASKS, p.getTaskCount());
581 assertEquals(1 + TASKS, p.getCompletedTaskCount());
656 * getQueue returns the work queue, which contains queued tasks
667 FutureTask[] tasks = new FutureTask[5];
668 for (int i = 0; i < tasks.length; i++) {
676 tasks[i] = new FutureTask(task);
677 p.execute(tasks[i]);
681 assertFalse(q.contains(tasks[0]));
682 assertTrue(q.contains(tasks[tasks.length - 1]));
683 assertEquals(tasks.length - 1, q.size());
698 Runnable[] tasks = new Runnable[6];
700 for (int i = 0; i < tasks.length; i++) {
701 tasks[i] = new CheckedRunnable() {
706 p.execute(tasks[i]);
709 assertFalse(p.remove(tasks[0]));
710 assertTrue(q.contains(tasks[4]));
711 assertTrue(q.contains(tasks[3]));
712 assertTrue(p.remove(tasks[4]));
713 assertFalse(p.remove(tasks[4]));
714 assertFalse(q.contains(tasks[4]));
715 assertTrue(q.contains(tasks[3]));
716 assertTrue(p.remove(tasks[3]));
717 assertFalse(q.contains(tasks[3]));
722 * purge removes cancelled tasks from the queue
733 FutureTask[] tasks = new FutureTask[5];
734 for (int i = 0; i < tasks.length; i++) {
741 tasks[i] = new FutureTask(task);
742 p.execute(tasks[i]);
745 assertEquals(tasks.length, p.getTaskCount());
746 assertEquals(tasks.length - 1, q.size());
749 tasks[4].cancel(true);
750 tasks[3].cancel(false);
752 assertEquals(tasks.length - 3, q.size());
753 assertEquals(tasks.length - 2, p.getTaskCount());
755 assertEquals(tasks.length - 3, q.size());
756 assertEquals(tasks.length - 2, p.getTaskCount());
761 * shutdownNow returns a list containing tasks that were not run,
762 * and those tasks are drained from the queue
1179 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5];
1180 for (int i = 0; i < tasks.length; i++)
1181 tasks[i] = new TrackedNoOpRunnable();
1182 for (int i = 0; i < tasks.length; i++)
1183 p.execute(tasks[i]);
1184 for (int i = 1; i < tasks.length; i++)
1185 assertTrue(tasks[i].done);
1186 assertFalse(tasks[0].done); // waiting in queue
1194 final TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5];
1195 for (int i = 0; i < tasks.length; ++i)
1196 tasks[i] = new TrackedNoOpRunnable();
1206 for (TrackedNoOpRunnable task : tasks)
1208 for (int i = 1; i < tasks.length; i++)
1209 assertFalse(tasks[i].done);
1211 for (int i = 1; i < tasks.length; i++)
1212 assertFalse(tasks[i].done);
1213 assertTrue(tasks[0].done); // was waiting in queue
1634 * invokeAll(c) returns results of all completed tasks
1857 * timed invokeAll(c) returns results of all completed tasks
1877 * timed invokeAll(c) cancels tasks not completed by timeout
1892 List<Callable<String>> tasks = new ArrayList<>();
1893 tasks.add(new StringTask("0"));
1894 tasks.add(waiter);
1895 tasks.add(new StringTask("2"));
1898 p.invokeAll(tasks, timeout, MILLISECONDS);
1899 assertEquals(tasks.size(), futures.size());
1928 final int TASKS = 100;
1929 final CountDownLatch done = new CountDownLatch(TASKS);
1930 for (int k = 0; k < TASKS; ++k)
