QueryCursor

Struct QueryCursor 

Source
#[repr(transparent)]
pub struct QueryCursor(pub QueryCursor);
Expand description

Wraps tree-sitter’s QueryCursor where matches and captures are always typed.

Tuple Fields§

§0: QueryCursor

Implementations§

Source§

impl QueryCursor

Source

pub fn new() -> Self

Create a new cursor for executing a given query.

The cursor stores the state that is needed to iteratively search for matches.

Source

pub fn match_limit(&self) -> u16

Return the maximum number of in-progress matches for this cursor.

Source

pub fn set_match_limit(&mut self, limit: u16)

Set the maximum number of in-progress matches for this cursor.

Source

pub fn did_exceed_match_limit(&self) -> bool

Check if, on its last execution, this cursor exceeded its maximum number of in-progress matches.

Source

pub fn set_byte_range(&mut self, range: Range<usize>) -> &mut Self

Set the range in which the query will be executed, in terms of byte offsets.

Like tree-sitter’s QueryCursor::set_byte_range, returns self for convenience (builder pattern).

Source

pub fn set_point_range(&mut self, range: Range<Point>) -> &mut Self

Set the range in which the query will be executed, in terms of rows and columns.

Like tree-sitter’s QueryCursor::set_point_range, returns self for convenience (builder pattern).

Source

pub fn matches<'query, 'cursor: 'query, 'tree, Query: Query, Text: TextProvider<I> + 'query, I: AsRef<[u8]>>( &'cursor mut self, query: &'query Query, node: impl Node<'tree>, text: Text, ) -> QueryMatches<'query, 'tree, Query, Text, I>

Run a typed query on the cursor, iterating over the matches in order they are found.

Each match contains the index of the pattern that matched, and a list of captures. Because multiple patterns can match the same set of nodes, one match may contain captures that appear before some of the captures from a previous match.

Source

pub fn captures<'query, 'cursor: 'query, 'tree, Query: Query, Text: TextProvider<I> + 'query, I: AsRef<[u8]>>( &'cursor mut self, query: &'query Query, node: impl Node<'tree>, text: Text, ) -> QueryCaptures<'query, 'tree, Query, Text, I>

Run a typed query on the cursor, iterating over the captures in order they appear.

This is useful if you don’t care about which pattern matched, and just want a single, ordered sequence of captures.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.