pub struct LeastLoadedPolicy;Expand description
Least-loaded by queue_depth + active_streams heuristic. Filters
out devices below min_free_bytes / min_compute_cap.
Trait Implementations§
Source§impl PlacementPolicy for LeastLoadedPolicy
impl PlacementPolicy for LeastLoadedPolicy
fn choose( &self, hints: &PlacementHints, candidates: &[(u32, &DeviceLoad)], ) -> Option<u32>
Auto Trait Implementations§
impl Freeze for LeastLoadedPolicy
impl RefUnwindSafe for LeastLoadedPolicy
impl Send for LeastLoadedPolicy
impl Sync for LeastLoadedPolicy
impl Unpin for LeastLoadedPolicy
impl UnsafeUnpin for LeastLoadedPolicy
impl UnwindSafe for LeastLoadedPolicy
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