Struct yak_sitter::QueryMatches
source · pub struct QueryMatches<'query, 'tree: 'query, Custom = ()> { /* private fields */ }
Expand description
Wrapper around tree_sitter::QueryMatches
tree_sitter::QueryMatches is NOT a real iterator, it’s a StreamingIterator (see https://github.com/tree-sitter/tree-sitter/issues/608). Therefore this doesn’t implement Iterator
Implementations§
source§impl<'query, 'tree: 'query, Custom> QueryMatches<'query, 'tree, Custom>
impl<'query, 'tree: 'query, Custom> QueryMatches<'query, 'tree, Custom>
sourcepub fn as_inner(
&self
) -> &QueryMatches<'query, 'tree, &'query Tree<Custom>, &'query str>
pub fn as_inner( &self ) -> &QueryMatches<'query, 'tree, &'query Tree<Custom>, &'query str>
Get the underlying tree_sitter::QueryMatches
sourcepub fn as_inner_mut(
&mut self
) -> &mut QueryMatches<'query, 'tree, &'query Tree<Custom>, &'query str>
pub fn as_inner_mut( &mut self ) -> &mut QueryMatches<'query, 'tree, &'query Tree<Custom>, &'query str>
Get the underlying tree_sitter::QueryMatches
sourcepub fn into_inner(
self
) -> (QueryMatches<'query, 'tree, &'query Tree<Custom>, &'query str>, &'query Query, &'tree Tree<Custom>)
pub fn into_inner( self ) -> (QueryMatches<'query, 'tree, &'query Tree<Custom>, &'query str>, &'query Query, &'tree Tree<Custom>)
Destruct into the underlying tree_sitter::QueryMatches, query, and tree
Trait Implementations§
source§impl<'query, 'tree: 'query, Custom> StreamingIterator for QueryMatches<'query, 'tree, Custom>
impl<'query, 'tree: 'query, Custom> StreamingIterator for QueryMatches<'query, 'tree, Custom>
§type Item = QueryMatch<'query, 'tree, Custom>
type Item = QueryMatch<'query, 'tree, Custom>
The type of the elements being iterated over.
source§fn get(&self) -> Option<&Self::Item>
fn get(&self) -> Option<&Self::Item>
Returns a reference to the current element of the iterator. Read more
source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator.
source§fn next(&mut self) -> Option<&Self::Item>
fn next(&mut self) -> Option<&Self::Item>
Advances the iterator and returns the next value. Read more
source§fn all<F>(&mut self, f: F) -> bool
fn all<F>(&mut self, f: F) -> bool
Determines if all elements of the iterator satisfy a predicate.
source§fn any<F>(&mut self, f: F) -> bool
fn any<F>(&mut self, f: F) -> bool
Determines if any elements of the iterator satisfy a predicate.
source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
Borrows an iterator, rather than consuming it. Read more
source§fn chain<I>(self, other: I) -> Chain<Self, I>
fn chain<I>(self, other: I) -> Chain<Self, I>
Consumes two iterators and returns a new iterator that iterates over both in sequence.
source§fn count(self) -> usizewhere
Self: Sized,
fn count(self) -> usizewhere
Self: Sized,
Consumes the iterator, counting the number of remaining elements and returning it.
source§fn filter<F>(self, f: F) -> Filter<Self, F>
fn filter<F>(self, f: F) -> Filter<Self, F>
Creates an iterator which uses a closure to determine if an element should be yielded.
source§fn filter_map<B, F>(self, f: F) -> FilterMap<Self, B, F>
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, B, F>
Creates an iterator which both filters and maps by applying a closure to elements.
source§fn flat_map<J, F>(self, f: F) -> FlatMap<Self, J, F>
fn flat_map<J, F>(self, f: F) -> FlatMap<Self, J, F>
Creates an iterator which flattens iterators obtained by applying a closure to elements.
Note that the returned iterators must be streaming iterators.
source§fn filter_map_deref<B, F>(self, f: F) -> FilterMapDeref<Self, F>
fn filter_map_deref<B, F>(self, f: F) -> FilterMapDeref<Self, F>
Creates a regular, non-streaming iterator which both filters and maps by applying a closure to elements.
source§fn find<F>(&mut self, f: F) -> Option<&Self::Item>
fn find<F>(&mut self, f: F) -> Option<&Self::Item>
Returns the first element of the iterator that satisfies the predicate.
source§fn fuse(self) -> Fuse<Self>where
Self: Sized,
fn fuse(self) -> Fuse<Self>where
Self: Sized,
Creates an iterator which is “well behaved” at the beginning and end of iteration. Read more
source§fn inspect<F>(self, f: F) -> Inspect<Self, F>
fn inspect<F>(self, f: F) -> Inspect<Self, F>
Call a closure on each element, passing the element on.
The closure is called upon calls to
advance
or advance_back
, and exactly once per element
regardless of how many times (if any) get
is called.source§fn map<B, F>(self, f: F) -> Map<Self, B, F>
fn map<B, F>(self, f: F) -> Map<Self, B, F>
Creates an iterator which transforms elements of this iterator by passing them to a closure.
source§fn map_deref<B, F>(self, f: F) -> MapDeref<Self, F>
fn map_deref<B, F>(self, f: F) -> MapDeref<Self, F>
Creates a regular, non-streaming iterator which transforms elements of this iterator by passing them to a closure.
source§fn map_ref<B, F>(self, f: F) -> MapRef<Self, F>
fn map_ref<B, F>(self, f: F) -> MapRef<Self, F>
Creates an iterator which transforms elements of this iterator by passing them to a closure. Read more
source§fn nth(&mut self, n: usize) -> Option<&Self::Item>
fn nth(&mut self, n: usize) -> Option<&Self::Item>
Consumes the first
n
elements of the iterator, returning the next one.source§fn position<F>(&mut self, f: F) -> Option<usize>
fn position<F>(&mut self, f: F) -> Option<usize>
Returns the index of the first element of the iterator matching a predicate.
source§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
Creates an iterator which skips the first
n
elements.source§fn skip_while<F>(self, f: F) -> SkipWhile<Self, F>
fn skip_while<F>(self, f: F) -> SkipWhile<Self, F>
Creates an iterator that skips initial elements matching a predicate.
source§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
Creates an iterator which only returns the first
n
elements.source§fn take_while<F>(self, f: F) -> TakeWhile<Self, F>
fn take_while<F>(self, f: F) -> TakeWhile<Self, F>
Creates an iterator which only returns initial elements matching a predicate.
source§impl<'query, 'tree: 'query, Custom> StreamingIteratorMut for QueryMatches<'query, 'tree, Custom>
impl<'query, 'tree: 'query, Custom> StreamingIteratorMut for QueryMatches<'query, 'tree, Custom>
source§fn get_mut(&mut self) -> Option<&mut Self::Item>
fn get_mut(&mut self) -> Option<&mut Self::Item>
Returns a mutable reference to the current element of the iterator. Read more
source§fn next_mut(&mut self) -> Option<&mut Self::Item>
fn next_mut(&mut self) -> Option<&mut Self::Item>
Advances the iterator and returns the next mutable value. Read more
source§fn fold_mut<B, F>(self, init: B, f: F) -> B
fn fold_mut<B, F>(self, init: B, f: F) -> B
Reduces the iterator’s mutable elements to a single, final value.
source§fn for_each_mut<F>(self, f: F)
fn for_each_mut<F>(self, f: F)
Calls a closure on each mutable element of an iterator.
source§fn map_deref_mut<B, F>(self, f: F) -> MapDerefMut<Self, F>
fn map_deref_mut<B, F>(self, f: F) -> MapDerefMut<Self, F>
Creates a regular, non-streaming iterator which transforms mutable elements
of this iterator by passing them to a closure.
Auto Trait Implementations§
impl<'query, 'tree, Custom> Freeze for QueryMatches<'query, 'tree, Custom>
impl<'query, 'tree, Custom> RefUnwindSafe for QueryMatches<'query, 'tree, Custom>where
Custom: RefUnwindSafe,
impl<'query, 'tree, Custom = ()> !Send for QueryMatches<'query, 'tree, Custom>
impl<'query, 'tree, Custom = ()> !Sync for QueryMatches<'query, 'tree, Custom>
impl<'query, 'tree, Custom> Unpin for QueryMatches<'query, 'tree, Custom>
impl<'query, 'tree, Custom> UnwindSafe for QueryMatches<'query, 'tree, Custom>where
Custom: RefUnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more