RectPacker

fyrox_math::pack

Struct RectPacker

pub struct RectPacker<T>where
    T: Number,
{ /* private fields */ }

Expand description

Rectangle packer packs small rectangles into a bigger one.

Implementations§

impl<T> RectPacker<T>
where T: Number,

pub fn new(w: T, h: T) -> RectPacker<T>

Creates new instance of the rectangle packer with given bounds.

§How to choose initial bounds

If you have a set of rectangles and you need to calculate average side length of a square, then calculate total area of your triangles by sum of width*height and then take square root out of area. You’ll get side length of a square which can be used as width and height parameters.

pub fn clear(&mut self)

Clears packer and prepares it for another run. It is much cheaper than create new packer, because it reuses previously allocated memory.

pub fn find_free(&mut self, w: T, h: T) -> Option<Rect<T>>

Tries to find free place to put rectangle with given size. Returns None if there insufficient space.

Auto Trait Implementations§

impl<T> Freeze for RectPacker<T>
where T: Freeze,

impl<T> RefUnwindSafe for RectPacker<T>
where T: RefUnwindSafe,

impl<T> Send for RectPacker<T>
where T: Send,

impl<T> Sync for RectPacker<T>
where T: Sync,

impl<T> Unpin for RectPacker<T>
where T: Unpin,

impl<T> UnwindSafe for RectPacker<T>
where T: UnwindSafe,

Blanket Implementations§

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

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

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

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

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

fn into(self) -> U

Calls U::from(self).

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

impl<T> Same for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

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

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

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

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

The type returned in the event of a conversion error.

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

Performs the conversion.