我想你可以基于java.util.concurrent.PriorityBlockingQueue实现自己的版本,就像这样
class ConcurrenRandomizingQueue extends AbstractQueue {
static Random r = new Random();
Queue q = new PriorityBlockingQueue();
static class Entry implements Comparable {
Object e;
int p;
Entry(Object e) {
this.e = e;
this.p = r.nextInt();
}
public int compareTo(Entry e) {
return Integer.compare(p, e.p);
}
}
public boolean offer(E e) {
return q.offer(new Entry(e));
}
public E poll() {
Entry e = q.poll();
if (e == null)
return null;
return (E) e.e;
}
public E peek() {
Entry e = q.peek();
if (e == null)
return null;
return (E) e.e;
}
public int size() {
return q.size();
}
public Iterator iterator() {
return null; // TODO
}
}