pub struct GaussLegendreQuad {
pub n: usize,
pub nodes: Vec<f64>,
pub weights: Vec<f64>,
}Expand description
Gauss-Legendre quadrature rule with n nodes on [-1, 1].
Exact for polynomials of degree up to 2n-1.
Fields§
§n: usizeNumber of quadrature nodes.
nodes: Vec<f64>Quadrature nodes on [-1, 1].
weights: Vec<f64>Quadrature weights summing to 2.
Implementations§
Auto Trait Implementations§
impl Freeze for GaussLegendreQuad
impl RefUnwindSafe for GaussLegendreQuad
impl Send for GaussLegendreQuad
impl Sync for GaussLegendreQuad
impl Unpin for GaussLegendreQuad
impl UnsafeUnpin for GaussLegendreQuad
impl UnwindSafe for GaussLegendreQuad
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.