Lambda表达式实现简单的多线程排序访问

虽然徒手撸了好几遍了,但以后长时间不看的话跟没学有什么区别。
记录一下代码,以后时不时可以回顾一下。

package com.qjb;

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

class ShareResource
{
    private int number = 1;  //1:A  2:B  3:C
    private Lock lock = new ReentrantLock();
    private Condition condition1 = lock.newCondition();
    private Condition condition2 = lock.newCondition();
    private Condition condition3 = lock.newCondition();


    public void print5()
    {
        lock.lock();
        try {
            //1. 判断
            while (number != 1)
            {
                condition1.await();
            }
            //2. 干活
                System.out.println(Thread.currentThread().getName()+"\t"+ Thread.currentThread().getId()+"\t");
            //3. 通知
            number = 2;
            condition2.signal();
        }catch (Exception e){
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
    }

    public void print10()
    {
        lock.lock();
        try {
            //1. 判断
            while (number != 2)
            {
                condition2.await();
            }
            //2. 干活
            System.out.println(Thread.currentThread().getName()+"\t"+ Thread.currentThread().getId()+"\t");
            //3. 通知
            number = 3;
            condition3.signal();
        }catch (Exception e){
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
    }

    public void print15()
    {
        lock.lock();
        try {
            //1. 判断
            while (number != 3)
            {
                condition3.await();
            }
            //2. 干活
            System.out.println(Thread.currentThread().getName()+"\t"+ Thread.currentThread().getId()+"\t");
            //3. 通知
            number = 1;
            condition1.signal();
        }catch (Exception e){
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
    }
}

/**
 * 多线程之间按顺序调用,实现A->B->C
 * 线程操作资源类
 * 判断干活通知
 * 防止虚假唤醒
 */
public class ThredOrderAccess
{
    public static void main(String[] args){
        ShareResource shareResource = new ShareResource();

        new Thread(() -> {
            for (int i = 0; i < 10; i++) {
                shareResource.print5();
            }
        },"A").start();

        new Thread(() -> {
            for (int i = 0; i < 10; i++) {
                shareResource.print10();
            }
        },"B").start();

        new Thread(() -> {
            for (int i = 0; i < 10; i++) {
                shareResource.print15();
            }
        },"C").start();
    }
}
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值