deepclause-sdk 0.0.89 → 0.1.1

package/dist/validate.js

@@ -0,0 +1,338 @@
+/**
+ * DML validation and linting.
+ *
+ * Parses DML with the real Prolog reader and applies structural/lint checks.
+ * This is the surviving part of the old compiler module (the Markdown->DML
+ * generator was removed); it is exported as `deepclause-sdk/validate` and used
+ * by the CLI's `validate_dml` runtime tool and by downstream apps
+ * (`deepclause-pi`, `sop2harness`).
+ */
+import { loadProlog } from './prolog/loader.js';
+// =============================================================================
+// Prolog Validation
+// =============================================================================
+let prologInstance = null;
+/**
+ * Get or initialize Prolog instance for validation
+ */
+async function getProlog() {
+    if (!prologInstance) {
+        prologInstance = await loadProlog();
+    }
+    return prologInstance;
+}
+/**
+ * Validate DML code using the actual Prolog parser
+ */
+export async function validateWithProlog(dml) {
+    const errors = [];
+    const warnings = [];
+    try {
+        const swipl = await getProlog();
+        // Write code to temp file
+        const tempPath = `/tmp/validate_${Date.now()}_${Math.random().toString(36).substring(7)}.pl`;
+        swipl.FS.writeFile(tempPath, dml);
+        // Try to parse the file using read_term which will catch syntax errors
+        try {
+            swipl.prolog.query(`catch(
+          (
+            open('${tempPath}', read, Stream, []),
+            call_cleanup(
+              read_all_terms(Stream),
+              close(Stream)
+            )
+          ),
+          Error,
+          (
+            Error = error(syntax_error(Message), _) -> 
+              true 
+            ; 
+              (term_to_atom(Error, Message), true)
+          )
+        ), 
+        read_all_terms(S) :- 
+          repeat,
+          read_term(S, T, [syntax_errors(error)]),
+          (T == end_of_file -> ! ; fail)`);
+            // Simple approach: try to consult the file
+            try {
+                swipl.prolog.call(`consult('${tempPath}')`);
+            }
+            catch (consultError) {
+                const errMsg = consultError instanceof Error ? consultError.message : String(consultError);
+                if (errMsg.includes('syntax') || errMsg.includes('error')) {
+                    // Extract meaningful error message
+                    const match = errMsg.match(/(?:syntax_error|error)\s*\(\s*['"]?([^'")\]]+)/i);
+                    if (match) {
+                        errors.push(`Syntax error: ${match[1]}`);
+                    }
+                    else {
+                        errors.push(`Parse error: ${errMsg.substring(0, 200)}`);
+                    }
+                }
+            }
+        }
+        catch (e) {
+            const errMsg = e instanceof Error ? e.message : String(e);
+            if (errMsg.includes('syntax') || errMsg.includes('error')) {
+                errors.push(errMsg.substring(0, 200));
+            }
+        }
+        // Check for required elements
+        if (!dml.includes('agent_main')) {
+            errors.push('Missing agent_main predicate - every DML program must define agent_main');
+        }
+        // Check for balanced delimiters
+        const delimiterCheck = checkBalancedDelimiters(dml);
+        errors.push(...delimiterCheck.errors);
+        // Check for common mistakes
+        const lintResult = lintDML(dml);
+        errors.push(...lintResult.errors);
+        warnings.push(...lintResult.warnings);
+        // Cleanup temp file
+        try {
+            swipl.FS.unlink(tempPath);
+        }
+        catch {
+            // Ignore cleanup errors
+        }
+    }
+    catch (error) {
+        // If Prolog itself fails, fall back to basic validation
+        return validateDMLSyntaxBasic(dml);
+    }
+    return {
+        valid: errors.length === 0,
+        errors,
+        warnings: warnings.length > 0 ? warnings : undefined
+    };
+}
+/**
+ * Check balanced delimiters
+ */
+function checkBalancedDelimiters(dml) {
+    const errors = [];
+    // Remove strings and comments for delimiter checking
+    const stripped = dml
+        .replace(/"(?:[^"\\]|\\.)*"/g, '""') // Remove string contents
+        .replace(/%.*$/gm, '') // Remove line comments
+        .replace(/\/\*[\s\S]*?\*\//g, ''); // Remove block comments
+    let parenCount = 0;
+    let bracketCount = 0;
+    let braceCount = 0;
+    for (const char of stripped) {
+        if (char === '(')
+            parenCount++;
+        if (char === ')')
+            parenCount--;
+        if (char === '[')
+            bracketCount++;
+        if (char === ']')
+            bracketCount--;
+        if (char === '{')
+            braceCount++;
+        if (char === '}')
+            braceCount--;
+        if (parenCount < 0) {
+            errors.push('Unbalanced parentheses: extra closing )');
+            break;
+        }
+        if (bracketCount < 0) {
+            errors.push('Unbalanced brackets: extra closing ]');
+            break;
+        }
+        if (braceCount < 0) {
+            errors.push('Unbalanced braces: extra closing }');
+            break;
+        }
+    }
+    if (parenCount > 0)
+        errors.push(`Unbalanced parentheses: ${parenCount} unclosed (`);
+    if (bracketCount > 0)
+        errors.push(`Unbalanced brackets: ${bracketCount} unclosed [`);
+    if (braceCount > 0)
+        errors.push(`Unbalanced braces: ${braceCount} unclosed {`);
+    return { errors };
+}
+/**
+ * Extract all string literals from DML code (both single and double quoted)
+ */
+function extractStringLiterals(dml) {
+    const doubleQuoted = [];
+    const singleQuoted = [];
+    // Double-quoted strings
+    for (const m of dml.matchAll(/"((?:[^"\\]|\\.)*)"/g)) {
+        doubleQuoted.push(m[1]);
+    }
+    // Single-quoted atoms
+    for (const m of dml.matchAll(/'((?:[^'\\]|\\.)*)'/g)) {
+        singleQuoted.push(m[1]);
+    }
+    return { doubleQuoted, singleQuoted };
+}
+/**
+ * Strip comments and string contents for structural analysis
+ */
+function stripForAnalysis(dml) {
+    return dml
+        .replace(/%.*$/gm, '') // line comments
+        .replace(/\/\*[\s\S]*?\*\//g, '') // block comments
+        .replace(/"(?:[^"\\]|\\.)*"/g, '""') // double-quoted string contents
+        .replace(/'(?:[^'\\]|\\.)*'/g, "''"); // single-quoted atom contents
+}
+/**
+ * Lint DML for common issues — focused on string handling and structural errors.
+ * Returns errors (will crash at runtime) and warnings (likely wrong).
+ */
+function lintDML(dml) {
+    const errors = [];
+    const warnings = [];
+    const stripped = stripForAnalysis(dml);
+    const { doubleQuoted, singleQuoted } = extractStringLiterals(dml);
+    const allStrings = [...doubleQuoted, ...singleQuoted];
+    // ═══════════════════════════════════════════════════════════════════════════
+    // STRING HANDLING ERRORS — these WILL crash or produce wrong output
+    // ═══════════════════════════════════════════════════════════════════════════
+    // E1: format() passed directly to output() or answer()
+    //     format/3 binds its first arg, it does NOT return a value.
+    //     output(format("...", [...])) is always wrong.
+    if (/output\s*\(\s*format\s*\(/.test(dml)) {
+        errors.push('ERROR: format/3 does not return a value. `output(format(...))` will crash. Fix: format(string(S), "...", [...]), output(S).');
+    }
+    if (/answer\s*\(\s*format\s*\(/.test(dml)) {
+        errors.push('ERROR: format/3 does not return a value. `answer(format(...))` will crash. Fix: format(string(S), "...", [...]), answer(S).');
+    }
+    // E2: ~Variable in task/prompt description strings (only ~w, ~d, ~a, ~s work with format)
+    //     task("Analyze ~Topic", R) does NOT interpolate. Use {Topic}.
+    for (const s of doubleQuoted) {
+        if (/~[A-Z][a-zA-Z0-9_]*/.test(s)) {
+            errors.push(`ERROR: ~Variable interpolation does not work in DML. Found in: "...${s.substring(0, 60)}...". Use {Variable} syntax instead (e.g. {Topic} not ~Topic).`);
+            break;
+        }
+    }
+    // E3: {Variable} inside format/3 template string
+    //     format(string(S), "Hello {Name}", []) — the {Name} won't be interpolated by format.
+    //     This is a style-mixing bug.
+    const formatCalls = dml.matchAll(/format\s*\(\s*(?:string|atom)\s*\([^)]*\)\s*,\s*"([^"]*)"/g);
+    for (const m of formatCalls) {
+        const tmpl = m[1];
+        if (/\{[A-Z][a-zA-Z0-9_]*\}/.test(tmpl)) {
+            errors.push(`ERROR: {Variable} inside format() template does nothing — format uses ~w placeholders. Found: "${tmpl.substring(0, 60)}". Use EITHER {Variable} in task() strings OR ~w in format() strings, never both in the same string.`);
+            break;
+        }
+    }
+    // E4: String concatenation with + operator
+    //     "hello" + "world" or Var + Var — Prolog's + is arithmetic only.
+    if (/"\s*\+\s*"/.test(dml) || /"\s*\+\s*[A-Z]/.test(dml) || /[A-Z][a-zA-Z_0-9]*\s*\+\s*"/.test(dml)) {
+        errors.push('ERROR: The + operator is arithmetic only in Prolog, not string concatenation. Use {Variable} interpolation in task() strings, or atom_concat/3, or format/3 for building strings.');
+    }
+    // E5: task() with non-string first arg — task(llm(...)) or task(prompt(...))
+    if (/task\s*\(\s*(?:llm|prompt)\s*\(/.test(stripped)) {
+        errors.push('ERROR: task() takes a plain string as first argument. task(llm(...)) and task(prompt(...)) are wrong. Use: task("description string", Var).');
+    }
+    // E6: Hallucinated predicates — these do NOT exist in DML runtime
+    //     But skip if user defines the predicate themselves (pred(...) :- ...).
+    const hallucinated = [
+        ['json_parse', 'json_parse/2 does not exist. Use task() to extract data from JSON via LLM.'],
+        ['http_get', 'http_get does not exist. Use exec(url_fetch(url: URL), R).'],
+        ['string_format', 'string_format does not exist. Use format(string(R), FormatStr, Args).'],
+        ['get_field', 'get_field does not exist. Use get_dict(Key, Dict, Value) — note: Key comes first.'],
+        ['string_join', 'string_join does not exist. Use atomic_list_concat(List, Sep, Atom).'],
+        ['string_lower', 'string_lower does not exist. Use downcase_atom(Atom, Lower).'],
+        ['string_trim', 'string_trim does not exist. Use normalize_space(string(Out), In).'],
+        ['contains', 'contains/2 does not exist. Use sub_atom/5 or sub_string/5.'],
+    ];
+    for (const [name, msg] of hallucinated) {
+        const usePattern = new RegExp(`(?<!\\w)${name}\\s*\\(`, 'g');
+        if (usePattern.test(stripped)) {
+            // Check if user defines this predicate (name(...) :- or name(...) .)
+            const defPattern = new RegExp(`^${name}\\s*\\([^)]*\\)\\s*(?::-|\\.)`, 'm');
+            if (!defPattern.test(stripped)) {
+                errors.push(`ERROR: ${msg}`);
+            }
+        }
+    }
+    // E7: url_fetch used as a bare predicate (not wrapped in exec)
+    //     url_fetch("url", R) is wrong. Must be exec(url_fetch(url: "..."), R).
+    if (/(?<!exec\s*\(\s*)url_fetch\s*\(\s*"/.test(stripped)) {
+        errors.push('ERROR: url_fetch is not a predicate. Must use exec/2 wrapper: exec(url_fetch(url: URL), R).');
+    }
+    // E8: curl/wget in bash command strings
+    for (const s of allStrings) {
+        if (/\b(?:curl|wget)\s/.test(s)) {
+            errors.push('ERROR: curl and wget are banned — the VM has no direct internet. Use exec(url_fetch(url: URL), R) to fetch web content.');
+            break;
+        }
+    }
+    // E9: writeln() used for user output — not a DML predicate
+    if (/(?<!\w)writeln\s*\(/.test(stripped)) {
+        // Check it's not inside an open/close file I/O block (write to stream is OK)
+        // Simple heuristic: if there's no open() call, writeln is definitely wrong
+        if (!/\bopen\s*\(/.test(stripped) || /writeln\s*\(\s*['"]/.test(dml)) {
+            errors.push('ERROR: writeln() is not a DML output predicate. Use output() for progress messages and answer() for final results.');
+        }
+    }
+    // ═══════════════════════════════════════════════════════════════════════════
+    // STRING HANDLING WARNINGS — likely wrong, should fix
+    // ═══════════════════════════════════════════════════════════════════════════
+    // W1: Mixing {Variable} interpolation and format/3 in the same clause
+    //     Not always wrong (different strings), but a code smell with small models
+    const hasInterpolation = /\{[A-Z][a-zA-Z0-9_]*\}/.test(dml);
+    const hasFormat = /format\s*\(/.test(stripped);
+    if (hasInterpolation && hasFormat) {
+        warnings.push('WARNING: Code mixes {Variable} interpolation and format/3. This is allowed but can confuse the runtime if mixed in the same string. Ensure {Variable} is only in task()/output()/answer() strings and ~w is only in format() strings.');
+    }
+    // W2: No tool definitions — model probably wrote pure Prolog
+    if (!/\btool\s*\(/.test(dml)) {
+        warnings.push('WARNING: No tool() definitions found. This is fine for pure Prolog or direct exec()-only skills, but LLM-driven skills usually need tool()/3 wrappers for task() calls.');
+    }
+    // W3: No task() call — model probably wrote pure Prolog logic
+    if (!/\btask\s*\(/.test(stripped)) {
+        warnings.push('WARNING: No task() call found. This is fine for deterministic or simple skills. Skills that need open-ended reasoning, summarization, extraction, or classification should usually use task().');
+    }
+    // W4: No system() call — LLM has no instructions
+    if (!/\bsystem\s*\(/.test(stripped)) {
+        warnings.push('WARNING: No system() call found. Add system() when the skill uses task()/prompt() and the LLM needs instructions on how to use tools.');
+    }
+    // W5: No answer() call — skill completes silently
+    if (!/\banswer\s*\(/.test(stripped)) {
+        warnings.push('WARNING: No answer() call found. The skill will complete without returning a result to the user.');
+    }
+    // W6: No output() before task/exec — skill appears frozen
+    if (/\btask\s*\(/.test(stripped) && !/\boutput\s*\(/.test(stripped)) {
+        warnings.push('WARNING: No output() calls found. Add output() before long-running task() or exec() calls so the skill doesn\'t appear frozen.');
+    }
+    // W7: Single agent_main clause — no fallback
+    const mainMatches = stripped.match(/agent_main\s*[\(\.]/g);
+    if (mainMatches && mainMatches.length === 1) {
+        warnings.push('WARNING: Only one agent_main clause. Add a fallback clause with a static error message (no LLM calls) as required by Rule 7.');
+    }
+    // W8: Dict dot notation — Result.field etc.
+    //     Only check outside strings — match Var.key pattern in code
+    if (/[A-Z][a-zA-Z_0-9]*\.[a-z][a-z_]+(?!\s*\()/.test(stripped)) {
+        warnings.push('WARNING: Possible dict dot notation (e.g. Result.stdout). This may not work — use get_dict(Key, Dict, Value) instead.');
+    }
+    return { errors, warnings };
+}
+/**
+ * Basic syntax validation (fallback when Prolog fails)
+ */
+function validateDMLSyntaxBasic(dml) {
+    const errors = [];
+    if (!dml.includes('agent_main')) {
+        errors.push('Missing agent_main predicate');
+    }
+    const delimiterCheck = checkBalancedDelimiters(dml);
+    errors.push(...delimiterCheck.errors);
+    // Check for unclosed strings
+    const stringPattern = /"(?:[^"\\]|\\.)*"/g;
+    const cleanedDml = dml.replace(stringPattern, '""');
+    if ((cleanedDml.match(/"/g) || []).length % 2 !== 0) {
+        errors.push('Unclosed string literal');
+    }
+    return {
+        valid: errors.length === 0,
+        errors: [...new Set(errors)]
+    };
+}
+//# sourceMappingURL=validate.js.map

package/dist/validate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.js","sourceRoot":"","sources":["../src/validate.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,UAAU,EAAoB,MAAM,oBAAoB,CAAC;AAYlE,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF,IAAI,cAAc,GAAuB,IAAI,CAAC;AAE9C;;GAEG;AACH,KAAK,UAAU,SAAS;IACtB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,MAAM,UAAU,EAAE,CAAC;IACtC,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,GAAW;IAClD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,SAAS,EAAE,CAAC;QAEhC,0BAA0B;QAC1B,MAAM,QAAQ,GAAG,iBAAiB,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;QAC7F,KAAK,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAElC,uEAAuE;QACvE,IAAI,CAAC;YACH,KAAK,CAAC,MAAM,CAAC,KAAK,CAChB;;oBAEY,QAAQ;;;;;;;;;;;;;;;;;yCAiBa,CAClC,CAAC;YAEF,2CAA2C;YAC3C,IAAI,CAAC;gBACH,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,QAAQ,IAAI,CAAC,CAAC;YAC9C,CAAC;YAAC,OAAO,YAAY,EAAE,CAAC;gBACtB,MAAM,MAAM,GAAG,YAAY,YAAY,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;gBAC3F,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC1D,mCAAmC;oBACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,iDAAiD,CAAC,CAAC;oBAC9E,IAAI,KAAK,EAAE,CAAC;wBACV,MAAM,CAAC,IAAI,CAAC,iBAAiB,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBAC3C,CAAC;yBAAM,CAAC;wBACN,MAAM,CAAC,IAAI,CAAC,gBAAgB,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC1D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1D,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC1D,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;QACzF,CAAC;QAED,gCAAgC;QAChC,MAAM,cAAc,GAAG,uBAAuB,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QAEtC,4BAA4B;QAC5B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;QAEtC,oBAAoB;QACpB,IAAI,CAAC;YACH,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,wBAAwB;QAC1B,CAAC;IAEH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,wDAAwD;QACxD,OAAO,sBAAsB,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM;QACN,QAAQ,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;KACrD,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAAC,GAAW;IAC1C,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,qDAAqD;IACrD,MAAM,QAAQ,GAAG,GAAG;SACjB,OAAO,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAE,yBAAyB;SAC9D,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAiB,uBAAuB;SAC7D,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC,CAAK,wBAAwB;IAEjE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,KAAK,GAAG;YAAE,UAAU,EAAE,CAAC;QAC/B,IAAI,IAAI,KAAK,GAAG;YAAE,UAAU,EAAE,CAAC;QAC/B,IAAI,IAAI,KAAK,GAAG;YAAE,YAAY,EAAE,CAAC;QACjC,IAAI,IAAI,KAAK,GAAG;YAAE,YAAY,EAAE,CAAC;QACjC,IAAI,IAAI,KAAK,GAAG;YAAE,UAAU,EAAE,CAAC;QAC/B,IAAI,IAAI,KAAK,GAAG;YAAE,UAAU,EAAE,CAAC;QAE/B,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;YACvD,MAAM;QACR,CAAC;QACD,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;YACpD,MAAM;QACR,CAAC;QACD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;YAClD,MAAM;QACR,CAAC;IACH,CAAC;IAED,IAAI,UAAU,GAAG,CAAC;QAAE,MAAM,CAAC,IAAI,CAAC,2BAA2B,UAAU,aAAa,CAAC,CAAC;IACpF,IAAI,YAAY,GAAG,CAAC;QAAE,MAAM,CAAC,IAAI,CAAC,wBAAwB,YAAY,aAAa,CAAC,CAAC;IACrF,IAAI,UAAU,GAAG,CAAC;QAAE,MAAM,CAAC,IAAI,CAAC,sBAAsB,UAAU,aAAa,CAAC,CAAC;IAE/E,OAAO,EAAE,MAAM,EAAE,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,GAAW;IACxC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,wBAAwB;IACxB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,sBAAsB,CAAC,EAAE,CAAC;QACrD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,sBAAsB;IACtB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,sBAAsB,CAAC,EAAE,CAAC;QACrD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,GAAW;IACnC,OAAO,GAAG;SACP,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAiB,gBAAgB;SACtD,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAM,iBAAiB;SACvD,OAAO,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAG,gCAAgC;SACtE,OAAO,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAC,CAAE,8BAA8B;AACzE,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,GAAW;IAC1B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,CAAC,GAAG,YAAY,EAAE,GAAG,YAAY,CAAC,CAAC;IAEtD,8EAA8E;IAC9E,oEAAoE;IACpE,8EAA8E;IAE9E,uDAAuD;IACvD,gEAAgE;IAChE,oDAAoD;IACpD,IAAI,2BAA2B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,6HAA6H,CAAC,CAAC;IAC7I,CAAC;IACD,IAAI,2BAA2B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,6HAA6H,CAAC,CAAC;IAC7I,CAAC;IAED,0FAA0F;IAC1F,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,IAAI,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,sEAAsE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,gEAAgE,CAAC,CAAC;YACtK,MAAM;QACR,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,0FAA0F;IAC1F,kCAAkC;IAClC,MAAM,WAAW,GAAG,GAAG,CAAC,QAAQ,CAAC,4DAA4D,CAAC,CAAC;IAC/F,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,kGAAkG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,sGAAsG,CAAC,CAAC;YAC3O,MAAM;QACR,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,sEAAsE;IACtE,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,6BAA6B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACpG,MAAM,CAAC,IAAI,CAAC,mLAAmL,CAAC,CAAC;IACnM,CAAC;IAED,6EAA6E;IAC7E,IAAI,iCAAiC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,6IAA6I,CAAC,CAAC;IAC7J,CAAC;IAED,kEAAkE;IAClE,4EAA4E;IAC5E,MAAM,YAAY,GAA4B;QAC5C,CAAC,YAAY,EAAE,4EAA4E,CAAC;QAC5F,CAAC,UAAU,EAAE,4DAA4D,CAAC;QAC1E,CAAC,eAAe,EAAE,uEAAuE,CAAC;QAC1F,CAAC,WAAW,EAAE,mFAAmF,CAAC;QAClG,CAAC,aAAa,EAAE,sEAAsE,CAAC;QACvF,CAAC,cAAc,EAAE,8DAA8D,CAAC;QAChF,CAAC,aAAa,EAAE,mEAAmE,CAAC;QACpF,CAAC,UAAU,EAAE,4DAA4D,CAAC;KAC3E,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,YAAY,EAAE,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,WAAW,IAAI,SAAS,EAAE,GAAG,CAAC,CAAC;QAC7D,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,qEAAqE;YACrE,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,IAAI,IAAI,+BAA+B,EAAE,GAAG,CAAC,CAAC;YAC5E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,4EAA4E;IAC5E,IAAI,qCAAqC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzD,MAAM,CAAC,IAAI,CAAC,6FAA6F,CAAC,CAAC;IAC7G,CAAC;IAED,wCAAwC;IACxC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,yHAAyH,CAAC,CAAC;YACvI,MAAM;QACR,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,IAAI,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzC,6EAA6E;QAC7E,2EAA2E;QAC3E,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACrE,MAAM,CAAC,IAAI,CAAC,oHAAoH,CAAC,CAAC;QACpI,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,sDAAsD;IACtD,8EAA8E;IAE9E,sEAAsE;IACtE,+EAA+E;IAC/E,MAAM,gBAAgB,GAAG,wBAAwB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,IAAI,gBAAgB,IAAI,SAAS,EAAE,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC,uOAAuO,CAAC,CAAC;IACzP,CAAC;IAED,6DAA6D;IAC7D,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,QAAQ,CAAC,IAAI,CAAC,yKAAyK,CAAC,CAAC;IAC3L,CAAC;IAED,8DAA8D;IAC9D,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC,gMAAgM,CAAC,CAAC;IAClN,CAAC;IAED,iDAAiD;IACjD,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpC,QAAQ,CAAC,IAAI,CAAC,uIAAuI,CAAC,CAAC;IACzJ,CAAC;IAED,kDAAkD;IAClD,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpC,QAAQ,CAAC,IAAI,CAAC,kGAAkG,CAAC,CAAC;IACpH,CAAC;IAED,0DAA0D;IAC1D,IAAI,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpE,QAAQ,CAAC,IAAI,CAAC,gIAAgI,CAAC,CAAC;IAClJ,CAAC;IAED,6CAA6C;IAC7C,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;IAC3D,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5C,QAAQ,CAAC,IAAI,CAAC,8HAA8H,CAAC,CAAC;IAChJ,CAAC;IAED,4CAA4C;IAC5C,iEAAiE;IACjE,IAAI,2CAA2C,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/D,QAAQ,CAAC,IAAI,CAAC,uHAAuH,CAAC,CAAC;IACzI,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,GAAW;IACzC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM,cAAc,GAAG,uBAAuB,CAAC,GAAG,CAAC,CAAC;IACpD,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAEtC,6BAA6B;IAC7B,MAAM,aAAa,GAAG,oBAAoB,CAAC;IAC3C,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;IACpD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACpD,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IACzC,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;KAC7B,CAAC;AACJ,CAAC"}

package/dist/visualize/ascii.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Render a Mermaid `flowchart` (the subset `visualize` asks the model for) as a
+ * Unicode tree, so a diagram can be shown inline in the REPL, in a tool result,
+ * or over a terminal that has no image protocol.
+ *
+ * No dependencies and no browser: the diagram is parsed into nodes and edges and
+ * laid out as an indented flow. `parseMermaidFlowchart` / `buildFlowTree` are
+ * also consumed by `svg.ts` for the terminal-image path.
+ *
+ * Supported: `flowchart TD|TB|BT|LR|RL`, node shapes `[..] (..) {..} ([..])
+ * [[..]] ((..)) {{..}}`, quoted labels, chained edges (`A --> B --> C`),
+ * connectors `--> --- -.-> ==> -.- ===`, edge labels (`-->|x|`, `-- x -->`),
+ * and `subgraph`/`end` (grouping is flattened).
+ */
+export type NodeShape = 'rect' | 'round' | 'diamond' | 'stadium' | 'subroutine' | 'circle' | 'hexagon';
+export interface MermaidNode {
+    id: string;
+    /** The display label (defaults to the node id). */
+    label: string;
+    shape: NodeShape;
+}
+export interface MermaidEdge {
+    from: string;
+    to: string;
+    /** Edge label (`-->|yes|` or `-- yes -->`). */
+    label?: string;
+}
+export interface ParsedFlowchart {
+    /** `TD`, `LR`, … (defaults to `TD`). */
+    direction: string;
+    nodes: MermaidNode[];
+    edges: MermaidEdge[];
+}
+export interface FlowTreeNode {
+    id: string;
+    label: string;
+    shape: NodeShape;
+    /** Label on the edge from the parent (undefined for a root). */
+    edgeLabel?: string;
+    /** True for a back/duplicate reference (the subtree is not expanded again). */
+    repeated?: boolean;
+    children: FlowTreeNode[];
+}
+/** Parse a Mermaid flowchart into nodes and edges. */
+export declare function parseMermaidFlowchart(source: string): ParsedFlowchart;
+/** Build the root(s) of a tree view, marking back/duplicate references. */
+export declare function buildFlowTree(parsed: ParsedFlowchart): FlowTreeNode[];
+/** Lay a tree view out as indented Unicode lines. */
+export declare function renderFlowTree(roots: FlowTreeNode[]): string[];
+/**
+ * Render Mermaid flowchart source as terminal text. Falls back to the trimmed
+ * source when the input is not a recognizable flowchart.
+ */
+export declare function renderMermaidAscii(source: string): string;
+//# sourceMappingURL=ascii.d.ts.map

package/dist/visualize/ascii.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ascii.d.ts","sourceRoot":"","sources":["../../src/visualize/ascii.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,GAAG,SAAS,GAAG,YAAY,GAAG,QAAQ,GAAG,SAAS,CAAC;AAEvG,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,mDAAmD;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,SAAS,CAAC;CAClB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,+CAA+C;IAC/C,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,eAAe;IAC9B,wCAAwC;IACxC,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,KAAK,EAAE,WAAW,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,SAAS,CAAC;IACjB,gEAAgE;IAChE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,+EAA+E;IAC/E,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,QAAQ,EAAE,YAAY,EAAE,CAAC;CAC1B;AA0HD,sDAAsD;AACtD,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,GAAG,eAAe,CAsCrE;AAED,2EAA2E;AAC3E,wBAAgB,aAAa,CAAC,MAAM,EAAE,eAAe,GAAG,YAAY,EAAE,CA+CrE;AAED,qDAAqD;AACrD,wBAAgB,cAAc,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,EAAE,CAkB9D;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAMzD"}

package/dist/visualize/ascii.js

@@ -0,0 +1,242 @@
+/**
+ * Render a Mermaid `flowchart` (the subset `visualize` asks the model for) as a
+ * Unicode tree, so a diagram can be shown inline in the REPL, in a tool result,
+ * or over a terminal that has no image protocol.
+ *
+ * No dependencies and no browser: the diagram is parsed into nodes and edges and
+ * laid out as an indented flow. `parseMermaidFlowchart` / `buildFlowTree` are
+ * also consumed by `svg.ts` for the terminal-image path.
+ *
+ * Supported: `flowchart TD|TB|BT|LR|RL`, node shapes `[..] (..) {..} ([..])
+ * [[..]] ((..)) {{..}}`, quoted labels, chained edges (`A --> B --> C`),
+ * connectors `--> --- -.-> ==> -.- ===`, edge labels (`-->|x|`, `-- x -->`),
+ * and `subgraph`/`end` (grouping is flattened).
+ */
+const HEADER = /^\s*(?:flowchart|graph)\s+(TD|TB|BT|LR|RL)\b/i;
+const CONNECTOR = /^(-{2,3}>|={2,}>|-\.-+>|-\.-|--o|--x|-{2,}|={2,})/;
+/** Shape open/close pairs, longest opener first. */
+const SHAPES = [
+    { open: '([', close: '])', shape: 'stadium' },
+    { open: '[[', close: ']]', shape: 'subroutine' },
+    { open: '((', close: '))', shape: 'circle' },
+    { open: '{{', close: '}}', shape: 'hexagon' },
+    { open: '[', close: ']', shape: 'rect' },
+    { open: '(', close: ')', shape: 'round' },
+    { open: '{', close: '}', shape: 'diamond' },
+];
+/** Normalize `-- label -->` into `-->|label|` so one edge form is parsed. */
+function normalizeEdgeLabels(line) {
+    return line
+        .replace(/--\s+([^|>{}[\]]+?)\s+-->/g, '-->|$1|')
+        .replace(/--\s+([^|>{}[\]]+?)\s+---/g, '---|$1|');
+}
+/** Read one node reference (`id` plus an optional shape) starting at `i`. */
+function readNode(text, i) {
+    let j = i;
+    while (j < text.length && /\s/.test(text[j])) {
+        j += 1;
+    }
+    const idMatch = /^([A-Za-z_][A-Za-z0-9_-]*|\d+)/.exec(text.slice(j));
+    if (!idMatch) {
+        return undefined;
+    }
+    const id = idMatch[1];
+    j += id.length;
+    let label = id;
+    let shape = 'rect';
+    const spec = SHAPES.find((s) => text.startsWith(s.open, j));
+    if (spec) {
+        const start = j + spec.open.length;
+        const close = text.indexOf(spec.close, start);
+        if (close !== -1) {
+            label = text.slice(start, close).trim();
+            shape = spec.shape;
+            j = close + spec.close.length;
+        }
+    }
+    if ((label.startsWith('"') && label.endsWith('"')) || (label.startsWith("'") && label.endsWith("'"))) {
+        label = label.slice(1, -1);
+    }
+    return { node: { id, label: label || id, shape }, next: j };
+}
+/** Parse a single flowchart line into edges (and register any new nodes). */
+function parseLine(line, nodes, edges) {
+    const text = normalizeEdgeLabels(line.trim().replace(/;+\s*$/, ''));
+    if (!text) {
+        return;
+    }
+    const register = (node) => {
+        const existing = nodes.get(node.id);
+        if (existing) {
+            // Prefer a real label over a bare id reference.
+            if (node.label !== node.id && existing.label === existing.id) {
+                nodes.set(node.id, { ...existing, label: node.label, shape: node.shape });
+            }
+            return;
+        }
+        nodes.set(node.id, node);
+    };
+    let cursor = 0;
+    let prev = readNode(text, cursor);
+    if (!prev) {
+        return;
+    }
+    register(prev.node);
+    cursor = prev.next;
+    for (;;) {
+        while (cursor < text.length && /\s/.test(text[cursor])) {
+            cursor += 1;
+        }
+        if (cursor >= text.length) {
+            return;
+        }
+        const connector = CONNECTOR.exec(text.slice(cursor));
+        if (!connector) {
+            const extra = readNode(text, cursor);
+            if (!extra) {
+                return;
+            }
+            register(extra.node);
+            prev = extra;
+            cursor = extra.next;
+            continue;
+        }
+        cursor += connector[1].length;
+        while (cursor < text.length && /\s/.test(text[cursor])) {
+            cursor += 1;
+        }
+        let label;
+        if (text[cursor] === '|') {
+            const close = text.indexOf('|', cursor + 1);
+            if (close !== -1) {
+                label = text.slice(cursor + 1, close).trim() || undefined;
+                cursor = close + 1;
+            }
+        }
+        const next = readNode(text, cursor);
+        if (!next) {
+            return;
+        }
+        register(next.node);
+        edges.push({ from: prev.node.id, to: next.node.id, label });
+        prev = next;
+        cursor = next.next;
+    }
+}
+/** Parse a Mermaid flowchart into nodes and edges. */
+export function parseMermaidFlowchart(source) {
+    const nodes = new Map();
+    const edges = [];
+    let direction = 'TD';
+    let subgraphs = 0;
+    let sawHeader = false;
+    for (const rawLine of (source ?? '').split('\n')) {
+        const trimmed = rawLine.replace(/\s+$/, '').trim();
+        if (!trimmed || trimmed.startsWith('%%')) {
+            continue;
+        }
+        const header = HEADER.exec(trimmed);
+        if (header) {
+            direction = header[1].toUpperCase() === 'TB' ? 'TD' : header[1].toUpperCase();
+            sawHeader = true;
+            continue;
+        }
+        // Only parse a body once a flowchart header has been seen, so prose that
+        // was not a diagram is not mistaken for a list of bare nodes.
+        if (!sawHeader) {
+            continue;
+        }
+        if (/^subgraph\b/i.test(trimmed)) {
+            subgraphs += 1;
+            continue;
+        }
+        if (/^end\b/i.test(trimmed) && subgraphs > 0) {
+            subgraphs -= 1;
+            continue;
+        }
+        if (/^(classDef|class|style|linkStyle|click|direction)\b/i.test(trimmed)) {
+            continue;
+        }
+        parseLine(trimmed, nodes, edges);
+    }
+    return { direction, nodes: [...nodes.values()], edges };
+}
+/** Build the root(s) of a tree view, marking back/duplicate references. */
+export function buildFlowTree(parsed) {
+    const byId = new Map(parsed.nodes.map((n) => [n.id, n]));
+    const children = new Map();
+    const indegree = new Map();
+    for (const node of parsed.nodes) {
+        children.set(node.id, []);
+        indegree.set(node.id, 0);
+    }
+    for (const edge of parsed.edges) {
+        if (!byId.has(edge.from)) {
+            byId.set(edge.from, { id: edge.from, label: edge.from, shape: 'rect' });
+        }
+        if (!byId.has(edge.to)) {
+            byId.set(edge.to, { id: edge.to, label: edge.to, shape: 'rect' });
+        }
+        indegree.set(edge.to, (indegree.get(edge.to) ?? 0) + 1);
+        indegree.set(edge.from, indegree.get(edge.from) ?? 0);
+        if (!children.has(edge.from)) {
+            children.set(edge.from, []);
+        }
+        children.get(edge.from).push(edge);
+    }
+    const build = (id, edgeLabel, seen) => {
+        const node = byId.get(id) ?? { id, label: id, shape: 'rect' };
+        const repeated = seen.has(id);
+        const treeNode = {
+            id,
+            label: node.label,
+            shape: node.shape,
+            edgeLabel,
+            repeated,
+            children: [],
+        };
+        if (repeated) {
+            return treeNode;
+        }
+        seen.add(id);
+        for (const edge of children.get(id) ?? []) {
+            treeNode.children.push(build(edge.to, edge.label, seen));
+        }
+        return treeNode;
+    };
+    const roots = parsed.nodes.filter((n) => (indegree.get(n.id) ?? 0) === 0).map((n) => n.id);
+    const rootIds = roots.length > 0 ? roots : parsed.nodes.slice(0, 1).map((n) => n.id);
+    return rootIds.map((id) => build(id, undefined, new Set()));
+}
+/** Lay a tree view out as indented Unicode lines. */
+export function renderFlowTree(roots) {
+    const lines = [];
+    const emit = (node, prefix, isLast) => {
+        const edge = node.edgeLabel ? `(${node.edgeLabel}) ` : '';
+        lines.push(`${prefix}${isLast ? '└─▶ ' : '├─▶ '}${edge}${node.label}${node.repeated ? '  ↻' : ''}`);
+        const childPrefix = prefix + (isLast ? '    ' : '│   ');
+        node.children.forEach((child, index) => emit(child, childPrefix, index === node.children.length - 1));
+    };
+    for (const root of roots) {
+        if (roots.length === 1) {
+            lines.push(root.label);
+            root.children.forEach((child, index) => emit(child, '', index === root.children.length - 1));
+        }
+        else {
+            emit(root, '', root === roots[roots.length - 1]);
+        }
+    }
+    return lines;
+}
+/**
+ * Render Mermaid flowchart source as terminal text. Falls back to the trimmed
+ * source when the input is not a recognizable flowchart.
+ */
+export function renderMermaidAscii(source) {
+    const parsed = parseMermaidFlowchart(source);
+    if (parsed.nodes.length === 0) {
+        return (source ?? '').trim();
+    }
+    return renderFlowTree(buildFlowTree(parsed)).join('\n');
+}
+//# sourceMappingURL=ascii.js.map