pub struct TwoWaySolution {
pub t1_transmit: Epoch,
pub t2_bounce: Epoch,
pub t3_receive: Epoch,
pub uplink: LightTimeLeg,
pub downlink: LightTimeLeg,
}Expand description
Solves the two-way tracking problem using the Picard fixed-point iteration like in JPL Moyer (2000).
This solves the problem strictly in ICRF because it is the only true inertial frame.
t1 (Transmit) t2 (Bounce) t3 (Receive)
Ground Station -------------> Spacecraft -------------> Ground Station
[Uplink Leg] [Downlink Leg]
(Solved Second) (Solved First)Fields§
§t1_transmit: Epoch§t2_bounce: Epoch§t3_receive: Epoch§uplink: LightTimeLeg§downlink: LightTimeLegImplementations§
Trait Implementations§
Source§impl Clone for TwoWaySolution
impl Clone for TwoWaySolution
Source§fn clone(&self) -> TwoWaySolution
fn clone(&self) -> TwoWaySolution
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for TwoWaySolution
Source§impl Debug for TwoWaySolution
impl Debug for TwoWaySolution
Source§impl PartialEq for TwoWaySolution
impl PartialEq for TwoWaySolution
impl StructuralPartialEq for TwoWaySolution
Auto Trait Implementations§
impl Freeze for TwoWaySolution
impl RefUnwindSafe for TwoWaySolution
impl Send for TwoWaySolution
impl Sync for TwoWaySolution
impl Unpin for TwoWaySolution
impl UnsafeUnpin for TwoWaySolution
impl UnwindSafe for TwoWaySolution
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 more§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.