如何深入理解并掌握JAVA多线程编程的底层原理和高级技巧？

本文共计227个文字，预计阅读时间需要1分钟。

阻塞队列实现示例：

javaimport java.util.LinkedList;import java.util.List;

/** * 阻塞队列 * @author Administrator */public class BlockingQueue { // 构建队列 private List queue=new LinkedList();

// 队列容量 private int capacity;

// 构造方法 public BlockingQueue(int capacity) { this.capacity=capacity; }

// 添加元素 public synchronized void add(Object o) throws InterruptedException { while (queue.size()==capacity) { wait(); } queue.add(o); notifyAll(); }

// 移除元素 public synchronized Object remove() throws InterruptedException { while (queue.isEmpty()) { wait(); } Object o=queue.remove(0); notifyAll(); return o; }}

阻塞队列

package thread.blockqueue; import java.util.LinkedList; import java.util.List; /** * 阻塞队列 * * @author Administrator * */ public class BlockingQueue { // 构建队列 private List queue = new LinkedList<>(); // 队列容量 private int limit = 10; public BlockingQueue(int limit) { this.limit = limit; } /** * 进队列 * * @param item * @throws InterruptedException */ public synchronized void enqueue(E item) throws InterruptedException { while (this.queue.size() == this.limit) wait(); if (this.queue.size() == 0) notifyAll(); this.queue.add(item); } /** * 出队列 * * @return * @throws InterruptedException */ public synchronized E dequeue() throws InterruptedException { while (this.queue.size() == 0) wait(); if (this.queue.size() == limit) { notifyAll(); } return this.queue.remove(0); } }