Removed dependency on unused package "leven". No functional change.

Author: erictraut

packages/pyright-internal/package-lock.json

@@ -25,7 +25,6 @@
         "chokidar": "^3.6.0",
         "command-line-args": "^5.2.1",
         "jsonc-parser": "^3.3.1",
-        "leven": "3.1.0",
         "smol-toml": "^1.3.1",
         "source-map-support": "^0.5.21",
         "tmp": "^0.2.3",

packages/pyright-internal/package.json

@@ -7,53 +7,8 @@
  * Utility methods for manipulating and comparing strings.
  */
 
-import leven from 'leven';
-
 import { compareComparableValues, Comparison } from './core';
 
-// Determines how closely a typed string matches a symbol
-// name. An exact match returns 1. A match that differs
-// only in case returns a slightly lower number. A match
-// that involves a few missing or added characters returns
-// an even lower number.
-export function computeCompletionSimilarity(typedValue: string, symbolName: string): number {
-    if (symbolName.startsWith(typedValue)) {
-        return 1;
-    }
-
-    const symbolLower = symbolName.toLocaleLowerCase();
-    const typedLower = typedValue.toLocaleLowerCase();
-
-    if (symbolLower.startsWith(typedLower)) {
-        return 0.75;
-    }
-
-    // How far apart are the two strings? Find the smallest edit
-    // distance for each of the substrings taken from the start of
-    // symbolName.
-    let symbolSubstrLength = symbolLower.length;
-    let smallestEditDistance = Number.MAX_VALUE;
-    while (symbolSubstrLength > 0) {
-        const editDistance = leven(symbolLower.substr(0, symbolSubstrLength), typedLower);
-        if (editDistance < smallestEditDistance) {
-            smallestEditDistance = editDistance;
-        }
-        symbolSubstrLength--;
-    }
-
-    // We'll take into account the length of the typed value. If the user
-    // has typed more characters, and they largely match the symbol name,
-    // it is considered more similar. If the the edit distance is similar
-    // to the number of characters the user has typed, then there's almost
-    // no similarity.
-    if (smallestEditDistance >= typedValue.length) {
-        return 0;
-    }
-
-    const similarity = (typedValue.length - smallestEditDistance) / typedValue.length;
-    return 0.5 * similarity;
-}
-
 // Determines if typed string matches a symbol
 // name. Characters must appear in order.
 // Return true if all typed characters are in symbol

packages/pyright-internal/src/common/stringUtils.ts

@@ -9,22 +9,6 @@ import * as assert from 'assert';
 import * as core from '../common/core';
 import * as utils from '../common/stringUtils';
 
-test('stringUtils computeCompletionSimilarity', () => {
-    assert.equal(utils.computeCompletionSimilarity('', 'abcd'), 1);
-
-    assert.equal(utils.computeCompletionSimilarity('abcd', 'abcd'), 1);
-    assert.equal(utils.computeCompletionSimilarity('abc', 'abcd'), 1);
-
-    assert.equal(utils.computeCompletionSimilarity('ABCD', 'abcd'), 0.75);
-    assert.equal(utils.computeCompletionSimilarity('ABC', 'abcd'), 0.75);
-
-    assert.equal(utils.computeCompletionSimilarity('abce', 'abcd'), 0.375);
-    assert.equal(utils.computeCompletionSimilarity('abcde', 'abcd'), 0.4);
-    assert.equal(utils.computeCompletionSimilarity('azcde', 'abcd'), 0.3);
-    assert.equal(utils.computeCompletionSimilarity('acde', 'abcd'), 0.25);
-    assert.equal(utils.computeCompletionSimilarity('zbcd', 'abcd'), 0.375);
-});
-
 test('stringUtils isPatternInSymbol', () => {
     assert.equal(utils.isPatternInSymbol('', 'abcd'), true);