Struct QueryResult

pub struct QueryResult<T, R> { /* private fields */ }

Implementations

impl<T: Queryable, R: Queryable> QueryResult<T, R>

pub fn query<U: Queryable>(&self) -> QueryResult<U, R>

pub fn find<U: Queryable>(&self) -> QueryResult<U, R>

pub fn children<U: Queryable>(&self) -> QueryResult<U, R>

pub fn new(result: Vec<Node<T>>, root: R) -> QueryResult<T, R>

pub fn len(&self) -> usize

pub fn iter(&self) -> Iter<'_, Node<T>>

pub fn iter_mut(&mut self) -> IterMut<'_, Node<T>>

pub fn filter<P>(&self, predicate: P) -> QueryResult<T, R>

where for<'r> P: FnMut(&'r Node<T>) -> bool,

pub fn parents<U: Queryable>(&self) -> QueryResult<U, R>

pub fn parent<U: Queryable>(&self) -> QueryResult<U, R>

pub fn prev<U: Queryable>(&self) -> QueryResult<U, R>

pub fn prev_all<U: Queryable>(&self) -> QueryResult<U, R>

pub fn prev_until<U: Queryable, P>(&self, predicate: P) -> QueryResult<U, R>

where for<'r> P: FnMut(&'r Node<U>) -> bool,

pub fn next<U: Queryable>(&self) -> QueryResult<U, R>

pub fn next_all<U: Queryable>(&self) -> QueryResult<U, R>

pub fn next_until<U: Queryable, P>(&self, predicate: P) -> QueryResult<U, R>

where for<'r> P: FnMut(&'r Node<U>) -> bool,

pub fn siblings<U: Queryable>(&self) -> QueryResult<U, R>

pub fn eq(&self, index: isize) -> Option<Node<T>>

pub fn first(&self) -> Option<Node<T>>

pub fn last(&self) -> Option<Node<T>>

pub fn map<B, F>(&self, f: F) -> Vec<B>

where F: FnMut(Node<T>) -> B,

pub fn is<F>(&self, f: F) -> bool

where for<'r> F: FnMut(&'r Node<T>) -> bool,

pub fn has(&self) -> bool

pub fn not<P>(&self, predicate: P) -> QueryResult<T, R>

where for<'r> P: FnMut(&'r Node<T>) -> bool,

Trait Implementations

impl<T: Clone, R: Clone> Clone for QueryResult<T, R>

fn clone(&self) -> QueryResult<T, R>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, R: Debug> Debug for QueryResult<T, R>

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

Formats the value using the given formatter.

impl<T: Queryable, R: Queryable> Index<usize> for QueryResult<T, R>

type Output = Node<T>

The returned type after indexing.

fn index(&self, id: usize) -> &Node<T>

Performs the indexing (container[index]) operation.

impl<T: Queryable, R: Queryable> IntoIterator for QueryResult<T, R>

type Item = Node<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<Node<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.