Enum TwoDAlgorithm

Source

pub enum TwoDAlgorithm {
Show 20 variants    Auto,
    MaxRects,
    MaxRectsBestShortSideFit,
    MaxRectsBestLongSideFit,
    MaxRectsBottomLeft,
    MaxRectsContactPoint,
    Skyline,
    SkylineMinWaste,
    Guillotine,
    GuillotineBestShortSideFit,
    GuillotineBestLongSideFit,
    GuillotineShorterLeftoverAxis,
    GuillotineLongerLeftoverAxis,
    GuillotineMinAreaSplit,
    GuillotineMaxAreaSplit,
    NextFitDecreasingHeight,
    FirstFitDecreasingHeight,
    BestFitDecreasingHeight,
    MultiStart,
    RotationSearch,
}

Expand description

Algorithm selector for solve_2d.

Variants§

§

Auto

Try multiple strategies and return the best.

§

MaxRects

Classic MaxRects best-area-fit construction.

§

MaxRectsBestShortSideFit

MaxRects with best-short-side-fit placement scoring.

§

MaxRectsBestLongSideFit

MaxRects with best-long-side-fit placement scoring.

§

MaxRectsBottomLeft

MaxRects with bottom-left placement scoring.

§

MaxRectsContactPoint

MaxRects with contact-point placement scoring.

§

Skyline

Skyline-based construction.

§

SkylineMinWaste

Skyline construction ranked by minimum waste.

§

Guillotine

Guillotine beam search.

§

GuillotineBestShortSideFit

Guillotine beam search with best-short-side-fit candidate ranking.

§

GuillotineBestLongSideFit

Guillotine beam search with best-long-side-fit candidate ranking.

§

GuillotineShorterLeftoverAxis

Guillotine beam search with shorter-leftover-axis split selection.

§

GuillotineLongerLeftoverAxis

Guillotine beam search with longer-leftover-axis split selection.

§

GuillotineMinAreaSplit

Guillotine beam search with minimum-area split selection.

§

GuillotineMaxAreaSplit

Guillotine beam search with maximum-area split selection.

§

NextFitDecreasingHeight

Next-fit decreasing height shelf heuristic.

§

FirstFitDecreasingHeight

First-fit decreasing height shelf heuristic.

§

BestFitDecreasingHeight

Best-fit decreasing height shelf heuristic.

§

MultiStart

Multistart MaxRects meta-strategy.

§

RotationSearch

Exhaustive rotation search: enumerates all 2^k rotation assignments for k rotatable demand types (or samples multistart_runs random assignments when k exceeds auto_rotation_search_max_types). Uses MaxRects best-area-fit as the inner packer.

Trait Implementations§

Source §

impl Clone for TwoDAlgorithm

Source §

fn clone(&self) -> TwoDAlgorithm

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 TwoDAlgorithm

Source §

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

Formats the value using the given formatter. Read more

Source §

impl Default for TwoDAlgorithm

Source §

fn default() -> TwoDAlgorithm

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

Source §

impl<'de> Deserialize<'de> for TwoDAlgorithm

Source §

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more

Source §

impl PartialEq for TwoDAlgorithm

Source §

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

Source §

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

Serialize this value into the given Serde serializer. Read more

Source §

impl Copy for TwoDAlgorithm

Source §

impl Eq for TwoDAlgorithm

Source §

impl StructuralPartialEq for TwoDAlgorithm

Auto Trait Implementations§

§

impl UnwindSafe for TwoDAlgorithm

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 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 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>::Error>

Performs the conversion.

Source §

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

Source §

type Error = >::Error

The type returned in the event of a conversion error.

Source §

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

Performs the conversion.

Source §

TwoDAlgorithm

Enum TwoDAlgorithm Copy item path

Variants§

Auto

MaxRects

MaxRectsBestShortSideFit

MaxRectsBestLongSideFit

MaxRectsBottomLeft

MaxRectsContactPoint

Skyline

SkylineMinWaste

Guillotine

GuillotineBestShortSideFit

GuillotineBestLongSideFit

GuillotineShorterLeftoverAxis

GuillotineLongerLeftoverAxis

GuillotineMinAreaSplit

GuillotineMaxAreaSplit

NextFitDecreasingHeight

FirstFitDecreasingHeight

BestFitDecreasingHeight

MultiStart

RotationSearch

Trait Implementations§

impl Clone for TwoDAlgorithm

fn clone(&self) -> TwoDAlgorithm

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

impl Debug for TwoDAlgorithm

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

impl Default for TwoDAlgorithm

fn default() -> TwoDAlgorithm

impl<'de> Deserialize<'de> for TwoDAlgorithm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

impl PartialEq for TwoDAlgorithm

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

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

impl Serialize for TwoDAlgorithm

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

impl Copy for TwoDAlgorithm

impl Eq for TwoDAlgorithm

impl StructuralPartialEq for TwoDAlgorithm

Auto Trait Implementations§

impl Freeze for TwoDAlgorithm

impl RefUnwindSafe for TwoDAlgorithm

impl Send for TwoDAlgorithm

impl Sync for TwoDAlgorithm

impl Unpin for TwoDAlgorithm

impl UnsafeUnpin for TwoDAlgorithm

impl UnwindSafe for TwoDAlgorithm

Blanket Implementations§

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> CloneToUninit for Twhere T: Clone,

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> IntoEither for T

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

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

impl<T> Pointable for T

const ALIGN: usize

type Init = T

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

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

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

unsafe fn drop(ptr: usize)

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

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

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

type Error = Infallible

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

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

Enum TwoDAlgorithm

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where __D: Deserializer<'de>,

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

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

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

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

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

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

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

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

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

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

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,