Java多線程實(shí)戰(zhàn)之交叉打印的兩種方法
要求效果:先打印5次“printA…”,再打印5次“printB…”,每次打印間隔1秒,重復(fù)循環(huán)20次
方式一:使用wait()和notifyAll()方法
public class MyService {
private volatile boolean flag = false;
public synchronized void printA() {
try {
while (flag) {
wait();
}
for (int i = 0; i < 5; i++) {
System.out.println("printA...");
TimeUnit.SECONDS.sleep(1);
}
flag = true;
notifyAll();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
public synchronized void printB() {
try {
while (!flag) {
wait();
}
for (int i = 0; i < 5; i++) {
System.out.println("printB...");
TimeUnit.SECONDS.sleep(1);
}
flag = false;
notifyAll();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
public class BackupA implements Runnable {
private MyService myService;
public BackupA(MyService myService) {
super();
this.myService = myService;
}
@Override
public void run() {
myService.printA();
}
}
public class BackupB implements Runnable {
private MyService myService;
public BackupB(MyService myService) {
super();
this.myService = myService;
}
@Override
public void run() {
myService.printB();
}
}
public class Run {
public static void main(String[] args) {
MyService myService = new MyService();
for (int i = 0; i < 20; i++) {
new Thread(new BackupA(myService)).start();
new Thread(new BackupB(myService)).start();
}
}
}
方式二:使用await()和signalAll()方法
public class MyService {
private Lock lock = new ReentrantLock();
private Condition condition = lock.newCondition();
private boolean flag = false;
public void printA() {
try {
lock.lock();
while (flag) {
condition.await();
}
for (int i = 0; i < 5; i++) {
System.out.println("printA...");
TimeUnit.SECONDS.sleep(1);
}
flag = true;
condition.signalAll();
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
lock.unlock();
}
}
public void printB() {
try {
lock.lock();
while (!flag) {
condition.await();
}
for (int i = 0; i < 5; i++) {
System.out.println("printB...");
TimeUnit.SECONDS.sleep(1);
}
flag = false;
condition.signalAll();
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
lock.unlock();
}
}
}
public class ThreadA implements Runnable {
private MyService myService;
public ThreadA(MyService myService) {
super();
this.myService = myService;
}
@Override
public void run() {
myService.printA();
}
}
public class ThreadB implements Runnable {
private MyService myService;
public ThreadB(MyService myService) {
super();
this.myService = myService;
}
@Override
public void run() {
myService.printB();
}
}
public class Run {
public static void main(String[] args) {
MyService myService = new MyService();
for (int i = 0; i < 20; i++) {
new Thread(new ThreadA(myService)).start();
new Thread(new ThreadB(myService)).start();
}
}
}
總結(jié)
以上就是這篇文章的全部?jī)?nèi)容了,希望本文的內(nèi)容對(duì)大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價(jià)值,謝謝大家對(duì)腳本之家的支持。如果你想了解更多相關(guān)內(nèi)容請(qǐng)查看下面相關(guān)鏈接
相關(guān)文章
spring boot利用docker構(gòu)建gradle項(xiàng)目的實(shí)現(xiàn)步驟
這篇文章主要給大家介紹了關(guān)于spring boot利用docker構(gòu)建gradle項(xiàng)目的相關(guān)資料,文中通過示例代碼介紹的非常詳細(xì),對(duì)大家學(xué)習(xí)或者使用spring boot具有一定的參考學(xué)習(xí)價(jià)值,需要的朋友們下面來一起學(xué)習(xí)學(xué)習(xí)吧2018-05-05
Java數(shù)據(jù)結(jié)構(gòu)篇之實(shí)現(xiàn)二叉搜索樹的核心方法
二叉搜索樹是一種常用的數(shù)據(jù)結(jié)構(gòu),它是一棵二叉樹,且每個(gè)節(jié)點(diǎn)的值都大于其左子樹中任何節(jié)點(diǎn)的值,而小于其右子樹中任何節(jié)點(diǎn)的值,這篇文章主要給大家介紹了關(guān)于Java數(shù)據(jù)結(jié)構(gòu)篇之實(shí)現(xiàn)二叉搜索樹的核心方法,需要的朋友可以參考下2023-12-12
Java代碼實(shí)現(xiàn)四種限流算法詳細(xì)介紹
本文主要介紹了Java代碼實(shí)現(xiàn)四種限流算法詳細(xì)介紹,包含固定窗口限流,滑動(dòng)窗口限流,漏桶限流,令牌桶限流,具有一定的參考價(jià)值,感興趣的可以了解一下2024-05-05
java中的常見幾種發(fā)送http請(qǐng)求實(shí)例
在Java編程中,發(fā)送HTTP請(qǐng)求是一個(gè)常見需求,常用的方法有四種:HttpURLConnection、URLConnection、HttpClient以及Socket,其中,使用HttpClient方式時(shí),需要添加額外的庫(kù)支持2024-11-11

