Struct Op

Source
pub struct Op<M: Matcher> { /* private fields */ }

Implementations§

Source§

impl<M: Matcher> Op<M>

Source

pub fn not(pattern: M) -> Not<M>

Source§

impl<M: Matcher> Op<M>

Source

pub fn every(pattern: M) -> Op<And<M, MatchAll>>

Source

pub fn either(pattern: M) -> Op<Or<M, MatchNone>>

Source

pub fn all<MS: IntoIterator<Item = M>>(patterns: MS) -> All<M>

Source

pub fn any<MS: IntoIterator<Item = M>>(patterns: MS) -> Any<M>

Source

pub fn new(matcher: M) -> Op<M>

Source§

impl<M: Matcher, N: Matcher> Op<And<M, N>>

Source

pub fn and<O: Matcher>(self, other: O) -> Op<And<And<M, N>, O>>

Source§

impl<M: Matcher, N: Matcher> Op<Or<M, N>>

Source

pub fn or<O: Matcher>(self, other: O) -> Op<Or<Or<M, N>, O>>

Trait Implementations§

Source§

impl<M: Clone + Matcher> Clone for Op<M>

Source§

fn clone(&self) -> Op<M>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<M> Matcher for Op<M>
where M: Matcher,

Source§

fn match_node_with_env<'tree, D: Doc>( &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>

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>(&self, _node: Node<'_, D>) -> Option<usize>

get_match_len will skip trailing anonymous child node to exclude punctuation.

Auto Trait Implementations§

§

impl<M> Freeze for Op<M>
where M: Freeze,

§

impl<M> RefUnwindSafe for Op<M>
where M: RefUnwindSafe,

§

impl<M> Send for Op<M>
where M: Send,

§

impl<M> Sync for Op<M>
where M: Sync,

§

impl<M> Unpin for Op<M>
where M: Unpin,

§

impl<M> UnwindSafe for Op<M>
where M: UnwindSafe,

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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> MatcherExt for T
where T: Matcher,

Source§

fn match_node<'tree, D: Doc>( &self, node: Node<'tree, D>, ) -> Option<NodeMatch<'tree, D>>

Source§

fn find_node<'tree, D: Doc>( &self, node: Node<'tree, D>, ) -> Option<NodeMatch<'tree, D>>

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.