pub trait ExpIntConsts<const N: usize>: FloatConsts + Sized {
const SMALL_N: [Self; 6];
const SMALL_D: [Self; 6];
const LARGE_N: [Self; 11];
const LARGE_D: [Self; 12];
const ASYMPTOTIC_CONST: Self;
const RECURRENCE_THRESHOLD: Self;
const ONE_OVER_N_MINUS_1: Self;
const FACTORS: [Self; N];
const RECIPROCALS: [Self; N];
const RECURRENCE_THRESHOLDS: [Self; 33];
const RECIPROCAL_TABLE: [Self; 33];
// Required method
fn recurrence_threshold_dyn(n: u32) -> Self;
}Required Associated Constants§
const SMALL_N: [Self; 6]
const SMALL_D: [Self; 6]
const LARGE_N: [Self; 11]
const LARGE_D: [Self; 12]
const ASYMPTOTIC_CONST: Self
const RECURRENCE_THRESHOLD: Self
const ONE_OVER_N_MINUS_1: Self
const FACTORS: [Self; N]
const RECIPROCALS: [Self; N]
Sourceconst RECURRENCE_THRESHOLDS: [Self; 33]
const RECURRENCE_THRESHOLDS: [Self; 33]
RECURRENCE_THRESHOLD for every order below
EXPINT_TABLE_ORDERS, precomputed: the threshold is a bisection, which the
runtime-order form must not pay per call.
Sourceconst RECIPROCAL_TABLE: [Self; 33]
const RECIPROCAL_TABLE: [Self; 33]
1/(2+k) for k below EXPINT_TABLE_ORDERS, the recurrence’s per-step scale.
Required Methods§
Sourcefn recurrence_threshold_dyn(n: u32) -> Self
fn recurrence_threshold_dyn(n: u32) -> Self
RECURRENCE_THRESHOLD for an order known only at runtime:
a table lookup, falling back to the bisection only past the table.
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety".