[−][src]Struct competitive_hpp::modulo::mod_int::ModInt
Example
use competitive_hpp::prelude::*; const MOD: usize = 7; let mi0 = ModInt::new_with(0, MOD); let mi1 = ModInt::new_with(1, MOD); let mi2 = ModInt::new_with(2, MOD); let mi11 = ModInt::new_with(11, MOD); assert_eq!(4, ModInt::new(4)); assert_eq!(mi0 + mi11, ModInt::new_with(4, 7)); assert_eq!(mi1 + mi2, ModInt::new_with(3, 7));
Fields
value: T
modulo: T
Trait Implementations
impl<T> Add<ModInt<T>> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, other: ModInt<T>) -> Self
[src]
impl<T> Add<ModInt<T>> for i8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for usize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for i16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for i32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for i64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for u8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for u16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for u32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for u64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<ModInt<T>> for isize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Add<T> for ModInt<T> where
T: NumOps + PartialOrd + Copy,
[src]
T: NumOps + PartialOrd + Copy,
type Output = ModInt<T>
The resulting type after applying the +
operator.
fn add(self, rhs: T) -> Self
[src]
impl<T: Clone> Clone for ModInt<T>
[src]
impl<T: Copy> Copy for ModInt<T>
[src]
impl<T: Debug> Debug for ModInt<T>
[src]
impl<T> Display for ModInt<T> where
T: Display,
[src]
T: Display,
impl<T> Div<ModInt<T>> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, other: ModInt<T>) -> Self
[src]
impl<T> Div<ModInt<T>> for i8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for usize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for i16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for i32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for i64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for u8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for u16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for u32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for u64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<ModInt<T>> for isize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Div<T> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the /
operator.
fn div(self, rhs: T) -> Self
[src]
impl<T: Eq> Eq for ModInt<T>
[src]
impl<T> ModIntTrait<T> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
fn new(n: T) -> Self
[src]
fn new_with(n: T, modulo: T) -> Self
[src]
fn inverse(&self) -> Self
[src]
fn pow(self, r: T) -> Self
[src]
fn static_inverse_with(n: T, modulo: T) -> T
[src]
impl<T> Mul<ModInt<T>> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, other: ModInt<T>) -> Self
[src]
impl<T> Mul<ModInt<T>> for i8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for usize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for i16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for i32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for i64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for u8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for u16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for u32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for u64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<ModInt<T>> for isize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Mul<T> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the *
operator.
fn mul(self, rhs: T) -> Self
[src]
impl<T> One for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
fn one() -> Self
[src]
fn is_one(&self) -> bool where
Self: PartialEq,
[src]
Self: PartialEq,
fn set_one(&mut self)
[src]
impl<T: Ord> Ord for ModInt<T>
[src]
fn cmp(&self, other: &ModInt<T>) -> Ordering
[src]
#[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<T: PartialEq> PartialEq<ModInt<T>> for ModInt<T>
[src]
impl<T> PartialEq<ModInt<T>> for i8 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for usize where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for i16 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for i32 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for i64 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for u8 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for u16 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for u32 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for u64 where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<ModInt<T>> for isize where
T: PrimInt,
[src]
T: PrimInt,
impl<T> PartialEq<T> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
impl<T: PartialOrd> PartialOrd<ModInt<T>> for ModInt<T>
[src]
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
fn lt(&self, other: &ModInt<T>) -> bool
[src]
fn le(&self, other: &ModInt<T>) -> bool
[src]
fn gt(&self, other: &ModInt<T>) -> bool
[src]
fn ge(&self, other: &ModInt<T>) -> bool
[src]
impl<T> PartialOrd<ModInt<T>> for i8 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for usize where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for i16 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for i32 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for i64 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for u8 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for u16 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for u32 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for u64 where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<ModInt<T>> for isize where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &ModInt<T>) -> Option<Ordering>
[src]
#[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<T> PartialOrd<T> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
fn partial_cmp(&self, other: &T) -> Option<Ordering>
[src]
#[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<T> StructuralEq for ModInt<T>
[src]
impl<T> StructuralPartialEq for ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, other: ModInt<T>) -> Self
[src]
impl<T> Sub<ModInt<T>> for i8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for usize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for i16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for i32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for i64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for u8 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for u16 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for u32 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for u64 where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<ModInt<T>> for isize where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: ModInt<T>) -> ModInt<T>
[src]
impl<T> Sub<T> for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
type Output = ModInt<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: T) -> Self
[src]
impl<T> ToPrimitive for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
fn to_i8(&self) -> Option<i8>
[src]
fn to_i16(&self) -> Option<i16>
[src]
fn to_i32(&self) -> Option<i32>
[src]
fn to_i64(&self) -> Option<i64>
[src]
fn to_u8(&self) -> Option<u8>
[src]
fn to_u16(&self) -> Option<u16>
[src]
fn to_u32(&self) -> Option<u32>
[src]
fn to_u64(&self) -> Option<u64>
[src]
fn to_isize(&self) -> Option<isize>
[src]
fn to_usize(&self) -> Option<usize>
[src]
fn to_i128(&self) -> Option<i128>
[src]
fn to_u128(&self) -> Option<u128>
[src]
fn to_f32(&self) -> Option<f32>
[src]
fn to_f64(&self) -> Option<f64>
[src]
impl<T> Zero for ModInt<T> where
T: PrimInt,
[src]
T: PrimInt,
Auto Trait Implementations
impl<T> RefUnwindSafe for ModInt<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for ModInt<T> where
T: Send,
T: Send,
impl<T> Sync for ModInt<T> where
T: Sync,
T: Sync,
impl<T> Unpin for ModInt<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for ModInt<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
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<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
fn equivalent(&self, key: &K) -> bool
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
[src]
type Output = T
Should always be Self
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> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
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>,