Struct ast_grep_config::SerializableRule

source ·
pub struct SerializableRule {
    pub pattern: Maybe<PatternStyle>,
    pub kind: Maybe<String>,
    pub regex: Maybe<String>,
    pub inside: Maybe<Box<Relation>>,
    pub has: Maybe<Box<Relation>>,
    pub precedes: Maybe<Box<Relation>>,
    pub follows: Maybe<Box<Relation>>,
    pub all: Maybe<Vec<SerializableRule>>,
    pub any: Maybe<Vec<SerializableRule>>,
    pub not: Maybe<Box<SerializableRule>>,
    pub matches: Maybe<String>,
}
Expand description

A rule object to find matching AST nodes. We have three categories of rules in ast-grep.

  • Atomic: the most basic rule to match AST. We have two variants: Pattern and Kind.

  • Relational: filter matched target according to their position relative to other nodes.

  • Composite: use logic operation all/any/not to compose the above rules to larger rules.

Every rule has it’s unique name so we can combine several rules in one object.

Fields§

§pattern: Maybe<PatternStyle>

A pattern string or a pattern object.

§kind: Maybe<String>

The kind name of the node to match. You can look up code’s kind names in playground.

§regex: Maybe<String>

A Rust regular expression to match the node’s text. https://docs.rs/regex/latest/regex/#syntax

§inside: Maybe<Box<Relation>>

inside accepts a relational rule object. the target node must appear inside of another node matching the inside sub-rule.

§has: Maybe<Box<Relation>>

has accepts a relational rule object. the target node must has a descendant node matching the has sub-rule.

§precedes: Maybe<Box<Relation>>

precedes accepts a relational rule object. the target node must appear before another node matching the precedes sub-rule.

§follows: Maybe<Box<Relation>>

follows accepts a relational rule object. the target node must appear after another node matching the follows sub-rule.

§all: Maybe<Vec<SerializableRule>>

A list of sub rules and matches a node if all of sub rules match. The meta variables of the matched node contain all variables from the sub-rules.

§any: Maybe<Vec<SerializableRule>>

A list of sub rules and matches a node if any of sub rules match. The meta variables of the matched node only contain those of the matched sub-rule.

§not: Maybe<Box<SerializableRule>>

A single sub-rule and matches a node if the sub rule does not match.

§matches: Maybe<String>

A utility rule id and matches a node if the utility rule matches.

Implementations§

source§

impl SerializableRule

source

pub fn categorized(self) -> Categorized

Trait Implementations§

source§

impl Clone for SerializableRule

source§

fn clone(&self) -> SerializableRule

Returns a copy 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 Default for SerializableRule

source§

fn default() -> SerializableRule

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for SerializableRule

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl JsonSchema for SerializableRule

source§

fn schema_name() -> String

The name of the generated JSON Schema. Read more
source§

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type. Read more
source§

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type. Read more
source§

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword. Read more
source§

impl Serialize for SerializableRule

source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more

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

source§

fn __clone_box(&self, _: Private) -> *mut ()

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

§

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>,

§

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>,

§

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.
source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,