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