AtomicIntegerArray源码分析与感悟

• Creates a new AtomicIntegerArray with the same length as, and

• all elements copied from, the given array.

• @param array the array to copy elements from

• @throws NullPointerException if array is null

*/

public AtomicIntegerArray(int[] array) {

// Visibility guaranteed by final field guarantees

this.array = array.clone();

}

/**

• Returns the length of the array.

• @return the length of the array

*/

public final int length() {

return array.length;

}

/**

• Gets the current value at position {@code i}.

• @param i the index

• @return the current value

*/

public final int get(int i) {

return getRaw(checkedByteOffset(i));

}

private int getRaw(long offset) {

return unsafe.getIntVolatile(array, offset);

}

/**

• Sets the element at position {@code i} to the given value.

• @param i the index

• @param newValue the new value

*/

public final void set(int i, int newValue) {

unsafe.putIntVolatile(array, checkedByteOffset(i), newValue);

}

/**

• Eventually sets the element at position {@code i} to the given value.

• @param i the index

• @param newValue the new value

• @since 1.6

*/

public final void lazySet(int i, int newValue) {

unsafe.putOrderedInt(array, checkedByteOffset(i), newValue);

}

/**

• Atomically sets the element at position {@code i} to the given

• value and returns the old value.

• @param i the index

• @param newValue the new value

• @return the previous value

*/

public final int getAndSet(int i, int newValue) {

long offset = checkedByteOffset(i);

while (true) {

int current = getRaw(offset);

if (compareAndSetRaw(offset, current, newValue))

return current;

}

}

/**

• Atomically sets the element at position {@code i} to the given

• updated value if the current value {@code ==} the expected value.

• @param i the index

• @param expect the expected value

• @param update the new value

• @return true if successful. False return indicates that

• the actual value was not equal to the expected value.

*/

public final boolean compareAndSet(int i, int expect, int update) {

return compareAndSetRaw(checkedByteOffset(i), expect, update);

}

private boolean compareAndSetRaw(long offset, int expect, int update) {

return unsafe.compareAndSwapInt(array, offset, expect, update);

}

/**

• Atomically sets the element at position {@code i} to the given

• updated value if the current value {@code ==} the expected value.

• May fail spuriously

• and does not provide ordering guarantees, so is only rarely an

• appropriate alternative to {@code compareAndSet}.

• @param i the index

• @param expect the expected value

• @param update the new value

• @return true if successful.

*/

public final boolean weakCompareAndSet(int i, int expect, int update) {

return compareAndSet(i, expect, update);

}

/**

• Atomically increments by one the element at index {@code i}.

• @param i the index

• @return the previous value

*/

public final int getAndIncrement(int i) {

return getAndAdd(i, 1);

}

/**

• Atomically decrements by one the element at index {@code i}.

• @param i the index

• @return the previous value

*/

public final int getAndDecrement(int i) {

return getAndAdd(i, -1);

}

/**

• Atomically adds the given value to the element at index {@code i}.

• @param i the index

• @param delta the value to add

• @return the previous value

*/

public final int getAndAdd(int i, int delta) {

long offset = checkedByteOffset(i);

while (true) {

int current = getRaw(offset);

if (compareAndSetRaw(offset, current, current + delta))

return current;

}

}

/**

• Atomically increments by one the element at index {@code i}.

• @param i the index

• @return the updated value

*/

public final int incrementAndGet(int i) {

return addAndGet(i, 1);

}

/**

• Atomically decrements by one the element at index {@code i}.

• @param i the index

• @return the updated value

*/

public final int decrementAndGet(int i) {

return addAndGet(i, -1);

}

/**

• Atomically adds the given value to the element at index {@code i}.

• @param i the index

• @param delta the value to add

• @return the updated value

*/

public final int addAndGet(int i, int delta) {

long offset = checkedByteOffset(i);

while (true) {

int current = getRaw(offset);

int next = current + delta;

if (compareAndSetRaw(offset, current, next))

return next;

}

}

/**

• Returns the String representation of the current values of array.

• @return the String representation of the current values of array

*/

public String toString() {

int iMax = array.length - 1;

if (iMax == -1)

return “[]”;

StringBuilder b = new StringBuilder();

b.append(‘[’);

for (int i = 0; ; i++) {

b.append(getRaw(byteOffset(i)));

if (i == iMax)

return b.append(‘]’).toString();

b.append(‘,’).append(’ ');

}

}

}

最后

针对最近很多人都在面试，我这边也整理了相当多的面试专题资料，也有其他大厂的面经。希望可以帮助到大家。

最新整理面试题

上述的面试题答案都整理成文档笔记。也还整理了一些面试资料&最新2021收集的一些大厂的面试真题

最新整理电子书

最新整理大厂面试文档

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持。

)

return b.append(‘]’).toString();

b.append(‘,’).append(’ ');

}

}

}

最后

针对最近很多人都在面试，我这边也整理了相当多的面试专题资料，也有其他大厂的面经。希望可以帮助到大家。

最新整理面试题
[外链图片转存中…(img-q9CXJLBf-1714277573616)]

上述的面试题答案都整理成文档笔记。也还整理了一些面试资料&最新2021收集的一些大厂的面试真题

最新整理电子书

[外链图片转存中…(img-W4xz3wjr-1714277573617)]

最新整理大厂面试文档

[外链图片转存中…(img-SQfsjplv-1714277573617)]

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持。

本文已被CODING开源项目：【一线大厂Java面试题解析+核心总结学习笔记+最新讲解视频+实战项目源码】收录