生产者消费者3种实现方式

---

生产者/消费者问题的多种实现方式 
1.使用阻塞队列实现
   // Producer Class in java
class Producer implements Runnable {
private final BlockingQueue sharedQueue;
public Producer(BlockingQueue sharedQueue) {
this.sharedQueue = sharedQueue; }
public void run() {
for (int i = 0; i < 10; i++) {
try {
System.out.println("Produced: " + i); sharedQueue.put(i);
} catch (InterruptedException ex) {
System.out.println(ex); }
} }
}
// Consumer Class in Java
class Consumer implements Runnable {
private final BlockingQueue sharedQueue;
public Consumer(BlockingQueue sharedQueue) {
this.sharedQueue = sharedQueue; }
public void run() { while (true) {
try {
int i = (Integer) sharedQueue.take(); System.out.println("Consumed: " + i);
} catch (InterruptedException ex) {
System.out.println(ex); }
} }
}
public class ProducerConsumerPattern {
public static void main(String args[]) { // Creating shared object
BlockingQueue sharedQueue = new LinkedBlockingQueue();
      // Creating Producer and Consumer Thread
Thread prodThread = new Thread(new Producer(sharedQueue)); Thread consThread = new Thread(new Consumer(sharedQueue));
 // Starting producer and Consumer thread
prodThread.start();
consThread.start(); }
}
2.使用 Object 的 wait()和 notify()实现
queue = new PriorityQueue(10);//
class Consumer extends Thread {
public void run() { while (true) {
synchronized (queue) {
while (queue.size() == 0) {//队列空的条件下阻塞
try { queue.wait();
} catch (InterruptedException e) { e.printStackTrace();
queue.notify(); }
}
queue.poll(); // 每次移走队首元素 queue.notify();
} }
} }
class Producer extends Thread {
public void run() { while (true) {
  
  
PriorityQueue
 充当缓冲区
  塞
synchronized (queue) {
while (queue.size() == 10) {//队列满了的条件下阻
try { queue.wait();
} catch (InterruptedException e) { e.printStackTrace();
queue.notify(); }
}
queue.offer(1); // 每次插入一个元素 queue.notify();
} }
} }
3.使用 Condition 实现
private PriorityQueue queue = new PriorityQueue(10);
private Lock lock = new ReentrantLock();
private Condition notFull = lock.newCondition(); private Condition notEmpty = lock.newCondition();
class Consumer extends Thread {
public void run() { while (true) {
lock.lock(); try {
while (queue.size() == 0) { try {
notEmpty.await();
} catch (InterruptedException e) {
e.printStackTrace(); }
}
queue.poll(); // 每次移走队首元素 notFull.signal();
} finally {
lock.unlock(); }
} }
}

class Producer extends Thread {
public void run() { while (true) {
lock.lock(); try {
while (queue.size() == 10) { try {
notFull.await();
} catch (InterruptedException e) {
e.printStackTrace(); }
}
queue.offer(1); // 每次插入一个元素 notEmpty.signal();
} finally {
lock.unlock(); }
} }
}