sqsdk-utils
Version:
双旗sdk业务工具包
1,384 lines (1,383 loc) • 263 kB
JavaScript
import Fr from "axios";
import { showLoadingToast as br, showFailToast as C0 } from "vant-sq";
import "vant-sq/es/toast/style";
const Gn = (n) => (n.install = (e) => {
const t = n.name || n.__name;
e.component(t, n);
}, n);
/*! js-cookie v3.0.5 | MIT */
function V0(n) {
for (var e = 1; e < arguments.length; e++) {
var t = arguments[e];
for (var r in t)
n[r] = t[r];
}
return n;
}
var mr = {
read: function(n) {
return n[0] === '"' && (n = n.slice(1, -1)), n.replace(/(%[\dA-F]{2})+/gi, decodeURIComponent);
},
write: function(n) {
return encodeURIComponent(n).replace(
/%(2[346BF]|3[AC-F]|40|5[BDE]|60|7[BCD])/g,
decodeURIComponent
);
}
};
function Vt(n, e) {
function t(i, s, x) {
if (!(typeof document > "u")) {
x = V0({}, e, x), typeof x.expires == "number" && (x.expires = new Date(Date.now() + x.expires * 864e5)), x.expires && (x.expires = x.expires.toUTCString()), i = encodeURIComponent(i).replace(/%(2[346B]|5E|60|7C)/g, decodeURIComponent).replace(/[()]/g, escape);
var o = "";
for (var u in x)
x[u] && (o += "; " + u, x[u] !== !0 && (o += "=" + x[u].split(";")[0]));
return document.cookie = i + "=" + n.write(s, i) + o;
}
}
function r(i) {
if (!(typeof document > "u" || arguments.length && !i)) {
for (var s = document.cookie ? document.cookie.split("; ") : [], x = {}, o = 0; o < s.length; o++) {
var u = s[o].split("="), a = u.slice(1).join("=");
try {
var c = decodeURIComponent(u[0]);
if (x[c] = n.read(a, c), i === c)
break;
} catch {
}
}
return i ? x[i] : x;
}
}
return Object.create(
{
set: t,
get: r,
remove: function(i, s) {
t(
i,
"",
V0({}, s, {
expires: -1
})
);
},
withAttributes: function(i) {
return Vt(this.converter, V0({}, this.attributes, i));
},
withConverter: function(i) {
return Vt(V0({}, this.converter, i), this.attributes);
}
},
{
attributes: { value: Object.freeze(e) },
converter: { value: Object.freeze(n) }
}
);
}
var f0 = Vt(mr, { path: "/" });
const Mt = "vue3_h5_template_";
function Zn(n) {
return f0.get(`${Mt}${n}`);
}
function $n(n, e) {
f0.set(`${Mt}${n}`, e, { expires: 30 });
}
function Xn(n) {
return f0.remove(`${Mt}${n}`);
}
const Kt = "Admin-Token", jt = "Admin-Expires-In";
function ae() {
return f0.get(Kt);
}
function Qn(n) {
return f0.set(Kt, n);
}
function Yn() {
return f0.remove(Kt);
}
function Jn() {
return f0.get(jt) || -1;
}
function ti(n) {
return f0.set(jt, n);
}
function ei() {
return f0.remove(jt);
}
function Sr(n) {
let e = "";
for (const t of Object.keys(n)) {
const r = n[t], i = `${encodeURIComponent(t)}=`;
if (r !== null && r !== "" && typeof r < "u")
if (typeof r == "object") {
for (const s of Object.keys(r))
if (r[s] !== null && r[s] !== "" && typeof r[s] < "u") {
const x = `${t}[${s}]`, o = `${encodeURIComponent(x)}=`;
e += `${o + encodeURIComponent(r[s])}&`;
}
} else
e += `${i + encodeURIComponent(r)}&`;
}
return e;
}
var N = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
function rr(n) {
return n && n.__esModule && Object.prototype.hasOwnProperty.call(n, "default") ? n.default : n;
}
function _r(n) {
if (n.__esModule) return n;
var e = n.default;
if (typeof e == "function") {
var t = function r() {
return this instanceof r ? Reflect.construct(e, arguments, this.constructor) : e.apply(this, arguments);
};
t.prototype = e.prototype;
} else t = {};
return Object.defineProperty(t, "__esModule", { value: !0 }), Object.keys(n).forEach(function(r) {
var i = Object.getOwnPropertyDescriptor(n, r);
Object.defineProperty(t, r, i.get ? i : {
enumerable: !0,
get: function() {
return n[r];
}
});
}), t;
}
var nr = { exports: {} };
function wr(n) {
throw new Error('Could not dynamically require "' + n + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
}
var tt = { exports: {} };
const Tr = {}, Rr = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
__proto__: null,
default: Tr
}, Symbol.toStringTag, { value: "Module" })), kr = /* @__PURE__ */ _r(Rr);
var xe;
function U() {
return xe || (xe = 1, function(n, e) {
(function(t, r) {
n.exports = r();
})(N, function() {
var t = t || function(r, i) {
var s;
if (typeof window < "u" && window.crypto && (s = window.crypto), typeof self < "u" && self.crypto && (s = self.crypto), typeof globalThis < "u" && globalThis.crypto && (s = globalThis.crypto), !s && typeof window < "u" && window.msCrypto && (s = window.msCrypto), !s && typeof N < "u" && N.crypto && (s = N.crypto), !s && typeof wr == "function")
try {
s = kr;
} catch {
}
var x = function() {
if (s) {
if (typeof s.getRandomValues == "function")
try {
return s.getRandomValues(new Uint32Array(1))[0];
} catch {
}
if (typeof s.randomBytes == "function")
try {
return s.randomBytes(4).readInt32LE();
} catch {
}
}
throw new Error("Native crypto module could not be used to get secure random number.");
}, o = Object.create || /* @__PURE__ */ function() {
function d() {
}
return function(p) {
var B;
return d.prototype = p, B = new d(), d.prototype = null, B;
};
}(), u = {}, a = u.lib = {}, c = a.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(d) {
var p = o(this);
return d && p.mixIn(d), (!p.hasOwnProperty("init") || this.init === p.init) && (p.init = function() {
p.$super.init.apply(this, arguments);
}), p.init.prototype = p, p.$super = this, p;
},
/**
* 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 d = this.extend();
return d.init.apply(d, arguments), d;
},
/**
* 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(d) {
for (var p in d)
d.hasOwnProperty(p) && (this[p] = d[p]);
d.hasOwnProperty("toString") && (this.toString = d.toString);
},
/**
* Creates a copy of this object.
*
* @return {Object} The clone.
*
* @example
*
* var clone = instance.clone();
*/
clone: function() {
return this.init.prototype.extend(this);
}
};
}(), E = a.WordArray = c.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(d, p) {
d = this.words = d || [], p != i ? this.sigBytes = p : this.sigBytes = d.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(d) {
return (d || g).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(d) {
var p = this.words, B = d.words, C = this.sigBytes, D = d.sigBytes;
if (this.clamp(), C % 4)
for (var F = 0; F < D; F++) {
var m = B[F >>> 2] >>> 24 - F % 4 * 8 & 255;
p[C + F >>> 2] |= m << 24 - (C + F) % 4 * 8;
}
else
for (var O = 0; O < D; O += 4)
p[C + O >>> 2] = B[O >>> 2];
return this.sigBytes += D, this;
},
/**
* Removes insignificant bits.
*
* @example
*
* wordArray.clamp();
*/
clamp: function() {
var d = this.words, p = this.sigBytes;
d[p >>> 2] &= 4294967295 << 32 - p % 4 * 8, d.length = r.ceil(p / 4);
},
/**
* Creates a copy of this word array.
*
* @return {WordArray} The clone.
*
* @example
*
* var clone = wordArray.clone();
*/
clone: function() {
var d = c.clone.call(this);
return d.words = this.words.slice(0), d;
},
/**
* 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(d) {
for (var p = [], B = 0; B < d; B += 4)
p.push(x());
return new E.init(p, d);
}
}), h = u.enc = {}, g = h.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(d) {
for (var p = d.words, B = d.sigBytes, C = [], D = 0; D < B; D++) {
var F = p[D >>> 2] >>> 24 - D % 4 * 8 & 255;
C.push((F >>> 4).toString(16)), C.push((F & 15).toString(16));
}
return C.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(d) {
for (var p = d.length, B = [], C = 0; C < p; C += 2)
B[C >>> 3] |= parseInt(d.substr(C, 2), 16) << 24 - C % 8 * 4;
return new E.init(B, p / 2);
}
}, f = h.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(d) {
for (var p = d.words, B = d.sigBytes, C = [], D = 0; D < B; D++) {
var F = p[D >>> 2] >>> 24 - D % 4 * 8 & 255;
C.push(String.fromCharCode(F));
}
return C.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(d) {
for (var p = d.length, B = [], C = 0; C < p; C++)
B[C >>> 2] |= (d.charCodeAt(C) & 255) << 24 - C % 4 * 8;
return new E.init(B, p);
}
}, v = h.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(d) {
try {
return decodeURIComponent(escape(f.stringify(d)));
} 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(d) {
return f.parse(unescape(encodeURIComponent(d)));
}
}, l = a.BufferedBlockAlgorithm = c.extend({
/**
* Resets this block algorithm's data buffer to its initial state.
*
* @example
*
* bufferedBlockAlgorithm.reset();
*/
reset: function() {
this._data = new E.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(d) {
typeof d == "string" && (d = v.parse(d)), this._data.concat(d), this._nDataBytes += d.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(d) {
var p, B = this._data, C = B.words, D = B.sigBytes, F = this.blockSize, m = F * 4, O = D / m;
d ? O = r.ceil(O) : O = r.max((O | 0) - this._minBufferSize, 0);
var y = O * F, b = r.min(y * 4, D);
if (y) {
for (var T = 0; T < y; T += F)
this._doProcessBlock(C, T);
p = C.splice(0, y), B.sigBytes -= b;
}
return new E.init(p, b);
},
/**
* Creates a copy of this object.
*
* @return {Object} The clone.
*
* @example
*
* var clone = bufferedBlockAlgorithm.clone();
*/
clone: function() {
var d = c.clone.call(this);
return d._data = this._data.clone(), d;
},
_minBufferSize: 0
});
a.Hasher = l.extend({
/**
* Configuration options.
*/
cfg: c.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(d) {
this.cfg = this.cfg.extend(d), this.reset();
},
/**
* Resets this hasher to its initial state.
*
* @example
*
* hasher.reset();
*/
reset: function() {
l.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(d) {
return this._append(d), 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(d) {
d && this._append(d);
var p = this._doFinalize();
return p;
},
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(d) {
return function(p, B) {
return new d.init(B).finalize(p);
};
},
/**
* 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(d) {
return function(p, B) {
return new A.HMAC.init(d, B).finalize(p);
};
}
});
var A = u.algo = {};
return u;
}(Math);
return t;
});
}(tt)), tt.exports;
}
var et = { exports: {} }, fe;
function X0() {
return fe || (fe = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function(r) {
var i = t, s = i.lib, x = s.Base, o = s.WordArray, u = i.x64 = {};
u.Word = x.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(a, c) {
this.high = a, this.low = c;
}
/**
* 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);
// }
}), u.WordArray = x.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(a, c) {
a = this.words = a || [], c != r ? this.sigBytes = c : this.sigBytes = a.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 a = this.words, c = a.length, E = [], h = 0; h < c; h++) {
var g = a[h];
E.push(g.high), E.push(g.low);
}
return o.create(E, this.sigBytes);
},
/**
* Creates a copy of this word array.
*
* @return {X64WordArray} The clone.
*
* @example
*
* var clone = x64WordArray.clone();
*/
clone: function() {
for (var a = x.clone.call(this), c = a.words = this.words.slice(0), E = c.length, h = 0; h < E; h++)
c[h] = c[h].clone();
return a;
}
});
}(), t;
});
}(et)), et.exports;
}
var rt = { exports: {} }, ce;
function Or() {
return ce || (ce = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function() {
if (typeof ArrayBuffer == "function") {
var r = t, i = r.lib, s = i.WordArray, x = s.init, o = s.init = function(u) {
if (u instanceof ArrayBuffer && (u = new Uint8Array(u)), (u instanceof Int8Array || typeof Uint8ClampedArray < "u" && u instanceof Uint8ClampedArray || u instanceof Int16Array || u instanceof Uint16Array || u instanceof Int32Array || u instanceof Uint32Array || u instanceof Float32Array || u instanceof Float64Array) && (u = new Uint8Array(u.buffer, u.byteOffset, u.byteLength)), u instanceof Uint8Array) {
for (var a = u.byteLength, c = [], E = 0; E < a; E++)
c[E >>> 2] |= u[E] << 24 - E % 4 * 8;
x.call(this, c, a);
} else
x.apply(this, arguments);
};
o.prototype = s;
}
}(), t.lib.WordArray;
});
}(rt)), rt.exports;
}
var nt = { exports: {} }, ue;
function Hr() {
return ue || (ue = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function() {
var r = t, i = r.lib, s = i.WordArray, x = r.enc;
x.Utf16 = x.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(u) {
for (var a = u.words, c = u.sigBytes, E = [], h = 0; h < c; h += 2) {
var g = a[h >>> 2] >>> 16 - h % 4 * 8 & 65535;
E.push(String.fromCharCode(g));
}
return E.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(u) {
for (var a = u.length, c = [], E = 0; E < a; E++)
c[E >>> 1] |= u.charCodeAt(E) << 16 - E % 2 * 16;
return s.create(c, a * 2);
}
}, x.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(u) {
for (var a = u.words, c = u.sigBytes, E = [], h = 0; h < c; h += 2) {
var g = o(a[h >>> 2] >>> 16 - h % 4 * 8 & 65535);
E.push(String.fromCharCode(g));
}
return E.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(u) {
for (var a = u.length, c = [], E = 0; E < a; E++)
c[E >>> 1] |= o(u.charCodeAt(E) << 16 - E % 2 * 16);
return s.create(c, a * 2);
}
};
function o(u) {
return u << 8 & 4278255360 | u >>> 8 & 16711935;
}
}(), t.enc.Utf16;
});
}(nt)), nt.exports;
}
var it = { exports: {} }, he;
function B0() {
return he || (he = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function() {
var r = t, i = r.lib, s = i.WordArray, x = r.enc;
x.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(u) {
var a = u.words, c = u.sigBytes, E = this._map;
u.clamp();
for (var h = [], g = 0; g < c; g += 3)
for (var f = a[g >>> 2] >>> 24 - g % 4 * 8 & 255, v = a[g + 1 >>> 2] >>> 24 - (g + 1) % 4 * 8 & 255, l = a[g + 2 >>> 2] >>> 24 - (g + 2) % 4 * 8 & 255, A = f << 16 | v << 8 | l, d = 0; d < 4 && g + d * 0.75 < c; d++)
h.push(E.charAt(A >>> 6 * (3 - d) & 63));
var p = E.charAt(64);
if (p)
for (; h.length % 4; )
h.push(p);
return h.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(u) {
var a = u.length, c = this._map, E = this._reverseMap;
if (!E) {
E = this._reverseMap = [];
for (var h = 0; h < c.length; h++)
E[c.charCodeAt(h)] = h;
}
var g = c.charAt(64);
if (g) {
var f = u.indexOf(g);
f !== -1 && (a = f);
}
return o(u, a, E);
},
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
};
function o(u, a, c) {
for (var E = [], h = 0, g = 0; g < a; g++)
if (g % 4) {
var f = c[u.charCodeAt(g - 1)] << g % 4 * 2, v = c[u.charCodeAt(g)] >>> 6 - g % 4 * 2, l = f | v;
E[h >>> 2] |= l << 24 - h % 4 * 8, h++;
}
return s.create(E, h);
}
}(), t.enc.Base64;
});
}(it)), it.exports;
}
var st = { exports: {} }, le;
function Ir() {
return le || (le = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function() {
var r = t, i = r.lib, s = i.WordArray, x = r.enc;
x.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(u, a) {
a === void 0 && (a = !0);
var c = u.words, E = u.sigBytes, h = a ? this._safe_map : this._map;
u.clamp();
for (var g = [], f = 0; f < E; f += 3)
for (var v = c[f >>> 2] >>> 24 - f % 4 * 8 & 255, l = c[f + 1 >>> 2] >>> 24 - (f + 1) % 4 * 8 & 255, A = c[f + 2 >>> 2] >>> 24 - (f + 2) % 4 * 8 & 255, d = v << 16 | l << 8 | A, p = 0; p < 4 && f + p * 0.75 < E; p++)
g.push(h.charAt(d >>> 6 * (3 - p) & 63));
var B = h.charAt(64);
if (B)
for (; g.length % 4; )
g.push(B);
return g.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(u, a) {
a === void 0 && (a = !0);
var c = u.length, E = a ? this._safe_map : this._map, h = this._reverseMap;
if (!h) {
h = this._reverseMap = [];
for (var g = 0; g < E.length; g++)
h[E.charCodeAt(g)] = g;
}
var f = E.charAt(64);
if (f) {
var v = u.indexOf(f);
v !== -1 && (c = v);
}
return o(u, c, h);
},
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
_safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
};
function o(u, a, c) {
for (var E = [], h = 0, g = 0; g < a; g++)
if (g % 4) {
var f = c[u.charCodeAt(g - 1)] << g % 4 * 2, v = c[u.charCodeAt(g)] >>> 6 - g % 4 * 2, l = f | v;
E[h >>> 2] |= l << 24 - h % 4 * 8, h++;
}
return s.create(E, h);
}
}(), t.enc.Base64url;
});
}(st)), st.exports;
}
var ot = { exports: {} }, ve;
function E0() {
return ve || (ve = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function(r) {
var i = t, s = i.lib, x = s.WordArray, o = s.Hasher, u = i.algo, a = [];
(function() {
for (var v = 0; v < 64; v++)
a[v] = r.abs(r.sin(v + 1)) * 4294967296 | 0;
})();
var c = u.MD5 = o.extend({
_doReset: function() {
this._hash = new x.init([
1732584193,
4023233417,
2562383102,
271733878
]);
},
_doProcessBlock: function(v, l) {
for (var A = 0; A < 16; A++) {
var d = l + A, p = v[d];
v[d] = (p << 8 | p >>> 24) & 16711935 | (p << 24 | p >>> 8) & 4278255360;
}
var B = this._hash.words, C = v[l + 0], D = v[l + 1], F = v[l + 2], m = v[l + 3], O = v[l + 4], y = v[l + 5], b = v[l + 6], T = v[l + 7], w = v[l + 8], I = v[l + 9], P = v[l + 10], z = v[l + 11], G = v[l + 12], M = v[l + 13], j = v[l + 14], K = v[l + 15], _ = B[0], k = B[1], H = B[2], R = B[3];
_ = E(_, k, H, R, C, 7, a[0]), R = E(R, _, k, H, D, 12, a[1]), H = E(H, R, _, k, F, 17, a[2]), k = E(k, H, R, _, m, 22, a[3]), _ = E(_, k, H, R, O, 7, a[4]), R = E(R, _, k, H, y, 12, a[5]), H = E(H, R, _, k, b, 17, a[6]), k = E(k, H, R, _, T, 22, a[7]), _ = E(_, k, H, R, w, 7, a[8]), R = E(R, _, k, H, I, 12, a[9]), H = E(H, R, _, k, P, 17, a[10]), k = E(k, H, R, _, z, 22, a[11]), _ = E(_, k, H, R, G, 7, a[12]), R = E(R, _, k, H, M, 12, a[13]), H = E(H, R, _, k, j, 17, a[14]), k = E(k, H, R, _, K, 22, a[15]), _ = h(_, k, H, R, D, 5, a[16]), R = h(R, _, k, H, b, 9, a[17]), H = h(H, R, _, k, z, 14, a[18]), k = h(k, H, R, _, C, 20, a[19]), _ = h(_, k, H, R, y, 5, a[20]), R = h(R, _, k, H, P, 9, a[21]), H = h(H, R, _, k, K, 14, a[22]), k = h(k, H, R, _, O, 20, a[23]), _ = h(_, k, H, R, I, 5, a[24]), R = h(R, _, k, H, j, 9, a[25]), H = h(H, R, _, k, m, 14, a[26]), k = h(k, H, R, _, w, 20, a[27]), _ = h(_, k, H, R, M, 5, a[28]), R = h(R, _, k, H, F, 9, a[29]), H = h(H, R, _, k, T, 14, a[30]), k = h(k, H, R, _, G, 20, a[31]), _ = g(_, k, H, R, y, 4, a[32]), R = g(R, _, k, H, w, 11, a[33]), H = g(H, R, _, k, z, 16, a[34]), k = g(k, H, R, _, j, 23, a[35]), _ = g(_, k, H, R, D, 4, a[36]), R = g(R, _, k, H, O, 11, a[37]), H = g(H, R, _, k, T, 16, a[38]), k = g(k, H, R, _, P, 23, a[39]), _ = g(_, k, H, R, M, 4, a[40]), R = g(R, _, k, H, C, 11, a[41]), H = g(H, R, _, k, m, 16, a[42]), k = g(k, H, R, _, b, 23, a[43]), _ = g(_, k, H, R, I, 4, a[44]), R = g(R, _, k, H, G, 11, a[45]), H = g(H, R, _, k, K, 16, a[46]), k = g(k, H, R, _, F, 23, a[47]), _ = f(_, k, H, R, C, 6, a[48]), R = f(R, _, k, H, T, 10, a[49]), H = f(H, R, _, k, j, 15, a[50]), k = f(k, H, R, _, y, 21, a[51]), _ = f(_, k, H, R, G, 6, a[52]), R = f(R, _, k, H, m, 10, a[53]), H = f(H, R, _, k, P, 15, a[54]), k = f(k, H, R, _, D, 21, a[55]), _ = f(_, k, H, R, w, 6, a[56]), R = f(R, _, k, H, K, 10, a[57]), H = f(H, R, _, k, b, 15, a[58]), k = f(k, H, R, _, M, 21, a[59]), _ = f(_, k, H, R, O, 6, a[60]), R = f(R, _, k, H, z, 10, a[61]), H = f(H, R, _, k, F, 15, a[62]), k = f(k, H, R, _, I, 21, a[63]), B[0] = B[0] + _ | 0, B[1] = B[1] + k | 0, B[2] = B[2] + H | 0, B[3] = B[3] + R | 0;
},
_doFinalize: function() {
var v = this._data, l = v.words, A = this._nDataBytes * 8, d = v.sigBytes * 8;
l[d >>> 5] |= 128 << 24 - d % 32;
var p = r.floor(A / 4294967296), B = A;
l[(d + 64 >>> 9 << 4) + 15] = (p << 8 | p >>> 24) & 16711935 | (p << 24 | p >>> 8) & 4278255360, l[(d + 64 >>> 9 << 4) + 14] = (B << 8 | B >>> 24) & 16711935 | (B << 24 | B >>> 8) & 4278255360, v.sigBytes = (l.length + 1) * 4, this._process();
for (var C = this._hash, D = C.words, F = 0; F < 4; F++) {
var m = D[F];
D[F] = (m << 8 | m >>> 24) & 16711935 | (m << 24 | m >>> 8) & 4278255360;
}
return C;
},
clone: function() {
var v = o.clone.call(this);
return v._hash = this._hash.clone(), v;
}
});
function E(v, l, A, d, p, B, C) {
var D = v + (l & A | ~l & d) + p + C;
return (D << B | D >>> 32 - B) + l;
}
function h(v, l, A, d, p, B, C) {
var D = v + (l & d | A & ~d) + p + C;
return (D << B | D >>> 32 - B) + l;
}
function g(v, l, A, d, p, B, C) {
var D = v + (l ^ A ^ d) + p + C;
return (D << B | D >>> 32 - B) + l;
}
function f(v, l, A, d, p, B, C) {
var D = v + (A ^ (l | ~d)) + p + C;
return (D << B | D >>> 32 - B) + l;
}
i.MD5 = o._createHelper(c), i.HmacMD5 = o._createHmacHelper(c);
}(Math), t.MD5;
});
}(ot)), ot.exports;
}
var at = { exports: {} }, de;
function ir() {
return de || (de = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function() {
var r = t, i = r.lib, s = i.WordArray, x = i.Hasher, o = r.algo, u = [], a = o.SHA1 = x.extend({
_doReset: function() {
this._hash = new s.init([
1732584193,
4023233417,
2562383102,
271733878,
3285377520
]);
},
_doProcessBlock: function(c, E) {
for (var h = this._hash.words, g = h[0], f = h[1], v = h[2], l = h[3], A = h[4], d = 0; d < 80; d++) {
if (d < 16)
u[d] = c[E + d] | 0;
else {
var p = u[d - 3] ^ u[d - 8] ^ u[d - 14] ^ u[d - 16];
u[d] = p << 1 | p >>> 31;
}
var B = (g << 5 | g >>> 27) + A + u[d];
d < 20 ? B += (f & v | ~f & l) + 1518500249 : d < 40 ? B += (f ^ v ^ l) + 1859775393 : d < 60 ? B += (f & v | f & l | v & l) - 1894007588 : B += (f ^ v ^ l) - 899497514, A = l, l = v, v = f << 30 | f >>> 2, f = g, g = B;
}
h[0] = h[0] + g | 0, h[1] = h[1] + f | 0, h[2] = h[2] + v | 0, h[3] = h[3] + l | 0, h[4] = h[4] + A | 0;
},
_doFinalize: function() {
var c = this._data, E = c.words, h = this._nDataBytes * 8, g = c.sigBytes * 8;
return E[g >>> 5] |= 128 << 24 - g % 32, E[(g + 64 >>> 9 << 4) + 14] = Math.floor(h / 4294967296), E[(g + 64 >>> 9 << 4) + 15] = h, c.sigBytes = E.length * 4, this._process(), this._hash;
},
clone: function() {
var c = x.clone.call(this);
return c._hash = this._hash.clone(), c;
}
});
r.SHA1 = x._createHelper(a), r.HmacSHA1 = x._createHmacHelper(a);
}(), t.SHA1;
});
}(at)), at.exports;
}
var xt = { exports: {} }, pe;
function Wt() {
return pe || (pe = 1, function(n, e) {
(function(t, r) {
n.exports = r(U());
})(N, function(t) {
return function(r) {
var i = t, s = i.lib, x = s.WordArray, o = s.Hasher, u = i.algo, a = [], c = [];
(function() {
function g(A) {
for (var d = r.sqrt(A), p = 2; p <= d; p++)
if (!(A % p))
return !1;
return !0;
}
function f(A) {
return (A - (A | 0)) * 4294967296 | 0;
}
for (var v = 2, l = 0; l < 64; )
g(v) && (l < 8 && (a[l] = f(r.pow(v, 1 / 2))), c[l] = f(r.pow(v, 1 / 3)), l++), v++;
})();
var E = [], h = u.SHA256 = o.extend({
_doReset: function() {
this._hash = new x.init(a.slice(0));
},
_doProcessBlock: function(g, f) {
for (var v = this._hash.words, l = v[0], A = v[1], d = v[2], p = v[3], B = v[4], C = v[5], D = v[6], F = v[7], m = 0; m < 64; m++) {
if (m < 16)
E[m] = g[f + m] | 0;
else {
var O = E[m - 15], y = (O << 25 | O >>> 7) ^ (O << 14 | O >>> 18) ^ O >>> 3, b = E[m - 2], T = (b << 15 | b >>> 17) ^ (b << 13 | b >>> 19) ^ b >>> 10;
E[m] = y + E[m - 7] + T + E[m - 16];
}
var w = B & C ^ ~B & D, I = l & A ^ l & d ^ A & d, P = (l << 30 | l >>> 2) ^ (l << 19 | l >>> 13) ^ (l << 10 | l >>> 22), z = (B << 26 | B >>> 6) ^ (B << 21 | B >>> 11) ^ (B << 7 | B >>> 25), G = F + z + w + c[m] + E[m], M = P + I;
F = D, D = C, C = B, B = p + G | 0, p = d, d = A, A = l, l = G + M | 0;
}
v[0] = v[0] + l | 0, v[1] = v[1] + A | 0, v[2] = v[2] + d | 0, v[3] = v[3] + p | 0, v[4] = v[4] + B | 0, v[5] = v[5] + C | 0, v[6] = v[6] + D | 0, v[7] = v[7] + F | 0;
},
_doFinalize: function() {
var g = this._data, f = g.words, v = this._nDataBytes * 8, l = g.sigBytes * 8;
return f[l >>> 5] |= 128 << 24 - l % 32, f[(l + 64 >>> 9 << 4) + 14] = r.floor(v / 4294967296), f[(l + 64 >>> 9 << 4) + 15] = v, g.sigBytes = f.length * 4, this._process(), this._hash;
},
clone: function() {
var g = o.clone.call(this);
return g._hash = this._hash.clone(), g;
}
});
i.SHA256 = o._createHelper(h), i.HmacSHA256 = o._createHmacHelper(h);
}(Math), t.SHA256;
});
}(xt)), xt.exports;
}
var ft = { exports: {} }, ge;
function Pr() {
return ge || (ge = 1, function(n, e) {
(function(t, r, i) {
n.exports = r(U(), Wt());
})(N, function(t) {
return function() {
var r = t, i = r.lib, s = i.WordArray, x = r.algo, o = x.SHA256, u = x.SHA224 = o.extend({
_doReset: function() {
this._hash = new s.init([
3238371032,
914150663,
812702999,
4144912697,
4290775857,
1750603025,
1694076839,
3204075428
]);
},
_doFinalize: function() {
var a = o._doFinalize.call(this);
return a.sigBytes -= 4, a;
}
});
r.SHA224 = o._createHelper(u), r.HmacSHA224 = o._createHmacHelper(u);
}(), t.SHA224;
});
}(ft)), ft.exports;
}
var ct = { exports: {} }, Be;
function sr() {
return Be || (Be = 1, function(n, e) {
(function(t, r, i) {
n.exports = r(U(), X0());
})(N, function(t) {
return function() {
var r = t, i = r.lib, s = i.Hasher, x = r.x64, o = x.Word, u = x.WordArray, a = r.algo;
function c() {
return o.create.apply(o, arguments);
}
var E = [
c(1116352408, 3609767458),
c(1899447441, 602891725),
c(3049323471, 3964484399),
c(3921009573, 2173295548),
c(961987163, 4081628472),
c(1508970993, 3053834265),
c(2453635748, 2937671579),
c(2870763221, 3664609560),
c(3624381080, 2734883394),
c(310598401, 1164996542),
c(607225278, 1323610764),
c(1426881987, 3590304994),
c(1925078388, 4068182383),
c(2162078206, 991336113),
c(2614888103, 633803317),
c(3248222580, 3479774868),
c(3835390401, 2666613458),
c(4022224774, 944711139),
c(264347078, 2341262773),
c(604807628, 2007800933),