Struct R

pub struct R<U, M> { /* private fields */ }

Register field reader.

Implementations

impl<U, M> R<U, M>

where U: Copy,

pub fn new(bits: U) -> Self

Create new instance of reader

pub fn bits(&self) -> U

Read raw bits from register/bitfield

impl<FI> R<bool, FI>

pub fn bit(&self) -> bool

Returns value of the bit.

pub fn bit_is_clear(&self) -> bool

Returns true if the bit is clear (0).

pub fn bit_is_set(&self) -> bool

Returns true is the bit is set (1).

impl R<bool, B0fsA>

pub fn variant(&self) -> B0fsA

pub fn is_high(&self) -> bool

pub fn is_low(&self) -> bool

impl R<bool, B0feA>

pub fn variant(&self) -> B0feA

pub fn is_high(&self) -> bool

pub fn is_low(&self) -> bool

impl R<bool, B0fmA>

pub fn variant(&self) -> B0fmA

pub fn is_high(&self) -> bool

pub fn is_low(&self) -> bool

impl R<u8, BFPCTRL>

pub fn b0fs(&self) -> R<bool, B0fsA>

pub fn b0fe(&self) -> R<bool, B0feA>

pub fn b0fm(&self) -> R<bool, B0feA>

Trait Implementations

impl<U, T, FI> PartialEq<FI> for R<U, T>

where U: PartialEq, FI: Copy + Into<U>,

fn eq(&self, other: &FI) -> 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.