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