Struct fenris_optimize::calculus::ConcreteVectorFunction [−][src]
pub struct ConcreteVectorFunction<F, J> { /* fields omitted */ }Implementations
pub fn with_jacobian_solver<J, T>(
self,
jacobian_solver: J
) -> ConcreteVectorFunction<F, J> where
T: Scalar,
J: FnMut(&mut DVectorSliceMut<'_, T>, &DVectorSlice<'_, T>, &DVectorSlice<'_, T>) -> Result<(), Box<dyn Error>>,
Trait Implementations
impl<F, J, T> DifferentiableVectorFunction<T> for ConcreteVectorFunction<F, J> where
T: Scalar,
F: FnMut(&mut DVectorSliceMut<'_, T>, &DVectorSlice<'_, T>),
J: FnMut(&mut DVectorSliceMut<'_, T>, &DVectorSlice<'_, T>, &DVectorSlice<'_, T>) -> Result<(), Box<dyn Error>>,
impl<F, J, T> DifferentiableVectorFunction<T> for ConcreteVectorFunction<F, J> where
T: Scalar,
F: FnMut(&mut DVectorSliceMut<'_, T>, &DVectorSlice<'_, T>),
J: FnMut(&mut DVectorSliceMut<'_, T>, &DVectorSlice<'_, T>, &DVectorSlice<'_, T>) -> Result<(), Box<dyn Error>>,
fn solve_jacobian_system(
&mut self,
sol: &mut DVectorSliceMut<'_, T>,
x: &DVectorSlice<'_, T>,
rhs: &DVectorSlice<'_, T>
) -> Result<(), Box<dyn Error>>
impl<F, J, T> VectorFunction<T> for ConcreteVectorFunction<F, J> where
T: Scalar,
F: FnMut(&mut DVectorSliceMut<'_, T>, &DVectorSlice<'_, T>),
impl<F, J, T> VectorFunction<T> for ConcreteVectorFunction<F, J> where
T: Scalar,
F: FnMut(&mut DVectorSliceMut<'_, T>, &DVectorSlice<'_, T>),
Auto Trait Implementations
impl<F, J> RefUnwindSafe for ConcreteVectorFunction<F, J> where
F: RefUnwindSafe,
J: RefUnwindSafe,
impl<F, J> Send for ConcreteVectorFunction<F, J> where
F: Send,
J: Send,
impl<F, J> Sync for ConcreteVectorFunction<F, J> where
F: Sync,
J: Sync,
impl<F, J> Unpin for ConcreteVectorFunction<F, J> where
F: Unpin,
J: Unpin,
impl<F, J> UnwindSafe for ConcreteVectorFunction<F, J> where
F: UnwindSafe,
J: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.