Improve leniency towards fixing spelling mistakes

Author: RedCMD

src/DiagnosticCollection.ts

@@ -2,7 +2,7 @@ import * as vscode from 'vscode';
 import * as vscodeOniguruma from 'vscode-oniguruma';
 import { Node, QueryCapture } from 'web-tree-sitter';
 import { getLastNode, getTrees, parseEvents, queryNode, toRange, trees } from "./TreeSitter";
-import { DocumentSelector, getPackageJSON, stringify, wagnerFischer } from "./extension";
+import { closeEnoughQuestionMark, DocumentSelector, getPackageJSON, stringify, wagnerFischer } from "./extension";
 import { unicodeproperties } from "./UNICODE_PROPERTIES";
 
 
@@ -424,8 +424,8 @@ function diagnosticsBrokenIncludes(diagnostics: vscode.Diagnostic[], rootNode: N
 		const distances = wagnerFischer(text, repoItems);
 		const distance = distances[0].distance;
 
-		let message = `Cannot find repo '${text}'`;
-		if (distance < 3) {
+		let message = `Cannot find repo name '${text}'`;
+		if (closeEnoughQuestionMark(distance, text)) {
 			message += `. Did you mean '${distances[0].string}'?`;
 		}
 		else {

src/Providers/CodeActionsProvider.ts

@@ -2,7 +2,7 @@ import * as vscode from 'vscode';
 import { Node, Tree } from 'web-tree-sitter';
 import { getTrees, queryNode, toRange, trees } from "../TreeSitter";
 import { unicodeproperties, UNICODE_PROPERTIES } from "../UNICODE_PROPERTIES";
-import { stringify, wagnerFischer } from "../extension";
+import { closeEnoughQuestionMark, stringify, wagnerFischer } from "../extension";
 
 export const metadata: vscode.CodeActionProviderMetadata = {
 	providedCodeActionKinds: [
@@ -82,7 +82,7 @@ export const CodeActionsProvider: vscode.CodeActionProvider = {
 					const distances = wagnerFischer(property, unicodeproperties);
 					// vscode.window.showInformationMessage(JSON.stringify(distances));
 					const distance = distances[0].distance;
-					if (distance > 2) {
+					if (!closeEnoughQuestionMark(distance, property)) {
 						continue;
 					}
 

src/extension.ts

@@ -107,8 +107,22 @@ export function stringify(this: any, key: string, value: any) {
 	return value;
 }
 
-export function wagnerFischer(word: string, directory: string[]): { distance: number, index: number, string: string; }[] {
-	const distances: { distance: number, index: number, string: string; }[] = [];
+
+export function closeEnoughQuestionMark(distance: number, text: string): boolean {
+	return distance < 1.5 * Math.sqrt(text.length); // more lenient for longer words
+}
+
+type wagnerFischerResult = {
+	distance: number,
+	index: number,
+	string: string | string[],
+};
+/** Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters */
+export function wagnerFischer(word: string, directory: string[]): { distance: number, index: number, string: string; }[];
+/** Interestingly this also works with arrays of strings */
+export function wagnerFischer(words: string[], directorys: string[][]): { distance: number, index: number, string: string[]; }[];
+export function wagnerFischer(word: string | string[], directory: string[] | string[][]): wagnerFischerResult[] {
+	const distances: wagnerFischerResult[] = [];
 	let index = 0;
 
 	for (const targetWord of directory) {
@@ -137,7 +151,12 @@ export function wagnerFischer(word: string, directory: string[]): { distance: nu
 			prev = next;
 		}
 
-		const distance = { 'distance': prev[targetWord.length], index: index, string: targetWord };
+		const distance = {
+			distance: prev[targetWord.length],
+			index: index,
+			string: targetWord,
+			prev: prev,
+		};
 		distances.push(distance);
 
 		index++;