Struct atomic::Atomic

source ·
pub struct Atomic<T: Copy> { /* private fields */ }
Expand description

A generic atomic wrapper type which allows an object to be safely shared between threads.

Implementations

Creates a new Atomic.

Checks if Atomic objects of this type are lock-free.

If an Atomic is not lock-free then it may be implemented using locks internally, which makes it unsuitable for some situations (such as communicating with a signal handler).

Loads a value from the Atomic.

load takes an Ordering argument which describes the memory ordering of this operation.

Panics

Panics if order is Release or AcqRel.

Stores a value into the Atomic.

store takes an Ordering argument which describes the memory ordering of this operation.

Panics

Panics if order is Acquire or AcqRel.

Stores a value into the Atomic, returning the old value.

swap takes an Ordering argument which describes the memory ordering of this operation.

Stores a value into the Atomic if the current value is the same as the current value.

The return value is a result indicating whether the new value was written and containing the previous value. On success this value is guaranteed to be equal to new.

compare_exchange takes two Ordering arguments to describe the memory ordering of this operation. The first describes the required ordering if the operation succeeds while the second describes the required ordering when the operation fails. The failure ordering can’t be Acquire or AcqRel and must be equivalent or weaker than the success ordering.

Stores a value into the Atomic if the current value is the same as the current value.

Unlike compare_exchange, this function is allowed to spuriously fail even when the comparison succeeds, which can result in more efficient code on some platforms. The return value is a result indicating whether the new value was written and containing the previous value.

compare_exchange takes two Ordering arguments to describe the memory ordering of this operation. The first describes the required ordering if the operation succeeds while the second describes the required ordering when the operation fails. The failure ordering can’t be Acquire or AcqRel and must be equivalent or weaker than the success ordering. success ordering.

Logical “and” with a boolean value.

Performs a logical “and” operation on the current value and the argument val, and sets the new value to the result.

Returns the previous value.

Logical “or” with a boolean value.

Performs a logical “or” operation on the current value and the argument val, and sets the new value to the result.

Returns the previous value.

Logical “xor” with a boolean value.

Performs a logical “xor” operation on the current value and the argument val, and sets the new value to the result.

Returns the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Add to the current value, returning the previous value.

Subtract from the current value, returning the previous value.

Bitwise and with the current value, returning the previous value.

Bitwise or with the current value, returning the previous value.

Bitwise xor with the current value, returning the previous value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Minimum with the current value.

Maximum with the current value.

Trait Implementations

Formats the value using the given formatter. Read more
Returns the “default value” for a type. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.