#[non_exhaustive]pub enum PositionSolverType {
Gnss,
Unknown(UnknownVariantValue),
}
Expand description
When writing a match expression against PositionSolverType
, it is important to ensure
your code is forward-compatible. That is, if a match arm handles a case for a
feature that is supported by the service but has not been represented as an enum
variant in a current version of SDK, your code should continue to work when you
upgrade SDK to a future version in which the enum does include a variant for that
feature.
Here is an example of how you can make a match expression forward-compatible:
# let positionsolvertype = unimplemented!();
match positionsolvertype {
PositionSolverType::Gnss => { /* ... */ },
other @ _ if other.as_str() == "NewFeature" => { /* handles a case for `NewFeature` */ },
_ => { /* ... */ },
}
The above code demonstrates that when positionsolvertype
represents
NewFeature
, the execution path will lead to the second last match arm,
even though the enum does not contain a variant PositionSolverType::NewFeature
in the current version of SDK. The reason is that the variable other
,
created by the @
operator, is bound to
PositionSolverType::Unknown(UnknownVariantValue("NewFeature".to_owned()))
and calling as_str
on it yields "NewFeature"
.
This match expression is forward-compatible when executed with a newer
version of SDK where the variant PositionSolverType::NewFeature
is defined.
Specifically, when positionsolvertype
represents NewFeature
,
the execution path will hit the second last match arm as before by virtue of
calling as_str
on PositionSolverType::NewFeature
also yielding "NewFeature"
.
Explicitly matching on the Unknown
variant should
be avoided for two reasons:
- The inner data
UnknownVariantValue
is opaque, and no further information can be extracted. - It might inadvertently shadow other intended match arms.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Gnss
Unknown(UnknownVariantValue)
Unknown
contains new variants that have been added since this code was generated.
Implementations§
Trait Implementations§
source§impl AsRef<str> for PositionSolverType
impl AsRef<str> for PositionSolverType
source§impl Clone for PositionSolverType
impl Clone for PositionSolverType
source§fn clone(&self) -> PositionSolverType
fn clone(&self) -> PositionSolverType
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for PositionSolverType
impl Debug for PositionSolverType
source§impl From<&str> for PositionSolverType
impl From<&str> for PositionSolverType
source§impl FromStr for PositionSolverType
impl FromStr for PositionSolverType
source§impl Hash for PositionSolverType
impl Hash for PositionSolverType
source§impl Ord for PositionSolverType
impl Ord for PositionSolverType
source§fn cmp(&self, other: &PositionSolverType) -> Ordering
fn cmp(&self, other: &PositionSolverType) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
source§impl PartialEq for PositionSolverType
impl PartialEq for PositionSolverType
source§fn eq(&self, other: &PositionSolverType) -> bool
fn eq(&self, other: &PositionSolverType) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd for PositionSolverType
impl PartialOrd for PositionSolverType
source§fn partial_cmp(&self, other: &PositionSolverType) -> Option<Ordering>
fn partial_cmp(&self, other: &PositionSolverType) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moreimpl Eq for PositionSolverType
impl StructuralEq for PositionSolverType
impl StructuralPartialEq for PositionSolverType
Auto Trait Implementations§
impl RefUnwindSafe for PositionSolverType
impl Send for PositionSolverType
impl Sync for PositionSolverType
impl Unpin for PositionSolverType
impl UnwindSafe for PositionSolverType
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
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.