Struct gauss_quad::Midpoint
source · pub struct Midpoint { /* private fields */ }
Expand description
A midpoint rule quadrature scheme.
// initialize a midpoint rule with 100 cells
let quad: Midpoint = Midpoint::init(100);
// numerically integrate a function from -1.0 to 1.0 using the midpoint rule
let approx = quad.integrate(-1.0, 1.0, |x| x * x);
Implementations§
Trait Implementations§
source§impl PartialEq for Midpoint
impl PartialEq for Midpoint
impl StructuralPartialEq for Midpoint
Auto Trait Implementations§
impl RefUnwindSafe for Midpoint
impl Send for Midpoint
impl Sync for Midpoint
impl Unpin for Midpoint
impl UnwindSafe for Midpoint
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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.