Enum gapi_grpc::google::cloud::aiplatform::v1beta1::study_spec::Algorithm

[−] Show declaration

[+] Expand attributes
#[repr(i32)]pub enum Algorithm {
    Unspecified,
    GridSearch,
    RandomSearch,
}

[−] Expand description

The available search algorithms for the Study.

Variants

Unspecified

[−] Expand description

The default algorithm used by Vertex AI for hyperparameter tuning and Vertex Vizier.

GridSearch

[−] Expand description

Simple grid search within the feasible space. To use grid search, all parameters must be INTEGER, CATEGORICAL, or DISCRETE.

RandomSearch

[−] Expand description

Simple random search within the feasible space.

Implementations

impl Algorithm[−]

pub fn is_valid(value: i32) -> bool[−]

Returns true if value is a variant of Algorithm.

pub fn from_i32(value: i32) -> Option<Algorithm>[−]

Converts an i32 to a Algorithm, or None if value is not a valid variant.

Trait Implementations

impl Clone for Algorithm[+]

[+] Show hidden undocumented items

fn clone(&self) -> Algorithm[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl Copy for Algorithm

impl Debug for Algorithm[+]

[+] Show hidden undocumented items

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

Formats the value using the given formatter.

impl Default for Algorithm[+]

[+] Show hidden undocumented items

fn default() -> Algorithm[−]

Returns the “default value” for a type.

impl Eq for Algorithm

impl From<Algorithm> for i32[+]

[+] Show hidden undocumented items

fn from(value: Algorithm) -> i32[−]

Performs the conversion.

impl Hash for Algorithm[+]

[+] Show hidden undocumented items

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl Ord for Algorithm[+]

[+] Show hidden undocumented items

fn cmp(&self, other: &Algorithm) -> Ordering[−]

This method returns an Ordering between self and other.

[+] Expand attributes

#[must_use]pub fn max(self, other: Self) -> Self[−]

Compares and returns the maximum of two values.

[+] Expand attributes

#[must_use]pub fn min(self, other: Self) -> Self[−]

Compares and returns the minimum of two values.

[+] Expand attributes

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self[−]

Restrict a value to a certain interval.

impl PartialEq<Algorithm> for Algorithm[+]

[+] Show hidden undocumented items

fn eq(&self, other: &Algorithm) -> bool[−]

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

[+] Expand attributes

#[must_use]pub fn ne(&self, other: &Rhs) -> bool[−]

This method tests for !=.

impl PartialOrd<Algorithm> for Algorithm[+]

[+] Show hidden undocumented items

fn partial_cmp(&self, other: &Algorithm) -> Option<Ordering>[−]

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

[+] Expand attributes

#[must_use]pub fn lt(&self, other: &Rhs) -> bool[−]

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

[+] Expand attributes

#[must_use]pub fn le(&self, other: &Rhs) -> bool[−]

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

[+] Expand attributes

#[must_use]pub fn gt(&self, other: &Rhs) -> bool[−]

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

[+] Expand attributes

#[must_use]pub fn ge(&self, other: &Rhs) -> bool[−]

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

impl StructuralEq for Algorithm

impl StructuralPartialEq for Algorithm