`pub struct B1;`

## Expand description

The type-level bit 1.

## Implementations§

## Trait Implementations§

source§### impl<U> Add<B1> for UInt<U, B1>where
U: Add<B1> + Unsigned,
Add1<U>: Unsigned,

### impl<U> Add<B1> for UInt<U, B1>where U: Add<B1> + Unsigned, Add1<U>: Unsigned,

`UInt<U, B1> + B1 = UInt<U + B1, B0>`

source§### impl Ord for B1

### impl Ord for B1

source§### impl PartialOrd<B1> for B1

### impl PartialOrd<B1> for B1

1.0.0 · source§#### fn le(&self, other: &Rhs) -> bool

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

This method tests less than or equal to (for

`self`

and `other`

) and is used by the `<=`

operator. Read moresource§### impl<U: Unsigned, B: Bit> Shl<B1> for UInt<U, B>

### impl<U: Unsigned, B: Bit> Shl<B1> for UInt<U, B>

Shifting left a `UInt`

by a one bit: `UInt<U, B> << B1 = UInt<UInt<U, B>, B0>`

source§### impl<U: Unsigned, B: Bit> Shr<B1> for UInt<U, B>

### impl<U: Unsigned, B: Bit> Shr<B1> for UInt<U, B>

Shifting right a `UInt`

by a 1 bit: `UInt<U, B> >> B1 = U`

source§### impl<U> Sub<B1> for UInt<U, B0>where
U: Sub<B1> + Unsigned,
Sub1<U>: Unsigned,

### impl<U> Sub<B1> for UInt<U, B0>where U: Sub<B1> + Unsigned, Sub1<U>: Unsigned,

`UInt<U, B0> - B1 = UInt<U - B1, B1>`

### impl Copy for B1

### impl Eq for B1

### impl NonZero for B1

### impl PowerOfTwo for B1

### impl StructuralEq for B1

### impl StructuralPartialEq for B1

## Auto Trait Implementations§

### impl RefUnwindSafe for B1

### impl Send for B1

### impl Sync for B1

### impl Unpin for B1

### impl UnwindSafe for B1

## Blanket Implementations§

source§### impl<T> BorrowMut<T> for Twhere
T: ?Sized,

### impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§#### fn borrow_mut(&mut self) -> &mut T

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

Mutably borrows from an owned value. Read more