|
12 | 12 |
|
13 | 13 | def levenshtein_distance(a, b): |
14 | 14 | m, n = len(a), len(b) |
15 | | - dp = [[0]*(n+1) for _ in range(m+1)] |
16 | | - for i in range(m+1): dp[i][0] = i |
17 | | - for j in range(n+1): dp[0][j] = j |
18 | | - for i in range(1, m+1): |
19 | | - for j in range(1, n+1): |
20 | | - cost = 0 if a[i-1] == b[j-1] else 1 |
21 | | - dp[i][j] = min(dp[i-1][j]+1, |
22 | | - dp[i][j-1]+1, |
23 | | - dp[i-1][j-1]+cost) |
| 15 | + dp = [[0] * (n + 1) for _ in range(m + 1)] |
| 16 | + for i in range(m + 1): |
| 17 | + dp[i][0] = i |
| 18 | + for j in range(n + 1): |
| 19 | + dp[0][j] = j |
| 20 | + for i in range(1, m + 1): |
| 21 | + for j in range(1, n + 1): |
| 22 | + cost = 0 if a[i - 1] == b[j - 1] else 1 |
| 23 | + dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost) |
24 | 24 | return dp[m][n] |
25 | 25 |
|
26 | 26 | def find_best_match(requested_name, packages): |
27 | 27 | best_match = None |
28 | | - min_dist = float('inf') |
| 28 | + min_dist = float("inf") |
29 | 29 | for pkg in packages: |
30 | 30 | dist = levenshtein_distance(requested_name, pkg) |
31 | 31 | if dist < min_dist: |
32 | 32 | min_dist = dist |
33 | 33 | best_match = pkg |
| 34 | + if min_dist > 5: |
| 35 | + return requested_name |
34 | 36 | return best_match |
35 | 37 |
|
36 | 38 | def main(package): |
37 | | - with open("/home/"+os.getlogin()+"/.config/car/packagelist", "r") as f: |
| 39 | + with open("/etc/car/packagelist", "r") as f: |
38 | 40 | pkgs = f.read().splitlines() |
39 | 41 | install = find_best_match(package, pkgs) |
40 | 42 | if install != package: |
|
0 commit comments