epps
Version:
Enhances Pinia stores with advanced features such as persistence, encryption, and store extension. Simplifies state management and ensures data security for Vue.js and Nuxt applications.
1,340 lines (1,339 loc) • 231 kB
JavaScript
var Pn = Object.defineProperty;
var Hn = (e, r, t) => r in e ? Pn(e, r, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[r] = t;
var M = (e, r, t) => Hn(e, typeof r != "symbol" ? r + "" : r, t);
import { defineStore as mr } from "pinia";
var et = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
function Nn(e) {
return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
}
function On(e) {
if (Object.prototype.hasOwnProperty.call(e, "__esModule")) return e;
var r = e.default;
if (typeof r == "function") {
var t = function n() {
return this instanceof n ? Reflect.construct(r, arguments, this.constructor) : r.apply(this, arguments);
};
t.prototype = r.prototype;
} else t = {};
return Object.defineProperty(t, "__esModule", { value: !0 }), Object.keys(e).forEach(function(n) {
var s = Object.getOwnPropertyDescriptor(e, n);
Object.defineProperty(t, n, s.get ? s : {
enumerable: !0,
get: function() {
return e[n];
}
});
}), t;
}
var ie = { exports: {} };
function kn(e) {
throw new Error('Could not dynamically require "' + e + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
}
var ae = { exports: {} };
const In = {}, Tn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
__proto__: null,
default: In
}, Symbol.toStringTag, { value: "Module" })), zn = /* @__PURE__ */ On(Tn);
var qn = ae.exports, zt;
function q() {
return zt || (zt = 1, function(e, r) {
(function(t, n) {
e.exports = n();
})(qn, function() {
var t = t || function(n, s) {
var o;
if (typeof window < "u" && window.crypto && (o = window.crypto), typeof self < "u" && self.crypto && (o = self.crypto), typeof globalThis < "u" && globalThis.crypto && (o = globalThis.crypto), !o && typeof window < "u" && window.msCrypto && (o = window.msCrypto), !o && typeof et < "u" && et.crypto && (o = et.crypto), !o && typeof kn == "function")
try {
o = zn;
} catch {
}
var f = function() {
if (o) {
if (typeof o.getRandomValues == "function")
try {
return o.getRandomValues(new Uint32Array(1))[0];
} catch {
}
if (typeof o.randomBytes == "function")
try {
return o.randomBytes(4).readInt32LE();
} catch {
}
}
throw new Error("Native crypto module could not be used to get secure random number.");
}, a = Object.create || /* @__PURE__ */ function() {
function d() {
}
return function(h) {
var E;
return d.prototype = h, E = new d(), d.prototype = null, E;
};
}(), u = {}, i = u.lib = {}, c = i.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 h = a(this);
return d && h.mixIn(d), (!h.hasOwnProperty("init") || this.init === h.init) && (h.init = function() {
h.$super.init.apply(this, arguments);
}), h.init.prototype = h, h.$super = this, h;
},
/**
* 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 h in d)
d.hasOwnProperty(h) && (this[h] = d[h]);
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);
}
};
}(), l = i.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, h) {
d = this.words = d || [], h != s ? this.sigBytes = h : 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 || v).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 h = this.words, E = d.words, F = this.sigBytes, D = d.sigBytes;
if (this.clamp(), F % 4)
for (var g = 0; g < D; g++) {
var y = E[g >>> 2] >>> 24 - g % 4 * 8 & 255;
h[F + g >>> 2] |= y << 24 - (F + g) % 4 * 8;
}
else
for (var N = 0; N < D; N += 4)
h[F + N >>> 2] = E[N >>> 2];
return this.sigBytes += D, this;
},
/**
* Removes insignificant bits.
*
* @example
*
* wordArray.clamp();
*/
clamp: function() {
var d = this.words, h = this.sigBytes;
d[h >>> 2] &= 4294967295 << 32 - h % 4 * 8, d.length = n.ceil(h / 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 h = [], E = 0; E < d; E += 4)
h.push(f());
return new l.init(h, d);
}
}), x = u.enc = {}, v = x.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 h = d.words, E = d.sigBytes, F = [], D = 0; D < E; D++) {
var g = h[D >>> 2] >>> 24 - D % 4 * 8 & 255;
F.push((g >>> 4).toString(16)), F.push((g & 15).toString(16));
}
return F.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 h = d.length, E = [], F = 0; F < h; F += 2)
E[F >>> 3] |= parseInt(d.substr(F, 2), 16) << 24 - F % 8 * 4;
return new l.init(E, h / 2);
}
}, p = x.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 h = d.words, E = d.sigBytes, F = [], D = 0; D < E; D++) {
var g = h[D >>> 2] >>> 24 - D % 4 * 8 & 255;
F.push(String.fromCharCode(g));
}
return F.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 h = d.length, E = [], F = 0; F < h; F++)
E[F >>> 2] |= (d.charCodeAt(F) & 255) << 24 - F % 4 * 8;
return new l.init(E, h);
}
}, B = x.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(p.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 p.parse(unescape(encodeURIComponent(d)));
}
}, _ = i.BufferedBlockAlgorithm = c.extend({
/**
* Resets this block algorithm's data buffer to its initial state.
*
* @example
*
* bufferedBlockAlgorithm.reset();
*/
reset: function() {
this._data = new l.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 = B.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 h, E = this._data, F = E.words, D = E.sigBytes, g = this.blockSize, y = g * 4, N = D / y;
d ? N = n.ceil(N) : N = n.max((N | 0) - this._minBufferSize, 0);
var C = N * g, b = n.min(C * 4, D);
if (C) {
for (var S = 0; S < C; S += g)
this._doProcessBlock(F, S);
h = F.splice(0, C), E.sigBytes -= b;
}
return new l.init(h, 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
});
i.Hasher = _.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() {
_.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 h = this._doFinalize();
return h;
},
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(h, E) {
return new d.init(E).finalize(h);
};
},
/**
* 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(h, E) {
return new A.HMAC.init(d, E).finalize(h);
};
}
});
var A = u.algo = {};
return u;
}(Math);
return t;
});
}(ae)), ae.exports;
}
var xe = { exports: {} }, $n = xe.exports, qt;
function Ye() {
return qt || (qt = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})($n, function(t) {
return function(n) {
var s = t, o = s.lib, f = o.Base, a = o.WordArray, u = s.x64 = {};
u.Word = f.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(i, c) {
this.high = i, 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 = f.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(i, c) {
i = this.words = i || [], c != n ? this.sigBytes = c : this.sigBytes = i.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 i = this.words, c = i.length, l = [], x = 0; x < c; x++) {
var v = i[x];
l.push(v.high), l.push(v.low);
}
return a.create(l, this.sigBytes);
},
/**
* Creates a copy of this word array.
*
* @return {X64WordArray} The clone.
*
* @example
*
* var clone = x64WordArray.clone();
*/
clone: function() {
for (var i = f.clone.call(this), c = i.words = this.words.slice(0), l = c.length, x = 0; x < l; x++)
c[x] = c[x].clone();
return i;
}
});
}(), t;
});
}(xe)), xe.exports;
}
var ce = { exports: {} }, Vn = ce.exports, $t;
function Wn() {
return $t || ($t = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})(Vn, function(t) {
return function() {
if (typeof ArrayBuffer == "function") {
var n = t, s = n.lib, o = s.WordArray, f = o.init, a = o.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 i = u.byteLength, c = [], l = 0; l < i; l++)
c[l >>> 2] |= u[l] << 24 - l % 4 * 8;
f.call(this, c, i);
} else
f.apply(this, arguments);
};
a.prototype = o;
}
}(), t.lib.WordArray;
});
}(ce)), ce.exports;
}
var fe = { exports: {} }, jn = fe.exports, Vt;
function Ln() {
return Vt || (Vt = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})(jn, function(t) {
return function() {
var n = t, s = n.lib, o = s.WordArray, f = n.enc;
f.Utf16 = f.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 i = u.words, c = u.sigBytes, l = [], x = 0; x < c; x += 2) {
var v = i[x >>> 2] >>> 16 - x % 4 * 8 & 65535;
l.push(String.fromCharCode(v));
}
return l.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 i = u.length, c = [], l = 0; l < i; l++)
c[l >>> 1] |= u.charCodeAt(l) << 16 - l % 2 * 16;
return o.create(c, i * 2);
}
}, f.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 i = u.words, c = u.sigBytes, l = [], x = 0; x < c; x += 2) {
var v = a(i[x >>> 2] >>> 16 - x % 4 * 8 & 65535);
l.push(String.fromCharCode(v));
}
return l.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 i = u.length, c = [], l = 0; l < i; l++)
c[l >>> 1] |= a(u.charCodeAt(l) << 16 - l % 2 * 16);
return o.create(c, i * 2);
}
};
function a(u) {
return u << 8 & 4278255360 | u >>> 8 & 16711935;
}
}(), t.enc.Utf16;
});
}(fe)), fe.exports;
}
var ue = { exports: {} }, Kn = ue.exports, Wt;
function b0() {
return Wt || (Wt = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})(Kn, function(t) {
return function() {
var n = t, s = n.lib, o = s.WordArray, f = n.enc;
f.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 i = u.words, c = u.sigBytes, l = this._map;
u.clamp();
for (var x = [], v = 0; v < c; v += 3)
for (var p = i[v >>> 2] >>> 24 - v % 4 * 8 & 255, B = i[v + 1 >>> 2] >>> 24 - (v + 1) % 4 * 8 & 255, _ = i[v + 2 >>> 2] >>> 24 - (v + 2) % 4 * 8 & 255, A = p << 16 | B << 8 | _, d = 0; d < 4 && v + d * 0.75 < c; d++)
x.push(l.charAt(A >>> 6 * (3 - d) & 63));
var h = l.charAt(64);
if (h)
for (; x.length % 4; )
x.push(h);
return x.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 i = u.length, c = this._map, l = this._reverseMap;
if (!l) {
l = this._reverseMap = [];
for (var x = 0; x < c.length; x++)
l[c.charCodeAt(x)] = x;
}
var v = c.charAt(64);
if (v) {
var p = u.indexOf(v);
p !== -1 && (i = p);
}
return a(u, i, l);
},
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
};
function a(u, i, c) {
for (var l = [], x = 0, v = 0; v < i; v++)
if (v % 4) {
var p = c[u.charCodeAt(v - 1)] << v % 4 * 2, B = c[u.charCodeAt(v)] >>> 6 - v % 4 * 2, _ = p | B;
l[x >>> 2] |= _ << 24 - x % 4 * 8, x++;
}
return o.create(l, x);
}
}(), t.enc.Base64;
});
}(ue)), ue.exports;
}
var le = { exports: {} }, Mn = le.exports, jt;
function Un() {
return jt || (jt = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})(Mn, function(t) {
return function() {
var n = t, s = n.lib, o = s.WordArray, f = n.enc;
f.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, i) {
i === void 0 && (i = !0);
var c = u.words, l = u.sigBytes, x = i ? this._safe_map : this._map;
u.clamp();
for (var v = [], p = 0; p < l; p += 3)
for (var B = c[p >>> 2] >>> 24 - p % 4 * 8 & 255, _ = c[p + 1 >>> 2] >>> 24 - (p + 1) % 4 * 8 & 255, A = c[p + 2 >>> 2] >>> 24 - (p + 2) % 4 * 8 & 255, d = B << 16 | _ << 8 | A, h = 0; h < 4 && p + h * 0.75 < l; h++)
v.push(x.charAt(d >>> 6 * (3 - h) & 63));
var E = x.charAt(64);
if (E)
for (; v.length % 4; )
v.push(E);
return v.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, i) {
i === void 0 && (i = !0);
var c = u.length, l = i ? this._safe_map : this._map, x = this._reverseMap;
if (!x) {
x = this._reverseMap = [];
for (var v = 0; v < l.length; v++)
x[l.charCodeAt(v)] = v;
}
var p = l.charAt(64);
if (p) {
var B = u.indexOf(p);
B !== -1 && (c = B);
}
return a(u, c, x);
},
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
_safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
};
function a(u, i, c) {
for (var l = [], x = 0, v = 0; v < i; v++)
if (v % 4) {
var p = c[u.charCodeAt(v - 1)] << v % 4 * 2, B = c[u.charCodeAt(v)] >>> 6 - v % 4 * 2, _ = p | B;
l[x >>> 2] |= _ << 24 - x % 4 * 8, x++;
}
return o.create(l, x);
}
}(), t.enc.Base64url;
});
}(le)), le.exports;
}
var de = { exports: {} }, Xn = de.exports, Lt;
function y0() {
return Lt || (Lt = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})(Xn, function(t) {
return function(n) {
var s = t, o = s.lib, f = o.WordArray, a = o.Hasher, u = s.algo, i = [];
(function() {
for (var B = 0; B < 64; B++)
i[B] = n.abs(n.sin(B + 1)) * 4294967296 | 0;
})();
var c = u.MD5 = a.extend({
_doReset: function() {
this._hash = new f.init([
1732584193,
4023233417,
2562383102,
271733878
]);
},
_doProcessBlock: function(B, _) {
for (var A = 0; A < 16; A++) {
var d = _ + A, h = B[d];
B[d] = (h << 8 | h >>> 24) & 16711935 | (h << 24 | h >>> 8) & 4278255360;
}
var E = this._hash.words, F = B[_ + 0], D = B[_ + 1], g = B[_ + 2], y = B[_ + 3], N = B[_ + 4], C = B[_ + 5], b = B[_ + 6], S = B[_ + 7], w = B[_ + 8], O = B[_ + 9], k = B[_ + 10], I = B[_ + 11], L = B[_ + 12], $ = B[_ + 13], W = B[_ + 14], V = B[_ + 15], m = E[0], P = E[1], H = E[2], R = E[3];
m = l(m, P, H, R, F, 7, i[0]), R = l(R, m, P, H, D, 12, i[1]), H = l(H, R, m, P, g, 17, i[2]), P = l(P, H, R, m, y, 22, i[3]), m = l(m, P, H, R, N, 7, i[4]), R = l(R, m, P, H, C, 12, i[5]), H = l(H, R, m, P, b, 17, i[6]), P = l(P, H, R, m, S, 22, i[7]), m = l(m, P, H, R, w, 7, i[8]), R = l(R, m, P, H, O, 12, i[9]), H = l(H, R, m, P, k, 17, i[10]), P = l(P, H, R, m, I, 22, i[11]), m = l(m, P, H, R, L, 7, i[12]), R = l(R, m, P, H, $, 12, i[13]), H = l(H, R, m, P, W, 17, i[14]), P = l(P, H, R, m, V, 22, i[15]), m = x(m, P, H, R, D, 5, i[16]), R = x(R, m, P, H, b, 9, i[17]), H = x(H, R, m, P, I, 14, i[18]), P = x(P, H, R, m, F, 20, i[19]), m = x(m, P, H, R, C, 5, i[20]), R = x(R, m, P, H, k, 9, i[21]), H = x(H, R, m, P, V, 14, i[22]), P = x(P, H, R, m, N, 20, i[23]), m = x(m, P, H, R, O, 5, i[24]), R = x(R, m, P, H, W, 9, i[25]), H = x(H, R, m, P, y, 14, i[26]), P = x(P, H, R, m, w, 20, i[27]), m = x(m, P, H, R, $, 5, i[28]), R = x(R, m, P, H, g, 9, i[29]), H = x(H, R, m, P, S, 14, i[30]), P = x(P, H, R, m, L, 20, i[31]), m = v(m, P, H, R, C, 4, i[32]), R = v(R, m, P, H, w, 11, i[33]), H = v(H, R, m, P, I, 16, i[34]), P = v(P, H, R, m, W, 23, i[35]), m = v(m, P, H, R, D, 4, i[36]), R = v(R, m, P, H, N, 11, i[37]), H = v(H, R, m, P, S, 16, i[38]), P = v(P, H, R, m, k, 23, i[39]), m = v(m, P, H, R, $, 4, i[40]), R = v(R, m, P, H, F, 11, i[41]), H = v(H, R, m, P, y, 16, i[42]), P = v(P, H, R, m, b, 23, i[43]), m = v(m, P, H, R, O, 4, i[44]), R = v(R, m, P, H, L, 11, i[45]), H = v(H, R, m, P, V, 16, i[46]), P = v(P, H, R, m, g, 23, i[47]), m = p(m, P, H, R, F, 6, i[48]), R = p(R, m, P, H, S, 10, i[49]), H = p(H, R, m, P, W, 15, i[50]), P = p(P, H, R, m, C, 21, i[51]), m = p(m, P, H, R, L, 6, i[52]), R = p(R, m, P, H, y, 10, i[53]), H = p(H, R, m, P, k, 15, i[54]), P = p(P, H, R, m, D, 21, i[55]), m = p(m, P, H, R, w, 6, i[56]), R = p(R, m, P, H, V, 10, i[57]), H = p(H, R, m, P, b, 15, i[58]), P = p(P, H, R, m, $, 21, i[59]), m = p(m, P, H, R, N, 6, i[60]), R = p(R, m, P, H, I, 10, i[61]), H = p(H, R, m, P, g, 15, i[62]), P = p(P, H, R, m, O, 21, i[63]), E[0] = E[0] + m | 0, E[1] = E[1] + P | 0, E[2] = E[2] + H | 0, E[3] = E[3] + R | 0;
},
_doFinalize: function() {
var B = this._data, _ = B.words, A = this._nDataBytes * 8, d = B.sigBytes * 8;
_[d >>> 5] |= 128 << 24 - d % 32;
var h = n.floor(A / 4294967296), E = A;
_[(d + 64 >>> 9 << 4) + 15] = (h << 8 | h >>> 24) & 16711935 | (h << 24 | h >>> 8) & 4278255360, _[(d + 64 >>> 9 << 4) + 14] = (E << 8 | E >>> 24) & 16711935 | (E << 24 | E >>> 8) & 4278255360, B.sigBytes = (_.length + 1) * 4, this._process();
for (var F = this._hash, D = F.words, g = 0; g < 4; g++) {
var y = D[g];
D[g] = (y << 8 | y >>> 24) & 16711935 | (y << 24 | y >>> 8) & 4278255360;
}
return F;
},
clone: function() {
var B = a.clone.call(this);
return B._hash = this._hash.clone(), B;
}
});
function l(B, _, A, d, h, E, F) {
var D = B + (_ & A | ~_ & d) + h + F;
return (D << E | D >>> 32 - E) + _;
}
function x(B, _, A, d, h, E, F) {
var D = B + (_ & d | A & ~d) + h + F;
return (D << E | D >>> 32 - E) + _;
}
function v(B, _, A, d, h, E, F) {
var D = B + (_ ^ A ^ d) + h + F;
return (D << E | D >>> 32 - E) + _;
}
function p(B, _, A, d, h, E, F) {
var D = B + (A ^ (_ | ~d)) + h + F;
return (D << E | D >>> 32 - E) + _;
}
s.MD5 = a._createHelper(c), s.HmacMD5 = a._createHmacHelper(c);
}(Math), t.MD5;
});
}(de)), de.exports;
}
var he = { exports: {} }, Gn = he.exports, Kt;
function Sr() {
return Kt || (Kt = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})(Gn, function(t) {
return function() {
var n = t, s = n.lib, o = s.WordArray, f = s.Hasher, a = n.algo, u = [], i = a.SHA1 = f.extend({
_doReset: function() {
this._hash = new o.init([
1732584193,
4023233417,
2562383102,
271733878,
3285377520
]);
},
_doProcessBlock: function(c, l) {
for (var x = this._hash.words, v = x[0], p = x[1], B = x[2], _ = x[3], A = x[4], d = 0; d < 80; d++) {
if (d < 16)
u[d] = c[l + d] | 0;
else {
var h = u[d - 3] ^ u[d - 8] ^ u[d - 14] ^ u[d - 16];
u[d] = h << 1 | h >>> 31;
}
var E = (v << 5 | v >>> 27) + A + u[d];
d < 20 ? E += (p & B | ~p & _) + 1518500249 : d < 40 ? E += (p ^ B ^ _) + 1859775393 : d < 60 ? E += (p & B | p & _ | B & _) - 1894007588 : E += (p ^ B ^ _) - 899497514, A = _, _ = B, B = p << 30 | p >>> 2, p = v, v = E;
}
x[0] = x[0] + v | 0, x[1] = x[1] + p | 0, x[2] = x[2] + B | 0, x[3] = x[3] + _ | 0, x[4] = x[4] + A | 0;
},
_doFinalize: function() {
var c = this._data, l = c.words, x = this._nDataBytes * 8, v = c.sigBytes * 8;
return l[v >>> 5] |= 128 << 24 - v % 32, l[(v + 64 >>> 9 << 4) + 14] = Math.floor(x / 4294967296), l[(v + 64 >>> 9 << 4) + 15] = x, c.sigBytes = l.length * 4, this._process(), this._hash;
},
clone: function() {
var c = f.clone.call(this);
return c._hash = this._hash.clone(), c;
}
});
n.SHA1 = f._createHelper(i), n.HmacSHA1 = f._createHmacHelper(i);
}(), t.SHA1;
});
}(he)), he.exports;
}
var pe = { exports: {} }, Yn = pe.exports, Mt;
function lt() {
return Mt || (Mt = 1, function(e, r) {
(function(t, n) {
e.exports = n(q());
})(Yn, function(t) {
return function(n) {
var s = t, o = s.lib, f = o.WordArray, a = o.Hasher, u = s.algo, i = [], c = [];
(function() {
function v(A) {
for (var d = n.sqrt(A), h = 2; h <= d; h++)
if (!(A % h))
return !1;
return !0;
}
function p(A) {
return (A - (A | 0)) * 4294967296 | 0;
}
for (var B = 2, _ = 0; _ < 64; )
v(B) && (_ < 8 && (i[_] = p(n.pow(B, 1 / 2))), c[_] = p(n.pow(B, 1 / 3)), _++), B++;
})();
var l = [], x = u.SHA256 = a.extend({
_doReset: function() {
this._hash = new f.init(i.slice(0));
},
_doProcessBlock: function(v, p) {
for (var B = this._hash.words, _ = B[0], A = B[1], d = B[2], h = B[3], E = B[4], F = B[5], D = B[6], g = B[7], y = 0; y < 64; y++) {
if (y < 16)
l[y] = v[p + y] | 0;
else {
var N = l[y - 15], C = (N << 25 | N >>> 7) ^ (N << 14 | N >>> 18) ^ N >>> 3, b = l[y - 2], S = (b << 15 | b >>> 17) ^ (b << 13 | b >>> 19) ^ b >>> 10;
l[y] = C + l[y - 7] + S + l[y - 16];
}
var w = E & F ^ ~E & D, O = _ & A ^ _ & d ^ A & d, k = (_ << 30 | _ >>> 2) ^ (_ << 19 | _ >>> 13) ^ (_ << 10 | _ >>> 22), I = (E << 26 | E >>> 6) ^ (E << 21 | E >>> 11) ^ (E << 7 | E >>> 25), L = g + I + w + c[y] + l[y], $ = k + O;
g = D, D = F, F = E, E = h + L | 0, h = d, d = A, A = _, _ = L + $ | 0;
}
B[0] = B[0] + _ | 0, B[1] = B[1] + A | 0, B[2] = B[2] + d | 0, B[3] = B[3] + h | 0, B[4] = B[4] + E | 0, B[5] = B[5] + F | 0, B[6] = B[6] + D | 0, B[7] = B[7] + g | 0;
},
_doFinalize: function() {
var v = this._data, p = v.words, B = this._nDataBytes * 8, _ = v.sigBytes * 8;
return p[_ >>> 5] |= 128 << 24 - _ % 32, p[(_ + 64 >>> 9 << 4) + 14] = n.floor(B / 4294967296), p[(_ + 64 >>> 9 << 4) + 15] = B, v.sigBytes = p.length * 4, this._process(), this._hash;
},
clone: function() {
var v = a.clone.call(this);
return v._hash = this._hash.clone(), v;
}
});
s.SHA256 = a._createHelper(x), s.HmacSHA256 = a._createHmacHelper(x);
}(Math), t.SHA256;
});
}(pe)), pe.exports;
}
var ve = { exports: {} }, Zn = ve.exports, Ut;
function Qn() {
return Ut || (Ut = 1, function(e, r) {
(function(t, n, s) {
e.exports = n(q(), lt());
})(Zn, function(t) {
return function() {
var n = t, s = n.lib, o = s.WordArray, f = n.algo, a = f.SHA256, u = f.SHA224 = a.extend({
_doReset: function() {
this._hash = new o.init([
3238371032,
914150663,
812702999,
4144912697,
4290775857,
1750603025,
1694076839,
3204075428
]);
},
_doFinalize: function() {
var i = a._doFinalize.call(this);
return i.sigBytes -= 4, i;
}
});
n.SHA224 = a._createHelper(u), n.HmacSHA224 = a._createHmacHelper(u);
}(), t.SHA224;
});
}(ve)), ve.exports;
}
var Ee = { exports: {} }, Jn = Ee.exports, Xt;
function wr() {
return Xt || (Xt = 1, function(e, r) {
(function(t, n, s) {
e.exports = n(q(), Ye());
})(Jn, function(t) {
return function() {
var n = t, s = n.lib, o = s.Hasher, f = n.x64, a = f.Word, u = f.WordArray, i = n.algo;
function c() {
return a.create.apply(a, arguments);
}
var l = [
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),
c(770255983, 1495990901),
c(1249150122, 1856431235),
c(1555081692, 3175218132),
c(1996064986, 2198950837),
c(2554220882, 3999719339),
c(2821834349, 766784016),
c(2952996808, 2566594879),
c(3210313671, 3203337956),
c(3336571891, 1034457026),
c(3584528711, 2466948901),
c(113926993, 3758326383),
c(338241895, 168717936),
c(666307205, 1188179964),
c(773529912, 1546045734),
c(1294757372, 1522805485),
c(1396182291, 2643833823),
c(1695183700, 2343527390),
c(1986661051, 1014477480),
c(2177026350, 1206759142),
c(2456956037, 344077627),
c(2730485921, 1290863460),
c(2820302411, 3158454273),
c(3259730800, 3505952657),
c(3345764771, 106217008),
c(3516065817, 3606008344),
c(3600352804, 1432725776),
c(4094571909, 1467031594),
c(275423344, 851169720),
c(430227734, 3100823752),
c(506948616, 1363258195),
c(659060556, 3750685593),
c(883997877, 3785050280),
c(958139571, 3318307427),
c(1322822218, 3812723403),
c(1537002063, 2003034995),
c(1747873779, 3602036899),
c(1955562222, 1575990012),
c(2024104815, 1125592928),
c(2227730452, 2716904306),
c(2361852424, 442776044),
c(2428436474, 593698344),
c(2756734187, 3733110249),
c(3204031479, 2999351573),
c(3329325298, 3815920427),
c(3391569614, 3928383900),
c(3515267271, 566280711),
c(3940187606, 3454069534),
c(4118630271, 4000239992),
c(116418474, 1914138554),
c(174292421, 2731055270),
c(289380356, 3203993006),
c(460393269, 320620315),
c(685471733, 587496836),
c(852142971, 1086792851),
c(1017036298, 365543100),
c(1126000580, 2618297676),
c(1288033470, 3409855158),
c(1501505948, 4234509866),
c(1607167915, 987167468),
c(1816402316, 1246189591)
], x = [];
(function() {
for (var p = 0; p < 80; p++)
x[p] = c();
})();
var v = i.SHA512 = o.extend({
_doReset: function() {
this._hash = new u.init([
new a.init(1779033703, 4089235720),
new a.init(3144134277, 2227873595),
new a.init(1013904242, 4271175723),
new a.init(2773480762, 1595750129),
new a.init(1359893119, 2917565137),
new a.init(2600822924, 725511199),
new a.init(528734635, 4215389547),