mirror of
https://github.com/Myriad-Dreamin/tinymist.git
synced 2025-08-03 17:58:17 +00:00
chore: Fix typos throughout code base (automatic)
This is all the typos that `typos` is confident can just be fixed automatically, minus the overrides added to the manifest for the false positives I found.
This commit is contained in:
parent
3eee445dab
commit
6f4aba4aa8
28 changed files with 55 additions and 55 deletions
|
@ -216,7 +216,7 @@ Euclid2:
|
|||
}
|
||||
|
||||
#[test]
|
||||
fn yaml_bib_imcomplete() {
|
||||
fn yaml_bib_incomplete() {
|
||||
let content = r#"
|
||||
Euclid:
|
||||
type: article
|
||||
|
|
|
@ -601,7 +601,7 @@ impl SharedContext {
|
|||
}
|
||||
|
||||
/// Get the real definition of a compilation.
|
||||
/// Note: must be called after compliation.
|
||||
/// Note: must be called after compilation.
|
||||
pub(crate) fn dependencies(&self) -> EcoVec<reflexo::ImmutPath> {
|
||||
let mut v = EcoVec::new();
|
||||
self.world.iter_dependencies(&mut |p| {
|
||||
|
|
|
@ -227,7 +227,7 @@ impl<'a> CodeActionWorker<'a> {
|
|||
.ctx
|
||||
.to_lsp_range(body_range.end..last_dollar.range().start, &self.current);
|
||||
|
||||
// Retrive punctuation to move
|
||||
// Retrieve punctuation to move
|
||||
let mark_after_equation = self
|
||||
.current
|
||||
.text()
|
||||
|
|
|
@ -97,7 +97,7 @@ pub fn list_package_by_namespace(
|
|||
}
|
||||
// namespace/package_name/version
|
||||
// 2. package_name
|
||||
let Some(package_names) = once_log(std::fs::read_dir(local_path), "read local pacakge")
|
||||
let Some(package_names) = once_log(std::fs::read_dir(local_path), "read local package")
|
||||
else {
|
||||
continue;
|
||||
};
|
||||
|
|
|
@ -489,11 +489,11 @@ impl<'a> ExprWorker<'a> {
|
|||
Decl::spread(s.span()).into()
|
||||
};
|
||||
|
||||
let spreaded = Pattern::Expr(this.check(s.expr())).into();
|
||||
let spread = Pattern::Expr(this.check(s.expr())).into();
|
||||
if inputs.is_empty() {
|
||||
spread_left = Some((decl.clone(), spreaded));
|
||||
spread_left = Some((decl.clone(), spread));
|
||||
} else {
|
||||
spread_right = Some((decl.clone(), spreaded));
|
||||
spread_right = Some((decl.clone(), spread));
|
||||
}
|
||||
|
||||
this.resolve_as(Decl::as_def(&decl, None));
|
||||
|
|
|
@ -58,7 +58,7 @@ impl<'a> DecenderItem<'a> {
|
|||
}
|
||||
|
||||
/// Find the decender nodes starting from the given position.
|
||||
pub fn node_decenders<T>(
|
||||
pub fn node_descenders<T>(
|
||||
node: LinkedNode,
|
||||
mut recv: impl FnMut(DecenderItem) -> Option<T>,
|
||||
) -> Option<T> {
|
||||
|
@ -99,7 +99,7 @@ pub fn descending_decls<T>(
|
|||
node: LinkedNode,
|
||||
mut recv: impl FnMut(DescentDecl) -> Option<T>,
|
||||
) -> Option<T> {
|
||||
node_decenders(node, |node| {
|
||||
node_descenders(node, |node| {
|
||||
match (&node, node.node().cast::<ast::Expr>()?) {
|
||||
(DecenderItem::Sibling(..), ast::Expr::Let(lb)) => {
|
||||
for ident in lb.kind().bindings() {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue