#[non_exhaustive]pub enum SortOrderType {
Asc,
Desc,
Unknown(UnknownVariantValue),
}
Expand description
When writing a match expression against SortOrderType
, 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 sortordertype = unimplemented!();
match sortordertype {
SortOrderType::Asc => { /* ... */ },
SortOrderType::Desc => { /* ... */ },
other @ _ if other.as_str() == "NewFeature" => { /* handles a case for `NewFeature` */ },
_ => { /* ... */ },
}
The above code demonstrates that when sortordertype
represents
NewFeature
, the execution path will lead to the second last match arm,
even though the enum does not contain a variant SortOrderType::NewFeature
in the current version of SDK. The reason is that the variable other
,
created by the @
operator, is bound to
SortOrderType::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 SortOrderType::NewFeature
is defined.
Specifically, when sortordertype
represents NewFeature
,
the execution path will hit the second last match arm as before by virtue of
calling as_str
on SortOrderType::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
Asc
Desc
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 SortOrderType
impl SortOrderType
source§impl SortOrderType
impl SortOrderType
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 SortOrderType
impl AsRef<str> for SortOrderType
source§impl Clone for SortOrderType
impl Clone for SortOrderType
source§fn clone(&self) -> SortOrderType
fn clone(&self) -> SortOrderType
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for SortOrderType
impl Debug for SortOrderType
source§impl Display for SortOrderType
impl Display for SortOrderType
source§impl From<&str> for SortOrderType
impl From<&str> for SortOrderType
source§impl FromStr for SortOrderType
impl FromStr for SortOrderType
source§impl Hash for SortOrderType
impl Hash for SortOrderType
source§impl Ord for SortOrderType
impl Ord for SortOrderType
source§fn cmp(&self, other: &SortOrderType) -> Ordering
fn cmp(&self, other: &SortOrderType) -> 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 SortOrderType
impl PartialEq for SortOrderType
source§impl PartialOrd for SortOrderType
impl PartialOrd for SortOrderType
impl Eq for SortOrderType
impl StructuralPartialEq for SortOrderType
Auto Trait Implementations§
impl Freeze for SortOrderType
impl RefUnwindSafe for SortOrderType
impl Send for SortOrderType
impl Sync for SortOrderType
impl Unpin for SortOrderType
impl UnwindSafe for SortOrderType
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.