# Enum atomic_polyfill::Ordering

1.0.0 ·

    pub enum Ordering {
        Relaxed,
        Release,
        Acquire,
        AcqRel,
        SeqCst,
    }

Expand description

Atomic memory orderings

Memory orderings specify the way atomic operations synchronize memory. In its weakest `Ordering::Relaxed`, only the memory directly touched by the operation is synchronized. On the other hand, a store-load pair of `Ordering::SeqCst` operations synchronize other memory while additionally preserving a total order of such operations across all threads.

Rust’s memory orderings are the same as those of C++20.

For more information see the nomicon.

## Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

### Relaxed

No ordering constraints, only atomic operations.

Corresponds to `memory_order_relaxed` in C++20.

§

### Release

When coupled with a store, all previous operations become ordered before any load of this value with `Acquire` (or stronger) ordering. In particular, all previous writes become visible to all threads that perform an `Acquire` (or stronger) load of this value.

Notice that using this ordering for an operation that combines loads and stores leads to a `Relaxed` load operation!

This ordering is only applicable for operations that can perform a store.

Corresponds to `memory_order_release` in C++20.

§

### Acquire

When coupled with a load, if the loaded value was written by a store operation with `Release` (or stronger) ordering, then all subsequent operations become ordered after that store. In particular, all subsequent loads will see data written before the store.

Notice that using this ordering for an operation that combines loads and stores leads to a `Relaxed` store operation!

This ordering is only applicable for operations that can perform a load.

Corresponds to `memory_order_acquire` in C++20.

§

### AcqRel

Has the effects of both `Acquire` and `Release` together: For loads it uses `Acquire` ordering. For stores it uses the `Release` ordering.

Notice that in the case of `compare_and_swap`, it is possible that the operation ends up not performing any store and hence it has just `Acquire` ordering. However, `AcqRel` will never perform `Relaxed` accesses.

This ordering is only applicable for operations that combine both loads and stores.

Corresponds to `memory_order_acq_rel` in C++20.

§

### SeqCst

Like `Acquire`/`Release`/`AcqRel` (for load, store, and load-with-store operations, respectively) with the additional guarantee that all threads see all sequentially consistent operations in the same order.

Corresponds to `memory_order_seq_cst` in C++20.

## Trait Implementations§

§

### impl Clone for Ordering

§

#### fn clone(&self) -> Ordering

Returns a copy of the value. Read more
§

#### fn clone_from(&mut self, source: &Self)

Performs copy-assignment from `source`. Read more
§

### impl Debug for Ordering

§

#### fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

### impl Hash for Ordering

§

#### fn hash<__H>(&self, state: &mut __H)where __H: Hasher,

Feeds this value into the given [`Hasher`]. Read more
1.3.0§

#### fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given [`Hasher`]. Read more
§

### impl PartialEq<Ordering> for Ordering

§

#### fn eq(&self, other: &Ordering) -> bool

This method tests for `self` and `other` values to be equal, and is used by `==`.
§

#### fn ne(&self, other: &Rhs) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
§

### impl Copy for Ordering

§

### impl Eq for Ordering

§

### impl StructuralEq for Ordering

§

### impl StructuralPartialEq for Ordering

## Auto Trait Implementations§

§

### impl RefUnwindSafe for Ordering

§

### impl Send for Ordering

§

### impl Sync for Ordering

§

### impl Unpin for Ordering

§

### impl UnwindSafe for Ordering

## Blanket Implementations§

§

### impl<T> Any for Twhere T: 'static + ?Sized,

§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
§

### impl<T> Borrow<T> for Twhere T: ?Sized,

§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
§

### impl<T> BorrowMut<T> for Twhere T: ?Sized,

§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

### impl<T> From<T> for T

§

#### fn from(t: T) -> T

Returns the argument unchanged.

§

### impl<T, U> Into<U> for Twhere U: From<T>,

§

#### fn into(self) -> U

Calls `U::from(self)`.

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

§

### impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

#### type Error = Infallible

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

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
§

### impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

#### type Error = <U as TryFrom<T>>::Error

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

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.