pub struct PInt<U: Unsigned + NonZero> { /* private fields */ }Expand description
Type-level signed integers with positive sign.
Implementations§
Trait Implementations§
Source§impl<Ul, Ur: Unsigned + NonZero> Add<NInt<Ur>> for PInt<Ul>
P(Ul) + N(Ur): We resolve this with our PrivateAdd
impl<Ul, Ur: Unsigned + NonZero> Add<NInt<Ur>> for PInt<Ul>
P(Ul) + N(Ur): We resolve this with our PrivateAdd
Source§impl<Ul: Unsigned + NonZero, Ur> Add<PInt<Ur>> for NInt<Ul>
N(Ul) + P(Ur): We resolve this with our PrivateAdd
impl<Ul: Unsigned + NonZero, Ur> Add<PInt<Ur>> for NInt<Ul>
N(Ul) + P(Ur): We resolve this with our PrivateAdd
Source§impl<Pl: Cmp<Pr> + Unsigned + NonZero, Pr: Unsigned + NonZero> Cmp<PInt<Pr>> for PInt<Pl>
X <==> Y
impl<Pl: Cmp<Pr> + Unsigned + NonZero, Pr: Unsigned + NonZero> Cmp<PInt<Pr>> for PInt<Pl>
X <==> Y
Source§impl<U: Eq + Unsigned + NonZero> Eq for PInt<U>
impl<U: Eq + Unsigned + NonZero> Eq for PInt<U>
#[doc(hidden)] fn assert_receiver_is_total_eq(&self)
Source§impl<U: Ord + Unsigned + NonZero> Ord for PInt<U>
impl<U: Ord + Unsigned + NonZero> Ord for PInt<U>
Source§impl<U: PartialOrd + Unsigned + NonZero> PartialOrd for PInt<U>
impl<U: PartialOrd + Unsigned + NonZero> PartialOrd for PInt<U>
Source§#[doc(hidden)] fn __chaining_lt(&self, other: &Rhs) -> ControlFlow<bool>
#[doc(hidden)] fn __chaining_lt(&self, other: &Rhs) -> ControlFlow<bool>
🔬This is a nightly-only experimental API. (
partial_ord_chaining_methods)If
self == other, returns ControlFlow::Continue(()).
Otherwise, returns ControlFlow::Break(self < other). Read moreSource§#[doc(hidden)] fn __chaining_le(&self, other: &Rhs) -> ControlFlow<bool>
#[doc(hidden)] fn __chaining_le(&self, other: &Rhs) -> ControlFlow<bool>
🔬This is a nightly-only experimental API. (
partial_ord_chaining_methods)Same as
__chaining_lt, but for <= instead of <.Source§#[doc(hidden)] fn __chaining_gt(&self, other: &Rhs) -> ControlFlow<bool>
#[doc(hidden)] fn __chaining_gt(&self, other: &Rhs) -> ControlFlow<bool>
🔬This is a nightly-only experimental API. (
partial_ord_chaining_methods)Same as
__chaining_lt, but for > instead of <.Source§#[doc(hidden)] fn __chaining_ge(&self, other: &Rhs) -> ControlFlow<bool>
#[doc(hidden)] fn __chaining_ge(&self, other: &Rhs) -> ControlFlow<bool>
🔬This is a nightly-only experimental API. (
partial_ord_chaining_methods)Same as
__chaining_lt, but for >= instead of <.Source§impl<Ul, Ur: Unsigned> Pow<PInt<UInt<Ur, B0>>> for NInt<Ul>
N(Ul)^P(Ur) = P(Ul^Ur) if Ur is even
impl<Ul, Ur: Unsigned> Pow<PInt<UInt<Ur, B0>>> for NInt<Ul>
N(Ul)^P(Ur) = P(Ul^Ur) if Ur is even
Source§impl<Ul, Ur: Unsigned> Pow<PInt<UInt<Ur, B1>>> for NInt<Ul>
N(Ul)^P(Ur) = N(Ul^Ur) if Ur is odd
impl<Ul, Ur: Unsigned> Pow<PInt<UInt<Ur, B1>>> for NInt<Ul>
N(Ul)^P(Ur) = N(Ul^Ur) if Ur is odd
Source§impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> PrivateRem<UTerm, NInt<Ur>> for PInt<Ul>
impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> PrivateRem<UTerm, NInt<Ur>> for PInt<Ul>
Source§impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> PrivateRem<UTerm, PInt<Ur>> for NInt<Ul>
impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> PrivateRem<UTerm, PInt<Ur>> for NInt<Ul>
Source§impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> PrivateRem<UTerm, PInt<Ur>> for PInt<Ul>
impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> PrivateRem<UTerm, PInt<Ur>> for PInt<Ul>
Source§impl<Ul, Ur: Unsigned + NonZero> Sub<PInt<Ur>> for PInt<Ul>
P(Ul) - P(Ur): We resolve this with our PrivateAdd
impl<Ul, Ur: Unsigned + NonZero> Sub<PInt<Ur>> for PInt<Ul>
P(Ul) - P(Ur): We resolve this with our PrivateAdd
impl<U: Copy + Unsigned + NonZero> Copy for PInt<U>
impl<U: Unsigned + NonZero> NonZero for PInt<U>
impl<U: Unsigned + NonZero + PowerOfTwo> PowerOfTwo for PInt<U>
impl<U: Unsigned + NonZero> StructuralPartialEq for PInt<U>
Auto Trait Implementations§
impl<U> Freeze for PInt<U>where
U: Freeze,
impl<U> RefUnwindSafe for PInt<U>where
U: RefUnwindSafe,
impl<U> Send for PInt<U>where
U: Send,
impl<U> Sync for PInt<U>where
U: Sync,
impl<U> Unpin for PInt<U>where
U: Unpin,
impl<U> UnwindSafe for PInt<U>where
U: UnwindSafe,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<A, B> IsEqualPrivate<B, Equal> for A
impl<A, B> IsEqualPrivate<B, Equal> for A
Source§impl<A, B> IsEqualPrivate<B, Greater> for A
impl<A, B> IsEqualPrivate<B, Greater> for A
Source§impl<A, B> IsEqualPrivate<B, Less> for A
impl<A, B> IsEqualPrivate<B, Less> for A
Source§impl<A, B> IsGreaterOrEqualPrivate<B, Equal> for A
impl<A, B> IsGreaterOrEqualPrivate<B, Equal> for A
Source§impl<A, B> IsGreaterOrEqualPrivate<B, Greater> for A
impl<A, B> IsGreaterOrEqualPrivate<B, Greater> for A
Source§impl<A, B> IsGreaterOrEqualPrivate<B, Less> for A
impl<A, B> IsGreaterOrEqualPrivate<B, Less> for A
Source§impl<A, B> IsGreaterPrivate<B, Equal> for A
impl<A, B> IsGreaterPrivate<B, Equal> for A
Source§impl<A, B> IsGreaterPrivate<B, Greater> for A
impl<A, B> IsGreaterPrivate<B, Greater> for A
Source§impl<A, B> IsGreaterPrivate<B, Less> for A
impl<A, B> IsGreaterPrivate<B, Less> for A
Source§impl<A, B> IsLessOrEqualPrivate<B, Equal> for A
impl<A, B> IsLessOrEqualPrivate<B, Equal> for A
Source§impl<A, B> IsLessOrEqualPrivate<B, Greater> for A
impl<A, B> IsLessOrEqualPrivate<B, Greater> for A
Source§impl<A, B> IsLessOrEqualPrivate<B, Less> for A
impl<A, B> IsLessOrEqualPrivate<B, Less> for A
Source§impl<A, B> IsLessPrivate<B, Equal> for A
impl<A, B> IsLessPrivate<B, Equal> for A
Source§impl<A, B> IsLessPrivate<B, Greater> for A
impl<A, B> IsLessPrivate<B, Greater> for A
Source§impl<A, B> IsLessPrivate<B, Less> for A
impl<A, B> IsLessPrivate<B, Less> for A
Source§impl<A, B> IsNotEqualPrivate<B, Equal> for A
impl<A, B> IsNotEqualPrivate<B, Equal> for A
Source§impl<A, B> IsNotEqualPrivate<B, Greater> for A
impl<A, B> IsNotEqualPrivate<B, Greater> for A
Source§impl<A, B> IsNotEqualPrivate<B, Less> for A
impl<A, B> IsNotEqualPrivate<B, Less> for A
Source§impl<M, N> PartialDiv<N> for M
impl<M, N> PartialDiv<N> for M
Source§fn partial_div(self, rhs: N) -> <M as PartialDiv<N>>::Output
fn partial_div(self, rhs: N) -> <M as PartialDiv<N>>::Output
Method for performing the division
Source§impl<T> SizedTypeProperties for T
impl<T> SizedTypeProperties for T
Source§#[doc(hidden)] const SIZE: usize = _
#[doc(hidden)] const SIZE: usize = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)] const ALIGN: usize = _
#[doc(hidden)] const ALIGN: usize = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)] const IS_ZST: bool = _
#[doc(hidden)] const IS_ZST: bool = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)] const LAYOUT: Layout = _
#[doc(hidden)] const LAYOUT: Layout = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)] const MAX_SLICE_LEN: usize = _
#[doc(hidden)] const MAX_SLICE_LEN: usize = _
🔬This is a nightly-only experimental API. (
sized_type_properties)The largest safe length for a
[Self]. Read more