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