java.util.concurrent
Java本身不可以开启线程
并发编程的原因:充分利用CPU资源
获取当前核数
Runtime.getRuntime().availableProcessors();
6个
wait | sleep |
---|---|
属于Object | 属于Thread |
会释放锁 | 不释放锁 |
在同步代码块中 | 在任意地方 |
lock和synchronized的区别
synchronized lock 内置关键字 Java类 无法判断锁 可判断锁 自动释放锁 手动释放锁 可重入锁,非公平 可重入锁,公平/非公平 适合少量代码 适合大量代码
lock java.util.concurrent.locks
lock三部曲
synchroniazed | Lock |
---|---|
wait | Condition.await |
notify | Condition.signal |
synchronized版
用
if
可能产生虚假唤醒情况,判断等待应写在while
循环中
用if
判断的话,唤醒后线程会从wait
之后的代码开始运行,但是不会重新判断if条件,直接继续运行if
代码块之后的代码,而如果使用while
的话,也会从wait
之后的代码运行,但是唤醒后会重新判断循环条件,如果不成立再执行while
代码块之后的代码块,成立的话继续wait
。
class Data{
private int number = 0;
public synchronized void increment(){
while(number!=0){
//判断
//等待
this.wait();
}
//业务
number++;
//通知其他线程
this.notifyAll();
}
}
-JUC版
class Data{
private int number = 0;
private Lock lock = new ReentrantLock();
private Condition condition=lock.newCondition();
public void increment(){
lock.lock();
try{
while(number!=0){
//判断
//等待
condition.await();
}
//业务
number++;
//通知其他线程
condition.signalAll();
//conditionX.signal==>唤醒指定的监视器
}catch(Exception e){
e.printStackTrace();
}finally{
lock.unlock();
}
}
}
public class ReadWriteLockDemo {
public static void main(String[] args) {
MyCacheLock cache = new MyCacheLock();
for (int i = 1; i <= 5; i++) {
int temp = i;
new Thread(() -> {
cache.put(String.valueOf(temp), temp);
}, String.valueOf(i)).start();
}
for (int i = 1; i <= 5; i++) {
int temp = i;
new Thread(() -> {
cache.get(String.valueOf(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() + "put" + key);
map.put(key, value);
System.out.println(Thread.currentThread().getName() + "put done");
} catch (Exception e) {
e.printStackTrace();
} finally {
readWriteLock.writeLock().unlock();
}
}
public void get(String key) {
readWriteLock.readLock().lock();
try {
System.out.println(Thread.currentThread().getName() + "get" + key);
Object o = map.get(key);
System.out.println(Thread.currentThread().getName() + "get done");
} catch (Exception e) {
e.printStackTrace();
} finally {
readWriteLock.readLock().unlock();
}
}
}
class MyCache {
private volatile Map<String, Object> map = new HashMap<>();
public void put(String key, Object value) {
System.out.println(Thread.currentThread().getName() + "put" + key);
map.put(key, value);
System.out.println(Thread.currentThread().getName() + "put done");
}
public void get(String key) {
System.out.println(Thread.currentThread().getName() + "get" + key);
Object o = map.get(key);
System.out.println(Thread.currentThread().getName() + "get done");
}
}
public class ListTest {
public static void main(String[] args) {
List<String> list = new ArrayList<>();
for (int i = 1; i < 10; i++) {
new Thread(() -> {
list.add(UUID.randomUUID().toString());
System.out.println(list);
},String.valueOf(i)).start();
}
}
}
java.util.ConcurrentModificationException 并发修改异常
解决方案:
Vector默认是安全的 List<String> list = new Vector<>();
用工具类Collections使Arraylist安全 List<String> list = Collections.synchronizedList(new ArrayList<>());
JUC List<String> list = new CopyOnWriteArrayList<>();
CopyOnWrite -> COW写入时复制
CopyOnWriteList对比Vector -> synchronized效率低
Vector
public synchronized boolean add(E e) {
modCount++;
ensureCapacityHelper(elementCount + 1);
elementData[elementCount++] = e;
return true;
}
CopyOnWriteList
public boolean add(E e) {
final ReentrantLock lock = this.lock;
lock.lock();
try {
Object[] elements = getArray();
int len = elements.length;
Object[] newElements = Arrays.copyOf(elements, len + 1);
newElements[len] = e;
setArray(newElements);
return true;
} finally {
lock.unlock();
}
}
public class HasMapTest {
public static void main(String[] args) {
Map<String, String> map = new HashMap<>();
for (int i = 1; i < 10; i++) {
new Thread(() -> {
map.put(Thread.currentThread().getName(),UUID.randomUUID().toString());
System.out.println(map);
}, String.valueOf(i)).start();
}
}
}
Collections Map<String, String> map = Collections.synchronizedMap(new HashMap<>());
JUC Map<String, String> map = new ConcurrentHashMap<>();
Runable | Callable |
---|---|
无返回值 | 返回值 |
无异常抛出 | 抛出异常 |
run() | call() |
new Thread()
中只接收Runnable,FutrueTask是Runable的子类,用于适配Callable
传统Runnable
public class RunnableTest {
public static void main(String[] args) {
new Thread(new MyThreadRun(), "Runnable").start();
}
}
class MyThreadRun implements Runnable {
@Override
public void run() {
System.out.println("run()");
}
}
Callable
public class CallableTest {
public static void main(String[] args) throws ExecutionException, InterruptedException {
MyThreadCall callableThread = new MyThreadCall();
FutureTask futureTask = new FutureTask(callableThread);
new Thread(futureTask, "Callable").start();
System.out.println((String) futureTask.get());
}
}
class MyThreadCall implements Callable<String> {
@Override
public String call() throws Exception {
System.out.println("call()");
return "call done";
}
}
- get()会产生阻塞 -> 1. 需要等待 2. 使用异步处理
- 结果会被缓存,提高效率->两个线程输出一个结果
public class CountDownLatchDemo {
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());
countDownLatch.countDown();// 计数器减一
}, String.valueOf(i)).start();
}
countDownLatch.await();// 等待计数器归零后向下执行
System.out.println("done");
}
}
public class CyclicBarrierDemo {
public static void main(String[] args) {
CyclicBarrier cyclicBarrier = new CyclicBarrier(7, () -> {
System.out.println("done");
});
for (int i = 1; i <= 7; i++) {
int temp = i;
new Thread(()->{
System.out.println(Thread.currentThread().getName());
try {
cyclicBarrier.await();
} catch (InterruptedException e) {
e.printStackTrace();
} catch (BrokenBarrierException e) {
e.printStackTrace();
}
}).start();
}
}
}
信号量
public class SemaphoreDemo {
public static void main(String[] args) {
Semaphore semaphore = new Semaphore(6);
for (int i = 1; i <= 12; i++) {
new Thread(() -> {
try {
semaphore.acquire();
System.out.println(Thread.currentThread().getName() + "run");
TimeUnit.SECONDS.sleep(2);
System.out.println(Thread.currentThread().getName() + "done");
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
semaphore.release();
}
}, String.valueOf(i)).start();
}
}
}
- 共享资源互斥时
- 并发限流,控制最大的线程数 -> 安全,高可用
线程池,多线程使用
BlockingDueue双端队列
方式 | 抛异常 | 有返回值,不抛异常 | 阻塞等待 | 超时等待 |
---|---|---|---|---|
添加 | add() | offer() | put() | offer(,) |
移除 | remove() | poll() | take() | poll(,) |
判断队列首 | element() | peek() | - | - |
在队列元素为空的情况下,element() 方法会抛出NoSuchElementException异常,peek() 方法只会返回 null
public static void test1() {
ArrayBlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
System.out.println(blockingQueue.add("A"));
System.out.println(blockingQueue.add("B"));
System.out.println(blockingQueue.add("C"));
/// java.lang.IllegalStateException: Queue full
//System.out.println(blockingQueue.add("D"));
System.out.println("---");
System.out.println(blockingQueue.remove());
System.out.println(blockingQueue.remove());
System.out.println(blockingQueue.remove());
/// java.util.NoSuchElementException
//System.out.println(blockingQueue.remove());
}
public static void test2() {
ArrayBlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
System.out.println(blockingQueue.offer("A"));
System.out.println(blockingQueue.offer("B"));
System.out.println(blockingQueue.offer("C"));
//队列满则返回false
System.out.println(blockingQueue.offer("D"));
System.out.println("---");
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
//无对象则返回null
System.out.println(blockingQueue.poll());
}
public static void test3() throws InterruptedException {
ArrayBlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
blockingQueue.put("A");
blockingQueue.put("B");
blockingQueue.put("C");
///队列满则阻塞等待
//blockingQueue.put("D");
System.out.println("---");
System.out.println(blockingQueue.take());
System.out.println(blockingQueue.take());
System.out.println(blockingQueue.take());
///队列空则阻塞等待
//System.out.println(blockingQueue.take());
}
public static void test4() throws InterruptedException {
ArrayBlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
System.out.println(blockingQueue.offer("A"));
System.out.println(blockingQueue.offer("B"));
System.out.println(blockingQueue.offer("C"));
//队列满则阻塞等待2s
System.out.println(blockingQueue.offer("D", 2, TimeUnit.SECONDS));
System.out.println("---");
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
//队列空则阻塞等待2s
System.out.println(blockingQueue.poll(2, TimeUnit.SECONDS));
}
public static void test5() {
ArrayBlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
//为空则返回null
System.out.println(blockingQueue.peek());
//java.util.NoSuchElementException
System.out.println(blockingQueue.element());
}
同步队列
每次put之后必须先take,才可继续put
public class SynchronousQueueTest {
public static void main(String[] args) {
SynchronousQueue<String> synchronousQueue = new SynchronousQueue<>();
new Thread(() -> {
try {
System.out.println(Thread.currentThread().getName() + "put 1");
synchronousQueue.put("1");
System.out.println(Thread.currentThread().getName() + "put 2");
synchronousQueue.put("2");
System.out.println(Thread.currentThread().getName() + "put 3");
synchronousQueue.put("3");
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
System.out.println("T1 over");
}
}, "T1").start();
new Thread(() -> {
try {
TimeUnit.SECONDS.sleep(2);
System.out.println(Thread.currentThread().getName() + "take " + synchronousQueue.take());
TimeUnit.SECONDS.sleep(2);
System.out.println(Thread.currentThread().getName() + "take " + synchronousQueue.take());
TimeUnit.SECONDS.sleep(2);
System.out.println(Thread.currentThread().getName() + "take " + synchronousQueue.take());
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
System.out.println("T2 over");
}
}, "T2").start();
}
}
Executors.newSingleThreadExecutor();
Executors.newFixedThreadPool(5);
Executors.newCachedThreadPool();
int corePoolSize
核心线程池大小int maximumPoolSize
最大核心线程池大小long keepAliveTime
等待超时时间TimeUnit unit
超时单位BlockingQueue<Runnable> workQueue
阻塞队列ThreadFactory threadFactory
线程工厂RejectedExecutionHandler handler
拒绝策略AbortPolicy()
:默认,不处理新的任务且抛出异常CallerRunsPolicy()
:原路返回,返回给请求的线程处理DiscardPolicy()
:队列满了后丢弃任务,不抛异常DiscardOldestPolicy()
:队列满了后,丢弃最老的任务,不抛异常
- 最大线程池大小
- CPU密集型 -> CPU核数
Runtime.getRuntime().availableProcessors();
- IO密集型 -> 判断十分耗IO的线程数
public class PoolDemo1 {
public static void main(String[] args) {
///单线程,最多1个线程
//ExecutorService pool = Executors.newSingleThreadExecutor();
///固定线程,最多n个线程
//ExecutorService pool = Executors.newFixedThreadPool(5);
///可变线程,任意个线程
//ExecutorService pool = Executors.newCachedThreadPool();
//本质都是调用ThreadPoolExecutor
ThreadPoolExecutor pool = new ThreadPoolExecutor(
2,
5,
3,
TimeUnit.SECONDS,
new LinkedBlockingQueue<>(3),
Executors.defaultThreadFactory(),
new ThreadPoolExecutor.DiscardOldestPolicy()
);
/**
* 1. 核心线程池大小 -> 默认为0
* 2. 最大核心线程池大小 -> 默认为Integer.MAX_VALUE => 会造成OOM
* 3. 等待超时时间
* 4. 超时单位
* 5. 阻塞队列
* 6. 线程工厂(一般不动)
* 7. 拒绝策略
* AbortPolicy() :默认,不处理新的任务且抛出异常
* CallerRunsPolicy() :原路返回,返回给请求的线程处理
* DiscardPolicy() :队列满了后丢弃任务,不抛异常
* DiscardOldestPolicy() :队列满了后,丢弃最老的任务,不抛异常
*/
try {
for (int i = 0; i < 20; i++) {
pool.execute(() -> {
System.out.println(Thread.currentThread().getName()+"done");
});
}
} catch (Exception e) {
e.printStackTrace();
} finally {
pool.shutdown();
}
}
}
Function 函数型接口
public class FunctionTest1 {
public static void main(String[] args) {
// Function<String, String> function = new Function<String, String>() {
// @Override
// public String apply(String s) {
// return s;
// }
// };
Function<String, String> function = (str) -> {
return str;
};
System.out.println(function.apply("hahaha"));
}
}
Predicate 断定型接口
public class PredicateTest {
public static void main(String[] args) {
// Predicate<String> predicate = new Predicate<String>() {
// @Override
// public boolean test(String s) {
// return s.isEmpty();
// }
// };
Predicate<String> predicate = (s) -> {
return s.isEmpty();
};
System.out.println(predicate.test("hahaha"));
}
}
Consumer 消费型接口
public class ConsumerTest {
public static void main(String[] args) {
// Consumer<String> consumer = new Consumer<String>(){
// @Override
// public void accept(String s) {
// System.out.println(s);
// }
// };
Consumer<String> consumer = (s) -> {
System.out.println(s);
};
consumer.accept("hahaha");
}
}
Supplier 供给型接口
public class SupplierTest {
public static void main(String[] args) {
// Supplier<String> supplier = new Supplier<String>() {
// @Override
// public String get() {
// return "hahaha";
// }
// };
Supplier<String> supplier = () -> {
return "hahaha";
};
System.out.println(supplier.get());
}
}
Predicate断定接口
Function函数型接口
Comparator -> Function函数型接口
Long
Consumer消费型接口
public class StreamTest {
public static void main(String[] args) {
User u1 = new User(1, "a", 20);
User u2 = new User(2, "b", 21);
User u3 = new User(3, "c", 22);
User u4 = new User(4, "d", 23);
User u5 = new User(5, "e", 24);
User u6 = new User(6, "f", 25);
List<User> users = Arrays.asList(u1, u2, u3, u4, u5, u6);
/**
* 1. ID为偶数
* 2. 年龄大于20
* 3. 用户名转大写
* 4. 倒序
* 5. 只输出2个
*/
users.stream()
.filter((u) -> {
return u.getId() % 2 == 0;
})
.filter((u) -> {
return u.getAge() > 20;
})
.map((u) -> {
return u.getName().toUpperCase();
})
.sorted((user1, user2) -> {
return user2.compareTo(user1);
})
.limit(2)
.forEach(System.out::println);
/**
* filter 过滤器,Predicate断定接口
* map 映射,Function函数型接口
* sorted 排序,Comparator -> Function函数型接口
* limit 分页,Long
* forEach 遍历,Consumer消费型接口
*/
}
}
并行执行任务
特点: 任务窃取以双端队列作线程,在任务完成后会从其他队列的尾端抢夺其他的线程的任务
public class ForkJoinTest {
public static void main(String[] args) {
test1();
System.out.println("=====");
try {
test2();
} catch (ExecutionException | InterruptedException e) {
e.printStackTrace();
}
System.out.println("=====");
test3();
/*
sum=500000000500000000,用时:330
=====
sum=500000000500000000,用时:294
=====
sum=500000000500000000,用时:219
*/
}
//普通方法
public static void test1() {
long sum = 0L;
long start = System.currentTimeMillis();
for (long i = 1L; i <= 10_0000_0000L; i++) {
sum += i;
}
long end = System.currentTimeMillis();
System.out.println("sum=" + sum + ",用时:" + (end - start));
}
//Forkjoin
public static void test2() throws ExecutionException, InterruptedException {
long start = System.currentTimeMillis();
ForkJoinPool forkJoinPool = new ForkJoinPool();
ForkJoinTask<Long> forkJoinDemo = new ForkJoinDemo(1L, 10_0000_0000L);
ForkJoinTask<Long> submit = forkJoinPool.submit(forkJoinDemo);
long sum = submit.get();
long end = System.currentTimeMillis();
System.out.println("sum=" + sum + ",用时:" + (end - start));
}
//stream
public static void test3() {
long start = System.currentTimeMillis();
long sum = LongStream
.rangeClosed(0L, 10_0000_0000L)
.parallel()
.reduce(0, Long::sum);
long end = System.currentTimeMillis();
System.out.println("sum=" + sum + ",用时:" + (end - start));
}
}
class ForkJoinDemo extends RecursiveTask<Long> {
private final long start;
private final long end;
public ForkJoinDemo(long start, long end) {
this.start = start;
this.end = end;
}
@Override
protected Long compute() {
long temp = 10000L;
if ((end - start) < temp) {
long sum = 0L;
for (long i = start; i <= end; i++) {
sum += i;
}
return sum;
} else {
long middle = (start + end) / 2;
ForkJoinDemo task1 = new ForkJoinDemo(start, middle);
ForkJoinDemo task2 = new ForkJoinDemo(middle + 1, end);
task1.fork();
task2.fork();
return task1.join() + task2.join();
}
}
}
Interface Future<V>
CompletableFuture<T>
public class FutureTest {
public static void main(String[] args) throws ExecutionException, InterruptedException {
//无返回值
CompletableFuture<Void> completableFuture = CompletableFuture.runAsync(() -> {
try {
TimeUnit.SECONDS.sleep(2);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.out.println(Thread.currentThread().getName() + "runAsync");
});
System.out.println("-----");
completableFuture.get();
System.out.println("============");
//有返回值
CompletableFuture<Integer> completableFuture1 = CompletableFuture.supplyAsync(() -> {
System.out.println(Thread.currentThread().getName() + "supplyAsync");
int i = 10 / 0;
return 1024;
});
System.out.println(completableFuture1.whenComplete((t, u) -> {
System.out.println("t=" + t);//正常结果
System.out.println("u=" + u);//错误信息
}).exceptionally((e) -> {
System.out.println(e.getMessage());
return -1;//错误时的结果
}).get());
}
}
java内存模型(概念,模型)
JMM特征
JMM操作
lock (锁定):作用于主内存的变量,把一个变量标识为线程独占状态
unlock (解锁):作用于主内存的变量,它把一个处于锁定状态的变量释放出来,释放后的变量才可以被其他线程锁定
read (读取):作用于主内存变量,它把一个变量的值从主内存传输到线程的工作内存中,以便随后的load动作使用
load (载入):作用于工作内存的变量,它把read操作从主存中变量放入工作内存中
use (使用):作用于工作内存中的变量,它把工作内存中的变量传输给执行引擎,每当虚拟机遇到一个需要使用到变量的值,就会使用到这个指令
assign (赋值):作用于工作内存中的变量,它把一个从执行引擎中接受到的值放入工作内存的变量副本中
store (存储):作用于主内存中的变量,它把一个从工作内存中一个变量的值传送到主内存中,以便后续的write使用
write (写入):作用于主内存中的变量,它把store操作从工作内存中得到的变量的值放入主内存的变量中
JMM的约定
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-9TSEyfPP-1606395141515)(images/JMM模型.png)]
主内存对应的是Java堆中的对象实例部分,工作内存对应的是栈中的部分区域,从更底层的来说,主内存对应的是硬件的物理内存,工作内存对应的是寄存器和高速缓存。
Volatile是Java虚拟机提供的轻量级同步机制
volatile
标记的指令前后添加内存屏障(同时实现可见性)指令重排:编译器优化,指令并行,内存系统
public class VolatileTest {
//private static int num = 0;
//private static volatile int num = 0;//加了volatile后,线程可以感知num的变化,但无法保证原子性
private static volatile AtomicInteger num = new AtomicInteger();
/*
1. lock
2. sychronized
3. 使用Atomic类
*/
public static void main(String[] args) {
testVisibility();
System.out.println("======");
testAtomic();
}
static void testVisibility(){
Thread thread = new Thread(new Runnable() {
@Override
public void run() {
// while (num == 0) {
//
// }
while (num.get()==0){
//AtomicInteger不能直接等于
}
System.out.println("线程感知num值改变");
}
});
thread.start();
try {
TimeUnit.SECONDS.sleep(1);
} catch (InterruptedException e) {
e.printStackTrace();
}
//num = 1;
num.set(1);
System.out.println(num);
}
public static void testAtomic(){
for (int i = 0; i < 20; i++) {
Thread thread = new Thread(new Runnable() {
@Override
public void run() {
for (int j = 0; j < 1000; j++) {
//num++;
num.getAndIncrement();//AtomicInteger + 1,方法CAS
}
}
});
thread.start();
}
while (Thread.activeCount()>2){
Thread.yield();
}
System.out.println(num);
}
}
饿汉式单例
//饿汉式单例:在加载时就创建对象,可能会浪费内存
public class HungryManTest {
private HungryManTest() {
System.out.println(Thread.currentThread().getName());
}
private final static HungryManTest HUNGRY_MAN_TEST = new HungryManTest();
public static HungryManTest getInstance(){
return HUNGRY_MAN_TEST;
}
public static void main(String[] args) {
for (int i = 0; i < 10; i++) {
Thread thread = new Thread(new Runnable() {
@Override
public void run() {
HungryManTest.getInstance();
}
});
thread.start();
}
}
}
懒汉式单例
package com.checker.singleton;
public class LazyManTest {
private LazyManTest() {
System.out.println(Thread.currentThread().getName());
}
private static volatile LazyManTest lazyManTest;
public static LazyManTest getInstance(){
// if (lazyManTest == null){
// lazyManTest = new LazyManTest();
// }
///使用双重检测模式:DCL懒汉式
if (lazyManTest == null){
synchronized (LazyManTest.class){
if (lazyManTest == null){
lazyManTest = new LazyManTest();
}
}
}
return lazyManTest;
}
public static void main(String[] args) {
//多线程下单例模式失效
for (int i = 0; i < 10; i++) {
Thread thread = new Thread(new Runnable() {
@Override
public void run() {
LazyManTest.getInstance();
}
});
thread.start();
}
}
}
静态内部类
public class StaticInnerTest {
private StaticInnerTest(){
}
public static class InnerClass{
private static final StaticInnerTest staticInnerTest = new StaticInnerTest();
}
//利用静态内部类返回单例对象
public static StaticInnerTest getInstance(){
return InnerClass.staticInnerTest;
}
}
反射破坏单例 与 枚举
public class SingletonAndReflection {
public static void main(String[] args) throws NoSuchMethodException, IllegalAccessException, InvocationTargetException, InstantiationException {
//普通方法获取单例
LazyManTest instance1 = LazyManTest.getInstance();
//用反射破坏单例
Constructor<LazyManTest> declaredConstructor = LazyManTest.class.getDeclaredConstructor(null);
declaredConstructor.setAccessible(true);
//通过反射获取的构造器创建单例
LazyManTest instance2 = declaredConstructor.newInstance();
System.out.println(instance1);
System.out.println(instance2);
/*
解决方法: 在构造方法中,先将class锁住,判断类模板是否存在,存在则抛出异常
破解方法: 所有对象都为反射创建,不加载类模板
解决方法2: 添加一个flag判断,在对象创建的时候判断flag的值
破解方法2: 用反射再获取修改这个flag
最终方法: 用枚举类创建单例
*/
Constructor<EnumSingle> enumSingleConstructor = EnumSingle.class.getDeclaredConstructor(String.class,int.class);
enumSingleConstructor.setAccessible(true);
//报错: 无法通过反射创建枚举对象
EnumSingle instance3 = enumSingleConstructor.newInstance();
System.out.println(instance3);
}
}
enum EnumSingle{
INSTANCE;
public EnumSingle getInstance(){
return INSTANCE;
}
}
比较并交换
public class CASTest {
//CAS compare and swap
public static void main(String[] args) {
AtomicInteger atomicInteger = new AtomicInteger(10);
System.out.println(atomicInteger);
//如果当前对象值为 expect:10 则将对象设置为 update:11
atomicInteger.compareAndSet(10,12);
System.out.println(atomicInteger);
//CAS自增1,底层为自旋锁
atomicInteger.getAndIncrement();
System.out.println(atomicInteger);
}
}
public class ABATest {
public static void main(String[] args) {
AtomicInteger atomicInteger = new AtomicInteger(10);
AtomicStampedReference<Integer> atomicReference = new AtomicStampedReference<>(10, 0);
new Thread(new Runnable() {
@Override
public void run() {
//获取原本的版本号
int stamp = atomicReference.getStamp();
System.out.println("stamp:" + stamp);
try {
TimeUnit.SECONDS.sleep(2);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.out.println("带时间戳");
System.out.println(atomicReference.compareAndSet(10, 100, stamp, stamp + 1));
System.out.println(atomicReference.getReference());
System.out.println("不带时间戳");
System.out.println(atomicInteger.compareAndSet(10, 100));
System.out.println(atomicInteger);
}
}, "T1").start();
new Thread(new Runnable() {
@Override
public void run() {
int stamp = atomicReference.getStamp();
atomicReference.compareAndSet(10, 30, stamp, stamp + 1);
stamp = atomicReference.getStamp();
atomicReference.compareAndSet(30, 10, stamp, stamp + 1);
atomicInteger.compareAndSet(10, 30);
atomicInteger.compareAndSet(30, 10);
}
}, "T2").start();
}
}
int在大小超过-127~127时,会new新的对象,应该用Interger类进行操作
//获取原本的版本号
int stamp = atomicReference.getStamp();
System.out.println(“stamp:” + stamp);
try {
TimeUnit.SECONDS.sleep(2);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.out.println("带时间戳");
System.out.println(atomicReference.compareAndSet(10, 100, stamp, stamp + 1));
System.out.println(atomicReference.getReference());
System.out.println("不带时间戳");
System.out.println(atomicInteger.compareAndSet(10, 100));
System.out.println(atomicInteger);
}
}, "T1").start();
new Thread(new Runnable() {
@Override
public void run() {
int stamp = atomicReference.getStamp();
atomicReference.compareAndSet(10, 30, stamp, stamp + 1);
stamp = atomicReference.getStamp();
atomicReference.compareAndSet(30, 10, stamp, stamp + 1);
atomicInteger.compareAndSet(10, 30);
atomicInteger.compareAndSet(30, 10);
}
}, "T2").start();
}
}
> int在大小超过-127~127时,会new新的对象,应该用Interger类进行操作
文章浏览阅读1.1k次。一、选择题1. 串行接口是指( )。A. 接口与系统总线之间串行传送,接口与I/0设备之间串行传送B. 接口与系统总线之间串行传送,接口与1/0设备之间并行传送C. 接口与系统总线之间并行传送,接口与I/0设备之间串行传送D. 接口与系统总线之间并行传送,接口与I/0设备之间并行传送【答案】C2. 最容易造成很多小碎片的可变分区分配算法是( )。A. 首次适应算法B. 最佳适应算法..._874 计算机科学专业基础综合题型
文章浏览阅读9.7k次,点赞5次,收藏15次。连接xshell失败,报错如下图,怎么解决呢。1、通过ps -e|grep ssh命令判断是否安装ssh服务2、如果只有客户端安装了,服务器没有安装,则需要安装ssh服务器,命令:apt-get install openssh-server3、安装成功之后,启动ssh服务,命令:/etc/init.d/ssh start4、通过ps -e|grep ssh命令再次判断是否正确启动..._could not connect to '192.168.17.128' (port 22): connection failed.
文章浏览阅读209次。00000000_杰理 空白芯片 烧入key文件
文章浏览阅读475次。2023年初,“ChatGPT”一词在社交媒体上引起了热议,人们纷纷探讨它的本质和对社会的影响。就连央视新闻也对此进行了报道。作为新传专业的前沿人士,我们当然不能忽视这一热点。本文将全面解析ChatGPT,打开“技术黑箱”,探讨它对新闻与传播领域的影响。_引发对chatgpt兴趣的表述
文章浏览阅读259次。用Python数据分析方法进行汉字声调频率统计分析木合塔尔·沙地克;布合力齐姑丽·瓦斯力【期刊名称】《电脑知识与技术》【年(卷),期】2017(013)035【摘要】该文首先用Python程序,自动获取基本汉字字符集中的所有汉字,然后用汉字拼音转换工具pypinyin把所有汉字转换成拼音,最后根据所有汉字的拼音声调,统计并可视化拼音声调的占比.【总页数】2页(13-14)【关键词】数据分析;数据可..._汉字声调频率统计
文章浏览阅读64次。最近在做一个android系统移植的项目,所使用的开发板com1是调试串口,就是说会有uboot和kernel的调试信息打印在com1上(ttySAC0)。因为后期要使用ttySAC0作为上层应用通信串口,所以要把所有的调试信息都给去掉。参考网上的几篇文章,自己做了如下修改,终于把调试信息重定向到ttySAC1上了,在这做下记录。参考文章有:http://blog.csdn.net/longt..._嵌入式rootfs 输出重定向到/dev/console
文章浏览阅读1.2k次,点赞4次,收藏12次。1,先去iconfont登录,然后选择图标加入购物车 2,点击又上角车车添加进入项目我的项目中就会出现选择的图标 3,点击下载至本地,然后解压文件夹,然后切换到uniapp打开终端运行注:要保证自己电脑有安装node(没有安装node可以去官网下载Node.js 中文网)npm i -g iconfont-tools(mac用户失败的话在前面加个sudo,password就是自己的开机密码吧)4,终端切换到上面解压的文件夹里面,运行iconfont-tools 这些可以默认也可以自己命名(我是自己命名的_uniapp symbol图标
文章浏览阅读1.2w次,点赞25次,收藏192次。char*和char[]都是指针,指向第一个字符所在的地址,但char*是常量的指针,char[]是指针的常量_c++ char*
文章浏览阅读930次。代码编辑器或者文本编辑器,对于程序员来说,就像剑与战士一样,谁都想拥有一把可以随心驾驭且锋利无比的宝剑,而每一位程序员,同样会去追求最适合自己的强大、灵活的编辑器,相信你和我一样,都不会例外。我用过的编辑器不少,真不少~ 但却没有哪款让我特别心仪的,直到我遇到了 Sublime Text 2 !如果说“神器”是我能给予一款软件最高的评价,那么我很乐意为它封上这么一个称号。它小巧绿色且速度非
文章浏览阅读4.1k次。一、选择法这是每一个数出来跟后面所有的进行比较。2.冒泡排序法,是两个相邻的进行对比。_对十个数进行大小排序java
文章浏览阅读2.9k次。物联网开发笔记——使用网络调试助手连接阿里云物联网平台(基于MQTT协议)其实作者本意是使用4G模块来实现与阿里云物联网平台的连接过程,但是由于自己用的4G模块自身的限制,使得阿里云连接总是无法建立,已经联系客服返厂检修了,于是我在此使用网络调试助手来演示如何与阿里云物联网平台建立连接。一.准备工作1.MQTT协议说明文档(3.1.1版本)2.网络调试助手(可使用域名与服务器建立连接)PS:与阿里云建立连解释,最好使用域名来完成连接过程,而不是使用IP号。这里我跟阿里云的售后工程师咨询过,表示对应_网络调试助手连接阿里云连不上
文章浏览阅读544次,点赞5次,收藏6次。运算符与表达式任何高级程序设计语言中,表达式都是最基本的组成部分,可以说C++中的大部分语句都是由表达式构成的。_无c语言基础c++期末速成