[−][src]Struct sxd_xpath_visitor::nodeset::Nodeset
An unordered collection of unique nodes
Implementations
impl<'d> Nodeset<'d>
[src]
pub fn new() -> Nodeset<'d>
[src]
pub fn contains<N>(&self, node: N) -> bool where
N: Into<Node<'d>>,
[src]
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>>,
[src]
N: Into<Node<'d>>,
Add the given node to the set
pub fn iter<'a>(&'a self) -> Iter<'a, 'd>ⓘ
[src]
pub fn size(&self) -> usize
[src]
pub fn document_order_first(&self) -> Option<Node<'d>>
[src]
Returns the node that occurs first in document order
pub fn document_order(&self) -> Vec<Node<'d>>
[src]
Trait Implementations
impl<'d> Clone for Nodeset<'d>
[src]
impl<'d> Debug for Nodeset<'d>
[src]
impl<'d> Default for Nodeset<'d>
[src]
impl<'d> Extend<Node<'d>> for Nodeset<'d>
[src]
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = Node<'d>>,
[src]
I: IntoIterator<Item = Node<'d>>,
pub fn extend_one(&mut self, item: A)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<'d> From<Nodeset<'d>> for Value<'d>
[src]
impl<'d> From<OrderedNodes<'d>> for Nodeset<'d>
[src]
pub fn from(other: OrderedNodes<'d>) -> Self
[src]
impl<'d> FromIterator<Node<'d>> for Nodeset<'d>
[src]
pub fn from_iter<I>(iterator: I) -> Nodeset<'d> where
I: IntoIterator<Item = Node<'d>>,
[src]
I: IntoIterator<Item = Node<'d>>,
impl<'a, 'd: 'a> IntoIterator for &'a Nodeset<'d>
[src]
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?
pub fn into_iter(self) -> Iter<'a, 'd>ⓘ
[src]
impl<'d> IntoIterator for Nodeset<'d>
[src]
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?
pub fn into_iter(self) -> IntoIter<'d>ⓘ
[src]
impl<'d> PartialEq<Nodeset<'d>> for Nodeset<'d>
[src]
pub fn eq(&self, other: &Nodeset<'d>) -> bool
[src]
pub fn ne(&self, other: &Nodeset<'d>) -> bool
[src]
impl<'d> PartialEq<Nodeset<'d>> for Value<'d>
[src]
pub fn eq(&self, other: &Nodeset<'d>) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'d> PartialEq<Value<'d>> for Nodeset<'d>
[src]
pub fn eq(&self, other: &Value<'d>) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'d> StructuralPartialEq for Nodeset<'d>
[src]
Auto Trait Implementations
impl<'d> !RefUnwindSafe for Nodeset<'d>
[src]
impl<'d> !Send for Nodeset<'d>
[src]
impl<'d> !Sync for Nodeset<'d>
[src]
impl<'d> Unpin for Nodeset<'d>
[src]
impl<'d> !UnwindSafe for Nodeset<'d>
[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Downcast for T where
T: Any,
[src]
T: Any,
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,