s3db.js 18.0.11-next.1534f717 → 18.0.11-next.e8e71b5b

package/dist/concerns/id/entropy.js

@@ -0,0 +1,243 @@
+import { randomFillSync } from 'node:crypto';
+const DEFAULT_POOL_SIZE = 2048;
+const MIN_POOL_SIZE = 256;
+let pool;
+let poolOffset = 0;
+/**
+ * Initialize or resize the entropy pool.
+ * Uses a pre-allocated buffer to reduce GC pressure and improve performance.
+ */
+export function initPool(size = DEFAULT_POOL_SIZE) {
+    const actualSize = Math.max(size, MIN_POOL_SIZE);
+    pool = new Uint8Array(actualSize);
+    randomFillSync(pool);
+    poolOffset = 0;
+}
+/**
+ * Get cryptographically secure random bytes from the pool.
+ * Automatically refills the pool when exhausted.
+ */
+export function getRandomBytes(count) {
+    if (!pool) {
+        initPool();
+    }
+    if (count > pool.length) {
+        const bytes = new Uint8Array(count);
+        randomFillSync(bytes);
+        return bytes;
+    }
+    if (poolOffset + count > pool.length) {
+        randomFillSync(pool);
+        poolOffset = 0;
+    }
+    const bytes = pool.slice(poolOffset, poolOffset + count);
+    poolOffset += count;
+    return bytes;
+}
+/**
+ * Fill a pre-allocated buffer with random bytes.
+ * More efficient than getRandomBytes when you already have a buffer.
+ */
+export function fillRandomBytes(buffer) {
+    if (!pool) {
+        initPool();
+    }
+    const needed = buffer.length;
+    if (poolOffset + needed <= pool.length) {
+        buffer.set(pool.subarray(poolOffset, poolOffset + needed));
+        poolOffset += needed;
+    }
+    else {
+        const remaining = pool.length - poolOffset;
+        if (remaining > 0) {
+            buffer.set(pool.subarray(poolOffset, pool.length), 0);
+        }
+        randomFillSync(pool);
+        poolOffset = 0;
+        buffer.set(pool.subarray(0, needed - remaining), remaining);
+        poolOffset = needed - remaining;
+    }
+    return buffer;
+}
+/**
+ * Generate a random index into an alphabet using rejection sampling.
+ * This eliminates modulo bias for non-power-of-2 alphabet sizes.
+ *
+ * For an alphabet of size N, we find the largest multiple of N that fits
+ * in 256 (or 65536 for larger alphabets). Any random value >= that threshold
+ * is rejected and we try again.
+ *
+ * Example: For alphabet size 62:
+ * - threshold = 256 - (256 % 62) = 256 - 8 = 248
+ * - We accept bytes 0-247 (maps evenly to 0-61, 4 times each)
+ * - We reject bytes 248-255 (would cause bias)
+ * - Rejection rate: 8/256 = 3.125%
+ */
+export function randomIndexUnbiased(alphabetSize) {
+    if (alphabetSize <= 0 || alphabetSize > 65536) {
+        throw new Error(`Invalid alphabet size: ${alphabetSize}. Must be 1-65536.`);
+    }
+    if (alphabetSize === 1) {
+        return 0;
+    }
+    if (alphabetSize <= 256) {
+        const threshold = 256 - (256 % alphabetSize);
+        let byte;
+        do {
+            const bytes = getRandomBytes(1);
+            byte = bytes[0];
+        } while (byte >= threshold);
+        return byte % alphabetSize;
+    }
+    const threshold = 65536 - (65536 % alphabetSize);
+    let value;
+    do {
+        const bytes = getRandomBytes(2);
+        value = (bytes[0] << 8) | bytes[1];
+    } while (value >= threshold);
+    return value % alphabetSize;
+}
+/**
+ * Generate multiple unbiased random indices efficiently.
+ * Pre-calculates rejection threshold and batches random byte generation.
+ */
+export function randomIndicesUnbiased(alphabetSize, count) {
+    if (alphabetSize <= 0 || alphabetSize > 65536) {
+        throw new Error(`Invalid alphabet size: ${alphabetSize}. Must be 1-65536.`);
+    }
+    const result = new Uint16Array(count);
+    if (alphabetSize === 1) {
+        return result;
+    }
+    if (alphabetSize <= 256) {
+        const threshold = 256 - (256 % alphabetSize);
+        const estimatedBytes = Math.ceil(count * (256 / threshold) * 1.1);
+        let bytes = getRandomBytes(Math.max(estimatedBytes, count * 2));
+        let byteIndex = 0;
+        let resultIndex = 0;
+        while (resultIndex < count) {
+            if (byteIndex >= bytes.length) {
+                const extraBytes = getRandomBytes(Math.max(16, (count - resultIndex) * 2));
+                const newBytes = new Uint8Array(bytes.length + extraBytes.length);
+                newBytes.set(bytes);
+                newBytes.set(extraBytes, bytes.length);
+                bytes = newBytes;
+                byteIndex = 0;
+            }
+            const byte = bytes[byteIndex++];
+            if (byte < threshold) {
+                result[resultIndex++] = byte % alphabetSize;
+            }
+        }
+        return result;
+    }
+    const threshold = 65536 - (65536 % alphabetSize);
+    const estimatedBytes = Math.ceil(count * 2 * (65536 / threshold) * 1.1);
+    let bytes = getRandomBytes(Math.max(estimatedBytes, count * 4));
+    let byteIndex = 0;
+    let resultIndex = 0;
+    while (resultIndex < count) {
+        if (byteIndex + 1 >= bytes.length) {
+            const extraBytes = getRandomBytes(Math.max(32, (count - resultIndex) * 4));
+            const newBytes = new Uint8Array(bytes.length + extraBytes.length);
+            newBytes.set(bytes);
+            newBytes.set(extraBytes, bytes.length);
+            bytes = newBytes;
+        }
+        const value = (bytes[byteIndex] << 8) | bytes[byteIndex + 1];
+        byteIndex += 2;
+        if (value < threshold) {
+            result[resultIndex++] = value % alphabetSize;
+        }
+    }
+    return result;
+}
+/**
+ * Generate a string from an alphabet using unbiased random selection.
+ * This is the core function for generating IDs.
+ */
+export function randomString(alphabet, length) {
+    const alphabetSize = alphabet.length;
+    const indices = randomIndicesUnbiased(alphabetSize, length);
+    let result = '';
+    for (let i = 0; i < length; i++) {
+        result += alphabet[indices[i]];
+    }
+    return result;
+}
+/**
+ * Generate a random 48-bit integer for timestamp-based IDs.
+ * Uses 6 bytes of entropy.
+ */
+export function random48() {
+    const bytes = getRandomBytes(6);
+    return ((BigInt(bytes[0]) << 40n) |
+        (BigInt(bytes[1]) << 32n) |
+        (BigInt(bytes[2]) << 24n) |
+        (BigInt(bytes[3]) << 16n) |
+        (BigInt(bytes[4]) << 8n) |
+        BigInt(bytes[5]));
+}
+/**
+ * Generate a random 62-bit integer (fits in signed 64-bit).
+ * Uses 8 bytes of entropy with top 2 bits masked.
+ */
+export function random62() {
+    const bytes = getRandomBytes(8);
+    return ((BigInt(bytes[0] & 0x3f) << 56n) |
+        (BigInt(bytes[1]) << 48n) |
+        (BigInt(bytes[2]) << 40n) |
+        (BigInt(bytes[3]) << 32n) |
+        (BigInt(bytes[4]) << 24n) |
+        (BigInt(bytes[5]) << 16n) |
+        (BigInt(bytes[6]) << 8n) |
+        BigInt(bytes[7]));
+}
+/**
+ * Generate a random 80-bit integer for ULID random component.
+ * Uses 10 bytes of entropy.
+ */
+export function random80() {
+    const bytes = getRandomBytes(10);
+    let result = 0n;
+    for (let i = 0; i < 10; i++) {
+        result = (result << 8n) | BigInt(bytes[i]);
+    }
+    return result;
+}
+/**
+ * Calculate the entropy bits for a given alphabet size and ID length.
+ */
+export function calculateEntropyBits(alphabetSize, length) {
+    return Math.log2(alphabetSize) * length;
+}
+/**
+ * Calculate the collision probability for a given number of IDs.
+ * Uses birthday paradox approximation: p ≈ n² / (2 * 2^bits)
+ */
+export function calculateCollisionProbability(entropyBits, idCount) {
+    const totalCombinations = Math.pow(2, entropyBits);
+    return (idCount * idCount) / (2 * totalCombinations);
+}
+/**
+ * Reset the entropy pool (useful for testing).
+ */
+export function resetPool() {
+    pool = undefined;
+    poolOffset = 0;
+}
+export default {
+    initPool,
+    getRandomBytes,
+    fillRandomBytes,
+    randomIndexUnbiased,
+    randomIndicesUnbiased,
+    randomString,
+    random48,
+    random62,
+    random80,
+    calculateEntropyBits,
+    calculateCollisionProbability,
+    resetPool
+};
+//# sourceMappingURL=entropy.js.map

package/dist/concerns/id/entropy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entropy.js","sourceRoot":"","sources":["../../../src/concerns/id/entropy.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE7C,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAC/B,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,IAAI,IAAgB,CAAC;AACrB,IAAI,UAAU,GAAW,CAAC,CAAC;AAE3B;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,OAAe,iBAAiB;IACvD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACjD,IAAI,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;IAClC,cAAc,CAAC,IAAI,CAAC,CAAC;IACrB,UAAU,GAAG,CAAC,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,QAAQ,EAAE,CAAC;IACb,CAAC;IAED,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,cAAc,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,UAAU,GAAG,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACrC,cAAc,CAAC,IAAI,CAAC,CAAC;QACrB,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,KAAK,CAAC,CAAC;IACzD,UAAU,IAAI,KAAK,CAAC;IACpB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,MAAkB;IAChD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,QAAQ,EAAE,CAAC;IACb,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAE7B,IAAI,UAAU,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC;QAC3D,UAAU,IAAI,MAAM,CAAC;IACvB,CAAC;SAAM,CAAC;QACN,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC;QAC3C,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,cAAc,CAAC,IAAI,CAAC,CAAC;QACrB,UAAU,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,EAAE,SAAS,CAAC,CAAC;QAC5D,UAAU,GAAG,MAAM,GAAG,SAAS,CAAC;IAClC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,mBAAmB,CAAC,YAAoB;IACtD,IAAI,YAAY,IAAI,CAAC,IAAI,YAAY,GAAG,KAAK,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CAAC,0BAA0B,YAAY,oBAAoB,CAAC,CAAC;IAC9E,CAAC;IAED,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,YAAY,IAAI,GAAG,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,YAAY,CAAC,CAAC;QAC7C,IAAI,IAAY,CAAC;QAEjB,GAAG,CAAC;YACF,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACnB,CAAC,QAAQ,IAAI,IAAI,SAAS,EAAE;QAE5B,OAAO,IAAI,GAAG,YAAY,CAAC;IAC7B,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC;IACjD,IAAI,KAAa,CAAC;IAElB,GAAG,CAAC;QACF,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAChC,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;IACvC,CAAC,QAAQ,KAAK,IAAI,SAAS,EAAE;IAE7B,OAAO,KAAK,GAAG,YAAY,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,YAAoB,EAAE,KAAa;IACvE,IAAI,YAAY,IAAI,CAAC,IAAI,YAAY,GAAG,KAAK,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CAAC,0BAA0B,YAAY,oBAAoB,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IAEtC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,YAAY,IAAI,GAAG,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,YAAY,CAAC,CAAC;QAC7C,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC;QAClE,IAAI,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,OAAO,WAAW,GAAG,KAAK,EAAE,CAAC;YAC3B,IAAI,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC3E,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;gBAClE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACpB,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBACvC,KAAK,GAAG,QAAQ,CAAC;gBACjB,SAAS,GAAG,CAAC,CAAC;YAChB,CAAC;YAED,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,EAAE,CAAE,CAAC;YACjC,IAAI,IAAI,GAAG,SAAS,EAAE,CAAC;gBACrB,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,IAAI,GAAG,YAAY,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC;IACjD,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC;IACxE,IAAI,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,OAAO,WAAW,GAAG,KAAK,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;YAClE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpB,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YACvC,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,SAAS,CAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,SAAS,GAAG,CAAC,CAAE,CAAC;QAC/D,SAAS,IAAI,CAAC,CAAC;QAEf,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,KAAK,GAAG,YAAY,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,MAAc;IAC3D,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;IACrC,MAAM,OAAO,GAAG,qBAAqB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IAC5D,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ;IACtB,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,OAAO,CACL,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;QACzB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAClB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ;IACtB,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,OAAO,CACL,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC;QACjC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;QACzB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAClB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ;IACtB,MAAM,KAAK,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,YAAoB,EAAE,MAAc;IACvE,OAAO,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,MAAM,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,6BAA6B,CAAC,WAAmB,EAAE,OAAe;IAChF,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACnD,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS;IACvB,IAAI,GAAG,SAAkC,CAAC;IAC1C,UAAU,GAAG,CAAC,CAAC;AACjB,CAAC;AAED,eAAe;IACb,QAAQ;IACR,cAAc;IACd,eAAe;IACf,mBAAmB;IACnB,qBAAqB;IACrB,YAAY;IACZ,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,oBAAoB;IACpB,6BAA6B;IAC7B,SAAS;CACV,CAAC"}

package/dist/concerns/id/generators/nanoid.js

@@ -0,0 +1,74 @@
+import { randomString, calculateEntropyBits } from '../entropy.js';
+import { URL_SAFE, getAlphabet, validateAlphabet } from '../alphabets.js';
+const DEFAULT_SIZE = 21;
+/**
+ * Generate a nanoid-compatible ID.
+ * Default: 21 characters using URL-safe alphabet (126 bits of entropy).
+ *
+ * Unlike original nanoid which uses `bytes[i] & 63` (modulo bias for non-64 alphabets),
+ * this implementation uses rejection sampling for true uniform distribution.
+ */
+export function nanoid(size = DEFAULT_SIZE) {
+    return randomString(URL_SAFE, size);
+}
+/**
+ * Create a custom nanoid generator with specified alphabet.
+ * Returns a function that generates IDs with that alphabet.
+ */
+export function customAlphabet(alphabet, defaultSize = DEFAULT_SIZE) {
+    const error = validateAlphabet(alphabet);
+    if (error) {
+        throw new Error(`Invalid alphabet: ${error}`);
+    }
+    return (size = defaultSize) => {
+        return randomString(alphabet, size);
+    };
+}
+/**
+ * Create a custom nanoid generator with alphabet name.
+ * Supports: URL_SAFE, ALPHANUMERIC, BASE58, HEX_LOWER, etc.
+ */
+export function customAlphabetByName(name, defaultSize = DEFAULT_SIZE) {
+    const alphabet = getAlphabet(name);
+    return customAlphabet(alphabet, defaultSize);
+}
+/**
+ * Generate a nanoid with options object.
+ */
+export function nanoidWithOptions(options = {}) {
+    const { alphabet = URL_SAFE, size = DEFAULT_SIZE } = options;
+    const resolvedAlphabet = getAlphabet(alphabet);
+    const error = validateAlphabet(resolvedAlphabet);
+    if (error) {
+        throw new Error(`Invalid alphabet: ${error}`);
+    }
+    return randomString(resolvedAlphabet, size);
+}
+/**
+ * Calculate entropy bits for a nanoid configuration.
+ */
+export function nanoidEntropyBits(alphabet = URL_SAFE, size = DEFAULT_SIZE) {
+    const resolvedAlphabet = getAlphabet(alphabet);
+    return calculateEntropyBits(resolvedAlphabet.length, size);
+}
+/**
+ * Async version for compatibility with original nanoid/async.
+ * Note: Our implementation is already synchronous and fast,
+ * this is just for API compatibility.
+ */
+export async function nanoidAsync(size = DEFAULT_SIZE) {
+    return nanoid(size);
+}
+/**
+ * Async version with custom alphabet.
+ */
+export function customAlphabetAsync(alphabet, defaultSize = DEFAULT_SIZE) {
+    const syncFn = customAlphabet(alphabet, defaultSize);
+    return async (size) => syncFn(size);
+}
+/**
+ * URL-safe ID shorthand (backward compatibility).
+ */
+export const urlAlphabet = URL_SAFE;
+export default nanoid;
+//# sourceMappingURL=nanoid.js.map

package/dist/concerns/id/generators/nanoid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nanoid.js","sourceRoot":"","sources":["../../../../src/concerns/id/generators/nanoid.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAE1E,MAAM,YAAY,GAAG,EAAE,CAAC;AAOxB;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAC,OAAe,YAAY;IAChD,OAAO,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB,EAAE,cAAsB,YAAY;IACjF,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACzC,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,CAAC,OAAe,WAAW,EAAU,EAAE;QAC5C,OAAO,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY,EAAE,cAAsB,YAAY;IACnF,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,cAAc,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,UAAyB,EAAE;IAC3D,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,IAAI,GAAG,YAAY,EAAE,GAAG,OAAO,CAAC;IAC7D,MAAM,gBAAgB,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAE/C,MAAM,KAAK,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;IACjD,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,YAAY,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,WAAmB,QAAQ,EAAE,OAAe,YAAY;IACxF,MAAM,gBAAgB,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/C,OAAO,oBAAoB,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAC7D,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,OAAe,YAAY;IAC3D,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAgB,EAAE,cAAsB,YAAY;IACtF,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACrD,OAAO,KAAK,EAAE,IAAa,EAAmB,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAChE,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,QAAQ,CAAC;AAEpC,eAAe,MAAM,CAAC"}

package/dist/concerns/id/generators/sid.js

@@ -0,0 +1,73 @@
+import { randomString, calculateEntropyBits } from '../entropy.js';
+import { URL_SAFE, getAlphabet, validateAlphabet } from '../alphabets.js';
+const DEFAULT_SIZE = 21;
+/**
+ * Generate a short unique ID (s3db id).
+ * Default: 21 characters using URL-safe alphabet (126 bits of entropy).
+ *
+ * Uses rejection sampling for true uniform distribution (zero modulo bias).
+ */
+export function sid(size = DEFAULT_SIZE) {
+    return randomString(URL_SAFE, size);
+}
+/**
+ * Create a custom sid generator with specified alphabet.
+ * Returns a function that generates IDs with that alphabet.
+ */
+export function customAlphabet(alphabet, defaultSize = DEFAULT_SIZE) {
+    const error = validateAlphabet(alphabet);
+    if (error) {
+        throw new Error(`Invalid alphabet: ${error}`);
+    }
+    return (size = defaultSize) => {
+        return randomString(alphabet, size);
+    };
+}
+/**
+ * Create a custom sid generator with alphabet name.
+ * Supports: URL_SAFE, ALPHANUMERIC, BASE58, HEX_LOWER, etc.
+ */
+export function customAlphabetByName(name, defaultSize = DEFAULT_SIZE) {
+    const alphabet = getAlphabet(name);
+    return customAlphabet(alphabet, defaultSize);
+}
+/**
+ * Generate a sid with options object.
+ */
+export function sidWithOptions(options = {}) {
+    const { alphabet = URL_SAFE, size = DEFAULT_SIZE } = options;
+    const resolvedAlphabet = getAlphabet(alphabet);
+    const error = validateAlphabet(resolvedAlphabet);
+    if (error) {
+        throw new Error(`Invalid alphabet: ${error}`);
+    }
+    return randomString(resolvedAlphabet, size);
+}
+/**
+ * Calculate entropy bits for a sid configuration.
+ */
+export function sidEntropyBits(alphabet = URL_SAFE, size = DEFAULT_SIZE) {
+    const resolvedAlphabet = getAlphabet(alphabet);
+    return calculateEntropyBits(resolvedAlphabet.length, size);
+}
+/**
+ * Async version for compatibility.
+ * Note: Our implementation is already synchronous and fast,
+ * this is just for API compatibility.
+ */
+export async function sidAsync(size = DEFAULT_SIZE) {
+    return sid(size);
+}
+/**
+ * Async version with custom alphabet.
+ */
+export function customAlphabetAsync(alphabet, defaultSize = DEFAULT_SIZE) {
+    const syncFn = customAlphabet(alphabet, defaultSize);
+    return async (size) => syncFn(size);
+}
+/**
+ * URL-safe alphabet constant.
+ */
+export const urlAlphabet = URL_SAFE;
+export default sid;
+//# sourceMappingURL=sid.js.map

package/dist/concerns/id/generators/sid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sid.js","sourceRoot":"","sources":["../../../../src/concerns/id/generators/sid.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAE1E,MAAM,YAAY,GAAG,EAAE,CAAC;AAOxB;;;;;GAKG;AACH,MAAM,UAAU,GAAG,CAAC,OAAe,YAAY;IAC7C,OAAO,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB,EAAE,cAAsB,YAAY;IACjF,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACzC,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,CAAC,OAAe,WAAW,EAAU,EAAE;QAC5C,OAAO,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY,EAAE,cAAsB,YAAY;IACnF,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,cAAc,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,UAAsB,EAAE;IACrD,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,IAAI,GAAG,YAAY,EAAE,GAAG,OAAO,CAAC;IAC7D,MAAM,gBAAgB,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAE/C,MAAM,KAAK,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;IACjD,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,YAAY,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,WAAmB,QAAQ,EAAE,OAAe,YAAY;IACrF,MAAM,gBAAgB,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC/C,OAAO,oBAAoB,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAC7D,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,OAAe,YAAY;IACxD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAgB,EAAE,cAAsB,YAAY;IACtF,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACrD,OAAO,KAAK,EAAE,IAAa,EAAmB,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAChE,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,QAAQ,CAAC;AAEpC,eAAe,GAAG,CAAC"}

package/dist/concerns/id/generators/ulid.js

@@ -0,0 +1,208 @@
+import { random80 } from '../entropy.js';
+import { CROCKFORD_BASE32 } from '../alphabets.js';
+const ENCODING = CROCKFORD_BASE32;
+const ENCODING_LEN = ENCODING.length;
+const TIME_LEN = 10;
+const RANDOM_LEN = 16;
+const ULID_LEN = TIME_LEN + RANDOM_LEN;
+const TIME_MAX = Math.pow(2, 48) - 1;
+let lastTime = 0;
+let lastRandom = 0n;
+/**
+ * Generate a ULID (Universally Unique Lexicographically Sortable Identifier).
+ *
+ * Structure (128 bits total):
+ * - 48 bits: Unix timestamp in milliseconds (encoded as 10 Crockford Base32 chars)
+ * - 80 bits: Random (encoded as 16 Crockford Base32 chars)
+ *
+ * Format: TTTTTTTTTTRRRRRRRRRRRRRRRRR (26 characters)
+ *
+ * Features:
+ * - Lexicographically sortable by timestamp
+ * - Case insensitive
+ * - No special characters (URL safe)
+ * - 1.21e+24 unique ULIDs per millisecond
+ *
+ * Monotonic: If called multiple times within the same millisecond,
+ * the random component is incremented to ensure sortability.
+ */
+export function ulid(timestamp) {
+    const now = timestamp ?? Date.now();
+    if (now > TIME_MAX) {
+        throw new Error('ULID timestamp overflow: timestamp exceeds 48 bits');
+    }
+    let randomPart;
+    if (now === lastTime) {
+        lastRandom += 1n;
+        if (lastRandom > 0xffffffffffffffffffffn) {
+            throw new Error('ULID random overflow: too many ULIDs in same millisecond');
+        }
+        randomPart = lastRandom;
+    }
+    else {
+        randomPart = random80();
+        lastTime = now;
+        lastRandom = randomPart;
+    }
+    return encodeTime(now) + encodeRandom(randomPart);
+}
+/**
+ * Generate a non-monotonic ULID.
+ * Does not increment random part for same-millisecond calls.
+ * Use when strict sortability within millisecond is not required.
+ */
+export function ulidNonMonotonic(timestamp) {
+    const now = timestamp ?? Date.now();
+    if (now > TIME_MAX) {
+        throw new Error('ULID timestamp overflow: timestamp exceeds 48 bits');
+    }
+    return encodeTime(now) + encodeRandom(random80());
+}
+/**
+ * Encode timestamp to Crockford Base32 (10 characters).
+ */
+function encodeTime(timestamp) {
+    let time = timestamp;
+    let str = '';
+    for (let i = TIME_LEN - 1; i >= 0; i--) {
+        const mod = time % ENCODING_LEN;
+        str = ENCODING[mod] + str;
+        time = Math.floor(time / ENCODING_LEN);
+    }
+    return str;
+}
+/**
+ * Encode random 80-bit value to Crockford Base32 (16 characters).
+ */
+function encodeRandom(random) {
+    let str = '';
+    for (let i = RANDOM_LEN - 1; i >= 0; i--) {
+        const mod = Number(random % BigInt(ENCODING_LEN));
+        str = ENCODING[mod] + str;
+        random = random / BigInt(ENCODING_LEN);
+    }
+    return str;
+}
+/**
+ * Decode a ULID timestamp to milliseconds.
+ */
+export function decodeTime(id) {
+    if (id.length !== ULID_LEN) {
+        throw new Error(`Invalid ULID length: expected ${ULID_LEN}, got ${id.length}`);
+    }
+    const timeStr = id.slice(0, TIME_LEN).toUpperCase();
+    let time = 0;
+    for (let i = 0; i < TIME_LEN; i++) {
+        const char = timeStr[i];
+        const index = ENCODING.indexOf(char);
+        if (index === -1) {
+            throw new Error(`Invalid ULID character: ${char}`);
+        }
+        time = time * ENCODING_LEN + index;
+    }
+    return time;
+}
+/**
+ * Decode a ULID to Date object.
+ */
+export function decodeDate(id) {
+    return new Date(decodeTime(id));
+}
+/**
+ * Validate if a string is a valid ULID.
+ */
+export function isValidUlid(id) {
+    if (id.length !== ULID_LEN) {
+        return false;
+    }
+    const upper = id.toUpperCase();
+    for (const char of upper) {
+        if (!ENCODING.includes(char)) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Convert ULID to UUID format.
+ * Returns a UUID string representation of the ULID bytes.
+ */
+export function ulidToUuid(id) {
+    const bytes = ulidToBytes(id);
+    const hex = Array.from(bytes)
+        .map(b => b.toString(16).padStart(2, '0'))
+        .join('');
+    return `${hex.slice(0, 8)}-${hex.slice(8, 12)}-${hex.slice(12, 16)}-${hex.slice(16, 20)}-${hex.slice(20)}`;
+}
+/**
+ * Convert ULID to byte array.
+ */
+export function ulidToBytes(id) {
+    if (id.length !== ULID_LEN) {
+        throw new Error(`Invalid ULID length: expected ${ULID_LEN}, got ${id.length}`);
+    }
+    const upper = id.toUpperCase();
+    const bytes = new Uint8Array(16);
+    let value = 0n;
+    for (let i = 0; i < ULID_LEN; i++) {
+        const char = upper[i];
+        const index = ENCODING.indexOf(char);
+        if (index === -1) {
+            throw new Error(`Invalid ULID character: ${char}`);
+        }
+        value = value * BigInt(ENCODING_LEN) + BigInt(index);
+    }
+    for (let i = 15; i >= 0; i--) {
+        bytes[i] = Number(value & 0xffn);
+        value = value >> 8n;
+    }
+    return bytes;
+}
+/**
+ * Convert byte array to ULID.
+ */
+export function bytesToUlid(bytes) {
+    if (bytes.length !== 16) {
+        throw new Error(`Invalid byte array length: expected 16, got ${bytes.length}`);
+    }
+    let value = 0n;
+    for (let i = 0; i < 16; i++) {
+        value = (value << 8n) | BigInt(bytes[i]);
+    }
+    let result = '';
+    for (let i = 0; i < ULID_LEN; i++) {
+        result = ENCODING[Number(value % BigInt(ENCODING_LEN))] + result;
+        value = value / BigInt(ENCODING_LEN);
+    }
+    return result;
+}
+/**
+ * Compare two ULIDs for sorting.
+ * Returns negative if a < b, positive if a > b, 0 if equal.
+ */
+export function compareUlid(a, b) {
+    return a.toUpperCase().localeCompare(b.toUpperCase());
+}
+/**
+ * Generate minimum ULID for a given timestamp.
+ * Useful for range queries: "all ULIDs after timestamp X"
+ */
+export function minUlidForTime(timestamp) {
+    return encodeTime(timestamp) + '0'.repeat(RANDOM_LEN);
+}
+/**
+ * Generate maximum ULID for a given timestamp.
+ * Useful for range queries: "all ULIDs before timestamp X"
+ */
+export function maxUlidForTime(timestamp) {
+    return encodeTime(timestamp) + 'Z'.repeat(RANDOM_LEN);
+}
+/**
+ * Reset monotonic state (useful for testing).
+ */
+export function resetMonotonic() {
+    lastTime = 0;
+    lastRandom = 0n;
+}
+export default ulid;
+//# sourceMappingURL=ulid.js.map

package/dist/concerns/id/generators/ulid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ulid.js","sourceRoot":"","sources":["../../../../src/concerns/id/generators/ulid.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEnD,MAAM,QAAQ,GAAG,gBAAgB,CAAC;AAClC,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;AACrC,MAAM,QAAQ,GAAG,EAAE,CAAC;AACpB,MAAM,UAAU,GAAG,EAAE,CAAC;AACtB,MAAM,QAAQ,GAAG,QAAQ,GAAG,UAAU,CAAC;AAEvC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;AAErC,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjB,IAAI,UAAU,GAAG,EAAE,CAAC;AAEpB;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,IAAI,CAAC,SAAkB;IACrC,MAAM,GAAG,GAAG,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAEpC,IAAI,GAAG,GAAG,QAAQ,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;IACxE,CAAC;IAED,IAAI,UAAkB,CAAC;IAEvB,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;QACrB,UAAU,IAAI,EAAE,CAAC;QACjB,IAAI,UAAU,GAAG,uBAAuB,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;QAC9E,CAAC;QACD,UAAU,GAAG,UAAU,CAAC;IAC1B,CAAC;SAAM,CAAC;QACN,UAAU,GAAG,QAAQ,EAAE,CAAC;QACxB,QAAQ,GAAG,GAAG,CAAC;QACf,UAAU,GAAG,UAAU,CAAC;IAC1B,CAAC;IAED,OAAO,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAkB;IACjD,MAAM,GAAG,GAAG,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAEpC,IAAI,GAAG,GAAG,QAAQ,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;IACxE,CAAC;IAED,OAAO,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,SAAiB;IACnC,IAAI,IAAI,GAAG,SAAS,CAAC;IACrB,IAAI,GAAG,GAAG,EAAE,CAAC;IAEb,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,GAAG,YAAY,CAAC;QAChC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAE,GAAG,GAAG,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,MAAc;IAClC,IAAI,GAAG,GAAG,EAAE,CAAC;IAEb,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;QAClD,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAE,GAAG,GAAG,CAAC;QAC3B,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,EAAU;IACnC,IAAI,EAAE,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,iCAAiC,QAAQ,SAAS,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;IACjF,CAAC;IAED,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;IACpD,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAErC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,GAAG,IAAI,GAAG,YAAY,GAAG,KAAK,CAAC;IACrC,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,EAAU;IACnC,OAAO,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,EAAU;IACpC,IAAI,EAAE,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC3B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,EAAU;IACnC,MAAM,KAAK,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SACzC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEZ,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7G,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,EAAU;IACpC,IAAI,EAAE,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,iCAAiC,QAAQ,SAAS,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;IACjF,CAAC;IAED,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAEjC,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QACjC,KAAK,GAAG,KAAK,IAAI,EAAE,CAAC;IACtB,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAiB;IAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,+CAA+C,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACjF,CAAC;IAED,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;IAC5C,CAAC;IAED,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,GAAG,MAAM,CAAC;QAClE,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,SAAiB;IAC9C,OAAO,UAAU,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,SAAiB;IAC9C,OAAO,UAAU,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc;IAC5B,QAAQ,GAAG,CAAC,CAAC;IACb,UAAU,GAAG,EAAE,CAAC;AAClB,CAAC;AAED,eAAe,IAAI,CAAC"}