Skip to main content

PackStrategy

Enum PackStrategy 

Source
pub enum PackStrategy {
    NextFit,
    FirstFit,
    BestFit,
    WorstFit,
    FirstFitDecreasing,
    BestFitDecreasing,
    FirstFitShuffle,
    ModifiedFirstFitDecreasing,
    OptimizedBestFitDecreasing,
    ParallelOptimizedBestFitDecreasing,
    Harmonic,
}
Expand description

Packing algorithm strategy.

Used to select which algorithm the Packer dispatches to.

Variants§

§

NextFit

Next Fit: O(n), single open bin. Worst ratio (2.0) but fastest and lowest memory.

§

FirstFit

First Fit: O(n log B), leftmost bin with space. Online baseline with 1.7 approx ratio.

§

BestFit

Best Fit: O(n log B), tightest fitting bin. Slightly better than FF in practice.

§

WorstFit

Worst Fit: O(n log B), loosest fitting bin. Spreads items evenly across bins.

§

FirstFitDecreasing

First Fit Decreasing: sort desc + FF. 11/9 ≈ 1.22 ratio. Best general-purpose offline algorithm.

§

BestFitDecreasing

Best Fit Decreasing: sort desc + BF. Same ratio as FFD.

§

FirstFitShuffle

First Fit Shuffle: shuffle with seed + FF. Preserves training randomness (used by NeMo).

§

ModifiedFirstFitDecreasing

Modified First Fit Decreasing: 5-phase with size classes (>1/2, >1/3, etc.). Tighter worst-case bound than FFD: 71/60 ≈ 1.183.

§

OptimizedBestFitDecreasing

Optimized Best-Fit Decreasing: counting sort + capacity segment tree. O(N log L) where L = max_length. Primary target to beat baseline.

§

ParallelOptimizedBestFitDecreasing

Parallel Optimized Best-Fit Decreasing: splits input across threads, repacks partial bins. Uses Rayon for data-parallel packing.

§

Harmonic

Harmonic-k: classifies items by size into k classes. Near-optimal asymptotic ratio.

Implementations§

Source§

impl PackStrategy

Source

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

Human-readable name for display and logging.

Source

pub fn short_name(&self) -> Option<&'static str>

Short-form alias for API usage.

Returns None for strategies that don’t have a common abbreviation.

Source

pub fn from_short_name(name: &str) -> Option<Self>

Look up a strategy by its short name (case-insensitive).

Trait Implementations§

Source§

impl Clone for PackStrategy

Source§

fn clone(&self) -> PackStrategy

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for PackStrategy

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for PackStrategy

Source§

fn default() -> PackStrategy

Returns the “default value” for a type. Read more
Source§

impl PartialEq for PackStrategy

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

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

impl Copy for PackStrategy

Source§

impl Eq for PackStrategy

Source§

impl StructuralPartialEq for PackStrategy

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V