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