DequeueMethods.java

package com.codecafe.concurrency.blockingqueue;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.TimeUnit;

public class DequeueMethods {

  public static void main(String[] args) {
    BlockingQueue<String> blockingQueue = new ArrayBlockingQueue<>(3);

    // take() blocks until an element becomes available
    try {
      String element = blockingQueue.take();
    } catch (InterruptedException e) {
      e.printStackTrace();
    }

    // poll() returns null if no element is available
    String element2 = blockingQueue.poll();

    // poll(timeOut, TimeUnit) blocks until given timeOut
    // for an element to become available. If no element is available
    // before that time then null is returned
    try {
      String element3 = blockingQueue.poll(1000, TimeUnit.MILLISECONDS);
    } catch (InterruptedException e) {
      e.printStackTrace();
    }

    // removes the element if present in the BlockingQueue
    boolean wasRemoved = blockingQueue.remove("1");
  }

}