[−]Struct cv::knn::hnsw::typenum::uint::UTerm
The terminating type for UInt
; it always comes after the most significant
bit. UTerm
by itself represents zero, which is aliased to U0
.
Implementations
impl UTerm
Trait Implementations
impl Add<B0> for UTerm
UTerm + B0 = UTerm
type Output = UTerm
The resulting type after applying the +
operator.
fn add(self, B0) -> <UTerm as Add<B0>>::Output
impl Add<B1> for UTerm
UTerm + B1 = UInt<UTerm, B1>
type Output = UInt<UTerm, B1>
The resulting type after applying the +
operator.
fn add(self, B1) -> <UTerm as Add<B1>>::Output
impl<U> Add<U> for UTerm where
U: Unsigned,
U: Unsigned,
UTerm + U = U
type Output = U
The resulting type after applying the +
operator.
fn add(self, rhs: U) -> <UTerm as Add<U>>::Output
impl<U, B> Add<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned,
B: Bit,
U: Unsigned,
UInt<U, B> + UTerm = UInt<U, B>
type Output = UInt<U, B>
The resulting type after applying the +
operator.
fn add(self, UTerm) -> <UInt<U, B> as Add<UTerm>>::Output
impl<T> ArrayLength<T> for UTerm
type ArrayType
impl<Ur> BitAnd<Ur> for UTerm where
Ur: Unsigned,
Ur: Unsigned,
0 & X = 0
type Output = UTerm
The resulting type after applying the &
operator.
fn bitand(self, Ur) -> <UTerm as BitAnd<Ur>>::Output
impl<U> BitOr<U> for UTerm where
U: Unsigned,
U: Unsigned,
UTerm | X = X
type Output = U
The resulting type after applying the |
operator.
fn bitor(self, rhs: U) -> <UTerm as BitOr<U>>::Output
impl<B, U> BitOr<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned,
B: Bit,
U: Unsigned,
X | UTerm = X
type Output = UInt<U, B>
The resulting type after applying the |
operator.
fn bitor(self, UTerm) -> <UInt<U, B> as BitOr<UTerm>>::Output
impl<Ur> BitXor<Ur> for UTerm where
Ur: Unsigned,
Ur: Unsigned,
0 ^ X = X
type Output = Ur
The resulting type after applying the ^
operator.
fn bitxor(self, rhs: Ur) -> <UTerm as BitXor<Ur>>::Output
impl Clone for UTerm
fn clone(&self) -> UTerm
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<U, B> Cmp<UInt<U, B>> for UTerm where
B: Bit,
U: Unsigned,
B: Bit,
U: Unsigned,
Zero < Nonzero
type Output = Less
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
fn compare<IM>(&self, &UInt<U, B>) -> <UTerm as Cmp<UInt<U, B>>>::Output where
IM: InternalMarker,
IM: InternalMarker,
impl<U, B> Cmp<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned,
B: Bit,
U: Unsigned,
Nonzero > Zero
type Output = Greater
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
fn compare<IM>(&self, &UTerm) -> <UInt<U, B> as Cmp<UTerm>>::Output where
IM: InternalMarker,
IM: InternalMarker,
impl Cmp<UTerm> for UTerm
Zero == Zero
type Output = Equal
The result of the comparison. It should only ever be one of Greater
, Less
, or Equal
.
fn compare<IM>(&self, &UTerm) -> <UTerm as Cmp<UTerm>>::Output where
IM: InternalMarker,
IM: InternalMarker,
impl Copy for UTerm
impl Debug for UTerm
impl Default for UTerm
impl<Ur, Br> Div<UInt<Ur, Br>> for UTerm where
Br: Bit,
Ur: Unsigned,
Br: Bit,
Ur: Unsigned,
type Output = UTerm
The resulting type after applying the /
operator.
fn div(self, UInt<Ur, Br>) -> <UTerm as Div<UInt<Ur, Br>>>::Output
impl Eq for UTerm
impl<X> Gcd<UTerm> for X where
X: Unsigned + NonZero,
X: Unsigned + NonZero,
gcd(x, 0) = x
type Output = X
The greatest common divisor.
impl Gcd<UTerm> for UTerm
gcd(0, 0) = 0
impl<Y> Gcd<Y> for UTerm where
Y: Unsigned + NonZero,
Y: Unsigned + NonZero,
gcd(0, y) = y
type Output = Y
The greatest common divisor.
impl<I> GetBit<I> for UTerm
impl<Un, Bn> GetBit<UTerm> for UInt<Un, Bn> where
Bn: Copy,
Bn: Copy,
type Output = Bn
fn get_bit<IM>(&self, &UTerm) -> <UInt<Un, Bn> as GetBit<UTerm>>::Output where
IM: InternalMarker,
IM: InternalMarker,
impl Hash for UTerm
fn hash<__H>(&self, state: &mut __H) where
__H: Hasher,
__H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl Len for UTerm
Length of UTerm
by itself is 0
type Output = UTerm
The length as a type-level unsigned integer.
fn len(&self) -> <UTerm as Len>::Output
impl<U> Max<U> for UTerm where
U: Unsigned,
U: Unsigned,
type Output = U
The type of the maximum of Self
and Rhs
fn max(self, rhs: U) -> <UTerm as Max<U>>::Output
impl<U> Min<U> for UTerm where
U: Unsigned,
U: Unsigned,
type Output = UTerm
The type of the minimum of Self
and Rhs
fn min(self, U) -> <UTerm as Min<U>>::Output
impl Mul<B0> for UTerm
UTerm * B0 = UTerm
type Output = UTerm
The resulting type after applying the *
operator.
fn mul(self, B0) -> <UTerm as Mul<B0>>::Output
impl Mul<B1> for UTerm
UTerm * B1 = UTerm
type Output = UTerm
The resulting type after applying the *
operator.
fn mul(self, B1) -> <UTerm as Mul<B1>>::Output
impl<U> Mul<U> for UTerm where
U: Unsigned,
U: Unsigned,
UTerm * U = UTerm
type Output = UTerm
The resulting type after applying the *
operator.
fn mul(self, U) -> <UTerm as Mul<U>>::Output
impl<U, B> Mul<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned,
B: Bit,
U: Unsigned,
UInt<U, B> * UTerm = UTerm
type Output = UTerm
The resulting type after applying the *
operator.
fn mul(self, UTerm) -> <UInt<U, B> as Mul<UTerm>>::Output
impl NamedDim for UTerm
[src]
impl Ord for UTerm
fn cmp(&self, other: &UTerm) -> Ordering
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<Ur, Br> PartialDiv<UInt<Ur, Br>> for UTerm where
Br: Bit,
Ur: Unsigned,
Br: Bit,
Ur: Unsigned,
type Output = UTerm
The type of the result of the division
fn partial_div(
self,
UInt<Ur, Br>
) -> <UTerm as PartialDiv<UInt<Ur, Br>>>::Output
self,
UInt<Ur, Br>
) -> <UTerm as PartialDiv<UInt<Ur, Br>>>::Output
impl PartialEq<UTerm> for UTerm
impl PartialOrd<UTerm> for UTerm
fn partial_cmp(&self, other: &UTerm) -> Option<Ordering>
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl Pow<UTerm> for i64
type Output = i64
The result of the exponentiation.
fn powi(self, UTerm) -> <i64 as Pow<UTerm>>::Output
impl Pow<UTerm> for u8
type Output = u8
The result of the exponentiation.
fn powi(self, UTerm) -> <u8 as Pow<UTerm>>::Output
impl Pow<UTerm> for f32
type Output = f32
The result of the exponentiation.
fn powi(self, UTerm) -> <f32 as Pow<UTerm>>::Output
impl Pow<UTerm> for i16
type Output = i16
The result of the exponentiation.
fn powi(self, UTerm) -> <i16 as Pow<UTerm>>::Output
impl Pow<UTerm> for isize
type Output = isize
The result of the exponentiation.
fn powi(self, UTerm) -> <isize as Pow<UTerm>>::Output
impl Pow<UTerm> for u16
type Output = u16
The result of the exponentiation.
fn powi(self, UTerm) -> <u16 as Pow<UTerm>>::Output
impl Pow<UTerm> for u32
type Output = u32
The result of the exponentiation.
fn powi(self, UTerm) -> <u32 as Pow<UTerm>>::Output
impl Pow<UTerm> for usize
type Output = usize
The result of the exponentiation.
fn powi(self, UTerm) -> <usize as Pow<UTerm>>::Output
impl Pow<UTerm> for i32
type Output = i32
The result of the exponentiation.
fn powi(self, UTerm) -> <i32 as Pow<UTerm>>::Output
impl Pow<UTerm> for f64
type Output = f64
The result of the exponentiation.
fn powi(self, UTerm) -> <f64 as Pow<UTerm>>::Output
impl Pow<UTerm> for i8
type Output = i8
The result of the exponentiation.
fn powi(self, UTerm) -> <i8 as Pow<UTerm>>::Output
impl Pow<UTerm> for u64
type Output = u64
The result of the exponentiation.
fn powi(self, UTerm) -> <u64 as Pow<UTerm>>::Output
impl<Ur, Br> Rem<UInt<Ur, Br>> for UTerm where
Br: Bit,
Ur: Unsigned,
Br: Bit,
Ur: Unsigned,
type Output = UTerm
The resulting type after applying the %
operator.
fn rem(self, UInt<Ur, Br>) -> <UTerm as Rem<UInt<Ur, Br>>>::Output
impl Shl<B0> for UTerm
Shifting UTerm
by a 0 bit: UTerm << B0 = UTerm
type Output = UTerm
The resulting type after applying the <<
operator.
fn shl(self, B0) -> <UTerm as Shl<B0>>::Output
impl Shl<B1> for UTerm
Shifting UTerm
by a 1 bit: UTerm << B1 = UTerm
type Output = UTerm
The resulting type after applying the <<
operator.
fn shl(self, B1) -> <UTerm as Shl<B1>>::Output
impl<U> Shl<U> for UTerm where
U: Unsigned,
U: Unsigned,
Shifting left UTerm
by an unsigned integer: UTerm << U = UTerm
type Output = UTerm
The resulting type after applying the <<
operator.
fn shl(self, U) -> <UTerm as Shl<U>>::Output
impl<U, B> Shl<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned,
B: Bit,
U: Unsigned,
Shifting left UInt
by UTerm
: UInt<U, B> << UTerm = UInt<U, B>
type Output = UInt<U, B>
The resulting type after applying the <<
operator.
fn shl(self, UTerm) -> <UInt<U, B> as Shl<UTerm>>::Output
impl Shr<B0> for UTerm
Shifting right UTerm
by a 0 bit: UTerm >> B0 = UTerm
type Output = UTerm
The resulting type after applying the >>
operator.
fn shr(self, B0) -> <UTerm as Shr<B0>>::Output
impl Shr<B1> for UTerm
Shifting right UTerm
by a 1 bit: UTerm >> B1 = UTerm
type Output = UTerm
The resulting type after applying the >>
operator.
fn shr(self, B1) -> <UTerm as Shr<B1>>::Output
impl<U> Shr<U> for UTerm where
U: Unsigned,
U: Unsigned,
Shifting right a UTerm
by an unsigned integer: UTerm >> U = UTerm
type Output = UTerm
The resulting type after applying the >>
operator.
fn shr(self, U) -> <UTerm as Shr<U>>::Output
impl<U, B> Shr<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned,
B: Bit,
U: Unsigned,
Shifting right UInt
by UTerm
: UInt<U, B> >> UTerm = UInt<U, B>
type Output = UInt<U, B>
The resulting type after applying the >>
operator.
fn shr(self, UTerm) -> <UInt<U, B> as Shr<UTerm>>::Output
impl StructuralEq for UTerm
impl StructuralPartialEq for UTerm
impl Sub<B0> for UTerm
UTerm - B0 = Term
type Output = UTerm
The resulting type after applying the -
operator.
fn sub(self, B0) -> <UTerm as Sub<B0>>::Output
impl Sub<UTerm> for UTerm
UTerm - UTerm = UTerm
type Output = UTerm
The resulting type after applying the -
operator.
fn sub(self, UTerm) -> <UTerm as Sub<UTerm>>::Output
impl Unsigned for UTerm
const U8: u8
const U16: u16
const U32: u32
const U64: u64
const USIZE: usize
const I8: i8
const I16: i16
const I32: i32
const I64: i64
const ISIZE: isize
fn to_u8() -> u8
fn to_u16() -> u16
fn to_u32() -> u32
fn to_u64() -> u64
fn to_usize() -> usize
fn to_i8() -> i8
fn to_i16() -> i16
fn to_i32() -> i32
fn to_i64() -> i64
fn to_isize() -> isize
Auto Trait Implementations
impl RefUnwindSafe for UTerm
impl Send for UTerm
impl Sync for UTerm
impl Unpin for UTerm
impl UnwindSafe for UTerm
Blanket Implementations
impl<T, N1, N2> AddLength<T, N2> for N1 where
N1: ArrayLength<T> + Add<N2>,
N2: ArrayLength<T>,
<N1 as Add<N2>>::Output: ArrayLength<T>,
N1: ArrayLength<T> + Add<N2>,
N2: ArrayLength<T>,
<N1 as Add<N2>>::Output: ArrayLength<T>,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<X> Gcd<UTerm> for X where
X: Unsigned + NonZero,
X: Unsigned + NonZero,
type Output = X
The greatest common divisor.
impl<X> Gcd<UTerm> for X where
X: Unsigned + NonZero,
X: Unsigned + NonZero,
type Output = X
The greatest common divisor.
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<A, B> IsEqual<B> for A where
A: Cmp<B> + IsEqualPrivate<B, <A as Cmp<B>>::Output>,
A: Cmp<B> + IsEqualPrivate<B, <A as Cmp<B>>::Output>,
type Output = <A as IsEqualPrivate<B, <A as Cmp<B>>::Output>>::Output
The type representing either True
or False
fn is_equal(self, rhs: B) -> <A as IsEqual<B>>::Output
impl<A, B> IsGreater<B> for A where
A: Cmp<B> + IsGreaterPrivate<B, <A as Cmp<B>>::Output>,
A: Cmp<B> + IsGreaterPrivate<B, <A as Cmp<B>>::Output>,
type Output = <A as IsGreaterPrivate<B, <A as Cmp<B>>::Output>>::Output
The type representing either True
or False
fn is_greater(self, rhs: B) -> <A as IsGreater<B>>::Output
impl<A, B> IsGreaterOrEqual<B> for A where
A: Cmp<B> + IsGreaterOrEqualPrivate<B, <A as Cmp<B>>::Output>,
A: Cmp<B> + IsGreaterOrEqualPrivate<B, <A as Cmp<B>>::Output>,
type Output = <A as IsGreaterOrEqualPrivate<B, <A as Cmp<B>>::Output>>::Output
The type representing either True
or False
fn is_greater_or_equal(self, rhs: B) -> <A as IsGreaterOrEqual<B>>::Output
impl<A, B> IsLess<B> for A where
A: Cmp<B> + IsLessPrivate<B, <A as Cmp<B>>::Output>,
A: Cmp<B> + IsLessPrivate<B, <A as Cmp<B>>::Output>,
type Output = <A as IsLessPrivate<B, <A as Cmp<B>>::Output>>::Output
The type representing either True
or False
fn is_less(self, rhs: B) -> <A as IsLess<B>>::Output
impl<A, B> IsLessOrEqual<B> for A where
A: Cmp<B> + IsLessOrEqualPrivate<B, <A as Cmp<B>>::Output>,
A: Cmp<B> + IsLessOrEqualPrivate<B, <A as Cmp<B>>::Output>,
type Output = <A as IsLessOrEqualPrivate<B, <A as Cmp<B>>::Output>>::Output
The type representing either True
or False
fn is_less_or_equal(self, rhs: B) -> <A as IsLessOrEqual<B>>::Output
impl<A, B> IsNotEqual<B> for A where
A: Cmp<B> + IsNotEqualPrivate<B, <A as Cmp<B>>::Output>,
A: Cmp<B> + IsNotEqualPrivate<B, <A as Cmp<B>>::Output>,
type Output = <A as IsNotEqualPrivate<B, <A as Cmp<B>>::Output>>::Output
The type representing either True
or False
fn is_not_equal(self, rhs: B) -> <A as IsNotEqual<B>>::Output
impl<M, N> PartialDiv<N> for M where
M: Integer + Div<N> + Rem<N, Output = Z0>,
M: Integer + Div<N> + Rem<N, Output = Z0>,
type Output = <M as Div<N>>::Output
The type of the result of the division
fn partial_div(self, rhs: N) -> <M as PartialDiv<N>>::Output
impl<X, N> Pow<N> for X where
N: Unsigned,
X: Unsigned + PrivatePow<UInt<UTerm, B1>, N>,
N: Unsigned,
X: Unsigned + PrivatePow<UInt<UTerm, B1>, N>,
type Output = <X as PrivatePow<UInt<UTerm, B1>, N>>::Output
The result of the exponentiation.
fn powi(self, n: N) -> <X as Pow<N>>::Output
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> Scalar for T where
T: PartialEq<T> + Copy + Any + Debug,
[src]
T: PartialEq<T> + Copy + Any + Debug,
impl<N, I, B> SetBit<I, B> for N where
N: PrivateSetBit<I, B>,
<N as PrivateSetBit<I, B>>::Output: Trim,
N: PrivateSetBit<I, B>,
<N as PrivateSetBit<I, B>>::Output: Trim,
type Output = <<N as PrivateSetBit<I, B>>::Output as Trim>::Output
fn set_bit<IM>(self, i: I, b: B) -> <N as SetBit<I, B>>::Output where
IM: InternalMarker,
IM: InternalMarker,
impl<N> SquareRoot for N where
N: PrivateSquareRoot,
N: PrivateSquareRoot,
type Output = <N as PrivateSquareRoot>::Output
The result of the integer square root.
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,