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