Struct Node

pub struct Node {
    pub attrs: HashMap<String, String>,
    pub children: Vec<Rc<RefCell<Node>>>,
    pub tag: String,
    pub pre: Option<Weak<RefCell<Node>>>,
}

Virtual UI Node

Fields

attrs: HashMap<String, String>

Node attributes

children: Vec<Rc<RefCell<Node>>>

Node children

tag: String

Node tag

pre: Option<Weak<RefCell<Node>>>

Node parent

Implementations

impl Node

pub fn drain(t: Rc<RefCell<Node>>)

Drain tree if not the root

pub fn idx(&mut self, path: &mut Vec<u8>)

The path of current node

pub fn locate(&self, path: Vec<usize>) -> Vec<usize>

Locate tree

pub fn new( attrs: HashMap<String, String>, children: Vec<Rc<RefCell<Node>>>, pre: Option<Weak<RefCell<Node>>>, tag: String, ) -> Rc<RefCell<Node>>

Generate a Rc<RefCell<Node>>

pub fn push(r: Rc<RefCell<Node>>, c: Rc<RefCell<Node>>)

Add second tree to the first one.

pub fn remove(&mut self, c: Rc<RefCell<Node>>)

Delete spefic child using rc

pub fn replace(&mut self, t: Node)

Replace current tree

pub fn update(&mut self)

Update tree

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Default for Node

fn default() -> Node

Returns the “default value” for a type.

impl PartialEq for Node

fn eq(&self, other: &Self) -> 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<'t> Serde<Node, String, Error> for Node

fn de(h: String) -> Result<Node, Error>

Deserialize

fn ser(&self) -> String

Serialize