�PNG  IHDR��;���IDATx��ܻn�0���K�� �)(�pA��� ���7�LeG{�� �§㻢|��ذaÆ 6lذaÆ 6lذaÆ 6lom��$^�y���ذag�5bÆ 6lذaÆ 6lذa{���� 6lذaÆ �`����}H�Fkm�,�m����Ӫ���ô�ô!� �x�|'ܢ˟;�E:���9�&ᶒ�}�{�v]�n&�6� �h��_��t�ڠ͵-ҫ���Z;��Z$�.�P���k�ž)�!��o���>}l�eQfJ�T��u і���چ��\��X=8��Rن4`Vw�l�>����n�G�^��i�s��"ms�$�u��i��?w�bs[m�6�K4���O���.�4��%����/����b�C%��t ��M�ז� �-l�G6�mrz2���s�%�9��s@���-�k�9�=���)������k�B5����\��+͂�Zsٲ ��Rn��~G���R���C����� �wIcI��n7jJ���hۛNCS|���j0��8y�iHKֶۛ�k�Ɉ+;Sz������L/��F�*\��Ԕ�#"5��m�2��[S��������=�g��n�a�P�e�ғ�L�� lذaÆ 6l�^k��̱aÆ 6lذaÆ 6lذa;���� �_��ذaÆ 6lذaÆ 6lذaÆ ���R���IEND�B` const {distance, closest} = require("./index.js"); const levenshtein = (a, b) => { if (a.length === 0) return b.length; if (b.length === 0) return a.length; if (a.length > b.length) { const tmp = a; a = b; b = tmp; } const row = []; for (let i = 0; i <= a.length; i++) { row[i] = i; } for (let i = 1; i <= b.length; i++) { let prev = i; for (let j = 1; j <= a.length; j++) { let val; if (b.charAt(i - 1) === a.charAt(j - 1)) { val = row[j - 1]; } else { val = Math.min(row[j - 1] + 1, prev + 1, row[j] + 1); } row[j - 1] = prev; prev = val; } row[a.length] = prev; } return row[a.length]; }; function makeid(length) { let result = ""; const characters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"; const charactersLength = characters.length; for (let i = 0; i < length; i++) { result += characters.charAt(Math.floor(Math.random() * charactersLength)); } return result; } test("test compare", () => { const errors = 0; for (let i = 0; i < 1000; i++) { const rnd_num1 = (Math.random() * 1000) | 0; const rnd_num2 = (Math.random() * 1000) | 0; const rnd_string1 = makeid(rnd_num1); const rnd_string2 = makeid(rnd_num2); const actual = distance(rnd_string1, rnd_string2); const expected = levenshtein(rnd_string1, rnd_string2); expect(actual).toBe(expected); } }); test("test find", () => { const actual = closest("fast", ["slow", "faster", "fastest"]); const expected = "faster"; expect(actual).toBe(expected); });