Struct UA_DataSetOrderingType

#[repr(transparent)]
pub struct UA_DataSetOrderingType(pub c_uint);

Tuple Fields

0: c_uint

Implementations

impl UA_DataSetOrderingType

pub const UA_DATASETORDERINGTYPE_UNDEFINED: UA_DataSetOrderingType

impl UA_DataSetOrderingType

pub const UA_DATASETORDERINGTYPE_ASCENDINGWRITERID: UA_DataSetOrderingType

impl UA_DataSetOrderingType

pub const UA_DATASETORDERINGTYPE_ASCENDINGWRITERIDSINGLE: UA_DataSetOrderingType

impl UA_DataSetOrderingType

pub const __UA_DATASETORDERINGTYPE_FORCE32BIT: UA_DataSetOrderingType

Trait Implementations

impl Clone for UA_DataSetOrderingType

fn clone(&self) -> UA_DataSetOrderingType

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for UA_DataSetOrderingType

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

Formats the value using the given formatter.

impl Hash for UA_DataSetOrderingType

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 UA_DataSetOrderingType

fn eq(&self, other: &UA_DataSetOrderingType) -> 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 Eq for UA_DataSetOrderingType

impl StructuralPartialEq for UA_DataSetOrderingType