pub struct KinematicState {
pub position_m: [f64; 3],
pub clock_m: f64,
pub ztd_residual_m: f64,
pub ambiguities_m: BTreeMap<String, f64>,
}Expand description
Receiver state carried by the sequential kinematic PPP filter.
The state vector order is ECEF position, receiver clock range bias, zenith wet-delay residual, then carrier-phase float ambiguities in the map’s sorted key order.
Fields§
§position_m: [f64; 3]Receiver ECEF position [x, y, z], in metres.
clock_m: f64Receiver clock range bias, in metres.
ztd_residual_m: f64Zenith wet troposphere delay residual, in metres.
ambiguities_m: BTreeMap<String, f64>Carrier-phase float ambiguity estimates, in metres, keyed by the static PPP observation ambiguity id.
Implementations§
Trait Implementations§
Source§impl Clone for KinematicState
impl Clone for KinematicState
Source§fn clone(&self) -> KinematicState
fn clone(&self) -> KinematicState
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 moreSource§impl Debug for KinematicState
impl Debug for KinematicState
Source§impl Default for KinematicState
impl Default for KinematicState
Source§impl PartialEq for KinematicState
impl PartialEq for KinematicState
Source§fn eq(&self, other: &KinematicState) -> bool
fn eq(&self, other: &KinematicState) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for KinematicState
Auto Trait Implementations§
impl Freeze for KinematicState
impl RefUnwindSafe for KinematicState
impl Send for KinematicState
impl Sync for KinematicState
impl Unpin for KinematicState
impl UnsafeUnpin for KinematicState
impl UnwindSafe for KinematicState
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> 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.