Struct Nodeset 

pub struct Nodeset<'d> { /* private fields */ }

An unordered collection of unique nodes

Implementations

impl<'d> Nodeset<'d>

pub fn new() -> Nodeset<'d>

pub fn contains<N>(&self, node: N) -> bool

where N: Into<Node<'d>>,

Checks if the node is present in the set

pub fn add<N>(&mut self, node: N)

where N: Into<Node<'d>>,

Add the given node to the set

pub fn iter<'a>(&'a self) -> Iter<'a, 'd>

pub fn size(&self) -> usize

pub fn document_order_first(&self) -> Option<Node<'d>>

Returns the node that occurs first in document order

pub fn document_order(&self) -> Vec<Node<'d>>

Trait Implementations

impl<'d> Clone for Nodeset<'d>

fn clone(&self) -> Nodeset<'d>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'d> Debug for Nodeset<'d>

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

Formats the value using the given formatter.

impl<'d> Default for Nodeset<'d>

fn default() -> Nodeset<'d>

Returns the “default value” for a type.

impl<'d> Extend<Node<'d>> for Nodeset<'d>

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = Node<'d>>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<'d> From<Nodeset<'d>> for Value<'d>

fn from(other: Nodeset<'d>) -> Value<'d>

Converts to this type from the input type.

impl<'d> From<OrderedNodes<'d>> for Nodeset<'d>

fn from(other: OrderedNodes<'d>) -> Self

Converts to this type from the input type.

impl<'d> FromIterator<Node<'d>> for Nodeset<'d>

fn from_iter<I>(iterator: I) -> Nodeset<'d>

where I: IntoIterator<Item = Node<'d>>,

Creates a value from an iterator.

impl<'a, 'd: 'a> IntoIterator for &'a Nodeset<'d>

type Item = Node<'d>

The type of the elements being iterated over.

type IntoIter = Iter<'a, 'd>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, 'd>

Creates an iterator from a value.

impl<'d> IntoIterator for Nodeset<'d>

type Item = Node<'d>

The type of the elements being iterated over.

type IntoIter = IntoIter<'d>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IntoIter<'d>

Creates an iterator from a value.

impl<'d> PartialEq<Nodeset<'d>> for Value<'d>

fn eq(&self, other: &Nodeset<'d>) -> 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<'d> PartialEq<Value<'d>> for Nodeset<'d>

fn eq(&self, other: &Value<'d>) -> 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<'d> PartialEq for Nodeset<'d>

fn eq(&self, other: &Nodeset<'d>) -> 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<'d> StructuralPartialEq for Nodeset<'d>