File	Doc	Category	Size	Date	Package
AtomicInteger.java	API Doc	Java SE 6 API	6202	Tue Jun 10 00:25:56 BST 2008	java.util.concurrent.atomic

AtomicInteger

• java.lang.Object
  • java.lang.Number

Fields Summary
private static final long	serialVersionUID
private static final Unsafe	unsafe
private static final long	valueOffset
private volatile int	value

Constructors Summary
public AtomicInteger(int initialValue) Creates a new AtomicInteger with the given initial value. param initialValue the initial value value = initialValue;
public AtomicInteger() Creates a new AtomicInteger with initial value {@code 0}.

Methods Summary
public final int	addAndGet(int delta) Atomically adds the given value to the current value. param delta the value to add return the updated value for (;;) { int current = get(); int next = current + delta; if (compareAndSet(current, next)) return next; }
public final boolean	compareAndSet(int expect, int update) Atomically sets the value to the given updated value if the current value {@code ==} the expected value. 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. return unsafe.compareAndSwapInt(this, valueOffset, expect, update);
public final int	decrementAndGet() Atomically decrements by one the current value. return the updated value for (;;) { int current = get(); int next = current - 1; if (compareAndSet(current, next)) return next; }
public double	doubleValue() return (double)get();
public float	floatValue() return (float)get();
public final int	get() Gets the current value. return the current value return value;
public final int	getAndAdd(int delta) Atomically adds the given value to the current value. param delta the value to add return the previous value for (;;) { int current = get(); int next = current + delta; if (compareAndSet(current, next)) return current; }
public final int	getAndDecrement() Atomically decrements by one the current value. return the previous value for (;;) { int current = get(); int next = current - 1; if (compareAndSet(current, next)) return current; }
public final int	getAndIncrement() Atomically increments by one the current value. return the previous value for (;;) { int current = get(); int next = current + 1; if (compareAndSet(current, next)) return current; }
public final int	getAndSet(int newValue) Atomically sets to the given value and returns the old value. param newValue the new value return the previous value for (;;) { int current = get(); if (compareAndSet(current, newValue)) return current; }
public final int	incrementAndGet() Atomically increments by one the current value. return the updated value for (;;) { int current = get(); int next = current + 1; if (compareAndSet(current, next)) return next; }
public int	intValue() return get();
public final void	lazySet(int newValue) Eventually sets to the given value. param newValue the new value since 1.6 unsafe.putOrderedInt(this, valueOffset, newValue);
public long	longValue() return (long)get();
public final void	set(int newValue) Sets to the given value. param newValue the new value value = newValue;
public java.lang.String	toString() Returns the String representation of the current value. return the String representation of the current value. return Integer.toString(get());
public final boolean	weakCompareAndSet(int expect, int update) Atomically sets the value 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 expect the expected value param update the new value return true if successful. return unsafe.compareAndSwapInt(this, valueOffset, expect, update);