@muguilin/xf-voice-dictation
Version:
讯飞语音听写 WebAPI
1,354 lines (1,353 loc) • 176 kB
JavaScript
function hx(H, R) {
for (var c = 0; c < R.length; c++) {
const x = R[c];
if (typeof x != "string" && !Array.isArray(x)) {
for (const C in x)
if (C !== "default" && !(C in H)) {
const E = Object.getOwnPropertyDescriptor(x, C);
E && Object.defineProperty(H, C, E.get ? E : {
enumerable: !0,
get: () => x[C]
});
}
}
}
return Object.freeze(Object.defineProperty(H, Symbol.toStringTag, { value: "Module" }));
}
var T = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
function lx(H) {
return H && H.__esModule && Object.prototype.hasOwnProperty.call(H, "default") ? H.default : H;
}
function Bx(H) {
if (H.__esModule)
return H;
var R = H.default;
if (typeof R == "function") {
var c = function x() {
return this instanceof x ? Reflect.construct(R, arguments, this.constructor) : R.apply(this, arguments);
};
c.prototype = R.prototype;
} else
c = {};
return Object.defineProperty(c, "__esModule", { value: !0 }), Object.keys(H).forEach(function(x) {
var C = Object.getOwnPropertyDescriptor(H, x);
Object.defineProperty(c, x, C.get ? C : {
enumerable: !0,
get: function() {
return H[x];
}
});
}), c;
}
var Yr = { exports: {} };
function Cx(H) {
throw new Error('Could not dynamically require "' + H + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
}
var D0 = { exports: {} };
const Ax = {}, Ex = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
__proto__: null,
default: Ax
}, Symbol.toStringTag, { value: "Module" })), px = /* @__PURE__ */ Bx(Ex);
var Br;
function L() {
return Br || (Br = 1, function(H, R) {
(function(c, x) {
H.exports = x();
})(T, function() {
var c = c || function(x, C) {
var E;
if (typeof window < "u" && window.crypto && (E = window.crypto), typeof self < "u" && self.crypto && (E = self.crypto), typeof globalThis < "u" && globalThis.crypto && (E = globalThis.crypto), !E && typeof window < "u" && window.msCrypto && (E = window.msCrypto), !E && typeof T < "u" && T.crypto && (E = T.crypto), !E && typeof Cx == "function")
try {
E = px;
} catch {
}
var g = function() {
if (E) {
if (typeof E.getRandomValues == "function")
try {
return E.getRandomValues(new Uint32Array(1))[0];
} catch {
}
if (typeof E.randomBytes == "function")
try {
return E.randomBytes(4).readInt32LE();
} catch {
}
}
throw new Error("Native crypto module could not be used to get secure random number.");
}, u = Object.create || /* @__PURE__ */ function() {
function a() {
}
return function(n) {
var i;
return a.prototype = n, i = new a(), a.prototype = null, i;
};
}(), l = {}, r = l.lib = {}, t = r.Base = /* @__PURE__ */ function() {
return {
/**
* Creates a new object that inherits from this object.
*
* @param {Object} overrides Properties to copy into the new object.
*
* @return {Object} The new object.
*
* @static
*
* @example
*
* var MyType = CryptoJS.lib.Base.extend({
* field: 'value',
*
* method: function () {
* }
* });
*/
extend: function(a) {
var n = u(this);
return a && n.mixIn(a), (!n.hasOwnProperty("init") || this.init === n.init) && (n.init = function() {
n.$super.init.apply(this, arguments);
}), n.init.prototype = n, n.$super = this, n;
},
/**
* Extends this object and runs the init method.
* Arguments to create() will be passed to init().
*
* @return {Object} The new object.
*
* @static
*
* @example
*
* var instance = MyType.create();
*/
create: function() {
var a = this.extend();
return a.init.apply(a, arguments), a;
},
/**
* Initializes a newly created object.
* Override this method to add some logic when your objects are created.
*
* @example
*
* var MyType = CryptoJS.lib.Base.extend({
* init: function () {
* // ...
* }
* });
*/
init: function() {
},
/**
* Copies properties into this object.
*
* @param {Object} properties The properties to mix in.
*
* @example
*
* MyType.mixIn({
* field: 'value'
* });
*/
mixIn: function(a) {
for (var n in a)
a.hasOwnProperty(n) && (this[n] = a[n]);
a.hasOwnProperty("toString") && (this.toString = a.toString);
},
/**
* Creates a copy of this object.
*
* @return {Object} The clone.
*
* @example
*
* var clone = instance.clone();
*/
clone: function() {
return this.init.prototype.extend(this);
}
};
}(), h = r.WordArray = t.extend({
/**
* Initializes a newly created word array.
*
* @param {Array} words (Optional) An array of 32-bit words.
* @param {number} sigBytes (Optional) The number of significant bytes in the words.
*
* @example
*
* var wordArray = CryptoJS.lib.WordArray.create();
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
*/
init: function(a, n) {
a = this.words = a || [], n != C ? this.sigBytes = n : this.sigBytes = a.length * 4;
},
/**
* Converts this word array to a string.
*
* @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex
*
* @return {string} The stringified word array.
*
* @example
*
* var string = wordArray + '';
* var string = wordArray.toString();
* var string = wordArray.toString(CryptoJS.enc.Utf8);
*/
toString: function(a) {
return (a || f).stringify(this);
},
/**
* Concatenates a word array to this word array.
*
* @param {WordArray} wordArray The word array to append.
*
* @return {WordArray} This word array.
*
* @example
*
* wordArray1.concat(wordArray2);
*/
concat: function(a) {
var n = this.words, i = a.words, p = this.sigBytes, A = a.sigBytes;
if (this.clamp(), p % 4)
for (var D = 0; D < A; D++) {
var _ = i[D >>> 2] >>> 24 - D % 4 * 8 & 255;
n[p + D >>> 2] |= _ << 24 - (p + D) % 4 * 8;
}
else
for (var z = 0; z < A; z += 4)
n[p + z >>> 2] = i[z >>> 2];
return this.sigBytes += A, this;
},
/**
* Removes insignificant bits.
*
* @example
*
* wordArray.clamp();
*/
clamp: function() {
var a = this.words, n = this.sigBytes;
a[n >>> 2] &= 4294967295 << 32 - n % 4 * 8, a.length = x.ceil(n / 4);
},
/**
* Creates a copy of this word array.
*
* @return {WordArray} The clone.
*
* @example
*
* var clone = wordArray.clone();
*/
clone: function() {
var a = t.clone.call(this);
return a.words = this.words.slice(0), a;
},
/**
* Creates a word array filled with random bytes.
*
* @param {number} nBytes The number of random bytes to generate.
*
* @return {WordArray} The random word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.lib.WordArray.random(16);
*/
random: function(a) {
for (var n = [], i = 0; i < a; i += 4)
n.push(g());
return new h.init(n, a);
}
}), e = l.enc = {}, f = e.Hex = {
/**
* Converts a word array to a hex string.
*
* @param {WordArray} wordArray The word array.
*
* @return {string} The hex string.
*
* @static
*
* @example
*
* var hexString = CryptoJS.enc.Hex.stringify(wordArray);
*/
stringify: function(a) {
for (var n = a.words, i = a.sigBytes, p = [], A = 0; A < i; A++) {
var D = n[A >>> 2] >>> 24 - A % 4 * 8 & 255;
p.push((D >>> 4).toString(16)), p.push((D & 15).toString(16));
}
return p.join("");
},
/**
* Converts a hex string to a word array.
*
* @param {string} hexStr The hex string.
*
* @return {WordArray} The word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.enc.Hex.parse(hexString);
*/
parse: function(a) {
for (var n = a.length, i = [], p = 0; p < n; p += 2)
i[p >>> 3] |= parseInt(a.substr(p, 2), 16) << 24 - p % 8 * 4;
return new h.init(i, n / 2);
}
}, o = e.Latin1 = {
/**
* Converts a word array to a Latin1 string.
*
* @param {WordArray} wordArray The word array.
*
* @return {string} The Latin1 string.
*
* @static
*
* @example
*
* var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
*/
stringify: function(a) {
for (var n = a.words, i = a.sigBytes, p = [], A = 0; A < i; A++) {
var D = n[A >>> 2] >>> 24 - A % 4 * 8 & 255;
p.push(String.fromCharCode(D));
}
return p.join("");
},
/**
* Converts a Latin1 string to a word array.
*
* @param {string} latin1Str The Latin1 string.
*
* @return {WordArray} The word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
*/
parse: function(a) {
for (var n = a.length, i = [], p = 0; p < n; p++)
i[p >>> 2] |= (a.charCodeAt(p) & 255) << 24 - p % 4 * 8;
return new h.init(i, n);
}
}, v = e.Utf8 = {
/**
* Converts a word array to a UTF-8 string.
*
* @param {WordArray} wordArray The word array.
*
* @return {string} The UTF-8 string.
*
* @static
*
* @example
*
* var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);
*/
stringify: function(a) {
try {
return decodeURIComponent(escape(o.stringify(a)));
} catch {
throw new Error("Malformed UTF-8 data");
}
},
/**
* Converts a UTF-8 string to a word array.
*
* @param {string} utf8Str The UTF-8 string.
*
* @return {WordArray} The word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.enc.Utf8.parse(utf8String);
*/
parse: function(a) {
return o.parse(unescape(encodeURIComponent(a)));
}
}, s = r.BufferedBlockAlgorithm = t.extend({
/**
* Resets this block algorithm's data buffer to its initial state.
*
* @example
*
* bufferedBlockAlgorithm.reset();
*/
reset: function() {
this._data = new h.init(), this._nDataBytes = 0;
},
/**
* Adds new data to this block algorithm's buffer.
*
* @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.
*
* @example
*
* bufferedBlockAlgorithm._append('data');
* bufferedBlockAlgorithm._append(wordArray);
*/
_append: function(a) {
typeof a == "string" && (a = v.parse(a)), this._data.concat(a), this._nDataBytes += a.sigBytes;
},
/**
* Processes available data blocks.
*
* This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.
*
* @param {boolean} doFlush Whether all blocks and partial blocks should be processed.
*
* @return {WordArray} The processed data.
*
* @example
*
* var processedData = bufferedBlockAlgorithm._process();
* var processedData = bufferedBlockAlgorithm._process(!!'flush');
*/
_process: function(a) {
var n, i = this._data, p = i.words, A = i.sigBytes, D = this.blockSize, _ = D * 4, z = A / _;
a ? z = x.ceil(z) : z = x.max((z | 0) - this._minBufferSize, 0);
var d = z * D, F = x.min(d * 4, A);
if (d) {
for (var y = 0; y < d; y += D)
this._doProcessBlock(p, y);
n = p.splice(0, d), i.sigBytes -= F;
}
return new h.init(n, F);
},
/**
* Creates a copy of this object.
*
* @return {Object} The clone.
*
* @example
*
* var clone = bufferedBlockAlgorithm.clone();
*/
clone: function() {
var a = t.clone.call(this);
return a._data = this._data.clone(), a;
},
_minBufferSize: 0
});
r.Hasher = s.extend({
/**
* Configuration options.
*/
cfg: t.extend(),
/**
* Initializes a newly created hasher.
*
* @param {Object} cfg (Optional) The configuration options to use for this hash computation.
*
* @example
*
* var hasher = CryptoJS.algo.SHA256.create();
*/
init: function(a) {
this.cfg = this.cfg.extend(a), this.reset();
},
/**
* Resets this hasher to its initial state.
*
* @example
*
* hasher.reset();
*/
reset: function() {
s.reset.call(this), this._doReset();
},
/**
* Updates this hasher with a message.
*
* @param {WordArray|string} messageUpdate The message to append.
*
* @return {Hasher} This hasher.
*
* @example
*
* hasher.update('message');
* hasher.update(wordArray);
*/
update: function(a) {
return this._append(a), this._process(), this;
},
/**
* Finalizes the hash computation.
* Note that the finalize operation is effectively a destructive, read-once operation.
*
* @param {WordArray|string} messageUpdate (Optional) A final message update.
*
* @return {WordArray} The hash.
*
* @example
*
* var hash = hasher.finalize();
* var hash = hasher.finalize('message');
* var hash = hasher.finalize(wordArray);
*/
finalize: function(a) {
a && this._append(a);
var n = this._doFinalize();
return n;
},
blockSize: 16,
/**
* Creates a shortcut function to a hasher's object interface.
*
* @param {Hasher} hasher The hasher to create a helper for.
*
* @return {Function} The shortcut function.
*
* @static
*
* @example
*
* var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
*/
_createHelper: function(a) {
return function(n, i) {
return new a.init(i).finalize(n);
};
},
/**
* Creates a shortcut function to the HMAC's object interface.
*
* @param {Hasher} hasher The hasher to use in this HMAC helper.
*
* @return {Function} The shortcut function.
*
* @static
*
* @example
*
* var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
*/
_createHmacHelper: function(a) {
return function(n, i) {
return new B.HMAC.init(a, i).finalize(n);
};
}
});
var B = l.algo = {};
return l;
}(Math);
return c;
});
}(D0)), D0.exports;
}
var F0 = { exports: {} }, Cr;
function A0() {
return Cr || (Cr = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function(x) {
var C = c, E = C.lib, g = E.Base, u = E.WordArray, l = C.x64 = {};
l.Word = g.extend({
/**
* Initializes a newly created 64-bit word.
*
* @param {number} high The high 32 bits.
* @param {number} low The low 32 bits.
*
* @example
*
* var x64Word = CryptoJS.x64.Word.create(0x00010203, 0x04050607);
*/
init: function(r, t) {
this.high = r, this.low = t;
}
/**
* Bitwise NOTs this word.
*
* @return {X64Word} A new x64-Word object after negating.
*
* @example
*
* var negated = x64Word.not();
*/
// not: function () {
// var high = ~this.high;
// var low = ~this.low;
// return X64Word.create(high, low);
// },
/**
* Bitwise ANDs this word with the passed word.
*
* @param {X64Word} word The x64-Word to AND with this word.
*
* @return {X64Word} A new x64-Word object after ANDing.
*
* @example
*
* var anded = x64Word.and(anotherX64Word);
*/
// and: function (word) {
// var high = this.high & word.high;
// var low = this.low & word.low;
// return X64Word.create(high, low);
// },
/**
* Bitwise ORs this word with the passed word.
*
* @param {X64Word} word The x64-Word to OR with this word.
*
* @return {X64Word} A new x64-Word object after ORing.
*
* @example
*
* var ored = x64Word.or(anotherX64Word);
*/
// or: function (word) {
// var high = this.high | word.high;
// var low = this.low | word.low;
// return X64Word.create(high, low);
// },
/**
* Bitwise XORs this word with the passed word.
*
* @param {X64Word} word The x64-Word to XOR with this word.
*
* @return {X64Word} A new x64-Word object after XORing.
*
* @example
*
* var xored = x64Word.xor(anotherX64Word);
*/
// xor: function (word) {
// var high = this.high ^ word.high;
// var low = this.low ^ word.low;
// return X64Word.create(high, low);
// },
/**
* Shifts this word n bits to the left.
*
* @param {number} n The number of bits to shift.
*
* @return {X64Word} A new x64-Word object after shifting.
*
* @example
*
* var shifted = x64Word.shiftL(25);
*/
// shiftL: function (n) {
// if (n < 32) {
// var high = (this.high << n) | (this.low >>> (32 - n));
// var low = this.low << n;
// } else {
// var high = this.low << (n - 32);
// var low = 0;
// }
// return X64Word.create(high, low);
// },
/**
* Shifts this word n bits to the right.
*
* @param {number} n The number of bits to shift.
*
* @return {X64Word} A new x64-Word object after shifting.
*
* @example
*
* var shifted = x64Word.shiftR(7);
*/
// shiftR: function (n) {
// if (n < 32) {
// var low = (this.low >>> n) | (this.high << (32 - n));
// var high = this.high >>> n;
// } else {
// var low = this.high >>> (n - 32);
// var high = 0;
// }
// return X64Word.create(high, low);
// },
/**
* Rotates this word n bits to the left.
*
* @param {number} n The number of bits to rotate.
*
* @return {X64Word} A new x64-Word object after rotating.
*
* @example
*
* var rotated = x64Word.rotL(25);
*/
// rotL: function (n) {
// return this.shiftL(n).or(this.shiftR(64 - n));
// },
/**
* Rotates this word n bits to the right.
*
* @param {number} n The number of bits to rotate.
*
* @return {X64Word} A new x64-Word object after rotating.
*
* @example
*
* var rotated = x64Word.rotR(7);
*/
// rotR: function (n) {
// return this.shiftR(n).or(this.shiftL(64 - n));
// },
/**
* Adds this word with the passed word.
*
* @param {X64Word} word The x64-Word to add with this word.
*
* @return {X64Word} A new x64-Word object after adding.
*
* @example
*
* var added = x64Word.add(anotherX64Word);
*/
// add: function (word) {
// var low = (this.low + word.low) | 0;
// var carry = (low >>> 0) < (this.low >>> 0) ? 1 : 0;
// var high = (this.high + word.high + carry) | 0;
// return X64Word.create(high, low);
// }
}), l.WordArray = g.extend({
/**
* Initializes a newly created word array.
*
* @param {Array} words (Optional) An array of CryptoJS.x64.Word objects.
* @param {number} sigBytes (Optional) The number of significant bytes in the words.
*
* @example
*
* var wordArray = CryptoJS.x64.WordArray.create();
*
* var wordArray = CryptoJS.x64.WordArray.create([
* CryptoJS.x64.Word.create(0x00010203, 0x04050607),
* CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
* ]);
*
* var wordArray = CryptoJS.x64.WordArray.create([
* CryptoJS.x64.Word.create(0x00010203, 0x04050607),
* CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
* ], 10);
*/
init: function(r, t) {
r = this.words = r || [], t != x ? this.sigBytes = t : this.sigBytes = r.length * 8;
},
/**
* Converts this 64-bit word array to a 32-bit word array.
*
* @return {CryptoJS.lib.WordArray} This word array's data as a 32-bit word array.
*
* @example
*
* var x32WordArray = x64WordArray.toX32();
*/
toX32: function() {
for (var r = this.words, t = r.length, h = [], e = 0; e < t; e++) {
var f = r[e];
h.push(f.high), h.push(f.low);
}
return u.create(h, this.sigBytes);
},
/**
* Creates a copy of this word array.
*
* @return {X64WordArray} The clone.
*
* @example
*
* var clone = x64WordArray.clone();
*/
clone: function() {
for (var r = g.clone.call(this), t = r.words = this.words.slice(0), h = t.length, e = 0; e < h; e++)
t[e] = t[e].clone();
return r;
}
});
}(), c;
});
}(F0)), F0.exports;
}
var _0 = { exports: {} }, Ar;
function Dx() {
return Ar || (Ar = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function() {
if (typeof ArrayBuffer == "function") {
var x = c, C = x.lib, E = C.WordArray, g = E.init, u = E.init = function(l) {
if (l instanceof ArrayBuffer && (l = new Uint8Array(l)), (l instanceof Int8Array || typeof Uint8ClampedArray < "u" && l instanceof Uint8ClampedArray || l instanceof Int16Array || l instanceof Uint16Array || l instanceof Int32Array || l instanceof Uint32Array || l instanceof Float32Array || l instanceof Float64Array) && (l = new Uint8Array(l.buffer, l.byteOffset, l.byteLength)), l instanceof Uint8Array) {
for (var r = l.byteLength, t = [], h = 0; h < r; h++)
t[h >>> 2] |= l[h] << 24 - h % 4 * 8;
g.call(this, t, r);
} else
g.apply(this, arguments);
};
u.prototype = E;
}
}(), c.lib.WordArray;
});
}(_0)), _0.exports;
}
var b0 = { exports: {} }, Er;
function Fx() {
return Er || (Er = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function() {
var x = c, C = x.lib, E = C.WordArray, g = x.enc;
g.Utf16 = g.Utf16BE = {
/**
* Converts a word array to a UTF-16 BE string.
*
* @param {WordArray} wordArray The word array.
*
* @return {string} The UTF-16 BE string.
*
* @static
*
* @example
*
* var utf16String = CryptoJS.enc.Utf16.stringify(wordArray);
*/
stringify: function(l) {
for (var r = l.words, t = l.sigBytes, h = [], e = 0; e < t; e += 2) {
var f = r[e >>> 2] >>> 16 - e % 4 * 8 & 65535;
h.push(String.fromCharCode(f));
}
return h.join("");
},
/**
* Converts a UTF-16 BE string to a word array.
*
* @param {string} utf16Str The UTF-16 BE string.
*
* @return {WordArray} The word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.enc.Utf16.parse(utf16String);
*/
parse: function(l) {
for (var r = l.length, t = [], h = 0; h < r; h++)
t[h >>> 1] |= l.charCodeAt(h) << 16 - h % 2 * 16;
return E.create(t, r * 2);
}
}, g.Utf16LE = {
/**
* Converts a word array to a UTF-16 LE string.
*
* @param {WordArray} wordArray The word array.
*
* @return {string} The UTF-16 LE string.
*
* @static
*
* @example
*
* var utf16Str = CryptoJS.enc.Utf16LE.stringify(wordArray);
*/
stringify: function(l) {
for (var r = l.words, t = l.sigBytes, h = [], e = 0; e < t; e += 2) {
var f = u(r[e >>> 2] >>> 16 - e % 4 * 8 & 65535);
h.push(String.fromCharCode(f));
}
return h.join("");
},
/**
* Converts a UTF-16 LE string to a word array.
*
* @param {string} utf16Str The UTF-16 LE string.
*
* @return {WordArray} The word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.enc.Utf16LE.parse(utf16Str);
*/
parse: function(l) {
for (var r = l.length, t = [], h = 0; h < r; h++)
t[h >>> 1] |= u(l.charCodeAt(h) << 16 - h % 2 * 16);
return E.create(t, r * 2);
}
};
function u(l) {
return l << 8 & 4278255360 | l >>> 8 & 16711935;
}
}(), c.enc.Utf16;
});
}(b0)), b0.exports;
}
var g0 = { exports: {} }, pr;
function e0() {
return pr || (pr = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function() {
var x = c, C = x.lib, E = C.WordArray, g = x.enc;
g.Base64 = {
/**
* Converts a word array to a Base64 string.
*
* @param {WordArray} wordArray The word array.
*
* @return {string} The Base64 string.
*
* @static
*
* @example
*
* var base64String = CryptoJS.enc.Base64.stringify(wordArray);
*/
stringify: function(l) {
var r = l.words, t = l.sigBytes, h = this._map;
l.clamp();
for (var e = [], f = 0; f < t; f += 3)
for (var o = r[f >>> 2] >>> 24 - f % 4 * 8 & 255, v = r[f + 1 >>> 2] >>> 24 - (f + 1) % 4 * 8 & 255, s = r[f + 2 >>> 2] >>> 24 - (f + 2) % 4 * 8 & 255, B = o << 16 | v << 8 | s, a = 0; a < 4 && f + a * 0.75 < t; a++)
e.push(h.charAt(B >>> 6 * (3 - a) & 63));
var n = h.charAt(64);
if (n)
for (; e.length % 4; )
e.push(n);
return e.join("");
},
/**
* Converts a Base64 string to a word array.
*
* @param {string} base64Str The Base64 string.
*
* @return {WordArray} The word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.enc.Base64.parse(base64String);
*/
parse: function(l) {
var r = l.length, t = this._map, h = this._reverseMap;
if (!h) {
h = this._reverseMap = [];
for (var e = 0; e < t.length; e++)
h[t.charCodeAt(e)] = e;
}
var f = t.charAt(64);
if (f) {
var o = l.indexOf(f);
o !== -1 && (r = o);
}
return u(l, r, h);
},
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
};
function u(l, r, t) {
for (var h = [], e = 0, f = 0; f < r; f++)
if (f % 4) {
var o = t[l.charCodeAt(f - 1)] << f % 4 * 2, v = t[l.charCodeAt(f)] >>> 6 - f % 4 * 2, s = o | v;
h[e >>> 2] |= s << 24 - e % 4 * 8, e++;
}
return E.create(h, e);
}
}(), c.enc.Base64;
});
}(g0)), g0.exports;
}
var y0 = { exports: {} }, Dr;
function _x() {
return Dr || (Dr = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function() {
var x = c, C = x.lib, E = C.WordArray, g = x.enc;
g.Base64url = {
/**
* Converts a word array to a Base64url string.
*
* @param {WordArray} wordArray The word array.
*
* @param {boolean} urlSafe Whether to use url safe
*
* @return {string} The Base64url string.
*
* @static
*
* @example
*
* var base64String = CryptoJS.enc.Base64url.stringify(wordArray);
*/
stringify: function(l, r) {
r === void 0 && (r = !0);
var t = l.words, h = l.sigBytes, e = r ? this._safe_map : this._map;
l.clamp();
for (var f = [], o = 0; o < h; o += 3)
for (var v = t[o >>> 2] >>> 24 - o % 4 * 8 & 255, s = t[o + 1 >>> 2] >>> 24 - (o + 1) % 4 * 8 & 255, B = t[o + 2 >>> 2] >>> 24 - (o + 2) % 4 * 8 & 255, a = v << 16 | s << 8 | B, n = 0; n < 4 && o + n * 0.75 < h; n++)
f.push(e.charAt(a >>> 6 * (3 - n) & 63));
var i = e.charAt(64);
if (i)
for (; f.length % 4; )
f.push(i);
return f.join("");
},
/**
* Converts a Base64url string to a word array.
*
* @param {string} base64Str The Base64url string.
*
* @param {boolean} urlSafe Whether to use url safe
*
* @return {WordArray} The word array.
*
* @static
*
* @example
*
* var wordArray = CryptoJS.enc.Base64url.parse(base64String);
*/
parse: function(l, r) {
r === void 0 && (r = !0);
var t = l.length, h = r ? this._safe_map : this._map, e = this._reverseMap;
if (!e) {
e = this._reverseMap = [];
for (var f = 0; f < h.length; f++)
e[h.charCodeAt(f)] = f;
}
var o = h.charAt(64);
if (o) {
var v = l.indexOf(o);
v !== -1 && (t = v);
}
return u(l, t, e);
},
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
_safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
};
function u(l, r, t) {
for (var h = [], e = 0, f = 0; f < r; f++)
if (f % 4) {
var o = t[l.charCodeAt(f - 1)] << f % 4 * 2, v = t[l.charCodeAt(f)] >>> 6 - f % 4 * 2, s = o | v;
h[e >>> 2] |= s << 24 - e % 4 * 8, e++;
}
return E.create(h, e);
}
}(), c.enc.Base64url;
});
}(y0)), y0.exports;
}
var k0 = { exports: {} }, Fr;
function t0() {
return Fr || (Fr = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function(x) {
var C = c, E = C.lib, g = E.WordArray, u = E.Hasher, l = C.algo, r = [];
(function() {
for (var v = 0; v < 64; v++)
r[v] = x.abs(x.sin(v + 1)) * 4294967296 | 0;
})();
var t = l.MD5 = u.extend({
_doReset: function() {
this._hash = new g.init([
1732584193,
4023233417,
2562383102,
271733878
]);
},
_doProcessBlock: function(v, s) {
for (var B = 0; B < 16; B++) {
var a = s + B, n = v[a];
v[a] = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360;
}
var i = this._hash.words, p = v[s + 0], A = v[s + 1], D = v[s + 2], _ = v[s + 3], z = v[s + 4], d = v[s + 5], F = v[s + 6], y = v[s + 7], k = v[s + 8], P = v[s + 9], W = v[s + 10], q = v[s + 11], M = v[s + 12], O = v[s + 13], N = v[s + 14], U = v[s + 15], b = i[0], S = i[1], m = i[2], w = i[3];
b = h(b, S, m, w, p, 7, r[0]), w = h(w, b, S, m, A, 12, r[1]), m = h(m, w, b, S, D, 17, r[2]), S = h(S, m, w, b, _, 22, r[3]), b = h(b, S, m, w, z, 7, r[4]), w = h(w, b, S, m, d, 12, r[5]), m = h(m, w, b, S, F, 17, r[6]), S = h(S, m, w, b, y, 22, r[7]), b = h(b, S, m, w, k, 7, r[8]), w = h(w, b, S, m, P, 12, r[9]), m = h(m, w, b, S, W, 17, r[10]), S = h(S, m, w, b, q, 22, r[11]), b = h(b, S, m, w, M, 7, r[12]), w = h(w, b, S, m, O, 12, r[13]), m = h(m, w, b, S, N, 17, r[14]), S = h(S, m, w, b, U, 22, r[15]), b = e(b, S, m, w, A, 5, r[16]), w = e(w, b, S, m, F, 9, r[17]), m = e(m, w, b, S, q, 14, r[18]), S = e(S, m, w, b, p, 20, r[19]), b = e(b, S, m, w, d, 5, r[20]), w = e(w, b, S, m, W, 9, r[21]), m = e(m, w, b, S, U, 14, r[22]), S = e(S, m, w, b, z, 20, r[23]), b = e(b, S, m, w, P, 5, r[24]), w = e(w, b, S, m, N, 9, r[25]), m = e(m, w, b, S, _, 14, r[26]), S = e(S, m, w, b, k, 20, r[27]), b = e(b, S, m, w, O, 5, r[28]), w = e(w, b, S, m, D, 9, r[29]), m = e(m, w, b, S, y, 14, r[30]), S = e(S, m, w, b, M, 20, r[31]), b = f(b, S, m, w, d, 4, r[32]), w = f(w, b, S, m, k, 11, r[33]), m = f(m, w, b, S, q, 16, r[34]), S = f(S, m, w, b, N, 23, r[35]), b = f(b, S, m, w, A, 4, r[36]), w = f(w, b, S, m, z, 11, r[37]), m = f(m, w, b, S, y, 16, r[38]), S = f(S, m, w, b, W, 23, r[39]), b = f(b, S, m, w, O, 4, r[40]), w = f(w, b, S, m, p, 11, r[41]), m = f(m, w, b, S, _, 16, r[42]), S = f(S, m, w, b, F, 23, r[43]), b = f(b, S, m, w, P, 4, r[44]), w = f(w, b, S, m, M, 11, r[45]), m = f(m, w, b, S, U, 16, r[46]), S = f(S, m, w, b, D, 23, r[47]), b = o(b, S, m, w, p, 6, r[48]), w = o(w, b, S, m, y, 10, r[49]), m = o(m, w, b, S, N, 15, r[50]), S = o(S, m, w, b, d, 21, r[51]), b = o(b, S, m, w, M, 6, r[52]), w = o(w, b, S, m, _, 10, r[53]), m = o(m, w, b, S, W, 15, r[54]), S = o(S, m, w, b, A, 21, r[55]), b = o(b, S, m, w, k, 6, r[56]), w = o(w, b, S, m, U, 10, r[57]), m = o(m, w, b, S, F, 15, r[58]), S = o(S, m, w, b, O, 21, r[59]), b = o(b, S, m, w, z, 6, r[60]), w = o(w, b, S, m, q, 10, r[61]), m = o(m, w, b, S, D, 15, r[62]), S = o(S, m, w, b, P, 21, r[63]), i[0] = i[0] + b | 0, i[1] = i[1] + S | 0, i[2] = i[2] + m | 0, i[3] = i[3] + w | 0;
},
_doFinalize: function() {
var v = this._data, s = v.words, B = this._nDataBytes * 8, a = v.sigBytes * 8;
s[a >>> 5] |= 128 << 24 - a % 32;
var n = x.floor(B / 4294967296), i = B;
s[(a + 64 >>> 9 << 4) + 15] = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360, s[(a + 64 >>> 9 << 4) + 14] = (i << 8 | i >>> 24) & 16711935 | (i << 24 | i >>> 8) & 4278255360, v.sigBytes = (s.length + 1) * 4, this._process();
for (var p = this._hash, A = p.words, D = 0; D < 4; D++) {
var _ = A[D];
A[D] = (_ << 8 | _ >>> 24) & 16711935 | (_ << 24 | _ >>> 8) & 4278255360;
}
return p;
},
clone: function() {
var v = u.clone.call(this);
return v._hash = this._hash.clone(), v;
}
});
function h(v, s, B, a, n, i, p) {
var A = v + (s & B | ~s & a) + n + p;
return (A << i | A >>> 32 - i) + s;
}
function e(v, s, B, a, n, i, p) {
var A = v + (s & a | B & ~a) + n + p;
return (A << i | A >>> 32 - i) + s;
}
function f(v, s, B, a, n, i, p) {
var A = v + (s ^ B ^ a) + n + p;
return (A << i | A >>> 32 - i) + s;
}
function o(v, s, B, a, n, i, p) {
var A = v + (B ^ (s | ~a)) + n + p;
return (A << i | A >>> 32 - i) + s;
}
C.MD5 = u._createHelper(t), C.HmacMD5 = u._createHmacHelper(t);
}(Math), c.MD5;
});
}(k0)), k0.exports;
}
var w0 = { exports: {} }, _r;
function Vr() {
return _r || (_r = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function() {
var x = c, C = x.lib, E = C.WordArray, g = C.Hasher, u = x.algo, l = [], r = u.SHA1 = g.extend({
_doReset: function() {
this._hash = new E.init([
1732584193,
4023233417,
2562383102,
271733878,
3285377520
]);
},
_doProcessBlock: function(t, h) {
for (var e = this._hash.words, f = e[0], o = e[1], v = e[2], s = e[3], B = e[4], a = 0; a < 80; a++) {
if (a < 16)
l[a] = t[h + a] | 0;
else {
var n = l[a - 3] ^ l[a - 8] ^ l[a - 14] ^ l[a - 16];
l[a] = n << 1 | n >>> 31;
}
var i = (f << 5 | f >>> 27) + B + l[a];
a < 20 ? i += (o & v | ~o & s) + 1518500249 : a < 40 ? i += (o ^ v ^ s) + 1859775393 : a < 60 ? i += (o & v | o & s | v & s) - 1894007588 : i += (o ^ v ^ s) - 899497514, B = s, s = v, v = o << 30 | o >>> 2, o = f, f = i;
}
e[0] = e[0] + f | 0, e[1] = e[1] + o | 0, e[2] = e[2] + v | 0, e[3] = e[3] + s | 0, e[4] = e[4] + B | 0;
},
_doFinalize: function() {
var t = this._data, h = t.words, e = this._nDataBytes * 8, f = t.sigBytes * 8;
return h[f >>> 5] |= 128 << 24 - f % 32, h[(f + 64 >>> 9 << 4) + 14] = Math.floor(e / 4294967296), h[(f + 64 >>> 9 << 4) + 15] = e, t.sigBytes = h.length * 4, this._process(), this._hash;
},
clone: function() {
var t = g.clone.call(this);
return t._hash = this._hash.clone(), t;
}
});
x.SHA1 = g._createHelper(r), x.HmacSHA1 = g._createHmacHelper(r);
}(), c.SHA1;
});
}(w0)), w0.exports;
}
var S0 = { exports: {} }, br;
function er() {
return br || (br = 1, function(H, R) {
(function(c, x) {
H.exports = x(L());
})(T, function(c) {
return function(x) {
var C = c, E = C.lib, g = E.WordArray, u = E.Hasher, l = C.algo, r = [], t = [];
(function() {
function f(B) {
for (var a = x.sqrt(B), n = 2; n <= a; n++)
if (!(B % n))
return !1;
return !0;
}
function o(B) {
return (B - (B | 0)) * 4294967296 | 0;
}
for (var v = 2, s = 0; s < 64; )
f(v) && (s < 8 && (r[s] = o(x.pow(v, 1 / 2))), t[s] = o(x.pow(v, 1 / 3)), s++), v++;
})();
var h = [], e = l.SHA256 = u.extend({
_doReset: function() {
this._hash = new g.init(r.slice(0));
},
_doProcessBlock: function(f, o) {
for (var v = this._hash.words, s = v[0], B = v[1], a = v[2], n = v[3], i = v[4], p = v[5], A = v[6], D = v[7], _ = 0; _ < 64; _++) {
if (_ < 16)
h[_] = f[o + _] | 0;
else {
var z = h[_ - 15], d = (z << 25 | z >>> 7) ^ (z << 14 | z >>> 18) ^ z >>> 3, F = h[_ - 2], y = (F << 15 | F >>> 17) ^ (F << 13 | F >>> 19) ^ F >>> 10;
h[_] = d + h[_ - 7] + y + h[_ - 16];
}
var k = i & p ^ ~i & A, P = s & B ^ s & a ^ B & a, W = (s << 30 | s >>> 2) ^ (s << 19 | s >>> 13) ^ (s << 10 | s >>> 22), q = (i << 26 | i >>> 6) ^ (i << 21 | i >>> 11) ^ (i << 7 | i >>> 25), M = D + q + k + t[_] + h[_], O = W + P;
D = A, A = p, p = i, i = n + M | 0, n = a, a = B, B = s, s = M + O | 0;
}
v[0] = v[0] + s | 0, v[1] = v[1] + B | 0, v[2] = v[2] + a | 0, v[3] = v[3] + n | 0, v[4] = v[4] + i | 0, v[5] = v[5] + p | 0, v[6] = v[6] + A | 0, v[7] = v[7] + D | 0;
},
_doFinalize: function() {
var f = this._data, o = f.words, v = this._nDataBytes * 8, s = f.sigBytes * 8;
return o[s >>> 5] |= 128 << 24 - s % 32, o[(s + 64 >>> 9 << 4) + 14] = x.floor(v / 4294967296), o[(s + 64 >>> 9 << 4) + 15] = v, f.sigBytes = o.length * 4, this._process(), this._hash;
},
clone: function() {
var f = u.clone.call(this);
return f._hash = this._hash.clone(), f;
}
});
C.SHA256 = u._createHelper(e), C.HmacSHA256 = u._createHmacHelper(e);
}(Math), c.SHA256;
});
}(S0)), S0.exports;
}
var m0 = { exports: {} }, gr;
function bx() {
return gr || (gr = 1, function(H, R) {
(function(c, x, C) {
H.exports = x(L(), er());
})(T, function(c) {
return function() {
var x = c, C = x.lib, E = C.WordArray, g = x.algo, u = g.SHA256, l = g.SHA224 = u.extend({
_doReset: function() {
this._hash = new E.init([
3238371032,
914150663,
812702999,
4144912697,
4290775857,
1750603025,
1694076839,
3204075428
]);
},
_doFinalize: function() {
var r = u._doFinalize.call(this);
return r.sigBytes -= 4, r;
}
});
x.SHA224 = u._createHelper(l), x.HmacSHA224 = u._createHmacHelper(l);
}(), c.SHA224;
});
}(m0)), m0.exports;
}
var H0 = { exports: {} }, yr;
function Jr() {
return yr || (yr = 1, function(H, R) {
(function(c, x, C) {
H.exports = x(L(), A0());
})(T, function(c) {
return function() {
var x = c, C = x.lib, E = C.Hasher, g = x.x64, u = g.Word, l = g.WordArray, r = x.algo;
function t() {
return u.create.apply(u, arguments);
}
var h = [
t(1116352408, 3609767458),
t(1899447441, 602891725),
t(3049323471, 3964484399),
t(3921009573, 2173295548),
t(961987163, 4081628472),
t(1508970993, 3053834265),
t(2453635748, 2937671579),
t(2870763221, 3664609560),
t(3624381080, 2734883394),
t(310598401, 1164996542),
t(607225278, 1323610764),
t(1426881987, 3590304994),
t(1925078388, 4068182383),
t(2162078206, 991336113),
t(2614888103, 633803317),
t(3248222580, 3479774868),
t(3835390401, 2666613458),
t(4022224774, 944711139),
t(264347078, 2341262773),
t(604807628, 2007800933),
t(770255983, 1495990901),
t(1249150122, 1856431235),
t(1555081692, 3175218132),
t(1996064986, 2198950837),
t(2554220882, 3999719339),
t(2821834349, 766784016),
t(2952996808, 2566594879),
t(3210313671, 3203337956),
t(3336571891, 1034457026),
t(3584528711, 2466948901),
t(113926993, 3758326383),
t(338241895, 168717936),
t(666307205, 1188179964),
t(773529912, 1546045734),
t(1294757372, 1522805485),
t(1396182291, 2643833823),
t(1695183700, 2343527390),
t(1986661051, 1014477480),
t(2177026350, 1206759142),
t(2456956037, 344077627),
t(2730485921, 1290863460),
t(2820302411, 3158454273),
t(3259730800, 3505952657),
t(3345764771, 106217008),
t(3516065817, 3606008344),
t(3600352804, 1432725776),
t(4094571909, 1467031594),
t(275423344, 851169720),
t(430227734, 3100823752),
t(506948616, 1363258195),
t(659060556, 3750685593),
t(883997877, 3785050280),
t(958139571, 3318307427),
t(1322822218, 3812723403),
t(1537002063, 2003034995),
t(1747873779, 3602036899),
t(1955562222, 1575990012),
t(2024104815, 1125592928),
t(2227730452, 2716904306),
t(2361852424, 442776044),
t(2428436474, 593698344),
t(2756734187, 3733110249),
t(3204031479, 2999351573),
t(3329325298, 3815920427),
t(3391569614, 3928383900),
t(3515267271, 566280711),
t(3940187606, 3454069534),
t(4118630271, 4000239992),
t(116418474, 1914138554),
t(174292421, 2731055270),
t(289380356, 3203993006),
t(460393269, 320620315),
t(685471733, 587496836),
t(852142971, 1086792851),
t(1017036298, 365543100),
t(1126000580, 2618297676),
t(1288033470, 3409855158),
t(1501505948, 4234509866),
t(1607167915, 987167468),
t(1816402316, 1246189591)
], e = [];
(function() {
for (var o = 0; o < 80; o++)
e[o] = t();
})();
var f = r.SHA512 = E.extend({
_doReset: function() {
this._hash = new l.init([
new u.init(1779033703, 4089235720),
new u.init(3144134277, 2227873595),
new u.init(1013904242, 4271175723),
new u.init(2773480762, 1595750129),
new u.init(1359893119, 2917565137),
new u.init(2600822924, 725511199),
new u.init(528734635, 4215389547),