pub struct QuadraticRoughHestonPath { /* private fields */ }Expand description
One simulated path, by step of the grid from 0 to N.
spot and z can be negative. See QuadraticRoughHestonParams.
Implementations§
Source§impl QuadraticRoughHestonPath
impl QuadraticRoughHestonPath
Sourcepub fn factors_at(&self, step: usize) -> Option<&[Decimal]>
pub fn factors_at(&self, step: usize) -> Option<&[Decimal]>
The factors Z^i_k at step, or None past the end of the path.
Trait Implementations§
Source§impl Clone for QuadraticRoughHestonPath
impl Clone for QuadraticRoughHestonPath
Source§impl Debug for QuadraticRoughHestonPath
impl Debug for QuadraticRoughHestonPath
impl Eq for QuadraticRoughHestonPath
Source§impl PartialEq for QuadraticRoughHestonPath
impl PartialEq for QuadraticRoughHestonPath
impl StructuralPartialEq for QuadraticRoughHestonPath
Auto Trait Implementations§
impl Forget for QuadraticRoughHestonPath
impl Freeze for QuadraticRoughHestonPath
impl RefUnwindSafe for QuadraticRoughHestonPath
impl Send for QuadraticRoughHestonPath
impl Sync for QuadraticRoughHestonPath
impl Unpin for QuadraticRoughHestonPath
impl UnsafeUnpin for QuadraticRoughHestonPath
impl UnwindSafe for QuadraticRoughHestonPath
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Scalar 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.