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