pub struct Or<L: Language, P1: Matcher<L>, P2: Matcher<L>> { /* private fields */ }
Trait Implementations§
Source§impl<L, P1, P2> Matcher<L> for Or<L, P1, P2>
impl<L, P1, P2> Matcher<L> for Or<L, P1, P2>
Source§fn match_node_with_env<'tree, D: Doc<Lang = L>>(
&self,
node: Node<'tree, D>,
env: &mut Cow<'_, MetaVarEnv<'tree, D>>,
) -> Option<Node<'tree, D>>
fn match_node_with_env<'tree, D: Doc<Lang = L>>( &self, node: Node<'tree, D>, env: &mut Cow<'_, MetaVarEnv<'tree, D>>, ) -> Option<Node<'tree, D>>
Returns the node why the input is matched or None if not matched.
The return value is usually input node itself, but it can be different node.
For example
Has
matcher can return the child or descendant node.Source§fn potential_kinds(&self) -> Option<BitSet>
fn potential_kinds(&self) -> Option<BitSet>
Returns a bitset for all possible target node kind ids.
Returns None if the matcher needs to try against all node kind.
Source§fn get_match_len<D: Doc<Lang = L>>(&self, _node: Node<'_, D>) -> Option<usize>
fn get_match_len<D: Doc<Lang = L>>(&self, _node: Node<'_, D>) -> Option<usize>
get_match_len will skip trailing anonymous child node to exclude punctuation.
fn match_node<'tree, D: Doc<Lang = L>>( &self, node: Node<'tree, D>, ) -> Option<NodeMatch<'tree, D>>
fn find_node<'tree, D: Doc<Lang = L>>( &self, node: Node<'tree, D>, ) -> Option<NodeMatch<'tree, D>>
Auto Trait Implementations§
impl<L, P1, P2> Freeze for Or<L, P1, P2>
impl<L, P1, P2> RefUnwindSafe for Or<L, P1, P2>
impl<L, P1, P2> Send for Or<L, P1, P2>
impl<L, P1, P2> Sync for Or<L, P1, P2>
impl<L, P1, P2> Unpin for Or<L, P1, P2>
impl<L, P1, P2> UnwindSafe for Or<L, P1, P2>
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