@iworkforces/tracelattice 2.0.6 → 2.0.8

package/dist/core/graph/GraphView.js.map

@@ -1 +1 @@
-{"version":3,"file":"core/graph/GraphView.js","sources":["../../../src/core/graph/GraphView.ts"],"sourcesContent":["/**\n * GraphView — read-only graph traversal queries over an {@link IEdgeStore}.\n *\n * Provides BFS / topological / ancestor / descendant queries over the\n * thought DAG. All methods return arrays of thought ids (ulid strings),\n * never `ThoughtData` objects — the view is intentionally decoupled from\n * `HistoryManager` so it can be reused by strategies that work purely in\n * terms of graph structure.\n *\n * Construction is cheap (stores a reference to the underlying store).\n * Each query reads the latest store state — no caching, no snapshots.\n *\n * @module core/graph/GraphView\n */\n\nimport type { IEdgeStore } from '../../contracts/interfaces.js';\nimport type { SessionId, ThoughtId } from '../../contracts/ids.js';\nimport { CycleDetectedError } from '../../errors.js';\nimport type { Edge } from './Edge.js';\n\n/**\n * Read-only traversal queries over an {@link IEdgeStore}.\n *\n * @example\n * ```typescript\n * const store = new EdgeStore();\n * // ... populate store ...\n * const view = new GraphView(store);\n * const order = view.topological('s1');\n * ```\n */\nexport class GraphView {\n\tprivate readonly _store: IEdgeStore;\n\n\t/**\n\t * Create a new GraphView backed by the given edge store.\n\t *\n\t * @param store - The edge store to query (held by reference, read-only access)\n\t *\n\t * @example\n\t * ```typescript\n\t * const view = new GraphView(edgeStore);\n\t * ```\n\t */\n\tconstructor(store: IEdgeStore) {\n\t\tthis._store = store;\n\t}\n\n\t/**\n\t * Return all thought ids in the session, ordered by BFS from roots.\n\t *\n\t * Roots are nodes with no incoming edges. Within a layer, neighbours\n\t * are visited in `outgoing` order (which the underlying store keeps\n\t * sorted by `createdAt` ascending).\n\t *\n\t * @param sessionId - Session to query\n\t * @returns Thought ids in chronological BFS order\n\t *\n\t * @example\n\t * ```typescript\n\t * const ids = view.chronological('s1');\n\t * ```\n\t */\n\tchronological(sessionId: SessionId): readonly ThoughtId[] {\n\t\tconst edges = this._store.edgesForSession(sessionId);\n\t\tif (edges.length === 0) {\n\t\t\treturn [];\n\t\t}\n\t\tconst { nodes, hasIncoming } = this._collectNodes(edges);\n\t\tconst roots = this._findRoots(nodes, hasIncoming, edges);\n\t\treturn this._bfsFromRoots(sessionId, roots) as readonly ThoughtId[];\n\t}\n\n\t/**\n\t * Return all thought ids reachable from `rootThoughtId` via `'branch'`\n\t * edges, including the root itself.\n\t *\n\t * Non-branch edges are ignored. Cycles (if any) do not cause infinite\n\t * loops because each node is visited at most once.\n\t *\n\t * @param sessionId - Session to query\n\t * @param rootThoughtId - The starting thought id (typically the branch root)\n\t * @returns Thought ids forming the branch (includes root)\n\t *\n\t * @example\n\t * ```typescript\n\t * const branchIds = view.branchThoughts('s1', 'thought-root');\n\t * ```\n\t */\n\tbranchThoughts(sessionId: SessionId, rootThoughtId: ThoughtId): readonly ThoughtId[] {\n\t\tconst visited = new Set<string>([rootThoughtId]);\n\t\tconst order: string[] = [rootThoughtId];\n\t\tconst queue: string[] = [rootThoughtId];\n\t\twhile (queue.length > 0) {\n\t\t\tconst current = queue.shift()!;\n\t\t\tconst out = this._store.outgoing(sessionId, current as ThoughtId);\n\t\t\tfor (const edge of out) {\n\t\t\t\tif (edge.kind !== 'branch') continue;\n\t\t\t\tif (visited.has(edge.to)) continue;\n\t\t\t\tvisited.add(edge.to);\n\t\t\t\torder.push(edge.to);\n\t\t\t\tqueue.push(edge.to);\n\t\t\t}\n\t\t}\n\t\treturn order as ThoughtId[];\n\t}\n\n\t/**\n\t * Return a topological ordering of all thought ids in the session\n\t * using Kahn's algorithm.\n\t *\n\t * @param sessionId - Session to query\n\t * @returns Thought ids in topological order\n\t * @throws {CycleDetectedError} If the graph contains a cycle\n\t *\n\t * @example\n\t * ```typescript\n\t * const order = view.topological('s1');\n\t * ```\n\t */\n\ttopological(sessionId: SessionId): readonly ThoughtId[] {\n\t\tconst edges = this._store.edgesForSession(sessionId);\n\t\tif (edges.length === 0) {\n\t\t\treturn [];\n\t\t}\n\t\tconst inDegree = this._buildInDegree(edges);\n\t\tconst queue: string[] = [];\n\t\tfor (const [node, deg] of inDegree) {\n\t\t\tif (deg === 0) queue.push(node);\n\t\t}\n\t\tconst order: string[] = [];\n\t\twhile (queue.length > 0) {\n\t\t\tconst node = queue.shift()!;\n\t\t\torder.push(node);\n\t\t\tfor (const edge of this._store.outgoing(sessionId, node as ThoughtId)) {\n\t\t\t\tconst next = (inDegree.get(edge.to) ?? 0) - 1;\n\t\t\t\tinDegree.set(edge.to, next);\n\t\t\t\tif (next === 0) queue.push(edge.to);\n\t\t\t}\n\t\t}\n\t\tif (order.length !== inDegree.size) {\n\t\t\tthrow new CycleDetectedError(\n\t\t\t\t`Cycle detected in session '${sessionId}': topological sort incomplete (${order.length}/${inDegree.size})`\n\t\t\t);\n\t\t}\n\t\treturn order as ThoughtId[];\n\t}\n\n\t/**\n\t * Return all ancestors of `thoughtId` via incoming-edge BFS.\n\t *\n\t * The starting node is NOT included. Cycles do not cause infinite loops.\n\t *\n\t * @param sessionId - Session to query\n\t * @param thoughtId - The thought to traverse from\n\t * @param maxDepth - Optional maximum traversal depth (1 = direct parents only)\n\t * @returns Ancestor thought ids in BFS order\n\t *\n\t * @example\n\t * ```typescript\n\t * const parents = view.ancestors('s1', 'thought-id', 1);\n\t * ```\n\t */\n\tancestors(sessionId: SessionId, thoughtId: ThoughtId, maxDepth?: number): readonly ThoughtId[] {\n\t\treturn this._bfsClosure(sessionId, thoughtId, maxDepth, 'incoming') as readonly ThoughtId[];\n\t}\n\n\t/**\n\t * Return all descendants of `thoughtId` via outgoing-edge BFS.\n\t *\n\t * The starting node is NOT included. Cycles do not cause infinite loops.\n\t *\n\t * @param sessionId - Session to query\n\t * @param thoughtId - The thought to traverse from\n\t * @param maxDepth - Optional maximum traversal depth (1 = direct children only)\n\t * @returns Descendant thought ids in BFS order\n\t *\n\t * @example\n\t * ```typescript\n\t * const children = view.descendants('s1', 'thought-id');\n\t * ```\n\t */\n\tdescendants(sessionId: SessionId, thoughtId: ThoughtId, maxDepth?: number): readonly ThoughtId[] {\n\t\treturn this._bfsClosure(sessionId, thoughtId, maxDepth, 'outgoing') as readonly ThoughtId[];\n\t}\n\n\t/**\n\t * Return all thought ids in the session that have no outgoing edges.\n\t *\n\t * @param sessionId - Session to query\n\t * @returns Thought ids that are graph leaves\n\t *\n\t * @example\n\t * ```typescript\n\t * const tips = view.leaves('s1');\n\t * ```\n\t */\n\tleaves(sessionId: SessionId): readonly ThoughtId[] {\n\t\tconst edges = this._store.edgesForSession(sessionId);\n\t\tif (edges.length === 0) {\n\t\t\treturn [];\n\t\t}\n\t\tconst { nodes } = this._collectNodes(edges);\n\t\tconst result: string[] = [];\n\t\tfor (const node of nodes) {\n\t\t\tif (this._store.outgoing(sessionId, node as ThoughtId).length === 0) {\n\t\t\t\tresult.push(node);\n\t\t\t}\n\t\t}\n\t\treturn result as ThoughtId[];\n\t}\n\n\t/**\n\t * Collect every node id referenced by the edges and a set of nodes\n\t * that have at least one incoming edge.\n\t */\n\tprivate _collectNodes(edges: readonly Edge[]): {\n\t\tnodes: Set<string>;\n\t\thasIncoming: Set<string>;\n\t} {\n\t\tconst nodes = new Set<string>();\n\t\tconst hasIncoming = new Set<string>();\n\t\tfor (const edge of edges) {\n\t\t\tnodes.add(edge.from);\n\t\t\tnodes.add(edge.to);\n\t\t\thasIncoming.add(edge.to);\n\t\t}\n\t\treturn { nodes, hasIncoming };\n\t}\n\n\t/**\n\t * Find roots (no incoming) ordered by the earliest outgoing edge\n\t * `createdAt`. Nodes with no outgoing edges fall back to the order\n\t * they appear among edges (already sorted by `createdAt`).\n\t */\n\tprivate _findRoots(\n\t\tnodes: Set<string>,\n\t\thasIncoming: Set<string>,\n\t\tedges: readonly Edge[]\n\t): string[] {\n\t\tconst earliest = new Map<string, number>();\n\t\tfor (const edge of edges) {\n\t\t\tif (!earliest.has(edge.from)) {\n\t\t\t\tearliest.set(edge.from, edge.createdAt);\n\t\t\t}\n\t\t}\n\t\tconst roots: string[] = [];\n\t\tfor (const node of nodes) {\n\t\t\tif (!hasIncoming.has(node)) roots.push(node);\n\t\t}\n\t\troots.sort((a, b) => (earliest.get(a) ?? Infinity) - (earliest.get(b) ?? Infinity));\n\t\treturn roots;\n\t}\n\n\t/**\n\t * BFS from a list of root ids, visiting each node at most once.\n\t */\n\tprivate _bfsFromRoots(sessionId: SessionId, roots: readonly string[]): readonly string[] {\n\t\tconst visited = new Set<string>();\n\t\tconst order: string[] = [];\n\t\tconst queue: string[] = [];\n\t\tfor (const root of roots) {\n\t\t\tif (visited.has(root)) continue;\n\t\t\tvisited.add(root);\n\t\t\torder.push(root);\n\t\t\tqueue.push(root);\n\t\t}\n\t\twhile (queue.length > 0) {\n\t\t\tconst node = queue.shift()!;\n\t\t\tfor (const edge of this._store.outgoing(sessionId, node as ThoughtId)) {\n\t\t\t\tif (visited.has(edge.to)) continue;\n\t\t\t\tvisited.add(edge.to);\n\t\t\t\torder.push(edge.to);\n\t\t\t\tqueue.push(edge.to);\n\t\t\t}\n\t\t}\n\t\treturn order;\n\t}\n\n\t/**\n\t * Build an in-degree map covering every node referenced by the edges.\n\t */\n\tprivate _buildInDegree(edges: readonly Edge[]): Map<string, number> {\n\t\tconst inDegree = new Map<string, number>();\n\t\tfor (const edge of edges) {\n\t\t\tif (!inDegree.has(edge.from)) inDegree.set(edge.from, 0);\n\t\t\tinDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);\n\t\t}\n\t\treturn inDegree;\n\t}\n\n\t/**\n\t * Generic BFS closure in either direction. Excludes the start node\n\t * from the result and respects an optional depth cap.\n\t */\n\tprivate _bfsClosure(\n\t\tsessionId: SessionId,\n\t\tstartId: string,\n\t\tmaxDepth: number | undefined,\n\t\tdirection: 'incoming' | 'outgoing'\n\t): readonly string[] {\n\t\tconst cap = maxDepth ?? Number.POSITIVE_INFINITY;\n\t\tconst visited = new Set<string>([startId]);\n\t\tconst order: string[] = [];\n\t\tlet frontier: string[] = [startId];\n\t\tlet depth = 0;\n\t\twhile (frontier.length > 0 && depth < cap) {\n\t\t\tconst next: string[] = [];\n\t\t\tfor (const node of frontier) {\n\t\t\t\tconst edges =\n\t\t\t\t\tdirection === 'outgoing'\n\t\t\t\t\t\t? this._store.outgoing(sessionId, node as ThoughtId)\n\t\t\t\t\t\t: this._store.incoming(sessionId, node as ThoughtId);\n\t\t\t\tfor (const edge of edges) {\n\t\t\t\t\tconst neighbour = direction === 'outgoing' ? edge.to : edge.from;\n\t\t\t\t\tif (visited.has(neighbour)) continue;\n\t\t\t\t\tvisited.add(neighbour);\n\t\t\t\t\torder.push(neighbour);\n\t\t\t\t\tnext.push(neighbour);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfrontier = next;\n\t\t\tdepth++;\n\t\t}\n\t\treturn order;\n\t}\n}\n"],"names":["GraphView","store","sessionId","edges","nodes","hasIncoming","roots","rootThoughtId","visited","Set","order","queue","current","out","edge","inDegree","node","deg","next","CycleDetectedError","thoughtId","maxDepth","result","earliest","Map","a","b","Infinity","root","startId","direction","cap","Number","frontier","depth","neighbour"],"mappings":";AA+BO,MAAMA;IACK,OAAmB;IAYpC,YAAYC,KAAiB,CAAE;QAC9B,IAAI,CAAC,MAAM,GAAGA;IACf;IAiBA,cAAcC,SAAoB,EAAwB;QACzD,MAAMC,QAAQ,IAAI,CAAC,MAAM,CAAC,eAAe,CAACD;QAC1C,IAAIC,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;QAEV,MAAM,EAAEC,KAAK,EAAEC,WAAW,EAAE,GAAG,IAAI,CAAC,aAAa,CAACF;QAClD,MAAMG,QAAQ,IAAI,CAAC,UAAU,CAACF,OAAOC,aAAaF;QAClD,OAAO,IAAI,CAAC,aAAa,CAACD,WAAWI;IACtC;IAkBA,eAAeJ,SAAoB,EAAEK,aAAwB,EAAwB;QACpF,MAAMC,UAAU,IAAIC,IAAY;YAACF;SAAc;QAC/C,MAAMG,QAAkB;YAACH;SAAc;QACvC,MAAMI,QAAkB;YAACJ;SAAc;QACvC,MAAOI,MAAM,MAAM,GAAG,EAAG;YACxB,MAAMC,UAAUD,MAAM,KAAK;YAC3B,MAAME,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACX,WAAWU;YAC5C,KAAK,MAAME,QAAQD,IAClB,IAAIC,AAAc,aAAdA,KAAK,IAAI,EACb;gBAAA,KAAIN,QAAQ,GAAG,CAACM,KAAK,EAAE;oBACvBN,QAAQ,GAAG,CAACM,KAAK,EAAE;oBACnBJ,MAAM,IAAI,CAACI,KAAK,EAAE;oBAClBH,MAAM,IAAI,CAACG,KAAK,EAAE;;YAHgB;QAKpC;QACA,OAAOJ;IACR;IAeA,YAAYR,SAAoB,EAAwB;QACvD,MAAMC,QAAQ,IAAI,CAAC,MAAM,CAAC,eAAe,CAACD;QAC1C,IAAIC,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;QAEV,MAAMY,WAAW,IAAI,CAAC,cAAc,CAACZ;QACrC,MAAMQ,QAAkB,EAAE;QAC1B,KAAK,MAAM,CAACK,MAAMC,IAAI,IAAIF,SACzB,IAAIE,AAAQ,MAARA,KAAWN,MAAM,IAAI,CAACK;QAE3B,MAAMN,QAAkB,EAAE;QAC1B,MAAOC,MAAM,MAAM,GAAG,EAAG;YACxB,MAAMK,OAAOL,MAAM,KAAK;YACxBD,MAAM,IAAI,CAACM;YACX,KAAK,MAAMF,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACZ,WAAWc,MAAoB;gBACtE,MAAME,OAAQH,AAAAA,CAAAA,SAAS,GAAG,CAACD,KAAK,EAAE,KAAK,KAAK;gBAC5CC,SAAS,GAAG,CAACD,KAAK,EAAE,EAAEI;gBACtB,IAAIA,AAAS,MAATA,MAAYP,MAAM,IAAI,CAACG,KAAK,EAAE;YACnC;QACD;QACA,IAAIJ,MAAM,MAAM,KAAKK,SAAS,IAAI,EACjC,MAAM,IAAII,mBACT,CAAC,2BAA2B,EAAEjB,UAAU,gCAAgC,EAAEQ,MAAM,MAAM,CAAC,CAAC,EAAEK,SAAS,IAAI,CAAC,CAAC,CAAC;QAG5G,OAAOL;IACR;IAiBA,UAAUR,SAAoB,EAAEkB,SAAoB,EAAEC,QAAiB,EAAwB;QAC9F,OAAO,IAAI,CAAC,WAAW,CAACnB,WAAWkB,WAAWC,UAAU;IACzD;IAiBA,YAAYnB,SAAoB,EAAEkB,SAAoB,EAAEC,QAAiB,EAAwB;QAChG,OAAO,IAAI,CAAC,WAAW,CAACnB,WAAWkB,WAAWC,UAAU;IACzD;IAaA,OAAOnB,SAAoB,EAAwB;QAClD,MAAMC,QAAQ,IAAI,CAAC,MAAM,CAAC,eAAe,CAACD;QAC1C,IAAIC,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;QAEV,MAAM,EAAEC,KAAK,EAAE,GAAG,IAAI,CAAC,aAAa,CAACD;QACrC,MAAMmB,SAAmB,EAAE;QAC3B,KAAK,MAAMN,QAAQZ,MAClB,IAAI,AAA8D,MAA9D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACF,WAAWc,MAAmB,MAAM,EAC5DM,OAAO,IAAI,CAACN;QAGd,OAAOM;IACR;IAMQ,cAAcnB,KAAsB,EAG1C;QACD,MAAMC,QAAQ,IAAIK;QAClB,MAAMJ,cAAc,IAAII;QACxB,KAAK,MAAMK,QAAQX,MAAO;YACzBC,MAAM,GAAG,CAACU,KAAK,IAAI;YACnBV,MAAM,GAAG,CAACU,KAAK,EAAE;YACjBT,YAAY,GAAG,CAACS,KAAK,EAAE;QACxB;QACA,OAAO;YAAEV;YAAOC;QAAY;IAC7B;IAOQ,WACPD,KAAkB,EAClBC,WAAwB,EACxBF,KAAsB,EACX;QACX,MAAMoB,WAAW,IAAIC;QACrB,KAAK,MAAMV,QAAQX,MAClB,IAAI,CAACoB,SAAS,GAAG,CAACT,KAAK,IAAI,GAC1BS,SAAS,GAAG,CAACT,KAAK,IAAI,EAAEA,KAAK,SAAS;QAGxC,MAAMR,QAAkB,EAAE;QAC1B,KAAK,MAAMU,QAAQZ,MAClB,IAAI,CAACC,YAAY,GAAG,CAACW,OAAOV,MAAM,IAAI,CAACU;QAExCV,MAAM,IAAI,CAAC,CAACmB,GAAGC,IAAOH,AAAAA,CAAAA,SAAS,GAAG,CAACE,MAAME,KAAO,IAAMJ,CAAAA,SAAS,GAAG,CAACG,MAAMC,KAAO;QAChF,OAAOrB;IACR;IAKQ,cAAcJ,SAAoB,EAAEI,KAAwB,EAAqB;QACxF,MAAME,UAAU,IAAIC;QACpB,MAAMC,QAAkB,EAAE;QAC1B,MAAMC,QAAkB,EAAE;QAC1B,KAAK,MAAMiB,QAAQtB,MAClB,KAAIE,QAAQ,GAAG,CAACoB;YAChBpB,QAAQ,GAAG,CAACoB;YACZlB,MAAM,IAAI,CAACkB;YACXjB,MAAM,IAAI,CAACiB;;QAEZ,MAAOjB,MAAM,MAAM,GAAG,EAAG;YACxB,MAAMK,OAAOL,MAAM,KAAK;YACxB,KAAK,MAAMG,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACZ,WAAWc,MAClD,KAAIR,QAAQ,GAAG,CAACM,KAAK,EAAE;gBACvBN,QAAQ,GAAG,CAACM,KAAK,EAAE;gBACnBJ,MAAM,IAAI,CAACI,KAAK,EAAE;gBAClBH,MAAM,IAAI,CAACG,KAAK,EAAE;;QAEpB;QACA,OAAOJ;IACR;IAKQ,eAAeP,KAAsB,EAAuB;QACnE,MAAMY,WAAW,IAAIS;QACrB,KAAK,MAAMV,QAAQX,MAAO;YACzB,IAAI,CAACY,SAAS,GAAG,CAACD,KAAK,IAAI,GAAGC,SAAS,GAAG,CAACD,KAAK,IAAI,EAAE;YACtDC,SAAS,GAAG,CAACD,KAAK,EAAE,EAAGC,AAAAA,CAAAA,SAAS,GAAG,CAACD,KAAK,EAAE,KAAK,KAAK;QACtD;QACA,OAAOC;IACR;IAMQ,YACPb,SAAoB,EACpB2B,OAAe,EACfR,QAA4B,EAC5BS,SAAkC,EACd;QACpB,MAAMC,MAAMV,YAAYW,KAAwB;QAChD,MAAMxB,UAAU,IAAIC,IAAY;YAACoB;SAAQ;QACzC,MAAMnB,QAAkB,EAAE;QAC1B,IAAIuB,WAAqB;YAACJ;SAAQ;QAClC,IAAIK,QAAQ;QACZ,MAAOD,SAAS,MAAM,GAAG,KAAKC,QAAQH,IAAK;YAC1C,MAAMb,OAAiB,EAAE;YACzB,KAAK,MAAMF,QAAQiB,SAAU;gBAC5B,MAAM9B,QACL2B,AAAc,eAAdA,YACG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC5B,WAAWc,QAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACd,WAAWc;gBACpC,KAAK,MAAMF,QAAQX,MAAO;oBACzB,MAAMgC,YAAYL,AAAc,eAAdA,YAA2BhB,KAAK,EAAE,GAAGA,KAAK,IAAI;oBAChE,KAAIN,QAAQ,GAAG,CAAC2B;wBAChB3B,QAAQ,GAAG,CAAC2B;wBACZzB,MAAM,IAAI,CAACyB;wBACXjB,KAAK,IAAI,CAACiB;;gBACX;YACD;YACAF,WAAWf;YACXgB;QACD;QACA,OAAOxB;IACR;AACD"}
+{"version":3,"file":"core/graph/GraphView.js","sources":["../../../src/core/graph/GraphView.ts"],"sourcesContent":["/**\n * GraphView — read-only graph traversal queries over an {@link IEdgeStore}.\n *\n * Provides BFS / topological / ancestor / descendant queries over the\n * thought DAG. Queries return thought ids or graph distances,\n * never `ThoughtData` objects — the view is intentionally decoupled from\n * `HistoryManager` so it can be reused by strategies that work purely in\n * terms of graph structure.\n *\n * Construction is cheap (stores a reference to the underlying store).\n * Each query reads the latest store state — no caching, no snapshots.\n *\n * @module core/graph/GraphView\n */\n\nimport type { IEdgeStore } from '../../contracts/interfaces.js';\nimport type { SessionId, ThoughtId } from '../../contracts/ids.js';\nimport { CycleDetectedError } from '../../errors.js';\nimport type { Edge } from './Edge.js';\n\n/**\n * Read-only traversal queries over an {@link IEdgeStore}.\n *\n * @example\n * ```typescript\n * const store = new EdgeStore();\n * // ... populate store ...\n * const view = new GraphView(store);\n * const order = view.topological('s1');\n * ```\n */\nexport class GraphView {\n\tprivate readonly _store: IEdgeStore;\n\n\t/**\n\t * Create a new GraphView backed by the given edge store.\n\t *\n\t * @param store - The edge store to query (held by reference, read-only access)\n\t *\n\t * @example\n\t * ```typescript\n\t * const view = new GraphView(edgeStore);\n\t * ```\n\t */\n\tconstructor(store: IEdgeStore) {\n\t\tthis._store = store;\n\t}\n\n\t/**\n\t * Return all thought ids in the session, ordered by BFS from roots.\n\t *\n\t * Roots are nodes with no incoming edges. Within a layer, neighbours\n\t * are visited in `outgoing` order (which the underlying store keeps\n\t * sorted by `createdAt` ascending).\n\t *\n\t * @param sessionId - Session to query\n\t * @returns Thought ids in chronological BFS order\n\t *\n\t * @example\n\t * ```typescript\n\t * const ids = view.chronological('s1');\n\t * ```\n\t */\n\tchronological(sessionId: SessionId): readonly ThoughtId[] {\n\t\tconst edges = this._store.edgesForSession(sessionId);\n\t\tif (edges.length === 0) {\n\t\t\treturn [];\n\t\t}\n\t\tconst { nodes, hasIncoming } = this._collectNodes(edges);\n\t\tconst roots = this._findRoots(nodes, hasIncoming, edges);\n\t\treturn this._bfsFromRoots(sessionId, roots) as readonly ThoughtId[];\n\t}\n\n\t/**\n\t * Return the shortest directed distance from any retained root to a thought.\n\t *\n\t * Nodes are derived from the current edge store, so isolated thoughts are\n\t * invisible and pruning can expose a retained node as a new root. Every edge\n\t * kind participates in the traversal.\n\t *\n\t * @param sessionId - Session to query\n\t * @param thoughtId - Thought whose root distance to resolve\n\t * @returns Zero for a root, or `undefined` when no root can reach the thought\n\t */\n\tdepthFromRoots(sessionId: SessionId, thoughtId: ThoughtId): number | undefined {\n\t\tconst edges = this._store.edgesForSession(sessionId);\n\t\tif (edges.length === 0) return undefined;\n\n\t\tconst nodes = new Set<ThoughtId>();\n\t\tconst hasIncoming = new Set<ThoughtId>();\n\t\tconst outgoing = new Map<ThoughtId, ThoughtId[]>();\n\t\tfor (const edge of edges) {\n\t\t\tnodes.add(edge.from);\n\t\t\tnodes.add(edge.to);\n\t\t\thasIncoming.add(edge.to);\n\t\t\tconst children = outgoing.get(edge.from);\n\t\t\tif (children === undefined) outgoing.set(edge.from, [edge.to]);\n\t\t\telse children.push(edge.to);\n\t\t}\n\t\tif (!nodes.has(thoughtId)) return undefined;\n\n\t\tlet frontier: ThoughtId[] = [];\n\t\tfor (const node of nodes) {\n\t\t\tif (!hasIncoming.has(node)) frontier.push(node);\n\t\t}\n\t\tconst visited = new Set<ThoughtId>(frontier);\n\t\tlet depth = 0;\n\t\twhile (frontier.length > 0) {\n\t\t\tconst next: ThoughtId[] = [];\n\t\t\tfor (const node of frontier) {\n\t\t\t\tif (node === thoughtId) return depth;\n\t\t\t\tfor (const child of outgoing.get(node) ?? []) {\n\t\t\t\t\tif (visited.has(child)) continue;\n\t\t\t\t\tvisited.add(child);\n\t\t\t\t\tnext.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfrontier = next;\n\t\t\tdepth++;\n\t\t}\n\t\treturn undefined;\n\t}\n\n\t/**\n\t * Return all thought ids reachable from `rootThoughtId` via `'branch'`\n\t * edges, including the root itself.\n\t *\n\t * Non-branch edges are ignored. Cycles (if any) do not cause infinite\n\t * loops because each node is visited at most once.\n\t *\n\t * @param sessionId - Session to query\n\t * @param rootThoughtId - The starting thought id (typically the branch root)\n\t * @returns Thought ids forming the branch (includes root)\n\t *\n\t * @example\n\t * ```typescript\n\t * const branchIds = view.branchThoughts('s1', 'thought-root');\n\t * ```\n\t */\n\tbranchThoughts(sessionId: SessionId, rootThoughtId: ThoughtId): readonly ThoughtId[] {\n\t\tconst visited = new Set<string>([rootThoughtId]);\n\t\tconst order: string[] = [rootThoughtId];\n\t\tconst queue: string[] = [rootThoughtId];\n\t\twhile (queue.length > 0) {\n\t\t\tconst current = queue.shift()!;\n\t\t\tconst out = this._store.outgoing(sessionId, current as ThoughtId);\n\t\t\tfor (const edge of out) {\n\t\t\t\tif (edge.kind !== 'branch') continue;\n\t\t\t\tif (visited.has(edge.to)) continue;\n\t\t\t\tvisited.add(edge.to);\n\t\t\t\torder.push(edge.to);\n\t\t\t\tqueue.push(edge.to);\n\t\t\t}\n\t\t}\n\t\treturn order as ThoughtId[];\n\t}\n\n\t/**\n\t * Return a topological ordering of all thought ids in the session\n\t * using Kahn's algorithm.\n\t *\n\t * @param sessionId - Session to query\n\t * @returns Thought ids in topological order\n\t * @throws {CycleDetectedError} If the graph contains a cycle\n\t *\n\t * @example\n\t * ```typescript\n\t * const order = view.topological('s1');\n\t * ```\n\t */\n\ttopological(sessionId: SessionId): readonly ThoughtId[] {\n\t\tconst edges = this._store.edgesForSession(sessionId);\n\t\tif (edges.length === 0) {\n\t\t\treturn [];\n\t\t}\n\t\tconst inDegree = this._buildInDegree(edges);\n\t\tconst queue: string[] = [];\n\t\tfor (const [node, deg] of inDegree) {\n\t\t\tif (deg === 0) queue.push(node);\n\t\t}\n\t\tconst order: string[] = [];\n\t\twhile (queue.length > 0) {\n\t\t\tconst node = queue.shift()!;\n\t\t\torder.push(node);\n\t\t\tfor (const edge of this._store.outgoing(sessionId, node as ThoughtId)) {\n\t\t\t\tconst next = (inDegree.get(edge.to) ?? 0) - 1;\n\t\t\t\tinDegree.set(edge.to, next);\n\t\t\t\tif (next === 0) queue.push(edge.to);\n\t\t\t}\n\t\t}\n\t\tif (order.length !== inDegree.size) {\n\t\t\tthrow new CycleDetectedError(\n\t\t\t\t`Cycle detected in session '${sessionId}': topological sort incomplete (${order.length}/${inDegree.size})`\n\t\t\t);\n\t\t}\n\t\treturn order as ThoughtId[];\n\t}\n\n\t/**\n\t * Return all ancestors of `thoughtId` via incoming-edge BFS.\n\t *\n\t * The starting node is NOT included. Cycles do not cause infinite loops.\n\t *\n\t * @param sessionId - Session to query\n\t * @param thoughtId - The thought to traverse from\n\t * @param maxDepth - Optional maximum traversal depth (1 = direct parents only)\n\t * @returns Ancestor thought ids in BFS order\n\t *\n\t * @example\n\t * ```typescript\n\t * const parents = view.ancestors('s1', 'thought-id', 1);\n\t * ```\n\t */\n\tancestors(sessionId: SessionId, thoughtId: ThoughtId, maxDepth?: number): readonly ThoughtId[] {\n\t\treturn this._bfsClosure(sessionId, thoughtId, maxDepth, 'incoming') as readonly ThoughtId[];\n\t}\n\n\t/**\n\t * Return all descendants of `thoughtId` via outgoing-edge BFS.\n\t *\n\t * The starting node is NOT included. Cycles do not cause infinite loops.\n\t *\n\t * @param sessionId - Session to query\n\t * @param thoughtId - The thought to traverse from\n\t * @param maxDepth - Optional maximum traversal depth (1 = direct children only)\n\t * @returns Descendant thought ids in BFS order\n\t *\n\t * @example\n\t * ```typescript\n\t * const children = view.descendants('s1', 'thought-id');\n\t * ```\n\t */\n\tdescendants(sessionId: SessionId, thoughtId: ThoughtId, maxDepth?: number): readonly ThoughtId[] {\n\t\treturn this._bfsClosure(sessionId, thoughtId, maxDepth, 'outgoing') as readonly ThoughtId[];\n\t}\n\n\t/**\n\t * Return all thought ids in the session that have no outgoing edges.\n\t *\n\t * @param sessionId - Session to query\n\t * @returns Thought ids that are graph leaves\n\t *\n\t * @example\n\t * ```typescript\n\t * const tips = view.leaves('s1');\n\t * ```\n\t */\n\tleaves(sessionId: SessionId): readonly ThoughtId[] {\n\t\tconst edges = this._store.edgesForSession(sessionId);\n\t\tif (edges.length === 0) {\n\t\t\treturn [];\n\t\t}\n\t\tconst { nodes } = this._collectNodes(edges);\n\t\tconst result: string[] = [];\n\t\tfor (const node of nodes) {\n\t\t\tif (this._store.outgoing(sessionId, node as ThoughtId).length === 0) {\n\t\t\t\tresult.push(node);\n\t\t\t}\n\t\t}\n\t\treturn result as ThoughtId[];\n\t}\n\n\t/**\n\t * Collect every node id referenced by the edges and a set of nodes\n\t * that have at least one incoming edge.\n\t */\n\tprivate _collectNodes(edges: readonly Edge[]): {\n\t\tnodes: Set<string>;\n\t\thasIncoming: Set<string>;\n\t} {\n\t\tconst nodes = new Set<string>();\n\t\tconst hasIncoming = new Set<string>();\n\t\tfor (const edge of edges) {\n\t\t\tnodes.add(edge.from);\n\t\t\tnodes.add(edge.to);\n\t\t\thasIncoming.add(edge.to);\n\t\t}\n\t\treturn { nodes, hasIncoming };\n\t}\n\n\t/**\n\t * Find roots (no incoming) ordered by the earliest outgoing edge\n\t * `createdAt`. Nodes with no outgoing edges fall back to the order\n\t * they appear among edges (already sorted by `createdAt`).\n\t */\n\tprivate _findRoots(\n\t\tnodes: Set<string>,\n\t\thasIncoming: Set<string>,\n\t\tedges: readonly Edge[]\n\t): string[] {\n\t\tconst earliest = new Map<string, number>();\n\t\tfor (const edge of edges) {\n\t\t\tif (!earliest.has(edge.from)) {\n\t\t\t\tearliest.set(edge.from, edge.createdAt);\n\t\t\t}\n\t\t}\n\t\tconst roots: string[] = [];\n\t\tfor (const node of nodes) {\n\t\t\tif (!hasIncoming.has(node)) roots.push(node);\n\t\t}\n\t\troots.sort((a, b) => (earliest.get(a) ?? Infinity) - (earliest.get(b) ?? Infinity));\n\t\treturn roots;\n\t}\n\n\t/**\n\t * BFS from a list of root ids, visiting each node at most once.\n\t */\n\tprivate _bfsFromRoots(sessionId: SessionId, roots: readonly string[]): readonly string[] {\n\t\tconst visited = new Set<string>();\n\t\tconst order: string[] = [];\n\t\tconst queue: string[] = [];\n\t\tfor (const root of roots) {\n\t\t\tif (visited.has(root)) continue;\n\t\t\tvisited.add(root);\n\t\t\torder.push(root);\n\t\t\tqueue.push(root);\n\t\t}\n\t\twhile (queue.length > 0) {\n\t\t\tconst node = queue.shift()!;\n\t\t\tfor (const edge of this._store.outgoing(sessionId, node as ThoughtId)) {\n\t\t\t\tif (visited.has(edge.to)) continue;\n\t\t\t\tvisited.add(edge.to);\n\t\t\t\torder.push(edge.to);\n\t\t\t\tqueue.push(edge.to);\n\t\t\t}\n\t\t}\n\t\treturn order;\n\t}\n\n\t/**\n\t * Build an in-degree map covering every node referenced by the edges.\n\t */\n\tprivate _buildInDegree(edges: readonly Edge[]): Map<string, number> {\n\t\tconst inDegree = new Map<string, number>();\n\t\tfor (const edge of edges) {\n\t\t\tif (!inDegree.has(edge.from)) inDegree.set(edge.from, 0);\n\t\t\tinDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);\n\t\t}\n\t\treturn inDegree;\n\t}\n\n\t/**\n\t * Generic BFS closure in either direction. Excludes the start node\n\t * from the result and respects an optional depth cap.\n\t */\n\tprivate _bfsClosure(\n\t\tsessionId: SessionId,\n\t\tstartId: string,\n\t\tmaxDepth: number | undefined,\n\t\tdirection: 'incoming' | 'outgoing'\n\t): readonly string[] {\n\t\tconst cap = maxDepth ?? Number.POSITIVE_INFINITY;\n\t\tconst visited = new Set<string>([startId]);\n\t\tconst order: string[] = [];\n\t\tlet frontier: string[] = [startId];\n\t\tlet depth = 0;\n\t\twhile (frontier.length > 0 && depth < cap) {\n\t\t\tconst next: string[] = [];\n\t\t\tfor (const node of frontier) {\n\t\t\t\tconst edges =\n\t\t\t\t\tdirection === 'outgoing'\n\t\t\t\t\t\t? this._store.outgoing(sessionId, node as ThoughtId)\n\t\t\t\t\t\t: this._store.incoming(sessionId, node as ThoughtId);\n\t\t\t\tfor (const edge of edges) {\n\t\t\t\t\tconst neighbour = direction === 'outgoing' ? edge.to : edge.from;\n\t\t\t\t\tif (visited.has(neighbour)) continue;\n\t\t\t\t\tvisited.add(neighbour);\n\t\t\t\t\torder.push(neighbour);\n\t\t\t\t\tnext.push(neighbour);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfrontier = next;\n\t\t\tdepth++;\n\t\t}\n\t\treturn order;\n\t}\n}\n"],"names":["GraphView","store","sessionId","edges","nodes","hasIncoming","roots","thoughtId","Set","outgoing","Map","edge","children","undefined","frontier","node","visited","depth","next","child","rootThoughtId","order","queue","current","out","inDegree","deg","CycleDetectedError","maxDepth","result","earliest","a","b","Infinity","root","startId","direction","cap","Number","neighbour"],"mappings":";AA+BO,MAAMA;IACK,OAAmB;IAYpC,YAAYC,KAAiB,CAAE;QAC9B,IAAI,CAAC,MAAM,GAAGA;IACf;IAiBA,cAAcC,SAAoB,EAAwB;QACzD,MAAMC,QAAQ,IAAI,CAAC,MAAM,CAAC,eAAe,CAACD;QAC1C,IAAIC,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;QAEV,MAAM,EAAEC,KAAK,EAAEC,WAAW,EAAE,GAAG,IAAI,CAAC,aAAa,CAACF;QAClD,MAAMG,QAAQ,IAAI,CAAC,UAAU,CAACF,OAAOC,aAAaF;QAClD,OAAO,IAAI,CAAC,aAAa,CAACD,WAAWI;IACtC;IAaA,eAAeJ,SAAoB,EAAEK,SAAoB,EAAsB;QAC9E,MAAMJ,QAAQ,IAAI,CAAC,MAAM,CAAC,eAAe,CAACD;QAC1C,IAAIC,AAAiB,MAAjBA,MAAM,MAAM,EAAQ;QAExB,MAAMC,QAAQ,IAAII;QAClB,MAAMH,cAAc,IAAIG;QACxB,MAAMC,WAAW,IAAIC;QACrB,KAAK,MAAMC,QAAQR,MAAO;YACzBC,MAAM,GAAG,CAACO,KAAK,IAAI;YACnBP,MAAM,GAAG,CAACO,KAAK,EAAE;YACjBN,YAAY,GAAG,CAACM,KAAK,EAAE;YACvB,MAAMC,WAAWH,SAAS,GAAG,CAACE,KAAK,IAAI;YACvC,IAAIC,AAAaC,WAAbD,UAAwBH,SAAS,GAAG,CAACE,KAAK,IAAI,EAAE;gBAACA,KAAK,EAAE;aAAC;iBACxDC,SAAS,IAAI,CAACD,KAAK,EAAE;QAC3B;QACA,IAAI,CAACP,MAAM,GAAG,CAACG,YAAY;QAE3B,IAAIO,WAAwB,EAAE;QAC9B,KAAK,MAAMC,QAAQX,MAClB,IAAI,CAACC,YAAY,GAAG,CAACU,OAAOD,SAAS,IAAI,CAACC;QAE3C,MAAMC,UAAU,IAAIR,IAAeM;QACnC,IAAIG,QAAQ;QACZ,MAAOH,SAAS,MAAM,GAAG,EAAG;YAC3B,MAAMI,OAAoB,EAAE;YAC5B,KAAK,MAAMH,QAAQD,SAAU;gBAC5B,IAAIC,SAASR,WAAW,OAAOU;gBAC/B,KAAK,MAAME,SAASV,SAAS,GAAG,CAACM,SAAS,EAAE,CAC3C,KAAIC,QAAQ,GAAG,CAACG;oBAChBH,QAAQ,GAAG,CAACG;oBACZD,KAAK,IAAI,CAACC;;YAEZ;YACAL,WAAWI;YACXD;QACD;IAED;IAkBA,eAAef,SAAoB,EAAEkB,aAAwB,EAAwB;QACpF,MAAMJ,UAAU,IAAIR,IAAY;YAACY;SAAc;QAC/C,MAAMC,QAAkB;YAACD;SAAc;QACvC,MAAME,QAAkB;YAACF;SAAc;QACvC,MAAOE,MAAM,MAAM,GAAG,EAAG;YACxB,MAAMC,UAAUD,MAAM,KAAK;YAC3B,MAAME,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACtB,WAAWqB;YAC5C,KAAK,MAAMZ,QAAQa,IAClB,IAAIb,AAAc,aAAdA,KAAK,IAAI,EACb;gBAAA,KAAIK,QAAQ,GAAG,CAACL,KAAK,EAAE;oBACvBK,QAAQ,GAAG,CAACL,KAAK,EAAE;oBACnBU,MAAM,IAAI,CAACV,KAAK,EAAE;oBAClBW,MAAM,IAAI,CAACX,KAAK,EAAE;;YAHgB;QAKpC;QACA,OAAOU;IACR;IAeA,YAAYnB,SAAoB,EAAwB;QACvD,MAAMC,QAAQ,IAAI,CAAC,MAAM,CAAC,eAAe,CAACD;QAC1C,IAAIC,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;QAEV,MAAMsB,WAAW,IAAI,CAAC,cAAc,CAACtB;QACrC,MAAMmB,QAAkB,EAAE;QAC1B,KAAK,MAAM,CAACP,MAAMW,IAAI,IAAID,SACzB,IAAIC,AAAQ,MAARA,KAAWJ,MAAM,IAAI,CAACP;QAE3B,MAAMM,QAAkB,EAAE;QAC1B,MAAOC,MAAM,MAAM,GAAG,EAAG;YACxB,MAAMP,OAAOO,MAAM,KAAK;YACxBD,MAAM,IAAI,CAACN;YACX,KAAK,MAAMJ,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACT,WAAWa,MAAoB;gBACtE,MAAMG,OAAQO,AAAAA,CAAAA,SAAS,GAAG,CAACd,KAAK,EAAE,KAAK,KAAK;gBAC5Cc,SAAS,GAAG,CAACd,KAAK,EAAE,EAAEO;gBACtB,IAAIA,AAAS,MAATA,MAAYI,MAAM,IAAI,CAACX,KAAK,EAAE;YACnC;QACD;QACA,IAAIU,MAAM,MAAM,KAAKI,SAAS,IAAI,EACjC,MAAM,IAAIE,mBACT,CAAC,2BAA2B,EAAEzB,UAAU,gCAAgC,EAAEmB,MAAM,MAAM,CAAC,CAAC,EAAEI,SAAS,IAAI,CAAC,CAAC,CAAC;QAG5G,OAAOJ;IACR;IAiBA,UAAUnB,SAAoB,EAAEK,SAAoB,EAAEqB,QAAiB,EAAwB;QAC9F,OAAO,IAAI,CAAC,WAAW,CAAC1B,WAAWK,WAAWqB,UAAU;IACzD;IAiBA,YAAY1B,SAAoB,EAAEK,SAAoB,EAAEqB,QAAiB,EAAwB;QAChG,OAAO,IAAI,CAAC,WAAW,CAAC1B,WAAWK,WAAWqB,UAAU;IACzD;IAaA,OAAO1B,SAAoB,EAAwB;QAClD,MAAMC,QAAQ,IAAI,CAAC,MAAM,CAAC,eAAe,CAACD;QAC1C,IAAIC,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;QAEV,MAAM,EAAEC,KAAK,EAAE,GAAG,IAAI,CAAC,aAAa,CAACD;QACrC,MAAM0B,SAAmB,EAAE;QAC3B,KAAK,MAAMd,QAAQX,MAClB,IAAI,AAA8D,MAA9D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACF,WAAWa,MAAmB,MAAM,EAC5Dc,OAAO,IAAI,CAACd;QAGd,OAAOc;IACR;IAMQ,cAAc1B,KAAsB,EAG1C;QACD,MAAMC,QAAQ,IAAII;QAClB,MAAMH,cAAc,IAAIG;QACxB,KAAK,MAAMG,QAAQR,MAAO;YACzBC,MAAM,GAAG,CAACO,KAAK,IAAI;YACnBP,MAAM,GAAG,CAACO,KAAK,EAAE;YACjBN,YAAY,GAAG,CAACM,KAAK,EAAE;QACxB;QACA,OAAO;YAAEP;YAAOC;QAAY;IAC7B;IAOQ,WACPD,KAAkB,EAClBC,WAAwB,EACxBF,KAAsB,EACX;QACX,MAAM2B,WAAW,IAAIpB;QACrB,KAAK,MAAMC,QAAQR,MAClB,IAAI,CAAC2B,SAAS,GAAG,CAACnB,KAAK,IAAI,GAC1BmB,SAAS,GAAG,CAACnB,KAAK,IAAI,EAAEA,KAAK,SAAS;QAGxC,MAAML,QAAkB,EAAE;QAC1B,KAAK,MAAMS,QAAQX,MAClB,IAAI,CAACC,YAAY,GAAG,CAACU,OAAOT,MAAM,IAAI,CAACS;QAExCT,MAAM,IAAI,CAAC,CAACyB,GAAGC,IAAOF,AAAAA,CAAAA,SAAS,GAAG,CAACC,MAAME,KAAO,IAAMH,CAAAA,SAAS,GAAG,CAACE,MAAMC,KAAO;QAChF,OAAO3B;IACR;IAKQ,cAAcJ,SAAoB,EAAEI,KAAwB,EAAqB;QACxF,MAAMU,UAAU,IAAIR;QACpB,MAAMa,QAAkB,EAAE;QAC1B,MAAMC,QAAkB,EAAE;QAC1B,KAAK,MAAMY,QAAQ5B,MAClB,KAAIU,QAAQ,GAAG,CAACkB;YAChBlB,QAAQ,GAAG,CAACkB;YACZb,MAAM,IAAI,CAACa;YACXZ,MAAM,IAAI,CAACY;;QAEZ,MAAOZ,MAAM,MAAM,GAAG,EAAG;YACxB,MAAMP,OAAOO,MAAM,KAAK;YACxB,KAAK,MAAMX,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACT,WAAWa,MAClD,KAAIC,QAAQ,GAAG,CAACL,KAAK,EAAE;gBACvBK,QAAQ,GAAG,CAACL,KAAK,EAAE;gBACnBU,MAAM,IAAI,CAACV,KAAK,EAAE;gBAClBW,MAAM,IAAI,CAACX,KAAK,EAAE;;QAEpB;QACA,OAAOU;IACR;IAKQ,eAAelB,KAAsB,EAAuB;QACnE,MAAMsB,WAAW,IAAIf;QACrB,KAAK,MAAMC,QAAQR,MAAO;YACzB,IAAI,CAACsB,SAAS,GAAG,CAACd,KAAK,IAAI,GAAGc,SAAS,GAAG,CAACd,KAAK,IAAI,EAAE;YACtDc,SAAS,GAAG,CAACd,KAAK,EAAE,EAAGc,AAAAA,CAAAA,SAAS,GAAG,CAACd,KAAK,EAAE,KAAK,KAAK;QACtD;QACA,OAAOc;IACR;IAMQ,YACPvB,SAAoB,EACpBiC,OAAe,EACfP,QAA4B,EAC5BQ,SAAkC,EACd;QACpB,MAAMC,MAAMT,YAAYU,KAAwB;QAChD,MAAMtB,UAAU,IAAIR,IAAY;YAAC2B;SAAQ;QACzC,MAAMd,QAAkB,EAAE;QAC1B,IAAIP,WAAqB;YAACqB;SAAQ;QAClC,IAAIlB,QAAQ;QACZ,MAAOH,SAAS,MAAM,GAAG,KAAKG,QAAQoB,IAAK;YAC1C,MAAMnB,OAAiB,EAAE;YACzB,KAAK,MAAMH,QAAQD,SAAU;gBAC5B,MAAMX,QACLiC,AAAc,eAAdA,YACG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAClC,WAAWa,QAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAACb,WAAWa;gBACpC,KAAK,MAAMJ,QAAQR,MAAO;oBACzB,MAAMoC,YAAYH,AAAc,eAAdA,YAA2BzB,KAAK,EAAE,GAAGA,KAAK,IAAI;oBAChE,KAAIK,QAAQ,GAAG,CAACuB;wBAChBvB,QAAQ,GAAG,CAACuB;wBACZlB,MAAM,IAAI,CAACkB;wBACXrB,KAAK,IAAI,CAACqB;;gBACX;YACD;YACAzB,WAAWI;YACXD;QACD;QACA,OAAOI;IACR;AACD"}

package/dist/core/reasoning/strategies/TreeOfThoughtStrategy.d.ts

@@ -3,8 +3,8 @@
  *
  * Observes the frontier (graph leaves), scores each leaf via
  * {@link scoreThought}, and decides whether to continue, branch (when the
- * current thought falls outside the beam), or terminate (on confidence
- * threshold or score plateau).
+ * current thought falls outside the beam), or terminate (on depth cap,
+ * confidence threshold, or score plateau).
  *
  * Pure policy: configuration lives in a module-level {@link WeakMap}, not
  * on the instance, so `Object.getOwnPropertyNames(strategy)` only ever
@@ -46,13 +46,13 @@ export declare class TreeOfThoughtStrategy implements IReasoningStrategy {
     /**
      * Compute the next action for the chain.
      *
-     * Order of checks: termination by confidence → termination by plateau →
-     * branch when the current thought is outside the beam → continue.
+     * Order of checks: depth cap → confidence → plateau → branch when the
+     * current thought is outside the beam → continue. Missing graphs continue.
      */
     decide(ctx: StrategyContext): StrategyDecision;
-    /** True when the frontier is wider than the beam (diverse exploration). */
+    /** True below the depth cap when the frontier is wider than the beam. */
     shouldBranch(ctx: StrategyContext): boolean;
-    /** True when the best frontier score crosses the threshold OR scores plateau. */
+    /** True at the depth cap, confidence threshold, or score plateau. */
     shouldTerminate(ctx: StrategyContext): boolean;
 }
 //# sourceMappingURL=TreeOfThoughtStrategy.d.ts.map

package/dist/core/reasoning/strategies/TreeOfThoughtStrategy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TreeOfThoughtStrategy.d.ts","sourceRoot":"","sources":["../../../../src/core/reasoning/strategies/TreeOfThoughtStrategy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EACX,kBAAkB,EAClB,eAAe,EACf,gBAAgB,EAChB,MAAM,gCAAgC,CAAC;AAKxC;;;GAGG;AACH,MAAM,WAAW,SAAS;IACzB,2DAA2D;IAC3D,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,kEAAkE;IAClE,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IACxC,uDAAuD;IACvD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,8EAA8E;IAC9E,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;CACjC;AAgED;;;;;;;;GAQG;AACH,qBAAa,qBAAsB,YAAW,kBAAkB;IAC/D,QAAQ,CAAC,IAAI,EAAG,KAAK,CAAU;IAE/B,6CAA6C;gBACjC,MAAM,CAAC,EAAE,SAAS;IAI9B;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,eAAe,GAAG,gBAAgB;IAiC9C,2EAA2E;IAC3E,YAAY,CAAC,GAAG,EAAE,eAAe,GAAG,OAAO;IAO3C,iFAAiF;IACjF,eAAe,CAAC,GAAG,EAAE,eAAe,GAAG,OAAO;CAY9C"}
+{"version":3,"file":"TreeOfThoughtStrategy.d.ts","sourceRoot":"","sources":["../../../../src/core/reasoning/strategies/TreeOfThoughtStrategy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EACX,kBAAkB,EAClB,eAAe,EACf,gBAAgB,EAChB,MAAM,gCAAgC,CAAC;AAMxC;;;GAGG;AACH,MAAM,WAAW,SAAS;IACzB,2DAA2D;IAC3D,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,kEAAkE;IAClE,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IACxC,uDAAuD;IACvD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,8EAA8E;IAC9E,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;CACjC;AAsED;;;;;;;;GAQG;AACH,qBAAa,qBAAsB,YAAW,kBAAkB;IAC/D,QAAQ,CAAC,IAAI,EAAG,KAAK,CAAU;IAE/B,6CAA6C;gBACjC,MAAM,CAAC,EAAE,SAAS;IAQ9B;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,eAAe,GAAG,gBAAgB;IAoC9C,yEAAyE;IACzE,YAAY,CAAC,GAAG,EAAE,eAAe,GAAG,OAAO;IAQ3C,qEAAqE;IACrE,eAAe,CAAC,GAAG,EAAE,eAAe,GAAG,OAAO;CAa9C"}

package/dist/core/reasoning/strategies/TreeOfThoughtStrategy.js

@@ -1,3 +1,4 @@
+import { asThoughtId } from "../../../contracts/ids.js";
 import { scoreThought, selectBeam } from "./totScoring.js";
 import { detectPlateau } from "./plateau.js";
 const DEFAULTS = {
@@ -12,7 +13,7 @@ function configOf(s) {
     return CONFIGS.get(s) ?? DEFAULTS;
 }
 function thoughtKey(t) {
-    return t.id ?? String(t.thought_number);
+    return t.id ?? asThoughtId(String(t.thought_number));
 }
 function indexHistory(history) {
     const out = new Map();
@@ -41,12 +42,19 @@ function recentScores(history, window) {
     for(let i = start; i < history.length; i++)out.push(scoreThought(history[i]));
     return out;
 }
+function isAtDepthCap(ctx, depthCap) {
+    const depth = ctx.graph?.depthFromRoots(ctx.sessionId, thoughtKey(ctx.currentThought));
+    return void 0 !== depth && depth >= depthCap;
+}
 class TreeOfThoughtStrategy {
     name = 'tot';
     constructor(config){
+        const depthCap = config?.depthCap ?? DEFAULTS.depthCap;
+        if (!Number.isFinite(depthCap) || !Number.isInteger(depthCap) || depthCap < 0) throw new TypeError('depthCap must be a finite nonnegative integer');
         CONFIGS.set(this, {
             ...DEFAULTS,
-            ...config ?? {}
+            ...config,
+            depthCap
         });
     }
     decide(ctx) {
@@ -54,6 +62,10 @@ class TreeOfThoughtStrategy {
         if (!ctx.graph) return {
             action: 'continue'
         };
+        if (isAtDepthCap(ctx, cfg.depthCap)) return {
+            action: 'terminate',
+            reason: 'depth cap'
+        };
         const frontier = ctx.graph.leaves(ctx.sessionId);
         const byKey = indexHistory(ctx.history);
         const scored = scoreFrontier(frontier, byKey);
@@ -84,12 +96,14 @@ class TreeOfThoughtStrategy {
     shouldBranch(ctx) {
         const cfg = configOf(this);
         if (!ctx.graph) return false;
+        if (isAtDepthCap(ctx, cfg.depthCap)) return false;
         const frontier = ctx.graph.leaves(ctx.sessionId);
         return frontier.length > cfg.beamWidth;
     }
     shouldTerminate(ctx) {
         const cfg = configOf(this);
         if (!ctx.graph) return false;
+        if (isAtDepthCap(ctx, cfg.depthCap)) return true;
         const frontier = ctx.graph.leaves(ctx.sessionId);
         const byKey = indexHistory(ctx.history);
         const scored = scoreFrontier(frontier, byKey);

package/dist/core/reasoning/strategies/TreeOfThoughtStrategy.js.map

@@ -1 +1 @@
-{"version":3,"file":"core/reasoning/strategies/TreeOfThoughtStrategy.js","sources":["../../../../src/core/reasoning/strategies/TreeOfThoughtStrategy.ts"],"sourcesContent":["/**\n * Tree-of-Thought reasoning strategy — beam search over the thought DAG.\n *\n * Observes the frontier (graph leaves), scores each leaf via\n * {@link scoreThought}, and decides whether to continue, branch (when the\n * current thought falls outside the beam), or terminate (on confidence\n * threshold or score plateau).\n *\n * Pure policy: configuration lives in a module-level {@link WeakMap}, not\n * on the instance, so `Object.getOwnPropertyNames(strategy)` only ever\n * surfaces the readonly `name` discriminator. All other state is derived\n * from the {@link StrategyContext} on every call.\n *\n * @module core/reasoning/strategies/TreeOfThoughtStrategy\n */\n\nimport type {\n\tIReasoningStrategy,\n\tStrategyContext,\n\tStrategyDecision,\n} from '../../../contracts/strategy.js';\nimport type { ThoughtData } from '../../thought.js';\nimport { scoreThought, selectBeam, type ScoredCandidate } from './totScoring.js';\nimport { detectPlateau } from './plateau.js';\n\n/**\n * Configuration knobs for {@link TreeOfThoughtStrategy}. All fields are\n * optional; defaults are applied in the constructor.\n */\nexport interface TotConfig {\n\t/** Top-K candidates kept on the frontier (default `3`). */\n\treadonly beamWidth?: number;\n\t/** Maximum exploration depth before forcing termination (default `8`). */\n\treadonly depthCap?: number;\n\t/** Score at/above which the chain terminates (default `0.85`). */\n\treadonly terminationConfidence?: number;\n\t/** Window size for plateau detection (default `3`). */\n\treadonly plateauWindow?: number;\n\t/** Minimum meaningful score change for plateau detection (default `0.02`). */\n\treadonly plateauEpsilon?: number;\n}\n\n/** Defaults applied when a {@link TotConfig} field is omitted. */\nconst DEFAULTS: Required<TotConfig> = {\n\tbeamWidth: 3,\n\tdepthCap: 8,\n\tterminationConfidence: 0.85,\n\tplateauWindow: 3,\n\tplateauEpsilon: 0.02,\n};\n\n/**\n * Module-private config storage. Keyed by strategy instance so that no\n * own-properties leak onto `this` (preserving the purity contract).\n */\nconst CONFIGS: WeakMap<TreeOfThoughtStrategy, Required<TotConfig>> = new WeakMap();\n\n/** Resolve the per-instance config (constructor always populates the map). */\nfunction configOf(s: TreeOfThoughtStrategy): Required<TotConfig> {\n\treturn CONFIGS.get(s) ?? DEFAULTS;\n}\n\n/** Stable identifier for a thought: `id` if present, else its sequence number. */\nfunction thoughtKey(t: ThoughtData): string {\n\treturn t.id ?? String(t.thought_number);\n}\n\n/** Index history by stable key for O(1) leaf-id → ThoughtData lookup. */\nfunction indexHistory(history: readonly ThoughtData[]): Map<string, ThoughtData> {\n\tconst out = new Map<string, ThoughtData>();\n\tfor (const t of history) out.set(thoughtKey(t), t);\n\treturn out;\n}\n\n/** Score the frontier (graph leaves), skipping ids absent from history. */\nfunction scoreFrontier(\n\tfrontier: readonly string[],\n\tbyKey: Map<string, ThoughtData>\n): ScoredCandidate[] {\n\tconst out: ScoredCandidate[] = [];\n\tfor (const id of frontier) {\n\t\tconst t = byKey.get(id);\n\t\tif (t !== undefined) out.push({ id, score: scoreThought(t) });\n\t}\n\treturn out;\n}\n\n/** Highest score in a candidate set, or `-Infinity` when empty. */\nfunction bestScore(scored: readonly ScoredCandidate[]): number {\n\tlet best = Number.NEGATIVE_INFINITY;\n\tfor (const c of scored) {\n\t\tif (c.score > best) best = c.score;\n\t}\n\treturn best;\n}\n\n/** Recent per-thought scores, used for plateau detection. */\nfunction recentScores(history: readonly ThoughtData[], window: number): number[] {\n\tconst start = history.length > window ? history.length - window : 0;\n\tconst out: number[] = [];\n\tfor (let i = start; i < history.length; i++) out.push(scoreThought(history[i]!));\n\treturn out;\n}\n\n/**\n * Tree-of-Thought strategy: beam search over the thought DAG. Pure policy.\n *\n * @example\n * ```typescript\n * const strategy = new TreeOfThoughtStrategy({ beamWidth: 4 });\n * const decision = strategy.decide(ctx);\n * ```\n */\nexport class TreeOfThoughtStrategy implements IReasoningStrategy {\n\treadonly name = 'tot' as const;\n\n\t/** @param config - See {@link TotConfig}. */\n\tconstructor(config?: TotConfig) {\n\t\tCONFIGS.set(this, { ...DEFAULTS, ...(config ?? {}) });\n\t}\n\n\t/**\n\t * Compute the next action for the chain.\n\t *\n\t * Order of checks: termination by confidence → termination by plateau →\n\t * branch when the current thought is outside the beam → continue.\n\t */\n\tdecide(ctx: StrategyContext): StrategyDecision {\n\t\tconst cfg = configOf(this);\n\t\tif (!ctx.graph) {\n\t\t\treturn { action: 'continue' };\n\t\t}\n\t\tconst frontier = ctx.graph.leaves(ctx.sessionId);\n\t\tconst byKey = indexHistory(ctx.history);\n\t\tconst scored = scoreFrontier(frontier, byKey);\n\t\tif (scored.length > 0 && bestScore(scored) >= cfg.terminationConfidence) {\n\t\t\treturn { action: 'terminate', reason: 'confidence threshold' };\n\t\t}\n\n\t\tconst recent = recentScores(ctx.history, cfg.plateauWindow);\n\t\tif (detectPlateau(recent, cfg.plateauWindow, cfg.plateauEpsilon)) {\n\t\t\treturn { action: 'terminate', reason: 'plateau' };\n\t\t}\n\n\t\tif (scored.length > cfg.beamWidth) {\n\t\t\tconst beam = selectBeam(scored, cfg.beamWidth);\n\t\t\tconst currentKey = thoughtKey(ctx.currentThought);\n\t\t\tif (!beam.includes(currentKey)) {\n\t\t\t\treturn {\n\t\t\t\t\taction: 'branch',\n\t\t\t\t\tbranchId: `tot-${ctx.currentThought.thought_number}`,\n\t\t\t\t\tfromThought: ctx.currentThought.thought_number,\n\t\t\t\t\treason: 'outside beam',\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn { action: 'continue', nextHint: 'explore frontier' };\n\t}\n\n\t/** True when the frontier is wider than the beam (diverse exploration). */\n\tshouldBranch(ctx: StrategyContext): boolean {\n\t\tconst cfg = configOf(this);\n\t\tif (!ctx.graph) return false;\n\t\tconst frontier = ctx.graph.leaves(ctx.sessionId);\n\t\treturn frontier.length > cfg.beamWidth;\n\t}\n\n\t/** True when the best frontier score crosses the threshold OR scores plateau. */\n\tshouldTerminate(ctx: StrategyContext): boolean {\n\t\tconst cfg = configOf(this);\n\t\tif (!ctx.graph) return false;\n\t\tconst frontier = ctx.graph.leaves(ctx.sessionId);\n\t\tconst byKey = indexHistory(ctx.history);\n\t\tconst scored = scoreFrontier(frontier, byKey);\n\t\tif (scored.length > 0 && bestScore(scored) >= cfg.terminationConfidence) {\n\t\t\treturn true;\n\t\t}\n\t\tconst recent = recentScores(ctx.history, cfg.plateauWindow);\n\t\treturn detectPlateau(recent, cfg.plateauWindow, cfg.plateauEpsilon);\n\t}\n}\n"],"names":["DEFAULTS","CONFIGS","WeakMap","configOf","s","thoughtKey","t","String","indexHistory","history","out","Map","scoreFrontier","frontier","byKey","id","undefined","scoreThought","bestScore","scored","best","Number","c","recentScores","window","start","i","TreeOfThoughtStrategy","config","ctx","cfg","recent","detectPlateau","beam","selectBeam","currentKey"],"mappings":";;AA2CA,MAAMA,WAAgC;IACrC,WAAW;IACX,UAAU;IACV,uBAAuB;IACvB,eAAe;IACf,gBAAgB;AACjB;AAMA,MAAMC,UAA+D,IAAIC;AAGzE,SAASC,SAASC,CAAwB;IACzC,OAAOH,QAAQ,GAAG,CAACG,MAAMJ;AAC1B;AAGA,SAASK,WAAWC,CAAc;IACjC,OAAOA,EAAE,EAAE,IAAIC,OAAOD,EAAE,cAAc;AACvC;AAGA,SAASE,aAAaC,OAA+B;IACpD,MAAMC,MAAM,IAAIC;IAChB,KAAK,MAAML,KAAKG,QAASC,IAAI,GAAG,CAACL,WAAWC,IAAIA;IAChD,OAAOI;AACR;AAGA,SAASE,cACRC,QAA2B,EAC3BC,KAA+B;IAE/B,MAAMJ,MAAyB,EAAE;IACjC,KAAK,MAAMK,MAAMF,SAAU;QAC1B,MAAMP,IAAIQ,MAAM,GAAG,CAACC;QACpB,IAAIT,AAAMU,WAANV,GAAiBI,IAAI,IAAI,CAAC;YAAEK;YAAI,OAAOE,aAAaX;QAAG;IAC5D;IACA,OAAOI;AACR;AAGA,SAASQ,UAAUC,MAAkC;IACpD,IAAIC,OAAOC,MAAwB;IACnC,KAAK,MAAMC,KAAKH,OACf,IAAIG,EAAE,KAAK,GAAGF,MAAMA,OAAOE,EAAE,KAAK;IAEnC,OAAOF;AACR;AAGA,SAASG,aAAad,OAA+B,EAAEe,MAAc;IACpE,MAAMC,QAAQhB,QAAQ,MAAM,GAAGe,SAASf,QAAQ,MAAM,GAAGe,SAAS;IAClE,MAAMd,MAAgB,EAAE;IACxB,IAAK,IAAIgB,IAAID,OAAOC,IAAIjB,QAAQ,MAAM,EAAEiB,IAAKhB,IAAI,IAAI,CAACO,aAAaR,OAAO,CAACiB,EAAE;IAC7E,OAAOhB;AACR;AAWO,MAAMiB;IACH,OAAO,MAAe;IAG/B,YAAYC,MAAkB,CAAE;QAC/B3B,QAAQ,GAAG,CAAC,IAAI,EAAE;YAAE,GAAGD,QAAQ;YAAE,GAAI4B,UAAU,CAAC,CAAC;QAAE;IACpD;IAQA,OAAOC,GAAoB,EAAoB;QAC9C,MAAMC,MAAM3B,SAAS,IAAI;QACzB,IAAI,CAAC0B,IAAI,KAAK,EACb,OAAO;YAAE,QAAQ;QAAW;QAE7B,MAAMhB,WAAWgB,IAAI,KAAK,CAAC,MAAM,CAACA,IAAI,SAAS;QAC/C,MAAMf,QAAQN,aAAaqB,IAAI,OAAO;QACtC,MAAMV,SAASP,cAAcC,UAAUC;QACvC,IAAIK,OAAO,MAAM,GAAG,KAAKD,UAAUC,WAAWW,IAAI,qBAAqB,EACtE,OAAO;YAAE,QAAQ;YAAa,QAAQ;QAAuB;QAG9D,MAAMC,SAASR,aAAaM,IAAI,OAAO,EAAEC,IAAI,aAAa;QAC1D,IAAIE,cAAcD,QAAQD,IAAI,aAAa,EAAEA,IAAI,cAAc,GAC9D,OAAO;YAAE,QAAQ;YAAa,QAAQ;QAAU;QAGjD,IAAIX,OAAO,MAAM,GAAGW,IAAI,SAAS,EAAE;YAClC,MAAMG,OAAOC,WAAWf,QAAQW,IAAI,SAAS;YAC7C,MAAMK,aAAa9B,WAAWwB,IAAI,cAAc;YAChD,IAAI,CAACI,KAAK,QAAQ,CAACE,aAClB,OAAO;gBACN,QAAQ;gBACR,UAAU,CAAC,IAAI,EAAEN,IAAI,cAAc,CAAC,cAAc,EAAE;gBACpD,aAAaA,IAAI,cAAc,CAAC,cAAc;gBAC9C,QAAQ;YACT;QAEF;QAEA,OAAO;YAAE,QAAQ;YAAY,UAAU;QAAmB;IAC3D;IAGA,aAAaA,GAAoB,EAAW;QAC3C,MAAMC,MAAM3B,SAAS,IAAI;QACzB,IAAI,CAAC0B,IAAI,KAAK,EAAE,OAAO;QACvB,MAAMhB,WAAWgB,IAAI,KAAK,CAAC,MAAM,CAACA,IAAI,SAAS;QAC/C,OAAOhB,SAAS,MAAM,GAAGiB,IAAI,SAAS;IACvC;IAGA,gBAAgBD,GAAoB,EAAW;QAC9C,MAAMC,MAAM3B,SAAS,IAAI;QACzB,IAAI,CAAC0B,IAAI,KAAK,EAAE,OAAO;QACvB,MAAMhB,WAAWgB,IAAI,KAAK,CAAC,MAAM,CAACA,IAAI,SAAS;QAC/C,MAAMf,QAAQN,aAAaqB,IAAI,OAAO;QACtC,MAAMV,SAASP,cAAcC,UAAUC;QACvC,IAAIK,OAAO,MAAM,GAAG,KAAKD,UAAUC,WAAWW,IAAI,qBAAqB,EACtE,OAAO;QAER,MAAMC,SAASR,aAAaM,IAAI,OAAO,EAAEC,IAAI,aAAa;QAC1D,OAAOE,cAAcD,QAAQD,IAAI,aAAa,EAAEA,IAAI,cAAc;IACnE;AACD"}
+{"version":3,"file":"core/reasoning/strategies/TreeOfThoughtStrategy.js","sources":["../../../../src/core/reasoning/strategies/TreeOfThoughtStrategy.ts"],"sourcesContent":["/**\n * Tree-of-Thought reasoning strategy — beam search over the thought DAG.\n *\n * Observes the frontier (graph leaves), scores each leaf via\n * {@link scoreThought}, and decides whether to continue, branch (when the\n * current thought falls outside the beam), or terminate (on depth cap,\n * confidence threshold, or score plateau).\n *\n * Pure policy: configuration lives in a module-level {@link WeakMap}, not\n * on the instance, so `Object.getOwnPropertyNames(strategy)` only ever\n * surfaces the readonly `name` discriminator. All other state is derived\n * from the {@link StrategyContext} on every call.\n *\n * @module core/reasoning/strategies/TreeOfThoughtStrategy\n */\n\nimport type {\n\tIReasoningStrategy,\n\tStrategyContext,\n\tStrategyDecision,\n} from '../../../contracts/strategy.js';\nimport { asThoughtId, type ThoughtId } from '../../../contracts/ids.js';\nimport type { ThoughtData } from '../../thought.js';\nimport { scoreThought, selectBeam, type ScoredCandidate } from './totScoring.js';\nimport { detectPlateau } from './plateau.js';\n\n/**\n * Configuration knobs for {@link TreeOfThoughtStrategy}. All fields are\n * optional; defaults are applied in the constructor.\n */\nexport interface TotConfig {\n\t/** Top-K candidates kept on the frontier (default `3`). */\n\treadonly beamWidth?: number;\n\t/** Maximum exploration depth before forcing termination (default `8`). */\n\treadonly depthCap?: number;\n\t/** Score at/above which the chain terminates (default `0.85`). */\n\treadonly terminationConfidence?: number;\n\t/** Window size for plateau detection (default `3`). */\n\treadonly plateauWindow?: number;\n\t/** Minimum meaningful score change for plateau detection (default `0.02`). */\n\treadonly plateauEpsilon?: number;\n}\n\n/** Defaults applied when a {@link TotConfig} field is omitted. */\nconst DEFAULTS: Required<TotConfig> = {\n\tbeamWidth: 3,\n\tdepthCap: 8,\n\tterminationConfidence: 0.85,\n\tplateauWindow: 3,\n\tplateauEpsilon: 0.02,\n};\n\n/**\n * Module-private config storage. Keyed by strategy instance so that no\n * own-properties leak onto `this` (preserving the purity contract).\n */\nconst CONFIGS: WeakMap<TreeOfThoughtStrategy, Required<TotConfig>> = new WeakMap();\n\n/** Resolve the per-instance config (constructor always populates the map). */\nfunction configOf(s: TreeOfThoughtStrategy): Required<TotConfig> {\n\treturn CONFIGS.get(s) ?? DEFAULTS;\n}\n\n/** Stable identifier for a thought: `id` if present, else its sequence number. */\nfunction thoughtKey(t: ThoughtData): ThoughtId {\n\treturn t.id ?? asThoughtId(String(t.thought_number));\n}\n\n/** Index history by stable key for O(1) leaf-id → ThoughtData lookup. */\nfunction indexHistory(history: readonly ThoughtData[]): Map<string, ThoughtData> {\n\tconst out = new Map<string, ThoughtData>();\n\tfor (const t of history) out.set(thoughtKey(t), t);\n\treturn out;\n}\n\n/** Score the frontier (graph leaves), skipping ids absent from history. */\nfunction scoreFrontier(\n\tfrontier: readonly string[],\n\tbyKey: Map<string, ThoughtData>\n): ScoredCandidate[] {\n\tconst out: ScoredCandidate[] = [];\n\tfor (const id of frontier) {\n\t\tconst t = byKey.get(id);\n\t\tif (t !== undefined) out.push({ id, score: scoreThought(t) });\n\t}\n\treturn out;\n}\n\n/** Highest score in a candidate set, or `-Infinity` when empty. */\nfunction bestScore(scored: readonly ScoredCandidate[]): number {\n\tlet best = Number.NEGATIVE_INFINITY;\n\tfor (const c of scored) {\n\t\tif (c.score > best) best = c.score;\n\t}\n\treturn best;\n}\n\n/** Recent per-thought scores, used for plateau detection. */\nfunction recentScores(history: readonly ThoughtData[], window: number): number[] {\n\tconst start = history.length > window ? history.length - window : 0;\n\tconst out: number[] = [];\n\tfor (let i = start; i < history.length; i++) out.push(scoreThought(history[i]!));\n\treturn out;\n}\n\n/** Whether the current graph-visible thought has reached the configured depth cap. */\nfunction isAtDepthCap(ctx: StrategyContext, depthCap: number): boolean {\n\tconst depth = ctx.graph?.depthFromRoots(ctx.sessionId, thoughtKey(ctx.currentThought));\n\treturn depth !== undefined && depth >= depthCap;\n}\n\n/**\n * Tree-of-Thought strategy: beam search over the thought DAG. Pure policy.\n *\n * @example\n * ```typescript\n * const strategy = new TreeOfThoughtStrategy({ beamWidth: 4 });\n * const decision = strategy.decide(ctx);\n * ```\n */\nexport class TreeOfThoughtStrategy implements IReasoningStrategy {\n\treadonly name = 'tot' as const;\n\n\t/** @param config - See {@link TotConfig}. */\n\tconstructor(config?: TotConfig) {\n\t\tconst depthCap = config?.depthCap ?? DEFAULTS.depthCap;\n\t\tif (!Number.isFinite(depthCap) || !Number.isInteger(depthCap) || depthCap < 0) {\n\t\t\tthrow new TypeError('depthCap must be a finite nonnegative integer');\n\t\t}\n\t\tCONFIGS.set(this, { ...DEFAULTS, ...config, depthCap });\n\t}\n\n\t/**\n\t * Compute the next action for the chain.\n\t *\n\t * Order of checks: depth cap → confidence → plateau → branch when the\n\t * current thought is outside the beam → continue. Missing graphs continue.\n\t */\n\tdecide(ctx: StrategyContext): StrategyDecision {\n\t\tconst cfg = configOf(this);\n\t\tif (!ctx.graph) {\n\t\t\treturn { action: 'continue' };\n\t\t}\n\t\tif (isAtDepthCap(ctx, cfg.depthCap)) {\n\t\t\treturn { action: 'terminate', reason: 'depth cap' };\n\t\t}\n\t\tconst frontier = ctx.graph.leaves(ctx.sessionId);\n\t\tconst byKey = indexHistory(ctx.history);\n\t\tconst scored = scoreFrontier(frontier, byKey);\n\t\tif (scored.length > 0 && bestScore(scored) >= cfg.terminationConfidence) {\n\t\t\treturn { action: 'terminate', reason: 'confidence threshold' };\n\t\t}\n\n\t\tconst recent = recentScores(ctx.history, cfg.plateauWindow);\n\t\tif (detectPlateau(recent, cfg.plateauWindow, cfg.plateauEpsilon)) {\n\t\t\treturn { action: 'terminate', reason: 'plateau' };\n\t\t}\n\n\t\tif (scored.length > cfg.beamWidth) {\n\t\t\tconst beam = selectBeam(scored, cfg.beamWidth);\n\t\t\tconst currentKey = thoughtKey(ctx.currentThought);\n\t\t\tif (!beam.includes(currentKey)) {\n\t\t\t\treturn {\n\t\t\t\t\taction: 'branch',\n\t\t\t\t\tbranchId: `tot-${ctx.currentThought.thought_number}`,\n\t\t\t\t\tfromThought: ctx.currentThought.thought_number,\n\t\t\t\t\treason: 'outside beam',\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn { action: 'continue', nextHint: 'explore frontier' };\n\t}\n\n\t/** True below the depth cap when the frontier is wider than the beam. */\n\tshouldBranch(ctx: StrategyContext): boolean {\n\t\tconst cfg = configOf(this);\n\t\tif (!ctx.graph) return false;\n\t\tif (isAtDepthCap(ctx, cfg.depthCap)) return false;\n\t\tconst frontier = ctx.graph.leaves(ctx.sessionId);\n\t\treturn frontier.length > cfg.beamWidth;\n\t}\n\n\t/** True at the depth cap, confidence threshold, or score plateau. */\n\tshouldTerminate(ctx: StrategyContext): boolean {\n\t\tconst cfg = configOf(this);\n\t\tif (!ctx.graph) return false;\n\t\tif (isAtDepthCap(ctx, cfg.depthCap)) return true;\n\t\tconst frontier = ctx.graph.leaves(ctx.sessionId);\n\t\tconst byKey = indexHistory(ctx.history);\n\t\tconst scored = scoreFrontier(frontier, byKey);\n\t\tif (scored.length > 0 && bestScore(scored) >= cfg.terminationConfidence) {\n\t\t\treturn true;\n\t\t}\n\t\tconst recent = recentScores(ctx.history, cfg.plateauWindow);\n\t\treturn detectPlateau(recent, cfg.plateauWindow, cfg.plateauEpsilon);\n\t}\n}\n"],"names":["DEFAULTS","CONFIGS","WeakMap","configOf","s","thoughtKey","t","asThoughtId","String","indexHistory","history","out","Map","scoreFrontier","frontier","byKey","id","undefined","scoreThought","bestScore","scored","best","Number","c","recentScores","window","start","i","isAtDepthCap","ctx","depthCap","depth","TreeOfThoughtStrategy","config","TypeError","cfg","recent","detectPlateau","beam","selectBeam","currentKey"],"mappings":";;;AA4CA,MAAMA,WAAgC;IACrC,WAAW;IACX,UAAU;IACV,uBAAuB;IACvB,eAAe;IACf,gBAAgB;AACjB;AAMA,MAAMC,UAA+D,IAAIC;AAGzE,SAASC,SAASC,CAAwB;IACzC,OAAOH,QAAQ,GAAG,CAACG,MAAMJ;AAC1B;AAGA,SAASK,WAAWC,CAAc;IACjC,OAAOA,EAAE,EAAE,IAAIC,YAAYC,OAAOF,EAAE,cAAc;AACnD;AAGA,SAASG,aAAaC,OAA+B;IACpD,MAAMC,MAAM,IAAIC;IAChB,KAAK,MAAMN,KAAKI,QAASC,IAAI,GAAG,CAACN,WAAWC,IAAIA;IAChD,OAAOK;AACR;AAGA,SAASE,cACRC,QAA2B,EAC3BC,KAA+B;IAE/B,MAAMJ,MAAyB,EAAE;IACjC,KAAK,MAAMK,MAAMF,SAAU;QAC1B,MAAMR,IAAIS,MAAM,GAAG,CAACC;QACpB,IAAIV,AAAMW,WAANX,GAAiBK,IAAI,IAAI,CAAC;YAAEK;YAAI,OAAOE,aAAaZ;QAAG;IAC5D;IACA,OAAOK;AACR;AAGA,SAASQ,UAAUC,MAAkC;IACpD,IAAIC,OAAOC,MAAwB;IACnC,KAAK,MAAMC,KAAKH,OACf,IAAIG,EAAE,KAAK,GAAGF,MAAMA,OAAOE,EAAE,KAAK;IAEnC,OAAOF;AACR;AAGA,SAASG,aAAad,OAA+B,EAAEe,MAAc;IACpE,MAAMC,QAAQhB,QAAQ,MAAM,GAAGe,SAASf,QAAQ,MAAM,GAAGe,SAAS;IAClE,MAAMd,MAAgB,EAAE;IACxB,IAAK,IAAIgB,IAAID,OAAOC,IAAIjB,QAAQ,MAAM,EAAEiB,IAAKhB,IAAI,IAAI,CAACO,aAAaR,OAAO,CAACiB,EAAE;IAC7E,OAAOhB;AACR;AAGA,SAASiB,aAAaC,GAAoB,EAAEC,QAAgB;IAC3D,MAAMC,QAAQF,IAAI,KAAK,EAAE,eAAeA,IAAI,SAAS,EAAExB,WAAWwB,IAAI,cAAc;IACpF,OAAOE,AAAUd,WAAVc,SAAuBA,SAASD;AACxC;AAWO,MAAME;IACH,OAAO,MAAe;IAG/B,YAAYC,MAAkB,CAAE;QAC/B,MAAMH,WAAWG,QAAQ,YAAYjC,SAAS,QAAQ;QACtD,IAAI,CAACsB,OAAO,QAAQ,CAACQ,aAAa,CAACR,OAAO,SAAS,CAACQ,aAAaA,WAAW,GAC3E,MAAM,IAAII,UAAU;QAErBjC,QAAQ,GAAG,CAAC,IAAI,EAAE;YAAE,GAAGD,QAAQ;YAAE,GAAGiC,MAAM;YAAEH;QAAS;IACtD;IAQA,OAAOD,GAAoB,EAAoB;QAC9C,MAAMM,MAAMhC,SAAS,IAAI;QACzB,IAAI,CAAC0B,IAAI,KAAK,EACb,OAAO;YAAE,QAAQ;QAAW;QAE7B,IAAID,aAAaC,KAAKM,IAAI,QAAQ,GACjC,OAAO;YAAE,QAAQ;YAAa,QAAQ;QAAY;QAEnD,MAAMrB,WAAWe,IAAI,KAAK,CAAC,MAAM,CAACA,IAAI,SAAS;QAC/C,MAAMd,QAAQN,aAAaoB,IAAI,OAAO;QACtC,MAAMT,SAASP,cAAcC,UAAUC;QACvC,IAAIK,OAAO,MAAM,GAAG,KAAKD,UAAUC,WAAWe,IAAI,qBAAqB,EACtE,OAAO;YAAE,QAAQ;YAAa,QAAQ;QAAuB;QAG9D,MAAMC,SAASZ,aAAaK,IAAI,OAAO,EAAEM,IAAI,aAAa;QAC1D,IAAIE,cAAcD,QAAQD,IAAI,aAAa,EAAEA,IAAI,cAAc,GAC9D,OAAO;YAAE,QAAQ;YAAa,QAAQ;QAAU;QAGjD,IAAIf,OAAO,MAAM,GAAGe,IAAI,SAAS,EAAE;YAClC,MAAMG,OAAOC,WAAWnB,QAAQe,IAAI,SAAS;YAC7C,MAAMK,aAAanC,WAAWwB,IAAI,cAAc;YAChD,IAAI,CAACS,KAAK,QAAQ,CAACE,aAClB,OAAO;gBACN,QAAQ;gBACR,UAAU,CAAC,IAAI,EAAEX,IAAI,cAAc,CAAC,cAAc,EAAE;gBACpD,aAAaA,IAAI,cAAc,CAAC,cAAc;gBAC9C,QAAQ;YACT;QAEF;QAEA,OAAO;YAAE,QAAQ;YAAY,UAAU;QAAmB;IAC3D;IAGA,aAAaA,GAAoB,EAAW;QAC3C,MAAMM,MAAMhC,SAAS,IAAI;QACzB,IAAI,CAAC0B,IAAI,KAAK,EAAE,OAAO;QACvB,IAAID,aAAaC,KAAKM,IAAI,QAAQ,GAAG,OAAO;QAC5C,MAAMrB,WAAWe,IAAI,KAAK,CAAC,MAAM,CAACA,IAAI,SAAS;QAC/C,OAAOf,SAAS,MAAM,GAAGqB,IAAI,SAAS;IACvC;IAGA,gBAAgBN,GAAoB,EAAW;QAC9C,MAAMM,MAAMhC,SAAS,IAAI;QACzB,IAAI,CAAC0B,IAAI,KAAK,EAAE,OAAO;QACvB,IAAID,aAAaC,KAAKM,IAAI,QAAQ,GAAG,OAAO;QAC5C,MAAMrB,WAAWe,IAAI,KAAK,CAAC,MAAM,CAACA,IAAI,SAAS;QAC/C,MAAMd,QAAQN,aAAaoB,IAAI,OAAO;QACtC,MAAMT,SAASP,cAAcC,UAAUC;QACvC,IAAIK,OAAO,MAAM,GAAG,KAAKD,UAAUC,WAAWe,IAAI,qBAAqB,EACtE,OAAO;QAER,MAAMC,SAASZ,aAAaK,IAAI,OAAO,EAAEM,IAAI,aAAa;QAC1D,OAAOE,cAAcD,QAAQD,IAAI,aAAa,EAAEA,IAAI,cAAc;IACnE;AACD"}

package/dist/core/reasoning/strategies/totScoring.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"totScoring.d.ts","sourceRoot":"","sources":["../../../../src/core/reasoning/strategies/totScoring.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,KAAK,EAAE,SAAS,EAAa,MAAM,2BAA2B,CAAC;AAYtE;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACvB;AAuCD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAQnD;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,UAAU,CACzB,UAAU,EAAE,SAAS,eAAe,EAAE,EACtC,KAAK,EAAE,MAAM,GACX,SAAS,MAAM,EAAE,CAcnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,oBAAoB,CACnC,KAAK,EAAE,SAAS,EAChB,SAAS,EAAE,SAAS,EACpB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,QAAQ,EAAE,MAAM,GACd,SAAS,MAAM,EAAE,CAqDnB"}
+{"version":3,"file":"totScoring.d.ts","sourceRoot":"","sources":["../../../../src/core/reasoning/strategies/totScoring.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAGpD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,KAAK,EAAE,SAAS,EAAa,MAAM,2BAA2B,CAAC;AAYtE;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACvB;AAuCD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAQnD;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,UAAU,CACzB,UAAU,EAAE,SAAS,eAAe,EAAE,EACtC,KAAK,EAAE,MAAM,GACX,SAAS,MAAM,EAAE,CAcnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,oBAAoB,CACnC,KAAK,EAAE,SAAS,EAChB,SAAS,EAAE,SAAS,EACpB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,QAAQ,EAAE,MAAM,GACd,SAAS,MAAM,EAAE,CAqDnB"}

package/dist/core/reasoning/strategies/totScoring.js.map

@@ -1 +1 @@
-{"version":3,"file":"core/reasoning/strategies/totScoring.js","sources":["../../../../src/core/reasoning/strategies/totScoring.ts"],"sourcesContent":["/**\n * Tree-of-Thought scoring helpers — pure functions for ranking and frontier\n * exploration over the thought DAG.\n *\n * This module exposes three primitives used by the ToT strategy:\n *\n * - {@link scoreThought}: combine confidence and quality into a [0, 1] score.\n * - {@link selectBeam}: pick the top-K candidates with deterministic tiebreaks.\n * - {@link breadthFirstFrontier}: BFS from roots, returning leaves of the\n *   explored subgraph capped by depth.\n *\n * All functions are pure: no I/O, no mutable module state, no DI.\n *\n * @module core/reasoning/strategies/totScoring\n */\n\nimport type { ThoughtData } from '../../thought.js';\nimport type { ConfidenceSignals, ThoughtType } from '../../reasoning.js';\nimport type { GraphView } from '../../graph/GraphView.js';\nimport type { SessionId, ThoughtId } from '../../../contracts/ids.js';\nimport { assertNever } from '../../../utils.js';\n\n/**\n * Optional `confidence_signals` carried alongside a thought. The core\n * `ThoughtData` type does not declare this field, but evaluator output may\n * be attached by callers that want calibrated scoring.\n */\ntype ThoughtWithSignals = ThoughtData & {\n\treadonly confidence_signals?: ConfidenceSignals;\n};\n\n/**\n * A scored candidate suitable for {@link selectBeam}.\n */\nexport interface ScoredCandidate {\n\treadonly id: string;\n\treadonly score: number;\n}\n\n/**\n * Per-type score multiplier applied on top of the base confidence×quality score.\n *\n * Weights bias the ToT frontier towards productive thought kinds:\n * - `assumption` (0.5): low confidence until backed by verification.\n * - `decomposition` (1.2): encouraged for problem-splitting.\n * - `backtrack` (0.8): signals exploration but not preferred.\n * - `tool_call` / `tool_observation` (1.0): neutral exogenous information.\n * - All other types (regular, hypothesis, verification, critique, synthesis, meta): 1.0.\n *\n * Pure function: deterministic, no I/O.\n */\nfunction getTypeWeight(type: ThoughtType | undefined): number {\n\tif (type === undefined) return 1.0;\n\tswitch (type) {\n\t\tcase 'assumption':\n\t\t\treturn 0.5;\n\t\tcase 'decomposition':\n\t\t\treturn 1.2;\n\t\tcase 'backtrack':\n\t\t\treturn 0.8;\n\t\tcase 'tool_call':\n\t\t\treturn 1.0;\n\t\tcase 'tool_observation':\n\t\t\treturn 1.0;\n\t\tcase 'regular':\n\t\tcase 'hypothesis':\n\t\tcase 'verification':\n\t\tcase 'critique':\n\t\tcase 'synthesis':\n\t\tcase 'meta':\n\t\t\treturn 1.0;\n\t\tdefault:\n\t\t\treturn assertNever(type);\n\t}\n}\n\n/**\n * Score a thought by combining its (calibrated) confidence with its\n * self-assessed quality, then applying a per-type weight.\n *\n * Formula: `(calibrated_confidence ?? confidence ?? 0) * (quality_score ?? 0.5) * typeWeight(thought_type)`\n *\n * The `calibrated_confidence` (when present on `confidence_signals`) is\n * preferred over the raw `confidence` field. The result is clamped to the\n * inclusive range `[0, 1]`.\n *\n * @param t - The thought to score.\n * @returns A score in `[0, 1]`.\n *\n * @example\n * ```typescript\n * const s = scoreThought({ ...base, confidence: 0.8, quality_score: 0.5 });\n * // s === 0.4\n * ```\n */\nexport function scoreThought(t: ThoughtData): number {\n\tconst calibrated = (t as ThoughtWithSignals).confidence_signals?.calibrated_confidence;\n\tconst confidence = calibrated ?? t.confidence ?? 0;\n\tconst quality = t.quality_score ?? 0.5;\n\tconst raw = confidence * quality * getTypeWeight(t.thought_type);\n\tif (raw < 0) return 0;\n\tif (raw > 1) return 1;\n\treturn raw;\n}\n\n/**\n * Select the top-`width` candidates by score, descending.\n *\n * Sorting is stable and deterministic: ties on `score` are broken by\n * lexicographic comparison of `id` (ascending). When `width >= candidates.length`\n * all candidates are returned in sorted order. When `width <= 0` the result\n * is empty.\n *\n * @param candidates - Scored candidates (input is not mutated).\n * @param width - Beam width (top-K).\n * @returns Selected ids in descending score order.\n *\n * @example\n * ```typescript\n * const top = selectBeam([{ id: 'a', score: 0.1 }, { id: 'b', score: 0.9 }], 1);\n * // top === ['b']\n * ```\n */\nexport function selectBeam(\n\tcandidates: readonly ScoredCandidate[],\n\twidth: number\n): readonly string[] {\n\tif (width <= 0 || candidates.length === 0) {\n\t\treturn [];\n\t}\n\tconst sorted = [...candidates].sort((a, b) => {\n\t\tif (b.score !== a.score) return b.score - a.score;\n\t\treturn a.id < b.id ? -1 : 1;\n\t});\n\tconst k = width >= sorted.length ? sorted.length : width;\n\tconst result: string[] = [];\n\tfor (let i = 0; i < k; i++) {\n\t\tresult.push(sorted[i]!.id);\n\t}\n\treturn result;\n}\n\n/**\n * Compute the BFS frontier reachable from `roots` within `depthCap` levels.\n *\n * Traverses outgoing edges via `graph.descendants(sessionId, id, 1)`. The returned\n * set contains the *leaves* of the explored subgraph — nodes that either\n * (a) sit at the depth cap, or (b) have no outgoing edges within the\n * explored region.\n *\n * Special cases:\n * - `depthCap === 0` returns the unique roots in input order.\n * - empty `roots` returns an empty array.\n *\n * Each node is visited at most once, so cycles cannot cause infinite loops.\n *\n * @param graph - Read-only graph view.\n * @param sessionId - Session scoping the traversal.\n * @param roots - Starting thought ids.\n * @param depthCap - Maximum BFS depth (0 = roots only).\n * @returns Frontier (leaf) thought ids of the explored subgraph.\n *\n * @example\n * ```typescript\n * const frontier = breadthFirstFrontier(view, 's1', ['root'], 2);\n * ```\n */\nexport function breadthFirstFrontier(\n\tgraph: GraphView,\n\tsessionId: SessionId,\n\troots: readonly string[],\n\tdepthCap: number\n): readonly string[] {\n\tif (roots.length === 0) {\n\t\treturn [];\n\t}\n\tconst uniqueRoots: string[] = [];\n\tconst seenRoots = new Set<string>();\n\tfor (const r of roots) {\n\t\tif (!seenRoots.has(r)) {\n\t\t\tseenRoots.add(r);\n\t\t\tuniqueRoots.push(r);\n\t\t}\n\t}\n\tif (depthCap <= 0) {\n\t\treturn uniqueRoots;\n\t}\n\n\tconst visited = new Set<string>(uniqueRoots);\n\tlet frontier: string[] = [...uniqueRoots];\n\tlet depth = 0;\n\n\twhile (frontier.length > 0 && depth < depthCap) {\n\t\tconst next: string[] = [];\n\t\tfor (const node of frontier) {\n\t\t\tfor (const child of graph.descendants(sessionId, node as ThoughtId, 1)) {\n\t\t\t\tif (visited.has(child)) continue;\n\t\t\t\tvisited.add(child);\n\t\t\t\tnext.push(child);\n\t\t\t}\n\t\t}\n\t\tfrontier = next;\n\t\tdepth++;\n\t}\n\n\tconst explored = visited;\n\tconst leaves: string[] = [];\n\tconst seenLeaf = new Set<string>();\n\tconst collect = (id: string): void => {\n\t\tseenLeaf.add(id);\n\t\tleaves.push(id);\n\t};\n\n\tif (depth >= depthCap && frontier.length > 0) {\n\t\t// Hit the depth cap — current frontier is leaves regardless of children.\n\t\tfor (const id of frontier) collect(id);\n\t}\n\t// Any explored node with no outgoing edges inside the explored set is also\n\t// a leaf (covers nodes shallower than depthCap that terminated naturally).\n\tfor (const id of explored) {\n\t\tif (seenLeaf.has(id)) continue;\n\t\tconst children = graph.descendants(sessionId, id as ThoughtId, 1);\n\t\tif (children.length === 0) collect(id);\n\t}\n\treturn leaves;\n}\n"],"names":["getTypeWeight","type","undefined","assertNever","scoreThought","t","calibrated","confidence","quality","raw","selectBeam","candidates","width","sorted","a","b","k","result","i","breadthFirstFrontier","graph","sessionId","roots","depthCap","uniqueRoots","seenRoots","Set","r","visited","frontier","depth","next","node","child","explored","leaves","seenLeaf","collect","id","children"],"mappings":";AAmDA,SAASA,cAAcC,IAA6B;IACnD,IAAIA,AAASC,WAATD,MAAoB,OAAO;IAC/B,OAAQA;QACP,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;YACJ,OAAO;QACR;YACC,OAAOE,YAAYF;IACrB;AACD;AAqBO,SAASG,aAAaC,CAAc;IAC1C,MAAMC,aAAcD,EAAyB,kBAAkB,EAAE;IACjE,MAAME,aAAaD,cAAcD,EAAE,UAAU,IAAI;IACjD,MAAMG,UAAUH,EAAE,aAAa,IAAI;IACnC,MAAMI,MAAMF,aAAaC,UAAUR,cAAcK,EAAE,YAAY;IAC/D,IAAII,MAAM,GAAG,OAAO;IACpB,IAAIA,MAAM,GAAG,OAAO;IACpB,OAAOA;AACR;AAoBO,SAASC,WACfC,UAAsC,EACtCC,KAAa;IAEb,IAAIA,SAAS,KAAKD,AAAsB,MAAtBA,WAAW,MAAM,EAClC,OAAO,EAAE;IAEV,MAAME,SAAS;WAAIF;KAAW,CAAC,IAAI,CAAC,CAACG,GAAGC;QACvC,IAAIA,EAAE,KAAK,KAAKD,EAAE,KAAK,EAAE,OAAOC,EAAE,KAAK,GAAGD,EAAE,KAAK;QACjD,OAAOA,EAAE,EAAE,GAAGC,EAAE,EAAE,GAAG,KAAK;IAC3B;IACA,MAAMC,IAAIJ,SAASC,OAAO,MAAM,GAAGA,OAAO,MAAM,GAAGD;IACnD,MAAMK,SAAmB,EAAE;IAC3B,IAAK,IAAIC,IAAI,GAAGA,IAAIF,GAAGE,IACtBD,OAAO,IAAI,CAACJ,MAAM,CAACK,EAAE,CAAE,EAAE;IAE1B,OAAOD;AACR;AA2BO,SAASE,qBACfC,KAAgB,EAChBC,SAAoB,EACpBC,KAAwB,EACxBC,QAAgB;IAEhB,IAAID,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;IAEV,MAAME,cAAwB,EAAE;IAChC,MAAMC,YAAY,IAAIC;IACtB,KAAK,MAAMC,KAAKL,MACf,IAAI,CAACG,UAAU,GAAG,CAACE,IAAI;QACtBF,UAAU,GAAG,CAACE;QACdH,YAAY,IAAI,CAACG;IAClB;IAED,IAAIJ,YAAY,GACf,OAAOC;IAGR,MAAMI,UAAU,IAAIF,IAAYF;IAChC,IAAIK,WAAqB;WAAIL;KAAY;IACzC,IAAIM,QAAQ;IAEZ,MAAOD,SAAS,MAAM,GAAG,KAAKC,QAAQP,SAAU;QAC/C,MAAMQ,OAAiB,EAAE;QACzB,KAAK,MAAMC,QAAQH,SAClB,KAAK,MAAMI,SAASb,MAAM,WAAW,CAACC,WAAWW,MAAmB,GACnE,KAAIJ,QAAQ,GAAG,CAACK;YAChBL,QAAQ,GAAG,CAACK;YACZF,KAAK,IAAI,CAACE;;QAGZJ,WAAWE;QACXD;IACD;IAEA,MAAMI,WAAWN;IACjB,MAAMO,SAAmB,EAAE;IAC3B,MAAMC,WAAW,IAAIV;IACrB,MAAMW,UAAU,CAACC;QAChBF,SAAS,GAAG,CAACE;QACbH,OAAO,IAAI,CAACG;IACb;IAEA,IAAIR,SAASP,YAAYM,SAAS,MAAM,GAAG,GAE1C,KAAK,MAAMS,MAAMT,SAAUQ,QAAQC;IAIpC,KAAK,MAAMA,MAAMJ,SAAU;QAC1B,IAAIE,SAAS,GAAG,CAACE,KAAK;QACtB,MAAMC,WAAWnB,MAAM,WAAW,CAACC,WAAWiB,IAAiB;QAC/D,IAAIC,AAAoB,MAApBA,SAAS,MAAM,EAAQF,QAAQC;IACpC;IACA,OAAOH;AACR"}
+{"version":3,"file":"core/reasoning/strategies/totScoring.js","sources":["../../../../src/core/reasoning/strategies/totScoring.ts"],"sourcesContent":["/**\n * Tree-of-Thought scoring helpers — pure functions for ranking and frontier\n * exploration over the thought DAG.\n *\n * This module exposes three primitives used by the ToT strategy:\n *\n * - {@link scoreThought}: combine confidence and quality into a [0, 1] score.\n * - {@link selectBeam}: pick the top-K candidates with deterministic tiebreaks.\n * - {@link breadthFirstFrontier}: BFS from roots, returning leaves of the\n *   explored subgraph capped by depth.\n *\n * All functions are pure: no I/O, no mutable module state, no DI.\n *\n * @module core/reasoning/strategies/totScoring\n */\n\nimport type { ThoughtData } from '../../thought.js';\nimport type { ThoughtType } from '../../../contracts/reasoning-types.js';\nimport type { ConfidenceSignals } from '../../reasoning.js';\nimport type { GraphView } from '../../graph/GraphView.js';\nimport type { SessionId, ThoughtId } from '../../../contracts/ids.js';\nimport { assertNever } from '../../../utils.js';\n\n/**\n * Optional `confidence_signals` carried alongside a thought. The core\n * `ThoughtData` type does not declare this field, but evaluator output may\n * be attached by callers that want calibrated scoring.\n */\ntype ThoughtWithSignals = ThoughtData & {\n\treadonly confidence_signals?: ConfidenceSignals;\n};\n\n/**\n * A scored candidate suitable for {@link selectBeam}.\n */\nexport interface ScoredCandidate {\n\treadonly id: string;\n\treadonly score: number;\n}\n\n/**\n * Per-type score multiplier applied on top of the base confidence×quality score.\n *\n * Weights bias the ToT frontier towards productive thought kinds:\n * - `assumption` (0.5): low confidence until backed by verification.\n * - `decomposition` (1.2): encouraged for problem-splitting.\n * - `backtrack` (0.8): signals exploration but not preferred.\n * - `tool_call` / `tool_observation` (1.0): neutral exogenous information.\n * - All other types (regular, hypothesis, verification, critique, synthesis, meta): 1.0.\n *\n * Pure function: deterministic, no I/O.\n */\nfunction getTypeWeight(type: ThoughtType | undefined): number {\n\tif (type === undefined) return 1.0;\n\tswitch (type) {\n\t\tcase 'assumption':\n\t\t\treturn 0.5;\n\t\tcase 'decomposition':\n\t\t\treturn 1.2;\n\t\tcase 'backtrack':\n\t\t\treturn 0.8;\n\t\tcase 'tool_call':\n\t\t\treturn 1.0;\n\t\tcase 'tool_observation':\n\t\t\treturn 1.0;\n\t\tcase 'regular':\n\t\tcase 'hypothesis':\n\t\tcase 'verification':\n\t\tcase 'critique':\n\t\tcase 'synthesis':\n\t\tcase 'meta':\n\t\t\treturn 1.0;\n\t\tdefault:\n\t\t\treturn assertNever(type);\n\t}\n}\n\n/**\n * Score a thought by combining its (calibrated) confidence with its\n * self-assessed quality, then applying a per-type weight.\n *\n * Formula: `(calibrated_confidence ?? confidence ?? 0) * (quality_score ?? 0.5) * typeWeight(thought_type)`\n *\n * The `calibrated_confidence` (when present on `confidence_signals`) is\n * preferred over the raw `confidence` field. The result is clamped to the\n * inclusive range `[0, 1]`.\n *\n * @param t - The thought to score.\n * @returns A score in `[0, 1]`.\n *\n * @example\n * ```typescript\n * const s = scoreThought({ ...base, confidence: 0.8, quality_score: 0.5 });\n * // s === 0.4\n * ```\n */\nexport function scoreThought(t: ThoughtData): number {\n\tconst calibrated = (t as ThoughtWithSignals).confidence_signals?.calibrated_confidence;\n\tconst confidence = calibrated ?? t.confidence ?? 0;\n\tconst quality = t.quality_score ?? 0.5;\n\tconst raw = confidence * quality * getTypeWeight(t.thought_type);\n\tif (raw < 0) return 0;\n\tif (raw > 1) return 1;\n\treturn raw;\n}\n\n/**\n * Select the top-`width` candidates by score, descending.\n *\n * Sorting is stable and deterministic: ties on `score` are broken by\n * lexicographic comparison of `id` (ascending). When `width >= candidates.length`\n * all candidates are returned in sorted order. When `width <= 0` the result\n * is empty.\n *\n * @param candidates - Scored candidates (input is not mutated).\n * @param width - Beam width (top-K).\n * @returns Selected ids in descending score order.\n *\n * @example\n * ```typescript\n * const top = selectBeam([{ id: 'a', score: 0.1 }, { id: 'b', score: 0.9 }], 1);\n * // top === ['b']\n * ```\n */\nexport function selectBeam(\n\tcandidates: readonly ScoredCandidate[],\n\twidth: number\n): readonly string[] {\n\tif (width <= 0 || candidates.length === 0) {\n\t\treturn [];\n\t}\n\tconst sorted = [...candidates].sort((a, b) => {\n\t\tif (b.score !== a.score) return b.score - a.score;\n\t\treturn a.id < b.id ? -1 : 1;\n\t});\n\tconst k = width >= sorted.length ? sorted.length : width;\n\tconst result: string[] = [];\n\tfor (let i = 0; i < k; i++) {\n\t\tresult.push(sorted[i]!.id);\n\t}\n\treturn result;\n}\n\n/**\n * Compute the BFS frontier reachable from `roots` within `depthCap` levels.\n *\n * Traverses outgoing edges via `graph.descendants(sessionId, id, 1)`. The returned\n * set contains the *leaves* of the explored subgraph — nodes that either\n * (a) sit at the depth cap, or (b) have no outgoing edges within the\n * explored region.\n *\n * Special cases:\n * - `depthCap === 0` returns the unique roots in input order.\n * - empty `roots` returns an empty array.\n *\n * Each node is visited at most once, so cycles cannot cause infinite loops.\n *\n * @param graph - Read-only graph view.\n * @param sessionId - Session scoping the traversal.\n * @param roots - Starting thought ids.\n * @param depthCap - Maximum BFS depth (0 = roots only).\n * @returns Frontier (leaf) thought ids of the explored subgraph.\n *\n * @example\n * ```typescript\n * const frontier = breadthFirstFrontier(view, 's1', ['root'], 2);\n * ```\n */\nexport function breadthFirstFrontier(\n\tgraph: GraphView,\n\tsessionId: SessionId,\n\troots: readonly string[],\n\tdepthCap: number\n): readonly string[] {\n\tif (roots.length === 0) {\n\t\treturn [];\n\t}\n\tconst uniqueRoots: string[] = [];\n\tconst seenRoots = new Set<string>();\n\tfor (const r of roots) {\n\t\tif (!seenRoots.has(r)) {\n\t\t\tseenRoots.add(r);\n\t\t\tuniqueRoots.push(r);\n\t\t}\n\t}\n\tif (depthCap <= 0) {\n\t\treturn uniqueRoots;\n\t}\n\n\tconst visited = new Set<string>(uniqueRoots);\n\tlet frontier: string[] = [...uniqueRoots];\n\tlet depth = 0;\n\n\twhile (frontier.length > 0 && depth < depthCap) {\n\t\tconst next: string[] = [];\n\t\tfor (const node of frontier) {\n\t\t\tfor (const child of graph.descendants(sessionId, node as ThoughtId, 1)) {\n\t\t\t\tif (visited.has(child)) continue;\n\t\t\t\tvisited.add(child);\n\t\t\t\tnext.push(child);\n\t\t\t}\n\t\t}\n\t\tfrontier = next;\n\t\tdepth++;\n\t}\n\n\tconst explored = visited;\n\tconst leaves: string[] = [];\n\tconst seenLeaf = new Set<string>();\n\tconst collect = (id: string): void => {\n\t\tseenLeaf.add(id);\n\t\tleaves.push(id);\n\t};\n\n\tif (depth >= depthCap && frontier.length > 0) {\n\t\t// Hit the depth cap — current frontier is leaves regardless of children.\n\t\tfor (const id of frontier) collect(id);\n\t}\n\t// Any explored node with no outgoing edges inside the explored set is also\n\t// a leaf (covers nodes shallower than depthCap that terminated naturally).\n\tfor (const id of explored) {\n\t\tif (seenLeaf.has(id)) continue;\n\t\tconst children = graph.descendants(sessionId, id as ThoughtId, 1);\n\t\tif (children.length === 0) collect(id);\n\t}\n\treturn leaves;\n}\n"],"names":["getTypeWeight","type","undefined","assertNever","scoreThought","t","calibrated","confidence","quality","raw","selectBeam","candidates","width","sorted","a","b","k","result","i","breadthFirstFrontier","graph","sessionId","roots","depthCap","uniqueRoots","seenRoots","Set","r","visited","frontier","depth","next","node","child","explored","leaves","seenLeaf","collect","id","children"],"mappings":";AAoDA,SAASA,cAAcC,IAA6B;IACnD,IAAIA,AAASC,WAATD,MAAoB,OAAO;IAC/B,OAAQA;QACP,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;YACJ,OAAO;QACR,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;YACJ,OAAO;QACR;YACC,OAAOE,YAAYF;IACrB;AACD;AAqBO,SAASG,aAAaC,CAAc;IAC1C,MAAMC,aAAcD,EAAyB,kBAAkB,EAAE;IACjE,MAAME,aAAaD,cAAcD,EAAE,UAAU,IAAI;IACjD,MAAMG,UAAUH,EAAE,aAAa,IAAI;IACnC,MAAMI,MAAMF,aAAaC,UAAUR,cAAcK,EAAE,YAAY;IAC/D,IAAII,MAAM,GAAG,OAAO;IACpB,IAAIA,MAAM,GAAG,OAAO;IACpB,OAAOA;AACR;AAoBO,SAASC,WACfC,UAAsC,EACtCC,KAAa;IAEb,IAAIA,SAAS,KAAKD,AAAsB,MAAtBA,WAAW,MAAM,EAClC,OAAO,EAAE;IAEV,MAAME,SAAS;WAAIF;KAAW,CAAC,IAAI,CAAC,CAACG,GAAGC;QACvC,IAAIA,EAAE,KAAK,KAAKD,EAAE,KAAK,EAAE,OAAOC,EAAE,KAAK,GAAGD,EAAE,KAAK;QACjD,OAAOA,EAAE,EAAE,GAAGC,EAAE,EAAE,GAAG,KAAK;IAC3B;IACA,MAAMC,IAAIJ,SAASC,OAAO,MAAM,GAAGA,OAAO,MAAM,GAAGD;IACnD,MAAMK,SAAmB,EAAE;IAC3B,IAAK,IAAIC,IAAI,GAAGA,IAAIF,GAAGE,IACtBD,OAAO,IAAI,CAACJ,MAAM,CAACK,EAAE,CAAE,EAAE;IAE1B,OAAOD;AACR;AA2BO,SAASE,qBACfC,KAAgB,EAChBC,SAAoB,EACpBC,KAAwB,EACxBC,QAAgB;IAEhB,IAAID,AAAiB,MAAjBA,MAAM,MAAM,EACf,OAAO,EAAE;IAEV,MAAME,cAAwB,EAAE;IAChC,MAAMC,YAAY,IAAIC;IACtB,KAAK,MAAMC,KAAKL,MACf,IAAI,CAACG,UAAU,GAAG,CAACE,IAAI;QACtBF,UAAU,GAAG,CAACE;QACdH,YAAY,IAAI,CAACG;IAClB;IAED,IAAIJ,YAAY,GACf,OAAOC;IAGR,MAAMI,UAAU,IAAIF,IAAYF;IAChC,IAAIK,WAAqB;WAAIL;KAAY;IACzC,IAAIM,QAAQ;IAEZ,MAAOD,SAAS,MAAM,GAAG,KAAKC,QAAQP,SAAU;QAC/C,MAAMQ,OAAiB,EAAE;QACzB,KAAK,MAAMC,QAAQH,SAClB,KAAK,MAAMI,SAASb,MAAM,WAAW,CAACC,WAAWW,MAAmB,GACnE,KAAIJ,QAAQ,GAAG,CAACK;YAChBL,QAAQ,GAAG,CAACK;YACZF,KAAK,IAAI,CAACE;;QAGZJ,WAAWE;QACXD;IACD;IAEA,MAAMI,WAAWN;IACjB,MAAMO,SAAmB,EAAE;IAC3B,MAAMC,WAAW,IAAIV;IACrB,MAAMW,UAAU,CAACC;QAChBF,SAAS,GAAG,CAACE;QACbH,OAAO,IAAI,CAACG;IACb;IAEA,IAAIR,SAASP,YAAYM,SAAS,MAAM,GAAG,GAE1C,KAAK,MAAMS,MAAMT,SAAUQ,QAAQC;IAIpC,KAAK,MAAMA,MAAMJ,SAAU;QAC1B,IAAIE,SAAS,GAAG,CAACE,KAAK;QACtB,MAAMC,WAAWnB,MAAM,WAAW,CAACC,WAAWiB,IAAiB;QAC/D,IAAIC,AAAoB,MAApBA,SAAS,MAAM,EAAQF,QAAQC;IACpC;IACA,OAAOH;AACR"}

package/dist/core/reasoning.d.ts

@@ -7,9 +7,7 @@
  * @module core/reasoning
  */
 import type { CalibrationMetrics } from '../contracts/calibrator.js';
-import type { PatternName as ContractPatternName, ThoughtType as ContractThoughtType } from '../contracts/reasoning-types.js';
-export type ThoughtType = ContractThoughtType;
-export type PatternName = ContractPatternName;
+import type { PatternName, ThoughtType } from '../contracts/reasoning-types.js';
 /**
  * A detected reasoning pattern — surfaced as metadata or a warning.
  *

package/dist/core/reasoning.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reasoning.d.ts","sourceRoot":"","sources":["../../src/core/reasoning.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AACrE,OAAO,KAAK,EACX,WAAW,IAAI,mBAAmB,EAClC,WAAW,IAAI,mBAAmB,EAClC,MAAM,iCAAiC,CAAC;AAEzC,MAAM,MAAM,WAAW,GAAG,mBAAmB,CAAC;AAE9C,MAAM,MAAM,WAAW,GAAG,mBAAmB,CAAC;AAE9C;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,aAAa;IAC7B,2CAA2C;IAC3C,2CAA2C;IAC3C,OAAO,EAAE,WAAW,CAAC;IAErB,uEAAuE;IACvE,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAE7B,0DAA0D;IAC1D,OAAO,EAAE,MAAM,CAAC;IAEhB,wEAAwE;IACxE,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,iBAAiB;IACjC,6CAA6C;IAC7C,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IAEjC,wCAAwC;IACxC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAEhC,uBAAuB;IACvB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAE9B,0CAA0C;IAC1C,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAEhE,8CAA8C;IAC9C,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IAEjC,uCAAuC;IACvC,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IAEnC,wDAAwD;IACxD,QAAQ,CAAC,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;IAE3C;;;;OAIG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAErC;;;OAGG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE;QAC7B,8EAA8E;QAC9E,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;QAChC,0EAA0E;QAC1E,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;QACvC,sGAAsG;QACtG,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;QAClC,wHAAwH;QACxH,QAAQ,CAAC,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KAC7C,CAAC;IAEF;;;;OAIG;IACH,QAAQ,CAAC,sBAAsB,CAAC,EAAE;QACjC,2DAA2D;QAC3D,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;QAChC,6DAA6D;QAC7D,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;QACvC,+CAA+C;QAC/C,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;QAClC,sFAAsF;QACtF,QAAQ,CAAC,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KAC7C,CAAC;IAEF,6HAA6H;IAC7H,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAExC,gGAAgG;IAChG,QAAQ,CAAC,mBAAmB,CAAC,EAAE,kBAAkB,CAAC;CAClD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,WAAW,cAAc;IAC9B,iCAAiC;IACjC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAEhC,8BAA8B;IAC9B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAEhC,iCAAiC;IACjC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IAEjC,6CAA6C;IAC7C,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAE9B,sCAAsC;IACtC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAE7B,kCAAkC;IAClC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAE1D,0BAA0B;IAC1B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAElC,0CAA0C;IAC1C,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC;IAE3C,uCAAuC;IACvC,QAAQ,CAAC,2BAA2B,EAAE,MAAM,CAAC;IAE7C,uEAAuE;IACvE,QAAQ,CAAC,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IAE9C,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3C"}
+{"version":3,"file":"reasoning.d.ts","sourceRoot":"","sources":["../../src/core/reasoning.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AACrE,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAEhF;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,aAAa;IAC7B,2CAA2C;IAC3C,2CAA2C;IAC3C,OAAO,EAAE,WAAW,CAAC;IAErB,uEAAuE;IACvE,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAE7B,0DAA0D;IAC1D,OAAO,EAAE,MAAM,CAAC;IAEhB,wEAAwE;IACxE,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,iBAAiB;IACjC,6CAA6C;IAC7C,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IAEjC,wCAAwC;IACxC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAEhC,uBAAuB;IACvB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAE9B,0CAA0C;IAC1C,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAEhE,8CAA8C;IAC9C,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IAEjC,uCAAuC;IACvC,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IAEnC,wDAAwD;IACxD,QAAQ,CAAC,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;IAE3C;;;;OAIG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAErC;;;OAGG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE;QAC7B,8EAA8E;QAC9E,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;QAChC,0EAA0E;QAC1E,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;QACvC,sGAAsG;QACtG,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;QAClC,wHAAwH;QACxH,QAAQ,CAAC,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KAC7C,CAAC;IAEF;;;;OAIG;IACH,QAAQ,CAAC,sBAAsB,CAAC,EAAE;QACjC,2DAA2D;QAC3D,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;QAChC,6DAA6D;QAC7D,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;QACvC,+CAA+C;QAC/C,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;QAClC,sFAAsF;QACtF,QAAQ,CAAC,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KAC7C,CAAC;IAEF,6HAA6H;IAC7H,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAExC,gGAAgG;IAChG,QAAQ,CAAC,mBAAmB,CAAC,EAAE,kBAAkB,CAAC;CAClD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,WAAW,cAAc;IAC9B,iCAAiC;IACjC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAEhC,8BAA8B;IAC9B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAEhC,iCAAiC;IACjC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IAEjC,6CAA6C;IAC7C,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAE9B,sCAAsC;IACtC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAE7B,kCAAkC;IAClC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAE1D,0BAA0B;IAC1B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAElC,0CAA0C;IAC1C,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC;IAE3C,uCAAuC;IACvC,QAAQ,CAAC,2BAA2B,EAAE,MAAM,CAAC;IAE7C,uEAAuE;IACvE,QAAQ,CAAC,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IAE9C,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3C"}

package/dist/core/thought.d.ts

@@ -69,7 +69,7 @@ export type ThoughtData = Omit<SchemaOutput, 'id' | 'session_id' | 'continuation
  * has guaranteed per-type invariants. Allows downstream methods to consume
  * narrowed thoughts without `!` non-null assertions.
  */
-import type { ThoughtType } from './reasoning.js';
+import type { ThoughtType } from '../contracts/reasoning-types.js';
 /** A `tool_call` thought with `tool_name` guaranteed by validation. */
 export type ToolCallThought = ThoughtData & {
     readonly thought_type: 'tool_call';

package/dist/core/thought.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"thought.d.ts","sourceRoot":"","sources":["../../src/core/thought.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAC3F,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACpD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,MAAM,WAAW,GAAG,IAAI,CAC7B,YAAY,EACV,IAAI,GACJ,YAAY,GACZ,oBAAoB,GACpB,oBAAoB,GACpB,WAAW,GACX,kBAAkB,GAClB,cAAc,GACd,gBAAgB,CAClB,GAAG;IACH,gGAAgG;IAChG,EAAE,CAAC,EAAE,SAAS,CAAC;IAEf,kEAAkE;IAClE,UAAU,CAAC,EAAE,SAAS,CAAC;IAEvB,yGAAyG;IACzG,kBAAkB,CAAC,EAAE,eAAe,CAAC;IAErC,0EAA0E;IAC1E,SAAS,CAAC,EAAE,QAAQ,CAAC;IAErB,iFAAiF;IACjF,gBAAgB,CAAC,EAAE,QAAQ,EAAE,CAAC;IAE9B;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB,8EAA8E;IAC9E,YAAY,CAAC,EAAE,kBAAkB,CAAC;IAElC,+EAA+E;IAC/E,cAAc,CAAC,EAAE,kBAAkB,EAAE,CAAC;CACtC,CAAC;AAEF;;;;GAIG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAElD,uEAAuE;AACvE,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG;IAC3C,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC3B,CAAC;AAEF,yEAAyE;AACzE,MAAM,MAAM,sBAAsB,GAAG,WAAW,GAAG;IAClD,QAAQ,CAAC,YAAY,EAAE,kBAAkB,CAAC;IAC1C,QAAQ,CAAC,kBAAkB,EAAE,eAAe,CAAC;CAC7C,CAAC;AAEF,gEAAgE;AAChE,MAAM,MAAM,gBAAgB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;CAClC,CAAC;AAEF,sEAAsE;AACtE,MAAM,MAAM,mBAAmB,GAAG,WAAW,GAAG;IAC/C,QAAQ,CAAC,YAAY,EAAE,cAAc,CAAC;IACtC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACrC,CAAC;AAEF,kEAAkE;AAClE,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG;IAC3C,QAAQ,CAAC,YAAY,EAAE,UAAU,CAAC;IAClC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACrC,CAAC;AAEF,2EAA2E;AAC3E,MAAM,MAAM,gBAAgB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;CAC9C,CAAC;AAEF,qEAAqE;AACrE,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG;IACvC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAC7B,WAAW,EACX,WAAW,GAAG,kBAAkB,GAAG,WAAW,GAAG,cAAc,GAAG,UAAU,GAAG,WAAW,CAC1F,CAAC;CACF,CAAC;AAEF;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,GACzB,eAAe,GACf,sBAAsB,GACtB,gBAAgB,GAChB,mBAAmB,GACnB,eAAe,GACf,gBAAgB,GAChB,WAAW,CAAC"}
+{"version":3,"file":"thought.d.ts","sourceRoot":"","sources":["../../src/core/thought.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAC3F,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACpD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,MAAM,WAAW,GAAG,IAAI,CAC7B,YAAY,EACV,IAAI,GACJ,YAAY,GACZ,oBAAoB,GACpB,oBAAoB,GACpB,WAAW,GACX,kBAAkB,GAClB,cAAc,GACd,gBAAgB,CAClB,GAAG;IACH,gGAAgG;IAChG,EAAE,CAAC,EAAE,SAAS,CAAC;IAEf,kEAAkE;IAClE,UAAU,CAAC,EAAE,SAAS,CAAC;IAEvB,yGAAyG;IACzG,kBAAkB,CAAC,EAAE,eAAe,CAAC;IAErC,0EAA0E;IAC1E,SAAS,CAAC,EAAE,QAAQ,CAAC;IAErB,iFAAiF;IACjF,gBAAgB,CAAC,EAAE,QAAQ,EAAE,CAAC;IAE9B;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB,8EAA8E;IAC9E,YAAY,CAAC,EAAE,kBAAkB,CAAC;IAElC,+EAA+E;IAC/E,cAAc,CAAC,EAAE,kBAAkB,EAAE,CAAC;CACtC,CAAC;AAEF;;;;GAIG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAEnE,uEAAuE;AACvE,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG;IAC3C,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC3B,CAAC;AAEF,yEAAyE;AACzE,MAAM,MAAM,sBAAsB,GAAG,WAAW,GAAG;IAClD,QAAQ,CAAC,YAAY,EAAE,kBAAkB,CAAC;IAC1C,QAAQ,CAAC,kBAAkB,EAAE,eAAe,CAAC;CAC7C,CAAC;AAEF,gEAAgE;AAChE,MAAM,MAAM,gBAAgB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;CAClC,CAAC;AAEF,sEAAsE;AACtE,MAAM,MAAM,mBAAmB,GAAG,WAAW,GAAG;IAC/C,QAAQ,CAAC,YAAY,EAAE,cAAc,CAAC;IACtC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACrC,CAAC;AAEF,kEAAkE;AAClE,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG;IAC3C,QAAQ,CAAC,YAAY,EAAE,UAAU,CAAC;IAClC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACrC,CAAC;AAEF,2EAA2E;AAC3E,MAAM,MAAM,gBAAgB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;CAC9C,CAAC;AAEF,qEAAqE;AACrE,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG;IACvC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAC7B,WAAW,EACX,WAAW,GAAG,kBAAkB,GAAG,WAAW,GAAG,cAAc,GAAG,UAAU,GAAG,WAAW,CAC1F,CAAC;CACF,CAAC;AAEF;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,GACzB,eAAe,GACf,sBAAsB,GACtB,gBAAgB,GAChB,mBAAmB,GACnB,eAAe,GACf,gBAAgB,GAChB,WAAW,CAAC"}

package/dist/lib.d.ts

@@ -12,6 +12,12 @@ import { StructuredLogger } from './logger/StructuredLogger.js';
 import { SkillRegistry } from './registry/SkillRegistry.js';
 import { ToolRegistry } from './registry/ToolRegistry.js';
 import { ServerConfig } from './ServerConfig.js';
+import { HttpTransport, createHttpTransport } from './transport/HttpTransport.js';
+import type { HttpTransportOptions } from './transport/HttpTransport.js';
+import type { TransportOptions } from './transport/BaseTransport.js';
+import type { ITransport, TransportKind } from './contracts/transport.js';
+export { HttpTransport, createHttpTransport };
+export type { HttpTransportOptions, TransportOptions, ITransport, TransportKind };
 export interface ServerOptions {
     maxHistorySize?: number;
     maxBranches?: number;
@@ -80,6 +86,11 @@ export interface IToolAwareSequentialThinkingServer extends IDisposable {
      * @returns The number of skills discovered
      */
     discoverSkillsAsync(): Promise<number>;
+    /** Rescan configured tool and skill directories. */
+    refreshDiscovery(): Promise<{
+        tools: number;
+        skills: number;
+    }>;
     /**
      * Get all branches from the history manager.
      *
@@ -138,6 +149,8 @@ export declare class ToolAwareSequentialThinkingServer extends EventEmitter impl
     private _skillWatcher;
     private _toolWatcher;
     private _config;
+    private _acceptingDiscoveryRefreshes;
+    private _refreshPromise;
     private _stopPromise;
     private _disposePromise;
     /**
@@ -201,6 +214,11 @@ export declare class ToolAwareSequentialThinkingServer extends EventEmitter impl
      * @returns Promise<number> - The number of skills discovered
      */
     discoverSkillsAsync(): Promise<number>;
+    /** Rescan configured tool and skill directories. */
+    refreshDiscovery(): Promise<{
+        tools: number;
+        skills: number;
+    }>;
     /**
      * Get all branches from the history manager
      * @returns Record<string, ThoughtData[]> - Map of branch IDs to thought arrays
@@ -240,6 +258,8 @@ export declare class ToolAwareSequentialThinkingServer extends EventEmitter impl
  *
  * @example
  * ```typescript
+ * import { createServer } from '@iworkforces/tracelattice';
+ *
  * // Basic usage (with async discovery and persistence)
  * const server = await createServer();
  *
@@ -250,14 +270,8 @@ export declare class ToolAwareSequentialThinkingServer extends EventEmitter impl
  *   maxHistorySize: 500,
  *   loadFromPersistence: true
  * });
- *
- * // With custom container for testing
- * const mockContainer = new Container();
- * mockContainer.registerInstance('Logger', mockLogger);
- * const server = await createServer({ container: mockContainer });
  * ```
  */
 export declare function createServer(options?: ServerOptions): Promise<ToolAwareSequentialThinkingServer>;
 export declare function initializeServer(): Promise<ToolAwareSequentialThinkingServer>;
-export {};
 //# sourceMappingURL=lib.d.ts.map

package/dist/lib.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lib.d.ts","sourceRoot":"","sources":["../src/lib.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,KAAK,CAAC,MAAM,SAAS,CAAC;AAClC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AAE5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAMzD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAElE,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAU1D,OAAO,EAAoB,KAAK,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAGnF,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAIhE,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAIjD,MAAM,WAAW,aAAa;IAC7B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,CAAC,EAAE,gBAAgB,CAAC;IAC1B,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,UAAU,CAAC,EAAE,iBAAiB,CAAC;IAC/B,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;OAGG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;OAGG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED;;GAEG;AACH,UAAU,YAAY;IACrB,gBAAgB,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACtD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,gBAAgB,EAAE;QAAE,aAAa,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CAC9D;AAwBD;;;;;;GAMG;AACH,MAAM,WAAW,kCAAmC,SAAQ,WAAW;IACtE,4CAA4C;IAC5C,QAAQ,CAAC,OAAO,EAAE,cAAc,CAAC;IAEjC,0CAA0C;IAC1C,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAE7B,2CAA2C;IAC3C,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAE/B,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAE9B;;;;OAIG;IACH,mBAAmB,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAEvC;;;;OAIG;IACH,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;IAE7C;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,wBAAwB,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IAE9F;;OAEG;IACH,kBAAkB,IAAI,MAAM,CAAC;IAE7B;;;OAGG;IACH,YAAY,IAAI,SAAS,CAAC;IAE1B;;OAEG;IACH,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAEtB;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd,oEAAoE;IACpE,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/C,kEAAkE;IAClE,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAE1B;;OAEG;IACH,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACzB;AAED,qBAAa,iCACZ,SAAQ,YACR,YAAW,kCAAkC;IAE7C;;;;;;OAMG;WACU,MAAM,CAAC,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,iCAAiC,CAAC;IAiDnF,IAAI,CAAC,CAAC,SAAS,MAAM,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI/E,EAAE,CAAC,CAAC,SAAS,MAAM,YAAY,EACvC,KAAK,EAAE,CAAC,EACR,QAAQ,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,GAC1C,IAAI;IAKP,OAAO,CAAC,UAAU,CAAY;IAG9B,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,iBAAiB,CAAmB;IAC5C,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,aAAa,CAA6B;IAClD,OAAO,CAAC,YAAY,CAA4B;IAChD,OAAO,CAAC,OAAO,CAAe;IAC9B,OAAO,CAAC,YAAY,CAA8B;IAClD,OAAO,CAAC,eAAe,CAA8B;IAGrD;;;;;;;OAOG;IACH,SAAgB,OAAO,EAAE,cAAc,CAAC;IAExC;;;;;;;OAOG;IACH,SAAgB,KAAK,EAAE,YAAY,CAAC;IAEpC;;;;;;;OAOG;IACH,SAAgB,MAAM,EAAE,aAAa,CAAC;IAEtC;;;;;;OAMG;IACH,SAAgB,MAAM,EAAE,YAAY,CAAC;gBAEzB,OAAO,GAAE,aAAkB;IAmCvC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAuFnC,OAAO,CAAC,MAAM,CAAC,uBAAuB;IActC,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAkC3C,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAiCtC,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAwDvC;;;OAGG;mBACkB,2BAA2B;IAwChD;;;OAGG;IACI,YAAY,IAAI,SAAS;IAIhC;;;;OAIG;IACU,mBAAmB,IAAI,OAAO,CAAC,MAAM,CAAC;IAKnD;;;OAGG;IACI,WAAW,IAAI,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC;IAKxC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,wBAAwB,CAAC;IAQzE,kBAAkB,IAAI,MAAM;IAInC;;;OAGG;IACI,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAqE5B;;;OAGG;IACI,KAAK,IAAI,IAAI;IAKpB,uEAAuE;IAC1D,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAK3D,0EAA0E;IAC7D,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAKtC;;;;OAIG;IACI,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAc/B;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAsB,YAAY,CACjC,OAAO,GAAE,aAAkB,GACzB,OAAO,CAAC,iCAAiC,CAAC,CAE5C;AAGD,wBAAsB,gBAAgB,IAAI,OAAO,CAAC,iCAAiC,CAAC,CAsBnF"}
+{"version":3,"file":"lib.d.ts","sourceRoot":"","sources":["../src/lib.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,KAAK,CAAC,MAAM,SAAS,CAAC;AAClC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AAE5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAMzD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAElE,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAU1D,OAAO,EAAoB,KAAK,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAInF,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAIhE,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAGjD,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AAClF,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AACzE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AACrE,OAAO,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAE1E,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,CAAC;AAC9C,YAAY,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,UAAU,EAAE,aAAa,EAAE,CAAC;AAElF,MAAM,WAAW,aAAa;IAC7B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,CAAC,EAAE,gBAAgB,CAAC;IAC1B,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,UAAU,CAAC,EAAE,iBAAiB,CAAC;IAC/B,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;OAGG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;OAGG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED;;GAEG;AACH,UAAU,YAAY;IACrB,gBAAgB,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACtD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,gBAAgB,EAAE;QAAE,aAAa,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CAC9D;AAwBD;;;;;;GAMG;AACH,MAAM,WAAW,kCAAmC,SAAQ,WAAW;IACtE,4CAA4C;IAC5C,QAAQ,CAAC,OAAO,EAAE,cAAc,CAAC;IAEjC,0CAA0C;IAC1C,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAE7B,2CAA2C;IAC3C,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAE/B,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAE9B;;;;OAIG;IACH,mBAAmB,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAEvC,oDAAoD;IACpD,gBAAgB,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAE/D;;;;OAIG;IACH,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;IAE7C;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,wBAAwB,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IAE9F;;OAEG;IACH,kBAAkB,IAAI,MAAM,CAAC;IAE7B;;;OAGG;IACH,YAAY,IAAI,SAAS,CAAC;IAE1B;;OAEG;IACH,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAEtB;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd,oEAAoE;IACpE,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/C,kEAAkE;IAClE,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAE1B;;OAEG;IACH,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACzB;AAED,qBAAa,iCACZ,SAAQ,YACR,YAAW,kCAAkC;IAE7C;;;;;;OAMG;WACU,MAAM,CAAC,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,iCAAiC,CAAC;IAiDnF,IAAI,CAAC,CAAC,SAAS,MAAM,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI/E,EAAE,CAAC,CAAC,SAAS,MAAM,YAAY,EACvC,KAAK,EAAE,CAAC,EACR,QAAQ,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,GAC1C,IAAI;IAKP,OAAO,CAAC,UAAU,CAAY;IAG9B,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,iBAAiB,CAAmB;IAC5C,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,aAAa,CAA6B;IAClD,OAAO,CAAC,YAAY,CAA4B;IAChD,OAAO,CAAC,OAAO,CAAe;IAC9B,OAAO,CAAC,4BAA4B,CAAQ;IAC5C,OAAO,CAAC,eAAe,CAA2D;IAClF,OAAO,CAAC,YAAY,CAA8B;IAClD,OAAO,CAAC,eAAe,CAA8B;IAGrD;;;;;;;OAOG;IACH,SAAgB,OAAO,EAAE,cAAc,CAAC;IAExC;;;;;;;OAOG;IACH,SAAgB,KAAK,EAAE,YAAY,CAAC;IAEpC;;;;;;;OAOG;IACH,SAAgB,MAAM,EAAE,aAAa,CAAC;IAEtC;;;;;;OAMG;IACH,SAAgB,MAAM,EAAE,YAAY,CAAC;gBAEzB,OAAO,GAAE,aAAkB;IAmCvC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAuFnC,OAAO,CAAC,MAAM,CAAC,uBAAuB;IActC,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAkC3C,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAiCtC,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAwDvC;;;OAGG;mBACkB,2BAA2B;IAwChD;;;OAGG;IACI,YAAY,IAAI,SAAS;IAIhC;;;;OAIG;IACU,mBAAmB,IAAI,OAAO,CAAC,MAAM,CAAC;IAKnD,oDAAoD;IAC7C,gBAAgB,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IA8BrE;;;OAGG;IACI,WAAW,IAAI,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC;IAKxC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,wBAAwB,CAAC;IAQzE,kBAAkB,IAAI,MAAM;IAInC;;;OAGG;IACI,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAoF5B;;;OAGG;IACI,KAAK,IAAI,IAAI;IAKpB,uEAAuE;IAC1D,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAK3D,0EAA0E;IAC7D,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAKtC;;;;OAIG;IACI,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAc/B;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAsB,YAAY,CACjC,OAAO,GAAE,aAAkB,GACzB,OAAO,CAAC,iCAAiC,CAAC,CAE5C;AAGD,wBAAsB,gBAAgB,IAAI,OAAO,CAAC,iCAAiC,CAAC,CAsBnF"}

package/dist/lib.js

@@ -16,6 +16,7 @@ import { createReasoningStrategy } from "./core/reasoning/strategies/StrategyFac
 import { ThoughtFormatter } from "./core/ThoughtFormatter.js";
 import { ThoughtProcessor } from "./core/ThoughtProcessor.js";
 import { SessionLock } from "./core/SessionLock.js";
+import { SessionLifecycleClosedError } from "./core/SessionErrors.js";
 import { SessionLifecycleCoordinator } from "./core/SessionLifecycleCoordinator.js";
 import { Container } from "./di/Container.js";
 import { StructuredLogger } from "./logger/StructuredLogger.js";
@@ -92,6 +93,8 @@ class ToolAwareSequentialThinkingServer extends EventEmitter {
     _skillWatcher = null;
     _toolWatcher = null;
     _config;
+    _acceptingDiscoveryRefreshes = true;
+    _refreshPromise = null;
     _stopPromise = null;
     _disposePromise = null;
     history;
@@ -290,6 +293,33 @@ class ToolAwareSequentialThinkingServer extends EventEmitter {
         const discovered = await this.skills.discoverAsync();
         return discovered;
     }
+    refreshDiscovery() {
+        if (!this._acceptingDiscoveryRefreshes) return Promise.reject(new SessionLifecycleClosedError(void 0, 'shutting_down'));
+        if (null !== this._refreshPromise) return this._refreshPromise;
+        const refreshPromise = Promise.allSettled([
+            this.tools.refreshAsync(),
+            this.skills.refreshAsync()
+        ]).then(([toolResult, skillResult])=>{
+            if ('rejected' === toolResult.status) {
+                if ('rejected' === skillResult.status) throw new AggregateError([
+                    toolResult.reason,
+                    skillResult.reason
+                ], 'Failed to refresh tool and skill discovery');
+                throw toolResult.reason;
+            }
+            if ('rejected' === skillResult.status) throw skillResult.reason;
+            return {
+                tools: toolResult.value,
+                skills: skillResult.value
+            };
+        });
+        this._refreshPromise = refreshPromise;
+        const clearRefreshPromise = ()=>{
+            if (this._refreshPromise === refreshPromise) this._refreshPromise = null;
+        };
+        refreshPromise.then(clearRefreshPromise, clearRefreshPromise);
+        return refreshPromise;
+    }
     getBranches() {
         return this._historyManager.getBranches();
     }
@@ -304,14 +334,20 @@ class ToolAwareSequentialThinkingServer extends EventEmitter {
         return this._metrics.export();
     }
     stop() {
+        this._acceptingDiscoveryRefreshes = false;
         if (this._stopPromise) return this._stopPromise;
+        const acceptedRefresh = this._refreshPromise;
         this._stopPromise = this._container.resolve('sessionLifecycle').shutdown(async ()=>{
             const failures = [];
-            const watcherResults = await Promise.allSettled([
+            const [skillWatcherResult, toolWatcherResult, refreshResult] = await Promise.allSettled([
                 this._skillWatcher?.stop() ?? Promise.resolve(),
-                this._toolWatcher?.stop() ?? Promise.resolve()
+                this._toolWatcher?.stop() ?? Promise.resolve(),
+                acceptedRefresh ?? Promise.resolve()
             ]);
-            for (const result of watcherResults)switch(result.status){
+            for (const result of [
+                skillWatcherResult,
+                toolWatcherResult
+            ])switch(result.status){
                 case 'fulfilled':
                     break;
                 case 'rejected':
@@ -323,6 +359,18 @@ class ToolAwareSequentialThinkingServer extends EventEmitter {
                 default:
                     assertNever(result);
             }
+            switch(refreshResult.status){
+                case 'fulfilled':
+                    break;
+                case 'rejected':
+                    appendCleanupFailure(failures, refreshResult.reason);
+                    this._logger.error('Error refreshing discovery during shutdown', {
+                        error: getErrorMessage(refreshResult.reason)
+                    });
+                    break;
+                default:
+                    assertNever(refreshResult);
+            }
             if (this._config.features.toolInterleave && this._container.has('suspensionStore')) try {
                 const suspensionStore = this._container.resolve('suspensionStore');
                 suspensionStore.stop();
@@ -404,6 +452,7 @@ async function initializeServer() {
     logger.info('Server initialized successfully');
     return thinkingServer;
 }
+export { HttpTransport, createHttpTransport } from "./transport/HttpTransport.js";
 export { ToolAwareSequentialThinkingServer, createServer, initializeServer };
 
 //# sourceMappingURL=lib.js.map