zoukankan      html  css  js  c++  java
  • 线程通讯--BlockingQueue

    Producer线程

    package com.thread.communication.blockingqueue;
    
    import java.util.concurrent.BlockingQueue;
    
    public class Producer extends Thread{
        private BlockingQueue<String> bq;
        
        public Producer(BlockingQueue<String> bq){
            this.bq=bq;
        }
        
        public void run(){
            String[] strArr = new String[]
                    {"Java","Struts","Spring"};
            for(int i=0;i<99999999;i++){
                System.out.println(getName() + "生产者准备生产集合元素");
                try{
                    Thread.sleep(200);
                    //如果传入的的bq的length是1,那么put一个值,就会出现阻塞现象
                    bq.put(strArr[i % 3]);//求余数 0 1 2
                }catch(Exception ex){
                    ex.printStackTrace();
                }
                
                System.out.println(getName()+"生产完成"+ bq);
                
            }
        }
    
    }

    Consumer线程

    package com.thread.communication.blockingqueue;
    
    import java.util.concurrent.BlockingQueue;
    
    public class Consumer extends Thread{
        private BlockingQueue<String> bq;
        public Consumer(BlockingQueue<String> bq){
            this.bq=bq;
        }
        public void run(){
            while(true){
                System.out.println(getName()+"消费者准备消费集合元素");
                try{
                    Thread.sleep(200);
                    //当bq被取空时,出现阻塞
                    bq.take();
                }catch(Exception ex){
                    ex.printStackTrace();
                }
                System.out.println(getName()+ "消费完成"+bq);
            }
        }
    
    }

    测试类

    package com.thread.communication.blockingqueue;
    
    import java.util.concurrent.ArrayBlockingQueue;
    import java.util.concurrent.BlockingQueue;
    
    public class BlockingQueueTest {
        public static void main(String[] args){
            BlockingQueue<String> bq = new ArrayBlockingQueue<>(1);
            
            new Producer(bq).start();
            new Producer(bq).start();
            new Producer(bq).start();
            
            new Consumer(bq).start();
        }
    
    }
  • 相关阅读:
    由AbstractQueuedSynchronizer和ReentrantLock来看模版方法模式
    Java并发编程-CAS
    Java并发编程-volatile
    Java并发编程-synchronized
    学习几个协议
    邻接矩阵存储简单路径(1070)
    输出利用先序遍历创建的二叉树的层次遍历序列(0980)
    中缀表达式转换为后缀表达式(1042)
    特定字符序列的判断(1028)
    舞伴问题(1027)
  • 原文地址:https://www.cnblogs.com/moonpool/p/5503287.html
Copyright © 2011-2022 走看看