Struct nyx_space::md::ui::Propagator

source ·
pub struct Propagator<'a, D: Dynamics, E: ErrorCtrl>where
    DefaultAllocator: Allocator<f64, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<usize, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::VecLength>,{
    pub dynamics: D,
    pub opts: PropOpts<E>,
    /* private fields */
}
Expand description

A Propagator allows propagating a set of dynamics forward or backward in time. It is an EventTracker, without any event tracking. It includes the options, the integrator details of the previous step, and the set of coefficients used for the monomorphic instance.

Fields§

§dynamics: D§opts: PropOpts<E>

Implementations§

source§

impl<'a, D: Dynamics, E: ErrorCtrl> Propagator<'a, D, E>where DefaultAllocator: Allocator<f64, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<usize, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::VecLength>,

The Propagator trait defines the functions of a propagator and of an event tracker.

source

pub fn new<T: RK>(dynamics: D, opts: PropOpts<E>) -> Self

Each propagator must be initialized with new which stores propagator information.

source

pub fn set_tolerance(&mut self, tol: f64)

Set the tolerance for the propagator

source

pub fn set_max_step(&mut self, step: Duration)

Set the maximum step size for the propagator and sets the initial step to that value if currently greater

source

pub fn set_min_step(&mut self, step: Duration)

source

pub fn rk89(dynamics: D, opts: PropOpts<E>) -> Self

An RK89 propagator (the default) with custom propagator options.

source

pub fn dp78(dynamics: D, opts: PropOpts<E>) -> Self

A Dormand Prince 7-8 propagator with custom propagator options: it’s about 20% faster than an RK98, and more stable in two body dynamics. WARNINGS: Dormand Prince may have issues with generating proper trajectories, leading to glitches in event finding.

source

pub fn with(&'a self, state: D::StateType) -> PropInstance<'a, D, E>

source§

impl<'a, D: Dynamics> Propagator<'a, D, RSSCartesianStep>where DefaultAllocator: Allocator<f64, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<usize, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::VecLength>,

source

pub fn default(dynamics: D) -> Self

Default propagator is an RK89 with the default PropOpts.

source

pub fn default_dp78(dynamics: D) -> Self

A default Dormand Prince 78 propagator with the default PropOpts. Faster and more stable than an RK89 (default) but seems to cause issues for event finding. WARNINGS: Dormand Prince may have issues with generating proper trajectories, leading to glitches in event finding.

Trait Implementations§

source§

impl<'a, D: Clone + Dynamics, E: Clone + ErrorCtrl> Clone for Propagator<'a, D, E>where DefaultAllocator: Allocator<f64, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<usize, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::VecLength>,

source§

fn clone(&self) -> Propagator<'a, D, E>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<'a, D: Debug + Dynamics, E: Debug + ErrorCtrl> Debug for Propagator<'a, D, E>where DefaultAllocator: Allocator<f64, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<usize, <D::StateType as State>::Size, <D::StateType as State>::Size> + Allocator<f64, <D::StateType as State>::VecLength>,

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, D, E> RefUnwindSafe for Propagator<'a, D, E>where D: RefUnwindSafe, E: RefUnwindSafe,

§

impl<'a, D, E> Send for Propagator<'a, D, E>

§

impl<'a, D, E> Sync for Propagator<'a, D, E>

§

impl<'a, D, E> Unpin for Propagator<'a, D, E>where D: Unpin, E: Unpin,

§

impl<'a, D, E> UnwindSafe for Propagator<'a, D, E>where D: UnwindSafe, E: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V