package devmanuals.com;

import java.util.concurrent.BlockingDeque;
import java.util.concurrent.LinkedBlockingDeque;

class Put implements Runnable {
	String name;

	BlockingDeque<Integer> bdq;

	public Put(String name, BlockingDeque<Integer> bdq) {
		this.name = name;
		this.bdq = bdq;
	}

	public void run() {
		System.out.println(name + " inserted the element into the deque");
		for (int i = 1; i < 6; i++) {
			bdq.offer(i);
			try {
				Thread.sleep(400);
				System.out.println(i);
				}
			catch (InterruptedException e) {
				e.printStackTrace();
			}
		}
		System.out.println("Therfore deque = " + bdq);
		System.out.println("Size of deque = " + bdq.size());
		int j = bdq.pollLast();
		System.out.println("After removing the last element (" + j
				+ "), the remaining \n elements of deque = " + bdq
				+ " and size = " + bdq.size());
	}
}

class Put1 implements Runnable {
	String name;

	BlockingDeque<Integer> bdq;

	public Put1(String name, BlockingDeque<Integer> bdq) {
		this.name = name;
		this.bdq = bdq;
	}

	public void run() {
		try {
			Thread.sleep(1500);
			// Here the implementation of this method will insert a new element into
			// the deque.
			bdq.put(11);
			System.out
					.println("Inserting a new element \n at last position then deque = "
							+ bdq + "and size = " + bdq.size());
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
	}
}

public class BdqPut {
	public static void main(String[] args) {
		BlockingDeque<Integer> bdq = new LinkedBlockingDeque<Integer>(5);
		Runnable a = new Put("A", bdq);
		Runnable b = new Put1("B", bdq);
		new Thread(a).start();
		try {
			Thread.sleep(1000);
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
		new Thread(b).start();
	}
}