Enum Optimality 

#[non_exhaustive]
#[repr(i32)]
pub enum Optimality {
    Unspecified = 0,
    Optimal = 1,
    NotOptimal = 2,
}

Variants (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.

Unspecified = 0

The solver cannot determine whether the solution is optimal. Most of heuristic solvers should use this value.

Optimal = 1

The solver has determined that the solution is optimal.

NotOptimal = 2

The solver has determined that the solution is not optimal.

Implementations

impl Optimality

pub fn is_valid(value: i32) -> bool

Returns true if value is a variant of Optimality.

pub fn from_i32(value: i32) -> Option<Optimality>

👎Deprecated:

Use the TryFrom<i32> implementation instead

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

impl Optimality

pub fn as_str_name(&self) -> &'static str

String value of the enum field names used in the ProtoBuf definition.

The values are not transformed in any way and thus are considered stable (if the ProtoBuf definition does not change) and safe for programmatic use.

pub fn from_str_name(value: &str) -> Option<Self>

Creates an enum from field names used in the ProtoBuf definition.

Trait Implementations

impl Clone for Optimality

fn clone(&self) -> Optimality

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Optimality

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

Formats the value using the given formatter.

impl Default for Optimality

fn default() -> Optimality

Returns the “default value” for a type.

impl From<Optimality> for i32

fn from(value: Optimality) -> i32

Converts to this type from the input type.

impl Hash for Optimality

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Optimality

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

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

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Optimality

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Optimality

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

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl TryFrom<i32> for Optimality

type Error = DecodeError

The type returned in the event of a conversion error.

fn try_from(value: i32) -> Result<Optimality, DecodeError>

Performs the conversion.

impl Copy for Optimality

impl Eq for Optimality

impl StructuralPartialEq for Optimality