用阻塞队列ArrayBlockingQueue或LinkedBlockingQueue实现实现生产者与消费者



[代码] ArrayBlockingQueue或LinkedBlockingQueue

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.LinkedBlockingQueue;
 
/**
  * 阻塞队列BlockingQueue
  *
  * 下面是用BlockingQueue来实现Producer和Consumer的例子
  */
public class BlockingQueueTest2 {
 
     /**
      * 定义装苹果的篮子
      */
     public static class Basket {
         // 篮子,能够容纳3个苹果
         // BlockingQueue<String> basket = new ArrayBlockingQueue<String>(3);
         BlockingQueue<String> basket = new LinkedBlockingQueue<String>( 3 );
 
         // 生产苹果,放入篮子
         public void produce() throws InterruptedException {
             // put方法放入一个苹果,若basket满了,等到basket有位置
             basket.put( "An apple" );
         }
 
         // 消费苹果,从篮子中取走
         public String consume() throws InterruptedException {
             // get方法取出一个苹果,若basket为空,等到basket有苹果为止
             return basket.take();
         }
     }
 
     //  测试方法
     public static void testBasket() {
 
         // 建立一个装苹果的篮子
         final Basket basket = new Basket();
 
         // 定义苹果生产者
         class Producer implements Runnable {
             public String instance = "" ;
 
             public Producer(String a) {
                 instance = a;
             }
 
             public void run() {
                 try {
                     while ( true ) {
                         // 生产苹果
                         System.out.println( "生产者准备生产苹果:" + instance);
                         basket.produce();
                         System.out.println( "! 生产者生产苹果完毕:" + instance);
                         // 休眠300ms
                         Thread.sleep( 300 );
                     }
                 } catch (InterruptedException ex) {
                 }
             }
         }
 
         // 定义苹果消费者
         class Consumer implements Runnable {
             public String instance = "" ;
 
             public Consumer(String a) {
                 instance = a;
             }
 
             public void run() {
                 try {
                     while ( true ) {
                         // 消费苹果
                         System.out.println( "消费者准备消费苹果:" + instance);
                         basket.consume();
                         System.out.println( "! 消费者消费苹果完毕:" + instance);
                         // 休眠1000ms
                         Thread.sleep( 1000 );
                     }
                 } catch (InterruptedException ex) {
                 }
             }
         }
 
         ExecutorService service = Executors.newCachedThreadPool();
         Producer producer = new Producer( "P1" );
         Producer producer2 = new Producer( "P2" );
         Consumer consumer = new Consumer( "C1" );
         service.submit(producer);
         service.submit(producer2);
         service.submit(consumer);
 
         // 程序运行3s后,所有任务停止
         try {
             Thread.sleep( 3000 );
         } catch (InterruptedException e) {
         }
 
         service.shutdownNow();
     }
 
     public static void main(String[] args) {
         BlockingQueueTest2.testBasket();
     }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值