Struct virtual_dom_rs::ParsedVirtualNode

pub struct ParsedVirtualNode {
    pub tag: String,
    pub props: HashMap<String, String, RandomState>,
    pub custom_events: CustomEvents,
    pub browser_events: BrowserEvents,
    pub children: Option<Vec<Rc<RefCell<ParsedVirtualNode>>, Global>>,
    pub parent: Option<Rc<RefCell<ParsedVirtualNode>>>,
    pub text: Option<String>,
}

Our html! macro takes in tokens, builds ParsedVirtualNode’s from those tokens and then finally converts that ParsedVirtualNode into a VirtualNode.

When we next revisit that macro we’ll want to revisit whether or not we can build a VirtualNode as we go vs. needing this intermediary data structure.

TODO: Is this complexity really necessary? Doubt it… Map this all out on paper… shouldn’t need two nearly identical structs…?

Fields

tag: String

TODO: See if we can get rid of ParsedVirtualNode entirely in favor of only VirtualNode

props: HashMap<String, String, RandomState>

TODO: See if we can get rid of ParsedVirtualNode entirely in favor of only VirtualNode

custom_events: CustomEvents

TODO: See if we can get rid of ParsedVirtualNode entirely in favor of only VirtualNode

browser_events: BrowserEvents

TODO: See if we can get rid of ParsedVirtualNode entirely in favor of only VirtualNode

children: Option<Vec<Rc<RefCell<ParsedVirtualNode>>, Global>>

TODO: See if we can get rid of ParsedVirtualNode entirely in favor of only VirtualNode TODO: Don’t think this needs to be an option

parent: Option<Rc<RefCell<ParsedVirtualNode>>>

TODO: See if we can get rid of ParsedVirtualNode entirely in favor of only VirtualNode

text: Option<String>

TODO: See if we can get rid of ParsedVirtualNode entirely in favor of only VirtualNode

Implementations

impl ParsedVirtualNode

pub fn new(tag: &str) -> ParsedVirtualNode

Create a virtual node that is meant to represent a DOM element

pub fn text(text: &str) -> ParsedVirtualNode

Create a virtual node that is meant to represent DOM Text

pub fn take_children(&mut self) -> Vec<VirtualNode, Global>

Take off the the VirtualNode’s direct descendants (who in turn might have their own descendants)

Trait Implementations

impl Debug for ParsedVirtualNode

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

Formats the value using the given formatter.

impl<'a> From<&'a String> for ParsedVirtualNode

fn from(text: &'a String) -> ParsedVirtualNode

Converts to this type from the input type.

impl<'a> From<&'a str> for ParsedVirtualNode

fn from(text: &'a str) -> ParsedVirtualNode

Converts to this type from the input type.

impl From<ParsedVirtualNode> for VirtualNode

fn from(parsed_node: ParsedVirtualNode) -> VirtualNode

Converts to this type from the input type.

impl From<String> for ParsedVirtualNode

fn from(text: String) -> ParsedVirtualNode

Converts to this type from the input type.

impl From<Vec<VirtualNode, Global>> for ParsedVirtualNode

fn from(nodes: Vec<VirtualNode, Global>) -> ParsedVirtualNode

Converts to this type from the input type.

impl From<VirtualNode> for ParsedVirtualNode

fn from(node: VirtualNode) -> ParsedVirtualNode

Converts to this type from the input type.

impl PartialEq<ParsedVirtualNode> for ParsedVirtualNode

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl StructuralPartialEq for ParsedVirtualNode