zoukankan      html  css  js  c++  java
  • GUC-8 小练习

    import java.util.concurrent.locks.Condition;
    import java.util.concurrent.locks.Lock;
    import java.util.concurrent.locks.ReentrantLock;
    
    /*
     * 编写一个程序,开启 3 个线程,这三个线程的 ID 分别为 A、B、C,每个线程将自己的 ID 在屏幕上打印 10 遍,要求输出的结果必须按顺序显示。
     *    如:ABCABCABC…… 依次递归
     */
    public class TestABCAlternate {
        
        public static void main(String[] args) {
            AlternateDemo ad = new AlternateDemo();
            
            new Thread(new Runnable() {
                @Override
                public void run() {
                    
                    for (int i = 1; i <= 20; i++) {
                        ad.loopA(i);
                    }
                    
                }
            }, "A").start();
            
            new Thread(new Runnable() {
                @Override
                public void run() {
                    
                    for (int i = 1; i <= 20; i++) {
                        ad.loopB(i);
                    }
                    
                }
            }, "B").start();
            
            new Thread(new Runnable() {
                @Override
                public void run() {
                    
                    for (int i = 1; i <= 20; i++) {
                        ad.loopC(i);
                        
                        System.out.println("-----------------------------------");
                    }
                    
                }
            }, "C").start();
        }
    
    }
    
    class AlternateDemo{
        
        private int number = 1; //当前正在执行线程的标记
        
        private Lock lock = new ReentrantLock();
        private Condition condition1 = lock.newCondition();
        private Condition condition2 = lock.newCondition();
        private Condition condition3 = lock.newCondition();
        
        /**
         * @param totalLoop : 循环第几轮
         */
        public void loopA(int totalLoop){
            lock.lock();
            
            try {
                //1. 判断
                if(number != 1){
                    condition1.await();
                }
                
                //2. 打印
                for (int i = 1; i <= 1; i++) {
                    System.out.println(Thread.currentThread().getName() + "	" + i + "	" + totalLoop);
                }
                
                //3. 唤醒
                number = 2;
                condition2.signal();
            } catch (Exception e) {
                e.printStackTrace();
            } finally {
                lock.unlock();
            }
        }
        
        public void loopB(int totalLoop){
            lock.lock();
            
            try {
                //1. 判断
                if(number != 2){
                    condition2.await();
                }
                
                //2. 打印
                for (int i = 1; i <= 1; i++) {
                    System.out.println(Thread.currentThread().getName() + "	" + i + "	" + totalLoop);
                }
                
                //3. 唤醒
                number = 3;
                condition3.signal();
            } catch (Exception e) {
                e.printStackTrace();
            } finally {
                lock.unlock();
            }
        }
        
        public void loopC(int totalLoop){
            lock.lock();
            
            try {
                //1. 判断
                if(number != 3){
                    condition3.await();
                }
                
                //2. 打印
                for (int i = 1; i <= 1; i++) {
                    System.out.println(Thread.currentThread().getName() + "	" + i + "	" + totalLoop);
                }
                
                //3. 唤醒
                number = 1;
                condition1.signal();
            } catch (Exception e) {
                e.printStackTrace();
            } finally {
                lock.unlock();
            }
        }
        
    }
  • 相关阅读:
    写一个精确定位异常的方法
    做一个牛XX的身份证号验证类(支持15位和18位)
    C#获取设备的IP和Mac类
    winfrom 倒计时控件
    一个实用价值很大的人脸关键点检测算法PFLD
    刷新WIDER Face纪录!TinaFace:人脸检测新网络,代码已开源!
    虚拟机安装教程
    python---文件路径的操作(有点意思)
    python_opencv -------->>>>>>>>>cv2.warpAffine()参数详解
    yolov5数据增强引发的思考——透视变换矩阵的创建
  • 原文地址:https://www.cnblogs.com/surge/p/10476256.html
Copyright © 2011-2022 走看看