用Lock Condition自主实现阻塞队列

package thread.lock_condition;

import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class MyBlocingQueue<E> {
		private final List<E> list;
		private final int limit;
		private final Lock lock = new ReentrantLock();
		private final Condition notEmpty = lock.newCondition();//非空
		private final Condition notFull = lock.newCondition();//没满
		public MyBlocingQueue(int limit){
			this.limit = limit;
			this.list = new ArrayList<E>();
		}
		
		public void put(E e){
			try {
				lock.lock();
				while(list.size() >= limit){
					notFull.await();
				}
				list.add(e);
				notEmpty.notifyAll();
			} catch (Exception e2) {
				// TODO: handle exception
			}finally{
				lock.unlock();
			}
		}
		
		public E take(){
			try {
				lock.lock();
				while(list.size() == 0){
					notEmpty.await();
				}
				E e = list.remove(0);
				notFull.notifyAll();
				return e;
			} catch (Exception e2) {
				return null;
			}finally{
				lock.unlock();
			}
		}
		
		
}

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值