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