pub struct PositionedTree<'a> {
pub tree: &'a LayoutTree,
pub calculated_positions: &'a BTreeMap<usize, LogicalPosition>,
}Expand description
Helper struct to pass layout results to the display list generator.
Combines the layout tree with pre-calculated absolute positions for each node. The positions are stored separately because they are computed in a final positioning pass after layout is complete.
Fields§
§tree: &'a LayoutTreeThe layout tree containing all nodes with their computed sizes
calculated_positions: &'a BTreeMap<usize, LogicalPosition>Map from node index to its absolute position in the document
Auto Trait Implementations§
impl<'a> Freeze for PositionedTree<'a>
impl<'a> RefUnwindSafe for PositionedTree<'a>
impl<'a> Send for PositionedTree<'a>
impl<'a> Sync for PositionedTree<'a>
impl<'a> Unpin for PositionedTree<'a>
impl<'a> UnwindSafe for PositionedTree<'a>
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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