pub struct RuleCore {
pub fixer: Vec<Fixer>,
/* private fields */
}Fields§
§fixer: Vec<Fixer>Implementations§
Source§impl RuleCore
impl RuleCore
pub fn new(rule: Rule) -> Self
pub fn with_matchers(self, constraints: HashMap<String, Rule>) -> Self
pub fn with_registration(self, registration: RuleRegistration) -> Self
pub fn with_transform(self, transform: Option<Transform>) -> Self
pub fn with_fixer(self, fixer: Vec<Fixer>) -> Self
pub fn get_env<L: Language>(&self, lang: L) -> DeserializeEnv<L>
pub fn defined_vars(&self) -> HashSet<&str>
Methods from Deref<Target = Rule>§
pub fn defined_vars(&self) -> HashSet<&str>
Sourcepub fn verify_util(&self) -> Result<(), RuleSerializeError>
pub fn verify_util(&self) -> Result<(), RuleSerializeError>
check if util rules used are defined
Trait Implementations§
Source§impl Matcher for RuleCore
impl Matcher for RuleCore
Source§fn match_node_with_env<'tree, D: Doc>(
&self,
node: Node<'tree, D>,
env: &mut Cow<'_, MetaVarEnv<'tree, D>>,
) -> Option<Node<'tree, D>>
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>
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.
Auto Trait Implementations§
impl Freeze for RuleCore
impl RefUnwindSafe for RuleCore
impl Send for RuleCore
impl Sync for RuleCore
impl Unpin for RuleCore
impl UnwindSafe for RuleCore
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