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