pub struct Relation<I, F> { /* private fields */ }
Expand description
A structural representation of a relation
Takes a relation function and a starter number. Then it can calculate the next value based on the current value
The concept is based on the Mathematic Recursion and Financial Modelling concept of relations
Implementations§
Trait Implementations§
impl<I: Copy, F: Copy> Copy for Relation<I, F>
Auto Trait Implementations§
impl<I, F> Freeze for Relation<I, F>
impl<I, F> RefUnwindSafe for Relation<I, F>where
I: RefUnwindSafe,
F: RefUnwindSafe,
impl<I, F> Send for Relation<I, F>
impl<I, F> Sync for Relation<I, F>
impl<I, F> Unpin for Relation<I, F>
impl<I, F> UnwindSafe for Relation<I, F>where
I: UnwindSafe,
F: UnwindSafe,
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