Struct Unsigned

Source
pub struct Unsigned<const L: u32>(/* private fields */);
Expand description

Unsigned bitvector.

The number of bits is specified in the generic parameter L. Unsigned bitvectors support bitwise operations and wrapping-arithmetic operations. Logical bit extension is also possible (any new bits are zero). Signed bitvectors be converted into Unsigned or Bitvector.

Implementations§

Source§

impl<const L: u32> Unsigned<L>

Source

pub fn new(value: u64) -> Self

Creates a new bitvector with the given value. Panics if the value does not fit into the type.

Trait Implementations§

Source§

impl<const L: u32> Add for Unsigned<L>

Source§

fn add(self, rhs: Unsigned<L>) -> Self::Output

Performs wrapping addition.

Source§

type Output = Unsigned<L>

The resulting type after applying the + operator.
Source§

impl<const L: u32> BitAnd for Unsigned<L>

Source§

fn bitand(self, rhs: Unsigned<L>) -> Self::Output

Performs bitwise AND.

Source§

type Output = Unsigned<L>

The resulting type after applying the & operator.
Source§

impl<const L: u32> BitOr for Unsigned<L>

Source§

fn bitor(self, rhs: Unsigned<L>) -> Self::Output

Performs bitwise OR.

Source§

type Output = Unsigned<L>

The resulting type after applying the | operator.
Source§

impl<const L: u32> BitXor for Unsigned<L>

Source§

fn bitxor(self, rhs: Unsigned<L>) -> Self::Output

Performs bitwise XOR.

Source§

type Output = Unsigned<L>

The resulting type after applying the ^ operator.
Source§

impl<const L: u32> Clone for Unsigned<L>

Source§

fn clone(&self) -> Unsigned<L>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<const L: u32> Debug for Unsigned<L>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<const L: u32> Div for Unsigned<L>

Source§

fn div(self, rhs: Unsigned<L>) -> Self::Output

Performs wrapping unsigned division.

While the division is defined to be wrapping, no wrapping actually can happen in unsigned division.

§Panics

Panics if rhs is zero.

Source§

type Output = Unsigned<L>

The resulting type after applying the / operator.
Source§

impl<const L: u32, const X: u32> Ext<X> for Unsigned<L>

Source§

fn ext(self) -> Self::Output

Extends or narrows the bit-vector.

If an extension is performed, the upper bits will be zero.

Source§

type Output = Unsigned<X>

Source§

impl<const L: u32> From<Bitvector<L>> for Unsigned<L>

Source§

fn from(value: Bitvector<L>) -> Self

Adds signedness information to Bitvector.

Source§

impl<const L: u32> From<Signed<L>> for Unsigned<L>

Source§

fn from(value: Signed<L>) -> Self

Converts the signedness information from Signed to Unsigned.

Source§

impl<const L: u32> From<Unsigned<L>> for Bitvector<L>

Source§

fn from(value: Unsigned<L>) -> Self

Drops the signedness information from Unsigned.

Source§

impl<const L: u32> From<Unsigned<L>> for Signed<L>

Source§

fn from(value: Unsigned<L>) -> Self

Converts the signedness information from Unsigned to Signed.

Source§

impl<const L: u32> Hash for Unsigned<L>

Source§

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

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

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

Feeds a slice of this type into the given Hasher. Read more
Source§

impl<const L: u32> Mul for Unsigned<L>

Source§

fn mul(self, rhs: Unsigned<L>) -> Self::Output

Performs wrapping multiplication.

Source§

type Output = Unsigned<L>

The resulting type after applying the * operator.
Source§

impl<const L: u32> Not for Unsigned<L>

Source§

fn not(self) -> Self::Output

Performs bitwise NOT.

Source§

type Output = Unsigned<L>

The resulting type after applying the ! operator.
Source§

impl<const L: u32> Ord for Unsigned<L>

Source§

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · Source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · Source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · Source§

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

Restrict a value to a certain interval. Read more
Source§

impl<const L: u32> PartialEq for Unsigned<L>

Source§

fn eq(&self, other: &Unsigned<L>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

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

impl<const L: u32> PartialOrd for Unsigned<L>

Source§

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · Source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · Source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · Source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · Source§

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

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

impl<const L: u32> Rem for Unsigned<L>

Source§

fn rem(self, rhs: Unsigned<L>) -> Self::Output

Performs wrapping unsigned remainer.

While the remainder is defined to be wrapping, no wrapping actually can happen in unsigned remainder.

§Panics

Panics if rhs is zero.

Source§

type Output = Unsigned<L>

The resulting type after applying the % operator.
Source§

impl<const L: u32> Shl for Unsigned<L>

Source§

fn shl(self, rhs: Unsigned<L>) -> Self::Output

Performs a left shift.

Unlike a right shift, where the behaviour is dependent on signedness, the left shift has the same behaviour: shifted-out bits on the left are discarded and zeros are shifted in on the right.

The right-hand side operand is interpreted as unsigned and if it is equal or greater to the bit-width, the result is all-zeros, as in Rust unbounded_shl. It is planned to restrict the bit-width in the future so that this edge case can never occur.

Source§

type Output = Unsigned<L>

The resulting type after applying the << operator.
Source§

impl<const L: u32> Shr for Unsigned<L>

Source§

fn shr(self, rhs: Unsigned<L>) -> Self::Output

Performs a logic right shift.

The right-hand side operand is interpreted as unsigned and if it is equal or greater to the bit-width, the result is all-zeros, as in Rust unbounded_shr on unsigned primitives. It is planned to restrict the bit-width in the future so that this edge case can never occur.

Source§

type Output = Unsigned<L>

The resulting type after applying the >> operator.
Source§

impl<const L: u32> Sub for Unsigned<L>

Source§

fn sub(self, rhs: Unsigned<L>) -> Self::Output

Performs wrapping subtraction.

Source§

type Output = Unsigned<L>

The resulting type after applying the - operator.
Source§

impl<const L: u32> Copy for Unsigned<L>

Source§

impl<const L: u32> Eq for Unsigned<L>

Source§

impl<const L: u32> StructuralPartialEq for Unsigned<L>

Auto Trait Implementations§

§

impl<const L: u32> Freeze for Unsigned<L>

§

impl<const L: u32> RefUnwindSafe for Unsigned<L>

§

impl<const L: u32> Send for Unsigned<L>

§

impl<const L: u32> Sync for Unsigned<L>

§

impl<const L: u32> Unpin for Unsigned<L>

§

impl<const L: u32> UnwindSafe for Unsigned<L>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<N> NodeTrait for N
where N: Copy + Ord + Hash,

Source§

impl<T, Rhs, Output> NumOps<Rhs, Output> for T
where T: Sub<Rhs, Output = Output> + Mul<Rhs, Output = Output> + Div<Rhs, Output = Output> + Add<Rhs, Output = Output> + Rem<Rhs, Output = Output>,