The thread title should be self-explnatory... I\'m a bit confused between the specification of below methos from AtomicBoolean
class:
java.u
The documentation is pretty clear.
getAndSet
--> "Atomically sets to the given value and returns the previous value."compareAndSet
--> "Atomically sets the value to the given updated value if the current value == the expected value."Not surprisingly, compareAndSet
takes two arguments.
In your specific case:
if (flag.getAndSet(false))
will set flag
to false
only if its previous value was true
if (flag.compareAndSet(true, false))
You can look at the code for better understanding :
public final boolean getAndSet(boolean newValue) {
for (;;) {
boolean current = get();
if (compareAndSet(current, newValue))
return current;
}
}
In getAndSet
, if the value of the boolean has changed between the time you get()
the old value and the time you try to change its value, compareAndSet
won't change its value. Therefore, getAndSet
calls compareAndSet
in a loop until the boolean is set to the new value.
As to your code example :
flag.getAndSet(false)
returns the old value of the AtomicBoolean. On the other hand, flag.compareAndSet(x,false)
(note there are two arguments) returns whether the AtomicBoolean was modified, or in other words, it returns whether the old value of the AtomicBoolean was x.
The thread is a bit old but nobody mentioned that getAndSet will be more efficient than compareAndSet. CAS is a very costly instruction (on all CPU architectures, so JVM does not matter here). So they are not really equivalent.
So regarding the OP, both methods produce the same behaviour but it will not have the same performance, use getAndSet when you can.
When I have checked the implementation I found following
public final boolean getAndSet(boolean newValue) {
for (;;) {
boolean current = get();
if (compareAndSet(current, newValue))
return current;
}
}
Also when checking the javadoc, compareAndSet
sets value only if the comparison pass while getAndSet
simply set the value and return the previous value.