Struct Simpson

pub struct Simpson { /* private fields */ }

A Simpson’s rule.

// initialize a Simpson rule with 100 subintervals
let quad: Simpson = Simpson::new(100)?;

// numerically integrate a function from -1.0 to 1.0 using the Simpson rule
let approx = quad.integrate(-1.0, 1.0, |x| x * x);

Implementations

impl Simpson

pub fn new(degree: usize) -> Result<Self, SimpsonError>

Initialize a new Simpson rule with degree being the number of intervals.

Errors

Returns an error if given a degree of zero.

pub fn integrate<F>(&self, a: f64, b: f64, integrand: F) -> f64

where F: Fn(f64) -> f64,

Integrate over the domain [a, b].

pub fn par_integrate<F>(&self, a: f64, b: f64, integrand: F) -> f64

where F: Fn(f64) -> f64 + Sync,

Available on crate feature rayon only.

Same as integrate but runs in parallel.

impl Simpson

pub fn iter(&self) -> SimpsonIter<'_>

Returns an iterator over the nodes of the rule.

pub fn as_nodes(&self) -> &[Node]

Returns a slice of all the nodes of the rule.

pub fn into_nodes(self) -> Vec<Node>

Converts the rule into a vector of nodes.

This function just returns the underlying data without any computation or cloning.

pub fn degree(&self) -> usize

Returns the degree of the rule.

Trait Implementations

impl Clone for Simpson

fn clone(&self) -> Simpson

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Simpson

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Simpson

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a> IntoIterator for &'a Simpson

type IntoIter = SimpsonIter<'a>

Which kind of iterator are we turning this into?

type Item = &'a f64

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for Simpson

type Item = f64

The type of the elements being iterated over.

type IntoIter = SimpsonIntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Simpson

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Simpson

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Simpson