pub enum LoopTopology {
FixedPoint,
Newton,
Secant,
Accelerated,
ConjugateGradient,
Custom,
}Expand description
Types of strange loop topologies
Variants§
FixedPoint
Simple fixed-point iteration: x_{n+1} = f(x_n)
Newton
Newton-Raphson with Lipschitz constraints
Secant
Secant method variant
Accelerated
Accelerated fixed-point (Anderson acceleration)
ConjugateGradient
Conjugate gradient style
Custom
Custom topology with user-defined function
Trait Implementations§
Source§impl Clone for LoopTopology
impl Clone for LoopTopology
Source§fn clone(&self) -> LoopTopology
fn clone(&self) -> LoopTopology
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for LoopTopology
impl Debug for LoopTopology
Source§impl<'de> Deserialize<'de> for LoopTopology
impl<'de> Deserialize<'de> for LoopTopology
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl PartialEq for LoopTopology
impl PartialEq for LoopTopology
Source§impl Serialize for LoopTopology
impl Serialize for LoopTopology
impl Eq for LoopTopology
impl StructuralPartialEq for LoopTopology
Auto Trait Implementations§
impl Freeze for LoopTopology
impl RefUnwindSafe for LoopTopology
impl Send for LoopTopology
impl Sync for LoopTopology
impl Unpin for LoopTopology
impl UnwindSafe for LoopTopology
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<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Pointable for T
impl<T> Pointable for T
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.