@toruslabs/openlogin-utils
Advanced tools
Comparing version 0.8.2 to 0.8.3
@@ -1,153 +0,708 @@ | ||
module.exports = | ||
/******/ (function(modules) { // webpackBootstrap | ||
/******/ // The module cache | ||
/******/ var installedModules = {}; | ||
/******/ | ||
/******/ // The require function | ||
/******/ function __webpack_require__(moduleId) { | ||
/******/ | ||
/******/ // Check if module is in cache | ||
/******/ if(installedModules[moduleId]) { | ||
/******/ return installedModules[moduleId].exports; | ||
/******/ } | ||
/******/ // Create a new module (and put it into the cache) | ||
/******/ var module = installedModules[moduleId] = { | ||
/******/ i: moduleId, | ||
/******/ l: false, | ||
/******/ exports: {} | ||
/******/ }; | ||
/******/ | ||
/******/ // Execute the module function | ||
/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__); | ||
/******/ | ||
/******/ // Flag the module as loaded | ||
/******/ module.l = true; | ||
/******/ | ||
/******/ // Return the exports of the module | ||
/******/ return module.exports; | ||
/******/ } | ||
/******/ | ||
/******/ | ||
/******/ // expose the modules object (__webpack_modules__) | ||
/******/ __webpack_require__.m = modules; | ||
/******/ | ||
/******/ // expose the module cache | ||
/******/ __webpack_require__.c = installedModules; | ||
/******/ | ||
/******/ // define getter function for harmony exports | ||
/******/ __webpack_require__.d = function(exports, name, getter) { | ||
/******/ if(!__webpack_require__.o(exports, name)) { | ||
/******/ Object.defineProperty(exports, name, { enumerable: true, get: getter }); | ||
/******/ } | ||
/******/ }; | ||
/******/ | ||
/******/ // define __esModule on exports | ||
/******/ __webpack_require__.r = function(exports) { | ||
/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) { | ||
/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' }); | ||
/******/ } | ||
/******/ Object.defineProperty(exports, '__esModule', { value: true }); | ||
/******/ }; | ||
/******/ | ||
/******/ // create a fake namespace object | ||
/******/ // mode & 1: value is a module id, require it | ||
/******/ // mode & 2: merge all properties of value into the ns | ||
/******/ // mode & 4: return value when already ns object | ||
/******/ // mode & 8|1: behave like require | ||
/******/ __webpack_require__.t = function(value, mode) { | ||
/******/ if(mode & 1) value = __webpack_require__(value); | ||
/******/ if(mode & 8) return value; | ||
/******/ if((mode & 4) && typeof value === 'object' && value && value.__esModule) return value; | ||
/******/ var ns = Object.create(null); | ||
/******/ __webpack_require__.r(ns); | ||
/******/ Object.defineProperty(ns, 'default', { enumerable: true, value: value }); | ||
/******/ if(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key)); | ||
/******/ return ns; | ||
/******/ }; | ||
/******/ | ||
/******/ // getDefaultExport function for compatibility with non-harmony modules | ||
/******/ __webpack_require__.n = function(module) { | ||
/******/ var getter = module && module.__esModule ? | ||
/******/ function getDefault() { return module['default']; } : | ||
/******/ function getModuleExports() { return module; }; | ||
/******/ __webpack_require__.d(getter, 'a', getter); | ||
/******/ return getter; | ||
/******/ }; | ||
/******/ | ||
/******/ // Object.prototype.hasOwnProperty.call | ||
/******/ __webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); }; | ||
/******/ | ||
/******/ // __webpack_public_path__ | ||
/******/ __webpack_require__.p = ""; | ||
/******/ | ||
/******/ | ||
/******/ // Load entry module and return exports | ||
/******/ return __webpack_require__(__webpack_require__.s = 20); | ||
/******/ }) | ||
/************************************************************************/ | ||
/******/ ([ | ||
/* 0 */ | ||
/***/ (function(module, exports) { | ||
/******/ (() => { // webpackBootstrap | ||
/******/ var __webpack_modules__ = ({ | ||
module.exports = require("@babel/runtime/helpers/getPrototypeOf"); | ||
/***/ 808: | ||
/***/ ((module) => { | ||
/***/ }), | ||
/* 1 */ | ||
/***/ (function(module, exports) { | ||
"use strict"; | ||
// Copyright Joyent, Inc. and other Node contributors. | ||
// | ||
// 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. | ||
module.exports = require("randombytes"); | ||
/***/ }), | ||
/* 2 */ | ||
/***/ (function(module, exports) { | ||
module.exports = require("@babel/runtime/helpers/classCallCheck"); | ||
// If obj.hasOwnProperty has been overridden, then calling | ||
// obj.hasOwnProperty(prop) will break. | ||
// See: https://github.com/joyent/node/issues/1707 | ||
function hasOwnProperty(obj, prop) { | ||
return Object.prototype.hasOwnProperty.call(obj, prop); | ||
} | ||
/***/ }), | ||
/* 3 */ | ||
/***/ (function(module, exports) { | ||
module.exports = function(qs, sep, eq, options) { | ||
sep = sep || '&'; | ||
eq = eq || '='; | ||
var obj = {}; | ||
module.exports = require("@babel/runtime/helpers/createClass"); | ||
if (typeof qs !== 'string' || qs.length === 0) { | ||
return obj; | ||
} | ||
/***/ }), | ||
/* 4 */ | ||
/***/ (function(module, exports) { | ||
var regexp = /\+/g; | ||
qs = qs.split(sep); | ||
module.exports = require("@babel/runtime/helpers/assertThisInitialized"); | ||
var maxKeys = 1000; | ||
if (options && typeof options.maxKeys === 'number') { | ||
maxKeys = options.maxKeys; | ||
} | ||
/***/ }), | ||
/* 5 */ | ||
/***/ (function(module, exports) { | ||
var len = qs.length; | ||
// maxKeys <= 0 means that we should not limit keys count | ||
if (maxKeys > 0 && len > maxKeys) { | ||
len = maxKeys; | ||
} | ||
module.exports = require("@babel/runtime/helpers/get"); | ||
for (var i = 0; i < len; ++i) { | ||
var x = qs[i].replace(regexp, '%20'), | ||
idx = x.indexOf(eq), | ||
kstr, vstr, k, v; | ||
/***/ }), | ||
/* 6 */ | ||
/***/ (function(module, exports) { | ||
if (idx >= 0) { | ||
kstr = x.substr(0, idx); | ||
vstr = x.substr(idx + 1); | ||
} else { | ||
kstr = x; | ||
vstr = ''; | ||
} | ||
module.exports = require("@babel/runtime/helpers/inherits"); | ||
k = decodeURIComponent(kstr); | ||
v = decodeURIComponent(vstr); | ||
/***/ }), | ||
/* 7 */ | ||
/***/ (function(module, exports) { | ||
if (!hasOwnProperty(obj, k)) { | ||
obj[k] = v; | ||
} else if (Array.isArray(obj[k])) { | ||
obj[k].push(v); | ||
} else { | ||
obj[k] = [obj[k], v]; | ||
} | ||
} | ||
module.exports = require("@babel/runtime/helpers/possibleConstructorReturn"); | ||
return obj; | ||
}; | ||
/***/ }), | ||
/* 8 */ | ||
/***/ (function(module, exports) { | ||
module.exports = require("@babel/runtime/helpers/wrapNativeSuper"); | ||
/***/ 368: | ||
/***/ ((module) => { | ||
"use strict"; | ||
// Copyright Joyent, Inc. and other Node contributors. | ||
// | ||
// 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. | ||
var stringifyPrimitive = function(v) { | ||
switch (typeof v) { | ||
case 'string': | ||
return v; | ||
case 'boolean': | ||
return v ? 'true' : 'false'; | ||
case 'number': | ||
return isFinite(v) ? v : ''; | ||
default: | ||
return ''; | ||
} | ||
}; | ||
module.exports = function(obj, sep, eq, name) { | ||
sep = sep || '&'; | ||
eq = eq || '='; | ||
if (obj === null) { | ||
obj = undefined; | ||
} | ||
if (typeof obj === 'object') { | ||
return Object.keys(obj).map(function(k) { | ||
var ks = encodeURIComponent(stringifyPrimitive(k)) + eq; | ||
if (Array.isArray(obj[k])) { | ||
return obj[k].map(function(v) { | ||
return ks + encodeURIComponent(stringifyPrimitive(v)); | ||
}).join(sep); | ||
} else { | ||
return ks + encodeURIComponent(stringifyPrimitive(obj[k])); | ||
} | ||
}).join(sep); | ||
} | ||
if (!name) return ''; | ||
return encodeURIComponent(stringifyPrimitive(name)) + eq + | ||
encodeURIComponent(stringifyPrimitive(obj)); | ||
}; | ||
/***/ }), | ||
/* 9 */ | ||
/***/ (function(module, exports) { | ||
module.exports = require("@babel/runtime/helpers/defineProperty"); | ||
/***/ 642: | ||
/***/ ((__unused_webpack_module, exports, __webpack_require__) => { | ||
"use strict"; | ||
exports.decode = exports.parse = __webpack_require__(808); | ||
exports.encode = exports.stringify = __webpack_require__(368); | ||
/***/ }), | ||
/* 10 */ | ||
/***/ 639: | ||
/***/ (function(module, exports, __webpack_require__) { | ||
/* module decorator */ module = __webpack_require__.nmd(module); | ||
var __WEBPACK_AMD_DEFINE_RESULT__;/*! https://mths.be/punycode v1.3.2 by @mathias */ | ||
;(function(root) { | ||
/** Detect free variables */ | ||
var freeExports = true && exports && | ||
!exports.nodeType && exports; | ||
var freeModule = true && module && | ||
!module.nodeType && module; | ||
var freeGlobal = typeof __webpack_require__.g == 'object' && __webpack_require__.g; | ||
if ( | ||
freeGlobal.global === freeGlobal || | ||
freeGlobal.window === freeGlobal || | ||
freeGlobal.self === freeGlobal | ||
) { | ||
root = freeGlobal; | ||
} | ||
/** | ||
* The `punycode` object. | ||
* @name punycode | ||
* @type Object | ||
*/ | ||
var punycode, | ||
/** Highest positive signed 32-bit float value */ | ||
maxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1 | ||
/** Bootstring parameters */ | ||
base = 36, | ||
tMin = 1, | ||
tMax = 26, | ||
skew = 38, | ||
damp = 700, | ||
initialBias = 72, | ||
initialN = 128, // 0x80 | ||
delimiter = '-', // '\x2D' | ||
/** Regular expressions */ | ||
regexPunycode = /^xn--/, | ||
regexNonASCII = /[^\x20-\x7E]/, // unprintable ASCII chars + non-ASCII chars | ||
regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g, // RFC 3490 separators | ||
/** Error messages */ | ||
errors = { | ||
'overflow': 'Overflow: input needs wider integers to process', | ||
'not-basic': 'Illegal input >= 0x80 (not a basic code point)', | ||
'invalid-input': 'Invalid input' | ||
}, | ||
/** Convenience shortcuts */ | ||
baseMinusTMin = base - tMin, | ||
floor = Math.floor, | ||
stringFromCharCode = String.fromCharCode, | ||
/** Temporary variable */ | ||
key; | ||
/*--------------------------------------------------------------------------*/ | ||
/** | ||
* A generic error utility function. | ||
* @private | ||
* @param {String} type The error type. | ||
* @returns {Error} Throws a `RangeError` with the applicable error message. | ||
*/ | ||
function error(type) { | ||
throw RangeError(errors[type]); | ||
} | ||
/** | ||
* A generic `Array#map` utility function. | ||
* @private | ||
* @param {Array} array The array to iterate over. | ||
* @param {Function} callback The function that gets called for every array | ||
* item. | ||
* @returns {Array} A new array of values returned by the callback function. | ||
*/ | ||
function map(array, fn) { | ||
var length = array.length; | ||
var result = []; | ||
while (length--) { | ||
result[length] = fn(array[length]); | ||
} | ||
return result; | ||
} | ||
/** | ||
* A simple `Array#map`-like wrapper to work with domain name strings or email | ||
* addresses. | ||
* @private | ||
* @param {String} domain The domain name or email address. | ||
* @param {Function} callback The function that gets called for every | ||
* character. | ||
* @returns {Array} A new string of characters returned by the callback | ||
* function. | ||
*/ | ||
function mapDomain(string, fn) { | ||
var parts = string.split('@'); | ||
var result = ''; | ||
if (parts.length > 1) { | ||
// In email addresses, only the domain name should be punycoded. Leave | ||
// the local part (i.e. everything up to `@`) intact. | ||
result = parts[0] + '@'; | ||
string = parts[1]; | ||
} | ||
// Avoid `split(regex)` for IE8 compatibility. See #17. | ||
string = string.replace(regexSeparators, '\x2E'); | ||
var labels = string.split('.'); | ||
var encoded = map(labels, fn).join('.'); | ||
return result + encoded; | ||
} | ||
/** | ||
* Creates an array containing the numeric code points of each Unicode | ||
* character in the string. While JavaScript uses UCS-2 internally, | ||
* this function will convert a pair of surrogate halves (each of which | ||
* UCS-2 exposes as separate characters) into a single code point, | ||
* matching UTF-16. | ||
* @see `punycode.ucs2.encode` | ||
* @see <https://mathiasbynens.be/notes/javascript-encoding> | ||
* @memberOf punycode.ucs2 | ||
* @name decode | ||
* @param {String} string The Unicode input string (UCS-2). | ||
* @returns {Array} The new array of code points. | ||
*/ | ||
function ucs2decode(string) { | ||
var output = [], | ||
counter = 0, | ||
length = string.length, | ||
value, | ||
extra; | ||
while (counter < length) { | ||
value = string.charCodeAt(counter++); | ||
if (value >= 0xD800 && value <= 0xDBFF && counter < length) { | ||
// high surrogate, and there is a next character | ||
extra = string.charCodeAt(counter++); | ||
if ((extra & 0xFC00) == 0xDC00) { // low surrogate | ||
output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000); | ||
} else { | ||
// unmatched surrogate; only append this code unit, in case the next | ||
// code unit is the high surrogate of a surrogate pair | ||
output.push(value); | ||
counter--; | ||
} | ||
} else { | ||
output.push(value); | ||
} | ||
} | ||
return output; | ||
} | ||
/** | ||
* Creates a string based on an array of numeric code points. | ||
* @see `punycode.ucs2.decode` | ||
* @memberOf punycode.ucs2 | ||
* @name encode | ||
* @param {Array} codePoints The array of numeric code points. | ||
* @returns {String} The new Unicode string (UCS-2). | ||
*/ | ||
function ucs2encode(array) { | ||
return map(array, function(value) { | ||
var output = ''; | ||
if (value > 0xFFFF) { | ||
value -= 0x10000; | ||
output += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800); | ||
value = 0xDC00 | value & 0x3FF; | ||
} | ||
output += stringFromCharCode(value); | ||
return output; | ||
}).join(''); | ||
} | ||
/** | ||
* Converts a basic code point into a digit/integer. | ||
* @see `digitToBasic()` | ||
* @private | ||
* @param {Number} codePoint The basic numeric code point value. | ||
* @returns {Number} The numeric value of a basic code point (for use in | ||
* representing integers) in the range `0` to `base - 1`, or `base` if | ||
* the code point does not represent a value. | ||
*/ | ||
function basicToDigit(codePoint) { | ||
if (codePoint - 48 < 10) { | ||
return codePoint - 22; | ||
} | ||
if (codePoint - 65 < 26) { | ||
return codePoint - 65; | ||
} | ||
if (codePoint - 97 < 26) { | ||
return codePoint - 97; | ||
} | ||
return base; | ||
} | ||
/** | ||
* Converts a digit/integer into a basic code point. | ||
* @see `basicToDigit()` | ||
* @private | ||
* @param {Number} digit The numeric value of a basic code point. | ||
* @returns {Number} The basic code point whose value (when used for | ||
* representing integers) is `digit`, which needs to be in the range | ||
* `0` to `base - 1`. If `flag` is non-zero, the uppercase form is | ||
* used; else, the lowercase form is used. The behavior is undefined | ||
* if `flag` is non-zero and `digit` has no uppercase form. | ||
*/ | ||
function digitToBasic(digit, flag) { | ||
// 0..25 map to ASCII a..z or A..Z | ||
// 26..35 map to ASCII 0..9 | ||
return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5); | ||
} | ||
/** | ||
* Bias adaptation function as per section 3.4 of RFC 3492. | ||
* http://tools.ietf.org/html/rfc3492#section-3.4 | ||
* @private | ||
*/ | ||
function adapt(delta, numPoints, firstTime) { | ||
var k = 0; | ||
delta = firstTime ? floor(delta / damp) : delta >> 1; | ||
delta += floor(delta / numPoints); | ||
for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) { | ||
delta = floor(delta / baseMinusTMin); | ||
} | ||
return floor(k + (baseMinusTMin + 1) * delta / (delta + skew)); | ||
} | ||
/** | ||
* Converts a Punycode string of ASCII-only symbols to a string of Unicode | ||
* symbols. | ||
* @memberOf punycode | ||
* @param {String} input The Punycode string of ASCII-only symbols. | ||
* @returns {String} The resulting string of Unicode symbols. | ||
*/ | ||
function decode(input) { | ||
// Don't use UCS-2 | ||
var output = [], | ||
inputLength = input.length, | ||
out, | ||
i = 0, | ||
n = initialN, | ||
bias = initialBias, | ||
basic, | ||
j, | ||
index, | ||
oldi, | ||
w, | ||
k, | ||
digit, | ||
t, | ||
/** Cached calculation results */ | ||
baseMinusT; | ||
// Handle the basic code points: let `basic` be the number of input code | ||
// points before the last delimiter, or `0` if there is none, then copy | ||
// the first basic code points to the output. | ||
basic = input.lastIndexOf(delimiter); | ||
if (basic < 0) { | ||
basic = 0; | ||
} | ||
for (j = 0; j < basic; ++j) { | ||
// if it's not a basic code point | ||
if (input.charCodeAt(j) >= 0x80) { | ||
error('not-basic'); | ||
} | ||
output.push(input.charCodeAt(j)); | ||
} | ||
// Main decoding loop: start just after the last delimiter if any basic code | ||
// points were copied; start at the beginning otherwise. | ||
for (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) { | ||
// `index` is the index of the next character to be consumed. | ||
// Decode a generalized variable-length integer into `delta`, | ||
// which gets added to `i`. The overflow checking is easier | ||
// if we increase `i` as we go, then subtract off its starting | ||
// value at the end to obtain `delta`. | ||
for (oldi = i, w = 1, k = base; /* no condition */; k += base) { | ||
if (index >= inputLength) { | ||
error('invalid-input'); | ||
} | ||
digit = basicToDigit(input.charCodeAt(index++)); | ||
if (digit >= base || digit > floor((maxInt - i) / w)) { | ||
error('overflow'); | ||
} | ||
i += digit * w; | ||
t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); | ||
if (digit < t) { | ||
break; | ||
} | ||
baseMinusT = base - t; | ||
if (w > floor(maxInt / baseMinusT)) { | ||
error('overflow'); | ||
} | ||
w *= baseMinusT; | ||
} | ||
out = output.length + 1; | ||
bias = adapt(i - oldi, out, oldi == 0); | ||
// `i` was supposed to wrap around from `out` to `0`, | ||
// incrementing `n` each time, so we'll fix that now: | ||
if (floor(i / out) > maxInt - n) { | ||
error('overflow'); | ||
} | ||
n += floor(i / out); | ||
i %= out; | ||
// Insert `n` at position `i` of the output | ||
output.splice(i++, 0, n); | ||
} | ||
return ucs2encode(output); | ||
} | ||
/** | ||
* Converts a string of Unicode symbols (e.g. a domain name label) to a | ||
* Punycode string of ASCII-only symbols. | ||
* @memberOf punycode | ||
* @param {String} input The string of Unicode symbols. | ||
* @returns {String} The resulting Punycode string of ASCII-only symbols. | ||
*/ | ||
function encode(input) { | ||
var n, | ||
delta, | ||
handledCPCount, | ||
basicLength, | ||
bias, | ||
j, | ||
m, | ||
q, | ||
k, | ||
t, | ||
currentValue, | ||
output = [], | ||
/** `inputLength` will hold the number of code points in `input`. */ | ||
inputLength, | ||
/** Cached calculation results */ | ||
handledCPCountPlusOne, | ||
baseMinusT, | ||
qMinusT; | ||
// Convert the input in UCS-2 to Unicode | ||
input = ucs2decode(input); | ||
// Cache the length | ||
inputLength = input.length; | ||
// Initialize the state | ||
n = initialN; | ||
delta = 0; | ||
bias = initialBias; | ||
// Handle the basic code points | ||
for (j = 0; j < inputLength; ++j) { | ||
currentValue = input[j]; | ||
if (currentValue < 0x80) { | ||
output.push(stringFromCharCode(currentValue)); | ||
} | ||
} | ||
handledCPCount = basicLength = output.length; | ||
// `handledCPCount` is the number of code points that have been handled; | ||
// `basicLength` is the number of basic code points. | ||
// Finish the basic string - if it is not empty - with a delimiter | ||
if (basicLength) { | ||
output.push(delimiter); | ||
} | ||
// Main encoding loop: | ||
while (handledCPCount < inputLength) { | ||
// All non-basic code points < n have been handled already. Find the next | ||
// larger one: | ||
for (m = maxInt, j = 0; j < inputLength; ++j) { | ||
currentValue = input[j]; | ||
if (currentValue >= n && currentValue < m) { | ||
m = currentValue; | ||
} | ||
} | ||
// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>, | ||
// but guard against overflow | ||
handledCPCountPlusOne = handledCPCount + 1; | ||
if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) { | ||
error('overflow'); | ||
} | ||
delta += (m - n) * handledCPCountPlusOne; | ||
n = m; | ||
for (j = 0; j < inputLength; ++j) { | ||
currentValue = input[j]; | ||
if (currentValue < n && ++delta > maxInt) { | ||
error('overflow'); | ||
} | ||
if (currentValue == n) { | ||
// Represent delta as a generalized variable-length integer | ||
for (q = delta, k = base; /* no condition */; k += base) { | ||
t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); | ||
if (q < t) { | ||
break; | ||
} | ||
qMinusT = q - t; | ||
baseMinusT = base - t; | ||
output.push( | ||
stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0)) | ||
); | ||
q = floor(qMinusT / baseMinusT); | ||
} | ||
output.push(stringFromCharCode(digitToBasic(q, 0))); | ||
bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength); | ||
delta = 0; | ||
++handledCPCount; | ||
} | ||
} | ||
++delta; | ||
++n; | ||
} | ||
return output.join(''); | ||
} | ||
/** | ||
* Converts a Punycode string representing a domain name or an email address | ||
* to Unicode. Only the Punycoded parts of the input will be converted, i.e. | ||
* it doesn't matter if you call it on a string that has already been | ||
* converted to Unicode. | ||
* @memberOf punycode | ||
* @param {String} input The Punycoded domain name or email address to | ||
* convert to Unicode. | ||
* @returns {String} The Unicode representation of the given Punycode | ||
* string. | ||
*/ | ||
function toUnicode(input) { | ||
return mapDomain(input, function(string) { | ||
return regexPunycode.test(string) | ||
? decode(string.slice(4).toLowerCase()) | ||
: string; | ||
}); | ||
} | ||
/** | ||
* Converts a Unicode string representing a domain name or an email address to | ||
* Punycode. Only the non-ASCII parts of the domain name will be converted, | ||
* i.e. it doesn't matter if you call it with a domain that's already in | ||
* ASCII. | ||
* @memberOf punycode | ||
* @param {String} input The domain name or email address to convert, as a | ||
* Unicode string. | ||
* @returns {String} The Punycode representation of the given domain name or | ||
* email address. | ||
*/ | ||
function toASCII(input) { | ||
return mapDomain(input, function(string) { | ||
return regexNonASCII.test(string) | ||
? 'xn--' + encode(string) | ||
: string; | ||
}); | ||
} | ||
/*--------------------------------------------------------------------------*/ | ||
/** Define the public API */ | ||
punycode = { | ||
/** | ||
* A string representing the current Punycode.js version number. | ||
* @memberOf punycode | ||
* @type String | ||
*/ | ||
'version': '1.3.2', | ||
/** | ||
* An object of methods to convert from JavaScript's internal character | ||
* representation (UCS-2) to Unicode code points, and back. | ||
* @see <https://mathiasbynens.be/notes/javascript-encoding> | ||
* @memberOf punycode | ||
* @type Object | ||
*/ | ||
'ucs2': { | ||
'decode': ucs2decode, | ||
'encode': ucs2encode | ||
}, | ||
'decode': decode, | ||
'encode': encode, | ||
'toASCII': toASCII, | ||
'toUnicode': toUnicode | ||
}; | ||
/** Expose `punycode` */ | ||
// Some AMD build optimizers, like r.js, check for specific condition patterns | ||
// like the following: | ||
if ( | ||
true | ||
) { | ||
!(__WEBPACK_AMD_DEFINE_RESULT__ = (function() { | ||
return punycode; | ||
}).call(exports, __webpack_require__, exports, module), | ||
__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); | ||
} else {} | ||
}(this)); | ||
/***/ }), | ||
/***/ 883: | ||
/***/ ((__unused_webpack_module, exports, __webpack_require__) => { | ||
"use strict"; | ||
var __webpack_unused_export__; | ||
// Copyright Joyent, Inc. and other Node contributors. | ||
@@ -176,11 +731,11 @@ // | ||
var punycode = __webpack_require__(13); | ||
var util = __webpack_require__(16); | ||
var punycode = __webpack_require__(639); | ||
var util = __webpack_require__(225); | ||
exports.parse = urlParse; | ||
exports.resolve = urlResolve; | ||
exports.resolveObject = urlResolveObject; | ||
exports.format = urlFormat; | ||
__webpack_unused_export__ = urlParse; | ||
__webpack_unused_export__ = urlResolve; | ||
__webpack_unused_export__ = urlResolveObject; | ||
__webpack_unused_export__ = urlFormat; | ||
exports.Url = Url; | ||
__webpack_unused_export__ = Url; | ||
@@ -253,3 +808,3 @@ function Url() { | ||
}, | ||
querystring = __webpack_require__(17); | ||
querystring = __webpack_require__(642); | ||
@@ -890,597 +1445,6 @@ function urlParse(url, parseQueryString, slashesDenoteHost) { | ||
/***/ }), | ||
/* 11 */ | ||
/***/ (function(module, exports) { | ||
module.exports = require("base64url"); | ||
/***/ 225: | ||
/***/ ((module) => { | ||
/***/ }), | ||
/* 12 */ | ||
/***/ (function(module, exports) { | ||
module.exports = require("keccak"); | ||
/***/ }), | ||
/* 13 */ | ||
/***/ (function(module, exports, __webpack_require__) { | ||
/* WEBPACK VAR INJECTION */(function(module, global) {var __WEBPACK_AMD_DEFINE_RESULT__;/*! https://mths.be/punycode v1.4.1 by @mathias */ | ||
;(function(root) { | ||
/** Detect free variables */ | ||
var freeExports = true && exports && | ||
!exports.nodeType && exports; | ||
var freeModule = true && module && | ||
!module.nodeType && module; | ||
var freeGlobal = typeof global == 'object' && global; | ||
if ( | ||
freeGlobal.global === freeGlobal || | ||
freeGlobal.window === freeGlobal || | ||
freeGlobal.self === freeGlobal | ||
) { | ||
root = freeGlobal; | ||
} | ||
/** | ||
* The `punycode` object. | ||
* @name punycode | ||
* @type Object | ||
*/ | ||
var punycode, | ||
/** Highest positive signed 32-bit float value */ | ||
maxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1 | ||
/** Bootstring parameters */ | ||
base = 36, | ||
tMin = 1, | ||
tMax = 26, | ||
skew = 38, | ||
damp = 700, | ||
initialBias = 72, | ||
initialN = 128, // 0x80 | ||
delimiter = '-', // '\x2D' | ||
/** Regular expressions */ | ||
regexPunycode = /^xn--/, | ||
regexNonASCII = /[^\x20-\x7E]/, // unprintable ASCII chars + non-ASCII chars | ||
regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g, // RFC 3490 separators | ||
/** Error messages */ | ||
errors = { | ||
'overflow': 'Overflow: input needs wider integers to process', | ||
'not-basic': 'Illegal input >= 0x80 (not a basic code point)', | ||
'invalid-input': 'Invalid input' | ||
}, | ||
/** Convenience shortcuts */ | ||
baseMinusTMin = base - tMin, | ||
floor = Math.floor, | ||
stringFromCharCode = String.fromCharCode, | ||
/** Temporary variable */ | ||
key; | ||
/*--------------------------------------------------------------------------*/ | ||
/** | ||
* A generic error utility function. | ||
* @private | ||
* @param {String} type The error type. | ||
* @returns {Error} Throws a `RangeError` with the applicable error message. | ||
*/ | ||
function error(type) { | ||
throw new RangeError(errors[type]); | ||
} | ||
/** | ||
* A generic `Array#map` utility function. | ||
* @private | ||
* @param {Array} array The array to iterate over. | ||
* @param {Function} callback The function that gets called for every array | ||
* item. | ||
* @returns {Array} A new array of values returned by the callback function. | ||
*/ | ||
function map(array, fn) { | ||
var length = array.length; | ||
var result = []; | ||
while (length--) { | ||
result[length] = fn(array[length]); | ||
} | ||
return result; | ||
} | ||
/** | ||
* A simple `Array#map`-like wrapper to work with domain name strings or email | ||
* addresses. | ||
* @private | ||
* @param {String} domain The domain name or email address. | ||
* @param {Function} callback The function that gets called for every | ||
* character. | ||
* @returns {Array} A new string of characters returned by the callback | ||
* function. | ||
*/ | ||
function mapDomain(string, fn) { | ||
var parts = string.split('@'); | ||
var result = ''; | ||
if (parts.length > 1) { | ||
// In email addresses, only the domain name should be punycoded. Leave | ||
// the local part (i.e. everything up to `@`) intact. | ||
result = parts[0] + '@'; | ||
string = parts[1]; | ||
} | ||
// Avoid `split(regex)` for IE8 compatibility. See #17. | ||
string = string.replace(regexSeparators, '\x2E'); | ||
var labels = string.split('.'); | ||
var encoded = map(labels, fn).join('.'); | ||
return result + encoded; | ||
} | ||
/** | ||
* Creates an array containing the numeric code points of each Unicode | ||
* character in the string. While JavaScript uses UCS-2 internally, | ||
* this function will convert a pair of surrogate halves (each of which | ||
* UCS-2 exposes as separate characters) into a single code point, | ||
* matching UTF-16. | ||
* @see `punycode.ucs2.encode` | ||
* @see <https://mathiasbynens.be/notes/javascript-encoding> | ||
* @memberOf punycode.ucs2 | ||
* @name decode | ||
* @param {String} string The Unicode input string (UCS-2). | ||
* @returns {Array} The new array of code points. | ||
*/ | ||
function ucs2decode(string) { | ||
var output = [], | ||
counter = 0, | ||
length = string.length, | ||
value, | ||
extra; | ||
while (counter < length) { | ||
value = string.charCodeAt(counter++); | ||
if (value >= 0xD800 && value <= 0xDBFF && counter < length) { | ||
// high surrogate, and there is a next character | ||
extra = string.charCodeAt(counter++); | ||
if ((extra & 0xFC00) == 0xDC00) { // low surrogate | ||
output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000); | ||
} else { | ||
// unmatched surrogate; only append this code unit, in case the next | ||
// code unit is the high surrogate of a surrogate pair | ||
output.push(value); | ||
counter--; | ||
} | ||
} else { | ||
output.push(value); | ||
} | ||
} | ||
return output; | ||
} | ||
/** | ||
* Creates a string based on an array of numeric code points. | ||
* @see `punycode.ucs2.decode` | ||
* @memberOf punycode.ucs2 | ||
* @name encode | ||
* @param {Array} codePoints The array of numeric code points. | ||
* @returns {String} The new Unicode string (UCS-2). | ||
*/ | ||
function ucs2encode(array) { | ||
return map(array, function(value) { | ||
var output = ''; | ||
if (value > 0xFFFF) { | ||
value -= 0x10000; | ||
output += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800); | ||
value = 0xDC00 | value & 0x3FF; | ||
} | ||
output += stringFromCharCode(value); | ||
return output; | ||
}).join(''); | ||
} | ||
/** | ||
* Converts a basic code point into a digit/integer. | ||
* @see `digitToBasic()` | ||
* @private | ||
* @param {Number} codePoint The basic numeric code point value. | ||
* @returns {Number} The numeric value of a basic code point (for use in | ||
* representing integers) in the range `0` to `base - 1`, or `base` if | ||
* the code point does not represent a value. | ||
*/ | ||
function basicToDigit(codePoint) { | ||
if (codePoint - 48 < 10) { | ||
return codePoint - 22; | ||
} | ||
if (codePoint - 65 < 26) { | ||
return codePoint - 65; | ||
} | ||
if (codePoint - 97 < 26) { | ||
return codePoint - 97; | ||
} | ||
return base; | ||
} | ||
/** | ||
* Converts a digit/integer into a basic code point. | ||
* @see `basicToDigit()` | ||
* @private | ||
* @param {Number} digit The numeric value of a basic code point. | ||
* @returns {Number} The basic code point whose value (when used for | ||
* representing integers) is `digit`, which needs to be in the range | ||
* `0` to `base - 1`. If `flag` is non-zero, the uppercase form is | ||
* used; else, the lowercase form is used. The behavior is undefined | ||
* if `flag` is non-zero and `digit` has no uppercase form. | ||
*/ | ||
function digitToBasic(digit, flag) { | ||
// 0..25 map to ASCII a..z or A..Z | ||
// 26..35 map to ASCII 0..9 | ||
return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5); | ||
} | ||
/** | ||
* Bias adaptation function as per section 3.4 of RFC 3492. | ||
* https://tools.ietf.org/html/rfc3492#section-3.4 | ||
* @private | ||
*/ | ||
function adapt(delta, numPoints, firstTime) { | ||
var k = 0; | ||
delta = firstTime ? floor(delta / damp) : delta >> 1; | ||
delta += floor(delta / numPoints); | ||
for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) { | ||
delta = floor(delta / baseMinusTMin); | ||
} | ||
return floor(k + (baseMinusTMin + 1) * delta / (delta + skew)); | ||
} | ||
/** | ||
* Converts a Punycode string of ASCII-only symbols to a string of Unicode | ||
* symbols. | ||
* @memberOf punycode | ||
* @param {String} input The Punycode string of ASCII-only symbols. | ||
* @returns {String} The resulting string of Unicode symbols. | ||
*/ | ||
function decode(input) { | ||
// Don't use UCS-2 | ||
var output = [], | ||
inputLength = input.length, | ||
out, | ||
i = 0, | ||
n = initialN, | ||
bias = initialBias, | ||
basic, | ||
j, | ||
index, | ||
oldi, | ||
w, | ||
k, | ||
digit, | ||
t, | ||
/** Cached calculation results */ | ||
baseMinusT; | ||
// Handle the basic code points: let `basic` be the number of input code | ||
// points before the last delimiter, or `0` if there is none, then copy | ||
// the first basic code points to the output. | ||
basic = input.lastIndexOf(delimiter); | ||
if (basic < 0) { | ||
basic = 0; | ||
} | ||
for (j = 0; j < basic; ++j) { | ||
// if it's not a basic code point | ||
if (input.charCodeAt(j) >= 0x80) { | ||
error('not-basic'); | ||
} | ||
output.push(input.charCodeAt(j)); | ||
} | ||
// Main decoding loop: start just after the last delimiter if any basic code | ||
// points were copied; start at the beginning otherwise. | ||
for (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) { | ||
// `index` is the index of the next character to be consumed. | ||
// Decode a generalized variable-length integer into `delta`, | ||
// which gets added to `i`. The overflow checking is easier | ||
// if we increase `i` as we go, then subtract off its starting | ||
// value at the end to obtain `delta`. | ||
for (oldi = i, w = 1, k = base; /* no condition */; k += base) { | ||
if (index >= inputLength) { | ||
error('invalid-input'); | ||
} | ||
digit = basicToDigit(input.charCodeAt(index++)); | ||
if (digit >= base || digit > floor((maxInt - i) / w)) { | ||
error('overflow'); | ||
} | ||
i += digit * w; | ||
t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); | ||
if (digit < t) { | ||
break; | ||
} | ||
baseMinusT = base - t; | ||
if (w > floor(maxInt / baseMinusT)) { | ||
error('overflow'); | ||
} | ||
w *= baseMinusT; | ||
} | ||
out = output.length + 1; | ||
bias = adapt(i - oldi, out, oldi == 0); | ||
// `i` was supposed to wrap around from `out` to `0`, | ||
// incrementing `n` each time, so we'll fix that now: | ||
if (floor(i / out) > maxInt - n) { | ||
error('overflow'); | ||
} | ||
n += floor(i / out); | ||
i %= out; | ||
// Insert `n` at position `i` of the output | ||
output.splice(i++, 0, n); | ||
} | ||
return ucs2encode(output); | ||
} | ||
/** | ||
* Converts a string of Unicode symbols (e.g. a domain name label) to a | ||
* Punycode string of ASCII-only symbols. | ||
* @memberOf punycode | ||
* @param {String} input The string of Unicode symbols. | ||
* @returns {String} The resulting Punycode string of ASCII-only symbols. | ||
*/ | ||
function encode(input) { | ||
var n, | ||
delta, | ||
handledCPCount, | ||
basicLength, | ||
bias, | ||
j, | ||
m, | ||
q, | ||
k, | ||
t, | ||
currentValue, | ||
output = [], | ||
/** `inputLength` will hold the number of code points in `input`. */ | ||
inputLength, | ||
/** Cached calculation results */ | ||
handledCPCountPlusOne, | ||
baseMinusT, | ||
qMinusT; | ||
// Convert the input in UCS-2 to Unicode | ||
input = ucs2decode(input); | ||
// Cache the length | ||
inputLength = input.length; | ||
// Initialize the state | ||
n = initialN; | ||
delta = 0; | ||
bias = initialBias; | ||
// Handle the basic code points | ||
for (j = 0; j < inputLength; ++j) { | ||
currentValue = input[j]; | ||
if (currentValue < 0x80) { | ||
output.push(stringFromCharCode(currentValue)); | ||
} | ||
} | ||
handledCPCount = basicLength = output.length; | ||
// `handledCPCount` is the number of code points that have been handled; | ||
// `basicLength` is the number of basic code points. | ||
// Finish the basic string - if it is not empty - with a delimiter | ||
if (basicLength) { | ||
output.push(delimiter); | ||
} | ||
// Main encoding loop: | ||
while (handledCPCount < inputLength) { | ||
// All non-basic code points < n have been handled already. Find the next | ||
// larger one: | ||
for (m = maxInt, j = 0; j < inputLength; ++j) { | ||
currentValue = input[j]; | ||
if (currentValue >= n && currentValue < m) { | ||
m = currentValue; | ||
} | ||
} | ||
// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>, | ||
// but guard against overflow | ||
handledCPCountPlusOne = handledCPCount + 1; | ||
if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) { | ||
error('overflow'); | ||
} | ||
delta += (m - n) * handledCPCountPlusOne; | ||
n = m; | ||
for (j = 0; j < inputLength; ++j) { | ||
currentValue = input[j]; | ||
if (currentValue < n && ++delta > maxInt) { | ||
error('overflow'); | ||
} | ||
if (currentValue == n) { | ||
// Represent delta as a generalized variable-length integer | ||
for (q = delta, k = base; /* no condition */; k += base) { | ||
t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); | ||
if (q < t) { | ||
break; | ||
} | ||
qMinusT = q - t; | ||
baseMinusT = base - t; | ||
output.push( | ||
stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0)) | ||
); | ||
q = floor(qMinusT / baseMinusT); | ||
} | ||
output.push(stringFromCharCode(digitToBasic(q, 0))); | ||
bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength); | ||
delta = 0; | ||
++handledCPCount; | ||
} | ||
} | ||
++delta; | ||
++n; | ||
} | ||
return output.join(''); | ||
} | ||
/** | ||
* Converts a Punycode string representing a domain name or an email address | ||
* to Unicode. Only the Punycoded parts of the input will be converted, i.e. | ||
* it doesn't matter if you call it on a string that has already been | ||
* converted to Unicode. | ||
* @memberOf punycode | ||
* @param {String} input The Punycoded domain name or email address to | ||
* convert to Unicode. | ||
* @returns {String} The Unicode representation of the given Punycode | ||
* string. | ||
*/ | ||
function toUnicode(input) { | ||
return mapDomain(input, function(string) { | ||
return regexPunycode.test(string) | ||
? decode(string.slice(4).toLowerCase()) | ||
: string; | ||
}); | ||
} | ||
/** | ||
* Converts a Unicode string representing a domain name or an email address to | ||
* Punycode. Only the non-ASCII parts of the domain name will be converted, | ||
* i.e. it doesn't matter if you call it with a domain that's already in | ||
* ASCII. | ||
* @memberOf punycode | ||
* @param {String} input The domain name or email address to convert, as a | ||
* Unicode string. | ||
* @returns {String} The Punycode representation of the given domain name or | ||
* email address. | ||
*/ | ||
function toASCII(input) { | ||
return mapDomain(input, function(string) { | ||
return regexNonASCII.test(string) | ||
? 'xn--' + encode(string) | ||
: string; | ||
}); | ||
} | ||
/*--------------------------------------------------------------------------*/ | ||
/** Define the public API */ | ||
punycode = { | ||
/** | ||
* A string representing the current Punycode.js version number. | ||
* @memberOf punycode | ||
* @type String | ||
*/ | ||
'version': '1.4.1', | ||
/** | ||
* An object of methods to convert from JavaScript's internal character | ||
* representation (UCS-2) to Unicode code points, and back. | ||
* @see <https://mathiasbynens.be/notes/javascript-encoding> | ||
* @memberOf punycode | ||
* @type Object | ||
*/ | ||
'ucs2': { | ||
'decode': ucs2decode, | ||
'encode': ucs2encode | ||
}, | ||
'decode': decode, | ||
'encode': encode, | ||
'toASCII': toASCII, | ||
'toUnicode': toUnicode | ||
}; | ||
/** Expose `punycode` */ | ||
// Some AMD build optimizers, like r.js, check for specific condition patterns | ||
// like the following: | ||
if ( | ||
true | ||
) { | ||
!(__WEBPACK_AMD_DEFINE_RESULT__ = (function() { | ||
return punycode; | ||
}).call(exports, __webpack_require__, exports, module), | ||
__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); | ||
} else {} | ||
}(this)); | ||
/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(14)(module), __webpack_require__(15))) | ||
/***/ }), | ||
/* 14 */ | ||
/***/ (function(module, exports) { | ||
module.exports = function(module) { | ||
if (!module.webpackPolyfill) { | ||
module.deprecate = function() {}; | ||
module.paths = []; | ||
// module.parent = undefined by default | ||
if (!module.children) module.children = []; | ||
Object.defineProperty(module, "loaded", { | ||
enumerable: true, | ||
get: function() { | ||
return module.l; | ||
} | ||
}); | ||
Object.defineProperty(module, "id", { | ||
enumerable: true, | ||
get: function() { | ||
return module.i; | ||
} | ||
}); | ||
module.webpackPolyfill = 1; | ||
} | ||
return module; | ||
}; | ||
/***/ }), | ||
/* 15 */ | ||
/***/ (function(module, exports) { | ||
var g; | ||
// This works in non-strict mode | ||
g = (function() { | ||
return this; | ||
})(); | ||
try { | ||
// This works if eval is allowed (see CSP) | ||
g = g || new Function("return this")(); | ||
} catch (e) { | ||
// This works if the window reference is available | ||
if (typeof window === "object") g = window; | ||
} | ||
// g can still be undefined, but nothing to do about it... | ||
// We return undefined, instead of nothing here, so it's | ||
// easier to handle this case. if(!global) { ...} | ||
module.exports = g; | ||
/***/ }), | ||
/* 16 */ | ||
/***/ (function(module, exports, __webpack_require__) { | ||
"use strict"; | ||
@@ -1505,201 +1469,100 @@ | ||
/***/ }), | ||
/* 17 */ | ||
/***/ (function(module, exports, __webpack_require__) { | ||
/***/ }) | ||
/******/ }); | ||
/************************************************************************/ | ||
/******/ // The module cache | ||
/******/ var __webpack_module_cache__ = {}; | ||
/******/ | ||
/******/ // The require function | ||
/******/ function __webpack_require__(moduleId) { | ||
/******/ // Check if module is in cache | ||
/******/ var cachedModule = __webpack_module_cache__[moduleId]; | ||
/******/ if (cachedModule !== undefined) { | ||
/******/ return cachedModule.exports; | ||
/******/ } | ||
/******/ // Create a new module (and put it into the cache) | ||
/******/ var module = __webpack_module_cache__[moduleId] = { | ||
/******/ id: moduleId, | ||
/******/ loaded: false, | ||
/******/ exports: {} | ||
/******/ }; | ||
/******/ | ||
/******/ // Execute the module function | ||
/******/ __webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__); | ||
/******/ | ||
/******/ // Flag the module as loaded | ||
/******/ module.loaded = true; | ||
/******/ | ||
/******/ // Return the exports of the module | ||
/******/ return module.exports; | ||
/******/ } | ||
/******/ | ||
/************************************************************************/ | ||
/******/ /* webpack/runtime/compat get default export */ | ||
/******/ (() => { | ||
/******/ // getDefaultExport function for compatibility with non-harmony modules | ||
/******/ __webpack_require__.n = (module) => { | ||
/******/ var getter = module && module.__esModule ? | ||
/******/ () => (module['default']) : | ||
/******/ () => (module); | ||
/******/ __webpack_require__.d(getter, { a: getter }); | ||
/******/ return getter; | ||
/******/ }; | ||
/******/ })(); | ||
/******/ | ||
/******/ /* webpack/runtime/define property getters */ | ||
/******/ (() => { | ||
/******/ // define getter functions for harmony exports | ||
/******/ __webpack_require__.d = (exports, definition) => { | ||
/******/ for(var key in definition) { | ||
/******/ if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) { | ||
/******/ Object.defineProperty(exports, key, { enumerable: true, get: definition[key] }); | ||
/******/ } | ||
/******/ } | ||
/******/ }; | ||
/******/ })(); | ||
/******/ | ||
/******/ /* webpack/runtime/global */ | ||
/******/ (() => { | ||
/******/ __webpack_require__.g = (function() { | ||
/******/ if (typeof globalThis === 'object') return globalThis; | ||
/******/ try { | ||
/******/ return this || new Function('return this')(); | ||
/******/ } catch (e) { | ||
/******/ if (typeof window === 'object') return window; | ||
/******/ } | ||
/******/ })(); | ||
/******/ })(); | ||
/******/ | ||
/******/ /* webpack/runtime/hasOwnProperty shorthand */ | ||
/******/ (() => { | ||
/******/ __webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop)) | ||
/******/ })(); | ||
/******/ | ||
/******/ /* webpack/runtime/make namespace object */ | ||
/******/ (() => { | ||
/******/ // define __esModule on exports | ||
/******/ __webpack_require__.r = (exports) => { | ||
/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) { | ||
/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' }); | ||
/******/ } | ||
/******/ Object.defineProperty(exports, '__esModule', { value: true }); | ||
/******/ }; | ||
/******/ })(); | ||
/******/ | ||
/******/ /* webpack/runtime/node module decorator */ | ||
/******/ (() => { | ||
/******/ __webpack_require__.nmd = (module) => { | ||
/******/ module.paths = []; | ||
/******/ if (!module.children) module.children = []; | ||
/******/ return module; | ||
/******/ }; | ||
/******/ })(); | ||
/******/ | ||
/************************************************************************/ | ||
var __webpack_exports__ = {}; | ||
// This entry need to be wrapped in an IIFE because it need to be in strict mode. | ||
(() => { | ||
"use strict"; | ||
exports.decode = exports.parse = __webpack_require__(18); | ||
exports.encode = exports.stringify = __webpack_require__(19); | ||
/***/ }), | ||
/* 18 */ | ||
/***/ (function(module, exports, __webpack_require__) { | ||
"use strict"; | ||
// Copyright Joyent, Inc. and other Node contributors. | ||
// | ||
// 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. | ||
// If obj.hasOwnProperty has been overridden, then calling | ||
// obj.hasOwnProperty(prop) will break. | ||
// See: https://github.com/joyent/node/issues/1707 | ||
function hasOwnProperty(obj, prop) { | ||
return Object.prototype.hasOwnProperty.call(obj, prop); | ||
} | ||
module.exports = function(qs, sep, eq, options) { | ||
sep = sep || '&'; | ||
eq = eq || '='; | ||
var obj = {}; | ||
if (typeof qs !== 'string' || qs.length === 0) { | ||
return obj; | ||
} | ||
var regexp = /\+/g; | ||
qs = qs.split(sep); | ||
var maxKeys = 1000; | ||
if (options && typeof options.maxKeys === 'number') { | ||
maxKeys = options.maxKeys; | ||
} | ||
var len = qs.length; | ||
// maxKeys <= 0 means that we should not limit keys count | ||
if (maxKeys > 0 && len > maxKeys) { | ||
len = maxKeys; | ||
} | ||
for (var i = 0; i < len; ++i) { | ||
var x = qs[i].replace(regexp, '%20'), | ||
idx = x.indexOf(eq), | ||
kstr, vstr, k, v; | ||
if (idx >= 0) { | ||
kstr = x.substr(0, idx); | ||
vstr = x.substr(idx + 1); | ||
} else { | ||
kstr = x; | ||
vstr = ''; | ||
} | ||
k = decodeURIComponent(kstr); | ||
v = decodeURIComponent(vstr); | ||
if (!hasOwnProperty(obj, k)) { | ||
obj[k] = v; | ||
} else if (isArray(obj[k])) { | ||
obj[k].push(v); | ||
} else { | ||
obj[k] = [obj[k], v]; | ||
} | ||
} | ||
return obj; | ||
}; | ||
var isArray = Array.isArray || function (xs) { | ||
return Object.prototype.toString.call(xs) === '[object Array]'; | ||
}; | ||
/***/ }), | ||
/* 19 */ | ||
/***/ (function(module, exports, __webpack_require__) { | ||
"use strict"; | ||
// Copyright Joyent, Inc. and other Node contributors. | ||
// | ||
// 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. | ||
var stringifyPrimitive = function(v) { | ||
switch (typeof v) { | ||
case 'string': | ||
return v; | ||
case 'boolean': | ||
return v ? 'true' : 'false'; | ||
case 'number': | ||
return isFinite(v) ? v : ''; | ||
default: | ||
return ''; | ||
} | ||
}; | ||
module.exports = function(obj, sep, eq, name) { | ||
sep = sep || '&'; | ||
eq = eq || '='; | ||
if (obj === null) { | ||
obj = undefined; | ||
} | ||
if (typeof obj === 'object') { | ||
return map(objectKeys(obj), function(k) { | ||
var ks = encodeURIComponent(stringifyPrimitive(k)) + eq; | ||
if (isArray(obj[k])) { | ||
return map(obj[k], function(v) { | ||
return ks + encodeURIComponent(stringifyPrimitive(v)); | ||
}).join(sep); | ||
} else { | ||
return ks + encodeURIComponent(stringifyPrimitive(obj[k])); | ||
} | ||
}).join(sep); | ||
} | ||
if (!name) return ''; | ||
return encodeURIComponent(stringifyPrimitive(name)) + eq + | ||
encodeURIComponent(stringifyPrimitive(obj)); | ||
}; | ||
var isArray = Array.isArray || function (xs) { | ||
return Object.prototype.toString.call(xs) === '[object Array]'; | ||
}; | ||
function map (xs, f) { | ||
if (xs.map) return xs.map(f); | ||
var res = []; | ||
for (var i = 0; i < xs.length; i++) { | ||
res.push(f(xs[i], i)); | ||
} | ||
return res; | ||
} | ||
var objectKeys = Object.keys || function (obj) { | ||
var res = []; | ||
for (var key in obj) { | ||
if (Object.prototype.hasOwnProperty.call(obj, key)) res.push(key); | ||
} | ||
return res; | ||
}; | ||
/***/ }), | ||
/* 20 */ | ||
/***/ (function(module, __webpack_exports__, __webpack_require__) { | ||
"use strict"; | ||
// ESM COMPAT FLAG | ||
@@ -1709,72 +1572,63 @@ __webpack_require__.r(__webpack_exports__); | ||
// EXPORTS | ||
__webpack_require__.d(__webpack_exports__, "randomId", function() { return /* reexport */ randomId_randomId; }); | ||
__webpack_require__.d(__webpack_exports__, "URLWithHashParams", function() { return /* reexport */ url_URLWithHashParams; }); | ||
__webpack_require__.d(__webpack_exports__, "base64url", function() { return /* reexport */ base64url; }); | ||
__webpack_require__.d(__webpack_exports__, "safebtoa", function() { return /* reexport */ safebtoa; }); | ||
__webpack_require__.d(__webpack_exports__, "safeatob", function() { return /* reexport */ safeatob; }); | ||
__webpack_require__.d(__webpack_exports__, "keccak", function() { return /* reexport */ keccak; }); | ||
__webpack_require__.d(__webpack_exports__, "base64toJSON", function() { return /* reexport */ base64toJSON; }); | ||
__webpack_require__.d(__webpack_exports__, "jsonToBase64", function() { return /* reexport */ jsonToBase64; }); | ||
__webpack_require__.d(__webpack_exports__, "keccak256", function() { return /* reexport */ keccak256; }); | ||
__webpack_require__.d(__webpack_exports__, { | ||
"URLWithHashParams": () => (/* reexport */ URLWithHashParams), | ||
"base64toJSON": () => (/* reexport */ base64toJSON), | ||
"base64url": () => (/* reexport */ base64url), | ||
"jsonToBase64": () => (/* reexport */ jsonToBase64), | ||
"keccak": () => (/* reexport */ keccak), | ||
"keccak256": () => (/* reexport */ keccak256), | ||
"randomId": () => (/* reexport */ randomId), | ||
"safeatob": () => (/* reexport */ safeatob), | ||
"safebtoa": () => (/* reexport */ safebtoa) | ||
}); | ||
// EXTERNAL MODULE: external "randombytes" | ||
var external_randombytes_ = __webpack_require__(1); | ||
var external_randombytes_default = /*#__PURE__*/__webpack_require__.n(external_randombytes_); | ||
// CONCATENATED MODULE: ./src/randomId.ts | ||
;// CONCATENATED MODULE: external "randombytes" | ||
const external_randombytes_namespaceObject = require("randombytes");; | ||
var external_randombytes_default = /*#__PURE__*/__webpack_require__.n(external_randombytes_namespaceObject); | ||
;// CONCATENATED MODULE: ./src/randomId.ts | ||
// TODO: should be crypto safe | ||
var randomId_randomId = function randomId() { | ||
var randomId = function randomId() { | ||
return external_randombytes_default()(32).toString("hex"); | ||
}; | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/classCallCheck" | ||
var classCallCheck_ = __webpack_require__(2); | ||
var classCallCheck_default = /*#__PURE__*/__webpack_require__.n(classCallCheck_); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/classCallCheck" | ||
const classCallCheck_namespaceObject = require("@babel/runtime/helpers/classCallCheck");; | ||
var classCallCheck_default = /*#__PURE__*/__webpack_require__.n(classCallCheck_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/createClass" | ||
const createClass_namespaceObject = require("@babel/runtime/helpers/createClass");; | ||
var createClass_default = /*#__PURE__*/__webpack_require__.n(createClass_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/assertThisInitialized" | ||
const assertThisInitialized_namespaceObject = require("@babel/runtime/helpers/assertThisInitialized");; | ||
var assertThisInitialized_default = /*#__PURE__*/__webpack_require__.n(assertThisInitialized_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/get" | ||
const get_namespaceObject = require("@babel/runtime/helpers/get");; | ||
var get_default = /*#__PURE__*/__webpack_require__.n(get_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/inherits" | ||
const inherits_namespaceObject = require("@babel/runtime/helpers/inherits");; | ||
var inherits_default = /*#__PURE__*/__webpack_require__.n(inherits_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/possibleConstructorReturn" | ||
const possibleConstructorReturn_namespaceObject = require("@babel/runtime/helpers/possibleConstructorReturn");; | ||
var possibleConstructorReturn_default = /*#__PURE__*/__webpack_require__.n(possibleConstructorReturn_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/getPrototypeOf" | ||
const getPrototypeOf_namespaceObject = require("@babel/runtime/helpers/getPrototypeOf");; | ||
var getPrototypeOf_default = /*#__PURE__*/__webpack_require__.n(getPrototypeOf_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/wrapNativeSuper" | ||
const wrapNativeSuper_namespaceObject = require("@babel/runtime/helpers/wrapNativeSuper");; | ||
var wrapNativeSuper_default = /*#__PURE__*/__webpack_require__.n(wrapNativeSuper_namespaceObject); | ||
;// CONCATENATED MODULE: external "@babel/runtime/helpers/defineProperty" | ||
const defineProperty_namespaceObject = require("@babel/runtime/helpers/defineProperty");; | ||
var defineProperty_default = /*#__PURE__*/__webpack_require__.n(defineProperty_namespaceObject); | ||
// EXTERNAL MODULE: ../../node_modules/url/url.js | ||
var url = __webpack_require__(883); | ||
;// CONCATENATED MODULE: ./src/url.ts | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/createClass" | ||
var createClass_ = __webpack_require__(3); | ||
var createClass_default = /*#__PURE__*/__webpack_require__.n(createClass_); | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/assertThisInitialized" | ||
var assertThisInitialized_ = __webpack_require__(4); | ||
var assertThisInitialized_default = /*#__PURE__*/__webpack_require__.n(assertThisInitialized_); | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/get" | ||
var get_ = __webpack_require__(5); | ||
var get_default = /*#__PURE__*/__webpack_require__.n(get_); | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/inherits" | ||
var inherits_ = __webpack_require__(6); | ||
var inherits_default = /*#__PURE__*/__webpack_require__.n(inherits_); | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/possibleConstructorReturn" | ||
var possibleConstructorReturn_ = __webpack_require__(7); | ||
var possibleConstructorReturn_default = /*#__PURE__*/__webpack_require__.n(possibleConstructorReturn_); | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/getPrototypeOf" | ||
var getPrototypeOf_ = __webpack_require__(0); | ||
var getPrototypeOf_default = /*#__PURE__*/__webpack_require__.n(getPrototypeOf_); | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/wrapNativeSuper" | ||
var wrapNativeSuper_ = __webpack_require__(8); | ||
var wrapNativeSuper_default = /*#__PURE__*/__webpack_require__.n(wrapNativeSuper_); | ||
// EXTERNAL MODULE: external "@babel/runtime/helpers/defineProperty" | ||
var defineProperty_ = __webpack_require__(9); | ||
var defineProperty_default = /*#__PURE__*/__webpack_require__.n(defineProperty_); | ||
// EXTERNAL MODULE: /home/chai/source/repos/torus/OpenLoginSdk/node_modules/url/url.js | ||
var url = __webpack_require__(10); | ||
// CONCATENATED MODULE: ./src/url.ts | ||
function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = getPrototypeOf_default()(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = getPrototypeOf_default()(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return possibleConstructorReturn_default()(this, result); }; } | ||
@@ -1785,3 +1639,3 @@ | ||
var url_URLWithHashParams = /*#__PURE__*/function (_URL) { | ||
var URLWithHashParams = /*#__PURE__*/function (_URL) { | ||
inherits_default()(URLWithHashParams, _URL); | ||
@@ -1802,3 +1656,3 @@ | ||
defineProperty_default()(assertThisInitialized_default()(_this), "hashParams", new url["URLSearchParams"]()); | ||
defineProperty_default()(assertThisInitialized_default()(_this), "hashParams", new url.URLSearchParams()); | ||
@@ -1818,14 +1672,12 @@ return _this; | ||
}( /*#__PURE__*/wrapNativeSuper_default()(URL)); | ||
// EXTERNAL MODULE: external "base64url" | ||
var external_base64url_ = __webpack_require__(11); | ||
var external_base64url_default = /*#__PURE__*/__webpack_require__.n(external_base64url_); | ||
;// CONCATENATED MODULE: external "base64url" | ||
const external_base64url_namespaceObject = require("base64url");; | ||
var external_base64url_default = /*#__PURE__*/__webpack_require__.n(external_base64url_namespaceObject); | ||
;// CONCATENATED MODULE: external "keccak" | ||
const external_keccak_namespaceObject = require("keccak");; | ||
var external_keccak_default = /*#__PURE__*/__webpack_require__.n(external_keccak_namespaceObject); | ||
;// CONCATENATED MODULE: ./src/utils.ts | ||
// EXTERNAL MODULE: external "keccak" | ||
var external_keccak_ = __webpack_require__(12); | ||
var external_keccak_default = /*#__PURE__*/__webpack_require__.n(external_keccak_); | ||
// CONCATENATED MODULE: ./src/utils.ts | ||
var base64url = external_base64url_default.a; | ||
var base64url = (external_base64url_default()); | ||
function safebtoa(str) { | ||
@@ -1838,3 +1690,3 @@ return base64url.encode(str); | ||
} | ||
var keccak = external_keccak_default.a; | ||
var keccak = (external_keccak_default()); | ||
function base64toJSON(b64str) { | ||
@@ -1856,8 +1708,10 @@ return JSON.parse(base64url.decode(b64str)); | ||
} // TODO: not all of the options are implemented | ||
// CONCATENATED MODULE: ./index.ts | ||
;// CONCATENATED MODULE: ./index.ts | ||
})(); | ||
/***/ }) | ||
/******/ ]); | ||
module.exports.OpenloginUtils = __webpack_exports__; | ||
/******/ })() | ||
; |
{ | ||
"name": "@toruslabs/openlogin-utils", | ||
"version": "0.8.2", | ||
"version": "0.8.3", | ||
"homepage": "https://github.com/torusresearch/OpenLoginSdk#readme", | ||
@@ -12,6 +12,4 @@ "license": "ISC", | ||
"scripts": { | ||
"test": "cross-env MOCKED=true mocha --config ../../.mocharc.json ", | ||
"test-development": "cross-env MOCKED=false METADATA=http://localhost:5051 mocha --config ../../.mocharc.json ", | ||
"test-production": "cross-env MOCKED=false METADATA=https://metadata.tor.us mocha --config ../../.mocharc.json ", | ||
"test-debugger": "mocha --config ../../.mocharc.json --inspect-brk", | ||
"test": "mocha --config ../../.mocharc.json test/**.ts", | ||
"test-debugger": "mocha --config ../../.mocharc.json --inspect-brk test/**.ts", | ||
"dev": "rimraf dist/ && cross-env NODE_ENV=development parallel-webpack --no-stats", | ||
@@ -32,3 +30,4 @@ "build": "rimraf dist/ && cross-env NODE_ENV=production parallel-webpack --no-stats", | ||
"@types/node": "^14.14.25", | ||
"@types/randombytes": "^2.0.0" | ||
"@types/randombytes": "^2.0.0", | ||
"lint-staged": "^11.0.0" | ||
}, | ||
@@ -44,4 +43,4 @@ "peerDependencies": { | ||
"!(*d).ts": [ | ||
"yarn run lint --", | ||
"prettier --write 'src/**/*.ts' 'index.ts'" | ||
"eslint --cache --fix", | ||
"prettier --write" | ||
] | ||
@@ -60,3 +59,3 @@ }, | ||
}, | ||
"gitHead": "b2a87579c3ca4579702c7855cde547247f9f0217" | ||
"gitHead": "01937595a33c2c0a24bd3ef2cc484cfca3c28777" | ||
} |
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is too big to display
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Uses eval
Supply chain riskPackage uses dynamic code execution (e.g., eval()), which is a dangerous practice. This can prevent the code from running in certain environments and increases the risk that the code may contain exploits or malicious behavior.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Uses eval
Supply chain riskPackage uses dynamic code execution (e.g., eval()), which is a dangerous practice. This can prevent the code from running in certain environments and increases the risk that the code may contain exploits or malicious behavior.
Found 1 instance in 1 package
591322
10131
2
4