Enum aws_sdk_ec2::model::PartitionLoadFrequency
source · #[non_exhaustive]
pub enum PartitionLoadFrequency {
Daily,
Monthly,
None,
Weekly,
Unknown(UnknownVariantValue),
}
Expand description
When writing a match expression against PartitionLoadFrequency
, 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 partitionloadfrequency = unimplemented!();
match partitionloadfrequency {
PartitionLoadFrequency::Daily => { /* ... */ },
PartitionLoadFrequency::Monthly => { /* ... */ },
PartitionLoadFrequency::None => { /* ... */ },
PartitionLoadFrequency::Weekly => { /* ... */ },
other @ _ if other.as_str() == "NewFeature" => { /* handles a case for `NewFeature` */ },
_ => { /* ... */ },
}
The above code demonstrates that when partitionloadfrequency
represents
NewFeature
, the execution path will lead to the second last match arm,
even though the enum does not contain a variant PartitionLoadFrequency::NewFeature
in the current version of SDK. The reason is that the variable other
,
created by the @
operator, is bound to
PartitionLoadFrequency::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 PartitionLoadFrequency::NewFeature
is defined.
Specifically, when partitionloadfrequency
represents NewFeature
,
the execution path will hit the second last match arm as before by virtue of
calling as_str
on PartitionLoadFrequency::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
Daily
Monthly
None
Weekly
Unknown(UnknownVariantValue)
Unknown
contains new variants that have been added since this code was generated.
Implementations§
source§impl PartitionLoadFrequency
impl PartitionLoadFrequency
sourcepub fn as_str(&self) -> &str
pub fn as_str(&self) -> &str
Returns the &str
value of the enum member.
Examples found in repository?
More examples
4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805
pub fn serialize_structure_crate_model_athena_integration(
mut writer: aws_smithy_query::QueryValueWriter,
input: &crate::model::AthenaIntegration,
) -> Result<(), aws_smithy_http::operation::error::SerializationError> {
#[allow(unused_mut)]
let mut scope_1363 = writer.prefix("IntegrationResultS3DestinationArn");
if let Some(var_1364) = &input.integration_result_s3_destination_arn {
scope_1363.string(var_1364);
}
#[allow(unused_mut)]
let mut scope_1365 = writer.prefix("PartitionLoadFrequency");
if let Some(var_1366) = &input.partition_load_frequency {
scope_1365.string(var_1366.as_str());
}
#[allow(unused_mut)]
let mut scope_1367 = writer.prefix("PartitionStartDate");
if let Some(var_1368) = &input.partition_start_date {
scope_1367.date_time(var_1368, aws_smithy_types::date_time::Format::DateTime)?;
}
#[allow(unused_mut)]
let mut scope_1369 = writer.prefix("PartitionEndDate");
if let Some(var_1370) = &input.partition_end_date {
scope_1369.date_time(var_1370, aws_smithy_types::date_time::Format::DateTime)?;
}
Ok(())
}
Trait Implementations§
source§impl AsRef<str> for PartitionLoadFrequency
impl AsRef<str> for PartitionLoadFrequency
source§impl Clone for PartitionLoadFrequency
impl Clone for PartitionLoadFrequency
source§fn clone(&self) -> PartitionLoadFrequency
fn clone(&self) -> PartitionLoadFrequency
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for PartitionLoadFrequency
impl Debug for PartitionLoadFrequency
source§impl From<&str> for PartitionLoadFrequency
impl From<&str> for PartitionLoadFrequency
source§impl FromStr for PartitionLoadFrequency
impl FromStr for PartitionLoadFrequency
source§impl Hash for PartitionLoadFrequency
impl Hash for PartitionLoadFrequency
source§impl Ord for PartitionLoadFrequency
impl Ord for PartitionLoadFrequency
source§fn cmp(&self, other: &PartitionLoadFrequency) -> Ordering
fn cmp(&self, other: &PartitionLoadFrequency) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl PartialEq<PartitionLoadFrequency> for PartitionLoadFrequency
impl PartialEq<PartitionLoadFrequency> for PartitionLoadFrequency
source§fn eq(&self, other: &PartitionLoadFrequency) -> bool
fn eq(&self, other: &PartitionLoadFrequency) -> bool
source§impl PartialOrd<PartitionLoadFrequency> for PartitionLoadFrequency
impl PartialOrd<PartitionLoadFrequency> for PartitionLoadFrequency
source§fn partial_cmp(&self, other: &PartitionLoadFrequency) -> Option<Ordering>
fn partial_cmp(&self, other: &PartitionLoadFrequency) -> 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 PartitionLoadFrequency
impl StructuralEq for PartitionLoadFrequency
impl StructuralPartialEq for PartitionLoadFrequency
Auto Trait Implementations§
impl RefUnwindSafe for PartitionLoadFrequency
impl Send for PartitionLoadFrequency
impl Sync for PartitionLoadFrequency
impl Unpin for PartitionLoadFrequency
impl UnwindSafe for PartitionLoadFrequency
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.