Struct MemoryOrdering 

pub struct MemoryOrdering(/* private fields */);

Implementations

impl MemoryOrdering

pub fn empty() -> MemoryOrdering

pub fn all() -> MemoryOrdering

pub fn is_empty(&self) -> bool

pub fn contains(&self, val: MemoryOrdering) -> bool

pub fn bits(&self) -> u32

pub fn insert(&mut self, val: MemoryOrdering)

pub fn count(&self) -> u32

Trait Implementations

impl Clone for MemoryOrdering

fn clone(&self) -> MemoryOrdering

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for MemoryOrdering

impl Debug for MemoryOrdering

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

Formats the value using the given formatter.

impl From<u32> for MemoryOrdering

fn from(val: u32) -> MemoryOrdering

Converts to this type from the input type.

impl Hash for MemoryOrdering

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for MemoryOrdering

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for MemoryOrdering