Struct fyrox_core::rectpack::RectPacker
source · pub struct RectPacker<T>where
T: NumAssign + Scalar + PartialOrd + Copy,{ /* private fields */ }Expand description
See module docs.
Implementations§
source§impl<T> RectPacker<T>where
T: NumAssign + Scalar + PartialOrd + Copy,
impl<T> RectPacker<T>where
T: NumAssign + Scalar + PartialOrd + Copy,
sourcepub fn new(w: T, h: T) -> Self
pub fn new(w: T, h: T) -> Self
Creates new instance of rectangle packer with given bounds.
How to choose 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.
Auto Trait Implementations§
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§
source§impl<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere
T: 'static,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
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
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.