Struct Bitfield

pub struct Bitfield<T, U> { /* private fields */ }

Implementations

impl<T, U> Bitfield<T, U>

pub fn new(inner: T) -> Self

pub fn into_inner(self) -> T

pub fn inner(&self) -> &T

pub fn inner_mut(&mut self) -> &mut T

impl<T: UnsignedPrimInt, const N: usize> Bitfield<[T; N], T>

pub fn zeroed() -> Self

impl<T: AsRef<[U]>, U: UnsignedPrimInt> Bitfield<T, U>

pub fn bits(&self) -> &[U]

pub fn get_bits<V: UnsignedPrimInt + TryFrom<U>>( &self, range: Range<usize>, ) -> V

pub fn get_bits_into_slice<V>( &self, range: Range<usize>, dst: &mut [V], dst_start: usize, )

where V: UnsignedPrimInt + TryFrom<usize>, usize: TryFrom<U>,

pub fn get<V: PrimInt>(&self, start_bit: usize) -> V

where V::Unsigned: TryFrom<U>,

impl<T: AsMut<[U]>, U: UnsignedPrimInt> Bitfield<T, U>

pub fn bits_mut(&mut self) -> &mut [U]

pub fn set_bits<V: UnsignedPrimInt + TryInto<U>>( &mut self, range: Range<usize>, src: V, )

pub fn set_bits_from_slice<V: UnsignedPrimInt>( &mut self, range: Range<usize>, src: &[V], src_start: usize, )

where U: TryFrom<usize>, usize: TryFrom<V>,

pub fn set<V: PrimInt>(&mut self, start_bit: usize, src: V)

where V::Unsigned: TryInto<U>,

Trait Implementations

impl<T: Clone, U: Clone> Clone for Bitfield<T, U>

fn clone(&self) -> Bitfield<T, U>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, U: Debug> Debug for Bitfield<T, U>

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

Formats the value using the given formatter.

impl<T: Hash, U: Hash> Hash for Bitfield<T, U>

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<T: Ord, U: Ord> Ord for Bitfield<T, U>

fn cmp(&self, other: &Bitfield<T, U>) -> Ordering

This method returns an [Ordering] between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq, U: PartialEq> PartialEq for Bitfield<T, U>

fn eq(&self, other: &Bitfield<T, U>) -> 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<T: PartialOrd, U: PartialOrd> PartialOrd for Bitfield<T, U>

fn partial_cmp(&self, other: &Bitfield<T, U>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Copy, U: Copy> Copy for Bitfield<T, U>

impl<T: Eq, U: Eq> Eq for Bitfield<T, U>

impl<T, U> StructuralPartialEq for Bitfield<T, U>