FM / lib

/var/www/greso.tech/server/nsm/node_modules/qrcode/node_modules/yargs/build/lib/

/var/www/greso.tech/server/nsm/node_modules/qrcode/node_modules/yargs/build/lib

Name	Size	Mode	Actions
apply-extends.d.ts	152	0644	edit dl rm
apply-extends.js	2488	0644	edit dl rm
argsert.d.ts	178	0644	edit dl rm
argsert.js	2751	0644	edit dl rm
command.d.ts	3146	0644	edit dl rm
command.js	18037	0644	edit dl rm
common-types.d.ts	1209	0644	edit dl rm
common-types.js	774	0644	edit dl rm
completion-templates.d.ts	1462	0644	edit dl rm
completion-templates.js	1530	0644	edit dl rm
completion.d.ts	994	0644	edit dl rm
completion.js	6184	0644	edit dl rm
is-promise.d.ts	96	0644	edit dl rm
is-promise.js	284	0644	edit dl rm
levenshtein.d.ts	67	0644	edit dl rm
levenshtein.js	2354	0644	edit dl rm
middleware.d.ts	764	0644	edit dl rm
middleware.js	2518	0644	edit dl rm
obj-filter.d.ts	119	0644	edit dl rm
obj-filter.js	438	0644	edit dl rm
parse-command.d.ts	309	0644	edit dl rm
parse-command.js	1195	0644	edit dl rm
process-argv.d.ts	115	0644	edit dl rm
process-argv.js	1382	0644	edit dl rm
usage.d.ts	2100	0644	edit dl rm
usage.js	20418	0644	edit dl rm
validation.d.ts	1746	0644	edit dl rm
validation.js	13441	0644	edit dl rm
yargs.d.ts	12433	0644	edit dl rm
yargs.js	48661	0644	edit dl rm
yerror.d.ts	102	0644	edit dl rm
yerror.js	301	0644	edit dl rm

Edit: /var/www/greso.tech/server/nsm/node_modules/qrcode/node_modules/yargs/build/lib/levenshtein.js (2354B)

"use strict";
/*
Copyright (c) 2011 Andrei Mackenzie

Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
the Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
Object.defineProperty(exports, "__esModule", { value: true });
exports.levenshtein = void 0;
// levenshtein distance algorithm, pulled from Andrei Mackenzie's MIT licensed.
// gist, which can be found here: https://gist.github.com/andrei-m/982927
// Compute the edit distance between the two given strings
function levenshtein(a, b) {
    if (a.length === 0)
        return b.length;
    if (b.length === 0)
        return a.length;
    const matrix = [];
    // increment along the first column of each row
    let i;
    for (i = 0; i <= b.length; i++) {
        matrix[i] = [i];
    }
    // increment each column in the first row
    let j;
    for (j = 0; j <= a.length; j++) {
        matrix[0][j] = j;
    }
    // Fill in the rest of the matrix
    for (i = 1; i <= b.length; i++) {
        for (j = 1; j <= a.length; j++) {
            if (b.charAt(i - 1) === a.charAt(j - 1)) {
                matrix[i][j] = matrix[i - 1][j - 1];
            }
            else {
                matrix[i][j] = Math.min(matrix[i - 1][j - 1] + 1, // substitution
                Math.min(matrix[i][j - 1] + 1, // insertion
                matrix[i - 1][j] + 1)); // deletion
            }
        }
    }
    return matrix[b.length][a.length];
}
exports.levenshtein = levenshtein;

"use strict"; /* Copyright (c) 2011 Andrei Mackenzie Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ Object.defineProperty(exports, "__esModule", { value: true }); exports.levenshtein = void 0; // levenshtein distance algorithm, pulled from Andrei Mackenzie's MIT licensed. // gist, which can be found here: https://gist.github.com/andrei-m/982927 // Compute the edit distance between the two given strings function levenshtein(a, b) { if (a.length === 0) return b.length; if (b.length === 0) return a.length; const matrix = []; // increment along the first column of each row let i; for (i = 0; i <= b.length; i++) { matrix[i] = [i]; } // increment each column in the first row let j; for (j = 0; j <= a.length; j++) { matrix[0][j] = j; } // Fill in the rest of the matrix for (i = 1; i <= b.length; i++) { for (j = 1; j <= a.length; j++) { if (b.charAt(i - 1) === a.charAt(j - 1)) { matrix[i][j] = matrix[i - 1][j - 1]; } else { matrix[i][j] = Math.min(matrix[i - 1][j - 1] + 1, // substitution Math.min(matrix[i][j - 1] + 1, // insertion matrix[i - 1][j] + 1)); // deletion } } } return matrix[b.length][a.length]; } exports.levenshtein = levenshtein;