java:原子类 CAS算法 ABA问题的解决方式

java原子类,CAS算法可能导致ABA问题,而AtomicStampedReference类很好的解决了这一问题，解决思想类似于数据库的**乐观锁,**加一个version版本号，每次更新数据的同时会修改版本号,另外的线程在修改时会拿着之前的版本号和现在的版本号对比，不一致就无法修改。

/**
 * @Auther: Shen_hs
 * @Date: 2021/5/1
 * @Description: AtomicStampReference 解决CAS的 ABA问题（类似于 数据库的乐观锁 加一个版本号）
 */
public class AtomicStampRefTest {

    private static AtomicStampedReference<Integer> asr = new AtomicStampedReference<>(100,0);

    public static void main(String[] args) throws InterruptedException {
        Thread t1 = new Thread(() -> {
            try {
                TimeUnit.SECONDS.sleep(1);
                boolean result = asr.compareAndSet(100, 101, asr.getStamp(), asr.getStamp() + 1);
                System.out.println("first change A->B "+result+"| version ="+asr.getStamp());
                //发生两次变化 A->B->A
                result = asr.compareAndSet(101, 100, asr.getStamp(), asr.getStamp() + 1);
                System.out.println("second change B->A "+result+"| version ="+asr.getStamp());
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        });

        Thread t2 = new Thread(() -> {
            try {
                //记录此时的版本号
                int stamp = asr.getStamp();
                System.out.println("before sleep:version="+stamp);
                TimeUnit.SECONDS.sleep(2);
                System.out.println("after sleep:version="+asr.getStamp());
                boolean result = asr.compareAndSet(100, 101, stamp, stamp);
                System.out.println("final change A->B "+result+"| version ="+asr.getStamp());
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        });
        t1.start();
        t2.start();
        t1.join();
        t2.join();
    }
}
//===========================OUTPUT
before sleep:version=0
first change A->B true| version =1
second change B->A true| version =2
after sleep:version=2
final change A->B false| version =2