@amritk/generate-examples 0.5.1 → 0.5.3

package/dist/generators/find-schema-cycles.js

@@ -1,124 +1,100 @@
-import { extractRefs } from '@amritk/helpers/extract-refs';
-import { refToFilename } from '@amritk/helpers/ref-to-filename';
-import { walkRefGraph } from '@amritk/helpers/walk-ref-graph';
-/**
- * Collects the ref graph as an adjacency map of filename → referenced
- * filenames, restricted to nodes that are actually generated as files. Self
- * edges are dropped (they are `fc.letrec` recursion, not cross-file cycles).
- */
+import { extractRefs } from "@amritk/helpers/extract-refs";
+import { refToFilename } from "@amritk/helpers/ref-to-filename";
+import { walkRefGraph } from "@amritk/helpers/walk-ref-graph";
 const buildRefGraph = (rootSchema, rootTypeName, typeSuffix) => {
-    const schemas = new Map();
-    walkRefGraph(rootSchema, rootTypeName, { typeSuffix }, (node) => {
-        // `index` is reserved for the barrel and never generated as a definition.
-        if (node.filename === 'index')
-            return;
-        if (!schemas.has(node.filename))
-            schemas.set(node.filename, node.schema);
-    });
-    const graph = new Map();
-    for (const [filename, schema] of schemas) {
-        const targets = new Set();
-        for (const ref of extractRefs(schema)) {
-            const target = refToFilename(ref);
-            // Only edges to other generated files matter — an unresolved/external ref
-            // never becomes an eager cross-module reference.
-            if (target !== filename && schemas.has(target))
-                targets.add(target);
-        }
-        graph.set(filename, targets);
+  const schemas = /* @__PURE__ */ new Map();
+  walkRefGraph(rootSchema, rootTypeName, { typeSuffix }, (node) => {
+    if (node.filename === "index")
+      return;
+    if (!schemas.has(node.filename))
+      schemas.set(node.filename, node.schema);
+  });
+  const graph = /* @__PURE__ */ new Map();
+  for (const [filename, schema] of schemas) {
+    const targets = /* @__PURE__ */ new Set();
+    for (const ref of extractRefs(schema)) {
+      const target = refToFilename(ref);
+      if (target !== filename && schemas.has(target))
+        targets.add(target);
     }
-    return graph;
+    graph.set(filename, targets);
+  }
+  return graph;
 };
-/**
- * Tarjan's strongly-connected-components algorithm, iterative so a deep ref
- * graph cannot overflow the call stack. Returns one array of filenames per SCC.
- */
 const stronglyConnectedComponents = (graph) => {
-    let counter = 0;
-    const index = new Map();
-    const lowlink = new Map();
-    const onStack = new Set();
-    const stack = [];
-    const sccs = [];
-    for (const start of graph.keys()) {
-        if (index.has(start))
-            continue;
-        const callStack = [{ node: start, iter: (graph.get(start) ?? new Set()).values() }];
-        index.set(start, counter);
-        lowlink.set(start, counter);
-        counter++;
-        stack.push(start);
-        onStack.add(start);
-        while (callStack.length > 0) {
-            const frame = callStack[callStack.length - 1];
-            const node = frame.node;
-            let descended = false;
-            let next = frame.iter.next();
-            while (!next.done) {
-                const child = next.value;
-                if (!index.has(child)) {
-                    index.set(child, counter);
-                    lowlink.set(child, counter);
-                    counter++;
-                    stack.push(child);
-                    onStack.add(child);
-                    callStack.push({ node: child, iter: (graph.get(child) ?? new Set()).values() });
-                    descended = true;
-                    break;
-                }
-                if (onStack.has(child)) {
-                    lowlink.set(node, Math.min(lowlink.get(node), index.get(child)));
-                }
-                next = frame.iter.next();
-            }
-            if (descended)
-                continue;
-            // All successors visited: close this node.
-            if (lowlink.get(node) === index.get(node)) {
-                const scc = [];
-                let member;
-                do {
-                    member = stack.pop();
-                    onStack.delete(member);
-                    scc.push(member);
-                } while (member !== node);
-                sccs.push(scc);
-            }
-            callStack.pop();
-            const parent = callStack[callStack.length - 1];
-            if (parent) {
-                lowlink.set(parent.node, Math.min(lowlink.get(parent.node), lowlink.get(node)));
-            }
+  let counter = 0;
+  const index = /* @__PURE__ */ new Map();
+  const lowlink = /* @__PURE__ */ new Map();
+  const onStack = /* @__PURE__ */ new Set();
+  const stack = [];
+  const sccs = [];
+  for (const start of graph.keys()) {
+    if (index.has(start))
+      continue;
+    const callStack = [{ node: start, iter: (graph.get(start) ?? /* @__PURE__ */ new Set()).values() }];
+    index.set(start, counter);
+    lowlink.set(start, counter);
+    counter++;
+    stack.push(start);
+    onStack.add(start);
+    while (callStack.length > 0) {
+      const frame = callStack[callStack.length - 1];
+      const node = frame.node;
+      let descended = false;
+      let next = frame.iter.next();
+      while (!next.done) {
+        const child = next.value;
+        if (!index.has(child)) {
+          index.set(child, counter);
+          lowlink.set(child, counter);
+          counter++;
+          stack.push(child);
+          onStack.add(child);
+          callStack.push({ node: child, iter: (graph.get(child) ?? /* @__PURE__ */ new Set()).values() });
+          descended = true;
+          break;
+        }
+        if (onStack.has(child)) {
+          lowlink.set(node, Math.min(lowlink.get(node), index.get(child)));
         }
+        next = frame.iter.next();
+      }
+      if (descended)
+        continue;
+      if (lowlink.get(node) === index.get(node)) {
+        const scc = [];
+        let member;
+        do {
+          member = stack.pop();
+          onStack.delete(member);
+          scc.push(member);
+        } while (member !== node);
+        sccs.push(scc);
+      }
+      callStack.pop();
+      const parent = callStack[callStack.length - 1];
+      if (parent) {
+        lowlink.set(parent.node, Math.min(lowlink.get(parent.node), lowlink.get(node)));
+      }
     }
-    return sccs;
+  }
+  return sccs;
 };
-/**
- * Detects cross-file `$ref` cycles in a schema's ref graph.
- *
- * Walks the graph via {@link walkRefGraph}, groups files into strongly connected
- * components, and returns — for every file inside a multi-file component — the
- * sibling files it must reference lazily to avoid a circular-ESM TDZ crash.
- * Files not involved in any cross-file cycle are absent from the result.
- *
- * @param rootSchema - The root JSON Schema being built.
- * @param rootTypeName - The name for the root type (e.g. `'Document'`).
- * @param typeSuffix - Suffix appended to every `$ref`-derived name (default `''`).
- */
-export const findSchemaCycles = (rootSchema, rootTypeName, typeSuffix = '') => {
-    const graph = buildRefGraph(rootSchema, rootTypeName, typeSuffix);
-    const cycles = new Map();
-    for (const scc of stronglyConnectedComponents(graph)) {
-        // A single-file component is either an isolated node or pure self-recursion;
-        // neither needs cross-file lazy references.
-        if (scc.length < 2)
-            continue;
-        const members = new Set(scc);
-        for (const member of scc) {
-            const siblings = new Set(members);
-            siblings.delete(member);
-            cycles.set(member, siblings);
-        }
+const findSchemaCycles = (rootSchema, rootTypeName, typeSuffix = "") => {
+  const graph = buildRefGraph(rootSchema, rootTypeName, typeSuffix);
+  const cycles = /* @__PURE__ */ new Map();
+  for (const scc of stronglyConnectedComponents(graph)) {
+    if (scc.length < 2)
+      continue;
+    const members = new Set(scc);
+    for (const member of scc) {
+      const siblings = new Set(members);
+      siblings.delete(member);
+      cycles.set(member, siblings);
     }
-    return cycles;
+  }
+  return cycles;
+};
+export {
+  findSchemaCycles
 };