Enum aws_sdk_ssmsap::types::BackintMode
source · #[non_exhaustive]pub enum BackintMode {
AwsBackup,
Unknown(UnknownVariantValue),
}Expand description
When writing a match expression against BackintMode, 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 backintmode = unimplemented!();
match backintmode {
BackintMode::AwsBackup => { /* ... */ },
other @ _ if other.as_str() == "NewFeature" => { /* handles a case for `NewFeature` */ },
_ => { /* ... */ },
}
The above code demonstrates that when backintmode represents
NewFeature, the execution path will lead to the second last match arm,
even though the enum does not contain a variant BackintMode::NewFeature
in the current version of SDK. The reason is that the variable other,
created by the @ operator, is bound to
BackintMode::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 BackintMode::NewFeature is defined.
Specifically, when backintmode represents NewFeature,
the execution path will hit the second last match arm as before by virtue of
calling as_str on BackintMode::NewFeature also yielding "NewFeature".
Explicitly matching on the Unknown variant should
be avoided for two reasons:
- The inner data
UnknownVariantValueis 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
AwsBackup
Unknown(UnknownVariantValue)
Unknown contains new variants that have been added since this code was generated.
Implementations§
Trait Implementations§
source§impl AsRef<str> for BackintMode
impl AsRef<str> for BackintMode
source§impl Clone for BackintMode
impl Clone for BackintMode
source§fn clone(&self) -> BackintMode
fn clone(&self) -> BackintMode
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moresource§impl Debug for BackintMode
impl Debug for BackintMode
source§impl From<&str> for BackintMode
impl From<&str> for BackintMode
source§impl FromStr for BackintMode
impl FromStr for BackintMode
source§impl Hash for BackintMode
impl Hash for BackintMode
source§impl Ord for BackintMode
impl Ord for BackintMode
source§fn cmp(&self, other: &BackintMode) -> Ordering
fn cmp(&self, other: &BackintMode) -> 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 BackintMode
impl PartialEq for BackintMode
source§fn eq(&self, other: &BackintMode) -> bool
fn eq(&self, other: &BackintMode) -> bool
self and other values to be equal, and is used
by ==.source§impl PartialOrd for BackintMode
impl PartialOrd for BackintMode
source§fn partial_cmp(&self, other: &BackintMode) -> Option<Ordering>
fn partial_cmp(&self, other: &BackintMode) -> 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 BackintMode
impl StructuralEq for BackintMode
impl StructuralPartialEq for BackintMode
Auto Trait Implementations§
impl RefUnwindSafe for BackintMode
impl Send for BackintMode
impl Sync for BackintMode
impl Unpin for BackintMode
impl UnwindSafe for BackintMode
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.