查看: 3555|回复: 0

[代码资源] AtomicInteger类

[复制链接]

字体大小: 正常放大

杨利霞

5273 主题	82 听众	17万积分

TA的每日心情

	开心 2021-8-11 17:59

签到天数: 17 天

[LV.4]偶尔看看III

网络挑战赛参赛者

自我介绍: 本人女，毕业于内蒙古科技大学，担任文职专业，毕业专业英语。

群组: 2018美赛大象算法课程

群组: 2018美赛护航培训课程

群组: 2019年数学中国站长建

群组: 2019年数据分析师课程

群组: 2018年大象老师国赛优

电梯直达

1^#

发表于 2019-3-23 16:04 |只看该作者 |正序浏览

|招呼Ta 关注Ta

AtomicInteger类

这一讲，主要讲讲AtomicInteger类，此类同样是Number的子类，同时实现 Serializable。

重点内容

属性：
private static final Unsafe unsafe = Unsafe.getUnsafe();

private static final long valueOffset;

private volatile int value;

静态代码块：
static {
      try {
         valueOffset = unsafe.objectFieldOffset
            (AtomicInteger.class.getDeclaredField("value"));
      } catch (Exception ex) { throw new Error(ex); }
}
---------------------
构造方法
public AtomicInteger() {
}

public AtomicInteger(int initialValue) {
      value = initialValue;
}

对象方法：
public final int get() {
      return value;
}

public final void set(int newValue) {
      value = newValue;
}

public final void lazySet(int newValue) {
      unsafe.putOrderedInt(this, valueOffset, newValue);
}

public final int getAndSet(int newValue) {
      for (;;) {
         int current = get();
         if (compareAndSet(current, newValue))
            return current;
      }
}

public final boolean compareAndSet(int expect, int update) {
      return unsafe.compareAndSwapInt(this, valueOffset, expect, update);
}

public final boolean weakCompareAndSet(int expect, int update) {
      return unsafe.compareAndSwapInt(this, valueOffset, expect, update);
}

public final int getAndIncrement() {
      for (;;) {
         int current = get();
         int next = current + 1;
         if (compareAndSet(current, next))
            return current;
      }
}

public final int getAndDecrement() {
      for (;;) {
         int current = get();
         int next = current - 1;
         if (compareAndSet(current, next))
            return current;
      }
}

public final int getAndAdd(int delta) {
      for (;;) {
         int current = get();
         int next = current + delta;
         if (compareAndSet(current, next))
            return current;
      }
}

public final int incrementAndGet() {
      for (;;) {
         int current = get();
         int next = current + 1;
         if (compareAndSet(current, next))
            return next;
      }
}

public final int decrementAndGet() {
      for (;;) {
         int current = get();
         int next = current - 1;
         if (compareAndSet(current, next))
            return next;
      }
}

public final int addAndGet(int delta) {
      for (;;) {
         int current = get();
         int next = current + delta;
         if (compareAndSet(current, next))
            return next;
      }
}

public String toString() {
      return Integer.toString(get());
}

public int intValue() {
      return get();
}

public long longValue() {
      return (long)get();
}

public float floatValue() {
      return (float)get();
}

public double doubleValue() {
      return (double)get();
}
---------------------
作者：feyshine
来源：CSDN