Struct Node 

pub struct Node<'a> { /* private fields */ }

Available on crate feature unstable only.

Implementations

impl<'a> Node<'a>

pub fn children(&self) -> Children<'a>

Returns an iterator over children.

pub fn traverse(self: &Rc<Node<'a>>) -> Traverse<'a>

Returns an iterator which traverses the subtree starting at this node.

pub fn descendants(self: &Rc<Node<'a>>) -> Descendants<'a>

Returns an iterator over this node and its descendants.

pub fn ancestors(self: &Rc<Node<'a>>) -> Ancestors<'a>

Returns an iterator over ancestors.

impl<'a> Node<'a>

pub fn new(id: u32, chunk: Chunk<'a>, doc: Weak<Document<'a>>) -> Self

pub fn id(&self) -> u32

pub fn doc(&self) -> Rc<Document<'a>>

pub fn chunk<'b>(self: &'b Rc<Node<'a>>) -> &'b RefCell<Chunk<'a>>

Returns the chunk of this node.

pub fn parent(&self) -> Option<Rc<Self>>

Returns the parent of this node.

pub fn prev_sibling(&self) -> Option<Rc<Self>>

Returns the previous sibling of this node.

pub fn next_sibling(&self) -> Option<Rc<Self>>

Returns the next sibling of this node.

pub fn first_child(&self) -> Option<Rc<Self>>

Returns the first child of this node.

pub fn last_child(&self) -> Option<Rc<Self>>

Returns the last child of this node.

pub fn has_children(&self) -> bool

Returns true if this node has children.

pub fn append(&self, value: Chunk<'a>) -> Rc<Node<'a>>

Appends a new child to this node.

pub fn prepend(&self, value: Chunk<'a>) -> Rc<Node<'a>>

Prepends a new child to this node.

pub fn insert_before(&self, value: Chunk<'a>) -> Rc<Node<'a>>

Inserts a new sibling before this node.

Panics

Panics if this node is an orphan.

pub fn insert_after(&self, value: Chunk<'a>) -> Rc<Node<'a>>

Inserts a new sibling after this node.

Panics

Panics if this node is an orphan.

pub fn detach(&self, recycle: bool)

Detaches this node from its parent.

pub fn append_id(&self, new_child_id: u32) -> Rc<Node<'a>>

Appends a child to this node.

pub fn prepend_id(&self, new_child_id: u32) -> Rc<Node<'a>>

Prepends a child to this node.

pub fn insert_id_before(&self, new_sibling_id: u32) -> Rc<Node<'a>>

Inserts a sibling before this node.

Panics

• Panics if new_sibling_id is not valid.
• Panics if this node is an orphan.

pub fn insert_id_after(&self, new_sibling_id: u32) -> Rc<Node<'a>>

Inserts a sibling after this node.

Panics

• Panics if new_sibling_id is not valid.
• Panics if this node is an orphan.

pub fn to_string(&self, buf: &mut String)

Returns the string representation of this node.

pub fn strip_styles(&self)

pub fn word_len(&self, len: &mut usize)

Trait Implementations

impl<'a> Clone for Node<'a>

fn clone(&self) -> Node<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for Node<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for Node<'a>

impl<'a> PartialEq for Node<'a>

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.