Struct SolvedLayoutCache

Source

pub struct SolvedLayoutCache {
    pub solved_layouts: BTreeMap<DomId, LayoutResult>,
    pub display_lists: BTreeMap<DomId, DisplayList>,
    pub iframe_mappings: BTreeMap<(DomId, NodeId), DomId>,
    pub scrollable_nodes: BTreeMap<DomId, ScrolledNodes>,
    pub rects_in_rendering_order: BTreeMap<DomId, ContentGroup>,
}

Fields§

§solved_layouts: BTreeMap<DomId, LayoutResult>§display_lists: BTreeMap<DomId, DisplayList>§iframe_mappings: BTreeMap<(DomId, NodeId), DomId>§scrollable_nodes: BTreeMap<DomId, ScrolledNodes>§rects_in_rendering_order: BTreeMap<DomId, ContentGroup>

Struct SolvedLayoutCacheCopy item path

Fields§

Trait Implementations§

impl Default for SolvedLayoutCache

fn default() -> SolvedLayoutCache

Auto Trait Implementations§

impl Freeze for SolvedLayoutCache

impl RefUnwindSafe for SolvedLayoutCache

impl Send for SolvedLayoutCache

impl Sync for SolvedLayoutCache

impl Unpin for SolvedLayoutCache

impl UnwindSafe for SolvedLayoutCache

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> 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, 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>,

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

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

Struct SolvedLayoutCache

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, U> Into<U> for T
where U: From<T>,

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

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