Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More →
@blotoutio/providers-google-analytics-4-sdk
Advanced tools
@blotoutio/providers-google-analytics-4-sdk - npm Package Compare versions
Comparing version 0.8.5 to 0.9.0
434
index.js
@@ -130,436 +130,2 @@ var ProvidersGoogleAnalytics4Sdk = (function () { | ||
| var REGEX = /^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000)$/i; | ||
| function validate(uuid) { | ||
| return typeof uuid === 'string' && REGEX.test(uuid); | ||
| } | ||
| /** | ||
| * Convert array of 16 byte values to UUID string format of the form: | ||
| * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX | ||
| */ | ||
| const byteToHex = []; | ||
| for (let i = 0; i < 256; ++i) { | ||
| byteToHex.push((i + 0x100).toString(16).slice(1)); | ||
| } | ||
| function unsafeStringify(arr, offset = 0) { | ||
| // Note: Be careful editing this code! It's been tuned for performance | ||
| // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434 | ||
| return (byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]]).toLowerCase(); | ||
| } | ||
| function parse(uuid) { | ||
| if (!validate(uuid)) { | ||
| throw TypeError('Invalid UUID'); | ||
| } | ||
| let v; | ||
| const arr = new Uint8Array(16); // Parse ########-....-....-....-............ | ||
| arr[0] = (v = parseInt(uuid.slice(0, 8), 16)) >>> 24; | ||
| arr[1] = v >>> 16 & 0xff; | ||
| arr[2] = v >>> 8 & 0xff; | ||
| arr[3] = v & 0xff; // Parse ........-####-....-....-............ | ||
| arr[4] = (v = parseInt(uuid.slice(9, 13), 16)) >>> 8; | ||
| arr[5] = v & 0xff; // Parse ........-....-####-....-............ | ||
| arr[6] = (v = parseInt(uuid.slice(14, 18), 16)) >>> 8; | ||
| arr[7] = v & 0xff; // Parse ........-....-....-####-............ | ||
| arr[8] = (v = parseInt(uuid.slice(19, 23), 16)) >>> 8; | ||
| arr[9] = v & 0xff; // Parse ........-....-....-....-############ | ||
| // (Use "/" to avoid 32-bit truncation when bit-shifting high-order bytes) | ||
| arr[10] = (v = parseInt(uuid.slice(24, 36), 16)) / 0x10000000000 & 0xff; | ||
| arr[11] = v / 0x100000000 & 0xff; | ||
| arr[12] = v >>> 24 & 0xff; | ||
| arr[13] = v >>> 16 & 0xff; | ||
| arr[14] = v >>> 8 & 0xff; | ||
| arr[15] = v & 0xff; | ||
| return arr; | ||
| } | ||
| function stringToBytes(str) { | ||
| str = unescape(encodeURIComponent(str)); // UTF8 escape | ||
| const bytes = []; | ||
| for (let i = 0; i < str.length; ++i) { | ||
| bytes.push(str.charCodeAt(i)); | ||
| } | ||
| return bytes; | ||
| } | ||
| const DNS = '6ba7b810-9dad-11d1-80b4-00c04fd430c8'; | ||
| const URL = '6ba7b811-9dad-11d1-80b4-00c04fd430c8'; | ||
| function v35(name, version, hashfunc) { | ||
| function generateUUID(value, namespace, buf, offset) { | ||
| var _namespace; | ||
| if (typeof value === 'string') { | ||
| value = stringToBytes(value); | ||
| } | ||
| if (typeof namespace === 'string') { | ||
| namespace = parse(namespace); | ||
| } | ||
| if (((_namespace = namespace) === null || _namespace === void 0 ? void 0 : _namespace.length) !== 16) { | ||
| throw TypeError('Namespace must be array-like (16 iterable integer values, 0-255)'); | ||
| } // Compute hash of namespace and value, Per 4.3 | ||
| // Future: Use spread syntax when supported on all platforms, e.g. `bytes = | ||
| // hashfunc([...namespace, ... value])` | ||
| let bytes = new Uint8Array(16 + value.length); | ||
| bytes.set(namespace); | ||
| bytes.set(value, namespace.length); | ||
| bytes = hashfunc(bytes); | ||
| bytes[6] = bytes[6] & 0x0f | version; | ||
| bytes[8] = bytes[8] & 0x3f | 0x80; | ||
| if (buf) { | ||
| offset = offset || 0; | ||
| for (let i = 0; i < 16; ++i) { | ||
| buf[offset + i] = bytes[i]; | ||
| } | ||
| return buf; | ||
| } | ||
| return unsafeStringify(bytes); | ||
| } // Function#name is not settable on some platforms (#270) | ||
| try { | ||
| generateUUID.name = name; // eslint-disable-next-line no-empty | ||
| } catch (err) {} // For CommonJS default export support | ||
| generateUUID.DNS = DNS; | ||
| generateUUID.URL = URL; | ||
| return generateUUID; | ||
| } | ||
| /* | ||
| * Browser-compatible JavaScript MD5 | ||
| * | ||
| * Modification of JavaScript MD5 | ||
| * https://github.com/blueimp/JavaScript-MD5 | ||
| * | ||
| * Copyright 2011, Sebastian Tschan | ||
| * https://blueimp.net | ||
| * | ||
| * Licensed under the MIT license: | ||
| * https://opensource.org/licenses/MIT | ||
| * | ||
| * Based on | ||
| * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message | ||
| * Digest Algorithm, as defined in RFC 1321. | ||
| * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009 | ||
| * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet | ||
| * Distributed under the BSD License | ||
| * See http://pajhome.org.uk/crypt/md5 for more info. | ||
| */ | ||
| function md5(bytes) { | ||
| if (typeof bytes === 'string') { | ||
| const msg = unescape(encodeURIComponent(bytes)); // UTF8 escape | ||
| bytes = new Uint8Array(msg.length); | ||
| for (let i = 0; i < msg.length; ++i) { | ||
| bytes[i] = msg.charCodeAt(i); | ||
| } | ||
| } | ||
| return md5ToHexEncodedArray(wordsToMd5(bytesToWords(bytes), bytes.length * 8)); | ||
| } | ||
| /* | ||
| * Convert an array of little-endian words to an array of bytes | ||
| */ | ||
| function md5ToHexEncodedArray(input) { | ||
| const output = []; | ||
| const length32 = input.length * 32; | ||
| const hexTab = '0123456789abcdef'; | ||
| for (let i = 0; i < length32; i += 8) { | ||
| const x = input[i >> 5] >>> i % 32 & 0xff; | ||
| const hex = parseInt(hexTab.charAt(x >>> 4 & 0x0f) + hexTab.charAt(x & 0x0f), 16); | ||
| output.push(hex); | ||
| } | ||
| return output; | ||
| } | ||
| /** | ||
| * Calculate output length with padding and bit length | ||
| */ | ||
| function getOutputLength(inputLength8) { | ||
| return (inputLength8 + 64 >>> 9 << 4) + 14 + 1; | ||
| } | ||
| /* | ||
| * Calculate the MD5 of an array of little-endian words, and a bit length. | ||
| */ | ||
| function wordsToMd5(x, len) { | ||
| /* append padding */ | ||
| x[len >> 5] |= 0x80 << len % 32; | ||
| x[getOutputLength(len) - 1] = len; | ||
| let a = 1732584193; | ||
| let b = -271733879; | ||
| let c = -1732584194; | ||
| let d = 271733878; | ||
| for (let i = 0; i < x.length; i += 16) { | ||
| const olda = a; | ||
| const oldb = b; | ||
| const oldc = c; | ||
| const oldd = d; | ||
| a = md5ff(a, b, c, d, x[i], 7, -680876936); | ||
| d = md5ff(d, a, b, c, x[i + 1], 12, -389564586); | ||
| c = md5ff(c, d, a, b, x[i + 2], 17, 606105819); | ||
| b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330); | ||
| a = md5ff(a, b, c, d, x[i + 4], 7, -176418897); | ||
| d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426); | ||
| c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341); | ||
| b = md5ff(b, c, d, a, x[i + 7], 22, -45705983); | ||
| a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416); | ||
| d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417); | ||
| c = md5ff(c, d, a, b, x[i + 10], 17, -42063); | ||
| b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162); | ||
| a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682); | ||
| d = md5ff(d, a, b, c, x[i + 13], 12, -40341101); | ||
| c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290); | ||
| b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329); | ||
| a = md5gg(a, b, c, d, x[i + 1], 5, -165796510); | ||
| d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632); | ||
| c = md5gg(c, d, a, b, x[i + 11], 14, 643717713); | ||
| b = md5gg(b, c, d, a, x[i], 20, -373897302); | ||
| a = md5gg(a, b, c, d, x[i + 5], 5, -701558691); | ||
| d = md5gg(d, a, b, c, x[i + 10], 9, 38016083); | ||
| c = md5gg(c, d, a, b, x[i + 15], 14, -660478335); | ||
| b = md5gg(b, c, d, a, x[i + 4], 20, -405537848); | ||
| a = md5gg(a, b, c, d, x[i + 9], 5, 568446438); | ||
| d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690); | ||
| c = md5gg(c, d, a, b, x[i + 3], 14, -187363961); | ||
| b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501); | ||
| a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467); | ||
| d = md5gg(d, a, b, c, x[i + 2], 9, -51403784); | ||
| c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473); | ||
| b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734); | ||
| a = md5hh(a, b, c, d, x[i + 5], 4, -378558); | ||
| d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463); | ||
| c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562); | ||
| b = md5hh(b, c, d, a, x[i + 14], 23, -35309556); | ||
| a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060); | ||
| d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353); | ||
| c = md5hh(c, d, a, b, x[i + 7], 16, -155497632); | ||
| b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640); | ||
| a = md5hh(a, b, c, d, x[i + 13], 4, 681279174); | ||
| d = md5hh(d, a, b, c, x[i], 11, -358537222); | ||
| c = md5hh(c, d, a, b, x[i + 3], 16, -722521979); | ||
| b = md5hh(b, c, d, a, x[i + 6], 23, 76029189); | ||
| a = md5hh(a, b, c, d, x[i + 9], 4, -640364487); | ||
| d = md5hh(d, a, b, c, x[i + 12], 11, -421815835); | ||
| c = md5hh(c, d, a, b, x[i + 15], 16, 530742520); | ||
| b = md5hh(b, c, d, a, x[i + 2], 23, -995338651); | ||
| a = md5ii(a, b, c, d, x[i], 6, -198630844); | ||
| d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415); | ||
| c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905); | ||
| b = md5ii(b, c, d, a, x[i + 5], 21, -57434055); | ||
| a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571); | ||
| d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606); | ||
| c = md5ii(c, d, a, b, x[i + 10], 15, -1051523); | ||
| b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799); | ||
| a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359); | ||
| d = md5ii(d, a, b, c, x[i + 15], 10, -30611744); | ||
| c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380); | ||
| b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649); | ||
| a = md5ii(a, b, c, d, x[i + 4], 6, -145523070); | ||
| d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379); | ||
| c = md5ii(c, d, a, b, x[i + 2], 15, 718787259); | ||
| b = md5ii(b, c, d, a, x[i + 9], 21, -343485551); | ||
| a = safeAdd(a, olda); | ||
| b = safeAdd(b, oldb); | ||
| c = safeAdd(c, oldc); | ||
| d = safeAdd(d, oldd); | ||
| } | ||
| return [a, b, c, d]; | ||
| } | ||
| /* | ||
| * Convert an array bytes to an array of little-endian words | ||
| * Characters >255 have their high-byte silently ignored. | ||
| */ | ||
| function bytesToWords(input) { | ||
| if (input.length === 0) { | ||
| return []; | ||
| } | ||
| const length8 = input.length * 8; | ||
| const output = new Uint32Array(getOutputLength(length8)); | ||
| for (let i = 0; i < length8; i += 8) { | ||
| output[i >> 5] |= (input[i / 8] & 0xff) << i % 32; | ||
| } | ||
| return output; | ||
| } | ||
| /* | ||
| * Add integers, wrapping at 2^32. This uses 16-bit operations internally | ||
| * to work around bugs in some JS interpreters. | ||
| */ | ||
| function safeAdd(x, y) { | ||
| const lsw = (x & 0xffff) + (y & 0xffff); | ||
| const msw = (x >> 16) + (y >> 16) + (lsw >> 16); | ||
| return msw << 16 | lsw & 0xffff; | ||
| } | ||
| /* | ||
| * Bitwise rotate a 32-bit number to the left. | ||
| */ | ||
| function bitRotateLeft(num, cnt) { | ||
| return num << cnt | num >>> 32 - cnt; | ||
| } | ||
| /* | ||
| * These functions implement the four basic operations the algorithm uses. | ||
| */ | ||
| function md5cmn(q, a, b, x, s, t) { | ||
| return safeAdd(bitRotateLeft(safeAdd(safeAdd(a, q), safeAdd(x, t)), s), b); | ||
| } | ||
| function md5ff(a, b, c, d, x, s, t) { | ||
| return md5cmn(b & c | ~b & d, a, b, x, s, t); | ||
| } | ||
| function md5gg(a, b, c, d, x, s, t) { | ||
| return md5cmn(b & d | c & ~d, a, b, x, s, t); | ||
| } | ||
| function md5hh(a, b, c, d, x, s, t) { | ||
| return md5cmn(b ^ c ^ d, a, b, x, s, t); | ||
| } | ||
| function md5ii(a, b, c, d, x, s, t) { | ||
| return md5cmn(c ^ (b | ~d), a, b, x, s, t); | ||
| } | ||
| v35('v3', 0x30, md5); | ||
| typeof crypto !== 'undefined' && crypto.randomUUID && crypto.randomUUID.bind(crypto); | ||
| // Adapted from Chris Veness' SHA1 code at | ||
| // http://www.movable-type.co.uk/scripts/sha1.html | ||
| function f(s, x, y, z) { | ||
| switch (s) { | ||
| case 0: | ||
| return x & y ^ ~x & z; | ||
| case 1: | ||
| return x ^ y ^ z; | ||
| case 2: | ||
| return x & y ^ x & z ^ y & z; | ||
| case 3: | ||
| return x ^ y ^ z; | ||
| } | ||
| } | ||
| function ROTL(x, n) { | ||
| return x << n | x >>> 32 - n; | ||
| } | ||
| function sha1(bytes) { | ||
| const K = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6]; | ||
| const H = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0]; | ||
| if (typeof bytes === 'string') { | ||
| const msg = unescape(encodeURIComponent(bytes)); // UTF8 escape | ||
| bytes = []; | ||
| for (let i = 0; i < msg.length; ++i) { | ||
| bytes.push(msg.charCodeAt(i)); | ||
| } | ||
| } else if (!Array.isArray(bytes)) { | ||
| // Convert Array-like to Array | ||
| bytes = Array.prototype.slice.call(bytes); | ||
| } | ||
| bytes.push(0x80); | ||
| const l = bytes.length / 4 + 2; | ||
| const N = Math.ceil(l / 16); | ||
| const M = new Array(N); | ||
| for (let i = 0; i < N; ++i) { | ||
| const arr = new Uint32Array(16); | ||
| for (let j = 0; j < 16; ++j) { | ||
| arr[j] = bytes[i * 64 + j * 4] << 24 | bytes[i * 64 + j * 4 + 1] << 16 | bytes[i * 64 + j * 4 + 2] << 8 | bytes[i * 64 + j * 4 + 3]; | ||
| } | ||
| M[i] = arr; | ||
| } | ||
| M[N - 1][14] = (bytes.length - 1) * 8 / Math.pow(2, 32); | ||
| M[N - 1][14] = Math.floor(M[N - 1][14]); | ||
| M[N - 1][15] = (bytes.length - 1) * 8 & 0xffffffff; | ||
| for (let i = 0; i < N; ++i) { | ||
| const W = new Uint32Array(80); | ||
| for (let t = 0; t < 16; ++t) { | ||
| W[t] = M[i][t]; | ||
| } | ||
| for (let t = 16; t < 80; ++t) { | ||
| W[t] = ROTL(W[t - 3] ^ W[t - 8] ^ W[t - 14] ^ W[t - 16], 1); | ||
| } | ||
| let a = H[0]; | ||
| let b = H[1]; | ||
| let c = H[2]; | ||
| let d = H[3]; | ||
| let e = H[4]; | ||
| for (let t = 0; t < 80; ++t) { | ||
| const s = Math.floor(t / 20); | ||
| const T = ROTL(a, 5) + f(s, b, c, d) + e + K[s] + W[t] >>> 0; | ||
| e = d; | ||
| d = c; | ||
| c = ROTL(b, 30) >>> 0; | ||
| b = a; | ||
| a = T; | ||
| } | ||
| H[0] = H[0] + a >>> 0; | ||
| H[1] = H[1] + b >>> 0; | ||
| H[2] = H[2] + c >>> 0; | ||
| H[3] = H[3] + d >>> 0; | ||
| H[4] = H[4] + e >>> 0; | ||
| } | ||
| return [H[0] >> 24 & 0xff, H[0] >> 16 & 0xff, H[0] >> 8 & 0xff, H[0] & 0xff, H[1] >> 24 & 0xff, H[1] >> 16 & 0xff, H[1] >> 8 & 0xff, H[1] & 0xff, H[2] >> 24 & 0xff, H[2] >> 16 & 0xff, H[2] >> 8 & 0xff, H[2] & 0xff, H[3] >> 24 & 0xff, H[3] >> 16 & 0xff, H[3] >> 8 & 0xff, H[3] & 0xff, H[4] >> 24 & 0xff, H[4] >> 16 & 0xff, H[4] >> 8 & 0xff, H[4] & 0xff]; | ||
| } | ||
| v35('v5', 0x50, sha1); | ||
| const getCookieValue = (key) => { | ||
@@ -566,0 +132,0 @@ try { |
| { | ||
| "name": "@blotoutio/providers-google-analytics-4-sdk", | ||
| "version": "0.8.5", | ||
| "version": "0.9.0", | ||
| "description": "Google Analytics 4 Browser SDK for EdgeTag", | ||
@@ -5,0 +5,0 @@ "author": "Blotout", |
New alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Major refactor
Supply chain riskPackage has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.
Found 1 instance in 1 package
Fixed alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Worsened metrics
- Total package byte prevSize
- decreased by-70.48%
6172
- Lines of code
- decreased by-66.79%
175
- Number of medium supply chain risk alerts
- increased byInfinity%
1
No dependency changes