"use strict";
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/)
     * improved by: Michael White (http://getsprink.com)
     * improved by: Kevin van Zonneveld (http://kvz.io)
     *    input by: Brett Zamir (http://brett-zamir.me)
     *      note 1: Keep in mind that in accordance with PHP, the whole string is buffered and then
     *      note 1: hashed. If available, we'd recommend using Node's native crypto modules directly
     *      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) {
            const t4 = (n << s) | (n >>> (32 - s));
            return t4;
        };
        const _cvtHex = function (val) {
            let str = "";
            for (let i = 7; i >= 0; i--) {
                const v = (val >>> (i * 4)) & 0x0f;
                str += v.toString(16);
            }
            return str;
        };
        // utf8_encode
        const bytes = new TextEncoder().encode(str);
        const bytesLength = bytes.length;
        const wordArray = [];
        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);
        }
        let i = 0;
        switch (bytesLength % 4) {
            case 0:
                i = 0x080000000;
                break;
            case 1:
                i = (bytes[bytesLength - 1] << 24) | 0x0800000;
                break;
            case 2:
                i =
                    (bytes[bytesLength - 2] << 24) |
                        (bytes[bytesLength - 1] << 16) |
                        0x08000;
                break;
            case 3:
                i =
                    (bytes[bytesLength - 3] << 24) |
                        (bytes[bytesLength - 2] << 16) |
                        (bytes[bytesLength - 1] << 8) |
                        0x80;
                break;
        }
        wordArray.push(i);
        while (wordArray.length % 16 !== 14) {
            wordArray.push(0);
        }
        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 (let i = 16; i <= 79; i++) {
                W[i] = _rotLeft(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
            }
            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 (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 (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 (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);
                B = A;
                A = temp;
            }
            H0 = (H0 + A) & 0x0ffffffff;
            H1 = (H1 + B) & 0x0ffffffff;
            H2 = (H2 + C) & 0x0ffffffff;
            H3 = (H3 + D) & 0x0ffffffff;
            H4 = (H4 + E) & 0x0ffffffff;
        }
        const ans = _cvtHex(H0) + _cvtHex(H1) + _cvtHex(H2) + _cvtHex(H3) + _cvtHex(H4);
        return ans.toLowerCase();
    }
}
exports.RandomGenerator = RandomGenerator;
//# sourceMappingURL=RandomGenerator.js.map