@bendyline/squisq 0.1.1 → 1.0.1

package/dist/markdown/utils.js

@@ -0,0 +1,149 @@
+/**
+ * Markdown Tree Utilities
+ *
+ * Helper functions for traversing and querying the MarkdownDocument tree.
+ * All functions are pure and operate on the JSON node interfaces.
+ */
+/**
+ * Get the children of any markdown node, if it has children.
+ * Returns an empty array for leaf nodes (text, code, break, etc.).
+ *
+ * This is useful for generic tree walking where you don't want to
+ * check the specific node type.
+ */
+export function getChildren(node) {
+    if ('children' in node && Array.isArray(node.children)) {
+        return node.children;
+    }
+    return [];
+}
+/**
+ * Walk the markdown tree depth-first, calling the visitor for each node.
+ *
+ * The visitor receives the current node and its parent. Return `true`
+ * from the visitor to skip the node's children (prune).
+ *
+ * @param node - The root node to start walking from
+ * @param visitor - Called for each node; return true to skip children
+ * @param parent - (internal) Parent node
+ */
+export function walkMarkdownTree(node, visitor, parent) {
+    const skip = visitor(node, parent);
+    if (skip === true)
+        return;
+    const children = getChildren(node);
+    for (const child of children) {
+        walkMarkdownTree(child, visitor, node);
+    }
+}
+/**
+ * Find all nodes of a specific type in the tree.
+ *
+ * @param root - The document or node to search within
+ * @param type - The node type to find (e.g., 'heading', 'link', 'text')
+ * @returns Array of matching nodes
+ *
+ * @example
+ * ```ts
+ * const headings = findNodesByType(doc, 'heading');
+ * const links = findNodesByType(doc, 'link');
+ * ```
+ */
+export function findNodesByType(root, type) {
+    const results = [];
+    walkMarkdownTree(root, (node) => {
+        if (node.type === type) {
+            results.push(node);
+        }
+    });
+    return results;
+}
+/**
+ * Extract all plain text content from a node and its descendants.
+ * Concatenates text values, ignoring formatting, links, etc.
+ *
+ * @param node - The node to extract text from
+ * @returns Plain text content
+ *
+ * @example
+ * ```ts
+ * const heading = doc.children[0]; // { type: 'heading', children: [{ type: 'text', value: 'Hello' }] }
+ * extractPlainText(heading); // 'Hello'
+ * ```
+ */
+export function extractPlainText(node) {
+    if ('value' in node && typeof node.value === 'string') {
+        return node.value;
+    }
+    const children = getChildren(node);
+    return children.map(extractPlainText).join('');
+}
+/**
+ * Count the total number of nodes in the tree.
+ *
+ * @param node - The root node
+ * @returns Total node count (including the root)
+ */
+export function countNodes(node) {
+    let count = 1;
+    const children = getChildren(node);
+    for (const child of children) {
+        count += countNodes(child);
+    }
+    return count;
+}
+/**
+ * Parse a YAML frontmatter string into a key-value record.
+ *
+ * Handles simple `key: value` pairs common in markdown frontmatter.
+ * Values are trimmed; quoted strings have their quotes removed.
+ * Returns `null` if parsing fails or the input is empty.
+ *
+ * @param yaml - The raw YAML string (without the `---` delimiters)
+ * @returns A record of string keys to parsed values, or null
+ */
+export function parseFrontmatter(yaml) {
+    if (!yaml || !yaml.trim())
+        return null;
+    const result = {};
+    for (const line of yaml.split('\n')) {
+        const trimmed = line.trim();
+        if (!trimmed || trimmed.startsWith('#'))
+            continue;
+        const colonIdx = trimmed.indexOf(':');
+        if (colonIdx < 1)
+            continue;
+        const key = trimmed.slice(0, colonIdx).trim();
+        let value = trimmed.slice(colonIdx + 1).trim();
+        // Remove surrounding quotes
+        if ((value.startsWith('"') && value.endsWith('"')) ||
+            (value.startsWith("'") && value.endsWith("'"))) {
+            value = value.slice(1, -1);
+        }
+        // Parse booleans and numbers
+        if (value === 'true') {
+            result[key] = true;
+        }
+        else if (value === 'false') {
+            result[key] = false;
+        }
+        else if (value !== '' && !isNaN(Number(value))) {
+            result[key] = Number(value);
+        }
+        else {
+            result[key] = value;
+        }
+    }
+    return Object.keys(result).length > 0 ? result : null;
+}
+/**
+ * Create a minimal MarkdownDocument from a list of block nodes.
+ * Convenience function for programmatic document construction.
+ */
+export function createDocument(...children) {
+    return {
+        type: 'document',
+        children,
+    };
+}
+//# sourceMappingURL=utils.js.map

package/dist/markdown/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/markdown/utils.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,IAAkB;IAC5C,IAAI,UAAU,IAAI,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvD,OAAO,IAAI,CAAC,QAA0B,CAAC;IACzC,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAkB,EAClB,OAAsE,EACtE,MAAqB;IAErB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO;IAE1B,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAAyB,IAAkB,EAAE,IAAe;IACzF,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,gBAAgB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,IAAS,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAkB;IACjD,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QACtD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACjD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAkB;IAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;QAAE,OAAO,IAAI,CAAC;IAEvC,MAAM,MAAM,GAA4B,EAAE,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS;QAElD,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,QAAQ,GAAG,CAAC;YAAE,SAAS;QAE3B,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAI,KAAK,GAA8B,OAAO,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAE1E,4BAA4B;QAC5B,IACE,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC9C,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAC9C,CAAC;YACD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;QAED,6BAA6B;QAC7B,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACrB,CAAC;aAAM,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;aAAM,IAAI,KAAK,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,GAAG,QAAsC;IACtE,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/random/SeededRandom.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Seeded pseudo-random number generator (Mulberry32 algorithm).
+ *
+ * Provides deterministic, reproducible randomness from an integer seed.
+ * Useful for consistent slideshow generation, shuffling, and selection.
+ *
+ * ```ts
+ * const rng = new SeededRandom(42);
+ * rng.next();            // 0.0–1.0
+ * rng.nextInt(10);       // 0–9
+ * rng.pick(['a', 'b']);  // 'a' or 'b'
+ * ```
+ */
+export declare class SeededRandom {
+    private state;
+    constructor(seed: number);
+    /** Random float in [0, 1). */
+    next(): number;
+    /** Random integer in [0, max). */
+    nextInt(max: number): number;
+    /** Random integer in [min, max). */
+    nextIntRange(min: number, max: number): number;
+    /** Random boolean with given probability of `true` (default 0.5). */
+    nextBool(probability?: number): boolean;
+    /** Pick a random element, or `undefined` if array is empty. */
+    pick<T>(array: T[]): T | undefined;
+    /** Pick a random element; throws if empty. */
+    pickRequired<T>(array: T[]): T;
+    /** Pick `count` unique random elements (fewer if array is smaller). */
+    pickMultiple<T>(array: T[], count: number): T[];
+    /** Fisher-Yates shuffle **in place**. Returns the same array. */
+    shuffle<T>(array: T[]): T[];
+    /** Return a **new** shuffled copy. */
+    shuffled<T>(array: readonly T[]): T[];
+    /** Weighted random selection. Returns `undefined` if items is empty. */
+    pickWeighted<T>(items: {
+        item: T;
+        weight: number;
+    }[]): T | undefined;
+    /** Current internal state (for debugging / serialization). */
+    getState(): number;
+    /** Create an independent sub-stream keyed by a modifier. */
+    derive(modifier: string | number): SeededRandom;
+}
+/**
+ * Simple string → 32-bit hash (djb2 algorithm).
+ * Useful for turning a document ID into a numeric seed.
+ */
+export declare function hashString(str: string): number;
+//# sourceMappingURL=SeededRandom.d.ts.map

package/dist/random/SeededRandom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SeededRandom.d.ts","sourceRoot":"","sources":["../../src/random/SeededRandom.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAS;gBAEV,IAAI,EAAE,MAAM;IAOxB,8BAA8B;IAC9B,IAAI,IAAI,MAAM;IAOd,kCAAkC;IAClC,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI5B,oCAAoC;IACpC,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAI9C,qEAAqE;IACrE,QAAQ,CAAC,WAAW,GAAE,MAAY,GAAG,OAAO;IAI5C,+DAA+D;IAC/D,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS;IAKlC,8CAA8C;IAC9C,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC;IAO9B,uEAAuE;IACvE,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE;IAc/C,iEAAiE;IACjE,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAQ3B,sCAAsC;IACtC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE;IAIrC,wEAAwE;IACxE,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE;QAAE,IAAI,EAAE,CAAC,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE,GAAG,CAAC,GAAG,SAAS;IAcpE,8DAA8D;IAC9D,QAAQ,IAAI,MAAM;IAIlB,4DAA4D;IAC5D,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,YAAY;CAIhD;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAM9C"}

package/dist/random/SeededRandom.js

@@ -0,0 +1,115 @@
+/**
+ * Seeded pseudo-random number generator (Mulberry32 algorithm).
+ *
+ * Provides deterministic, reproducible randomness from an integer seed.
+ * Useful for consistent slideshow generation, shuffling, and selection.
+ *
+ * ```ts
+ * const rng = new SeededRandom(42);
+ * rng.next();            // 0.0–1.0
+ * rng.nextInt(10);       // 0–9
+ * rng.pick(['a', 'b']);  // 'a' or 'b'
+ * ```
+ */
+export class SeededRandom {
+    constructor(seed) {
+        this.state = seed >>> 0;
+        if (this.state === 0) {
+            this.state = 0xdeadbeef;
+        }
+    }
+    /** Random float in [0, 1). */
+    next() {
+        let t = (this.state += 0x6d2b79f5);
+        t = Math.imul(t ^ (t >>> 15), t | 1);
+        t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    }
+    /** Random integer in [0, max). */
+    nextInt(max) {
+        return Math.floor(this.next() * max);
+    }
+    /** Random integer in [min, max). */
+    nextIntRange(min, max) {
+        return min + Math.floor(this.next() * (max - min));
+    }
+    /** Random boolean with given probability of `true` (default 0.5). */
+    nextBool(probability = 0.5) {
+        return this.next() < probability;
+    }
+    /** Pick a random element, or `undefined` if array is empty. */
+    pick(array) {
+        if (array.length === 0)
+            return undefined;
+        return array[this.nextInt(array.length)];
+    }
+    /** Pick a random element; throws if empty. */
+    pickRequired(array) {
+        if (array.length === 0) {
+            throw new Error('Cannot pick from empty array');
+        }
+        return array[this.nextInt(array.length)];
+    }
+    /** Pick `count` unique random elements (fewer if array is smaller). */
+    pickMultiple(array, count) {
+        if (count >= array.length) {
+            return this.shuffle([...array]);
+        }
+        const result = [];
+        const available = [...array];
+        for (let i = 0; i < count && available.length > 0; i++) {
+            const index = this.nextInt(available.length);
+            result.push(available[index]);
+            available.splice(index, 1);
+        }
+        return result;
+    }
+    /** Fisher-Yates shuffle **in place**. Returns the same array. */
+    shuffle(array) {
+        for (let i = array.length - 1; i > 0; i--) {
+            const j = this.nextInt(i + 1);
+            [array[i], array[j]] = [array[j], array[i]];
+        }
+        return array;
+    }
+    /** Return a **new** shuffled copy. */
+    shuffled(array) {
+        return this.shuffle([...array]);
+    }
+    /** Weighted random selection. Returns `undefined` if items is empty. */
+    pickWeighted(items) {
+        if (items.length === 0)
+            return undefined;
+        const totalWeight = items.reduce((sum, { weight }) => sum + weight, 0);
+        if (totalWeight <= 0)
+            return items[0]?.item;
+        let random = this.next() * totalWeight;
+        for (const { item, weight } of items) {
+            random -= weight;
+            if (random <= 0)
+                return item;
+        }
+        return items[items.length - 1]?.item;
+    }
+    /** Current internal state (for debugging / serialization). */
+    getState() {
+        return this.state;
+    }
+    /** Create an independent sub-stream keyed by a modifier. */
+    derive(modifier) {
+        const hash = typeof modifier === 'string' ? hashString(modifier) : modifier >>> 0;
+        return new SeededRandom(this.state ^ hash);
+    }
+}
+/**
+ * Simple string → 32-bit hash (djb2 algorithm).
+ * Useful for turning a document ID into a numeric seed.
+ */
+export function hashString(str) {
+    let hash = 5381;
+    for (let i = 0; i < str.length; i++) {
+        hash = ((hash << 5) + hash) ^ str.charCodeAt(i);
+    }
+    return hash >>> 0;
+}
+//# sourceMappingURL=SeededRandom.js.map

package/dist/random/SeededRandom.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SeededRandom.js","sourceRoot":"","sources":["../../src/random/SeededRandom.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,YAAY;IAGvB,YAAY,IAAY;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,IAAI;QACF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,UAAU,CAAC,CAAC;QACnC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC;IAED,kCAAkC;IAClC,OAAO,CAAC,GAAW;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC;IACvC,CAAC;IAED,oCAAoC;IACpC,YAAY,CAAC,GAAW,EAAE,GAAW;QACnC,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,qEAAqE;IACrE,QAAQ,CAAC,cAAsB,GAAG;QAChC,OAAO,IAAI,CAAC,IAAI,EAAE,GAAG,WAAW,CAAC;IACnC,CAAC;IAED,+DAA+D;IAC/D,IAAI,CAAI,KAAU;QAChB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACzC,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,8CAA8C;IAC9C,YAAY,CAAI,KAAU;QACxB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,uEAAuE;IACvE,YAAY,CAAI,KAAU,EAAE,KAAa;QACvC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC7C,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,iEAAiE;IACjE,OAAO,CAAI,KAAU;QACnB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,sCAAsC;IACtC,QAAQ,CAAI,KAAmB;QAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,wEAAwE;IACxE,YAAY,CAAI,KAAoC;QAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAEzC,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC;QACvE,IAAI,WAAW,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;QAE5C,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,WAAW,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACrC,MAAM,IAAI,MAAM,CAAC;YACjB,IAAI,MAAM,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC;IACvC,CAAC;IAED,8DAA8D;IAC9D,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,4DAA4D;IAC5D,MAAM,CAAC,QAAyB;QAC9B,MAAM,IAAI,GAAG,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;QAClF,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;IAC7C,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAW;IACpC,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACpB,CAAC"}

package/dist/random/index.d.ts

@@ -0,0 +1,2 @@
+export { SeededRandom, hashString } from './SeededRandom.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/random/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/random/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/random/index.js

@@ -0,0 +1,2 @@
+export { SeededRandom, hashString } from './SeededRandom.js';
+//# sourceMappingURL=index.js.map

package/dist/random/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/random/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC"}