Skip to main content

DoubleDouble

Struct DoubleDouble 

Source
#[repr(C)]
pub struct DoubleDouble { hi: f64, lo: f64, }
Expand description

A double-double number: the exact sum hi + lo of two f64, normalized (invariant D1). About 106 bits of significand (32 decimal digits), the exponent range of f64.

#[repr(C)] with hi first: a slice &[DoubleDouble] is an array of (hi, lo) pairs, the layout the SIMD kernels read.

Fields§

§hi: f64§lo: f64

Implementations§

Source§

impl DoubleDouble

Source

pub const ZERO: Self

Zero.

Source

pub const ONE: Self

One.

Source

pub const EPSILON: Self

2⁻¹⁰⁴, the “machine epsilon” (Real::EPSILON).

Source

pub const INFINITY: Self

Positive infinity (invariant D2).

Source

pub const NAN: Self

A NaN (invariant D2).

Source

pub const PI: Self

π, the nearest double-double: 3.141592653589793e0 + 1.2246467991473532e-16.

Source

pub const TAU: Self

2π, the nearest double-double: 6.283185307179586e0 + 2.4492935982947064e-16.

Source

pub const FRAC_PI_2: Self

π/2, the nearest double-double: 1.5707963267948966e0 + 6.123233995736766e-17.

Source

pub const FRAC_PI_3: Self

π/3, the nearest double-double: 1.0471975511965979e0 + -1.072081766451091e-16.

Source

pub const FRAC_PI_4: Self

π/4, the nearest double-double: 7.853981633974483e-1 + 3.061616997868383e-17.

Source

pub const FRAC_PI_6: Self

π/6, the nearest double-double: 5.235987755982989e-1 + -5.360408832255455e-17.

Source

pub const FRAC_PI_8: Self

π/8, the nearest double-double: 3.9269908169872414e-1 + 1.5308084989341915e-17.

Source

pub const FRAC_1_PI: Self

1/π, the nearest double-double: 3.183098861837907e-1 + -1.9678676675182486e-17.

Source

pub const FRAC_2_PI: Self

2/π, the nearest double-double: 6.366197723675814e-1 + -3.935735335036497e-17.

Source

pub const FRAC_2_SQRT_PI: Self

2/√π, the nearest double-double: 1.1283791670955126e0 + 1.533545961316588e-17.

Source

pub const SQRT_2: Self

√2, the nearest double-double: 1.4142135623730951e0 + -9.667293313452913e-17.

Source

pub const FRAC_1_SQRT_2: Self

1/√2, the nearest double-double: 7.071067811865476e-1 + -4.833646656726457e-17.

Source

pub const E: Self

e, the nearest double-double: 2.718281828459045e0 + 1.4456468917292502e-16.

Source

pub const LOG2_E: Self

log₂ e, the nearest double-double: 1.4426950408889634e0 + 2.0355273740931033e-17.

Source

pub const LOG2_10: Self

log₂ 10, the nearest double-double: 3.321928094887362e0 + 1.661617516973592e-16.

Source

pub const LOG10_E: Self

log₁₀ e, the nearest double-double: 4.342944819032518e-1 + 1.098319650216765e-17.

Source

pub const LOG10_2: Self

log₁₀ 2, the nearest double-double: 3.010299956639812e-1 + -2.8037281277851704e-18.

Source

pub const LN_2: Self

ln 2, the nearest double-double: 6.931471805599453e-1 + 2.3190468138462996e-17.

Source

pub const LN_10: Self

ln 10, the nearest double-double: 2.302585092994046e0 + -2.1707562233822494e-16.

Source

pub const ERROR_BOUNDS: &'static [ErrorBound]

The bounds of the chapter’s table, for the tests and for callers that propagate errors. The subtractions have the bounds of the additions; 1 / dd is dd / dd. Each units_of_u2 is an f64 at least the proven expression, with u = 2⁻⁵³:

operationproven boundunits_of_u2
dd + f642u²/(1 − 2u)2 + 2⁻⁵⁰ (the expression rounded up)
dd + dd3u²/(1 − 4u)3 + 2⁻⁴⁹ (rounded up)
dd · f642u²2 (exact)
dd · dd4u²4 (exact)
dd²3u²3 (exact)
dd / f643u²3 (exact)
dd / dd15u² + 56u³15 + 2⁻⁴⁷ (rounded up)
√dd(25/8) u²3.125 (exact)

The test error_bounds_dominate_the_proven_expressions checks each row in exact rational arithmetic.

Source

pub const fn from_f64(x: f64) -> Self

The value of an f64, exactly.

Source

pub fn from_sum(a: f64, b: f64) -> Self

a + b exactly, for any two f64 (two_sum).

Source

pub fn from_product(a: f64, b: f64) -> Self

a · b exactly, for any two f64 in the range of two_prod (outside it: within η/2, and still normalized).

Source

pub fn from_parts(hi: f64, lo: f64) -> Self

The pair (hi, lo) as given, requires it normalized (D1); a debug_assert!. For deserialization and tests.

The requirement is unchecked in release builds, and every bound of this chapter assumes it: use DoubleDouble::from_sum for an arbitrary pair.

Source

pub(crate) const fn from_raw(hi: f64, lo: f64) -> Self

The pair (hi, lo) as given, unchecked: for the SIMD kernels, which store pairs computed by the algorithms of this chapter (Chapter 11.6), and for the literal tables of Chapter 11.11.

Source

pub const fn hi(self) -> f64

The leading component: the f64 nearest to the value (D4).

Source

pub const fn lo(self) -> f64

The trailing component, |lo| ≤ ulp(hi)/2.

Source

pub const fn to_f64(self) -> f64

The nearest f64 (the leading component).

Source

pub fn abs(self) -> Self

|x|, exact.

Source

pub fn sqrt(self) -> Self

√x; NaN for negative x, ±0 for ±0.

Source

pub fn recip(self) -> Self

1 / x.

Source

pub fn square(self) -> Self

x², cheaper than x · x (one product fewer), same bound.

Source

pub fn ldexp(self, k: i32) -> Self

x · 2ᵏ, exact barring overflow and underflow.

Source

pub fn is_finite(self) -> bool

Neither infinite nor NaN.

Source

pub fn is_nan(self) -> bool

NaN (D2).

Source

pub fn max(self, other: Self) -> Self

The larger value, with the NaN rule of f64::max.

Source

pub fn min(self, other: Self) -> Self

The smaller value, with the NaN rule of f64::min.

Source

pub fn check_invariants(self) -> Result<(), &'static str>

Invariants (D1) and (D2).

§Errors

The text of the violated invariant.

Source§

impl DoubleDouble

Source

pub const FUNCTION_BOUNDS: &'static [FunctionBound]

The declared error bounds of the elementary functions (Chapter 11.11), one row per function, each proven in the chapter. The tests read them.

Source§

impl DoubleDouble

Source

pub fn exp(self) -> Self

eˣ (Algorithm E). Relative error at most 8u² for results in [2⁻⁹⁶⁸, Ω] (proven: 4.6u²), plus η below. exp(±0) = 1, exp(+∞) = +∞, exp(−∞) = +0; +∞ on overflow, +0 for x < −745.2.

Source

pub fn exp2(self) -> Self

2ˣ (Algorithm E); exact for integer x whose power is representable. Bound as DoubleDouble::exp.

Source

pub fn exp_m1(self) -> Self

eˣ − 1, with relative accuracy near zero (Algorithm M): relative error at most 8u² for results in [2⁻⁹⁶⁸, Ω] (proven: 7.2u²). exp_m1(±0) = ±0, exp_m1(+∞) = +∞, exp_m1(−∞) = −1; for very negative x the pair (−1, eˣ), exactly −1 once eˣ < η/2.

Source§

impl DoubleDouble

Source

pub fn ln(self) -> Self

Natural logarithm (Algorithm L): relative error at most 8u² (proven: 6.7u²); ln(1) = +0. NaN for x < 0, −∞ for ±0, +∞ for +∞.

Source

pub fn ln_1p(self) -> Self

ln(1 + x), with relative accuracy near zero (Algorithm L′): relative error at most 8u² (proven: 7.7u²). ±0 for ±0, −∞ for −1, NaN for x < −1.

Source

pub fn log2(self) -> Self

Base-2 logarithm; exact for powers of two. Relative error at most 12u² (proven: 11.7u²). Special cases as DoubleDouble::ln.

Source

pub fn log10(self) -> Self

Base-10 logarithm, ln x · LOG10_E: relative error at most 12u² (proven: 11.7u²). Special cases as DoubleDouble::ln.

Source§

impl DoubleDouble

Source

pub fn powi(self, n: i32) -> Self

xⁿ by binary powering with a separate exponent (Algorithm P): no spurious overflow or underflow. Relative error at most (15 + 4|n|)u² (proven: (11 + 4|n|)u²); exact for n ∈ {0, 1}, one square (3u²) for n = 2, DoubleDouble::recip for n = −1. The special cases of IEEE 754 pown: powi(x, 0) = 1 for every x, NaN included; ±0 and ±∞ by the sign and parity of n.

Source

pub fn powf(self, y: Self) -> Self

xʸ as exp(y ln x) (Theorem F): relative error at most (16 + 11|y ln x|)u² (proven: (4.6 + 10.7|y ln x|)u²); x itself for y = 1. The special cases of IEEE 754 pow (C99 Annex F), as f64: pow(x, ±0) = 1 and pow(1, y) = 1 even for NaN; NaN for x < 0 and y not an integer; ±0, ±∞ and ±1 by the usual limits.

Source§

impl DoubleDouble

Source

pub fn sin(self) -> Self

Sine (Algorithms R and K): error at most 8u²|sin x| + 2⁻²⁰⁰ for every finite x (proven: 6.9u²|sin x| + 2⁻³¹⁵), so relative when |sin x| ≥ 2⁻⁹⁴. sin(±0) = ±0; NaN for ±∞; odd bit for bit.

Source

pub fn cos(self) -> Self

Cosine; bound as DoubleDouble::sin. cos(±0) = 1; NaN for ±∞; even bit for bit.

Source

pub fn tan(self) -> Self

Tangent (Algorithms R and K, then D2): error at most 32u²|tan x| + 2⁻²⁰⁰(1 + tan²x) (proven: 27.4u²|tan x| + 2⁻³¹⁵(1 + tan²x)). tan(±0) = ±0; NaN for ±∞; odd bit for bit.

Source

pub fn sin_cos(self) -> (Self, Self)

(sin x, cos x) from one argument reduction; the same bits as DoubleDouble::sin and DoubleDouble::cos.

Source§

impl DoubleDouble

Source

pub fn atan(self) -> Self

Arctangent in [−π/2, π/2] (Algorithm T): relative error at most 8u² (proven: 5.8u²). atan(±0) = ±0, atan(±∞) = ±π/2; odd bit for bit.

Source

pub fn atan2(self, other: Self) -> Self

Four-quadrant arctangent of self / other (self is y), in [−π, π]: relative error at most 32u² (proven: 20u²). The special cases of f64::atan2: (±0, −0) → ±π, (±0, +0) → ±0, (±0, x < 0) → ±π, (±0, x > 0) → ±0, (y ≠ 0, ±0) → ±π/2 by the sign of y, (±y, −∞) → ±π and (±y, +∞) → ±0 for finite y, (±∞, x finite) → ±π/2, (±∞, −∞) → ±3π/4, (±∞, +∞) → ±π/4; NaN in either → NaN.

Source

pub fn asin(self) -> Self

Arcsine in [−π/2, π/2]: relative error at most 32u² (proven: 26.1u²). NaN outside [−1, 1]; asin(±1) = ±π/2, asin(±0) = ±0; odd bit for bit.

Source

pub fn acos(self) -> Self

Arccosine in [0, π]: relative error at most 32u² (proven: 26.1u²). NaN outside [−1, 1]; acos(1) = +0, acos(−1) = π, acos(±0) = π/2.

Source§

impl DoubleDouble

Source

pub fn sinh(self) -> Self

Hyperbolic sine: relative error at most 32u² (proven: 18.7u²). ±0, ±∞ for ±0, ±∞; ±∞ on overflow; odd bit for bit.

Source

pub fn cosh(self) -> Self

Hyperbolic cosine: relative error at most 32u² (proven: 15.1u²). cosh(±0) = 1, +∞ for ±∞ and on overflow; even bit for bit.

Source

pub fn tanh(self) -> Self

Hyperbolic tangent: relative error at most 32u² (proven: 26.4u²). ±0 for ±0, ±1 for ±∞; for large |x| the pair (±1, ∓2e^(−2|x|)), exactly ±1 once that is below η/2; odd bit for bit.

Source

pub fn asinh(self) -> Self

Inverse hyperbolic sine: relative error at most 32u² (proven: 19.7u²). ±0, ±∞ for ±0, ±∞; odd bit for bit.

Source

pub fn acosh(self) -> Self

Inverse hyperbolic cosine: relative error at most 32u² (proven: 16.8u²). NaN for x < 1, acosh(1) = +0, +∞ for +∞.

Source

pub fn atanh(self) -> Self

Inverse hyperbolic tangent: relative error at most 32u² (proven: 24.7u²). NaN outside [−1, 1], ±∞ at ±1, ±0 for ±0; odd bit for bit.

Trait Implementations§

Source§

impl Add for DoubleDouble

Source§

type Output = DoubleDouble

The resulting type after applying the + operator.
Source§

fn add(self, rhs: Self) -> Self

Performs the + operation. Read more
Source§

impl Add<f64> for DoubleDouble

Mixed operation with an f64 right operand: the cheaper algorithm of the chapter’s table, not a promotion.

Source§

type Output = DoubleDouble

The resulting type after applying the + operator.
Source§

fn add(self, rhs: f64) -> Self

Performs the + operation. Read more
Source§

impl AddAssign for DoubleDouble

Source§

fn add_assign(&mut self, rhs: Self)

Performs the += operation. Read more
Source§

impl Clone for DoubleDouble

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Copy for DoubleDouble

Source§

impl Debug for DoubleDouble

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for DoubleDouble

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl DenseKernel<DoubleDouble> for DdDense

Source§

fn potrf(&self, a: &mut DenseBlock<DoubleDouble>) -> Result<(), DenseError>

In-place Cholesky A = L Lᵀ of a square block (Algorithm P).
Source§

fn sytrf( &self, a: &mut DenseBlock<DoubleDouble>, perm: &mut Perm, pivot_2x2: &mut Vec<bool>, ) -> Result<Inertia, DenseError>

In-place P A Pᵀ = L B Lᵀ with 1×1/2×2 pivots (Bunch–Kaufman, Algorithm B); returns the inertia and writes the permutation into perm and the 2×2 marks into pivot_2x2 (both resized to n).
Source§

fn trsm_lower( &self, l: &DenseBlock<DoubleDouble>, b: &mut DenseBlock<DoubleDouble>, transpose: bool, )

B ← B L⁻ᵀ (transpose = true) or B ← L⁻¹ B (false), L square, non-unit lower triangular. Read more
Source§

fn gemm_sub( &self, a: &DenseBlock<DoubleDouble>, b: &DenseBlock<DoubleDouble>, c: &mut DenseBlock<DoubleDouble>, )

C ← C − A Bᵀ. Read more
Source§

fn syrk_sub( &self, a: &DenseBlock<DoubleDouble>, c: &mut DenseBlock<DoubleDouble>, )

C ← C − A Aᵀ, lower triangle of C. Read more
Source§

fn name(&self) -> &'static str

A short name for logs and tables.
Source§

fn solve_min_rows(&self) -> usize

The smallest row count n_r of a supernode block for which the solves of SupernodalLdl go through this kernel (gather, hook, scatter; step S0′ of Chapter 5.17). usize::MAX — the default — keeps the loops of the second edition everywhere. A cost switch only (invariant (D5)).
Source§

fn solve_unit_lower( &self, l: &DenseBlock<DoubleDouble>, skip: &[bool], y: &mut [DoubleDouble], )

Forward half of a supernode’s solve, y ← L⁻¹ y (Algorithm V). l is the stored block (rows ≥ cols, unit lower trapezoidal, diagonal slots ignored); skip is empty or has l.cols marks (the first column of each 2×2 pivot). Read more
Source§

fn solve_unit_lower_t( &self, l: &DenseBlock<DoubleDouble>, skip: &[bool], y: &mut [DoubleDouble], )

Backward half, y_{..cols} ← L₁₁⁻ᵀ (y_{..cols} − L₂₁ᵀ y_{cols..}) (Algorithm W); y[cols..] is read only. Read more
Source§

impl Display for DoubleDouble

Decimal, scientific notation when the exponent calls for it; {:.N} gives N digits after the point, the default is the value correctly rounded to 31 significant digits, trailing zeros dropped (Algorithm O of Chapter 11.4). A decimal of at most 31 digits that was read by from_str is written back as the same decimal; the output parses back to the same bits whenever the value has at most 31 significant decimal digits — see invariant P3 for why no fixed number of digits can do so in general ({:.1100e} always does).

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Div for DoubleDouble

Source§

type Output = DoubleDouble

The resulting type after applying the / operator.
Source§

fn div(self, rhs: Self) -> Self

Performs the / operation. Read more
Source§

impl Div<f64> for DoubleDouble

Mixed operation with an f64 right operand: the cheaper algorithm of the chapter’s table, not a promotion.

Source§

type Output = DoubleDouble

The resulting type after applying the / operator.
Source§

fn div(self, rhs: f64) -> Self

Performs the / operation. Read more
Source§

impl DivAssign for DoubleDouble

Source§

fn div_assign(&mut self, rhs: Self)

Performs the /= operation. Read more
Source§

impl From<f64> for DoubleDouble

Source§

fn from(x: f64) -> Self

Converts to this type from the input type.
Source§

impl FromStr for DoubleDouble

Decimal or scientific notation, inf, nan; faithful (question E7) — in fact correctly rounded: the leading component is the f64 nearest to the string’s value and the trailing one the f64 nearest to the rest (Algorithm I of Chapter 11.4).

Source§

type Err = ParseDoubleDoubleError

The associated error which can be returned from parsing.
Source§

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type. Read more
Source§

impl LowerExp for DoubleDouble

Scientific notation as for f64: d.ddd then e and the decimal exponent, without + or leading zeros (1.5e-7, 1e0, 0e0). {:e} gives the value correctly rounded to the 31 significant digits of Display, trailing zeros dropped; {:.Ne} gives N digits after the point, correctly rounded (half to even), zero-padded.

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Mul for DoubleDouble

Source§

type Output = DoubleDouble

The resulting type after applying the * operator.
Source§

fn mul(self, rhs: Self) -> Self

Performs the * operation. Read more
Source§

impl Mul<f64> for DoubleDouble

Mixed operation with an f64 right operand: the cheaper algorithm of the chapter’s table, not a promotion.

Source§

type Output = DoubleDouble

The resulting type after applying the * operator.
Source§

fn mul(self, rhs: f64) -> Self

Performs the * operation. Read more
Source§

impl MulAssign for DoubleDouble

Source§

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation. Read more
Source§

impl Neg for DoubleDouble

Source§

type Output = DoubleDouble

The resulting type after applying the - operator.
Source§

fn neg(self) -> Self

Performs the unary - operation. Read more
Source§

impl PartialEq for DoubleDouble

Source§

fn eq(&self, other: &Self) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl PartialOrd for DoubleDouble

Source§

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 (const: unstable) · Source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
Source§

impl Real for DoubleDouble

Available on crate feature sparse only.

Real for double-double (requirements R1 as reworded in E2, R2–R4 by invariants D3–D5): the containers and factorizations of xingo-sparse instantiate in DoubleDouble unchanged.

Source§

const ZERO: Self = Self::ZERO

The additive identity.
Source§

const ONE: Self = Self::ONE

The multiplicative identity.
Source§

const EPSILON: Self = Self::EPSILON

Machine epsilon of the type (2⁻⁵² for f64).
Source§

fn from_f64(x: f64) -> Self

The value of an f64 (exact for f64 and the extended types).
Source§

fn to_f64(self) -> f64

The nearest f64 (lossy for the extended types).
Source§

fn abs(self) -> Self

|x|.
Source§

fn sqrt(self) -> Self

√x.
Source§

fn recip(self) -> Self

1 / x.
Source§

fn mul_add(self, a: Self, b: Self) -> Self

self · a + b with a single rounding where the type allows.
Source§

fn is_finite(self) -> bool

true iff the value is neither infinite nor NaN.
Source§

fn max(self, other: Self) -> Self

The larger of two values, with the NaN rule of f64::max.
Source§

fn min(self, other: Self) -> Self

The smaller of two values, with the NaN rule of f64::min.
Source§

impl StructuralPartialEq for DoubleDouble

Source§

impl Sub for DoubleDouble

Source§

type Output = DoubleDouble

The resulting type after applying the - operator.
Source§

fn sub(self, rhs: Self) -> Self

Performs the - operation. Read more
Source§

impl Sub<f64> for DoubleDouble

Mixed operation with an f64 right operand: the cheaper algorithm of the chapter’s table, not a promotion.

Source§

type Output = DoubleDouble

The resulting type after applying the - operator.
Source§

fn sub(self, rhs: f64) -> Self

Performs the - operation. Read more
Source§

impl SubAssign for DoubleDouble

Source§

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation. Read more
Source§

impl Sum for DoubleDouble

Left to right from DoubleDouble::ZERO (requirement R3 of Real).

Source§

fn sum<I: Iterator<Item = Self>>(iter: I) -> Self

Takes an iterator and generates Self from the elements by “summing up” the items.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String

Converts the given value to a String. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.