最后
分享一些资料给大家，我觉得这些都是很有用的东西，大家也可以跟着来学习，查漏补缺。
《Java高级面试》
《Java高级架构知识》
《算法知识》
shift = 31 - Integer.numberOfLeadingZeros(scale);
}
private long checkedByteOffset(int i) {
if (i < 0 || i >= array.length)
throw new IndexOutOfBoundsException("index " + i);
return byteOffset(i);
}
private static long byteOffset(int i) {
return ((long) i << shift) + base;
}
/**
-
Creates a new AtomicIntegerArray of the given length, with all
-
elements initially zero.
-
@param length the length of the array
*/
public AtomicIntegerArray(int length) {
array = new int[length];
}
/**
-
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(’ ');
}
}
}
欢迎加笔者微信号(dingwpmz)，加群探讨，笔者优质专栏目录：
3、源码分析Dubbo专栏(28篇+)
4、源码分析Mybatis专栏
5、源码分析Netty专栏(18篇+)
6、源码分析JUC专栏
最后
分布式技术专题+面试解析+相关的手写和学习的笔记pdf
还有更多Java笔记分享如下：
欢迎加笔者微信号(dingwpmz)，加群探讨，笔者优质专栏目录：
3、源码分析Dubbo专栏(28篇+)
4、源码分析Mybatis专栏
5、源码分析Netty专栏(18篇+)
6、源码分析JUC专栏
最后
分布式技术专题+面试解析+相关的手写和学习的笔记pdf
还有更多Java笔记分享如下：
[外链图片转存中…(img-vY06Uchf-1715812404958)]
713
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
