pub struct TrapezoidalRule {
pub tol: f64,
pub max_levels: usize,
}Expand description
Adaptive trapezoidal rule with Richardson extrapolation.
Fields§
§tol: f64Absolute tolerance for adaptive refinement.
max_levels: usizeMaximum number of refinement levels.
Implementations§
Auto Trait Implementations§
impl Freeze for TrapezoidalRule
impl RefUnwindSafe for TrapezoidalRule
impl Send for TrapezoidalRule
impl Sync for TrapezoidalRule
impl Unpin for TrapezoidalRule
impl UnsafeUnpin for TrapezoidalRule
impl UnwindSafe for TrapezoidalRule
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.