Struct GangSchedulingPolicy 

pub struct GangSchedulingPolicy {
    pub min_count: i32,
}

GangSchedulingPolicy defines the parameters for gang scheduling.

Fields

min_count: i32

MinCount is the minimum number of pods that must be schedulable or scheduled at the same time for the scheduler to admit the entire group. It must be a positive integer.

Trait Implementations

impl Clone for GangSchedulingPolicy

fn clone(&self) -> GangSchedulingPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GangSchedulingPolicy

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

Formats the value using the given formatter.

impl DeepMerge for GangSchedulingPolicy

fn merge_from(&mut self, other: Self)

Merge other into self.

impl Default for GangSchedulingPolicy

fn default() -> GangSchedulingPolicy

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GangSchedulingPolicy

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GangSchedulingPolicy

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

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GangSchedulingPolicy