Struct LayoutTreeNode 

pub struct LayoutTreeNode {
    pub dom_node_index: JsUInt,
    pub bounding_box: Rect,
    pub layout_text: Option<String>,
    pub inline_text_nodes: Option<Vec<InlineTextBox>>,
    pub style_index: Option<JsUInt>,
    pub paint_order: Option<JsUInt>,
    pub is_stacking_context: Option<bool>,
}

Fields

dom_node_index: JsUInt

bounding_box: Rect

layout_text: Option<String>

inline_text_nodes: Option<Vec<InlineTextBox>>

style_index: Option<JsUInt>

paint_order: Option<JsUInt>

is_stacking_context: Option<bool>

Trait Implementations

impl Clone for LayoutTreeNode

fn clone(&self) -> LayoutTreeNode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LayoutTreeNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for LayoutTreeNode

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for LayoutTreeNode

fn eq(&self, other: &LayoutTreeNode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for LayoutTreeNode

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for LayoutTreeNode