@ht-sdks/events-sdk-js-browser 1.0.4

package/dist/pkg/core/user/vendor/crypto-es/lib/core.js

@@ -0,0 +1,744 @@
+//@ts-nocheck
+/* eslint-disable no-use-before-define */
+var _a, _b, _c, _d, _e, _f;
+import { __extends, __spreadArray } from "tslib";
+var crypto = ((_a = (typeof globalThis != 'undefined' ? globalThis : void 0)) === null || _a === void 0 ? void 0 : _a.crypto) ||
+    ((_b = (typeof global != 'undefined' ? global : void 0)) === null || _b === void 0 ? void 0 : _b.crypto) ||
+    ((_c = (typeof window != 'undefined' ? window : void 0)) === null || _c === void 0 ? void 0 : _c.crypto) ||
+    ((_d = (typeof self != 'undefined' ? self : void 0)) === null || _d === void 0 ? void 0 : _d.crypto) ||
+    ((_f = (_e = (typeof frames != 'undefined' ? frames : void 0)) === null || _e === void 0 ? void 0 : _e[0]) === null || _f === void 0 ? void 0 : _f.crypto);
+var randomWordArray;
+if (crypto) {
+    randomWordArray = function (nBytes) {
+        var words = [];
+        for (var i = 0, rcache = void 0; i < nBytes; i += 4) {
+            words.push(crypto.getRandomValues(new Uint32Array(1))[0]);
+        }
+        return new WordArray(words, nBytes);
+    };
+}
+else {
+    // Because there is no global crypto property in this context, cryptographically unsafe Math.random() is used.
+    randomWordArray = function (nBytes) {
+        var words = [];
+        var r = function (m_w) {
+            var _m_w = m_w;
+            var _m_z = 0x3ade68b1;
+            var mask = 0xffffffff;
+            return function () {
+                _m_z = (0x9069 * (_m_z & 0xffff) + (_m_z >> 0x10)) & mask;
+                _m_w = (0x4650 * (_m_w & 0xffff) + (_m_w >> 0x10)) & mask;
+                var result = ((_m_z << 0x10) + _m_w) & mask;
+                result /= 0x100000000;
+                result += 0.5;
+                return result * (Math.random() > 0.5 ? 1 : -1);
+            };
+        };
+        for (var i = 0, rcache = void 0; i < nBytes; i += 4) {
+            var _r = r((rcache || Math.random()) * 0x100000000);
+            rcache = _r() * 0x3ade67b7;
+            words.push((_r() * 0x100000000) | 0);
+        }
+        return new WordArray(words, nBytes);
+    };
+}
+/**
+ * Base class for inheritance.
+ */
+var Base = /** @class */ (function () {
+    function Base() {
+    }
+    /**
+     * 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();
+     */
+    Base.create = function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        return new (this.bind.apply(this, __spreadArray([void 0], args, false)))();
+    };
+    /**
+     * Copies properties into this object.
+     *
+     * @param {Object} properties The properties to mix in.
+     *
+     * @example
+     *
+     *     MyType.mixIn({
+     *         field: 'value'
+     *     });
+     */
+    Base.prototype.mixIn = function (properties) {
+        return Object.assign(this, properties);
+    };
+    /**
+     * Creates a copy of this object.
+     *
+     * @return {Object} The clone.
+     *
+     * @example
+     *
+     *     var clone = instance.clone();
+     */
+    Base.prototype.clone = function () {
+        var clone = new this.constructor();
+        Object.assign(clone, this);
+        return clone;
+    };
+    return Base;
+}());
+export { Base };
+/**
+ * An array of 32-bit words.
+ *
+ * @property {Array} words The array of 32-bit words.
+ * @property {number} sigBytes The number of significant bytes in this word array.
+ */
+var WordArray = /** @class */ (function (_super) {
+    __extends(WordArray, _super);
+    /**
+     * 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);
+     */
+    function WordArray(words, sigBytes) {
+        if (words === void 0) { words = []; }
+        if (sigBytes === void 0) { sigBytes = words.length * 4; }
+        var _this = _super.call(this) || this;
+        var typedArray = words;
+        // Convert buffers to uint8
+        if (typedArray instanceof ArrayBuffer) {
+            typedArray = new Uint8Array(typedArray);
+        }
+        // Convert other array views to uint8
+        if (typedArray instanceof Int8Array ||
+            typedArray instanceof Uint8ClampedArray ||
+            typedArray instanceof Int16Array ||
+            typedArray instanceof Uint16Array ||
+            typedArray instanceof Int32Array ||
+            typedArray instanceof Uint32Array ||
+            typedArray instanceof Float32Array ||
+            typedArray instanceof Float64Array) {
+            typedArray = new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength);
+        }
+        // Handle Uint8Array
+        if (typedArray instanceof Uint8Array) {
+            // Shortcut
+            var typedArrayByteLength = typedArray.byteLength;
+            // Extract bytes
+            var _words = [];
+            for (var i = 0; i < typedArrayByteLength; i += 1) {
+                _words[i >>> 2] |= typedArray[i] << (24 - (i % 4) * 8);
+            }
+            // Initialize this word array
+            _this.words = _words;
+            _this.sigBytes = typedArrayByteLength;
+        }
+        else {
+            // Else call normal init
+            _this.words = words;
+            _this.sigBytes = sigBytes;
+        }
+        return _this;
+    }
+    /**
+     * 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);
+     */
+    WordArray.prototype.toString = function (encoder) {
+        if (encoder === void 0) { encoder = Hex; }
+        return encoder.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);
+     */
+    WordArray.prototype.concat = function (wordArray) {
+        // Shortcuts
+        var thisWords = this.words;
+        var thatWords = wordArray.words;
+        var thisSigBytes = this.sigBytes;
+        var thatSigBytes = wordArray.sigBytes;
+        // Clamp excess bits
+        this.clamp();
+        // Concat
+        if (thisSigBytes % 4) {
+            // Copy one byte at a time
+            for (var i = 0; i < thatSigBytes; i += 1) {
+                var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
+                thisWords[(thisSigBytes + i) >>> 2] |=
+                    thatByte << (24 - ((thisSigBytes + i) % 4) * 8);
+            }
+        }
+        else {
+            // Copy one word at a time
+            for (var i = 0; i < thatSigBytes; i += 4) {
+                thisWords[(thisSigBytes + i) >>> 2] = thatWords[i >>> 2];
+            }
+        }
+        this.sigBytes += thatSigBytes;
+        // Chainable
+        return this;
+    };
+    /**
+     * Removes insignificant bits.
+     *
+     * @example
+     *
+     *     wordArray.clamp();
+     */
+    WordArray.prototype.clamp = function () {
+        // Shortcuts
+        var _a = this, words = _a.words, sigBytes = _a.sigBytes;
+        // Clamp
+        words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8);
+        words.length = Math.ceil(sigBytes / 4);
+    };
+    /**
+     * Creates a copy of this word array.
+     *
+     * @return {WordArray} The clone.
+     *
+     * @example
+     *
+     *     var clone = wordArray.clone();
+     */
+    WordArray.prototype.clone = function () {
+        var clone = _super.prototype.clone.call(this);
+        clone.words = this.words.slice(0);
+        return clone;
+    };
+    /**
+     * 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);
+     */
+    WordArray.random = randomWordArray;
+    return WordArray;
+}(Base));
+export { WordArray };
+/**
+ * Hex encoding strategy.
+ */
+export var 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 (wordArray) {
+        // Shortcuts
+        var words = wordArray.words, sigBytes = wordArray.sigBytes;
+        // Convert
+        var hexChars = [];
+        for (var i = 0; i < sigBytes; i += 1) {
+            var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
+            hexChars.push((bite >>> 4).toString(16));
+            hexChars.push((bite & 0x0f).toString(16));
+        }
+        return hexChars.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 (hexStr) {
+        // Shortcut
+        var hexStrLength = hexStr.length;
+        // Convert
+        var words = [];
+        for (var i = 0; i < hexStrLength; i += 2) {
+            words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4);
+        }
+        return new WordArray(words, hexStrLength / 2);
+    },
+};
+/**
+ * Latin1 encoding strategy.
+ */
+export var 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 (wordArray) {
+        // Shortcuts
+        var words = wordArray.words, sigBytes = wordArray.sigBytes;
+        // Convert
+        var latin1Chars = [];
+        for (var i = 0; i < sigBytes; i += 1) {
+            var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
+            latin1Chars.push(String.fromCharCode(bite));
+        }
+        return latin1Chars.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 (latin1Str) {
+        // Shortcut
+        var latin1StrLength = latin1Str.length;
+        // Convert
+        var words = [];
+        for (var i = 0; i < latin1StrLength; i += 1) {
+            words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);
+        }
+        return new WordArray(words, latin1StrLength);
+    },
+};
+/**
+ * UTF-8 encoding strategy.
+ */
+export var 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 (wordArray) {
+        try {
+            return decodeURIComponent(escape(Latin1.stringify(wordArray)));
+        }
+        catch (e) {
+            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 (utf8Str) {
+        return Latin1.parse(unescape(encodeURIComponent(utf8Str)));
+    },
+};
+/**
+ * Abstract buffered block algorithm template.
+ *
+ * The property blockSize must be implemented in a concrete subtype.
+ *
+ * @property {number} _minBufferSize
+ *
+ *     The number of blocks that should be kept unprocessed in the buffer. Default: 0
+ */
+var BufferedBlockAlgorithm = /** @class */ (function (_super) {
+    __extends(BufferedBlockAlgorithm, _super);
+    function BufferedBlockAlgorithm() {
+        var _this = _super.call(this) || this;
+        _this._minBufferSize = 0;
+        return _this;
+    }
+    /**
+     * Resets this block algorithm's data buffer to its initial state.
+     *
+     * @example
+     *
+     *     bufferedBlockAlgorithm.reset();
+     */
+    BufferedBlockAlgorithm.prototype.reset = function () {
+        // Initial values
+        this._data = new WordArray();
+        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);
+     */
+    BufferedBlockAlgorithm.prototype._append = function (data) {
+        var m_data = data;
+        // Convert string to WordArray, else assume WordArray already
+        if (typeof m_data === 'string') {
+            m_data = Utf8.parse(m_data);
+        }
+        // Append
+        this._data.concat(m_data);
+        this._nDataBytes += m_data.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');
+     */
+    BufferedBlockAlgorithm.prototype._process = function (doFlush) {
+        var processedWords;
+        // Shortcuts
+        var _a = this, data = _a._data, blockSize = _a.blockSize;
+        var dataWords = data.words;
+        var dataSigBytes = data.sigBytes;
+        var blockSizeBytes = blockSize * 4;
+        // Count blocks ready
+        var nBlocksReady = dataSigBytes / blockSizeBytes;
+        if (doFlush) {
+            // Round up to include partial blocks
+            nBlocksReady = Math.ceil(nBlocksReady);
+        }
+        else {
+            // Round down to include only full blocks,
+            // less the number of blocks that must remain in the buffer
+            nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);
+        }
+        // Count words ready
+        var nWordsReady = nBlocksReady * blockSize;
+        // Count bytes ready
+        var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);
+        // Process blocks
+        if (nWordsReady) {
+            for (var offset = 0; offset < nWordsReady; offset += blockSize) {
+                // Perform concrete-algorithm logic
+                this._doProcessBlock(dataWords, offset);
+            }
+            // Remove processed words
+            processedWords = dataWords.splice(0, nWordsReady);
+            data.sigBytes -= nBytesReady;
+        }
+        // Return processed words
+        return new WordArray(processedWords, nBytesReady);
+    };
+    /**
+     * Creates a copy of this object.
+     *
+     * @return {Object} The clone.
+     *
+     * @example
+     *
+     *     var clone = bufferedBlockAlgorithm.clone();
+     */
+    BufferedBlockAlgorithm.prototype.clone = function () {
+        var clone = _super.prototype.clone.call(this);
+        clone._data = this._data.clone();
+        return clone;
+    };
+    return BufferedBlockAlgorithm;
+}(Base));
+export { BufferedBlockAlgorithm };
+/**
+ * Abstract hasher template.
+ *
+ * @property {number} blockSize
+ *
+ *     The number of 32-bit words this hasher operates on. Default: 16 (512 bits)
+ */
+var Hasher = /** @class */ (function (_super) {
+    __extends(Hasher, _super);
+    function Hasher(cfg) {
+        var _this = _super.call(this) || this;
+        _this.blockSize = 512 / 32;
+        /**
+         * Configuration options.
+         */
+        _this.cfg = Object.assign(new Base(), cfg);
+        // Set initial values
+        _this.reset();
+        return _this;
+    }
+    /**
+     * Creates a shortcut function to a hasher's object interface.
+     *
+     * @param {Hasher} SubHasher The hasher to create a helper for.
+     *
+     * @return {Function} The shortcut function.
+     *
+     * @static
+     *
+     * @example
+     *
+     *     var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
+     */
+    Hasher._createHelper = function (SubHasher) {
+        return function (message, cfg) { return new SubHasher(cfg).finalize(message); };
+    };
+    /**
+     * Creates a shortcut function to the HMAC's object interface.
+     *
+     * @param {Hasher} SubHasher The hasher to use in this HMAC helper.
+     *
+     * @return {Function} The shortcut function.
+     *
+     * @static
+     *
+     * @example
+     *
+     *     var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
+     */
+    Hasher._createHmacHelper = function (SubHasher) {
+        return function (message, key) { return new HMAC(SubHasher, key).finalize(message); };
+    };
+    /**
+     * Resets this hasher to its initial state.
+     *
+     * @example
+     *
+     *     hasher.reset();
+     */
+    Hasher.prototype.reset = function () {
+        // Reset data buffer
+        _super.prototype.reset.call(this);
+        // Perform concrete-hasher logic
+        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);
+     */
+    Hasher.prototype.update = function (messageUpdate) {
+        // Append
+        this._append(messageUpdate);
+        // Update the hash
+        this._process();
+        // Chainable
+        return 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);
+     */
+    Hasher.prototype.finalize = function (messageUpdate) {
+        // Final message update
+        if (messageUpdate) {
+            this._append(messageUpdate);
+        }
+        // Perform concrete-hasher logic
+        var hash = this._doFinalize();
+        return hash;
+    };
+    return Hasher;
+}(BufferedBlockAlgorithm));
+export { Hasher };
+/**
+ * HMAC algorithm.
+ */
+var HMAC = /** @class */ (function (_super) {
+    __extends(HMAC, _super);
+    /**
+     * Initializes a newly created HMAC.
+     *
+     * @param {Hasher} SubHasher The hash algorithm to use.
+     * @param {WordArray|string} key The secret key.
+     *
+     * @example
+     *
+     *     var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key);
+     */
+    function HMAC(SubHasher, key) {
+        var _this = _super.call(this) || this;
+        var hasher = new SubHasher();
+        _this._hasher = hasher;
+        // Convert string to WordArray, else assume WordArray already
+        var _key = key;
+        if (typeof _key === 'string') {
+            _key = Utf8.parse(_key);
+        }
+        // Shortcuts
+        var hasherBlockSize = hasher.blockSize;
+        var hasherBlockSizeBytes = hasherBlockSize * 4;
+        // Allow arbitrary length keys
+        if (_key.sigBytes > hasherBlockSizeBytes) {
+            _key = hasher.finalize(key);
+        }
+        // Clamp excess bits
+        _key.clamp();
+        // Clone key for inner and outer pads
+        var oKey = _key.clone();
+        _this._oKey = oKey;
+        var iKey = _key.clone();
+        _this._iKey = iKey;
+        // Shortcuts
+        var oKeyWords = oKey.words;
+        var iKeyWords = iKey.words;
+        // XOR keys with pad constants
+        for (var i = 0; i < hasherBlockSize; i += 1) {
+            oKeyWords[i] ^= 0x5c5c5c5c;
+            iKeyWords[i] ^= 0x36363636;
+        }
+        oKey.sigBytes = hasherBlockSizeBytes;
+        iKey.sigBytes = hasherBlockSizeBytes;
+        // Set initial values
+        _this.reset();
+        return _this;
+    }
+    /**
+     * Resets this HMAC to its initial state.
+     *
+     * @example
+     *
+     *     hmacHasher.reset();
+     */
+    HMAC.prototype.reset = function () {
+        // Shortcut
+        var hasher = this._hasher;
+        // Reset
+        hasher.reset();
+        hasher.update(this._iKey);
+    };
+    /**
+     * Updates this HMAC with a message.
+     *
+     * @param {WordArray|string} messageUpdate The message to append.
+     *
+     * @return {HMAC} This HMAC instance.
+     *
+     * @example
+     *
+     *     hmacHasher.update('message');
+     *     hmacHasher.update(wordArray);
+     */
+    HMAC.prototype.update = function (messageUpdate) {
+        this._hasher.update(messageUpdate);
+        // Chainable
+        return this;
+    };
+    /**
+     * Finalizes the HMAC 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 HMAC.
+     *
+     * @example
+     *
+     *     var hmac = hmacHasher.finalize();
+     *     var hmac = hmacHasher.finalize('message');
+     *     var hmac = hmacHasher.finalize(wordArray);
+     */
+    HMAC.prototype.finalize = function (messageUpdate) {
+        // Shortcut
+        var hasher = this._hasher;
+        // Compute HMAC
+        var innerHash = hasher.finalize(messageUpdate);
+        hasher.reset();
+        var hmac = hasher.finalize(this._oKey.clone().concat(innerHash));
+        return hmac;
+    };
+    return HMAC;
+}(Base));
+export { HMAC };
+//# sourceMappingURL=core.js.map