{"version":3,"sources":["jsdelivr-header.js","/npm/levenshtein@1.0.5/lib/levenshtein.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,CCNC,SAAS,EAAM,GACO,mBAAV,QAA6C,iBAAd,OAAO,KAAmB,OAAO,IACzE,QAAO,WACL,OAAO,EAAQ,EACjB,IAC0B,iBAAV,QAAsB,QAAU,OAAO,QACvD,OAAO,QAAU,EAAQ,GAEzB,EAAK,YAAc,EAAQ,EAE/B,CAVA,CAUE,MAAM,SAAS,GAEf,SAAS,EAAS,EAAO,GAAO,IAAI,EAAG,EAGrC,IAFA,GAAK,EACL,EAAS,EAAM,SACL,EAAI,GACZ,EAAI,EAAO,GAAK,EAAG,EACvB,CAEA,SAAS,EAAK,EAAO,GAAO,IAAI,EAK9B,OAJA,EAAS,MAAO,EAAM,QACtB,EAAS,GAAO,SAAW,EAAK,EAAG,GACjC,EAAO,GAAK,EAAI,EAAK,EAAG,EAC1B,IACO,CACT,CAEA,SAAS,EAAQ,EAAO,EAAI,GAI1B,OAHA,EAAS,GAAO,SAAU,EAAK,EAAG,GAChC,EAAc,EAAI,EAAK,EAAG,EAC5B,IACO,CACT,CAGA,SAAS,EAAa,EAAO,GAAU,IAAI,EAAU,EAAS,EAK5D,OAHA,EAAS,KAAK,QAAU,GAGnB,GAAS,EACL,KAAK,SAAW,EACN,IAAT,EACD,KAAK,SAAW,EAAM,OACZ,IAAT,EACD,KAAK,SAAW,EAAM,QAG7B,EAAW,CAAE,GACb,EAAS,GAAO,SAAU,EAAG,GAAM,IAAK,EAAU,GAAM,CAAE,IAE1D,EAAO,GAAK,EACZ,EAAS,GAAO,SAAU,EAAO,GAC/B,EAAU,GAAI,GACd,EAAS,GAAO,SAAU,EAAO,GAC/B,IACK,EAAM,OAAQ,EAAQ,IAAO,EAAM,OAAQ,EAAQ,GACtD,EAAS,GAAU,EAAU,EAAQ,GAErC,EAAS,GAAU,KAAK,IACpB,EAAU,GAAc,EACxB,EAAU,EAAQ,GAAM,EACxB,EAAU,EAAQ,GAAM,EAEhC,IACA,EAAW,EACX,EAAQ,EAAO,QAAW,CAC5B,IAEO,KAAK,SAAW,EAAS,EAAQ,OAAS,GAErD,CAgCA,OA9BA,EAAY,UAAU,SAAW,EAAY,UAAU,QAAU,SAAmB,GAAa,IAAI,EAAQ,EAAK,EAAM,EAQtH,IANA,EAAM,EADN,EAAS,KAAK,aACO,SAAU,EAAG,GAChC,OAAO,KAAK,IAAK,EAAG,EAAQ,EAAG,KAAK,IAAK,GAC3C,GAAG,GACH,EAAO,OAAS,EAAM,IAAK,QAAS,KAAM,KAE1C,EAAM,GACE,EAAI,QAAU,EAAO,IAAM,EAAO,GAAG,QAAU,IACrD,EAAK,EAAI,QAAW,MAAO,EAAK,OAAS,GAAI,KAAM,KAUrD,OATA,EAAM,EAAI,KAAM,MAAS,IAElB,EAAK,GAAQ,SAAU,GAI5B,OAHQ,EAAK,GAAK,SAAU,GAC1B,OAAS,EAAO,GAAO,OAAS,EAAK,OACvC,IACa,KAAM,MAAS,GAC9B,IAEY,KAAM,KAAO,EAAM,KACjC,EAEA,EAAY,UAAU,UAAY,WAChC,OAAO,KAAK,QAAQ,OACtB,EAEA,EAAY,UAAU,QAAU,WAC9B,OAAO,KAAK,QACd,EAEO,CAET","file":"/npm/levenshtein@1.0.5/lib/levenshtein.js","sourceRoot":"","sourcesContent":["/**\n * Minified by jsDelivr using Terser v5.39.0.\n * Original file: /npm/levenshtein@1.0.5/lib/levenshtein.js\n *\n * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files\n */\n","(function(root, factory){\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    define(function(){\n      return factory(root);\n    });\n  } else if (typeof module == 'object' && module && module.exports) {\n    module.exports = factory(root);\n  } else {\n    root.Levenshtein = factory(root);\n  }\n}(this, function(root){\n\n  function forEach( array, fn ) { var i, length\n    i = -1\n    length = array.length\n    while ( ++i < length )\n      fn( array[ i ], i, array )\n  }\n\n  function map( array, fn ) { var result\n    result = Array( array.length )\n    forEach( array, function ( val, i, array ) {\n      result[i] = fn( val, i, array )\n    })\n    return result\n  }\n\n  function reduce( array, fn, accumulator ) {\n    forEach( array, function( val, i, array ) {\n      accumulator = fn( val, i, array )\n    })\n    return accumulator\n  }\n\n  // Levenshtein distance\n  function Levenshtein( str_m, str_n ) { var previous, current, matrix\n    // Constructor\n    matrix = this._matrix = []\n\n    // Sanity checks\n    if ( str_m == str_n )\n      return this.distance = 0\n    else if ( str_m == '' )\n      return this.distance = str_n.length\n    else if ( str_n == '' )\n      return this.distance = str_m.length\n    else {\n      // Danger Will Robinson\n      previous = [ 0 ]\n      forEach( str_m, function( v, i ) { i++, previous[ i ] = i } )\n\n      matrix[0] = previous\n      forEach( str_n, function( n_val, n_idx ) {\n        current = [ ++n_idx ]\n        forEach( str_m, function( m_val, m_idx ) {\n          m_idx++\n          if ( str_m.charAt( m_idx - 1 ) == str_n.charAt( n_idx - 1 ) )\n            current[ m_idx ] = previous[ m_idx - 1 ]\n          else\n            current[ m_idx ] = Math.min\n              ( previous[ m_idx ]     + 1   // Deletion\n              , current[  m_idx - 1 ] + 1   // Insertion\n              , previous[ m_idx - 1 ] + 1   // Subtraction\n              )\n        })\n        previous = current\n        matrix[ matrix.length ] = previous\n      })\n\n      return this.distance = current[ current.length - 1 ]\n    }\n  }\n\n  Levenshtein.prototype.toString = Levenshtein.prototype.inspect = function inspect ( no_print ) { var matrix, max, buff, sep, rows\n    matrix = this.getMatrix()\n    max = reduce( matrix,function( m, o ) {\n      return Math.max( m, reduce( o, Math.max, 0 ) )\n    }, 0 )\n    buff = Array( ( max + '' ).length ).join( ' ' )\n\n    sep = []\n    while ( sep.length < (matrix[0] && matrix[0].length || 0) )\n      sep[ sep.length ] = Array( buff.length + 1 ).join( '-' )\n    sep = sep.join( '-+' ) + '-'\n\n    rows = map( matrix, function( row ) { var cells\n      cells = map( row, function( cell ) {\n        return ( buff + cell ).slice( - buff.length )\n      })\n      return cells.join( ' |' ) + ' '\n    })\n\n    return rows.join( \"\\n\" + sep + \"\\n\" )\n  }\n\n  Levenshtein.prototype.getMatrix = function () {\n    return this._matrix.slice()\n  }\n\n  Levenshtein.prototype.valueOf = function() {\n    return this.distance\n  }\n\n  return Levenshtein\n\n}));\n"]}