Lines Matching defs:queue
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<>();
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);
87 for (Task task : queue) {
120 for (Task task : queue) {
134 queue.clear();
138 return queue.size();
142 return queue.isEmpty();
147 return queue.iterator();
