fix: obvious typo

Author: alexzhang1030

crates/cli/src/lang/alias_lang.rs

@@ -143,7 +143,7 @@ impl FromStr for AliasLang {
         });
       }
     }
-    Err(format!("unknow language `{name}`."))
+    Err(format!("unknown language `{name}`."))
   }
 }
 

crates/cli/src/run.rs

@@ -119,7 +119,7 @@ pub fn run_with_pattern(arg: RunArg) -> Result<()> {
   let printer = ColoredPrinter::stdout(arg.output.color)
     .heading(arg.heading)
     .context(context);
-  let interactive = arg.output.needs_interacive();
+  let interactive = arg.output.needs_interactive();
   if interactive {
     let from_stdin = arg.input.is_stdin();
     let printer = InteractivePrinter::new(printer, arg.output.update_all, from_stdin)?;

crates/cli/src/scan.rs

@@ -68,7 +68,7 @@ pub fn run_with_config(arg: ScanArg) -> Result<()> {
     return run_scan(arg, printer);
   }
   let printer = ColoredPrinter::stdout(arg.output.color).style(arg.report_style);
-  let interactive = arg.output.needs_interacive();
+  let interactive = arg.output.needs_interactive();
   if interactive {
     let from_stdin = arg.input.is_stdin();
     let printer = InteractivePrinter::new(printer, arg.output.update_all, from_stdin)?;
@@ -136,7 +136,7 @@ impl<P: Printer + Sync> Worker for ScanWithConfig<P> {
       let path = &path;
       let rules = self.configs.for_path(path);
       let combined = CombinedScan::new(rules);
-      let interactive = self.arg.output.needs_interacive();
+      let interactive = self.arg.output.needs_interactive();
       if interactive {
         let diffs = combined
           .diffs(&grep, hit_set.clone())

crates/cli/src/utils.rs

@@ -324,7 +324,7 @@ pub struct OutputArgs {
 
 impl OutputArgs {
   // either explicit interactive or implicit update_all
-  pub fn needs_interacive(&self) -> bool {
+  pub fn needs_interactive(&self) -> bool {
     self.interactive || self.update_all
   }
 }

crates/config/src/deserialize_env.rs

@@ -16,12 +16,12 @@ pub struct DeserializeEnv<L: Language> {
   pub(crate) lang: L,
 }
 
-trait DepedentRule: Sized {
+trait DependentRule: Sized {
   fn visit_dependent_rules<'a>(&'a self, sorter: &mut TopologicalSort<'a, Self>)
     -> OrderResult<()>;
 }
 
-impl DepedentRule for SerializableRule {
+impl DependentRule for SerializableRule {
   fn visit_dependent_rules<'a>(
     &'a self,
     sorter: &mut TopologicalSort<'a, Self>,
@@ -30,7 +30,7 @@ impl DepedentRule for SerializableRule {
   }
 }
 
-impl<L: Language> DepedentRule for SerializableRuleCore<L> {
+impl<L: Language> DependentRule for SerializableRuleCore<L> {
   fn visit_dependent_rules<'a>(
     &'a self,
     sorter: &mut TopologicalSort<'a, Self>,
@@ -39,14 +39,14 @@ impl<L: Language> DepedentRule for SerializableRuleCore<L> {
   }
 }
 
-struct TopologicalSort<'a, T: DepedentRule> {
+struct TopologicalSort<'a, T: DependentRule> {
   utils: &'a HashMap<String, T>,
   order: Vec<&'a String>,
   // bool stands for if the rule has completed visit
   seen: HashMap<&'a String, bool>,
 }
 
-impl<'a, T: DepedentRule> TopologicalSort<'a, T> {
+impl<'a, T: DependentRule> TopologicalSort<'a, T> {
   fn get_order(utils: &HashMap<String, T>) -> OrderResult<Vec<&String>> {
     let mut top_sort = TopologicalSort::new(utils);
     for rule_id in utils.keys() {
@@ -89,7 +89,7 @@ impl<'a, T: DepedentRule> TopologicalSort<'a, T> {
   }
 }
 
-fn visit_dependent_rule_ids<'a, T: DepedentRule>(
+fn visit_dependent_rule_ids<'a, T: DependentRule>(
   rule: &'a SerializableRule,
   sort: &mut TopologicalSort<'a, T>,
 ) -> OrderResult<()> {

crates/core/src/node.rs

@@ -176,7 +176,7 @@ impl<'r, D: Doc> Node<'r, D> {
     source.get_text(&self.inner)
   }
 
-  /// Node's tree structure dumped in Lisp like S-experssion
+  /// Node's tree structure dumped in Lisp like S-expression
   pub fn to_sexp(&self) -> Cow<'_, str> {
     self.inner.to_sexp()
   }

crates/core/src/ops.rs

@@ -29,7 +29,7 @@ where
   fn potential_kinds(&self) -> Option<BitSet> {
     let set1 = self.pattern1.potential_kinds();
     let set2 = self.pattern2.potential_kinds();
-    // if both constituent have Some(bitset), intesect them
+    // if both constituent have Some(bitset), intersect them
     // otherwise returns either of the non-null set
     match (&set1, &set2) {
       (Some(s1), Some(s2)) => Some(s1.intersection(s2).collect()),
@@ -38,7 +38,7 @@ where
   }
 }
 
-// we precompute and cache potential_kinds. So patterns should not be mutated.
+// we pre-compute and cache potential_kinds. So patterns should not be mutated.
 // Box<[P]> is used here for immutability so that kinds will never be invalidated.
 pub struct All<L: Language, P: Matcher<L>> {
   patterns: Box<[P]>,

crates/napi/src/lib.rs

@@ -72,7 +72,7 @@ macro_rules! impl_lang_mod {
         }
 
         /// Parse a string to an ast-grep instance asynchronously in threads.
-        /// It utlizes multiple CPU cores when **concurrent processing sources**.
+        /// It utilize multiple CPU cores when **concurrent processing sources**.
         /// However, spawning excessive many threads may backfire.
         /// Please refer to libuv doc, nodejs' underlying runtime
         /// for its default behavior and performance tuning tricks.

schemas/project.json

@@ -44,7 +44,7 @@
         },
         "snapshotDir": {
           "type": "string",
-          "description": "A string path relative to testDir that specifies where to store test snapshots for ast-grep. You can think it like __snapshots___ in popular test framework like jest. If this option is not specified, ast-grep will store the snapshot under the __snapshots__ folder undert the testDir."
+          "description": "A string path relative to testDir that specifies where to store test snapshots for ast-grep. You can think it like __snapshots___ in popular test framework like jest. If this option is not specified, ast-grep will store the snapshot under the __snapshots__ folder under the testDir."
         }
       },
       "required": ["testDir"],