Expand description
Type-level signed integers with negative sign.
Instantiates a singleton representing this strictly negative integer.
N(Ul) + N(Ur) = N(Ul + Ur)
The resulting type after applying the +
operator.
P(Ul) + N(Ur)
: We resolve this with our PrivateAdd
type Output = <Ul as PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>>::Output
The resulting type after applying the +
operator.
N(Ul) + P(Ur)
: We resolve this with our PrivateAdd
type Output = <Ur as PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>>::Output
The resulting type after applying the +
operator.
The resulting type after applying the +
operator.
Performs copy-assignment from source
. Read more
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
Formats the value using the given formatter. Read more
Returns the “default value” for a type. Read more
$A<Ul> / $B<Ur> = $R<Ul / Ur>
The resulting type after applying the /
operator.
$A<Ul> / $B<Ur> = $R<Ul / Ur>
The resulting type after applying the /
operator.
$A<Ul> / $B<Ur> = $R<Ul / Ur>
The resulting type after applying the /
operator.
The greatest common divisor.
The greatest common divisor.
The greatest common divisor.
The greatest common divisor.
The greatest common divisor.
The type of the maximum of Self
and Rhs
Method returning the maximum
The type of the maximum of Self
and Rhs
Method returning the maximum
The type of the maximum of Self
and Rhs
Method returning the maximum
The type of the maximum of Self
and Rhs
Method returning the maximum
The type of the maximum of Self
and Rhs
Method returning the maximum
The type of the minimum of Self
and Rhs
Method returning the minimum
The type of the minimum of Self
and Rhs
Method returning the minimum
The type of the minimum of Self
and Rhs
Method returning the minimum
The type of the minimum of Self
and Rhs
Method returning the minimum
The type of the minimum of Self
and Rhs
Method returning the minimum
The resulting type after applying the *
operator.
N(Ul) * N(Ur) = P(Ul * Ur)
The resulting type after applying the *
operator.
P(Ul) * N(Ur) = N(Ul * Ur)
The resulting type after applying the *
operator.
N(Ul) * P(Ur) = N(Ul * Ur)
The resulting type after applying the *
operator.
The resulting type after applying the *
operator.
The resulting type after applying the *
operator.
The resulting type after applying the -
operator.
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
fn clamp(self, min: Self, max: Self) -> Self
Restrict a value to a certain interval. Read more
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
The result of the exponentiation.
This function isn’t used in this crate, but may be useful for others.
It is implemented for primitives. Read more
The result of the exponentiation.
This function isn’t used in this crate, but may be useful for others.
It is implemented for primitives. Read more
The result of the exponentiation.
This function isn’t used in this crate, but may be useful for others.
It is implemented for primitives. Read more
The result of the exponentiation.
This function isn’t used in this crate, but may be useful for others.
It is implemented for primitives. Read more
N(Ul)^P(Ur) = P(Ul^Ur) if Ur is even
The result of the exponentiation.
This function isn’t used in this crate, but may be useful for others.
It is implemented for primitives. Read more
N(Ul)^P(Ur) = N(Ul^Ur) if Ur is odd
The result of the exponentiation.
This function isn’t used in this crate, but may be useful for others.
It is implemented for primitives. Read more
The result of the exponentiation.
This function isn’t used in this crate, but may be useful for others.
It is implemented for primitives. Read more
$A<Ul> % $B<Ur> = $R<Ul % Ur>
The resulting type after applying the %
operator.
$A<Ul> % $B<Ur> = $R<Ul % Ur>
The resulting type after applying the %
operator.
$A<Ul> % $B<Ur> = $R<Ul % Ur>
The resulting type after applying the %
operator.
The resulting type after applying the -
operator.
N(Ul) - N(Ur)
: We resolve this with our PrivateAdd
type Output = <Ur as PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>>::Output
The resulting type after applying the -
operator.
P(Ul) - N(Ur) = P(Ul + Ur)
The resulting type after applying the -
operator.
N(Ul) - P(Ur) = N(Ul + Ur)
The resulting type after applying the -
operator.
The resulting type after applying the -
operator.
impl<T> Any for T where
T: 'static + ?Sized,
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
impl<T> CallHasher for T where
T: Hash,
impl<T> CallHasher for T where
T: Hash + ?Sized,
Convert from a value of T
into an equivalent instance of Option<Self>
. Read more
Consume self to return Some
equivalent value of Option<T>
. Read more
True iff no bits are set.
Return the value of Self that is clear.
impl<T> Downcast for T where
T: Any,
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
Convert Arc<Trait>
(where Trait: Downcast
) to Arc<Any>
. Arc<Any>
can then be
further downcast
into Arc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Compare self to key
and return true
if they are equal.
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
Instruments this type with the current Span
, returning an
Instrumented
wrapper. Read more
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
Instruments this type with the current Span
, returning an
Instrumented
wrapper. Read more
impl<T, U> Into<U> for T where
U: From<T>,
Get a reference to the inner from the outer.
Get a mutable reference to the inner from the outer.
The type of the result of the division
Method for performing the division
The alignment of pointer.
The type for initializers.
pub unsafe fn init(init: <T as Pointable>::Init) -> usize
Initializes a with the given initializer. Read more
Mutably dereferences the given pointer. Read more
Drops the object pointed to by the given pointer. Read more
Convert from a value of T
into an equivalent instance of Self
. Read more
Consume self to return an equivalent value of T
. Read more
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
The type returned in the event of a conversion error.
The counterpart to unchecked_from
.
Consume self to return an equivalent value of T
.
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<T> MaybeDebug for T where
T: Debug,
impl<T> MaybeDebug for T where
T: Debug,
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>,