Enum aws_sdk_lexmodelsv2::model::SearchOrder
source · #[non_exhaustive]
pub enum SearchOrder {
Ascending,
Descending,
Unknown(UnknownVariantValue),
}Expand description
When writing a match expression against SearchOrder, 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 searchorder = unimplemented!();
match searchorder {
SearchOrder::Ascending => { /* ... */ },
SearchOrder::Descending => { /* ... */ },
other @ _ if other.as_str() == "NewFeature" => { /* handles a case for `NewFeature` */ },
_ => { /* ... */ },
}
The above code demonstrates that when searchorder represents
NewFeature, the execution path will lead to the second last match arm,
even though the enum does not contain a variant SearchOrder::NewFeature
in the current version of SDK. The reason is that the variable other,
created by the @ operator, is bound to
SearchOrder::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 SearchOrder::NewFeature is defined.
Specifically, when searchorder represents NewFeature,
the execution path will hit the second last match arm as before by virtue of
calling as_str on SearchOrder::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
Ascending
Descending
Unknown(UnknownVariantValue)
Unknown contains new variants that have been added since this code was generated.
Implementations§
source§impl SearchOrder
impl SearchOrder
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
935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970
pub fn serialize_structure_crate_input_search_associated_transcripts_input(
object: &mut aws_smithy_json::serialize::JsonObjectWriter,
input: &crate::input::SearchAssociatedTranscriptsInput,
) -> Result<(), aws_smithy_http::operation::error::SerializationError> {
if let Some(var_207) = &input.filters {
let mut array_208 = object.key("filters").start_array();
for item_209 in var_207 {
{
#[allow(unused_mut)]
let mut object_210 = array_208.value().start_object();
crate::json_ser::serialize_structure_crate_model_associated_transcript_filter(
&mut object_210,
item_209,
)?;
object_210.finish();
}
}
array_208.finish();
}
if let Some(var_211) = &input.max_results {
object.key("maxResults").number(
#[allow(clippy::useless_conversion)]
aws_smithy_types::Number::NegInt((*var_211).into()),
);
}
if let Some(var_212) = &input.next_index {
object.key("nextIndex").number(
#[allow(clippy::useless_conversion)]
aws_smithy_types::Number::NegInt((*var_212).into()),
);
}
if let Some(var_213) = &input.search_order {
object.key("searchOrder").string(var_213.as_str());
}
Ok(())
}Trait Implementations§
source§impl AsRef<str> for SearchOrder
impl AsRef<str> for SearchOrder
source§impl Clone for SearchOrder
impl Clone for SearchOrder
source§fn clone(&self) -> SearchOrder
fn clone(&self) -> SearchOrder
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moresource§impl Debug for SearchOrder
impl Debug for SearchOrder
source§impl From<&str> for SearchOrder
impl From<&str> for SearchOrder
source§impl FromStr for SearchOrder
impl FromStr for SearchOrder
source§impl Hash for SearchOrder
impl Hash for SearchOrder
source§impl Ord for SearchOrder
impl Ord for SearchOrder
source§fn cmp(&self, other: &SearchOrder) -> Ordering
fn cmp(&self, other: &SearchOrder) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl PartialEq<SearchOrder> for SearchOrder
impl PartialEq<SearchOrder> for SearchOrder
source§fn eq(&self, other: &SearchOrder) -> bool
fn eq(&self, other: &SearchOrder) -> bool
source§impl PartialOrd<SearchOrder> for SearchOrder
impl PartialOrd<SearchOrder> for SearchOrder
source§fn partial_cmp(&self, other: &SearchOrder) -> Option<Ordering>
fn partial_cmp(&self, other: &SearchOrder) -> 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 SearchOrder
impl StructuralEq for SearchOrder
impl StructuralPartialEq for SearchOrder
Auto Trait Implementations§
impl RefUnwindSafe for SearchOrder
impl Send for SearchOrder
impl Sync for SearchOrder
impl Unpin for SearchOrder
impl UnwindSafe for SearchOrder
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.