Enum gnss_rtk::SolverType
source · pub enum SolverType {
SPP,
PPP,
}Variants§
SPP
SPP : code based and approximated models aiming a metric resolution.
PPP
PPP : phase + code based, the ultimate solver aiming a millimetric resolution.
Trait Implementations§
source§impl Clone for SolverType
impl Clone for SolverType
source§fn clone(&self) -> SolverType
fn clone(&self) -> SolverType
Returns a copy of the value. Read more
1.0.0 · 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 SolverType
impl Debug for SolverType
source§impl Default for SolverType
impl Default for SolverType
source§fn default() -> SolverType
fn default() -> SolverType
Returns the “default value” for a type. Read more
source§impl Display for SolverType
impl Display for SolverType
source§impl PartialEq<SolverType> for SolverType
impl PartialEq<SolverType> for SolverType
source§fn eq(&self, other: &SolverType) -> bool
fn eq(&self, other: &SolverType) -> bool
This method tests for
self and other values to be equal, and is used
by ==.impl Copy for SolverType
impl StructuralPartialEq for SolverType
Auto Trait Implementations§
impl RefUnwindSafe for SolverType
impl Send for SolverType
impl Sync for SolverType
impl Unpin for SolverType
impl UnwindSafe for SolverType
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
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Printing<T> for Twhere
T: Display,
impl<T> Printing<T> for Twhere T: Display,
§fn to_str(self) -> String
fn to_str(self) -> String
Method to serialize.
Decorates Vecs with square brackets and tuples with round ones.
Implementation code is in
printing.rs.§fn to_plainstr(self) -> String
fn to_plainstr(self) -> String
Method to serialize in minimal form (space separated, no brackets)
Implementation code is in
printing.rs.§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.§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.