@bendyline/squisq 1.4.0 → 1.5.0

package/dist/markdown/utils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/markdown/utils.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEjE;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,YAAY,GAAG,YAAY,EAAE,CAK9D;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,YAAY,EAClB,OAAO,EAAE,CAAC,IAAI,EAAE,YAAY,EAAE,MAAM,CAAC,EAAE,YAAY,KAAK,IAAI,GAAG,OAAO,EACtE,MAAM,CAAC,EAAE,YAAY,GACpB,IAAI,CAQN;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAAC,CAAC,SAAS,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAQhG;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CAW3D;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CAOrD;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAoC7E;AAuBD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,SAAS,CAAC,GACpE,MAAM,CA4DR;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,GAAG,QAAQ,EAAE,gBAAgB,CAAC,UAAU,CAAC,GAAG,gBAAgB,CAK1F;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,gBAAgB,GAAG,MAAM,GAAG,SAAS,CAmB5E;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CACpC,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,GAC/C,MAAM,GAAG,SAAS,CAWpB"}

package/dist/markdown/utils.js

@@ -1,308 +0,0 @@
-/**
- * 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);
-    // Preserve boundaries between block-level elements (list items, paragraphs
-    // inside list items, blockquotes) so downstream consumers like caption
-    // splitting can treat each item as a separate phrase.
-    const separator = node.type === 'list' || node.type === 'listItem' ? '\n' : '';
-    return children.map(extractPlainText).join(separator);
-}
-/**
- * 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;
-}
-const FRONTMATTER_BLOCK_RE = /^---\r?\n([\s\S]*?)\r?\n---(\r?\n)?/;
-/** Quote a frontmatter scalar so it round-trips cleanly through `parseFrontmatter`. */
-function formatFrontmatterValue(value) {
-    if (typeof value === 'boolean' || typeof value === 'number')
-        return String(value);
-    // Quote when needed: leading/trailing whitespace, leading punctuation that
-    // could trigger YAML modes, or values that look like reserved literals.
-    const needsQuote = /^\s|\s$/.test(value) ||
-        /^[!&*?|>%@`]/.test(value) ||
-        /[:#]/.test(value) ||
-        value === '' ||
-        value === 'true' ||
-        value === 'false' ||
-        /^-?\d+(\.\d+)?$/.test(value);
-    if (!needsQuote)
-        return value;
-    // Prefer double quotes; escape any embedded double-quote / backslash.
-    const escaped = value.replace(/\\/g, '\\\\').replace(/"/g, '\\"');
-    return `"${escaped}"`;
-}
-/**
- * Update a markdown source string's YAML frontmatter block, applying the
- * given key/value updates. A `null` or `undefined` value removes the key.
- * If no frontmatter block exists and any non-null update is supplied, a
- * new block is prepended; if every update is a removal and no block
- * exists, the source is returned unchanged.
- *
- * Existing key order is preserved; new keys are appended in the order
- * they appear in `updates`. The simple parser used here handles plain
- * `key: value` pairs only — comments, multi-line scalars, and nested
- * structures are left untouched (we only rewrite lines whose key matches
- * one in `updates`).
- *
- * @param source - The markdown source string.
- * @param updates - Map of key → new value (or null/undefined to remove).
- * @returns The updated markdown source string.
- */
-export function setFrontmatterValues(source, updates) {
-    const updateKeys = Object.keys(updates);
-    if (updateKeys.length === 0)
-        return source;
-    const match = source.match(FRONTMATTER_BLOCK_RE);
-    const handled = new Set();
-    // Existing frontmatter block — rewrite line-by-line, preserving order.
-    if (match) {
-        const inner = match[1];
-        const lines = inner.split(/\r?\n/);
-        const newLines = [];
-        for (const line of lines) {
-            const trimmed = line.trim();
-            if (!trimmed || trimmed.startsWith('#')) {
-                newLines.push(line);
-                continue;
-            }
-            const colonIdx = trimmed.indexOf(':');
-            if (colonIdx < 1) {
-                newLines.push(line);
-                continue;
-            }
-            const key = trimmed.slice(0, colonIdx).trim();
-            if (!Object.prototype.hasOwnProperty.call(updates, key)) {
-                newLines.push(line);
-                continue;
-            }
-            handled.add(key);
-            const next = updates[key];
-            if (next === null || next === undefined)
-                continue; // remove
-            newLines.push(`${key}: ${formatFrontmatterValue(next)}`);
-        }
-        // Append any keys that weren't already present.
-        for (const key of updateKeys) {
-            if (handled.has(key))
-                continue;
-            const next = updates[key];
-            if (next === null || next === undefined)
-                continue;
-            newLines.push(`${key}: ${formatFrontmatterValue(next)}`);
-        }
-        // If every line got removed, drop the block entirely.
-        const nonEmpty = newLines.filter((l) => l.trim().length > 0);
-        const rest = source.slice(match[0].length);
-        if (nonEmpty.length === 0)
-            return rest;
-        return `---\n${newLines.join('\n')}\n---\n${rest}`;
-    }
-    // No existing block — only create one if there's at least one non-null
-    // value to write.
-    const fresh = [];
-    for (const key of updateKeys) {
-        const next = updates[key];
-        if (next === null || next === undefined)
-            continue;
-        fresh.push(`${key}: ${formatFrontmatterValue(next)}`);
-    }
-    if (fresh.length === 0)
-        return source;
-    return `---\n${fresh.join('\n')}\n---\n${source}`;
-}
-/**
- * Create a minimal MarkdownDocument from a list of block nodes.
- * Convenience function for programmatic document construction.
- */
-export function createDocument(...children) {
-    return {
-        type: 'document',
-        children,
-    };
-}
-/**
- * Infer a human-readable title for a markdown document.
- *
- * Resolution order:
- *   1. `title:` value in YAML frontmatter (when present and non-empty)
- *   2. Text of the first heading found, walking top-level depth (H1, then
- *      H2, etc.) — the shallowest heading wins regardless of source order
- *
- * Returns `undefined` when no usable title is found.
- */
-export function inferDocumentTitle(doc) {
-    const fmTitle = doc.frontmatter?.title;
-    if (typeof fmTitle === 'string') {
-        const trimmed = fmTitle.trim();
-        if (trimmed)
-            return trimmed;
-    }
-    let best = null;
-    for (const node of doc.children) {
-        if (node.type !== 'heading')
-            continue;
-        const text = extractPlainText(node).trim();
-        if (!text)
-            continue;
-        if (best === null || node.depth < best.depth) {
-            best = { depth: node.depth, text };
-            if (best.depth === 1)
-                break;
-        }
-    }
-    return best?.text;
-}
-/**
- * Read a theme id from a markdown document's frontmatter.
- *
- * Checks the editor's canonical `squisq-theme` key first, then the
- * shorter legacy aliases (`themeId`, `theme`). Returns `undefined`
- * when none of them carry a non-empty string. Centralizing the lookup
- * keeps the export pipelines (DOCX, PPTX, HTML, plain-HTML bundle) in
- * sync with whatever the editor writes — adding a new frontmatter
- * spelling later is a one-file change.
- */
-export function readFrontmatterThemeId(frontmatter) {
-    if (!frontmatter)
-        return undefined;
-    const keys = ['squisq-theme', 'themeId', 'theme'];
-    for (const key of keys) {
-        const raw = frontmatter[key];
-        if (typeof raw === 'string') {
-            const trimmed = raw.trim();
-            if (trimmed)
-                return trimmed;
-        }
-    }
-    return undefined;
-}
-//# sourceMappingURL=utils.js.map

package/dist/markdown/utils.js.map

@@ -1 +0,0 @@
-{"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,2EAA2E;IAC3E,uEAAuE;IACvE,sDAAsD;IACtD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/E,OAAO,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACxD,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,MAAM,oBAAoB,GAAG,qCAAqC,CAAC;AAEnE,uFAAuF;AACvF,SAAS,sBAAsB,CAAC,KAAgC;IAC9D,IAAI,OAAO,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IAClF,2EAA2E;IAC3E,wEAAwE;IACxE,MAAM,UAAU,GACd,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;QACrB,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QAClB,KAAK,KAAK,EAAE;QACZ,KAAK,KAAK,MAAM;QAChB,KAAK,KAAK,OAAO;QACjB,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAC9B,sEAAsE;IACtE,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAClE,OAAO,IAAI,OAAO,GAAG,CAAC;AACxB,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,OAAqE;IAErE,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAE3C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,uEAAuE;IACvE,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;gBACxD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS,CAAC,SAAS;YAC5D,QAAQ,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,gDAAgD;QAChD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS;YAClD,QAAQ,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,sDAAsD;QACtD,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,OAAO,QAAQ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;IACrD,CAAC;IAED,uEAAuE;IACvE,kBAAkB;IAClB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QAClD,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACtC,OAAO,QAAQ,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,MAAM,EAAE,CAAC;AACpD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,GAAG,QAAsC;IACtE,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAqB;IACtD,MAAM,OAAO,GAAG,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC;IACvC,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/B,IAAI,OAAO;YAAE,OAAO,OAAO,CAAC;IAC9B,CAAC;IAED,IAAI,IAAI,GAA2C,IAAI,CAAC;IACxD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,SAAS;QACtC,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7C,IAAI,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;gBAAE,MAAM;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,IAAI,EAAE,IAAI,CAAC;AACpB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,sBAAsB,CACpC,WAAgD;IAEhD,IAAI,CAAC,WAAW;QAAE,OAAO,SAAS,CAAC;IACnC,MAAM,IAAI,GAAG,CAAC,cAAc,EAAE,SAAS,EAAE,OAAO,CAAU,CAAC;IAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;YAC3B,IAAI,OAAO;gBAAE,OAAO,OAAO,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/random/SeededRandom.d.ts

@@ -1,50 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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

@@ -1,115 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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.map

@@ -1 +0,0 @@
-{"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/recommend/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/recommend/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,YAAY,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAChF,OAAO,EAAE,oBAAoB,EAAE,0BAA0B,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/recommend/templates.d.ts

@@ -1,39 +0,0 @@
-/**
- * Block template recommendations.
- *
- * Given a slice of markdown block nodes (the body underneath a heading),
- * profile the content for image / video / quote / list / table / date /
- * stat signals, then map that profile to the set of templates that make
- * sense for the block. Used by the editor's template picker to surface a
- * "Recommended for this block" section above the full template list.
- */
-import type { MarkdownBlockNode } from '../markdown/types.js';
-export interface BlockContentProfile {
-    hasImage: boolean;
-    imageCount: number;
-    hasVideo: boolean;
-    hasBlockquote: boolean;
-    hasList: boolean;
-    hasTable: boolean;
-    hasDate: boolean;
-    hasNumberHighlight: boolean;
-    wordCount: number;
-}
-export interface RecommendationResult {
-    recommended: string[];
-    rest: string[];
-}
-/**
- * Walk a slice of block nodes and summarize what kinds of content it
- * contains. Cheap to run — no markdown parsing, just AST traversal.
- */
-export declare function profileBlockContents(nodes: MarkdownBlockNode[]): BlockContentProfile;
-/**
- * Split a flat list of template names into a "Recommended" bucket
- * (matches the active block's content profile) and a "rest" bucket
- * (everything else). Both buckets preserve the input ordering of
- * `allNames`, so the visual layout stays predictable as templates are
- * added.
- */
-export declare function recommendTemplatesForBlock(profile: BlockContentProfile, allNames: readonly string[]): RecommendationResult;
-//# sourceMappingURL=templates.d.ts.map

package/dist/recommend/templates.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"templates.d.ts","sourceRoot":"","sources":["../../src/recommend/templates.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAGV,iBAAiB,EAGlB,MAAM,sBAAsB,CAAC;AAE9B,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,OAAO,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,OAAO,CAAC;IAClB,OAAO,EAAE,OAAO,CAAC;IACjB,kBAAkB,EAAE,OAAO,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AA0DD;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,iBAAiB,EAAE,GAAG,mBAAmB,CAwFpF;AAqED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CACxC,OAAO,EAAE,mBAAmB,EAC5B,QAAQ,EAAE,SAAS,MAAM,EAAE,GAC1B,oBAAoB,CAStB"}