public class Warehouse {private Queue<Integer> queue;private int capacity;public Warehouse(int capacity) {this.capacity = capacity;queue = new LinkedList();}public synchronized void put(int num) {if (queue.size() >= capacity) {try {System.out.println(Thread.currentThread().getName() + " , put full wait");wait();} catch (InterruptedException e) {e.printStackTrace();}}queue.add(num);System.out.println(Thread.currentThread().getName() + " , put : " + num + "  , queue -> " + queue);notifyAll();}public synchronized int get() {if (queue.isEmpty()) {try {System.out.println(Thread.currentThread().getName() + " , get empty wait");wait();} catch (InterruptedException e) {e.printStackTrace();}}int num = queue.poll();System.out.println(Thread.currentThread().getName() + " , get : " + num + "  , queue -> " + queue);notifyAll();return num;}
}

public static void main(String[] args) {Warehouse warehouse = new Warehouse(4);Random random = new Random();new Thread(new Runnable() {@Overridepublic void run() {while (true) {warehouse.put(random.nextInt(10));try {Thread.sleep(1000);} catch (InterruptedException e) {e.printStackTrace();}}}}, "生产者-01").start();new Thread(new Runnable() {@Overridepublic void run() {while (true) {warehouse.get();try {Thread.sleep(2000);} catch (InterruptedException e) {e.printStackTrace();}}}}, "消费者-01").start();}

// 显式锁的使用示例
ReentrantLock lock = new ReentrantLock();// 获取锁，这是跟synchronized关键字对应的用法。
lock.lock();
try{// your code
}finally{lock.unlock();
}// 可定时，超过指定时间为得到锁就放弃
try {lock.tryLock(10, TimeUnit.SECONDS);try {// your code}finally {lock.unlock();}
} catch (InterruptedException e1) {// exception handling
}// 可中断，等待获取锁的过程中线程线程可被中断
try {lock.lockInterruptibly();try {// your code}finally {lock.unlock();}
} catch (InterruptedException e) {// exception handling
}// 多个等待队列，具体参考[ArrayBlockingQueue](https://github.com/CarpenterLee/JCRecipes/blob/master/markdown/ArrayBlockingQueue.md)
/** Condition for waiting takes */
private final Condition notEmpty = lock.newCondition();
/** Condition for waiting puts */
private final Condition notFull = lock.newCondition();

package com.imooc.locks;import java.util.LinkedList;
import java.util.List;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;public class Task {private final Lock lock = new ReentrantLock();private final Condition addCondition = lock.newCondition();private final Condition subCondition = lock.newCondition();private static int num = 0;private List<String> lists = new LinkedList<String>();public void add() {lock.lock();try {while(lists.size() == 10) {//当集合已满,则"添加"线程等待addCondition.await();}num++;lists.add("add Banana" + num);System.out.println("The Lists Size is " + lists.size());System.out.println("The Current Thread is " + Thread.currentThread().getName());System.out.println("==============================");this.subCondition.signal();} catch (InterruptedException e) {e.printStackTrace();} finally {//释放锁lock.unlock();}}public void sub() {lock.lock();try {while(lists.size() == 0) {//当集合为空时,"减少"线程等待subCondition.await();}String str = lists.get(0);lists.remove(0);System.out.println("The Token Banana is [" + str + "]");System.out.println("The Current Thread is " + Thread.currentThread().getName());System.out.println("==============================");num--;addCondition.signal();} catch (InterruptedException e) {e.printStackTrace();} finally {lock.unlock();}}}