Struct syn_query::QueryResult [−][src]
pub struct QueryResult<T, R> { /* fields omitted */ }
Methods
impl<T: Queryable, R: Queryable> QueryResult<T, R>
[src]
impl<T: Queryable, R: Queryable> QueryResult<T, R>
pub fn query<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn query<U: Queryable>(&self) -> QueryResult<U, R>
pub fn find<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn find<U: Queryable>(&self) -> QueryResult<U, R>
pub fn children<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn children<U: Queryable>(&self) -> QueryResult<U, R>
pub fn new(result: Vec<Node<T>>, root: R) -> QueryResult<T, R>
[src]
pub fn new(result: Vec<Node<T>>, root: R) -> QueryResult<T, R>
pub fn len(&self) -> usize
[src]
pub fn len(&self) -> usize
pub fn iter(&self) -> Iter<Node<T>>
[src]
pub fn iter(&self) -> Iter<Node<T>>
pub fn iter_mut(&mut self) -> IterMut<Node<T>>
[src]
pub fn iter_mut(&mut self) -> IterMut<Node<T>>
pub fn filter<P>(&self, predicate: P) -> QueryResult<T, R> where
P: FnMut(&'r Node<T>) -> bool,
[src]
pub fn filter<P>(&self, predicate: P) -> QueryResult<T, R> where
P: FnMut(&'r Node<T>) -> bool,
pub fn parents<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn parents<U: Queryable>(&self) -> QueryResult<U, R>
pub fn parent<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn parent<U: Queryable>(&self) -> QueryResult<U, R>
pub fn prev<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn prev<U: Queryable>(&self) -> QueryResult<U, R>
pub fn prev_all<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn prev_all<U: Queryable>(&self) -> QueryResult<U, R>
pub fn prev_until<U: Queryable, P>(&self, predicate: P) -> QueryResult<U, R> where
P: FnMut(&'r Node<U>) -> bool,
[src]
pub fn prev_until<U: Queryable, P>(&self, predicate: P) -> QueryResult<U, R> where
P: FnMut(&'r Node<U>) -> bool,
pub fn next<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn next<U: Queryable>(&self) -> QueryResult<U, R>
pub fn next_all<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn next_all<U: Queryable>(&self) -> QueryResult<U, R>
pub fn next_until<U: Queryable, P>(&self, predicate: P) -> QueryResult<U, R> where
P: FnMut(&'r Node<U>) -> bool,
[src]
pub fn next_until<U: Queryable, P>(&self, predicate: P) -> QueryResult<U, R> where
P: FnMut(&'r Node<U>) -> bool,
pub fn siblings<U: Queryable>(&self) -> QueryResult<U, R>
[src]
pub fn siblings<U: Queryable>(&self) -> QueryResult<U, R>
pub fn eq(&self, index: isize) -> Option<Node<T>>
[src]
pub fn eq(&self, index: isize) -> Option<Node<T>>
pub fn first(&self) -> Option<Node<T>>
[src]
pub fn first(&self) -> Option<Node<T>>
pub fn last(&self) -> Option<Node<T>>
[src]
pub fn last(&self) -> Option<Node<T>>
pub fn map<B, F>(&self, f: F) -> Vec<B> where
F: FnMut(Node<T>) -> B,
[src]
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
F: FnMut(&'r Node<T>) -> bool,
[src]
pub fn is<F>(&self, f: F) -> bool where
F: FnMut(&'r Node<T>) -> bool,
pub fn has(&self) -> bool
[src]
pub fn has(&self) -> bool
pub fn not<P>(&self, predicate: P) -> QueryResult<T, R> where
P: FnMut(&'r Node<T>) -> bool,
[src]
pub fn not<P>(&self, predicate: P) -> QueryResult<T, R> where
P: FnMut(&'r Node<T>) -> bool,
Trait Implementations
impl<T: Debug, R: Debug> Debug for QueryResult<T, R>
[src]
impl<T: Debug, R: Debug> Debug for QueryResult<T, R>
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl<T: Clone, R: Clone> Clone for QueryResult<T, R>
[src]
impl<T: Clone, R: Clone> Clone for QueryResult<T, R>
fn clone(&self) -> QueryResult<T, R>
[src]
fn clone(&self) -> QueryResult<T, R>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0
[src]Performs copy-assignment from source
. Read more
impl<T: Queryable, R: Queryable> OpsIndex<usize> for QueryResult<T, R>
[src]
impl<T: Queryable, R: Queryable> OpsIndex<usize> for QueryResult<T, R>
type Output = Node<T>
The returned type after indexing.
fn index(&self, id: usize) -> &Node<T>
[src]
fn index(&self, id: usize) -> &Node<T>
Performs the indexing (container[index]
) operation.
impl<T: Queryable, R: Queryable> IntoIterator for QueryResult<T, R>
[src]
impl<T: Queryable, R: Queryable> IntoIterator for QueryResult<T, R>
Auto Trait Implementations
impl<T, R> Send for QueryResult<T, R> where
R: Send,
T: Send,
impl<T, R> Send for QueryResult<T, R> where
R: Send,
T: Send,
impl<T, R> Sync for QueryResult<T, R> where
R: Sync,
T: Sync,
impl<T, R> Sync for QueryResult<T, R> where
R: Sync,
T: Sync,