仅包含唯一元素的Java阻塞队列

Question

有点像“阻塞集”。我如何实现一个阻塞队列，其中添加已经在组中的成员将被忽略？

Answer 1

您可以覆盖任何实施BlockingQueue<T>的add和put方法，以首先检查元素是否已经在队列中，例如，

@Override 
public boolean add(T elem) { 
    if (contains(elem)) 
     return true; 
    return super.add(elem); 
} 

Answer 2

您可以创建一个组成BlockingQueue，Set和锁的新类。当你把（）你测试对照集合，同时拿着防止get（）运行的锁。当你得到（）时，你从该集合中删除该项目，以便它可以在将来再次放置（）。

Answer 3

class BlockingSet extends ArrayBlockingQueue<E> { 
    /*Retain all other methods except put*/ 
    public void put(E o) throws InterruptedException { 
     if (!this.contains(o)){ 
     super.put(o); 
     } 
    } 
} 

Answer 4

通过用于预知迭代顺序和一定的时间增加，删除和链接哈希set支持一种阻塞队列实现包含操作：

There you go。

Answer 5

我写了这个类来解决类似的问题：

/** 
* Linked blocking queue with {@link #add(Object)} method, which adds only element, that is not already in the queue. 
*/ 
public class SetBlockingQueue<T> extends LinkedBlockingQueue<T> { 

    private Set<T> set = Collections.newSetFromMap(new ConcurrentHashMap<>()); 

    /** 
    * Add only element, that is not already enqueued. 
    * The method is synchronized, so that the duplicate elements can't get in during race condition. 
    * @param t object to put in 
    * @return true, if the queue was changed, false otherwise 
    */ 
    @Override 
    public synchronized boolean add(T t) { 
     if (set.contains(t)) { 
      return false; 
     } else { 
      set.add(t); 
      return super.add(t); 
     } 
    } 

    /** 
    * Takes the element from the queue. 
    * Note that no synchronization with {@link #add(Object)} is here, as we don't care about the element staying in the set longer needed. 
    * @return taken element 
    * @throws InterruptedException 
    */ 
    @Override 
    public T take() throws InterruptedException { 
     T t = super.take(); 
     set.remove(t); 
     return t; 
    } 
}