java queue 同步,java使用BlockingQueue阻塞队列实现互斥同步通信

package com.study;

import java.util.concurrent.ArrayBlockingQueue;

import java.util.concurrent.BlockingQueue;

public class BlockingQueueDemo {

public static void main(String[] args) {

BlockingQueueDemo blockingQueueDemo = new BlockingQueueDemo();

final BlockingQueueClass blockingQueueClass = blockingQueueDemo.new BlockingQueueClass();

Thread thread = new Thread(new Runnable() {

@Override

public void run() {

while (true) {

blockingQueueClass.put();

}

}

});

thread.start();

Thread thread2 = new Thread(new Runnable() {

@Override

public void run() {

while (true) {

blockingQueueClass.take();

}

}

});

thread2.start();

}

class BlockingQueueClass{

BlockingQueue takeblockingQueue = new ArrayBlockingQueue(1);

BlockingQueue putblockingQueue = new ArrayBlockingQueue(1);

{

try {

takeblockingQueue.put(1);

} catch (InterruptedException e) {

e.printStackTrace();

}

}

public void put(){

try {

putblockingQueue.put(1);

} catch (InterruptedException e) {

e.printStackTrace();

}

System.out.println("put...");

try {

takeblockingQueue.take();

} catch (InterruptedException e) {

e.printStackTrace();

}

}

public void take(){

try {

takeblockingQueue.put(1);

} catch (InterruptedException e) {

e.printStackTrace();

}

System.out.println("take...");

try {

putblockingQueue.take();

} catch (InterruptedException e) {

e.printStackTrace();

}

}

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值