阻塞队列自定义实现 in Java

package bq;

import java.util.LinkedList;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class BlockingQueue<E> {

  private LinkedList<E> list = new LinkedList<>();

  public void push(E e) {
    synchronized (list) {
      list.add(e);
      System.out.println(Thread.currentThread() + ", produce, " + e);
      list.notifyAll();
    }
  };

  public E poll() {
    synchronized (list) {
      while (list.size() == 0) {
        System.out.println(Thread.currentThread() + ", poll:size=0, ");
        try {
          list.wait();
        } catch (InterruptedException e1) {
          e1.printStackTrace();
        }
      }
      E e = list.remove();
      System.out.println(Thread.currentThread() + ", consume, " + e);
      return e;
    }
  };

  public static void main(String[] args) {
    ExecutorService exec = Executors.newCachedThreadPool();
    BlockingQueue<Integer> queue = new BlockingQueue<>();
    exec.execute(new Consumer<>(queue));
    exec.execute(new Producer<>(queue, 1));
    exec.execute(new Consumer<>(queue));
    exec.execute(new Producer<>(queue, 2));
    exec.execute(new Consumer<>(queue));
    exec.execute(new Producer<>(queue, 3));

  }

}


class Consumer<E> implements Runnable {
  private BlockingQueue<E> queue;

  public Consumer(BlockingQueue<E> queue) {
    this.queue = queue;
  }

  @SuppressWarnings("unused")
  @Override
  public void run() {
    E e = queue.poll();
  }
}


class Producer<E> implements Runnable {
  private BlockingQueue<E> queue;
  private E e;

  public Producer(BlockingQueue<E> queue, E e) {
    this.queue = queue;
    this.e = e;
  }

  @Override
  public void run() {
    queue.push(e);
  }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值