#[non_exhaustive]pub enum ResolverRuleAssociationStatus {
Complete,
Creating,
Deleting,
Failed,
Overridden,
Unknown(UnknownVariantValue),
}Expand description
When writing a match expression against ResolverRuleAssociationStatus, 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 resolverruleassociationstatus = unimplemented!();
match resolverruleassociationstatus {
ResolverRuleAssociationStatus::Complete => { /* ... */ },
ResolverRuleAssociationStatus::Creating => { /* ... */ },
ResolverRuleAssociationStatus::Deleting => { /* ... */ },
ResolverRuleAssociationStatus::Failed => { /* ... */ },
ResolverRuleAssociationStatus::Overridden => { /* ... */ },
other @ _ if other.as_str() == "NewFeature" => { /* handles a case for `NewFeature` */ },
_ => { /* ... */ },
}
The above code demonstrates that when resolverruleassociationstatus represents
NewFeature, the execution path will lead to the second last match arm,
even though the enum does not contain a variant ResolverRuleAssociationStatus::NewFeature
in the current version of SDK. The reason is that the variable other,
created by the @ operator, is bound to
ResolverRuleAssociationStatus::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 ResolverRuleAssociationStatus::NewFeature is defined.
Specifically, when resolverruleassociationstatus represents NewFeature,
the execution path will hit the second last match arm as before by virtue of
calling as_str on ResolverRuleAssociationStatus::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
Complete
Creating
Deleting
Failed
Overridden
Unknown(UnknownVariantValue)
Unknown. See the docs on this enum for the correct way to handle unknown variants.Unknown contains new variants that have been added since this code was generated.
Implementations§
source§impl ResolverRuleAssociationStatus
impl ResolverRuleAssociationStatus
sourcepub fn try_parse(value: &str) -> Result<Self, UnknownVariantError>
pub fn try_parse(value: &str) -> Result<Self, UnknownVariantError>
Parses the enum value while disallowing unknown variants.
Unknown variants will result in an error.
Trait Implementations§
source§impl AsRef<str> for ResolverRuleAssociationStatus
impl AsRef<str> for ResolverRuleAssociationStatus
source§impl Clone for ResolverRuleAssociationStatus
impl Clone for ResolverRuleAssociationStatus
source§fn clone(&self) -> ResolverRuleAssociationStatus
fn clone(&self) -> ResolverRuleAssociationStatus
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moresource§impl From<&str> for ResolverRuleAssociationStatus
impl From<&str> for ResolverRuleAssociationStatus
source§impl Hash for ResolverRuleAssociationStatus
impl Hash for ResolverRuleAssociationStatus
source§impl Ord for ResolverRuleAssociationStatus
impl Ord for ResolverRuleAssociationStatus
source§fn cmp(&self, other: &ResolverRuleAssociationStatus) -> Ordering
fn cmp(&self, other: &ResolverRuleAssociationStatus) -> 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 ResolverRuleAssociationStatus
impl PartialEq for ResolverRuleAssociationStatus
source§fn eq(&self, other: &ResolverRuleAssociationStatus) -> bool
fn eq(&self, other: &ResolverRuleAssociationStatus) -> bool
self and other values to be equal, and is used
by ==.source§impl PartialOrd for ResolverRuleAssociationStatus
impl PartialOrd for ResolverRuleAssociationStatus
source§fn partial_cmp(&self, other: &ResolverRuleAssociationStatus) -> Option<Ordering>
fn partial_cmp(&self, other: &ResolverRuleAssociationStatus) -> 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 ResolverRuleAssociationStatus
impl StructuralEq for ResolverRuleAssociationStatus
impl StructuralPartialEq for ResolverRuleAssociationStatus
Auto Trait Implementations§
impl RefUnwindSafe for ResolverRuleAssociationStatus
impl Send for ResolverRuleAssociationStatus
impl Sync for ResolverRuleAssociationStatus
impl Unpin for ResolverRuleAssociationStatus
impl UnwindSafe for ResolverRuleAssociationStatus
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> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.