@graphrefly/graphrefly 0.27.0 → 0.29.0

package/dist/{memory-li6FL5RM.d.ts → index-BuVidq3D.d.cts}

@@ -1,5 +1,5 @@
-import { N as Node } from './node-BmerH3kS.js';
-import { a as Graph } from './graph-CCwGKLCm.js';
+import { a as Node } from './node-Dd6wHSib.cjs';
+import { G as Graph } from './graph-DgohqXK-.cjs';
 
 /**
  * Memory patterns (roadmap §4.3).
@@ -111,29 +111,29 @@ declare function collection<T>(name: string, opts?: CollectionOptions<T>): Colle
 declare function vectorIndex<TMeta>(opts?: VectorIndexOptions<TMeta>): VectorIndexBundle<TMeta>;
 declare function knowledgeGraph<TEntity, TRelation extends string = string>(name: string): KnowledgeGraphGraph<TEntity, TRelation>;
 
-type memory_CollectionEntry<T> = CollectionEntry<T>;
-type memory_CollectionGraph<T> = CollectionGraph<T>;
-type memory_CollectionOptions<T> = CollectionOptions<T>;
-type memory_CollectionPolicy = CollectionPolicy;
-type memory_HnswAdapter<TMeta> = HnswAdapter<TMeta>;
-type memory_KnowledgeEdge<TRelation extends string = string> = KnowledgeEdge<TRelation>;
-type memory_KnowledgeGraphGraph<TEntity, TRelation extends string = string> = KnowledgeGraphGraph<TEntity, TRelation>;
-type memory_LightCollectionBundle<T> = LightCollectionBundle<T>;
-type memory_LightCollectionEntry<T> = LightCollectionEntry<T>;
-type memory_LightCollectionOptions = LightCollectionOptions;
-type memory_RankedCollectionEntry<T> = RankedCollectionEntry<T>;
-type memory_VectorBackend = VectorBackend;
-type memory_VectorIndexBundle<TMeta> = VectorIndexBundle<TMeta>;
-type memory_VectorIndexOptions<TMeta> = VectorIndexOptions<TMeta>;
-type memory_VectorRecord<TMeta> = VectorRecord<TMeta>;
-type memory_VectorSearchResult<TMeta> = VectorSearchResult<TMeta>;
-declare const memory_collection: typeof collection;
-declare const memory_decay: typeof decay;
-declare const memory_knowledgeGraph: typeof knowledgeGraph;
-declare const memory_lightCollection: typeof lightCollection;
-declare const memory_vectorIndex: typeof vectorIndex;
-declare namespace memory {
-  export { type memory_CollectionEntry as CollectionEntry, type memory_CollectionGraph as CollectionGraph, type memory_CollectionOptions as CollectionOptions, type memory_CollectionPolicy as CollectionPolicy, type memory_HnswAdapter as HnswAdapter, type memory_KnowledgeEdge as KnowledgeEdge, type memory_KnowledgeGraphGraph as KnowledgeGraphGraph, type memory_LightCollectionBundle as LightCollectionBundle, type memory_LightCollectionEntry as LightCollectionEntry, type memory_LightCollectionOptions as LightCollectionOptions, type memory_RankedCollectionEntry as RankedCollectionEntry, type memory_VectorBackend as VectorBackend, type memory_VectorIndexBundle as VectorIndexBundle, type memory_VectorIndexOptions as VectorIndexOptions, type memory_VectorRecord as VectorRecord, type memory_VectorSearchResult as VectorSearchResult, memory_collection as collection, memory_decay as decay, memory_knowledgeGraph as knowledgeGraph, memory_lightCollection as lightCollection, memory_vectorIndex as vectorIndex };
+type index_CollectionEntry<T> = CollectionEntry<T>;
+type index_CollectionGraph<T> = CollectionGraph<T>;
+type index_CollectionOptions<T> = CollectionOptions<T>;
+type index_CollectionPolicy = CollectionPolicy;
+type index_HnswAdapter<TMeta> = HnswAdapter<TMeta>;
+type index_KnowledgeEdge<TRelation extends string = string> = KnowledgeEdge<TRelation>;
+type index_KnowledgeGraphGraph<TEntity, TRelation extends string = string> = KnowledgeGraphGraph<TEntity, TRelation>;
+type index_LightCollectionBundle<T> = LightCollectionBundle<T>;
+type index_LightCollectionEntry<T> = LightCollectionEntry<T>;
+type index_LightCollectionOptions = LightCollectionOptions;
+type index_RankedCollectionEntry<T> = RankedCollectionEntry<T>;
+type index_VectorBackend = VectorBackend;
+type index_VectorIndexBundle<TMeta> = VectorIndexBundle<TMeta>;
+type index_VectorIndexOptions<TMeta> = VectorIndexOptions<TMeta>;
+type index_VectorRecord<TMeta> = VectorRecord<TMeta>;
+type index_VectorSearchResult<TMeta> = VectorSearchResult<TMeta>;
+declare const index_collection: typeof collection;
+declare const index_decay: typeof decay;
+declare const index_knowledgeGraph: typeof knowledgeGraph;
+declare const index_lightCollection: typeof lightCollection;
+declare const index_vectorIndex: typeof vectorIndex;
+declare namespace index {
+  export { type index_CollectionEntry as CollectionEntry, type index_CollectionGraph as CollectionGraph, type index_CollectionOptions as CollectionOptions, type index_CollectionPolicy as CollectionPolicy, type index_HnswAdapter as HnswAdapter, type index_KnowledgeEdge as KnowledgeEdge, type index_KnowledgeGraphGraph as KnowledgeGraphGraph, type index_LightCollectionBundle as LightCollectionBundle, type index_LightCollectionEntry as LightCollectionEntry, type index_LightCollectionOptions as LightCollectionOptions, type index_RankedCollectionEntry as RankedCollectionEntry, type index_VectorBackend as VectorBackend, type index_VectorIndexBundle as VectorIndexBundle, type index_VectorIndexOptions as VectorIndexOptions, type index_VectorRecord as VectorRecord, type index_VectorSearchResult as VectorSearchResult, index_collection as collection, index_decay as decay, index_knowledgeGraph as knowledgeGraph, index_lightCollection as lightCollection, index_vectorIndex as vectorIndex };
 }
 
-export { type CollectionEntry as C, type HnswAdapter as H, type KnowledgeGraphGraph as K, type LightCollectionBundle as L, type RankedCollectionEntry as R, type VectorIndexBundle as V, type VectorSearchResult as a, type CollectionGraph as b, type CollectionOptions as c, type CollectionPolicy as d, type KnowledgeEdge as e, type LightCollectionEntry as f, type LightCollectionOptions as g, type VectorBackend as h, type VectorIndexOptions as i, type VectorRecord as j, collection as k, decay as l, memory as m, knowledgeGraph as n, lightCollection as o, vectorIndex as v };
+export { type CollectionEntry as C, type HnswAdapter as H, type KnowledgeGraphGraph as K, type LightCollectionBundle as L, type RankedCollectionEntry as R, type VectorSearchResult as V, type VectorIndexBundle as a, type CollectionGraph as b, type CollectionOptions as c, type CollectionPolicy as d, type KnowledgeEdge as e, type LightCollectionEntry as f, type LightCollectionOptions as g, type VectorBackend as h, index as i, type VectorIndexOptions as j, type VectorRecord as k, collection as l, decay as m, knowledgeGraph as n, lightCollection as o, vectorIndex as v };

package/dist/index-Byh-xTyp.d.ts

@@ -0,0 +1,105 @@
+import { a as Node } from './node-Dd6wHSib.js';
+import { S as StatusValue, C as CircuitState, R as RateLimiterOptions, a as CircuitBreakerOptions, b as RetryOptions, F as FallbackInput, N as NS_PER_MS, c as NS_PER_SEC } from './resilience-CBfYJW5C.js';
+import { B as BudgetConstraint } from './index-A65LZhoM.js';
+
+/**
+ * Resilience composition with correct nesting order (roadmap §9.0b).
+ *
+ * {@link resilientPipeline} composes the resilience primitives from
+ * `extra/resilience.ts` in the order discovered during the §9.1 eval runs:
+ *
+ * ```text
+ *   rateLimit → budget → breaker → timeout → retry → fallback → status
+ * ```
+ *
+ * Note on retry/timeout ordering: `timeout` is applied BEFORE `retry` so each
+ * retry attempt resubscribes to a fresh deadline (per-attempt semantics). If
+ * `timeout` wrapped `retry`, a single deadline would apply to the entire
+ * retry chain — not what callers expect.
+ *
+ * Every step is optional — omit the option and that layer is skipped. The
+ * returned bundle exposes the final `Node<T>` plus the status/error/breaker
+ * companions so callers can wire them into dashboards, alerts, or
+ * {@link graphLens}.
+ *
+ * Subsumes the pre-1.0 `resilientFetch` template — that template becomes a
+ * preconfigured instance of this factory for the HTTP fetch case.
+ *
+ * @module
+ */
+
+/** Options for {@link resilientPipeline}. Every field is optional — omit to skip that layer. */
+interface ResilientPipelineOptions<T> {
+    /** Admission control — at most `maxEvents` DATA per `windowNs`. See {@link rateLimiter}. */
+    rateLimit?: RateLimiterOptions;
+    /** Cost/constraint gate. See {@link budgetGate}. */
+    budget?: ReadonlyArray<BudgetConstraint>;
+    /** Circuit breaker — fail-fast when the downstream resource is unhealthy. See {@link circuitBreaker}. */
+    breaker?: CircuitBreakerOptions;
+    /**
+     * Behavior when the breaker is open:
+     * - `"skip"` — emit RESOLVED (default, lets downstream drop the beat)
+     * - `"error"` — emit a `CircuitOpenError` so `retry`/`fallback` can react
+     *
+     * Only used when `breaker` is provided.
+     */
+    breakerOnOpen?: "skip" | "error";
+    /** Retry policy on terminal ERROR. See {@link retry}. */
+    retry?: RetryOptions;
+    /**
+     * Per-attempt deadline in milliseconds. Converted to ns internally. Omit to skip the timeout wrap.
+     *
+     * Specified in ms (not ns) because callers consistently think in millisecond deadlines;
+     * retry/breaker/ratelimit options take ns to match their primitives exactly.
+     */
+    timeoutMs?: number;
+    /** Final fallback value emitted on terminal ERROR after retry exhausts. See {@link fallback}. */
+    fallback?: FallbackInput<T>;
+    /** Initial status reported by the status node. Default `"pending"`. */
+    initialStatus?: StatusValue;
+}
+/** Output bundle of {@link resilientPipeline}. */
+interface ResilientPipelineBundle<T> {
+    /** The final resilient node. Subscribe to this for DATA emissions. */
+    node: Node<T>;
+    /** Live status: `"pending" | "active" | "completed" | "errored"`. */
+    status: Node<StatusValue>;
+    /** Last error payload, or `null` when not errored. */
+    error: Node<unknown | null>;
+    /** Breaker state when `opts.breaker` was provided; `undefined` otherwise. */
+    breakerState: Node<CircuitState> | undefined;
+}
+/**
+ * Compose a resilient pipeline around `source` in the canonical nesting
+ * order — `rateLimit → budget → breaker → timeout → retry → fallback → status`.
+ * Omit any option to skip that layer.
+ *
+ * @param source - Upstream node to wrap.
+ * @param opts - See {@link ResilientPipelineOptions}. All fields optional.
+ *
+ * @example
+ * ```ts
+ * const safeFetch = resilientPipeline(fetchNode, {
+ *   rateLimit: { maxEvents: 10, windowNs: NS_PER_SEC },
+ *   breaker: { failureThreshold: 5 },
+ *   retry: { count: 3, backoff: "exponential" },
+ *   timeoutMs: 10_000,
+ *   fallback: null,
+ * });
+ * safeFetch.status.subscribe(msgs => console.log(msgs));
+ * ```
+ *
+ * @category patterns
+ */
+declare function resilientPipeline<T>(source: Node<T>, opts?: ResilientPipelineOptions<T>): ResilientPipelineBundle<T>;
+
+declare const index_NS_PER_MS: typeof NS_PER_MS;
+declare const index_NS_PER_SEC: typeof NS_PER_SEC;
+type index_ResilientPipelineBundle<T> = ResilientPipelineBundle<T>;
+type index_ResilientPipelineOptions<T> = ResilientPipelineOptions<T>;
+declare const index_resilientPipeline: typeof resilientPipeline;
+declare namespace index {
+  export { index_NS_PER_MS as NS_PER_MS, index_NS_PER_SEC as NS_PER_SEC, type index_ResilientPipelineBundle as ResilientPipelineBundle, type index_ResilientPipelineOptions as ResilientPipelineOptions, index_resilientPipeline as resilientPipeline };
+}
+
+export { type ResilientPipelineBundle as R, type ResilientPipelineOptions as a, index as i, resilientPipeline as r };

package/dist/index-C08QPDcV.d.cts

@@ -0,0 +1,321 @@
+import { a as Node } from './node-Dd6wHSib.cjs';
+import { G as Graph } from './graph-DgohqXK-.cjs';
+import { L as LLMAdapter } from './types-O3GzJY2U.cjs';
+
+/**
+ * LLM graph composition (roadmap §8.3).
+ *
+ * Declarative GraphSpec schema + compiler/decompiler for graph topology.
+ * The LLM designs graphs as JSON; compileSpec instantiates them; decompileGraph
+ * extracts them back. Templates support reusable subgraph patterns. Feedback
+ * edges express bounded cycles via §8.1 feedback().
+ *
+ * @module
+ */
+
+/** A single node declaration in a GraphSpec. */
+type GraphSpecNode = {
+    /** Node kind: state, producer, derived, effect, operator. */
+    type: "state" | "producer" | "derived" | "effect" | "operator";
+    /** Dependency node names (for derived/effect/operator). */
+    deps?: string[];
+    /** Named function from the catalog (for derived/effect/operator/producer). */
+    fn?: string;
+    /** Named source from the catalog (for producer). */
+    source?: string;
+    /** Freeform config passed to the catalog fn/source factory. */
+    config?: Record<string, unknown>;
+    /** Initial value (for state nodes). */
+    initial?: unknown;
+    /** Human/LLM-readable metadata. */
+    meta?: Record<string, unknown>;
+};
+/** Template instantiation node — expanded at compile time. */
+type GraphSpecTemplateRef = {
+    type: "template";
+    /** Name of the template to instantiate. */
+    template: string;
+    /** Parameter bindings: template param name → node name. */
+    bind: Record<string, string>;
+};
+/** A reusable subgraph pattern with parameter substitution. */
+type GraphSpecTemplate = {
+    /** Parameter names (prefixed with $ in node refs). */
+    params: string[];
+    /** Node declarations within the template. */
+    nodes: Record<string, GraphSpecNode>;
+    /** Which node's output is the template's output. */
+    output: string;
+};
+/** A feedback edge: bounded cycle from condition to reentry. */
+type GraphSpecFeedbackEdge = {
+    /** Node whose DATA triggers the feedback. */
+    from: string;
+    /** State node that receives the feedback value. */
+    to: string;
+    /** Max iterations before stopping (default: 10). */
+    maxIterations?: number;
+};
+/** Declarative graph topology for LLM composition (§8.3). */
+type GraphSpec = {
+    /** Graph name. */
+    name: string;
+    /** Node declarations (keyed by node name). */
+    nodes: Record<string, GraphSpecNode | GraphSpecTemplateRef>;
+    /** Reusable subgraph templates. */
+    templates?: Record<string, GraphSpecTemplate>;
+    /** Feedback edges (bounded cycles). */
+    feedback?: GraphSpecFeedbackEdge[];
+};
+/**
+ * Factory for creating a derived/effect/operator node from catalog.
+ * Receives resolved dep nodes and the config from the spec.
+ */
+type FnFactory = (deps: Node<unknown>[], config: Record<string, unknown>) => Node<unknown>;
+/**
+ * Factory for creating a producer node from catalog.
+ * Receives the config from the spec.
+ */
+type SourceFactory = (config: Record<string, unknown>) => Node<unknown>;
+/** Simple config field descriptor for LLM prompt generation and validation. */
+type ConfigFieldSchema = {
+    /** Human-readable type: "string", "number", "boolean", "string[]", etc. */
+    type: string;
+    /** Whether this field is required (default: true). */
+    required?: boolean;
+    /** Allowed values (enum constraint). */
+    enum?: readonly (string | number | boolean)[];
+    /** Human-readable description for LLM context. */
+    description?: string;
+    /** Default value if omitted. */
+    default?: unknown;
+};
+/**
+ * Rich catalog entry: bundles a runtime factory with LLM-facing metadata.
+ *
+ * The metadata is used to:
+ * 1. Auto-generate prompt text for {@link llmCompose} (replaces manual `catalogDescription`)
+ * 2. Validate LLM output in {@link validateSpec} (catch wrong fn names, invalid config)
+ * 3. Provide actionable error messages for {@link llmRefine} feedback loops
+ *
+ * Developers register ONE object; the library handles prompt generation and validation.
+ */
+type CatalogFnEntry = {
+    /** Runtime factory. */
+    factory: FnFactory;
+    /** One-line description for LLM prompt (what it does, not how). */
+    description: string;
+    /** Config field schemas. Keys are config field names. */
+    configSchema?: Record<string, ConfigFieldSchema>;
+    /** Example config objects (shown in prompt for complex fns). */
+    examples?: Record<string, unknown>[];
+    /** Category tags for grouping in prompt (e.g., "resilience", "reduction", "ai"). */
+    tags?: string[];
+};
+/** Rich catalog entry for producer sources. */
+type CatalogSourceEntry = {
+    /** Runtime factory. */
+    factory: SourceFactory;
+    /** One-line description for LLM prompt. */
+    description: string;
+    /** Config field schemas. */
+    configSchema?: Record<string, ConfigFieldSchema>;
+    /** Example config objects. */
+    examples?: Record<string, unknown>[];
+    /** Category tags. */
+    tags?: string[];
+};
+/**
+ * Fn/source lookup table passed to compileSpec and llmCompose.
+ *
+ * Accepts both bare factories (backward-compatible) and rich {@link CatalogFnEntry}
+ * / {@link CatalogSourceEntry} objects. When rich entries are provided, the library
+ * auto-generates LLM prompts and validates LLM output against the catalog.
+ */
+type GraphSpecCatalog = {
+    fns?: Record<string, FnFactory | CatalogFnEntry>;
+    sources?: Record<string, SourceFactory | CatalogSourceEntry>;
+};
+/** Type guard: is this a rich catalog fn entry (vs bare factory)? */
+declare function isRichFnEntry(entry: FnFactory | CatalogFnEntry): entry is CatalogFnEntry;
+/** Type guard: is this a rich catalog source entry (vs bare factory)? */
+declare function isRichSourceEntry(entry: SourceFactory | CatalogSourceEntry): entry is CatalogSourceEntry;
+/** Extract the runtime factory from a catalog entry (rich or bare). */
+declare function extractFnFactory(entry: FnFactory | CatalogFnEntry): FnFactory;
+/** Extract the runtime factory from a catalog source entry (rich or bare). */
+declare function extractSourceFactory(entry: SourceFactory | CatalogSourceEntry): SourceFactory;
+/**
+ * Auto-generate catalog prompt text from rich catalog entries.
+ *
+ * Groups fns by tag, formats each as `- name: description. Config: { ... }`.
+ * Falls back to listing names only for bare factories.
+ */
+declare function generateCatalogPrompt(catalog: GraphSpecCatalog): string;
+/**
+ * Validate a GraphSpec against a catalog.
+ *
+ * Checks that fn/source names reference actual catalog entries, and validates
+ * config fields against configSchema when rich entries are available.
+ * Returns additional errors beyond structural {@link validateSpec} checks.
+ */
+declare function validateSpecAgainstCatalog(spec: GraphSpec, catalog: GraphSpecCatalog): GraphSpecValidation;
+/** Validation result from {@link validateSpec}. */
+type GraphSpecValidation = {
+    valid: boolean;
+    errors: string[];
+};
+/**
+ * Validate a GraphSpec JSON object.
+ *
+ * Checks structural validity: required fields, node types, dep references,
+ * template references, feedback edge targets, self-cycles, and bind completeness.
+ */
+declare function validateSpec(spec: unknown): GraphSpecValidation;
+/** Options for {@link compileSpec}. */
+type CompileSpecOptions = {
+    /** Fn/source catalog for resolving named factories. */
+    catalog?: GraphSpecCatalog;
+};
+/**
+ * Instantiate a Graph from a GraphSpec.
+ *
+ * Handles template expansion (mounted subgraphs), feedback wiring via §8.1
+ * feedback(), node factory lookup from the catalog, and topology validation.
+ *
+ * @param spec - Declarative graph topology.
+ * @param opts - Catalog and compile options.
+ * @returns A running Graph.
+ * @throws On validation failure, missing catalog entries, or unresolvable deps.
+ *
+ * @category patterns
+ */
+declare function compileSpec(spec: GraphSpec, opts?: CompileSpecOptions): Graph;
+/**
+ * Extract a GraphSpec from a running graph.
+ *
+ * Uses `describe({ detail: "standard" })` as a starting point, then enriches:
+ * - Feedback edges recovered from counter node meta (`feedbackFrom`/`feedbackTo`)
+ * - Template refs recovered from output node meta (`_templateName`/`_templateBind`)
+ * - Structural fingerprinting as fallback for 2+ identical mounted subgraphs
+ *
+ * @param graph - Running graph to decompile.
+ * @returns A GraphSpec representation.
+ *
+ * @category patterns
+ */
+declare function decompileGraph(graph: Graph): GraphSpec;
+/** A single change in a spec diff. */
+type SpecDiffEntry = {
+    type: "added" | "removed" | "changed";
+    path: string;
+    detail?: string;
+};
+/** Structural diff between two GraphSpecs. */
+type SpecDiffResult = {
+    entries: SpecDiffEntry[];
+    summary: string;
+};
+/**
+ * Compute a structural diff between two GraphSpecs.
+ *
+ * Template-aware: reports "changed template definition" vs "changed
+ * instantiation bindings." No runtime needed — pure JSON comparison.
+ *
+ * @param specA - The "before" spec.
+ * @param specB - The "after" spec.
+ * @returns Diff entries and a human-readable summary.
+ *
+ * @category patterns
+ */
+declare function specDiff(specA: GraphSpec, specB: GraphSpec): SpecDiffResult;
+/** Options for {@link llmCompose}. */
+type LLMComposeOptions = {
+    model?: string;
+    temperature?: number;
+    maxTokens?: number;
+    /** Extra instructions appended to the system prompt. */
+    systemPromptExtra?: string;
+    /**
+     * Available fn/source catalog names for the LLM to reference.
+     * When omitted and `catalog` contains rich {@link CatalogFnEntry} entries,
+     * the prompt is auto-generated via {@link generateCatalogPrompt}.
+     */
+    catalogDescription?: string;
+    /**
+     * Catalog for auto-prompt generation and catalog-aware validation.
+     * When rich entries are provided, the catalog prompt is auto-generated
+     * and LLM output is validated against fn/source names and config schemas.
+     */
+    catalog?: GraphSpecCatalog;
+    /**
+     * Max auto-refine attempts when the LLM output fails catalog validation.
+     * Each attempt feeds the validation errors back to the LLM via llmRefine.
+     * Default: 0 (no auto-refine). Set to 2-3 for production use.
+     */
+    maxAutoRefine?: number;
+};
+/**
+ * Ask an LLM to compose a GraphSpec from a natural-language problem description.
+ *
+ * The LLM generates a GraphSpec (with templates + feedback), validated before
+ * returning. The spec is for human review before compilation via compileSpec().
+ *
+ * @param problem - Natural language problem description.
+ * @param adapter - LLM adapter for the generation call.
+ * @param opts - Model options and catalog description.
+ * @returns A validated GraphSpec.
+ * @throws On invalid LLM output or validation failure.
+ *
+ * @category patterns
+ */
+declare function llmCompose(problem: string, adapter: LLMAdapter, opts?: LLMComposeOptions): Promise<GraphSpec>;
+/** Options for {@link llmRefine}. */
+type LLMRefineOptions = LLMComposeOptions;
+/**
+ * Ask an LLM to modify an existing GraphSpec based on feedback or changed requirements.
+ *
+ * @param currentSpec - The current GraphSpec to modify.
+ * @param feedback - Natural language feedback or changed requirements.
+ * @param adapter - LLM adapter for the generation call.
+ * @param opts - Model options.
+ * @returns A new GraphSpec incorporating the feedback.
+ * @throws On invalid LLM output or validation failure.
+ *
+ * @category patterns
+ */
+declare function llmRefine(currentSpec: GraphSpec, feedback: string, adapter: LLMAdapter, opts?: LLMRefineOptions): Promise<GraphSpec>;
+
+type index_CatalogFnEntry = CatalogFnEntry;
+type index_CatalogSourceEntry = CatalogSourceEntry;
+type index_CompileSpecOptions = CompileSpecOptions;
+type index_ConfigFieldSchema = ConfigFieldSchema;
+type index_FnFactory = FnFactory;
+type index_GraphSpec = GraphSpec;
+type index_GraphSpecCatalog = GraphSpecCatalog;
+type index_GraphSpecFeedbackEdge = GraphSpecFeedbackEdge;
+type index_GraphSpecNode = GraphSpecNode;
+type index_GraphSpecTemplate = GraphSpecTemplate;
+type index_GraphSpecTemplateRef = GraphSpecTemplateRef;
+type index_GraphSpecValidation = GraphSpecValidation;
+type index_LLMComposeOptions = LLMComposeOptions;
+type index_LLMRefineOptions = LLMRefineOptions;
+type index_SourceFactory = SourceFactory;
+type index_SpecDiffEntry = SpecDiffEntry;
+type index_SpecDiffResult = SpecDiffResult;
+declare const index_compileSpec: typeof compileSpec;
+declare const index_decompileGraph: typeof decompileGraph;
+declare const index_extractFnFactory: typeof extractFnFactory;
+declare const index_extractSourceFactory: typeof extractSourceFactory;
+declare const index_generateCatalogPrompt: typeof generateCatalogPrompt;
+declare const index_isRichFnEntry: typeof isRichFnEntry;
+declare const index_isRichSourceEntry: typeof isRichSourceEntry;
+declare const index_llmCompose: typeof llmCompose;
+declare const index_llmRefine: typeof llmRefine;
+declare const index_specDiff: typeof specDiff;
+declare const index_validateSpec: typeof validateSpec;
+declare const index_validateSpecAgainstCatalog: typeof validateSpecAgainstCatalog;
+declare namespace index {
+  export { type index_CatalogFnEntry as CatalogFnEntry, type index_CatalogSourceEntry as CatalogSourceEntry, type index_CompileSpecOptions as CompileSpecOptions, type index_ConfigFieldSchema as ConfigFieldSchema, type index_FnFactory as FnFactory, type index_GraphSpec as GraphSpec, type index_GraphSpecCatalog as GraphSpecCatalog, type index_GraphSpecFeedbackEdge as GraphSpecFeedbackEdge, type index_GraphSpecNode as GraphSpecNode, type index_GraphSpecTemplate as GraphSpecTemplate, type index_GraphSpecTemplateRef as GraphSpecTemplateRef, type index_GraphSpecValidation as GraphSpecValidation, type index_LLMComposeOptions as LLMComposeOptions, type index_LLMRefineOptions as LLMRefineOptions, type index_SourceFactory as SourceFactory, type index_SpecDiffEntry as SpecDiffEntry, type index_SpecDiffResult as SpecDiffResult, index_compileSpec as compileSpec, index_decompileGraph as decompileGraph, index_extractFnFactory as extractFnFactory, index_extractSourceFactory as extractSourceFactory, index_generateCatalogPrompt as generateCatalogPrompt, index_isRichFnEntry as isRichFnEntry, index_isRichSourceEntry as isRichSourceEntry, index_llmCompose as llmCompose, index_llmRefine as llmRefine, index_specDiff as specDiff, index_validateSpec as validateSpec, index_validateSpecAgainstCatalog as validateSpecAgainstCatalog };
+}
+
+export { type CatalogFnEntry as C, type FnFactory as F, type GraphSpec as G, type LLMComposeOptions as L, type SourceFactory as S, type CatalogSourceEntry as a, type ConfigFieldSchema as b, type GraphSpecCatalog as c, type GraphSpecFeedbackEdge as d, type GraphSpecNode as e, type GraphSpecTemplate as f, type GraphSpecTemplateRef as g, type GraphSpecValidation as h, index as i, type CompileSpecOptions as j, type LLMRefineOptions as k, type SpecDiffEntry as l, type SpecDiffResult as m, compileSpec as n, decompileGraph as o, extractFnFactory as p, extractSourceFactory as q, generateCatalogPrompt as r, isRichFnEntry as s, isRichSourceEntry as t, llmCompose as u, llmRefine as v, specDiff as w, validateSpec as x, validateSpecAgainstCatalog as y };

package/dist/{demo-shell-BDkOptd6.d.ts → index-C66RJiX8.d.ts}

@@ -1,5 +1,5 @@
-import { a as Graph } from './graph-CCwGKLCm.js';
-import { M as MeasurementAdapter } from './reactive-layout-u5Ulnqag.js';
+import { G as Graph } from './graph-Qjg9gWHI.js';
+import { M as MeasurementAdapter } from './reactive-layout-BkBwVvwm.js';
 
 /**
  * Three-pane demo shell (roadmap §7.2).
@@ -86,17 +86,17 @@ type DemoShellHandle = {
  */
 declare function demoShell(opts?: DemoShellOptions): DemoShellHandle;
 
-type demoShell$1_DemoShellHandle = DemoShellHandle;
-type demoShell$1_DemoShellOptions = DemoShellOptions;
-type demoShell$1_FullscreenPane = FullscreenPane;
-type demoShell$1_GraphLabelSize = GraphLabelSize;
-type demoShell$1_HighlightCallbacks = HighlightCallbacks;
-type demoShell$1_HoverPaneType = HoverPaneType;
-type demoShell$1_HoverTarget = HoverTarget;
-type demoShell$1_NodeRegistry = NodeRegistry;
-declare const demoShell$1_demoShell: typeof demoShell;
-declare namespace demoShell$1 {
-  export { type demoShell$1_DemoShellHandle as DemoShellHandle, type demoShell$1_DemoShellOptions as DemoShellOptions, type demoShell$1_FullscreenPane as FullscreenPane, type demoShell$1_GraphLabelSize as GraphLabelSize, type demoShell$1_HighlightCallbacks as HighlightCallbacks, type demoShell$1_HoverPaneType as HoverPaneType, type demoShell$1_HoverTarget as HoverTarget, type demoShell$1_NodeRegistry as NodeRegistry, demoShell$1_demoShell as demoShell };
+type index_DemoShellHandle = DemoShellHandle;
+type index_DemoShellOptions = DemoShellOptions;
+type index_FullscreenPane = FullscreenPane;
+type index_GraphLabelSize = GraphLabelSize;
+type index_HighlightCallbacks = HighlightCallbacks;
+type index_HoverPaneType = HoverPaneType;
+type index_HoverTarget = HoverTarget;
+type index_NodeRegistry = NodeRegistry;
+declare const index_demoShell: typeof demoShell;
+declare namespace index {
+  export { type index_DemoShellHandle as DemoShellHandle, type index_DemoShellOptions as DemoShellOptions, type index_FullscreenPane as FullscreenPane, type index_GraphLabelSize as GraphLabelSize, type index_HighlightCallbacks as HighlightCallbacks, type index_HoverPaneType as HoverPaneType, type index_HoverTarget as HoverTarget, type index_NodeRegistry as NodeRegistry, index_demoShell as demoShell };
 }
 
-export { type DemoShellHandle as D, type FullscreenPane as F, type GraphLabelSize as G, type HighlightCallbacks as H, type NodeRegistry as N, type DemoShellOptions as a, type HoverPaneType as b, type HoverTarget as c, demoShell$1 as d, demoShell as e };
+export { type DemoShellHandle as D, type FullscreenPane as F, type GraphLabelSize as G, type HighlightCallbacks as H, type NodeRegistry as N, type DemoShellOptions as a, type HoverPaneType as b, type HoverTarget as c, demoShell as d, index as i };