Enum aws_sdk_sagemaker::model::SearchSortOrder

source · [−]

#[non_exhaustive]
pub enum SearchSortOrder {
    Ascending,
    Descending,
    Unknown(String),
}

Variants (Non-exhaustive)

This enum is marked as non-exhaustive

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

`Ascending`

`Descending`

`Unknown(String)`

Unknown contains new variants that have been added since this code was generated.

Implementations

source

impl SearchSortOrder

source

pub fn as_str(&self) -> &str

Returns the &str value of the enum member.

source

pub fn values() -> &'static [&'static str ]

Returns all the &str values of the enum members.

Trait Implementations

source

impl AsRef<str> for SearchSortOrder

source

fn as_ref(&self) -> &str

Performs the conversion.

source

impl Clone for SearchSortOrder

source

fn clone(&self) -> SearchSortOrder

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl Debug for SearchSortOrder

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

impl From<&'_ str> for SearchSortOrder

source

fn from(s: &str) -> Self

Performs the conversion.

source

impl FromStr for SearchSortOrder

type Err = Infallible

The associated error which can be returned from parsing.

source

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type. Read more

source

impl Hash for SearchSortOrder

source

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

Feeds a slice of this type into the given Hasher. Read more

source

impl Ord for SearchSortOrder

source

fn cmp(&self, other: &SearchSortOrder) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 · source

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values. Read more

1.21.0 · source

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval. Read more

source

impl PartialEq<SearchSortOrder> for SearchSortOrder

source

fn eq(&self, other: &SearchSortOrder) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

source

fn ne(&self, other: &SearchSortOrder) -> bool

This method tests for !=.

source

impl PartialOrd<SearchSortOrder> for SearchSortOrder

source

fn partial_cmp(&self, other: &SearchSortOrder) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more

1.0.0 · source

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more

1.0.0 · source

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

1.0.0 · source

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more

1.0.0 · source

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

source

impl Eq for SearchSortOrder

source

impl StructuralEq for SearchSortOrder

source

impl StructuralPartialEq for SearchSortOrder

Auto Trait Implementations

impl RefUnwindSafe for SearchSortOrder

impl Send for SearchSortOrder

impl Sync for SearchSortOrder

impl Unpin for SearchSortOrder

impl UnwindSafe for SearchSortOrder

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

pub fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

pub fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T> Instrument for T

source

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

source

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

pub fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

pub fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<T> WithSubscriber for T

source

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

source

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

Enum aws_sdk_sagemaker::model::SearchSortOrder

Variants (Non-exhaustive)

Ascending

Descending

Unknown(String)

Implementations

impl SearchSortOrder

pub fn as_str(&self) -> &str

pub fn values() -> &'static [&'static str]

Trait Implementations

impl AsRef<str> for SearchSortOrder

fn as_ref(&self) -> &str

impl Clone for SearchSortOrder

fn clone(&self) -> SearchSortOrder

fn clone_from(&mut self, source: &Self)

impl Debug for SearchSortOrder

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl From<&'_ str> for SearchSortOrder

fn from(s: &str) -> Self

impl FromStr for SearchSortOrder

type Err = Infallible

fn from_str(s: &str) -> Result<Self, Self::Err>

impl Hash for SearchSortOrder

fn hash<__H: Hasher>(&self, state: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher,

impl Ord for SearchSortOrder

fn cmp(&self, other: &SearchSortOrder) -> Ordering

fn max(self, other: Self) -> Self

fn min(self, other: Self) -> Self

fn clamp(self, min: Self, max: Self) -> Self

impl PartialEq<SearchSortOrder> for SearchSortOrder

fn eq(&self, other: &SearchSortOrder) -> bool

fn ne(&self, other: &SearchSortOrder) -> bool

impl PartialOrd<SearchSortOrder> for SearchSortOrder

fn partial_cmp(&self, other: &SearchSortOrder) -> Option<Ordering>

fn lt(&self, other: &Rhs) -> bool

fn le(&self, other: &Rhs) -> bool

fn gt(&self, other: &Rhs) -> bool

fn ge(&self, other: &Rhs) -> bool

impl Eq for SearchSortOrder

impl StructuralEq for SearchSortOrder

impl StructuralPartialEq for SearchSortOrder

Auto Trait Implementations

impl RefUnwindSafe for SearchSortOrder

impl Send for SearchSortOrder

impl Sync for SearchSortOrder

impl Unpin for SearchSortOrder

impl UnwindSafe for SearchSortOrder

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<Q, K> Equivalent<K> for Q where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

pub fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T> ToOwned for T where T: Clone,

type Owned = T

pub fn to_owned(&self) -> T

pub fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where S: Into<Dispatch>,

fn with_current_subscriber(self) -> WithDispatch<Self>

`Ascending`

`Descending`

`Unknown(String)`

pub fn values() -> &'static [&'static str ]

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,