package Exp1;

import java.util.LinkedList;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class createQueue {
int max=5;
LinkedList<Integer> Queue=new LinkedList<Integer>();
Lock lock=new ReentrantLock();
Condition empty=lock.newCondition();
Condition full=lock.newCondition();

public synchronized void push(int ProdRandom){
	try{
		lock.lock();
		while(max==Queue.size()){
	System.out.println("存储空间已满，请等待");
	full.await();
		}
		Queue.add(ProdRandom);
		empty.signal();
	}
		catch(InterruptedException e){
			e.printStackTrace();
		}
	finally{
		lock.unlock();
	}
}

@SuppressWarnings("finally")
public synchronized int pop(){
	int m=0;
	try{
		lock.lock();

	while(Queue.size()==0){
		System.out.println("存储空间已空，请等待");
		empty.await();
	}
	m=Queue.removeFirst();
	full.signal();
	}
		catch(InterruptedException e){
			e.printStackTrace();
		}
	finally{
		lock.unlock();
		return m;
	}
}
}