Enum BitOrder 

pub enum BitOrder {
    Lsb0,
    Msb0,
}

This enum indicates the order in which bits are traversed and counted.

Msb0 indicates that the MSB (Most Significant Bit) should be considered as position 0 and consequently bits should be counted from the MSB to the LSB.

Lsb0 indicates tht the LSB (Least Significant Bit) should be considered as position 0 and the bits should therefore be counter from the LSB to the MSB.

Here is an illustrative example:

Examples

let val: u8 = 0b1011_1100;

Counting 4 bits from the Msb0 would yield 1011 while counting 4 bits from the Lsb0 would result in 1100

Variants

Lsb0

Counts bits from the LSB (Least Significant Bit) to the MSB (Most Significant Bit).

Msb0

Counts bits from the MSB (Most Significant Bit) to the LSB (Least Significant Bit).

Trait Implementations

impl Clone for BitOrder

fn clone(&self) -> BitOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BitOrder

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

Formats the value using the given formatter.

impl PartialEq for BitOrder

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

impl Eq for BitOrder

impl StructuralPartialEq for BitOrder