alchemy 2.0.0-beta.4 → 2.0.0-beta.41

package/lib/Util/instance.js

@@ -0,0 +1 @@
+//# sourceMappingURL=instance.js.map

package/lib/Util/instance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"instance.js","sourceRoot":"","sources":["../../src/Util/instance.ts"],"names":[],"mappings":""}

package/lib/Util/layer-scoped.d.ts

@@ -0,0 +1,16 @@
+import type * as Context from "effect/Context";
+import * as Effect from "effect/Effect";
+import * as Layer from "effect/Layer";
+import type * as Scope from "effect/Scope";
+/**
+ * Builds a layer with the current scope.
+ * @param layer - The layer to build.
+ * @returns A scoped effect returning a Context with the provided layer.
+ */
+export declare const buildLayerScoped: <ROut, E, RIn>(layer: Layer.Layer<ROut, E, RIn>) => Effect.Effect<Context.Context<ROut>, E, RIn | Scope.Scope>;
+/**
+ * Builds a layer with the current scope and provides it to the given effect.
+ * @param layer - The layer to build.
+ */
+export declare const provideLayerScoped: <ROut, E1, RIn>(layer: Layer.Layer<ROut, E1, RIn>) => <A, E2, R>(effect: Effect.Effect<A, E2, R>) => Effect.Effect<A, E1 | E2, Scope.Scope | RIn | Exclude<R, ROut>>;
+//# sourceMappingURL=layer-scoped.d.ts.map

package/lib/Util/layer-scoped.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layer-scoped.d.ts","sourceRoot":"","sources":["../../src/Util/layer-scoped.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,OAAO,MAAM,gBAAgB,CAAC;AAC/C,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAC;AACtC,OAAO,KAAK,KAAK,KAAK,MAAM,cAAc,CAAC;AAE3C;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,GAAI,IAAI,EAAE,CAAC,EAAE,GAAG,EAC3C,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,KAC/B,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,KAAK,CACiB,CAAC;AAE9E;;;GAGG;AACH,eAAO,MAAM,kBAAkB,GAC5B,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,MAChD,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,QAAQ,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,oEAGvC,CAAC"}

package/lib/Util/layer-scoped.js

@@ -0,0 +1,14 @@
+import * as Effect from "effect/Effect";
+import * as Layer from "effect/Layer";
+/**
+ * Builds a layer with the current scope.
+ * @param layer - The layer to build.
+ * @returns A scoped effect returning a Context with the provided layer.
+ */
+export const buildLayerScoped = (layer) => Effect.flatMap(Effect.scope, (scope) => Layer.buildWithScope(layer, scope));
+/**
+ * Builds a layer with the current scope and provides it to the given effect.
+ * @param layer - The layer to build.
+ */
+export const provideLayerScoped = (layer) => (effect) => Effect.flatMap(buildLayerScoped(layer), (context) => Effect.provideContext(effect, context));
+//# sourceMappingURL=layer-scoped.js.map

package/lib/Util/layer-scoped.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layer-scoped.js","sourceRoot":"","sources":["../../src/Util/layer-scoped.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAC;AAGtC;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,KAAgC,EAC4B,EAAE,CAC9D,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;AAE9E;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAC7B,CAAgB,KAAiC,EAAE,EAAE,CACrD,CAAW,MAA+B,EAAE,EAAE,CAC5C,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAClD,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,CAAC,CACvC,CAAC"}

package/lib/Util/pointer.d.ts

@@ -0,0 +1,5 @@
+export type Pointer<T> = T | (() => T);
+export declare namespace Pointer {
+    type Resolve<R> = R extends () => infer T ? T : R;
+}
+//# sourceMappingURL=pointer.d.ts.map

package/lib/Util/pointer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pointer.d.ts","sourceRoot":"","sources":["../../src/Util/pointer.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAEvC,MAAM,CAAC,OAAO,WAAW,OAAO,CAAC;IAC/B,KAAY,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,MAAM,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;CAC1D"}

package/lib/Util/pointer.js

@@ -0,0 +1 @@
+//# sourceMappingURL=pointer.js.map

package/lib/Util/pointer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pointer.js","sourceRoot":"","sources":["../../src/Util/pointer.ts"],"names":[],"mappings":""}

package/lib/Util/proxy-chain.d.ts

@@ -0,0 +1,30 @@
+import * as Effect from "effect/Effect";
+/**
+ * Wrap a cached `Effect<T>` in a chainable Proxy so callers can use the
+ * returned value as if it were `T` itself — every property read and call
+ * records a step, and the chain is replayed against the resolved value
+ * when it's finally yielded as an Effect.
+ *
+ * Compare:
+ *
+ * ```typescript
+ * // Without proxyChain — caller has to yield the cached Effect first:
+ * const conn = yield* makeConnection();      // Effect<Db>
+ * fetch: Effect.gen(function* () {
+ *   const db = yield* conn;
+ *   const rows = yield* db.select().from(users);
+ * });
+ *
+ * // With proxyChain — caller treats the return as the value directly:
+ * const db = proxyChain(yield* Effect.cached(makeDb));   // T
+ * fetch: Effect.gen(function* () {
+ *   const rows = yield* db.select().from(users);
+ * });
+ * ```
+ *
+ * The chain ends when the proxy is yielded as an Effect — the resolved
+ * value at that point must be a `Yieldable` (an Effect, drizzle query
+ * builder, etc). Anything before that is recorded as ops.
+ */
+export declare const proxyChain: <T>(cached: Effect.Effect<T, any, any>) => T;
+//# sourceMappingURL=proxy-chain.d.ts.map

package/lib/Util/proxy-chain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proxy-chain.d.ts","sourceRoot":"","sources":["../../src/Util/proxy-chain.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AA2BxC;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,EAAE,QAAQ,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,KAAG,CAC/C,CAAC"}

package/lib/Util/proxy-chain.js

@@ -0,0 +1,66 @@
+import * as Effect from "effect/Effect";
+/**
+ * Replay an op chain against a real value. `get` reads a property,
+ * `call` invokes — bound to the previous receiver so `this` resolves
+ * to the object the method was read from (drizzle's `select()` etc.
+ * read `this._.session`, so dropping `this` would throw).
+ */
+const replay = (root, ops) => {
+    let cur = root;
+    let receiver = root;
+    for (const op of ops) {
+        if (op.kind === "get") {
+            receiver = cur;
+            cur = cur[op.prop];
+        }
+        else {
+            cur = cur.apply(receiver, op.args);
+            receiver = cur;
+        }
+    }
+    return cur;
+};
+/**
+ * Wrap a cached `Effect<T>` in a chainable Proxy so callers can use the
+ * returned value as if it were `T` itself — every property read and call
+ * records a step, and the chain is replayed against the resolved value
+ * when it's finally yielded as an Effect.
+ *
+ * Compare:
+ *
+ * ```typescript
+ * // Without proxyChain — caller has to yield the cached Effect first:
+ * const conn = yield* makeConnection();      // Effect<Db>
+ * fetch: Effect.gen(function* () {
+ *   const db = yield* conn;
+ *   const rows = yield* db.select().from(users);
+ * });
+ *
+ * // With proxyChain — caller treats the return as the value directly:
+ * const db = proxyChain(yield* Effect.cached(makeDb));   // T
+ * fetch: Effect.gen(function* () {
+ *   const rows = yield* db.select().from(users);
+ * });
+ * ```
+ *
+ * The chain ends when the proxy is yielded as an Effect — the resolved
+ * value at that point must be a `Yieldable` (an Effect, drizzle query
+ * builder, etc). Anything before that is recorded as ops.
+ */
+export const proxyChain = (cached) => chain(cached);
+const chain = (cached, ops = []) => new Proxy(function () { }, {
+    get(_, prop) {
+        if (prop === Symbol.iterator) {
+            // `yield* proxy` — produce the resolved Effect's iterator.
+            return function () {
+                const eff = Effect.flatMap(cached, (root) => replay(root, ops));
+                return eff[Symbol.iterator]();
+            };
+        }
+        return chain(cached, [...ops, { kind: "get", prop }]);
+    },
+    apply(_, __, args) {
+        return chain(cached, [...ops, { kind: "call", args }]);
+    },
+});
+//# sourceMappingURL=proxy-chain.js.map

package/lib/Util/proxy-chain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proxy-chain.js","sourceRoot":"","sources":["../../src/Util/proxy-chain.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAMxC;;;;;GAKG;AACH,MAAM,MAAM,GAAG,CAAC,IAAa,EAAE,GAAsB,EAAW,EAAE;IAChE,IAAI,GAAG,GAAQ,IAAI,CAAC;IACpB,IAAI,QAAQ,GAAQ,IAAI,CAAC;IACzB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACtB,QAAQ,GAAG,GAAG,CAAC;YACf,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YACnC,QAAQ,GAAG,GAAG,CAAC;QACjB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAI,MAAkC,EAAK,EAAE,CACrE,KAAK,CAAC,MAAM,CAAM,CAAC;AAErB,MAAM,KAAK,GAAG,CACZ,MAAwC,EACxC,MAAyB,EAAE,EAClB,EAAE,CACX,IAAI,KAAK,CAAC,cAAa,CAAQ,EAAE;IAC/B,GAAG,CAAC,CAAC,EAAE,IAAI;QACT,IAAI,IAAI,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC7B,2DAA2D;YAC3D,OAAO;gBACL,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CACxB,MAAM,EACN,CAAC,IAAI,EAAE,EAAE,CACP,MAAM,CAAC,IAAI,EAAE,GAAG,CAA6C,CAChE,CAAC;gBACF,OAAQ,GAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzC,CAAC,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI;QACf,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;CACF,CAAC,CAAC"}

package/lib/Util/scc.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Compute the set of graph nodes that participate in a dependency cycle.
+ *
+ * A node is considered "in a cycle" iff it sits in a strongly-connected
+ * component (SCC) of size > 1, or has a self-edge (size-1 SCC that loops
+ * back to itself).
+ *
+ * Implementation is iterative Tarjan's algorithm to avoid blowing the JS
+ * call stack on very wide graphs.
+ */
+export declare const findCycleMembers: (edges: Record<string, readonly string[]>) => Set<string>;
+//# sourceMappingURL=scc.d.ts.map

package/lib/Util/scc.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scc.d.ts","sourceRoot":"","sources":["../../src/Util/scc.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,eAAO,MAAM,gBAAgB,GAC3B,OAAO,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,KACvC,GAAG,CAAC,MAAM,CA4EZ,CAAC"}

package/lib/Util/scc.js

@@ -0,0 +1,81 @@
+/**
+ * Compute the set of graph nodes that participate in a dependency cycle.
+ *
+ * A node is considered "in a cycle" iff it sits in a strongly-connected
+ * component (SCC) of size > 1, or has a self-edge (size-1 SCC that loops
+ * back to itself).
+ *
+ * Implementation is iterative Tarjan's algorithm to avoid blowing the JS
+ * call stack on very wide graphs.
+ */
+export const findCycleMembers = (edges) => {
+    const cycleMembers = new Set();
+    let index = 0;
+    const indexOf = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const callStack = [];
+    const startNode = (node) => {
+        indexOf.set(node, index);
+        lowlink.set(node, index);
+        index += 1;
+        stack.push(node);
+        onStack.add(node);
+        callStack.push({ node, childIdx: 0 });
+    };
+    for (const root of Object.keys(edges)) {
+        if (indexOf.has(root))
+            continue;
+        startNode(root);
+        while (callStack.length > 0) {
+            const frame = callStack[callStack.length - 1];
+            const children = edges[frame.node] ?? [];
+            if (frame.childIdx < children.length) {
+                const child = children[frame.childIdx];
+                frame.childIdx += 1;
+                if (!indexOf.has(child)) {
+                    startNode(child);
+                    continue;
+                }
+                if (onStack.has(child)) {
+                    lowlink.set(frame.node, Math.min(lowlink.get(frame.node), indexOf.get(child)));
+                }
+                continue;
+            }
+            // All children processed: maybe close an SCC.
+            if (lowlink.get(frame.node) === indexOf.get(frame.node)) {
+                const scc = [];
+                for (;;) {
+                    const w = stack.pop();
+                    onStack.delete(w);
+                    scc.push(w);
+                    if (w === frame.node)
+                        break;
+                }
+                if (scc.length > 1) {
+                    for (const fqn of scc)
+                        cycleMembers.add(fqn);
+                }
+                else {
+                    // Size-1 SCC: only counts as a cycle if it has a self-edge.
+                    const only = scc[0];
+                    if ((edges[only] ?? []).includes(only)) {
+                        cycleMembers.add(only);
+                    }
+                }
+            }
+            // Pop frame and propagate lowlink up to the parent.
+            callStack.pop();
+            const parent = callStack[callStack.length - 1];
+            if (parent) {
+                const cur = lowlink.get(parent.node);
+                const childLow = lowlink.get(frame.node);
+                if (childLow < cur)
+                    lowlink.set(parent.node, childLow);
+            }
+        }
+    }
+    return cycleMembers;
+};
+//# sourceMappingURL=scc.js.map

package/lib/Util/scc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scc.js","sourceRoot":"","sources":["../../src/Util/scc.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,KAAwC,EAC3B,EAAE;IACf,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAG3B,MAAM,SAAS,GAAY,EAAE,CAAC;IAE9B,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,EAAE;QACjC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzB,KAAK,IAAI,CAAC,CAAC;QACX,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAChC,SAAS,CAAC,IAAI,CAAC,CAAC;QAEhB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACvC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACpB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,SAAS,CAAC,KAAK,CAAC,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACvB,OAAO,CAAC,GAAG,CACT,KAAK,CAAC,IAAI,EACV,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CACxD,CAAC;gBACJ,CAAC;gBACD,SAAS;YACX,CAAC;YAED,8CAA8C;YAC9C,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxD,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,SAAS,CAAC;oBACR,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBACvB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACZ,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI;wBAAE,MAAM;gBAC9B,CAAC;gBACD,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACnB,KAAK,MAAM,GAAG,IAAI,GAAG;wBAAE,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC/C,CAAC;qBAAM,CAAC;oBACN,4DAA4D;oBAC5D,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBACpB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;wBACvC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,oDAAoD;YACpD,SAAS,CAAC,GAAG,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC;gBACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;gBAC1C,IAAI,QAAQ,GAAG,GAAG;oBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC,CAAC"}

package/lib/Util/schema-to-type.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Converts an Effect Schema to TypeScript type definitions.
+ *
+ * This module recursively discovers all named types (like S.Class with identifiers)
+ * and generates interface definitions for each.
+ *
+ * @module
+ */
+import type * as Schema from "effect/Schema";
+import * as AST from "effect/SchemaAST";
+/**
+ * The result of generating TypeScript type definitions.
+ */
+export interface TypeDefinitionResult {
+    /**
+     * The type expressions for each input schema.
+     * Each expression is either an identifier (for named types) or an inline type.
+     */
+    readonly exprs: string[];
+    /**
+     * All type definitions as a single string.
+     * Contains all recursively discovered named types, separated by newlines.
+     * Types are deduplicated - if multiple schemas reference the same type,
+     * it will only appear once.
+     */
+    readonly types: string;
+}
+/**
+ * Generates TypeScript type definitions from one or more schemas.
+ *
+ * All schemas share a single type environment, so types referenced by
+ * multiple schemas are only generated once (deduplication).
+ */
+export declare const schemaToType: <Schemas extends Schema.Schema<any>[]>(...schemas: Schemas) => TypeDefinitionResult;
+/**
+ * Converts an AST node to a TypeScript type reference or inline type.
+ * Returns the identifier/type expression and collects named types.
+ */
+export declare const fromAST: (ast: AST.AST, options?: {
+    types?: string[];
+}) => string;
+//# sourceMappingURL=schema-to-type.d.ts.map

package/lib/Util/schema-to-type.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema-to-type.d.ts","sourceRoot":"","sources":["../../src/Util/schema-to-type.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAC;AAC7C,OAAO,KAAK,GAAG,MAAM,kBAAkB,CAAC;AAExC;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC;IAEzB;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;GAKG;AACH,eAAO,MAAM,YAAY,GAAI,OAAO,SAAS,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAC/D,GAAG,SAAS,OAAO,KAClB,oBAcF,CAAC;AAOF;;;GAGG;AACH,eAAO,MAAM,OAAO,GAClB,KAAK,GAAG,CAAC,GAAG,EACZ,UAAU;IAAE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,KAC7B,MAYF,CAAC"}