手写LinkedBlockingQueue

原作者&＃xff1a;老铁123　　　
出处&＃xff1a;https://blog.csdn.net/qewgd/article/details/88364742　
本文归作者【老铁123】和博客园共有&＃xff0c;欢迎转载&＃xff0c;但未经作者同意必须保留此段声明&＃xff0c;且在文章页面明显位置给出原文连接&＃xff0c;否则保留追究法律责任的权利。

LinkedBlockingQueue基于链表的阻塞队列&＃xff0c;生产者消费者模型应用。

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;public class LinkedBlockingQueueV1 {private NodeV1 head;private NodeV1 tail;private Lock lock &＃61; new ReentrantLock();private Condition full &＃61; lock.newCondition();private Condition empty &＃61; lock.newCondition();private int capacity;private int count &＃61; 0;public LinkedBlockingQueueV1() {this(Integer.MAX_VALUE);}public LinkedBlockingQueueV1(int capacity) {this.capacity &＃61; capacity;NodeV1 e &＃61; new NodeV1(null);head &＃61; tail &＃61; e;}public void put(E e) throws InterruptedException {lock.lock();try {while (count &＃61;&＃61; capacity)full.await();enqueue(e);} finally {lock.unlock();}}public E take() throws InterruptedException {lock.lock();try {while (count &＃61;&＃61; capacity)empty.await();return dequeue();} finally {lock.unlock();}}private E dequeue() {NodeV1 h &＃61; head;NodeV1 first &＃61; h.next;h.next &＃61; h;head &＃61; first;E data &＃61; first.data;first.data &＃61; null;count--;full.signalAll();return data;}private void enqueue(E e) {NodeV1 node &＃61; new NodeV1(e);tail &＃61; tail.next &＃61; node;count&＃43;&＃43;;empty.signalAll();}
}class NodeV1 {public E data;public NodeV1 next;public NodeV1(E data) {this.data &＃61; data;}
}