1、常用的辅助类
1.1、CountDownLatch
package com.zkw.JUC并发编程.add;
import java.util.concurrent.CountDownLatch;
//减法计数器
public class CountDownLatchTest {
public static void main(String[] args) throws InterruptedException {
CountDownLatch countDownLatch = new CountDownLatch(6);
for (int i = 1; i <= 6; i++) {
new Thread(()->{
System.out.println(Thread.currentThread().getName()+"-->Go out!!!");
countDownLatch.countDown(); //数量-1
},String.valueOf(i)).start();
}
countDownLatch.await();// 等待计数器归0 然后在往下边执行
System.out.println("Close Door!!!");
}
}
原理:
countDownLatch.countDown();
// 数量-1
countDownLatch.await();
// 等待计数器归零,然后在往下执行
每次线程调用 countDown()
数量-1,直到计数器为0,然后countDownLatch.await()
就会被唤醒,继续往下执行。
1.2、CyclicBarrier
第12代码,为什么要加上final,是为了保护数据的一致性,匿名内部类使用局部变量是通过自己维护的成员变量,因为无法保证内部类的成员变量与外部局部变量的数据同步,所以使用final修饰,使局部变量的值不可改变。这样就不需要关心数据是否同步的问题,因为变量的值是不可改变的
在JDK8中如果我们在匿名内部类中需要访问局部变量,那么这个局部变量不需要用final修饰符修饰
package com.zkw.JUC并发编程.add;
import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.CyclicBarrier;
public class CyclicBarrierTest {
public static void main(String[] args) {
CyclicBarrier cyclicBarrier = new CyclicBarrier(7,()->{
System.out.println("召唤神龙成功!!!!");
});
for (int i = 1; i <= 7; i++) {
final int temp = i;
new Thread(()->{
System.out.println(Thread.currentThread().getName()+"收集"+temp+"个龙珠");
try {
cyclicBarrier.await();
} catch (InterruptedException e) {
e.printStackTrace();
} catch (BrokenBarrierException e) {
e.printStackTrace();
}
}).start();
}
}
}
1.3、Semaphore(信号量)
package com.zkw.JUC并发编程.add;
import java.util.concurrent.Semaphore;
import java.util.concurrent.TimeUnit;
public class SemaphoreTest {
public static void main(String[] args) {
//线程的数量:停车位,限流
Semaphore semaphore = new Semaphore(3);
for (int i = 1; i <= 6; i++) {
new Thread(()->{
try {
semaphore.acquire();//获取
System.out.println(Thread.currentThread().getName()+"->抢到车位");
TimeUnit.SECONDS.sleep(3);
System.out.println(Thread.currentThread().getName()+"-->离开停车位");
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
semaphore.release();// 释放
}
},String.valueOf(i)).start();
}
}
}
原理:
semaphore.acquire();
获得,假设如果满了,等待,等待被释放为止!
semaphore.release();
释放,会将当前的信号量释放+1,然后唤醒等待的线程
**作用:**多个共享资源互斥的使用!并发限流,控制最大的线程数!
2、读写锁
package com.zkw.JUC并发编程.rw;
import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.locks.ReadWriteLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;
/**
* 独占锁(写锁) 一次只能被一个线程占有
* 共享锁(读锁) 多个线程可以同时占有
* ReadWriteLock
* 读 - 读 可以共享
* 读 - 写 不能共享
* 写 - 写 不能共享
*/
public class ReadWriteLockTest {
public static void main(String[] args) {
MyCacheLock myCache = new MyCacheLock();
//写入,保证每次只有一个线程进来写
for (int i = 1; i <= 5; i++) {
final int temp = i;
new Thread(()->{
myCache.put(temp+"",temp+"");
},String.valueOf(i)).start();
}
//读取
for (int i = 1; i <= 5; i++) {
final int temp = i;
new Thread(()->{
myCache.get(temp+"");
},String.valueOf(i)).start();
}
}
}
class MyCacheLock {
private volatile Map<String, Object> map = new HashMap<>();
private ReadWriteLock readWriteLock = new ReentrantReadWriteLock();
public void put(String key, Object value) {
readWriteLock.writeLock().lock();
try {
System.out.println(Thread.currentThread().getName() + "写入" + key);
map.put(key, value);
System.out.println(Thread.currentThread().getName() + "写入ok");
} catch (Exception e) {
e.printStackTrace();
} finally {
readWriteLock.writeLock().unlock();
}
}
public void get(String key) {
readWriteLock.readLock().lock();
try {
System.out.println(Thread.currentThread().getName() + "读取" + key);
System.out.println(Thread.currentThread().getName() + "读取ok");
} catch (Exception e) {
e.printStackTrace();
} finally {
readWriteLock.readLock().unlock();
}
}
}