在Java中如何使用PriorityBlockingQueue实现优先队列

class Task implements Comparable<Task> {
    private int priority;
    private String name;

    public Task(int priority, String name) {
        this.priority = priority;
        this.name = name;
    }

    @Override
    public int compareTo(Task other) {
        // 优先级数值越小，优先级越高
        return Integer.compare(this.priority, other.priority);
    }

    @Override
    public String toString() {
        return "Task{" + "priority=" + priority + ", name='" + name + '\'' + '}';
    }
}

import java.util.concurrent.PriorityBlockingQueue;

public class PriorityQueueExample {
    public static void main(String[] args) throws InterruptedException {
        // 创建优先队列
        PriorityBlockingQueue<Task> queue = new PriorityBlockingQueue<>();

        // 添加任务（插入时不立即排序，但出队时保证优先级）
        queue.put(new Task(3, "Low Priority Task"));
        queue.put(new Task(1, "High Priority Task"));
        queue.put(new Task(2, "Medium Priority Task"));

        // 取出任务（按优先级顺序）
        System.out.println(queue.take()); // 输出: Task{priority=1, name='High Priority Task'}
        System.out.println(queue.take()); // 输出: Task{priority=2, name='Medium Priority Task'}
        System.out.println(queue.take()); // 输出: Task{priority=3, name='Low Priority Task'}
    }
}

PriorityBlockingQueue<Task> queue = new PriorityBlockingQueue<>(11, (t1, t2) -> 
    Integer.compare(t1.getPriority(), t2.getPriority())
);