| Method from EDU.oswego.cs.dl.util.concurrent.SynchronizedByte Detail: |
|---|
 public byte add(byte amount) {
synchronized (lock_) {
return value_ += amount;
}
}
Add amount to value (i.e., set value += amount) |
public byte and(byte b) {
synchronized (lock_) {
value_ = (byte)(value_ & b);
return value_;
}
} |
public boolean commit(byte assumedValue,
byte newValue) {
synchronized(lock_) {
boolean success = (assumedValue == value_);
if (success) value_ = newValue;
return success;
}
} Set value to newValue only if it is currently assumedValue. |
public int compareTo(byte other) {
byte val = get();
return (val < other)? -1 : (val == other)? 0 : 1;
} |
public int compareTo(SynchronizedByte other) {
return compareTo(other.get());
} |
public int compareTo(Object other) {
return compareTo((SynchronizedByte)other);
} |
public byte complement() {
synchronized (lock_) {
value_ = (byte)~value_;
return value_;
}
} Set the value to its complement |
public byte decrement() {
synchronized (lock_) {
return --value_;
}
} |
public byte divide(byte factor) {
synchronized (lock_) {
return value_ /= factor;
}
} Divide value by factor (i.e., set value /= factor) |
public boolean equals(Object other) {
if (other != null &&
other instanceof SynchronizedByte)
return get() == ((SynchronizedByte)other).get();
else
return false;
} |
public final byte get() {
synchronized(lock_) { return value_; }
} |
public int hashCode() {
return (int)(get());
} |
public byte increment() {
synchronized (lock_) {
return ++value_;
}
} |
public byte multiply(byte factor) {
synchronized (lock_) {
return value_ *= factor;
}
} Multiply value by factor (i.e., set value *= factor) |
public byte negate() {
synchronized (lock_) {
value_ = (byte)(-value_);
return value_;
}
} Set the value to the negative of its old value |
public byte or(byte b) {
synchronized (lock_) {
value_ = (byte)(value_ | b);
return value_;
}
} |
public byte set(byte newValue) {
synchronized (lock_) {
byte old = value_;
value_ = newValue;
return old;
}
} |
public byte subtract(byte amount) {
synchronized (lock_) {
return value_ -= amount;
}
} Subtract amount from value (i.e., set value -= amount) |
public byte swap(SynchronizedByte other) {
if (other == this) return get();
SynchronizedByte fst = this;
SynchronizedByte snd = other;
if (System.identityHashCode(fst) > System.identityHashCode(snd)) {
fst = other;
snd = this;
}
synchronized(fst.lock_) {
synchronized(snd.lock_) {
fst.set(snd.set(fst.get()));
return get();
}
}
} Atomically swap values with another SynchronizedByte.
Uses identityHashCode to avoid deadlock when
two SynchronizedBytes attempt to simultaneously swap with each other.
(Note: Ordering via identyHashCode is not strictly guaranteed
by the language specification to return unique, orderable
values, but in practice JVMs rely on them being unique.) |
public String toString() {
return Byte.toString(get());
} |
public byte xor(byte b) {
synchronized (lock_) {
value_ = (byte)(value_ ^ b);
return value_;
}
} |
EDU.oswego.cs.dl.util.concurrent.SynchronizedVariable