@polycode-projects/seonix 0.7.0 → 0.7.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@polycode-projects/seonix",
-  "version": "0.7.0",
+  "version": "0.7.1",
   "private": false,
   "type": "module",
   "description": "SEONIX — a deterministic, offline, $0 code-graph tool that makes a cheap coding agent edit like an expensive one. Indexes a repo with Python ast + git (zero model calls) and renders a bounded edit-digest.",

package/src/ask.mjs

@@ -62,7 +62,9 @@ import { nlpAdapter } from "./ask-nlp.mjs";
  *  classification, so they cannot drift in meaning). */
 function edgesOfKind(graph, kind) {
   const out = [];
-  for (const g of graph.relations) if (relationKind(g) === kind) out.push(...g.edges);
+  // Append iteratively: `out.push(...g.edges)` spreads the group's edges as function arguments,
+  // overflowing the call stack on a large estate graph (mirrors the codegraph.mjs edgesOfKind fix).
+  for (const g of graph.relations) if (relationKind(g) === kind) for (const e of g.edges) out.push(e);
   return out;
 }
 

package/src/codegraph.mjs

@@ -1180,7 +1180,10 @@ export function renderSearch(graph, query, { limit = SEARCH_LIMIT, kind = "", de
  *  mechanical NL-query engine (PLAN_MECHANICAL_CHAT.md) to orchestrate rather than duplicate. */
 export function edgesOfKind(graph, kind) {
   const out = [];
-  for (const g of graph.relations) if (relationKind(g) === kind) out.push(...g.edges);
+  // NB: append iteratively — `out.push(...g.edges)` spreads the group's edges as function
+  // arguments, which overflows the call stack on a large estate graph (e.g. `defines` with
+  // 176k edges → "Maximum call stack size exceeded"). A plain loop has no argument-count limit.
+  for (const g of graph.relations) if (relationKind(g) === kind) for (const e of g.edges) out.push(e);
   return out;
 }