pub struct CompositeGangSchedulingPolicy {
pub min_group_count: i32,
}Expand description
CompositeGangSchedulingPolicy indicates that the groups belonging to the composite group should be scheduled using all-or-nothing semantics.
Fields§
§min_group_count: i32minGroupCount is the minimum number of child groups 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§
Source§impl DeepMerge for CompositeGangSchedulingPolicy
impl DeepMerge for CompositeGangSchedulingPolicy
Source§fn merge_from(&mut self, other: Self)
fn merge_from(&mut self, other: Self)
Merge
other into self.Source§impl<'de> Deserialize<'de> for CompositeGangSchedulingPolicy
impl<'de> Deserialize<'de> for CompositeGangSchedulingPolicy
Source§fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl StructuralPartialEq for CompositeGangSchedulingPolicy
Auto Trait Implementations§
impl Freeze for CompositeGangSchedulingPolicy
impl RefUnwindSafe for CompositeGangSchedulingPolicy
impl Send for CompositeGangSchedulingPolicy
impl Sync for CompositeGangSchedulingPolicy
impl Unpin for CompositeGangSchedulingPolicy
impl UnsafeUnpin for CompositeGangSchedulingPolicy
impl UnwindSafe for CompositeGangSchedulingPolicy
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more