typeorm 0.3.29-dev.cc07c90 → 1.0.0-beta.1

package/util/PathUtils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/util/PathUtils.ts"],"names":[],"mappings":";;AAKA,wCAYC;AAMD,wCAGC;AAKD,gCAEC;AAjCD,+CAAoC;AAEpC,MAAM,mBAAmB,GAAG,iBAAiB,CAAA;AAC7C,MAAM,uBAAuB,GAAG,mBAAmB,CAAA;AAEnD,SAAgB,cAAc,CAAC,QAAgB;IAC3C,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO;QAAE,OAAO,QAAQ,CAAA;IAEjD,IAAI,QAAQ,CAAC,KAAK,CAAC,mBAAmB,CAAC;QACnC,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,mBAAmB,EAAE,KAAK,CAAC,CAAA;SACtD,IAAI,QAAQ,CAAC,KAAK,CAAC,uBAAuB,CAAC;QAC5C,QAAQ,GAAG,QAAQ,CAAC,OAAO,CACvB,uBAAuB,EACvB,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CACtD,CAAA;IAEL,OAAO,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;AACvC,CAAC;AAED;;;GAGG;AACH,SAAgB,cAAc,CAAC,QAAgB;IAC3C,MAAM,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAA;IACnD,OAAO,IAAA,kBAAI,EAAC,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;AACrC,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,QAAgB;IACvC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,uBAAuB,CAAC,CAAA;AACpD,CAAC","file":"PathUtils.js","sourcesContent":["import { hash } from \"./StringUtils\"\n\nconst WINDOWS_PATH_REGEXP = /^([a-zA-Z]:.*)$/\nconst UNC_WINDOWS_PATH_REGEXP = /^\\\\\\\\(\\.\\\\)?(.*)$/\n\nexport function toPortablePath(filepath: string): string {\n    if (process.platform !== `win32`) return filepath\n\n    if (filepath.match(WINDOWS_PATH_REGEXP))\n        filepath = filepath.replace(WINDOWS_PATH_REGEXP, `/$1`)\n    else if (filepath.match(UNC_WINDOWS_PATH_REGEXP))\n        filepath = filepath.replace(\n            UNC_WINDOWS_PATH_REGEXP,\n            (match, p1, p2) => `/unc/${p1 ? `.dot/` : ``}${p2}`,\n        )\n\n    return filepath.replace(/\\\\/g, `/`)\n}\n\n/**\n * Create deterministic valid database name (class, database) of fixed length from any filepath. Equivalent paths for windows/posix systems should\n * be equivalent to enable portability\n */\nexport function filepathToName(filepath: string): string {\n    const uniq = toPortablePath(filepath).toLowerCase()\n    return hash(uniq, { length: 63 })\n}\n\n/**\n * Cross platform isAbsolute\n */\nexport function isAbsolute(filepath: string): boolean {\n    return !!filepath.match(/^(?:[a-z]:|[\\\\]|[/])/i)\n}\n"],"sourceRoot":".."}
+{"version":3,"file":"PathUtils.js","sourceRoot":"","sources":["../../../src/util/PathUtils.ts"],"names":[],"mappings":";;AASA,wCAYC;AAOD,wCAGC;AAMD,gCAEC;AAvCD,+CAAoC;AAEpC,MAAM,mBAAmB,GAAG,iBAAiB,CAAA;AAC7C,MAAM,uBAAuB,GAAG,mBAAmB,CAAA;AAEnD;;;GAGG;AACH,SAAgB,cAAc,CAAC,QAAgB;IAC3C,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO;QAAE,OAAO,QAAQ,CAAA;IAEjD,IAAI,QAAQ,CAAC,KAAK,CAAC,mBAAmB,CAAC;QACnC,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,mBAAmB,EAAE,KAAK,CAAC,CAAA;SACtD,IAAI,QAAQ,CAAC,KAAK,CAAC,uBAAuB,CAAC;QAC5C,QAAQ,GAAG,QAAQ,CAAC,OAAO,CACvB,uBAAuB,EACvB,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CACtD,CAAA;IAEL,OAAO,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;AACvC,CAAC;AAED;;;;GAIG;AACH,SAAgB,cAAc,CAAC,QAAgB;IAC3C,MAAM,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAA;IACnD,OAAO,IAAA,kBAAI,EAAC,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;AACrC,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CAAC,QAAgB;IACvC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,uBAAuB,CAAC,CAAA;AACpD,CAAC","sourcesContent":["import { hash } from \"./StringUtils\"\n\nconst WINDOWS_PATH_REGEXP = /^([a-zA-Z]:.*)$/\nconst UNC_WINDOWS_PATH_REGEXP = /^\\\\\\\\(\\.\\\\)?(.*)$/\n\n/**\n *\n * @param filepath\n */\nexport function toPortablePath(filepath: string): string {\n    if (process.platform !== `win32`) return filepath\n\n    if (filepath.match(WINDOWS_PATH_REGEXP))\n        filepath = filepath.replace(WINDOWS_PATH_REGEXP, `/$1`)\n    else if (filepath.match(UNC_WINDOWS_PATH_REGEXP))\n        filepath = filepath.replace(\n            UNC_WINDOWS_PATH_REGEXP,\n            (match, p1, p2) => `/unc/${p1 ? `.dot/` : ``}${p2}`,\n        )\n\n    return filepath.replace(/\\\\/g, `/`)\n}\n\n/**\n * Create deterministic valid database name (class, database) of fixed length from any filepath. Equivalent paths for windows/posix systems should\n * be equivalent to enable portability\n * @param filepath\n */\nexport function filepathToName(filepath: string): string {\n    const uniq = toPortablePath(filepath).toLowerCase()\n    return hash(uniq, { length: 63 })\n}\n\n/**\n * Cross platform isAbsolute\n * @param filepath\n */\nexport function isAbsolute(filepath: string): boolean {\n    return !!filepath.match(/^(?:[a-z]:|[\\\\]|[/])/i)\n}\n"]}

package/util/RandomGenerator.d.ts

@@ -1,4 +1,11 @@
 export declare class RandomGenerator {
+    /**
+     * Generates a RFC 4122 version 4 UUID.
+     * Uses native crypto.randomUUID() if available, otherwise falls back to
+     * a custom implementation using crypto.getRandomValues().
+     * @returns A version 4 UUID string
+     */
+    static uuidv4(): string;
     /**
      *  discuss at: http://locutus.io/php/sha1/
      * original by: Webtoolkit.info (http://www.webtoolkit.info/)
@@ -10,6 +17,8 @@ export declare class RandomGenerator {
      *      note 1: in a steaming fashion for faster and more efficient hashing
      *   example 1: sha1('Kevin van Zonneveld')
      *   returns 1: '54916d2e62f65b3afa6e192e6a601cdbe5cb5897'
+     * @param str String to be hashed.
+     * @returns SHA-1 hex digest
      */
     static sha1(str: string): string;
 }

package/util/RandomGenerator.js

@@ -2,6 +2,50 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.RandomGenerator = void 0;
 class RandomGenerator {
+    /**
+     * Generates a RFC 4122 version 4 UUID.
+     * Uses native crypto.randomUUID() if available, otherwise falls back to
+     * a custom implementation using crypto.getRandomValues().
+     * @returns A version 4 UUID string
+     */
+    static uuidv4() {
+        // Try native crypto.randomUUID() (available in Node.js 19+ and modern browsers)
+        const uuid = globalThis.crypto?.randomUUID?.();
+        if (uuid) {
+            return uuid;
+        }
+        // Custom implementation using crypto.getRandomValues()
+        // Based on RFC 4122 version 4 UUID specification
+        const randomBytes = new Uint8Array(16);
+        if (globalThis.crypto?.getRandomValues) {
+            globalThis.crypto.getRandomValues(randomBytes);
+        }
+        else {
+            // Fallback for React Native/Hermes and environments without crypto support
+            // Hermes (React Native's JavaScript engine) does not provide crypto APIs
+            // Math.random() is permitted by RFC 4122 for UUID v4 ("pseudo-randomly")
+            // This approach is also used by expo-crypto and other RN libraries
+            // Note: For TypeORM's use case (DB IDs, cache IDs), uniqueness is sufficient
+            for (let i = 0; i < 16; i++) {
+                randomBytes[i] = Math.floor(Math.random() * 256);
+            }
+        }
+        // Set version (4) and variant bits according to RFC 4122
+        randomBytes[6] = (randomBytes[6] & 0x0f) | 0x40; // Version 4
+        randomBytes[8] = (randomBytes[8] & 0x3f) | 0x80; // Variant 10
+        // Convert to UUID string format (xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx)
+        const hexValues = [];
+        randomBytes.forEach((byte) => {
+            hexValues.push(byte.toString(16).padStart(2, "0"));
+        });
+        return [
+            hexValues.slice(0, 4).join(""),
+            hexValues.slice(4, 6).join(""),
+            hexValues.slice(6, 8).join(""),
+            hexValues.slice(8, 10).join(""),
+            hexValues.slice(10, 16).join(""),
+        ].join("-");
+    }
     /**
      *  discuss at: http://locutus.io/php/sha1/
      * original by: Webtoolkit.info (http://www.webtoolkit.info/)
@@ -13,6 +57,8 @@ class RandomGenerator {
      *      note 1: in a steaming fashion for faster and more efficient hashing
      *   example 1: sha1('Kevin van Zonneveld')
      *   returns 1: '54916d2e62f65b3afa6e192e6a601cdbe5cb5897'
+     * @param str String to be hashed.
+     * @returns SHA-1 hex digest
      */
     static sha1(str) {
         const _rotLeft = function (n, s) {
@@ -21,54 +67,42 @@ class RandomGenerator {
         };
         const _cvtHex = function (val) {
             let str = "";
-            let i;
-            let v;
-            for (i = 7; i >= 0; i--) {
-                v = (val >>> (i * 4)) & 0x0f;
+            for (let i = 7; i >= 0; i--) {
+                const v = (val >>> (i * 4)) & 0x0f;
                 str += v.toString(16);
             }
             return str;
         };
-        let blockstart;
-        let i, j;
-        const W = new Array(80);
-        let H0 = 0x67452301;
-        let H1 = 0xefcdab89;
-        let H2 = 0x98badcfe;
-        let H3 = 0x10325476;
-        let H4 = 0xc3d2e1f0;
-        let A, B, C, D, E;
-        let temp;
         // utf8_encode
-        str = /*unescape*/ encodeURIComponent(str);
-        const strLen = str.length;
+        const bytes = new TextEncoder().encode(str);
+        const bytesLength = bytes.length;
         const wordArray = [];
-        for (i = 0; i < strLen - 3; i += 4) {
-            j =
-                (str.charCodeAt(i) << 24) |
-                    (str.charCodeAt(i + 1) << 16) |
-                    (str.charCodeAt(i + 2) << 8) |
-                    str.charCodeAt(i + 3);
+        for (let i = 0; i < bytesLength - 3; i += 4) {
+            const j = (bytes[i] << 24) |
+                (bytes[i + 1] << 16) |
+                (bytes[i + 2] << 8) |
+                bytes[i + 3];
             wordArray.push(j);
         }
-        switch (strLen % 4) {
+        let i = 0;
+        switch (bytesLength % 4) {
             case 0:
                 i = 0x080000000;
                 break;
             case 1:
-                i = (str.charCodeAt(strLen - 1) << 24) | 0x0800000;
+                i = (bytes[bytesLength - 1] << 24) | 0x0800000;
                 break;
             case 2:
                 i =
-                    (str.charCodeAt(strLen - 2) << 24) |
-                        (str.charCodeAt(strLen - 1) << 16) |
+                    (bytes[bytesLength - 2] << 24) |
+                        (bytes[bytesLength - 1] << 16) |
                         0x08000;
                 break;
             case 3:
                 i =
-                    (str.charCodeAt(strLen - 3) << 24) |
-                        (str.charCodeAt(strLen - 2) << 16) |
-                        (str.charCodeAt(strLen - 1) << 8) |
+                    (bytes[bytesLength - 3] << 24) |
+                        (bytes[bytesLength - 2] << 16) |
+                        (bytes[bytesLength - 1] << 8) |
                         0x80;
                 break;
         }
@@ -76,62 +110,64 @@ class RandomGenerator {
         while (wordArray.length % 16 !== 14) {
             wordArray.push(0);
         }
-        wordArray.push(strLen >>> 29);
-        wordArray.push((strLen << 3) & 0x0ffffffff);
-        for (blockstart = 0; blockstart < wordArray.length; blockstart += 16) {
-            for (i = 0; i < 16; i++) {
+        wordArray.push(bytesLength >>> 29);
+        wordArray.push((bytesLength << 3) & 0x0ffffffff);
+        let H0 = 0x67452301;
+        let H1 = 0xefcdab89;
+        let H2 = 0x98badcfe;
+        let H3 = 0x10325476;
+        let H4 = 0xc3d2e1f0;
+        for (let blockstart = 0; blockstart < wordArray.length; blockstart += 16) {
+            const W = new Array(80);
+            for (let i = 0; i < 16; i++) {
                 W[i] = wordArray[blockstart + i];
             }
-            for (i = 16; i <= 79; i++) {
+            for (let i = 16; i <= 79; i++) {
                 W[i] = _rotLeft(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
             }
-            A = H0;
-            B = H1;
-            C = H2;
-            D = H3;
-            E = H4;
-            for (i = 0; i <= 19; i++) {
-                temp =
-                    (_rotLeft(A, 5) +
-                        ((B & C) | (~B & D)) +
-                        E +
-                        W[i] +
-                        0x5a827999) &
-                        0x0ffffffff;
+            let A = H0;
+            let B = H1;
+            let C = H2;
+            let D = H3;
+            let E = H4;
+            for (let i = 0; i <= 19; i++) {
+                const temp = (_rotLeft(A, 5) +
+                    ((B & C) | (~B & D)) +
+                    E +
+                    W[i] +
+                    0x5a827999) &
+                    0x0ffffffff;
                 E = D;
                 D = C;
                 C = _rotLeft(B, 30);
                 B = A;
                 A = temp;
             }
-            for (i = 20; i <= 39; i++) {
-                temp =
-                    (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0x6ed9eba1) &
-                        0x0ffffffff;
+            for (let i = 20; i <= 39; i++) {
+                const temp = (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0x6ed9eba1) &
+                    0x0ffffffff;
                 E = D;
                 D = C;
                 C = _rotLeft(B, 30);
                 B = A;
                 A = temp;
             }
-            for (i = 40; i <= 59; i++) {
-                temp =
-                    (_rotLeft(A, 5) +
-                        ((B & C) | (B & D) | (C & D)) +
-                        E +
-                        W[i] +
-                        0x8f1bbcdc) &
-                        0x0ffffffff;
+            for (let i = 40; i <= 59; i++) {
+                const temp = (_rotLeft(A, 5) +
+                    ((B & C) | (B & D) | (C & D)) +
+                    E +
+                    W[i] +
+                    0x8f1bbcdc) &
+                    0x0ffffffff;
                 E = D;
                 D = C;
                 C = _rotLeft(B, 30);
                 B = A;
                 A = temp;
             }
-            for (i = 60; i <= 79; i++) {
-                temp =
-                    (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0xca62c1d6) &
-                        0x0ffffffff;
+            for (let i = 60; i <= 79; i++) {
+                const temp = (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0xca62c1d6) &
+                    0x0ffffffff;
                 E = D;
                 D = C;
                 C = _rotLeft(B, 30);
@@ -144,11 +180,9 @@ class RandomGenerator {
             H3 = (H3 + D) & 0x0ffffffff;
             H4 = (H4 + E) & 0x0ffffffff;
         }
-        temp =
-            _cvtHex(H0) + _cvtHex(H1) + _cvtHex(H2) + _cvtHex(H3) + _cvtHex(H4);
-        return temp.toLowerCase();
+        const ans = _cvtHex(H0) + _cvtHex(H1) + _cvtHex(H2) + _cvtHex(H3) + _cvtHex(H4);
+        return ans.toLowerCase();
     }
 }
 exports.RandomGenerator = RandomGenerator;
-
-//# sourceMappingURL=RandomGenerator.js.map
+//# sourceMappingURL=RandomGenerator.js.map

package/util/RandomGenerator.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/util/RandomGenerator.ts"],"names":[],"mappings":";;;AAAA,MAAa,eAAe;IACxB;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,IAAI,CAAC,GAAW;QACnB,MAAM,QAAQ,GAAG,UAAU,CAAM,EAAE,CAAM;YACrC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA;YACtC,OAAO,EAAE,CAAA;QACb,CAAC,CAAA;QAED,MAAM,OAAO,GAAG,UAAU,GAAQ;YAC9B,IAAI,GAAG,GAAG,EAAE,CAAA;YACZ,IAAI,CAAC,CAAA;YACL,IAAI,CAAC,CAAA;YAEL,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtB,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;gBAC5B,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;YACzB,CAAC;YACD,OAAO,GAAG,CAAA;QACd,CAAC,CAAA;QAED,IAAI,UAAU,CAAA;QACd,IAAI,CAAC,EAAE,CAAC,CAAA;QACR,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAA;QACvB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;QACjB,IAAI,IAAI,CAAA;QAER,cAAc;QACd,GAAG,GAAG,YAAY,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAA;QAC1C,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAA;QAEzB,MAAM,SAAS,GAAG,EAAE,CAAA;QACpB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,CAAC;gBACG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACzB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;oBAC7B,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;oBAC5B,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACzB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC;QAED,QAAQ,MAAM,GAAG,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC;gBACF,CAAC,GAAG,WAAW,CAAA;gBACf,MAAK;YACT,KAAK,CAAC;gBACF,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,SAAS,CAAA;gBAClD,MAAK;YACT,KAAK,CAAC;gBACF,CAAC;oBACG,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAClC,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAClC,OAAO,CAAA;gBACX,MAAK;YACT,KAAK,CAAC;gBACF,CAAC;oBACG,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAClC,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAClC,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;wBACjC,IAAI,CAAA;gBACR,MAAK;QACb,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAEjB,OAAO,SAAS,CAAC,MAAM,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YAClC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAA;QAC7B,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,CAAA;QAE3C,KAAK,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC,MAAM,EAAE,UAAU,IAAI,EAAE,EAAE,CAAC;YACnE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtB,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC,CAAA;YACpC,CAAC;YACD,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxB,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACnE,CAAC;YAED,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;YAEN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvB,IAAI;oBACA,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;wBACX,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBACpB,CAAC;wBACD,CAAC,CAAC,CAAC,CAAC;wBACJ,UAAU,CAAC;wBACf,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxB,IAAI;oBACA,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;wBACtD,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxB,IAAI;oBACA,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;wBACX,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAC7B,CAAC;wBACD,CAAC,CAAC,CAAC,CAAC;wBACJ,UAAU,CAAC;wBACf,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxB,IAAI;oBACA,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;wBACtD,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;QAC/B,CAAC;QAED,IAAI;YACA,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;QACvE,OAAO,IAAI,CAAC,WAAW,EAAE,CAAA;IAC7B,CAAC;CACJ;AApKD,0CAoKC","file":"RandomGenerator.js","sourcesContent":["export class RandomGenerator {\n    /**\n     *  discuss at: http://locutus.io/php/sha1/\n     * original by: Webtoolkit.info (http://www.webtoolkit.info/)\n     * improved by: Michael White (http://getsprink.com)\n     * improved by: Kevin van Zonneveld (http://kvz.io)\n     *    input by: Brett Zamir (http://brett-zamir.me)\n     *      note 1: Keep in mind that in accordance with PHP, the whole string is buffered and then\n     *      note 1: hashed. If available, we'd recommend using Node's native crypto modules directly\n     *      note 1: in a steaming fashion for faster and more efficient hashing\n     *   example 1: sha1('Kevin van Zonneveld')\n     *   returns 1: '54916d2e62f65b3afa6e192e6a601cdbe5cb5897'\n     */\n    static sha1(str: string) {\n        const _rotLeft = function (n: any, s: any) {\n            const t4 = (n << s) | (n >>> (32 - s))\n            return t4\n        }\n\n        const _cvtHex = function (val: any) {\n            let str = \"\"\n            let i\n            let v\n\n            for (i = 7; i >= 0; i--) {\n                v = (val >>> (i * 4)) & 0x0f\n                str += v.toString(16)\n            }\n            return str\n        }\n\n        let blockstart\n        let i, j\n        const W = new Array(80)\n        let H0 = 0x67452301\n        let H1 = 0xefcdab89\n        let H2 = 0x98badcfe\n        let H3 = 0x10325476\n        let H4 = 0xc3d2e1f0\n        let A, B, C, D, E\n        let temp\n\n        // utf8_encode\n        str = /*unescape*/ encodeURIComponent(str)\n        const strLen = str.length\n\n        const wordArray = []\n        for (i = 0; i < strLen - 3; i += 4) {\n            j =\n                (str.charCodeAt(i) << 24) |\n                (str.charCodeAt(i + 1) << 16) |\n                (str.charCodeAt(i + 2) << 8) |\n                str.charCodeAt(i + 3)\n            wordArray.push(j)\n        }\n\n        switch (strLen % 4) {\n            case 0:\n                i = 0x080000000\n                break\n            case 1:\n                i = (str.charCodeAt(strLen - 1) << 24) | 0x0800000\n                break\n            case 2:\n                i =\n                    (str.charCodeAt(strLen - 2) << 24) |\n                    (str.charCodeAt(strLen - 1) << 16) |\n                    0x08000\n                break\n            case 3:\n                i =\n                    (str.charCodeAt(strLen - 3) << 24) |\n                    (str.charCodeAt(strLen - 2) << 16) |\n                    (str.charCodeAt(strLen - 1) << 8) |\n                    0x80\n                break\n        }\n\n        wordArray.push(i)\n\n        while (wordArray.length % 16 !== 14) {\n            wordArray.push(0)\n        }\n\n        wordArray.push(strLen >>> 29)\n        wordArray.push((strLen << 3) & 0x0ffffffff)\n\n        for (blockstart = 0; blockstart < wordArray.length; blockstart += 16) {\n            for (i = 0; i < 16; i++) {\n                W[i] = wordArray[blockstart + i]\n            }\n            for (i = 16; i <= 79; i++) {\n                W[i] = _rotLeft(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1)\n            }\n\n            A = H0\n            B = H1\n            C = H2\n            D = H3\n            E = H4\n\n            for (i = 0; i <= 19; i++) {\n                temp =\n                    (_rotLeft(A, 5) +\n                        ((B & C) | (~B & D)) +\n                        E +\n                        W[i] +\n                        0x5a827999) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            for (i = 20; i <= 39; i++) {\n                temp =\n                    (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0x6ed9eba1) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            for (i = 40; i <= 59; i++) {\n                temp =\n                    (_rotLeft(A, 5) +\n                        ((B & C) | (B & D) | (C & D)) +\n                        E +\n                        W[i] +\n                        0x8f1bbcdc) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            for (i = 60; i <= 79; i++) {\n                temp =\n                    (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0xca62c1d6) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            H0 = (H0 + A) & 0x0ffffffff\n            H1 = (H1 + B) & 0x0ffffffff\n            H2 = (H2 + C) & 0x0ffffffff\n            H3 = (H3 + D) & 0x0ffffffff\n            H4 = (H4 + E) & 0x0ffffffff\n        }\n\n        temp =\n            _cvtHex(H0) + _cvtHex(H1) + _cvtHex(H2) + _cvtHex(H3) + _cvtHex(H4)\n        return temp.toLowerCase()\n    }\n}\n"],"sourceRoot":".."}
+{"version":3,"file":"RandomGenerator.js","sourceRoot":"","sources":["../../../src/util/RandomGenerator.ts"],"names":[],"mappings":";;;AAAA,MAAa,eAAe;IACxB;;;;;OAKG;IACH,MAAM,CAAC,MAAM;QACT,gFAAgF;QAChF,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAA;QAC9C,IAAI,IAAI,EAAE,CAAC;YACP,OAAO,IAAI,CAAA;QACf,CAAC;QAED,uDAAuD;QACvD,iDAAiD;QACjD,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAA;QAEtC,IAAI,UAAU,CAAC,MAAM,EAAE,eAAe,EAAE,CAAC;YACrC,UAAU,CAAC,MAAM,CAAC,eAAe,CAAC,WAAW,CAAC,CAAA;QAClD,CAAC;aAAM,CAAC;YACJ,2EAA2E;YAC3E,yEAAyE;YACzE,yEAAyE;YACzE,mEAAmE;YACnE,6EAA6E;YAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1B,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAA;YACpD,CAAC;QACL,CAAC;QAED,yDAAyD;QACzD,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAA,CAAC,YAAY;QAC5D,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAA,CAAC,aAAa;QAE7D,uEAAuE;QACvE,MAAM,SAAS,GAAa,EAAE,CAAA;QAC9B,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACzB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QACtD,CAAC,CAAC,CAAA;QAEF,OAAO;YACH,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;SACnC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACf,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,IAAI,CAAC,GAAW;QACnB,MAAM,QAAQ,GAAG,UAAU,CAAS,EAAE,CAAS;YAC3C,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA;YACtC,OAAO,EAAE,CAAA;QACb,CAAC,CAAA;QAED,MAAM,OAAO,GAAG,UAAU,GAAW;YACjC,IAAI,GAAG,GAAG,EAAE,CAAA;YAEZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;gBAClC,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;YACzB,CAAC;YACD,OAAO,GAAG,CAAA;QACd,CAAC,CAAA;QAED,cAAc;QACd,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAA;QAEhC,MAAM,SAAS,GAAa,EAAE,CAAA;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,GACH,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAChB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;gBACpB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBACnB,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAChB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC;QAED,IAAI,CAAC,GAAW,CAAC,CAAA;QACjB,QAAQ,WAAW,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC;gBACF,CAAC,GAAG,WAAW,CAAA;gBACf,MAAK;YACT,KAAK,CAAC;gBACF,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,SAAS,CAAA;gBAC9C,MAAK;YACT,KAAK,CAAC;gBACF,CAAC;oBACG,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAC9B,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAC9B,OAAO,CAAA;gBACX,MAAK;YACT,KAAK,CAAC;gBACF,CAAC;oBACG,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAC9B,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBAC9B,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;wBAC7B,IAAI,CAAA;gBACR,MAAK;QACb,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAEjB,OAAO,SAAS,CAAC,MAAM,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YAClC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,WAAW,KAAK,EAAE,CAAC,CAAA;QAClC,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,CAAA;QAEhD,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QACnB,IAAI,EAAE,GAAG,UAAU,CAAA;QAEnB,KACI,IAAI,UAAU,GAAG,CAAC,EAClB,UAAU,GAAG,SAAS,CAAC,MAAM,EAC7B,UAAU,IAAI,EAAE,EAClB,CAAC;YACC,MAAM,CAAC,GAAa,IAAI,KAAK,CAAC,EAAE,CAAC,CAAA;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1B,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC,CAAA;YACpC,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACnE,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAA;YACV,IAAI,CAAC,GAAG,EAAE,CAAA;YACV,IAAI,CAAC,GAAG,EAAE,CAAA;YACV,IAAI,CAAC,GAAG,EAAE,CAAA;YACV,IAAI,CAAC,GAAG,EAAE,CAAA;YAEV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,IAAI,GACN,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACpB,CAAC;oBACD,CAAC,CAAC,CAAC,CAAC;oBACJ,UAAU,CAAC;oBACf,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,MAAM,IAAI,GACN,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;oBACtD,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,MAAM,IAAI,GACN,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC7B,CAAC;oBACD,CAAC,CAAC,CAAC,CAAC;oBACJ,UAAU,CAAC;oBACf,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,MAAM,IAAI,GACN,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;oBACtD,WAAW,CAAA;gBACf,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACnB,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,GAAG,IAAI,CAAA;YACZ,CAAC;YAED,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;YAC3B,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAA;QAC/B,CAAC;QAED,MAAM,GAAG,GACL,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;QACvE,OAAO,GAAG,CAAC,WAAW,EAAE,CAAA;IAC5B,CAAC;CACJ;AAtND,0CAsNC","sourcesContent":["export class RandomGenerator {\n    /**\n     * Generates a RFC 4122 version 4 UUID.\n     * Uses native crypto.randomUUID() if available, otherwise falls back to\n     * a custom implementation using crypto.getRandomValues().\n     * @returns A version 4 UUID string\n     */\n    static uuidv4(): string {\n        // Try native crypto.randomUUID() (available in Node.js 19+ and modern browsers)\n        const uuid = globalThis.crypto?.randomUUID?.()\n        if (uuid) {\n            return uuid\n        }\n\n        // Custom implementation using crypto.getRandomValues()\n        // Based on RFC 4122 version 4 UUID specification\n        const randomBytes = new Uint8Array(16)\n\n        if (globalThis.crypto?.getRandomValues) {\n            globalThis.crypto.getRandomValues(randomBytes)\n        } else {\n            // Fallback for React Native/Hermes and environments without crypto support\n            // Hermes (React Native's JavaScript engine) does not provide crypto APIs\n            // Math.random() is permitted by RFC 4122 for UUID v4 (\"pseudo-randomly\")\n            // This approach is also used by expo-crypto and other RN libraries\n            // Note: For TypeORM's use case (DB IDs, cache IDs), uniqueness is sufficient\n            for (let i = 0; i < 16; i++) {\n                randomBytes[i] = Math.floor(Math.random() * 256)\n            }\n        }\n\n        // Set version (4) and variant bits according to RFC 4122\n        randomBytes[6] = (randomBytes[6] & 0x0f) | 0x40 // Version 4\n        randomBytes[8] = (randomBytes[8] & 0x3f) | 0x80 // Variant 10\n\n        // Convert to UUID string format (xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx)\n        const hexValues: string[] = []\n        randomBytes.forEach((byte) => {\n            hexValues.push(byte.toString(16).padStart(2, \"0\"))\n        })\n\n        return [\n            hexValues.slice(0, 4).join(\"\"),\n            hexValues.slice(4, 6).join(\"\"),\n            hexValues.slice(6, 8).join(\"\"),\n            hexValues.slice(8, 10).join(\"\"),\n            hexValues.slice(10, 16).join(\"\"),\n        ].join(\"-\")\n    }\n\n    /**\n     *  discuss at: http://locutus.io/php/sha1/\n     * original by: Webtoolkit.info (http://www.webtoolkit.info/)\n     * improved by: Michael White (http://getsprink.com)\n     * improved by: Kevin van Zonneveld (http://kvz.io)\n     *    input by: Brett Zamir (http://brett-zamir.me)\n     *      note 1: Keep in mind that in accordance with PHP, the whole string is buffered and then\n     *      note 1: hashed. If available, we'd recommend using Node's native crypto modules directly\n     *      note 1: in a steaming fashion for faster and more efficient hashing\n     *   example 1: sha1('Kevin van Zonneveld')\n     *   returns 1: '54916d2e62f65b3afa6e192e6a601cdbe5cb5897'\n     * @param str String to be hashed.\n     * @returns SHA-1 hex digest\n     */\n    static sha1(str: string) {\n        const _rotLeft = function (n: number, s: number): number {\n            const t4 = (n << s) | (n >>> (32 - s))\n            return t4\n        }\n\n        const _cvtHex = function (val: number): string {\n            let str = \"\"\n\n            for (let i = 7; i >= 0; i--) {\n                const v = (val >>> (i * 4)) & 0x0f\n                str += v.toString(16)\n            }\n            return str\n        }\n\n        // utf8_encode\n        const bytes = new TextEncoder().encode(str)\n        const bytesLength = bytes.length\n\n        const wordArray: number[] = []\n        for (let i = 0; i < bytesLength - 3; i += 4) {\n            const j =\n                (bytes[i] << 24) |\n                (bytes[i + 1] << 16) |\n                (bytes[i + 2] << 8) |\n                bytes[i + 3]\n            wordArray.push(j)\n        }\n\n        let i: number = 0\n        switch (bytesLength % 4) {\n            case 0:\n                i = 0x080000000\n                break\n            case 1:\n                i = (bytes[bytesLength - 1] << 24) | 0x0800000\n                break\n            case 2:\n                i =\n                    (bytes[bytesLength - 2] << 24) |\n                    (bytes[bytesLength - 1] << 16) |\n                    0x08000\n                break\n            case 3:\n                i =\n                    (bytes[bytesLength - 3] << 24) |\n                    (bytes[bytesLength - 2] << 16) |\n                    (bytes[bytesLength - 1] << 8) |\n                    0x80\n                break\n        }\n\n        wordArray.push(i)\n\n        while (wordArray.length % 16 !== 14) {\n            wordArray.push(0)\n        }\n\n        wordArray.push(bytesLength >>> 29)\n        wordArray.push((bytesLength << 3) & 0x0ffffffff)\n\n        let H0 = 0x67452301\n        let H1 = 0xefcdab89\n        let H2 = 0x98badcfe\n        let H3 = 0x10325476\n        let H4 = 0xc3d2e1f0\n\n        for (\n            let blockstart = 0;\n            blockstart < wordArray.length;\n            blockstart += 16\n        ) {\n            const W: number[] = new Array(80)\n            for (let i = 0; i < 16; i++) {\n                W[i] = wordArray[blockstart + i]\n            }\n            for (let i = 16; i <= 79; i++) {\n                W[i] = _rotLeft(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1)\n            }\n\n            let A = H0\n            let B = H1\n            let C = H2\n            let D = H3\n            let E = H4\n\n            for (let i = 0; i <= 19; i++) {\n                const temp =\n                    (_rotLeft(A, 5) +\n                        ((B & C) | (~B & D)) +\n                        E +\n                        W[i] +\n                        0x5a827999) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            for (let i = 20; i <= 39; i++) {\n                const temp =\n                    (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0x6ed9eba1) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            for (let i = 40; i <= 59; i++) {\n                const temp =\n                    (_rotLeft(A, 5) +\n                        ((B & C) | (B & D) | (C & D)) +\n                        E +\n                        W[i] +\n                        0x8f1bbcdc) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            for (let i = 60; i <= 79; i++) {\n                const temp =\n                    (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0xca62c1d6) &\n                    0x0ffffffff\n                E = D\n                D = C\n                C = _rotLeft(B, 30)\n                B = A\n                A = temp\n            }\n\n            H0 = (H0 + A) & 0x0ffffffff\n            H1 = (H1 + B) & 0x0ffffffff\n            H2 = (H2 + C) & 0x0ffffffff\n            H3 = (H3 + D) & 0x0ffffffff\n            H4 = (H4 + E) & 0x0ffffffff\n        }\n\n        const ans =\n            _cvtHex(H0) + _cvtHex(H1) + _cvtHex(H2) + _cvtHex(H3) + _cvtHex(H4)\n        return ans.toLowerCase()\n    }\n}\n"]}

package/util/SqlTagUtils.d.ts

@@ -1,9 +1,16 @@
-import { Driver } from "../driver/Driver";
+import type { Driver } from "../driver/Driver";
 interface BuildSqlTagParams {
     driver: Driver;
     strings: TemplateStringsArray;
     expressions: unknown[];
 }
+/**
+ *
+ * @param root0
+ * @param root0.driver
+ * @param root0.strings
+ * @param root0.expressions
+ */
 export declare function buildSqlTag({ driver, strings, expressions, }: BuildSqlTagParams): {
     query: string;
     parameters: unknown[];

package/util/SqlTagUtils.js

@@ -3,6 +3,13 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.buildSqlTag = buildSqlTag;
 const tslib_1 = require("tslib");
 const dedent_1 = tslib_1.__importDefault(require("dedent"));
+/**
+ *
+ * @param root0
+ * @param root0.driver
+ * @param root0.strings
+ * @param root0.expressions
+ */
 function buildSqlTag({ driver, strings, expressions, }) {
     let query = "";
     const parameters = [];
@@ -39,5 +46,4 @@ function buildSqlTag({ driver, strings, expressions, }) {
     query = (0, dedent_1.default)(query);
     return { query, parameters };
 }
-
-//# sourceMappingURL=SqlTagUtils.js.map
+//# sourceMappingURL=SqlTagUtils.js.map

package/util/SqlTagUtils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/util/SqlTagUtils.ts"],"names":[],"mappings":";;AASA,kCA2DC;;AAnED,4DAA2B;AAQ3B,SAAgB,WAAW,CAAC,EACxB,MAAM,EACN,OAAO,EACP,WAAW,GACK;IAChB,IAAI,KAAK,GAAG,EAAE,CAAA;IACd,MAAM,UAAU,GAAc,EAAE,CAAA;IAChC,IAAI,GAAG,GAAG,CAAC,CAAA;IAEX,KAAK,MAAM,CAAC,aAAa,EAAE,UAAU,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9D,KAAK,IAAI,OAAO,CAAC,aAAa,CAAC,CAAA;QAE/B,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACtB,KAAK,IAAI,MAAM,CAAA;YACf,SAAQ;QACZ,CAAC;QAED,IAAI,OAAO,UAAU,KAAK,UAAU,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,UAAU,EAAE,CAAA;YAE1B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC5B,KAAK,IAAI,KAAK,CAAA;gBACd,SAAQ;YACZ,CAAC;YAED,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACrB,MAAM,IAAI,KAAK,CACX,cAAc,aAAa,wIAAwI,CACtK,CAAA;gBACL,CAAC;gBAED,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;oBAC/B,OAAO,MAAM,CAAC,eAAe,CAAC,SAAS,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;gBAC5D,CAAC,CAAC,CAAA;gBAEF,KAAK,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC/B,UAAU,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;gBAEzB,SAAQ;YACZ,CAAC;YAED,MAAM,IAAI,KAAK,CACX,cAAc,aAAa,8EACvB,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,KACrC,4GAA4G,CAC/G,CAAA;QACL,CAAC;QAED,KAAK,IAAI,MAAM,CAAC,eAAe,CAAC,SAAS,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;QAE1D,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;IAC/B,CAAC;IAED,KAAK,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAEpC,KAAK,GAAG,IAAA,gBAAM,EAAC,KAAK,CAAC,CAAA;IAErB,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAA;AAChC,CAAC","file":"SqlTagUtils.js","sourcesContent":["import { Driver } from \"../driver/Driver\"\nimport dedent from \"dedent\"\n\ninterface BuildSqlTagParams {\n    driver: Driver\n    strings: TemplateStringsArray\n    expressions: unknown[]\n}\n\nexport function buildSqlTag({\n    driver,\n    strings,\n    expressions,\n}: BuildSqlTagParams): { query: string; parameters: unknown[] } {\n    let query = \"\"\n    const parameters: unknown[] = []\n    let idx = 0\n\n    for (const [expressionIdx, expression] of expressions.entries()) {\n        query += strings[expressionIdx]\n\n        if (expression === null) {\n            query += \"NULL\"\n            continue\n        }\n\n        if (typeof expression === \"function\") {\n            const value = expression()\n\n            if (typeof value === \"string\") {\n                query += value\n                continue\n            }\n\n            if (Array.isArray(value)) {\n                if (value.length === 0) {\n                    throw new Error(\n                        `Expression ${expressionIdx} in this sql tagged template is a function which returned an empty array. Empty arrays cannot safely be expanded into parameter lists.`,\n                    )\n                }\n\n                const arrayParams = value.map(() => {\n                    return driver.createParameter(`param_${idx + 1}`, idx++)\n                })\n\n                query += arrayParams.join(\", \")\n                parameters.push(...value)\n\n                continue\n            }\n\n            throw new Error(\n                `Expression ${expressionIdx} in this sql tagged template is a function which returned a value of type \"${\n                    value === null ? \"null\" : typeof value\n                }\". Only array and string types are supported as function return values in sql tagged template expressions.`,\n            )\n        }\n\n        query += driver.createParameter(`param_${idx + 1}`, idx++)\n\n        parameters.push(expression)\n    }\n\n    query += strings[strings.length - 1]\n\n    query = dedent(query)\n\n    return { query, parameters }\n}\n"],"sourceRoot":".."}
+{"version":3,"file":"SqlTagUtils.js","sourceRoot":"","sources":["../../../src/util/SqlTagUtils.ts"],"names":[],"mappings":";;AAgBA,kCA2DC;;AA1ED,4DAA2B;AAQ3B;;;;;;GAMG;AACH,SAAgB,WAAW,CAAC,EACxB,MAAM,EACN,OAAO,EACP,WAAW,GACK;IAChB,IAAI,KAAK,GAAG,EAAE,CAAA;IACd,MAAM,UAAU,GAAc,EAAE,CAAA;IAChC,IAAI,GAAG,GAAG,CAAC,CAAA;IAEX,KAAK,MAAM,CAAC,aAAa,EAAE,UAAU,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9D,KAAK,IAAI,OAAO,CAAC,aAAa,CAAC,CAAA;QAE/B,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACtB,KAAK,IAAI,MAAM,CAAA;YACf,SAAQ;QACZ,CAAC;QAED,IAAI,OAAO,UAAU,KAAK,UAAU,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,UAAU,EAAE,CAAA;YAE1B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC5B,KAAK,IAAI,KAAK,CAAA;gBACd,SAAQ;YACZ,CAAC;YAED,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACrB,MAAM,IAAI,KAAK,CACX,cAAc,aAAa,wIAAwI,CACtK,CAAA;gBACL,CAAC;gBAED,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;oBAC/B,OAAO,MAAM,CAAC,eAAe,CAAC,SAAS,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;gBAC5D,CAAC,CAAC,CAAA;gBAEF,KAAK,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC/B,UAAU,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;gBAEzB,SAAQ;YACZ,CAAC;YAED,MAAM,IAAI,KAAK,CACX,cAAc,aAAa,8EACvB,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,KACrC,4GAA4G,CAC/G,CAAA;QACL,CAAC;QAED,KAAK,IAAI,MAAM,CAAC,eAAe,CAAC,SAAS,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;QAE1D,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;IAC/B,CAAC;IAED,KAAK,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAEpC,KAAK,GAAG,IAAA,gBAAM,EAAC,KAAK,CAAC,CAAA;IAErB,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAA;AAChC,CAAC","sourcesContent":["import type { Driver } from \"../driver/Driver\"\nimport dedent from \"dedent\"\n\ninterface BuildSqlTagParams {\n    driver: Driver\n    strings: TemplateStringsArray\n    expressions: unknown[]\n}\n\n/**\n *\n * @param root0\n * @param root0.driver\n * @param root0.strings\n * @param root0.expressions\n */\nexport function buildSqlTag({\n    driver,\n    strings,\n    expressions,\n}: BuildSqlTagParams): { query: string; parameters: unknown[] } {\n    let query = \"\"\n    const parameters: unknown[] = []\n    let idx = 0\n\n    for (const [expressionIdx, expression] of expressions.entries()) {\n        query += strings[expressionIdx]\n\n        if (expression === null) {\n            query += \"NULL\"\n            continue\n        }\n\n        if (typeof expression === \"function\") {\n            const value = expression()\n\n            if (typeof value === \"string\") {\n                query += value\n                continue\n            }\n\n            if (Array.isArray(value)) {\n                if (value.length === 0) {\n                    throw new Error(\n                        `Expression ${expressionIdx} in this sql tagged template is a function which returned an empty array. Empty arrays cannot safely be expanded into parameter lists.`,\n                    )\n                }\n\n                const arrayParams = value.map(() => {\n                    return driver.createParameter(`param_${idx + 1}`, idx++)\n                })\n\n                query += arrayParams.join(\", \")\n                parameters.push(...value)\n\n                continue\n            }\n\n            throw new Error(\n                `Expression ${expressionIdx} in this sql tagged template is a function which returned a value of type \"${\n                    value === null ? \"null\" : typeof value\n                }\". Only array and string types are supported as function return values in sql tagged template expressions.`,\n            )\n        }\n\n        query += driver.createParameter(`param_${idx + 1}`, idx++)\n\n        parameters.push(expression)\n    }\n\n    query += strings[strings.length - 1]\n\n    query = dedent(query)\n\n    return { query, parameters }\n}\n"]}

package/util/StringUtils.d.ts

@@ -1,22 +1,29 @@
 /**
  * Converts string into camelCase.
- *
+ * @param str String to be converted.
+ * @param firstCapital If true, the first character will be capitalized.
  * @see http://stackoverflow.com/questions/2970525/converting-any-string-into-camel-case
+ * @returns camelCase string
  */
 export declare function camelCase(str: string, firstCapital?: boolean): string;
 /**
  * Converts string into snake_case.
- *
+ * @param str String to be converted.
+ * @returns snake_case string
  */
 export declare function snakeCase(str: string): string;
 /**
  * Converts string into Title Case.
- *
+ * @param str String to be converted.
+ * @returns Title Case string
  * @see http://stackoverflow.com/questions/196972/convert-string-to-title-case-with-javascript
  */
 export declare function titleCase(str: string): string;
 /**
  * Builds abbreviated string from given string;
+ * @param str String to be abbreviated.
+ * @param abbrLettersCount Number of letters to be used for abbreviation.
+ * @returns abbreviated string
  */
 export declare function abbreviate(str: string, abbrLettersCount?: number): string;
 export interface IShortenOptions {
@@ -30,12 +37,9 @@ export interface IShortenOptions {
 /**
  * Shorten a given `input`. Useful for RDBMS imposing a limit on the
  * maximum length of aliases and column names in SQL queries.
- *
  * @param input String to be shortened.
  * @param options Default to `4` for segments length, `2` for terms length, `'__'` as a separator.
- *
- * @return Shortened `input`.
- *
+ * @returns Shortened `input`.
  * @example
  * // returns: "UsShCa__orde__mark__dire"
  * shorten('UserShoppingCart__order__market__director')
@@ -55,9 +59,10 @@ interface IHashOptions {
 }
 /**
  * Returns a SHA-1 hex digest for internal IDs/aliases (not for cryptographic security)
- *
  * @param input String to be hashed.
+ * @param options - Options object.
  * @param options.length Optionally, shorten the output to desired length.
+ * @returns SHA-1 hex digest
  */
 export declare function hash(input: string, options?: IHashOptions): string;
 export {};

package/util/StringUtils.js

@@ -6,12 +6,13 @@ exports.titleCase = titleCase;
 exports.abbreviate = abbreviate;
 exports.shorten = shorten;
 exports.hash = hash;
-const tslib_1 = require("tslib");
-const sha_js_1 = tslib_1.__importDefault(require("sha.js"));
+const RandomGenerator_1 = require("./RandomGenerator");
 /**
  * Converts string into camelCase.
- *
+ * @param str String to be converted.
+ * @param firstCapital If true, the first character will be capitalized.
  * @see http://stackoverflow.com/questions/2970525/converting-any-string-into-camel-case
+ * @returns camelCase string
  */
 function camelCase(str, firstCapital = false) {
     if (firstCapital)
@@ -24,7 +25,8 @@ function camelCase(str, firstCapital = false) {
 }
 /**
  * Converts string into snake_case.
- *
+ * @param str String to be converted.
+ * @returns snake_case string
  */
 function snakeCase(str) {
     return (str
@@ -36,7 +38,8 @@ function snakeCase(str) {
 }
 /**
  * Converts string into Title Case.
- *
+ * @param str String to be converted.
+ * @returns Title Case string
  * @see http://stackoverflow.com/questions/196972/convert-string-to-title-case-with-javascript
  */
 function titleCase(str) {
@@ -44,6 +47,9 @@ function titleCase(str) {
 }
 /**
  * Builds abbreviated string from given string;
+ * @param str String to be abbreviated.
+ * @param abbrLettersCount Number of letters to be used for abbreviation.
+ * @returns abbreviated string
  */
 function abbreviate(str, abbrLettersCount = 1) {
     const words = str
@@ -57,12 +63,9 @@ function abbreviate(str, abbrLettersCount = 1) {
 /**
  * Shorten a given `input`. Useful for RDBMS imposing a limit on the
  * maximum length of aliases and column names in SQL queries.
- *
  * @param input String to be shortened.
  * @param options Default to `4` for segments length, `2` for terms length, `'__'` as a separator.
- *
- * @return Shortened `input`.
- *
+ * @returns Shortened `input`.
  * @example
  * // returns: "UsShCa__orde__mark__dire"
  * shorten('UserShoppingCart__order__market__director')
@@ -83,6 +86,7 @@ function shorten(input, options = {}) {
         // split the given segment into many terms based on an eventual camel cased name
         const segmentTerms = val
             .replace(/([a-z\xE0-\xFF])([A-Z\xC0-\xDF])/g, "$1 $2")
+            .replace(/(_)([a-z])/g, " $2")
             .split(" ");
         // "OrderItemList" becomes "OrItLi", while "company" becomes "comp"
         const length = segmentTerms.length > 1 ? termLength : segmentLength;
@@ -94,20 +98,35 @@ function shorten(input, options = {}) {
     }, []);
     return shortSegments.join(separator);
 }
+/**
+ * Checks if the current environment is Node.js.
+ * @returns `true` if the current environment is Node.js, `false` otherwise.
+ */
+function isNode() {
+    return typeof process !== "undefined" && !!process.versions?.node;
+}
 /**
  * Returns a SHA-1 hex digest for internal IDs/aliases (not for cryptographic security)
- *
  * @param input String to be hashed.
+ * @param options - Options object.
  * @param options.length Optionally, shorten the output to desired length.
+ * @returns SHA-1 hex digest
  */
 function hash(input, options = {}) {
-    const hashFunction = (0, sha_js_1.default)("sha1");
-    hashFunction.update(input, "utf8");
-    const hashedInput = hashFunction.digest("hex");
+    let sha1;
+    if (isNode()) {
+        // eslint-disable-next-line @typescript-eslint/consistent-type-imports
+        const crypto = require("node:crypto");
+        const hashFunction = crypto.createHash("sha1");
+        hashFunction.update(input, "utf8");
+        sha1 = hashFunction.digest("hex");
+    }
+    else {
+        sha1 = RandomGenerator_1.RandomGenerator.sha1(input);
+    }
     if (options.length && options.length > 0) {
-        return hashedInput.slice(0, options.length);
+        return sha1.slice(0, options.length);
     }
-    return hashedInput;
+    return sha1;
 }
-
-//# sourceMappingURL=StringUtils.js.map
+//# sourceMappingURL=StringUtils.js.map

package/util/StringUtils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/util/StringUtils.ts"],"names":[],"mappings":";;AAOA,8BAMC;AAMD,8BASC;AAOD,8BAKC;AAKD,gCAQC;AAiCD,0BAoBC;AAYD,oBAQC;;AA9HD,4DAA0B;AAE1B;;;;GAIG;AACH,SAAgB,SAAS,CAAC,GAAW,EAAE,eAAwB,KAAK;IAChE,IAAI,YAAY;QAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;IACjC,OAAO,GAAG,CAAC,OAAO,CAAC,sBAAsB,EAAE,UAAU,KAAK,EAAE,EAAE,EAAE,EAAE;QAC9D,IAAI,EAAE;YAAE,OAAO,EAAE,CAAC,WAAW,EAAE,CAAA;QAC/B,OAAO,EAAE,CAAC,WAAW,EAAE,CAAA;IAC3B,CAAC,CAAC,CAAA;AACN,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CAAC,GAAW;IACjC,OAAO,CACH,GAAG;QACC,cAAc;SACb,OAAO,CAAC,wBAAwB,EAAE,SAAS,CAAC;QAC7C,YAAY;SACX,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;SACtC,WAAW,EAAE,CACrB,CAAA;AACL,CAAC;AAED;;;;GAIG;AACH,SAAgB,SAAS,CAAC,GAAW;IACjC,OAAO,GAAG,CAAC,OAAO,CACd,QAAQ,EACR,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CACrE,CAAA;AACL,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,GAAW,EAAE,mBAA2B,CAAC;IAChE,MAAM,KAAK,GAAG,GAAG;SACZ,OAAO,CAAC,kCAAkC,EAAE,OAAO,CAAC;SACpD,KAAK,CAAC,GAAG,CAAC,CAAA;IACf,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QAC9B,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAA;QACvC,OAAO,GAAG,CAAA;IACd,CAAC,EAAE,EAAE,CAAC,CAAA;AACV,CAAC;AAWD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,SAAgB,OAAO,CAAC,KAAa,EAAE,UAA2B,EAAE;IAChE,MAAM,EAAE,aAAa,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,EAAE,UAAU,GAAG,CAAC,EAAE,GAAG,OAAO,CAAA;IAEvE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;IACvC,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAa,EAAE,GAAW,EAAE,EAAE;QACjE,gFAAgF;QAChF,MAAM,YAAY,GAAG,GAAG;aACnB,OAAO,CAAC,mCAAmC,EAAE,OAAO,CAAC;aACrD,KAAK,CAAC,GAAG,CAAC,CAAA;QACf,mEAAmE;QACnE,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAA;QACnE,MAAM,YAAY,GAAG,YAAY;aAC5B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;aACrC,IAAI,CAAC,EAAE,CAAC,CAAA;QAEb,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QACtB,OAAO,GAAG,CAAA;IACd,CAAC,EAAE,EAAE,CAAC,CAAA;IAEN,OAAO,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AACxC,CAAC;AAMD;;;;;GAKG;AACH,SAAgB,IAAI,CAAC,KAAa,EAAE,UAAwB,EAAE;IAC1D,MAAM,YAAY,GAAG,IAAA,gBAAK,EAAC,MAAM,CAAC,CAAA;IAClC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IAClC,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IAC9C,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvC,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAA;IAC/C,CAAC;IACD,OAAO,WAAW,CAAA;AACtB,CAAC","file":"StringUtils.js","sourcesContent":["import shajs from \"sha.js\"\n\n/**\n * Converts string into camelCase.\n *\n * @see http://stackoverflow.com/questions/2970525/converting-any-string-into-camel-case\n */\nexport function camelCase(str: string, firstCapital: boolean = false): string {\n    if (firstCapital) str = \" \" + str\n    return str.replace(/^([A-Z])|[\\s-_](\\w)/g, function (match, p1, p2) {\n        if (p2) return p2.toUpperCase()\n        return p1.toLowerCase()\n    })\n}\n\n/**\n * Converts string into snake_case.\n *\n */\nexport function snakeCase(str: string): string {\n    return (\n        str\n            // ABc -> a_bc\n            .replace(/([A-Z])([A-Z])([a-z])/g, \"$1_$2$3\")\n            // aC -> a_c\n            .replace(/([a-z0-9])([A-Z])/g, \"$1_$2\")\n            .toLowerCase()\n    )\n}\n\n/**\n * Converts string into Title Case.\n *\n * @see http://stackoverflow.com/questions/196972/convert-string-to-title-case-with-javascript\n */\nexport function titleCase(str: string): string {\n    return str.replace(\n        /\\w\\S*/g,\n        (txt) => txt.charAt(0).toUpperCase() + txt.substr(1).toLowerCase(),\n    )\n}\n\n/**\n * Builds abbreviated string from given string;\n */\nexport function abbreviate(str: string, abbrLettersCount: number = 1): string {\n    const words = str\n        .replace(/([a-z\\xE0-\\xFF])([A-Z\\xC0\\xDF])/g, \"$1 $2\")\n        .split(\" \")\n    return words.reduce((res, word) => {\n        res += word.substr(0, abbrLettersCount)\n        return res\n    }, \"\")\n}\n\nexport interface IShortenOptions {\n    /** String used to split \"segments\" of the alias/column name */\n    separator?: string\n    /** Maximum length of any \"segment\" */\n    segmentLength?: number\n    /** Length of any \"term\" in a \"segment\"; \"OrderItem\" is a segment, \"Order\" and \"Items\" are terms */\n    termLength?: number\n}\n\n/**\n * Shorten a given `input`. Useful for RDBMS imposing a limit on the\n * maximum length of aliases and column names in SQL queries.\n *\n * @param input String to be shortened.\n * @param options Default to `4` for segments length, `2` for terms length, `'__'` as a separator.\n *\n * @return Shortened `input`.\n *\n * @example\n * // returns: \"UsShCa__orde__mark__dire\"\n * shorten('UserShoppingCart__order__market__director')\n *\n * // returns: \"cat_wit_ver_lon_nam_pos_wit_ver_lon_nam_pos_wit_ver_lon_nam\"\n * shorten(\n *   'category_with_very_long_name_posts_with_very_long_name_post_with_very_long_name',\n *   { separator: '_', segmentLength: 3 }\n * )\n *\n * // equals: UsShCa__orde__mark_market_id\n * `${shorten('UserShoppingCart__order__market')}_market_id`\n */\nexport function shorten(input: string, options: IShortenOptions = {}): string {\n    const { segmentLength = 4, separator = \"__\", termLength = 2 } = options\n\n    const segments = input.split(separator)\n    const shortSegments = segments.reduce((acc: string[], val: string) => {\n        // split the given segment into many terms based on an eventual camel cased name\n        const segmentTerms = val\n            .replace(/([a-z\\xE0-\\xFF])([A-Z\\xC0-\\xDF])/g, \"$1 $2\")\n            .split(\" \")\n        // \"OrderItemList\" becomes \"OrItLi\", while \"company\" becomes \"comp\"\n        const length = segmentTerms.length > 1 ? termLength : segmentLength\n        const shortSegment = segmentTerms\n            .map((term) => term.substr(0, length))\n            .join(\"\")\n\n        acc.push(shortSegment)\n        return acc\n    }, [])\n\n    return shortSegments.join(separator)\n}\n\ninterface IHashOptions {\n    length?: number\n}\n\n/**\n * Returns a SHA-1 hex digest for internal IDs/aliases (not for cryptographic security)\n *\n * @param input String to be hashed.\n * @param options.length Optionally, shorten the output to desired length.\n */\nexport function hash(input: string, options: IHashOptions = {}): string {\n    const hashFunction = shajs(\"sha1\")\n    hashFunction.update(input, \"utf8\")\n    const hashedInput = hashFunction.digest(\"hex\")\n    if (options.length && options.length > 0) {\n        return hashedInput.slice(0, options.length)\n    }\n    return hashedInput\n}\n"],"sourceRoot":".."}
+{"version":3,"file":"StringUtils.js","sourceRoot":"","sources":["../../../src/util/StringUtils.ts"],"names":[],"mappings":";;AASA,8BAMC;AAOD,8BASC;AAQD,8BAKC;AAQD,gCAQC;AA8BD,0BAqBC;AAqBD,oBAiBC;AArJD,uDAAmD;AAEnD;;;;;;GAMG;AACH,SAAgB,SAAS,CAAC,GAAW,EAAE,eAAwB,KAAK;IAChE,IAAI,YAAY;QAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;IACjC,OAAO,GAAG,CAAC,OAAO,CAAC,sBAAsB,EAAE,UAAU,KAAK,EAAE,EAAE,EAAE,EAAE;QAC9D,IAAI,EAAE;YAAE,OAAO,EAAE,CAAC,WAAW,EAAE,CAAA;QAC/B,OAAO,EAAE,CAAC,WAAW,EAAE,CAAA;IAC3B,CAAC,CAAC,CAAA;AACN,CAAC;AAED;;;;GAIG;AACH,SAAgB,SAAS,CAAC,GAAW;IACjC,OAAO,CACH,GAAG;QACC,cAAc;SACb,OAAO,CAAC,wBAAwB,EAAE,SAAS,CAAC;QAC7C,YAAY;SACX,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;SACtC,WAAW,EAAE,CACrB,CAAA;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAgB,SAAS,CAAC,GAAW;IACjC,OAAO,GAAG,CAAC,OAAO,CACd,QAAQ,EACR,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CACrE,CAAA;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAgB,UAAU,CAAC,GAAW,EAAE,mBAA2B,CAAC;IAChE,MAAM,KAAK,GAAG,GAAG;SACZ,OAAO,CAAC,kCAAkC,EAAE,OAAO,CAAC;SACpD,KAAK,CAAC,GAAG,CAAC,CAAA;IACf,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QAC9B,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAA;QACvC,OAAO,GAAG,CAAA;IACd,CAAC,EAAE,EAAE,CAAC,CAAA;AACV,CAAC;AAWD;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAgB,OAAO,CAAC,KAAa,EAAE,UAA2B,EAAE;IAChE,MAAM,EAAE,aAAa,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,EAAE,UAAU,GAAG,CAAC,EAAE,GAAG,OAAO,CAAA;IAEvE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;IACvC,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAa,EAAE,GAAW,EAAE,EAAE;QACjE,gFAAgF;QAChF,MAAM,YAAY,GAAG,GAAG;aACnB,OAAO,CAAC,mCAAmC,EAAE,OAAO,CAAC;aACrD,OAAO,CAAC,aAAa,EAAE,KAAK,CAAC;aAC7B,KAAK,CAAC,GAAG,CAAC,CAAA;QACf,mEAAmE;QACnE,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAA;QACnE,MAAM,YAAY,GAAG,YAAY;aAC5B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;aACrC,IAAI,CAAC,EAAE,CAAC,CAAA;QAEb,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QACtB,OAAO,GAAG,CAAA;IACd,CAAC,EAAE,EAAE,CAAC,CAAA;IAEN,OAAO,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AACxC,CAAC;AAED;;;GAGG;AACH,SAAS,MAAM;IACX,OAAO,OAAO,OAAO,KAAK,WAAW,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAA;AACrE,CAAC;AAMD;;;;;;GAMG;AACH,SAAgB,IAAI,CAAC,KAAa,EAAE,UAAwB,EAAE;IAC1D,IAAI,IAAY,CAAA;IAChB,IAAI,MAAM,EAAE,EAAE,CAAC;QACX,sEAAsE;QACtE,MAAM,MAAM,GAAG,OAAO,CAAC,aAAa,CAAiC,CAAA;QACrE,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QAC9C,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAClC,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACrC,CAAC;SAAM,CAAC;QACJ,IAAI,GAAG,iCAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACtC,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAA;IACxC,CAAC;IAED,OAAO,IAAI,CAAA;AACf,CAAC","sourcesContent":["import { RandomGenerator } from \"./RandomGenerator\"\n\n/**\n * Converts string into camelCase.\n * @param str String to be converted.\n * @param firstCapital If true, the first character will be capitalized.\n * @see http://stackoverflow.com/questions/2970525/converting-any-string-into-camel-case\n * @returns camelCase string\n */\nexport function camelCase(str: string, firstCapital: boolean = false): string {\n    if (firstCapital) str = \" \" + str\n    return str.replace(/^([A-Z])|[\\s-_](\\w)/g, function (match, p1, p2) {\n        if (p2) return p2.toUpperCase()\n        return p1.toLowerCase()\n    })\n}\n\n/**\n * Converts string into snake_case.\n * @param str String to be converted.\n * @returns snake_case string\n */\nexport function snakeCase(str: string): string {\n    return (\n        str\n            // ABc -> a_bc\n            .replace(/([A-Z])([A-Z])([a-z])/g, \"$1_$2$3\")\n            // aC -> a_c\n            .replace(/([a-z0-9])([A-Z])/g, \"$1_$2\")\n            .toLowerCase()\n    )\n}\n\n/**\n * Converts string into Title Case.\n * @param str String to be converted.\n * @returns Title Case string\n * @see http://stackoverflow.com/questions/196972/convert-string-to-title-case-with-javascript\n */\nexport function titleCase(str: string): string {\n    return str.replace(\n        /\\w\\S*/g,\n        (txt) => txt.charAt(0).toUpperCase() + txt.substr(1).toLowerCase(),\n    )\n}\n\n/**\n * Builds abbreviated string from given string;\n * @param str String to be abbreviated.\n * @param abbrLettersCount Number of letters to be used for abbreviation.\n * @returns abbreviated string\n */\nexport function abbreviate(str: string, abbrLettersCount: number = 1): string {\n    const words = str\n        .replace(/([a-z\\xE0-\\xFF])([A-Z\\xC0\\xDF])/g, \"$1 $2\")\n        .split(\" \")\n    return words.reduce((res, word) => {\n        res += word.substr(0, abbrLettersCount)\n        return res\n    }, \"\")\n}\n\nexport interface IShortenOptions {\n    /** String used to split \"segments\" of the alias/column name */\n    separator?: string\n    /** Maximum length of any \"segment\" */\n    segmentLength?: number\n    /** Length of any \"term\" in a \"segment\"; \"OrderItem\" is a segment, \"Order\" and \"Items\" are terms */\n    termLength?: number\n}\n\n/**\n * Shorten a given `input`. Useful for RDBMS imposing a limit on the\n * maximum length of aliases and column names in SQL queries.\n * @param input String to be shortened.\n * @param options Default to `4` for segments length, `2` for terms length, `'__'` as a separator.\n * @returns Shortened `input`.\n * @example\n * // returns: \"UsShCa__orde__mark__dire\"\n * shorten('UserShoppingCart__order__market__director')\n *\n * // returns: \"cat_wit_ver_lon_nam_pos_wit_ver_lon_nam_pos_wit_ver_lon_nam\"\n * shorten(\n *   'category_with_very_long_name_posts_with_very_long_name_post_with_very_long_name',\n *   { separator: '_', segmentLength: 3 }\n * )\n *\n * // equals: UsShCa__orde__mark_market_id\n * `${shorten('UserShoppingCart__order__market')}_market_id`\n */\nexport function shorten(input: string, options: IShortenOptions = {}): string {\n    const { segmentLength = 4, separator = \"__\", termLength = 2 } = options\n\n    const segments = input.split(separator)\n    const shortSegments = segments.reduce((acc: string[], val: string) => {\n        // split the given segment into many terms based on an eventual camel cased name\n        const segmentTerms = val\n            .replace(/([a-z\\xE0-\\xFF])([A-Z\\xC0-\\xDF])/g, \"$1 $2\")\n            .replace(/(_)([a-z])/g, \" $2\")\n            .split(\" \")\n        // \"OrderItemList\" becomes \"OrItLi\", while \"company\" becomes \"comp\"\n        const length = segmentTerms.length > 1 ? termLength : segmentLength\n        const shortSegment = segmentTerms\n            .map((term) => term.substr(0, length))\n            .join(\"\")\n\n        acc.push(shortSegment)\n        return acc\n    }, [])\n\n    return shortSegments.join(separator)\n}\n\n/**\n * Checks if the current environment is Node.js.\n * @returns `true` if the current environment is Node.js, `false` otherwise.\n */\nfunction isNode(): boolean {\n    return typeof process !== \"undefined\" && !!process.versions?.node\n}\n\ninterface IHashOptions {\n    length?: number\n}\n\n/**\n * Returns a SHA-1 hex digest for internal IDs/aliases (not for cryptographic security)\n * @param input String to be hashed.\n * @param options - Options object.\n * @param options.length Optionally, shorten the output to desired length.\n * @returns SHA-1 hex digest\n */\nexport function hash(input: string, options: IHashOptions = {}): string {\n    let sha1: string\n    if (isNode()) {\n        // eslint-disable-next-line @typescript-eslint/consistent-type-imports\n        const crypto = require(\"node:crypto\") as typeof import(\"node:crypto\")\n        const hashFunction = crypto.createHash(\"sha1\")\n        hashFunction.update(input, \"utf8\")\n        sha1 = hashFunction.digest(\"hex\")\n    } else {\n        sha1 = RandomGenerator.sha1(input)\n    }\n\n    if (options.length && options.length > 0) {\n        return sha1.slice(0, options.length)\n    }\n\n    return sha1\n}\n"]}

package/util/TreeRepositoryUtils.d.ts

@@ -1,6 +1,6 @@
-import { EntityManager } from "../entity-manager/EntityManager";
-import { EntityMetadata } from "../metadata/EntityMetadata";
-import { FindTreesOptions } from "../repository/FindTreesOptions";
+import type { EntityManager } from "../entity-manager/EntityManager";
+import type { EntityMetadata } from "../metadata/EntityMetadata";
+import type { FindTreesOptions } from "../repository/FindTreesOptions";
 /**
  * Provides utilities for manipulating tree structures.
  *

package/util/TreeRepositoryUtils.js

@@ -20,8 +20,8 @@ class TreeRepositoryUtils {
             const id = rawResult[alias + "_" + referencedColumnName];
             const parentId = rawResult[alias + "_" + joinColumnName];
             return {
-                id: manager.connection.driver.prepareHydratedValue(id, referencedColumn),
-                parentId: manager.connection.driver.prepareHydratedValue(parentId, joinColumn),
+                id: manager.dataSource.driver.prepareHydratedValue(id, referencedColumn),
+                parentId: manager.dataSource.driver.prepareHydratedValue(parentId, joinColumn),
             };
         });
     }
@@ -63,5 +63,4 @@ class TreeRepositoryUtils {
     }
 }
 exports.TreeRepositoryUtils = TreeRepositoryUtils;
-
-//# sourceMappingURL=TreeRepositoryUtils.js.map
+//# sourceMappingURL=TreeRepositoryUtils.js.map