FM / fast-levenshtein

/home/techb158/balavpn.abdallabala.com/node_modules/fast-levenshtein/

/home/techb158/balavpn.abdallabala.com/node_modules/fast-levenshtein

Name	Size	Mode	Actions
levenshtein.js	3932	0666	edit dl rm
LICENSE.md	1100	0666	edit dl rm
package.json	998	0666	edit dl rm
README.md	3414	0666	edit dl rm

Edit: /home/techb158/balavpn.abdallabala.com/node_modules/fast-levenshtein/levenshtein.js (3932B)

// two rows
      var curCol, nextCol, i, j, tmp;

// initialise previous row
      for (i=0; i<str2Len; ++i) {
        prevRow[i] = i;
        str2Char[i] = str2.charCodeAt(i);
      }
      prevRow[str2Len] = str2Len;

var strCmp;
      if (useCollator) {
        // calculate current row distance from previous row using collator
        for (i = 0; i < str1Len; ++i) {
          nextCol = i + 1;

for (j = 0; j < str2Len; ++j) {
            curCol = nextCol;

// substution
            strCmp = 0 === collator.compare(str1.charAt(i), String.fromCharCode(str2Char[j]));

nextCol = prevRow[j] + (strCmp ? 0 : 1);

// insertion
            tmp = curCol + 1;
            if (nextCol > tmp) {
              nextCol = tmp;
            }
            // deletion
            tmp = prevRow[j + 1] + 1;
            if (nextCol > tmp) {
              nextCol = tmp;
            }

// copy current col value into previous (in preparation for next iteration)
            prevRow[j] = curCol;
          }

// copy last col value into previous (in preparation for next iteration)
          prevRow[j] = nextCol;
        }
      }
      else {
        // calculate current row distance from previous row without collator
        for (i = 0; i < str1Len; ++i) {
          nextCol = i + 1;

for (j = 0; j < str2Len; ++j) {
            curCol = nextCol;

// substution
            strCmp = str1.charCodeAt(i) === str2Char[j];

nextCol = prevRow[j] + (strCmp ? 0 : 1);

// copy current col value into previous (in preparation for next iteration)
            prevRow[j] = curCol;
          }

// copy last col value into previous (in preparation for next iteration)
          prevRow[j] = nextCol;
        }
      }
      return nextCol;
    }

};

// amd
  if (typeof define !== "undefined" && define !== null && define.amd) {
    define(function() {
      return Levenshtein;
    });
  }
  // commonjs
  else if (typeof module !== "undefined" && module !== null && typeof exports !== "undefined" && module.exports === exports) {
    module.exports = Levenshtein;
  }
  // web worker
  else if (typeof self !== "undefined" && typeof self.postMessage === 'function' && typeof self.importScripts === 'function') {
    self.Levenshtein = Levenshtein;
  }
  // browser main thread
  else if (typeof window !== "undefined" && window !== null) {
    window.Levenshtein = Levenshtein;
  }
}());

cmd: