Struct Node 

pub struct Node<'doc, 'input> { /* private fields */ }

Implementations

impl<'doc, 'input> Node<'doc, 'input>

pub fn has_attributes(self) -> bool

pub fn attributes(self) -> Attributes<'doc, 'input>

pub fn attribute<N>(self, name: N) -> Option<&'doc str>

where Name<'doc, 'input>: PartialEq<N>,

let doc = Document::parse(r#"<root foo="bar" baz="qux"/>"#).unwrap();

let baz = doc.root_element().attribute("baz");

assert_eq!(baz, Some("qux"));

impl<'doc, 'input> Node<'doc, 'input>

pub fn document(self) -> &'doc Document<'input>

pub fn id(self) -> NodeId

pub fn is_root(&self) -> bool

pub fn is_element(&self) -> bool

pub fn is_text(&self) -> bool

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

pub fn ancestors(self) -> impl Iterator<Item = Self> + Clone

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

pub fn prev_siblings(self) -> impl Iterator<Item = Self> + Clone

pub fn prev_sibling_element(self) -> Option<Self>

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

pub fn next_siblings(self) -> impl Iterator<Item = Self> + Clone

pub fn next_sibling_element(self) -> Option<Self>

pub fn has_children(self) -> bool

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

pub fn first_child_element(self) -> Option<Self>

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

pub fn last_child_element(self) -> Option<Self>

pub fn children(self) -> Children<'doc, 'input>

pub fn child_elements(self) -> impl DoubleEndedIterator<Item = Self> + Clone

pub fn descendants(self) -> Descendants<'doc, 'input>

let doc = Document::parse(r#"<root><parent><child/></parent></root>"#).unwrap();

let mut nodes = doc.root_element().descendants();

let node = nodes.next().unwrap();
assert_eq!(node.name(), Some(Name { namespace: None, local: "root" }));

let node = nodes.next().unwrap();
assert_eq!(node.name(), Some(Name { namespace: None, local: "parent" }));

let node = nodes.next().unwrap();
assert_eq!(node.name(), Some(Name { namespace: None, local: "child" }));

assert_eq!(nodes.next(), None);

pub fn name(self) -> Option<Name<'doc, 'input>>

pub fn has_name<N>(self, name: N) -> bool

where Name<'doc, 'input>: PartialEq<N>,

pub fn text(self) -> Option<&'doc str>

pub fn child_texts(self) -> impl Iterator<Item = &'doc str> + Clone

pub fn child_text(self) -> Option<Cow<'doc, str>>

let doc = Document::parse(r#"<root>foo<child>bar</child>baz</root>"#).unwrap();

let text = doc.root_element().child_text();

assert_eq!(text, Some(Cow::Owned("foobaz".to_owned())));

pub fn descedant_texts(self) -> impl Iterator<Item = &'doc str> + Clone

pub fn descedant_text(self) -> Option<Cow<'doc, str>>

let doc = Document::parse(r#"<root>foo<child>bar</child>baz</root>"#).unwrap();

let text = doc.root_element().descedant_text();

assert_eq!(text, Some(Cow::Owned("foobarbaz".to_owned())));

Trait Implementations

impl<'doc, 'input> Clone for Node<'doc, 'input>

fn clone(&self) -> Node<'doc, 'input>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node<'_, '_>

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

Formats the value using the given formatter.

impl Hash for Node<'_, '_>

fn hash<H>(&self, hasher: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Node<'_, '_>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

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 PartialOrd for Node<'_, '_>

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'doc, 'input> Copy for Node<'doc, 'input>

impl Eq for Node<'_, '_>