1 |
|
2 |
|
3 |
|
4 |
|
5 | export default function suggestionList(input, options) {
|
6 | var optionsByDistance = Object.create(null);
|
7 | var inputThreshold = input.length / 2;
|
8 |
|
9 | for (var _i2 = 0; _i2 < options.length; _i2++) {
|
10 | var option = options[_i2];
|
11 | var distance = lexicalDistance(input, option);
|
12 | var threshold = Math.max(inputThreshold, option.length / 2, 1);
|
13 |
|
14 | if (distance <= threshold) {
|
15 | optionsByDistance[option] = distance;
|
16 | }
|
17 | }
|
18 |
|
19 | return Object.keys(optionsByDistance).sort(function (a, b) {
|
20 | return optionsByDistance[a] - optionsByDistance[b];
|
21 | });
|
22 | }
|
23 |
|
24 |
|
25 |
|
26 |
|
27 |
|
28 |
|
29 |
|
30 |
|
31 |
|
32 |
|
33 |
|
34 |
|
35 |
|
36 |
|
37 |
|
38 |
|
39 |
|
40 |
|
41 |
|
42 | function lexicalDistance(aStr, bStr) {
|
43 | if (aStr === bStr) {
|
44 | return 0;
|
45 | }
|
46 |
|
47 | var d = [];
|
48 | var a = aStr.toLowerCase();
|
49 | var b = bStr.toLowerCase();
|
50 | var aLength = a.length;
|
51 | var bLength = b.length;
|
52 |
|
53 | if (a === b) {
|
54 | return 1;
|
55 | }
|
56 |
|
57 | for (var i = 0; i <= aLength; i++) {
|
58 | d[i] = [i];
|
59 | }
|
60 |
|
61 | for (var j = 1; j <= bLength; j++) {
|
62 | d[0][j] = j;
|
63 | }
|
64 |
|
65 | for (var _i3 = 1; _i3 <= aLength; _i3++) {
|
66 | for (var _j = 1; _j <= bLength; _j++) {
|
67 | var cost = a[_i3 - 1] === b[_j - 1] ? 0 : 1;
|
68 | d[_i3][_j] = Math.min(d[_i3 - 1][_j] + 1, d[_i3][_j - 1] + 1, d[_i3 - 1][_j - 1] + cost);
|
69 |
|
70 | if (_i3 > 1 && _j > 1 && a[_i3 - 1] === b[_j - 2] && a[_i3 - 2] === b[_j - 1]) {
|
71 | d[_i3][_j] = Math.min(d[_i3][_j], d[_i3 - 2][_j - 2] + cost);
|
72 | }
|
73 | }
|
74 | }
|
75 |
|
76 | return d[aLength][bLength];
|
77 | }
|