如何查找和删除优先级队列中的条目？

是否可以在给定的示例中实现一条记录的搜索和删除？

有必要实现一个基于列表的队列，使用组合算法来服务它。然后演示队列元素的基本操作性能：搜索、添加、删除。

import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;

public class test {
    public static void main(String[] args) {
        //Компаратор
        Queue<Customer> customerPriorityQueue = new PriorityQueue<>(7, idComparator);
        add(customerPriorityQueue);
        poll(customerPriorityQueue);
    }

    //Класс компаратора
    public static Comparator<Customer> idComparator = new Comparator<Customer>(){
        @Override
        public int compare(Customer c1, Customer c2) {
            return (int) (c1.getId() - c2.getId());
        }
    };

    //Метод добавления элементов в очередь
    private static void add(Queue<Customer> customerPriorityQueue) {
        Random rand = new Random();

        for(int i=0; i<7; i++){
            int id = rand.nextInt(100);

            customerPriorityQueue.add(new Customer(id, "Name "+id));
        }
    }

    //Метод для обработки данных очереди
    private static void poll(Queue<Customer> customerPriorityQueue) {
        while(true){
            Customer cust = customerPriorityQueue.poll();
            if(cust == null) break;
            System.out.println("Обработка клиента с id=" + cust.getId() + " \\\\ " + cust.getName());
        }
    }
}

class Customer {
    private int id;
    private String name;

    public Customer(int i, String n){
        this.id=i;
        this.name=n;
    }

    public int getId() {
        return id;
    }

    public String getName() {
        return name;
    }
}