pub struct Layout {
pub order: u32,
pub size: Size<f32>,
pub location: Point<f32>,
}
Expand description
The final result of a layout algorithm for a single Node
.
Fields§
§order: u32
The relative ordering of the node
Nodes with a higher order should be rendered on top of those with a lower order. This is effectively a topological sort of each tree.
size: Size<f32>
The width and height of the node
location: Point<f32>
The bottom-left corner of the node
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for Layout
impl Send for Layout
impl Sync for Layout
impl Unpin for Layout
impl UnwindSafe for Layout
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