多线程 - 阻塞队列blockingQueue用法

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;

public class BlockingQuenceTest {

	BlockingQueue<Integer> blockingQueue = new ArrayBlockingQueue<Integer>(10);

	public void put() {
		try {
			blockingQueue.put(1);
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
	}

	public BlockingQueue<Integer> getBlockingQueue() {
		return blockingQueue;
	}

	public static void main(String[] args) {
		BlockingQuenceTest b = new BlockingQuenceTest();
		TheadTest tt = new TheadTest(b);
		for (int i = 0; i < 20; i++) {
			new Thread(tt).start();
		}
		BlockingQueue<Integer> blockingQueue = b.getBlockingQueue();
		try {
			Thread.sleep(100);
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
		int size = blockingQueue.size();
		System.out.println("之前:" + size);
		try {
			Thread.sleep(3000);
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
		blockingQueue.clear();
		try {
			Thread.sleep(100);
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
		size = blockingQueue.size();
		System.out.println("之后:" + size);
	}
}

class TheadTest implements Runnable {
	private BlockingQuenceTest blockingQueue;

	public TheadTest(BlockingQuenceTest blockingQueue) {
		this.blockingQueue = blockingQueue;
	}

	public void run() {
		blockingQueue.put();
	}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值