Enum PartitioningAlgorithm 

#[repr(i32)]
pub enum PartitioningAlgorithm {
    Noop = 0,
    Exp0 = 1,
    Exp1 = 2,
    Exp2 = 3,
}

Variants

Noop = 0

Exp0 = 1

Exp1 = 2

Exp2 = 3

Implementations

impl PartitioningAlgorithm

pub fn is_valid(value: i32) -> bool

Returns true if value is a variant of PartitioningAlgorithm.

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

👎Deprecated: Use the TryFrom<i32> implementation instead

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

impl PartitioningAlgorithm

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 PartitioningAlgorithm

fn clone(&self) -> PartitioningAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PartitioningAlgorithm

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

Formats the value using the given formatter.

impl Default for PartitioningAlgorithm

fn default() -> PartitioningAlgorithm

Returns the “default value” for a type.

impl From<PartitioningAlgorithm> for i32

fn from(value: PartitioningAlgorithm) -> i32

Converts to this type from the input type.

impl Hash for PartitioningAlgorithm

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 PartitioningAlgorithm

fn cmp(&self, other: &PartitioningAlgorithm) -> 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 PartitioningAlgorithm

fn eq(&self, other: &PartitioningAlgorithm) -> 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 PartitioningAlgorithm

fn partial_cmp(&self, other: &PartitioningAlgorithm) -> 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 PartitioningAlgorithm

type Error = UnknownEnumValue

The type returned in the event of a conversion error.

fn try_from(value: i32) -> Result<PartitioningAlgorithm, UnknownEnumValue>

Performs the conversion.

impl Copy for PartitioningAlgorithm

impl Eq for PartitioningAlgorithm

impl StructuralPartialEq for PartitioningAlgorithm