better-call 0.0.0-experimental.06264e12

package/dist/var.cjs

@@ -0,0 +1,162 @@
+const require_error = require("./error.cjs");
+const require_schema = require("./schema.cjs");
+const require_module = require("./module.cjs");
+const require_fn = require("./fn.cjs");
+//#region src/var.ts
+const varRegistry = /* @__PURE__ */ new Map();
+const makeVar = (name, options = {}) => {
+	const schema = options.schema === void 0 ? void 0 : require_schema.asType(options.schema);
+	const def = {
+		$var: true,
+		name,
+		default: options.default,
+		schema,
+		$accessor: options.accessor === true,
+		$derive: options.derive,
+		customize: (opts) => makeVar(name, {
+			...options,
+			default: def.default,
+			schema: opts.schema({
+				...require_schema.vTypes,
+				fn: require_fn.fnImpl,
+				add: (shape) => ({
+					name: "object",
+					shape: {
+						...def.schema?.shape ?? {},
+						...shape
+					}
+				}),
+				replace: (schema) => schema
+			})
+		})
+	};
+	varRegistry.set(name, def);
+	return def;
+};
+/**
+* Derive a var from another: computed lazily off the source on every read,
+* so setting the source "sets" every var derived from it. Writing a
+* derived var directly shadows the computation for that scope.
+*/
+const deriveVar = (name, source, get) => makeVar(name, { derive: {
+	source: source.name,
+	get
+} });
+/** Cells materialize lazily from the registry on first touch. */
+const getCell = (cells, name) => {
+	const existing = cells[name];
+	if (existing) return existing;
+	const def = varRegistry.get(name);
+	const cell = {
+		value: def?.$derive ? void 0 : def?.$accessor ? {} : def?.default,
+		derive: def?.$derive,
+		shadowed: false,
+		accumulate: def?.$accessor === true
+	};
+	cells[name] = cell;
+	return cell;
+};
+/** The current value, deriveds computed off their source. A name never
+* declared and never written reads `undefined` WITHOUT materializing a
+* cell - property probes on the context must not pollute the scope. */
+const readVar = (cells, name) => {
+	if (!cells[name] && !varRegistry.has(name)) return void 0;
+	const cell = getCell(cells, name);
+	if (cell.derive && !cell.shadowed) {
+		const src = readVar(cells, cell.derive.source);
+		return src == null ? null : cell.derive.get(src);
+	}
+	return cell.value;
+};
+/**
+* A handler's `c`: its own fields (`name`, `value`, `fn`) in front, every
+* other property a RAW read of the scope's vars - so a handler reading
+* `c.<var>` cannot recurse into its own get hook.
+*/
+const handlerContext = (cells, base) => new Proxy(base, {
+	get: (t, prop) => prop in t ? t[prop] : typeof prop === "string" ? readVar(cells, prop) : void 0,
+	has: (t, prop) => prop in t || typeof prop === "string" && prop in cells
+});
+const isThenable = (value) => typeof value?.then === "function";
+/**
+* Every write funnels here: the readonly lock beats everything, then the
+* matching `var.set.<name>` entries run SYNCHRONOUSLY around the actual
+* write - call `next()` to land it, skip to cancel, throw to abort. The
+* bare "*" target means "every fn", never "every var write".
+*/
+const writeVar = (frame, name, value) => {
+	if (frame.lockedBy) throw new require_error.ValidationError(`${frame.key}.readonly`, `"${frame.lockedBy}" is readonly: attempted to write var "${name}"`);
+	const cell = getCell(frame.cells, name);
+	const merged = () => {
+		const current = cell.derive && !cell.shadowed ? readVar(frame.cells, name) : cell.value;
+		return {
+			...typeof current === "object" && current !== null ? current : {},
+			...value
+		};
+	};
+	const next = cell.accumulate ? merged() : value;
+	const apply = () => {
+		cell.value = next;
+		if (cell.derive) cell.shadowed = true;
+	};
+	const hooks = frame.entries.filter((e) => e.target !== "*" && require_module.matchesTarget(e.target, `var.set.${name}`));
+	if (hooks.length === 0) return apply();
+	hooks.reduceRight((proceed, entry) => () => {
+		const result = entry.handler(handlerContext(frame.cells, {
+			name,
+			value: next,
+			fn: frame.key
+		}), proceed);
+		if (isThenable(result)) throw new require_error.ValidationError(`${frame.key}.set`, `var-set handlers must be synchronous - "${String(entry.target)}" returned a promise`);
+	}, apply)();
+};
+/**
+* Context reads funnel here: matching `var.get.<name>` entries run
+* SYNCHRONOUSLY around the raw read - `next()` yields the stored value and
+* whatever the handler returns becomes the read result. Internal reads
+* stay raw: derive sources, handler contexts (so a handler reading a var
+* off `c` cannot recurse into itself) and contract checks all see the
+* cell as-is.
+*/
+const readVarThrough = (frame, name) => {
+	const hooks = frame.entries.filter((e) => e.target !== "*" && require_module.matchesTarget(e.target, `var.get.${name}`));
+	if (hooks.length === 0) return readVar(frame.cells, name);
+	return hooks.reduceRight((proceed, entry) => () => {
+		const result = entry.handler(handlerContext(frame.cells, {
+			name,
+			fn: frame.key
+		}), proceed);
+		if (isThenable(result)) throw new require_error.ValidationError(`${frame.key}.get`, `var-get handlers must be synchronous - "${String(entry.target)}" returned a promise`);
+		return result;
+	}, () => readVar(frame.cells, name))();
+};
+/**
+* The fn context for one frame: `base` carries the fixed surface (input,
+* error, fn, types, the bound `use` fns, internal symbols) and EVERY
+* other property is a var - read it directly (`c.session.userId`) and
+* write it by plain assignment (`c.session = {...}`). Reads route through
+* the `var.get` entries, writes through `writeVar` (readonly lock,
+* `var.set` entries), and both are always synchronous. Base keys shadow
+* vars of the same name, both ways.
+*/
+const contextScope = (frame, base) => new Proxy(base, {
+	get: (t, prop, receiver) => prop in t ? Reflect.get(t, prop, receiver) : typeof prop === "string" ? readVarThrough(frame, prop) : void 0,
+	set: (t, prop, value, receiver) => {
+		if (typeof prop !== "string" || prop in t) return Reflect.set(t, prop, value, receiver);
+		writeVar(frame, prop, value);
+		return true;
+	},
+	has: (t, prop) => prop in t || typeof prop === "string"
+});
+//#endregion
+exports.contextScope = contextScope;
+exports.deriveVar = deriveVar;
+exports.getCell = getCell;
+exports.handlerContext = handlerContext;
+exports.makeVar = makeVar;
+exports.readVar = readVar;
+exports.readVarThrough = readVarThrough;
+exports.varRegistry = varRegistry;
+exports.writeVar = writeVar;
+
+//# sourceMappingURL=var.cjs.map

package/dist/var.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"var.cjs","names":["asType","vTypes","fnImpl","ValidationError","matchesTarget"],"sources":["../src/var.ts"],"sourcesContent":["import { ValidationError } from \"./error\";\n// Cycle with fn.ts (it imports our cells): fine, `fnImpl` is only touched\n// inside the lazy `customize` closure, never during module evaluation.\nimport { type Fn, fnImpl } from \"./fn\";\nimport { matchesTarget, type OnEntry } from \"./module\";\nimport {\n\tasType,\n\ttype DefineOutput,\n\ttype InferArgs,\n\ttype InferInput,\n\ttype TypeDefination,\n\tvTypes,\n} from \"./schema\";\nimport type { LiteralString, Prettify } from \"./types\";\n\nexport interface VarDefination<\n\tN extends LiteralString,\n\tT,\n\tSchema = unknown,\n\tSource extends string = never,\n> {\n\t$var: true;\n\tname: N;\n\tdefault?: T;\n\t/** Kept in the type so the var can also be used as an input field. */\n\tschema?: Schema;\n\ttype?: T;\n\t/** Phantom: the var this one derives from - `requires` on the source\n\t * makes this one non-null too. */\n\t$source?: Source;\n\tcustomize: <S>(options: {\n\t\tschema: (v: VarCustomizer<T>) => S;\n\t}) => VarDefination<N, InferInput<S>, S>;\n}\n\nexport type ValueOfVar<SV> =\n\tSV extends VarDefination<any, infer T, any, any> ? T : never;\n\nexport type NameOfVar<SV> =\n\tSV extends VarDefination<infer N, any, any, any> ? N : never;\n\n/**\n * The toolkit a `customize` callback receives. It is a SUPERSET of `v`'s\n * type constructors on purpose - the callback parameter shadows `v`, so\n * `(v) => v.add({ role: v.string() })` has to keep working.\n */\nexport type VarCustomizer<T> = typeof vTypes & {\n\t/** Declare a fn-typed field: bare `fn` is \"any function\",\n\t * `fn({ input, output })` a specific signature. */\n\tfn: Fn;\n\t// The args side goes through InferArgs, not a plain key-for-key map, so\n\t// an `optional`/defaulted added field is optional to SEND as well - the\n\t// same rule `v.object` applies to its shape.\n\tadd: <S>(\n\t\tshape: S,\n\t) => TypeDefination<InferArgs<S>, Prettify<NonNullable<T> & DefineOutput<S>>>;\n\treplace: <S>(schema: S) => S;\n};\n\nexport type VarMap = Record<string, VarDefination<any, any, any, any>>;\n\nexport const varRegistry = new Map<string, any>();\n\nexport const makeVar = (name: string, options: any = {}): any => {\n\tconst schema =\n\t\toptions.schema === undefined ? undefined : asType(options.schema);\n\tconst def: any = {\n\t\t$var: true,\n\t\tname,\n\t\tdefault: options.default,\n\t\tschema,\n\t\t$accessor: options.accessor === true,\n\t\t$derive: options.derive,\n\t\tcustomize: (opts: any) =>\n\t\t\tmakeVar(name, {\n\t\t\t\t...options,\n\t\t\t\tdefault: def.default,\n\t\t\t\tschema: opts.schema({\n\t\t\t\t\t...vTypes,\n\t\t\t\t\tfn: fnImpl,\n\t\t\t\t\tadd: (shape: any) => ({\n\t\t\t\t\t\tname: \"object\",\n\t\t\t\t\t\tshape: { ...((def.schema?.shape as any) ?? {}), ...shape },\n\t\t\t\t\t}),\n\t\t\t\t\treplace: (schema: any) => schema,\n\t\t\t\t}),\n\t\t\t}),\n\t};\n\tvarRegistry.set(name, def);\n\treturn def;\n};\n\n/**\n * Derive a var from another: computed lazily off the source on every read,\n * so setting the source \"sets\" every var derived from it. Writing a\n * derived var directly shadows the computation for that scope.\n */\nexport const deriveVar = (name: string, source: any, get: any): any =>\n\tmakeVar(name, { derive: { source: source.name, get } });\n\n/* ---------------------------------- cells ---------------------------------- */\n\n/**\n * One var's state within a scope: the current value, plus how reads and\n * writes behave for it (derived computation, record accumulation).\n */\nexport type Cell = {\n\tvalue: unknown;\n\tderive?: { source: string; get: (value: any) => any };\n\t/** A direct write to a derived var shadows its computation. */\n\tshadowed: boolean;\n\t/** Record var: `set()` merges instead of replacing. */\n\taccumulate: boolean;\n};\n\nexport type Cells = Record<string, Cell>;\n\n/** Cells materialize lazily from the registry on first touch. */\nexport const getCell = (cells: Cells, name: string): Cell => {\n\tconst existing = cells[name];\n\tif (existing) return existing;\n\tconst def = varRegistry.get(name);\n\tconst cell: Cell = {\n\t\tvalue: def?.$derive ? undefined : def?.$accessor ? {} : def?.default,\n\t\tderive: def?.$derive,\n\t\tshadowed: false,\n\t\taccumulate: def?.$accessor === true,\n\t};\n\tcells[name] = cell;\n\treturn cell;\n};\n\n/** The current value, deriveds computed off their source. A name never\n * declared and never written reads `undefined` WITHOUT materializing a\n * cell - property probes on the context must not pollute the scope. */\nexport const readVar = (cells: Cells, name: string): unknown => {\n\tif (!cells[name] && !varRegistry.has(name)) return undefined;\n\tconst cell = getCell(cells, name);\n\tif (cell.derive && !cell.shadowed) {\n\t\tconst src = readVar(cells, cell.derive.source);\n\t\treturn src == null ? null : cell.derive.get(src);\n\t}\n\treturn cell.value;\n};\n\n/**\n * A handler's `c`: its own fields (`name`, `value`, `fn`) in front, every\n * other property a RAW read of the scope's vars - so a handler reading\n * `c.<var>` cannot recurse into its own get hook.\n */\nexport const handlerContext = (\n\tcells: Cells,\n\tbase: Record<string, unknown>,\n): Record<string, unknown> =>\n\tnew Proxy(base, {\n\t\tget: (t, prop) =>\n\t\t\tprop in t\n\t\t\t\t? (t as any)[prop]\n\t\t\t\t: typeof prop === \"string\"\n\t\t\t\t\t? readVar(cells, prop)\n\t\t\t\t\t: undefined,\n\t\thas: (t, prop) => prop in t || (typeof prop === \"string\" && prop in cells),\n\t});\n\n/* ---------------------------------- frame ---------------------------------- */\n\n/**\n * What a handle needs to know about the fn frame it was created in: the\n * scope's cells, plus everything write behavior depends on there.\n */\nexport type Frame = {\n\tcells: Cells;\n\tkey: string;\n\tlockedBy: string | undefined;\n\tentries: readonly OnEntry<string>[];\n};\n\nconst isThenable = (value: any): value is Promise<unknown> =>\n\ttypeof value?.then === \"function\";\n\n/**\n * Every write funnels here: the readonly lock beats everything, then the\n * matching `var.set.<name>` entries run SYNCHRONOUSLY around the actual\n * write - call `next()` to land it, skip to cancel, throw to abort. The\n * bare \"*\" target means \"every fn\", never \"every var write\".\n */\nexport const writeVar = (frame: Frame, name: string, value: unknown) => {\n\tif (frame.lockedBy) {\n\t\tthrow new ValidationError(\n\t\t\t`${frame.key}.readonly`,\n\t\t\t`\"${frame.lockedBy}\" is readonly: attempted to write var \"${name}\"`,\n\t\t);\n\t}\n\tconst cell = getCell(frame.cells, name);\n\tconst merged = () => {\n\t\tconst current =\n\t\t\tcell.derive && !cell.shadowed ? readVar(frame.cells, name) : cell.value;\n\t\tconst base = typeof current === \"object\" && current !== null ? current : {};\n\t\treturn { ...base, ...(value as Record<string, unknown>) };\n\t};\n\tconst next = cell.accumulate ? merged() : value;\n\tconst apply = () => {\n\t\tcell.value = next;\n\t\tif (cell.derive) cell.shadowed = true;\n\t};\n\tconst hooks = frame.entries.filter(\n\t\t(e) => e.target !== \"*\" && matchesTarget(e.target, `var.set.${name}`),\n\t);\n\tif (hooks.length === 0) return apply();\n\tconst chain = hooks.reduceRight<() => void>(\n\t\t(proceed, entry) => () => {\n\t\t\tconst result = entry.handler(\n\t\t\t\thandlerContext(frame.cells, {\n\t\t\t\t\tname,\n\t\t\t\t\tvalue: next,\n\t\t\t\t\tfn: frame.key,\n\t\t\t\t}) as any,\n\t\t\t\tproceed as any,\n\t\t\t);\n\t\t\tif (isThenable(result)) {\n\t\t\t\tthrow new ValidationError(\n\t\t\t\t\t`${frame.key}.set`,\n\t\t\t\t\t`var-set handlers must be synchronous - \"${String(entry.target)}\" returned a promise`,\n\t\t\t\t);\n\t\t\t}\n\t\t},\n\t\tapply,\n\t);\n\tchain();\n};\n\n/**\n * Context reads funnel here: matching `var.get.<name>` entries run\n * SYNCHRONOUSLY around the raw read - `next()` yields the stored value and\n * whatever the handler returns becomes the read result. Internal reads\n * stay raw: derive sources, handler contexts (so a handler reading a var\n * off `c` cannot recurse into itself) and contract checks all see the\n * cell as-is.\n */\nexport const readVarThrough = (frame: Frame, name: string): unknown => {\n\tconst hooks = frame.entries.filter(\n\t\t(e) => e.target !== \"*\" && matchesTarget(e.target, `var.get.${name}`),\n\t);\n\tif (hooks.length === 0) return readVar(frame.cells, name);\n\tconst chain = hooks.reduceRight<() => unknown>(\n\t\t(proceed, entry) => () => {\n\t\t\tconst result = entry.handler(\n\t\t\t\thandlerContext(frame.cells, {\n\t\t\t\t\tname,\n\t\t\t\t\tfn: frame.key,\n\t\t\t\t}) as any,\n\t\t\t\tproceed as any,\n\t\t\t);\n\t\t\tif (isThenable(result)) {\n\t\t\t\tthrow new ValidationError(\n\t\t\t\t\t`${frame.key}.get`,\n\t\t\t\t\t`var-get handlers must be synchronous - \"${String(entry.target)}\" returned a promise`,\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn result;\n\t\t},\n\t\t() => readVar(frame.cells, name),\n\t);\n\treturn chain();\n};\n\n/* ---------------------------------- scope ---------------------------------- */\n\n/**\n * The fn context for one frame: `base` carries the fixed surface (input,\n * error, fn, types, the bound `use` fns, internal symbols) and EVERY\n * other property is a var - read it directly (`c.session.userId`) and\n * write it by plain assignment (`c.session = {...}`). Reads route through\n * the `var.get` entries, writes through `writeVar` (readonly lock,\n * `var.set` entries), and both are always synchronous. Base keys shadow\n * vars of the same name, both ways.\n */\nexport const contextScope = (frame: Frame, base: object): any =>\n\tnew Proxy(base, {\n\t\tget: (t, prop, receiver) =>\n\t\t\tprop in t\n\t\t\t\t? Reflect.get(t, prop, receiver)\n\t\t\t\t: typeof prop === \"string\"\n\t\t\t\t\t? readVarThrough(frame, prop)\n\t\t\t\t\t: undefined,\n\t\tset: (t, prop, value, receiver) => {\n\t\t\tif (typeof prop !== \"string\" || prop in t) {\n\t\t\t\treturn Reflect.set(t, prop, value, receiver);\n\t\t\t}\n\t\t\twriteVar(frame, prop, value);\n\t\t\treturn true;\n\t\t},\n\t\thas: (t, prop) => prop in t || typeof prop === \"string\",\n\t});\n"],"mappings":";;;;;AA6DA,MAAa,8BAAc,IAAI,IAAiB;AAEhD,MAAa,WAAW,MAAc,UAAe,CAAC,MAAW;CAChE,MAAM,SACL,QAAQ,WAAW,KAAA,IAAY,KAAA,IAAYA,eAAAA,OAAO,QAAQ,MAAM;CACjE,MAAM,MAAW;EAChB,MAAM;EACN;EACA,SAAS,QAAQ;EACjB;EACA,WAAW,QAAQ,aAAa;EAChC,SAAS,QAAQ;EACjB,YAAY,SACX,QAAQ,MAAM;GACb,GAAG;GACH,SAAS,IAAI;GACb,QAAQ,KAAK,OAAO;IACnB,GAAGC,eAAAA;IACH,IAAIC,WAAAA;IACJ,MAAM,WAAgB;KACrB,MAAM;KACN,OAAO;MAAE,GAAK,IAAI,QAAQ,SAAiB,CAAC;MAAI,GAAG;KAAM;IAC1D;IACA,UAAU,WAAgB;GAC3B,CAAC;EACF,CAAC;CACH;CACA,YAAY,IAAI,MAAM,GAAG;CACzB,OAAO;AACR;;;;;;AAOA,MAAa,aAAa,MAAc,QAAa,QACpD,QAAQ,MAAM,EAAE,QAAQ;CAAE,QAAQ,OAAO;CAAM;AAAI,EAAE,CAAC;;AAoBvD,MAAa,WAAW,OAAc,SAAuB;CAC5D,MAAM,WAAW,MAAM;CACvB,IAAI,UAAU,OAAO;CACrB,MAAM,MAAM,YAAY,IAAI,IAAI;CAChC,MAAM,OAAa;EAClB,OAAO,KAAK,UAAU,KAAA,IAAY,KAAK,YAAY,CAAC,IAAI,KAAK;EAC7D,QAAQ,KAAK;EACb,UAAU;EACV,YAAY,KAAK,cAAc;CAChC;CACA,MAAM,QAAQ;CACd,OAAO;AACR;;;;AAKA,MAAa,WAAW,OAAc,SAA0B;CAC/D,IAAI,CAAC,MAAM,SAAS,CAAC,YAAY,IAAI,IAAI,GAAG,OAAO,KAAA;CACnD,MAAM,OAAO,QAAQ,OAAO,IAAI;CAChC,IAAI,KAAK,UAAU,CAAC,KAAK,UAAU;EAClC,MAAM,MAAM,QAAQ,OAAO,KAAK,OAAO,MAAM;EAC7C,OAAO,OAAO,OAAO,OAAO,KAAK,OAAO,IAAI,GAAG;CAChD;CACA,OAAO,KAAK;AACb;;;;;;AAOA,MAAa,kBACZ,OACA,SAEA,IAAI,MAAM,MAAM;CACf,MAAM,GAAG,SACR,QAAQ,IACJ,EAAU,QACX,OAAO,SAAS,WACf,QAAQ,OAAO,IAAI,IACnB,KAAA;CACL,MAAM,GAAG,SAAS,QAAQ,KAAM,OAAO,SAAS,YAAY,QAAQ;AACrE,CAAC;AAeF,MAAM,cAAc,UACnB,OAAO,OAAO,SAAS;;;;;;;AAQxB,MAAa,YAAY,OAAc,MAAc,UAAmB;CACvE,IAAI,MAAM,UACT,MAAM,IAAIC,cAAAA,gBACT,GAAG,MAAM,IAAI,YACb,IAAI,MAAM,SAAS,yCAAyC,KAAK,EAClE;CAED,MAAM,OAAO,QAAQ,MAAM,OAAO,IAAI;CACtC,MAAM,eAAe;EACpB,MAAM,UACL,KAAK,UAAU,CAAC,KAAK,WAAW,QAAQ,MAAM,OAAO,IAAI,IAAI,KAAK;EAEnE,OAAO;GAAE,GADI,OAAO,YAAY,YAAY,YAAY,OAAO,UAAU,CAAC;GACxD,GAAI;EAAkC;CACzD;CACA,MAAM,OAAO,KAAK,aAAa,OAAO,IAAI;CAC1C,MAAM,cAAc;EACnB,KAAK,QAAQ;EACb,IAAI,KAAK,QAAQ,KAAK,WAAW;CAClC;CACA,MAAM,QAAQ,MAAM,QAAQ,QAC1B,MAAM,EAAE,WAAW,OAAOC,eAAAA,cAAc,EAAE,QAAQ,WAAW,MAAM,CACrE;CACA,IAAI,MAAM,WAAW,GAAG,OAAO,MAAM;CAoBrC,MAnBoB,aAClB,SAAS,gBAAgB;EACzB,MAAM,SAAS,MAAM,QACpB,eAAe,MAAM,OAAO;GAC3B;GACA,OAAO;GACP,IAAI,MAAM;EACX,CAAC,GACD,OACD;EACA,IAAI,WAAW,MAAM,GACpB,MAAM,IAAID,cAAAA,gBACT,GAAG,MAAM,IAAI,OACb,2CAA2C,OAAO,MAAM,MAAM,EAAE,qBACjE;CAEF,GACA,KAEG,CAAC,CAAC;AACP;;;;;;;;;AAUA,MAAa,kBAAkB,OAAc,SAA0B;CACtE,MAAM,QAAQ,MAAM,QAAQ,QAC1B,MAAM,EAAE,WAAW,OAAOC,eAAAA,cAAc,EAAE,QAAQ,WAAW,MAAM,CACrE;CACA,IAAI,MAAM,WAAW,GAAG,OAAO,QAAQ,MAAM,OAAO,IAAI;CAoBxD,OAnBc,MAAM,aAClB,SAAS,gBAAgB;EACzB,MAAM,SAAS,MAAM,QACpB,eAAe,MAAM,OAAO;GAC3B;GACA,IAAI,MAAM;EACX,CAAC,GACD,OACD;EACA,IAAI,WAAW,MAAM,GACpB,MAAM,IAAID,cAAAA,gBACT,GAAG,MAAM,IAAI,OACb,2CAA2C,OAAO,MAAM,MAAM,EAAE,qBACjE;EAED,OAAO;CACR,SACM,QAAQ,MAAM,OAAO,IAAI,CAErB,CAAC,CAAC;AACd;;;;;;;;;;AAaA,MAAa,gBAAgB,OAAc,SAC1C,IAAI,MAAM,MAAM;CACf,MAAM,GAAG,MAAM,aACd,QAAQ,IACL,QAAQ,IAAI,GAAG,MAAM,QAAQ,IAC7B,OAAO,SAAS,WACf,eAAe,OAAO,IAAI,IAC1B,KAAA;CACL,MAAM,GAAG,MAAM,OAAO,aAAa;EAClC,IAAI,OAAO,SAAS,YAAY,QAAQ,GACvC,OAAO,QAAQ,IAAI,GAAG,MAAM,OAAO,QAAQ;EAE5C,SAAS,OAAO,MAAM,KAAK;EAC3B,OAAO;CACR;CACA,MAAM,GAAG,SAAS,QAAQ,KAAK,OAAO,SAAS;AAChD,CAAC"}

package/dist/var.d.cts

@@ -0,0 +1,36 @@
+import { LiteralString, Prettify } from "./types.cjs";
+import { DefineOutput, InferArgs, InferInput, TypeDefination, vTypes } from "./schema.cjs";
+import { Fn } from "./fn.cjs";
+//#region src/var.d.ts
+interface VarDefination<N extends LiteralString, T, Schema = unknown, Source extends string = never> {
+  $var: true;
+  name: N;
+  default?: T;
+  /** Kept in the type so the var can also be used as an input field. */
+  schema?: Schema;
+  type?: T;
+  /** Phantom: the var this one derives from - `requires` on the source
+   * makes this one non-null too. */
+  $source?: Source;
+  customize: <S>(options: {
+    schema: (v: VarCustomizer<T>) => S;
+  }) => VarDefination<N, InferInput<S>, S>;
+}
+type ValueOfVar<SV> = SV extends VarDefination<any, infer T, any, any> ? T : never;
+type NameOfVar<SV> = SV extends VarDefination<infer N, any, any, any> ? N : never;
+/**
+ * The toolkit a `customize` callback receives. It is a SUPERSET of `v`'s
+ * type constructors on purpose - the callback parameter shadows `v`, so
+ * `(v) => v.add({ role: v.string() })` has to keep working.
+ */
+type VarCustomizer<T> = typeof vTypes & {
+  /** Declare a fn-typed field: bare `fn` is "any function",
+   * `fn({ input, output })` a specific signature. */
+  fn: Fn;
+  add: <S>(shape: S) => TypeDefination<InferArgs<S>, Prettify<NonNullable<T> & DefineOutput<S>>>;
+  replace: <S>(schema: S) => S;
+};
+type VarMap = Record<string, VarDefination<any, any, any, any>>;
+//#endregion
+export { NameOfVar, ValueOfVar, VarCustomizer, VarDefination, VarMap };
+//# sourceMappingURL=var.d.cts.map

package/dist/var.d.mts

@@ -0,0 +1,36 @@
+import { LiteralString, Prettify } from "./types.mjs";
+import { DefineOutput, InferArgs, InferInput, TypeDefination, vTypes } from "./schema.mjs";
+import { Fn } from "./fn.mjs";
+//#region src/var.d.ts
+interface VarDefination<N extends LiteralString, T, Schema = unknown, Source extends string = never> {
+  $var: true;
+  name: N;
+  default?: T;
+  /** Kept in the type so the var can also be used as an input field. */
+  schema?: Schema;
+  type?: T;
+  /** Phantom: the var this one derives from - `requires` on the source
+   * makes this one non-null too. */
+  $source?: Source;
+  customize: <S>(options: {
+    schema: (v: VarCustomizer<T>) => S;
+  }) => VarDefination<N, InferInput<S>, S>;
+}
+type ValueOfVar<SV> = SV extends VarDefination<any, infer T, any, any> ? T : never;
+type NameOfVar<SV> = SV extends VarDefination<infer N, any, any, any> ? N : never;
+/**
+ * The toolkit a `customize` callback receives. It is a SUPERSET of `v`'s
+ * type constructors on purpose - the callback parameter shadows `v`, so
+ * `(v) => v.add({ role: v.string() })` has to keep working.
+ */
+type VarCustomizer<T> = typeof vTypes & {
+  /** Declare a fn-typed field: bare `fn` is "any function",
+   * `fn({ input, output })` a specific signature. */
+  fn: Fn;
+  add: <S>(shape: S) => TypeDefination<InferArgs<S>, Prettify<NonNullable<T> & DefineOutput<S>>>;
+  replace: <S>(schema: S) => S;
+};
+type VarMap = Record<string, VarDefination<any, any, any, any>>;
+//#endregion
+export { NameOfVar, ValueOfVar, VarCustomizer, VarDefination, VarMap };
+//# sourceMappingURL=var.d.mts.map

package/dist/var.mjs

@@ -0,0 +1,154 @@
+import { ValidationError } from "./error.mjs";
+import { asType, vTypes } from "./schema.mjs";
+import { matchesTarget } from "./module.mjs";
+import { fnImpl } from "./fn.mjs";
+//#region src/var.ts
+const varRegistry = /* @__PURE__ */ new Map();
+const makeVar = (name, options = {}) => {
+	const schema = options.schema === void 0 ? void 0 : asType(options.schema);
+	const def = {
+		$var: true,
+		name,
+		default: options.default,
+		schema,
+		$accessor: options.accessor === true,
+		$derive: options.derive,
+		customize: (opts) => makeVar(name, {
+			...options,
+			default: def.default,
+			schema: opts.schema({
+				...vTypes,
+				fn: fnImpl,
+				add: (shape) => ({
+					name: "object",
+					shape: {
+						...def.schema?.shape ?? {},
+						...shape
+					}
+				}),
+				replace: (schema) => schema
+			})
+		})
+	};
+	varRegistry.set(name, def);
+	return def;
+};
+/**
+* Derive a var from another: computed lazily off the source on every read,
+* so setting the source "sets" every var derived from it. Writing a
+* derived var directly shadows the computation for that scope.
+*/
+const deriveVar = (name, source, get) => makeVar(name, { derive: {
+	source: source.name,
+	get
+} });
+/** Cells materialize lazily from the registry on first touch. */
+const getCell = (cells, name) => {
+	const existing = cells[name];
+	if (existing) return existing;
+	const def = varRegistry.get(name);
+	const cell = {
+		value: def?.$derive ? void 0 : def?.$accessor ? {} : def?.default,
+		derive: def?.$derive,
+		shadowed: false,
+		accumulate: def?.$accessor === true
+	};
+	cells[name] = cell;
+	return cell;
+};
+/** The current value, deriveds computed off their source. A name never
+* declared and never written reads `undefined` WITHOUT materializing a
+* cell - property probes on the context must not pollute the scope. */
+const readVar = (cells, name) => {
+	if (!cells[name] && !varRegistry.has(name)) return void 0;
+	const cell = getCell(cells, name);
+	if (cell.derive && !cell.shadowed) {
+		const src = readVar(cells, cell.derive.source);
+		return src == null ? null : cell.derive.get(src);
+	}
+	return cell.value;
+};
+/**
+* A handler's `c`: its own fields (`name`, `value`, `fn`) in front, every
+* other property a RAW read of the scope's vars - so a handler reading
+* `c.<var>` cannot recurse into its own get hook.
+*/
+const handlerContext = (cells, base) => new Proxy(base, {
+	get: (t, prop) => prop in t ? t[prop] : typeof prop === "string" ? readVar(cells, prop) : void 0,
+	has: (t, prop) => prop in t || typeof prop === "string" && prop in cells
+});
+const isThenable = (value) => typeof value?.then === "function";
+/**
+* Every write funnels here: the readonly lock beats everything, then the
+* matching `var.set.<name>` entries run SYNCHRONOUSLY around the actual
+* write - call `next()` to land it, skip to cancel, throw to abort. The
+* bare "*" target means "every fn", never "every var write".
+*/
+const writeVar = (frame, name, value) => {
+	if (frame.lockedBy) throw new ValidationError(`${frame.key}.readonly`, `"${frame.lockedBy}" is readonly: attempted to write var "${name}"`);
+	const cell = getCell(frame.cells, name);
+	const merged = () => {
+		const current = cell.derive && !cell.shadowed ? readVar(frame.cells, name) : cell.value;
+		return {
+			...typeof current === "object" && current !== null ? current : {},
+			...value
+		};
+	};
+	const next = cell.accumulate ? merged() : value;
+	const apply = () => {
+		cell.value = next;
+		if (cell.derive) cell.shadowed = true;
+	};
+	const hooks = frame.entries.filter((e) => e.target !== "*" && matchesTarget(e.target, `var.set.${name}`));
+	if (hooks.length === 0) return apply();
+	hooks.reduceRight((proceed, entry) => () => {
+		const result = entry.handler(handlerContext(frame.cells, {
+			name,
+			value: next,
+			fn: frame.key
+		}), proceed);
+		if (isThenable(result)) throw new ValidationError(`${frame.key}.set`, `var-set handlers must be synchronous - "${String(entry.target)}" returned a promise`);
+	}, apply)();
+};
+/**
+* Context reads funnel here: matching `var.get.<name>` entries run
+* SYNCHRONOUSLY around the raw read - `next()` yields the stored value and
+* whatever the handler returns becomes the read result. Internal reads
+* stay raw: derive sources, handler contexts (so a handler reading a var
+* off `c` cannot recurse into itself) and contract checks all see the
+* cell as-is.
+*/
+const readVarThrough = (frame, name) => {
+	const hooks = frame.entries.filter((e) => e.target !== "*" && matchesTarget(e.target, `var.get.${name}`));
+	if (hooks.length === 0) return readVar(frame.cells, name);
+	return hooks.reduceRight((proceed, entry) => () => {
+		const result = entry.handler(handlerContext(frame.cells, {
+			name,
+			fn: frame.key
+		}), proceed);
+		if (isThenable(result)) throw new ValidationError(`${frame.key}.get`, `var-get handlers must be synchronous - "${String(entry.target)}" returned a promise`);
+		return result;
+	}, () => readVar(frame.cells, name))();
+};
+/**
+* The fn context for one frame: `base` carries the fixed surface (input,
+* error, fn, types, the bound `use` fns, internal symbols) and EVERY
+* other property is a var - read it directly (`c.session.userId`) and
+* write it by plain assignment (`c.session = {...}`). Reads route through
+* the `var.get` entries, writes through `writeVar` (readonly lock,
+* `var.set` entries), and both are always synchronous. Base keys shadow
+* vars of the same name, both ways.
+*/
+const contextScope = (frame, base) => new Proxy(base, {
+	get: (t, prop, receiver) => prop in t ? Reflect.get(t, prop, receiver) : typeof prop === "string" ? readVarThrough(frame, prop) : void 0,
+	set: (t, prop, value, receiver) => {
+		if (typeof prop !== "string" || prop in t) return Reflect.set(t, prop, value, receiver);
+		writeVar(frame, prop, value);
+		return true;
+	},
+	has: (t, prop) => prop in t || typeof prop === "string"
+});
+//#endregion
+export { contextScope, deriveVar, getCell, handlerContext, makeVar, readVar, readVarThrough, varRegistry, writeVar };
+
+//# sourceMappingURL=var.mjs.map

package/dist/var.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"var.mjs","names":[],"sources":["../src/var.ts"],"sourcesContent":["import { ValidationError } from \"./error\";\n// Cycle with fn.ts (it imports our cells): fine, `fnImpl` is only touched\n// inside the lazy `customize` closure, never during module evaluation.\nimport { type Fn, fnImpl } from \"./fn\";\nimport { matchesTarget, type OnEntry } from \"./module\";\nimport {\n\tasType,\n\ttype DefineOutput,\n\ttype InferArgs,\n\ttype InferInput,\n\ttype TypeDefination,\n\tvTypes,\n} from \"./schema\";\nimport type { LiteralString, Prettify } from \"./types\";\n\nexport interface VarDefination<\n\tN extends LiteralString,\n\tT,\n\tSchema = unknown,\n\tSource extends string = never,\n> {\n\t$var: true;\n\tname: N;\n\tdefault?: T;\n\t/** Kept in the type so the var can also be used as an input field. */\n\tschema?: Schema;\n\ttype?: T;\n\t/** Phantom: the var this one derives from - `requires` on the source\n\t * makes this one non-null too. */\n\t$source?: Source;\n\tcustomize: <S>(options: {\n\t\tschema: (v: VarCustomizer<T>) => S;\n\t}) => VarDefination<N, InferInput<S>, S>;\n}\n\nexport type ValueOfVar<SV> =\n\tSV extends VarDefination<any, infer T, any, any> ? T : never;\n\nexport type NameOfVar<SV> =\n\tSV extends VarDefination<infer N, any, any, any> ? N : never;\n\n/**\n * The toolkit a `customize` callback receives. It is a SUPERSET of `v`'s\n * type constructors on purpose - the callback parameter shadows `v`, so\n * `(v) => v.add({ role: v.string() })` has to keep working.\n */\nexport type VarCustomizer<T> = typeof vTypes & {\n\t/** Declare a fn-typed field: bare `fn` is \"any function\",\n\t * `fn({ input, output })` a specific signature. */\n\tfn: Fn;\n\t// The args side goes through InferArgs, not a plain key-for-key map, so\n\t// an `optional`/defaulted added field is optional to SEND as well - the\n\t// same rule `v.object` applies to its shape.\n\tadd: <S>(\n\t\tshape: S,\n\t) => TypeDefination<InferArgs<S>, Prettify<NonNullable<T> & DefineOutput<S>>>;\n\treplace: <S>(schema: S) => S;\n};\n\nexport type VarMap = Record<string, VarDefination<any, any, any, any>>;\n\nexport const varRegistry = new Map<string, any>();\n\nexport const makeVar = (name: string, options: any = {}): any => {\n\tconst schema =\n\t\toptions.schema === undefined ? undefined : asType(options.schema);\n\tconst def: any = {\n\t\t$var: true,\n\t\tname,\n\t\tdefault: options.default,\n\t\tschema,\n\t\t$accessor: options.accessor === true,\n\t\t$derive: options.derive,\n\t\tcustomize: (opts: any) =>\n\t\t\tmakeVar(name, {\n\t\t\t\t...options,\n\t\t\t\tdefault: def.default,\n\t\t\t\tschema: opts.schema({\n\t\t\t\t\t...vTypes,\n\t\t\t\t\tfn: fnImpl,\n\t\t\t\t\tadd: (shape: any) => ({\n\t\t\t\t\t\tname: \"object\",\n\t\t\t\t\t\tshape: { ...((def.schema?.shape as any) ?? {}), ...shape },\n\t\t\t\t\t}),\n\t\t\t\t\treplace: (schema: any) => schema,\n\t\t\t\t}),\n\t\t\t}),\n\t};\n\tvarRegistry.set(name, def);\n\treturn def;\n};\n\n/**\n * Derive a var from another: computed lazily off the source on every read,\n * so setting the source \"sets\" every var derived from it. Writing a\n * derived var directly shadows the computation for that scope.\n */\nexport const deriveVar = (name: string, source: any, get: any): any =>\n\tmakeVar(name, { derive: { source: source.name, get } });\n\n/* ---------------------------------- cells ---------------------------------- */\n\n/**\n * One var's state within a scope: the current value, plus how reads and\n * writes behave for it (derived computation, record accumulation).\n */\nexport type Cell = {\n\tvalue: unknown;\n\tderive?: { source: string; get: (value: any) => any };\n\t/** A direct write to a derived var shadows its computation. */\n\tshadowed: boolean;\n\t/** Record var: `set()` merges instead of replacing. */\n\taccumulate: boolean;\n};\n\nexport type Cells = Record<string, Cell>;\n\n/** Cells materialize lazily from the registry on first touch. */\nexport const getCell = (cells: Cells, name: string): Cell => {\n\tconst existing = cells[name];\n\tif (existing) return existing;\n\tconst def = varRegistry.get(name);\n\tconst cell: Cell = {\n\t\tvalue: def?.$derive ? undefined : def?.$accessor ? {} : def?.default,\n\t\tderive: def?.$derive,\n\t\tshadowed: false,\n\t\taccumulate: def?.$accessor === true,\n\t};\n\tcells[name] = cell;\n\treturn cell;\n};\n\n/** The current value, deriveds computed off their source. A name never\n * declared and never written reads `undefined` WITHOUT materializing a\n * cell - property probes on the context must not pollute the scope. */\nexport const readVar = (cells: Cells, name: string): unknown => {\n\tif (!cells[name] && !varRegistry.has(name)) return undefined;\n\tconst cell = getCell(cells, name);\n\tif (cell.derive && !cell.shadowed) {\n\t\tconst src = readVar(cells, cell.derive.source);\n\t\treturn src == null ? null : cell.derive.get(src);\n\t}\n\treturn cell.value;\n};\n\n/**\n * A handler's `c`: its own fields (`name`, `value`, `fn`) in front, every\n * other property a RAW read of the scope's vars - so a handler reading\n * `c.<var>` cannot recurse into its own get hook.\n */\nexport const handlerContext = (\n\tcells: Cells,\n\tbase: Record<string, unknown>,\n): Record<string, unknown> =>\n\tnew Proxy(base, {\n\t\tget: (t, prop) =>\n\t\t\tprop in t\n\t\t\t\t? (t as any)[prop]\n\t\t\t\t: typeof prop === \"string\"\n\t\t\t\t\t? readVar(cells, prop)\n\t\t\t\t\t: undefined,\n\t\thas: (t, prop) => prop in t || (typeof prop === \"string\" && prop in cells),\n\t});\n\n/* ---------------------------------- frame ---------------------------------- */\n\n/**\n * What a handle needs to know about the fn frame it was created in: the\n * scope's cells, plus everything write behavior depends on there.\n */\nexport type Frame = {\n\tcells: Cells;\n\tkey: string;\n\tlockedBy: string | undefined;\n\tentries: readonly OnEntry<string>[];\n};\n\nconst isThenable = (value: any): value is Promise<unknown> =>\n\ttypeof value?.then === \"function\";\n\n/**\n * Every write funnels here: the readonly lock beats everything, then the\n * matching `var.set.<name>` entries run SYNCHRONOUSLY around the actual\n * write - call `next()` to land it, skip to cancel, throw to abort. The\n * bare \"*\" target means \"every fn\", never \"every var write\".\n */\nexport const writeVar = (frame: Frame, name: string, value: unknown) => {\n\tif (frame.lockedBy) {\n\t\tthrow new ValidationError(\n\t\t\t`${frame.key}.readonly`,\n\t\t\t`\"${frame.lockedBy}\" is readonly: attempted to write var \"${name}\"`,\n\t\t);\n\t}\n\tconst cell = getCell(frame.cells, name);\n\tconst merged = () => {\n\t\tconst current =\n\t\t\tcell.derive && !cell.shadowed ? readVar(frame.cells, name) : cell.value;\n\t\tconst base = typeof current === \"object\" && current !== null ? current : {};\n\t\treturn { ...base, ...(value as Record<string, unknown>) };\n\t};\n\tconst next = cell.accumulate ? merged() : value;\n\tconst apply = () => {\n\t\tcell.value = next;\n\t\tif (cell.derive) cell.shadowed = true;\n\t};\n\tconst hooks = frame.entries.filter(\n\t\t(e) => e.target !== \"*\" && matchesTarget(e.target, `var.set.${name}`),\n\t);\n\tif (hooks.length === 0) return apply();\n\tconst chain = hooks.reduceRight<() => void>(\n\t\t(proceed, entry) => () => {\n\t\t\tconst result = entry.handler(\n\t\t\t\thandlerContext(frame.cells, {\n\t\t\t\t\tname,\n\t\t\t\t\tvalue: next,\n\t\t\t\t\tfn: frame.key,\n\t\t\t\t}) as any,\n\t\t\t\tproceed as any,\n\t\t\t);\n\t\t\tif (isThenable(result)) {\n\t\t\t\tthrow new ValidationError(\n\t\t\t\t\t`${frame.key}.set`,\n\t\t\t\t\t`var-set handlers must be synchronous - \"${String(entry.target)}\" returned a promise`,\n\t\t\t\t);\n\t\t\t}\n\t\t},\n\t\tapply,\n\t);\n\tchain();\n};\n\n/**\n * Context reads funnel here: matching `var.get.<name>` entries run\n * SYNCHRONOUSLY around the raw read - `next()` yields the stored value and\n * whatever the handler returns becomes the read result. Internal reads\n * stay raw: derive sources, handler contexts (so a handler reading a var\n * off `c` cannot recurse into itself) and contract checks all see the\n * cell as-is.\n */\nexport const readVarThrough = (frame: Frame, name: string): unknown => {\n\tconst hooks = frame.entries.filter(\n\t\t(e) => e.target !== \"*\" && matchesTarget(e.target, `var.get.${name}`),\n\t);\n\tif (hooks.length === 0) return readVar(frame.cells, name);\n\tconst chain = hooks.reduceRight<() => unknown>(\n\t\t(proceed, entry) => () => {\n\t\t\tconst result = entry.handler(\n\t\t\t\thandlerContext(frame.cells, {\n\t\t\t\t\tname,\n\t\t\t\t\tfn: frame.key,\n\t\t\t\t}) as any,\n\t\t\t\tproceed as any,\n\t\t\t);\n\t\t\tif (isThenable(result)) {\n\t\t\t\tthrow new ValidationError(\n\t\t\t\t\t`${frame.key}.get`,\n\t\t\t\t\t`var-get handlers must be synchronous - \"${String(entry.target)}\" returned a promise`,\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn result;\n\t\t},\n\t\t() => readVar(frame.cells, name),\n\t);\n\treturn chain();\n};\n\n/* ---------------------------------- scope ---------------------------------- */\n\n/**\n * The fn context for one frame: `base` carries the fixed surface (input,\n * error, fn, types, the bound `use` fns, internal symbols) and EVERY\n * other property is a var - read it directly (`c.session.userId`) and\n * write it by plain assignment (`c.session = {...}`). Reads route through\n * the `var.get` entries, writes through `writeVar` (readonly lock,\n * `var.set` entries), and both are always synchronous. Base keys shadow\n * vars of the same name, both ways.\n */\nexport const contextScope = (frame: Frame, base: object): any =>\n\tnew Proxy(base, {\n\t\tget: (t, prop, receiver) =>\n\t\t\tprop in t\n\t\t\t\t? Reflect.get(t, prop, receiver)\n\t\t\t\t: typeof prop === \"string\"\n\t\t\t\t\t? readVarThrough(frame, prop)\n\t\t\t\t\t: undefined,\n\t\tset: (t, prop, value, receiver) => {\n\t\t\tif (typeof prop !== \"string\" || prop in t) {\n\t\t\t\treturn Reflect.set(t, prop, value, receiver);\n\t\t\t}\n\t\t\twriteVar(frame, prop, value);\n\t\t\treturn true;\n\t\t},\n\t\thas: (t, prop) => prop in t || typeof prop === \"string\",\n\t});\n"],"mappings":";;;;;AA6DA,MAAa,8BAAc,IAAI,IAAiB;AAEhD,MAAa,WAAW,MAAc,UAAe,CAAC,MAAW;CAChE,MAAM,SACL,QAAQ,WAAW,KAAA,IAAY,KAAA,IAAY,OAAO,QAAQ,MAAM;CACjE,MAAM,MAAW;EAChB,MAAM;EACN;EACA,SAAS,QAAQ;EACjB;EACA,WAAW,QAAQ,aAAa;EAChC,SAAS,QAAQ;EACjB,YAAY,SACX,QAAQ,MAAM;GACb,GAAG;GACH,SAAS,IAAI;GACb,QAAQ,KAAK,OAAO;IACnB,GAAG;IACH,IAAI;IACJ,MAAM,WAAgB;KACrB,MAAM;KACN,OAAO;MAAE,GAAK,IAAI,QAAQ,SAAiB,CAAC;MAAI,GAAG;KAAM;IAC1D;IACA,UAAU,WAAgB;GAC3B,CAAC;EACF,CAAC;CACH;CACA,YAAY,IAAI,MAAM,GAAG;CACzB,OAAO;AACR;;;;;;AAOA,MAAa,aAAa,MAAc,QAAa,QACpD,QAAQ,MAAM,EAAE,QAAQ;CAAE,QAAQ,OAAO;CAAM;AAAI,EAAE,CAAC;;AAoBvD,MAAa,WAAW,OAAc,SAAuB;CAC5D,MAAM,WAAW,MAAM;CACvB,IAAI,UAAU,OAAO;CACrB,MAAM,MAAM,YAAY,IAAI,IAAI;CAChC,MAAM,OAAa;EAClB,OAAO,KAAK,UAAU,KAAA,IAAY,KAAK,YAAY,CAAC,IAAI,KAAK;EAC7D,QAAQ,KAAK;EACb,UAAU;EACV,YAAY,KAAK,cAAc;CAChC;CACA,MAAM,QAAQ;CACd,OAAO;AACR;;;;AAKA,MAAa,WAAW,OAAc,SAA0B;CAC/D,IAAI,CAAC,MAAM,SAAS,CAAC,YAAY,IAAI,IAAI,GAAG,OAAO,KAAA;CACnD,MAAM,OAAO,QAAQ,OAAO,IAAI;CAChC,IAAI,KAAK,UAAU,CAAC,KAAK,UAAU;EAClC,MAAM,MAAM,QAAQ,OAAO,KAAK,OAAO,MAAM;EAC7C,OAAO,OAAO,OAAO,OAAO,KAAK,OAAO,IAAI,GAAG;CAChD;CACA,OAAO,KAAK;AACb;;;;;;AAOA,MAAa,kBACZ,OACA,SAEA,IAAI,MAAM,MAAM;CACf,MAAM,GAAG,SACR,QAAQ,IACJ,EAAU,QACX,OAAO,SAAS,WACf,QAAQ,OAAO,IAAI,IACnB,KAAA;CACL,MAAM,GAAG,SAAS,QAAQ,KAAM,OAAO,SAAS,YAAY,QAAQ;AACrE,CAAC;AAeF,MAAM,cAAc,UACnB,OAAO,OAAO,SAAS;;;;;;;AAQxB,MAAa,YAAY,OAAc,MAAc,UAAmB;CACvE,IAAI,MAAM,UACT,MAAM,IAAI,gBACT,GAAG,MAAM,IAAI,YACb,IAAI,MAAM,SAAS,yCAAyC,KAAK,EAClE;CAED,MAAM,OAAO,QAAQ,MAAM,OAAO,IAAI;CACtC,MAAM,eAAe;EACpB,MAAM,UACL,KAAK,UAAU,CAAC,KAAK,WAAW,QAAQ,MAAM,OAAO,IAAI,IAAI,KAAK;EAEnE,OAAO;GAAE,GADI,OAAO,YAAY,YAAY,YAAY,OAAO,UAAU,CAAC;GACxD,GAAI;EAAkC;CACzD;CACA,MAAM,OAAO,KAAK,aAAa,OAAO,IAAI;CAC1C,MAAM,cAAc;EACnB,KAAK,QAAQ;EACb,IAAI,KAAK,QAAQ,KAAK,WAAW;CAClC;CACA,MAAM,QAAQ,MAAM,QAAQ,QAC1B,MAAM,EAAE,WAAW,OAAO,cAAc,EAAE,QAAQ,WAAW,MAAM,CACrE;CACA,IAAI,MAAM,WAAW,GAAG,OAAO,MAAM;CAoBrC,MAnBoB,aAClB,SAAS,gBAAgB;EACzB,MAAM,SAAS,MAAM,QACpB,eAAe,MAAM,OAAO;GAC3B;GACA,OAAO;GACP,IAAI,MAAM;EACX,CAAC,GACD,OACD;EACA,IAAI,WAAW,MAAM,GACpB,MAAM,IAAI,gBACT,GAAG,MAAM,IAAI,OACb,2CAA2C,OAAO,MAAM,MAAM,EAAE,qBACjE;CAEF,GACA,KAEG,CAAC,CAAC;AACP;;;;;;;;;AAUA,MAAa,kBAAkB,OAAc,SAA0B;CACtE,MAAM,QAAQ,MAAM,QAAQ,QAC1B,MAAM,EAAE,WAAW,OAAO,cAAc,EAAE,QAAQ,WAAW,MAAM,CACrE;CACA,IAAI,MAAM,WAAW,GAAG,OAAO,QAAQ,MAAM,OAAO,IAAI;CAoBxD,OAnBc,MAAM,aAClB,SAAS,gBAAgB;EACzB,MAAM,SAAS,MAAM,QACpB,eAAe,MAAM,OAAO;GAC3B;GACA,IAAI,MAAM;EACX,CAAC,GACD,OACD;EACA,IAAI,WAAW,MAAM,GACpB,MAAM,IAAI,gBACT,GAAG,MAAM,IAAI,OACb,2CAA2C,OAAO,MAAM,MAAM,EAAE,qBACjE;EAED,OAAO;CACR,SACM,QAAQ,MAAM,OAAO,IAAI,CAErB,CAAC,CAAC;AACd;;;;;;;;;;AAaA,MAAa,gBAAgB,OAAc,SAC1C,IAAI,MAAM,MAAM;CACf,MAAM,GAAG,MAAM,aACd,QAAQ,IACL,QAAQ,IAAI,GAAG,MAAM,QAAQ,IAC7B,OAAO,SAAS,WACf,eAAe,OAAO,IAAI,IAC1B,KAAA;CACL,MAAM,GAAG,MAAM,OAAO,aAAa;EAClC,IAAI,OAAO,SAAS,YAAY,QAAQ,GACvC,OAAO,QAAQ,IAAI,GAAG,MAAM,OAAO,QAAQ;EAE5C,SAAS,OAAO,MAAM,KAAK;EAC3B,OAAO;CACR;CACA,MAAM,GAAG,SAAS,QAAQ,KAAK,OAAO,SAAS;AAChD,CAAC"}

package/package.json

@@ -0,0 +1,92 @@
+{
+  "name": "better-call",
+  "version": "0.0.0-experimental.06264e12",
+  "type": "module",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/better-auth/better-call.git",
+    "directory": "packages/experimental"
+  },
+  "copyright": "Copyright (C) 2025 Bereket Engida",
+  "license": "MIT",
+  "main": "./dist/index.mjs",
+  "module": "./dist/index.mjs",
+  "types": "./dist/index.d.mts",
+  "peerDependencies": {
+    "zod": "^4.0.0"
+  },
+  "peerDependenciesMeta": {
+    "zod": {
+      "optional": true
+    }
+  },
+  "exports": {
+    ".": {
+      "dev-source": "./src/index.ts",
+      "import": {
+        "types": "./dist/index.d.mts",
+        "default": "./dist/index.mjs"
+      },
+      "require": {
+        "types": "./dist/index.d.cts",
+        "default": "./dist/index.cjs"
+      }
+    },
+    "./error": {
+      "dev-source": "./src/error.ts",
+      "import": {
+        "types": "./dist/error.d.mts",
+        "default": "./dist/error.mjs"
+      },
+      "require": {
+        "types": "./dist/error.d.cts",
+        "default": "./dist/error.cjs"
+      }
+    },
+    "./schema": {
+      "dev-source": "./src/schema.ts",
+      "import": {
+        "types": "./dist/schema.d.mts",
+        "default": "./dist/schema.mjs"
+      },
+      "require": {
+        "types": "./dist/schema.d.cts",
+        "default": "./dist/schema.cjs"
+      }
+    },
+    "./plugins/http": {
+      "dev-source": "./src/plugins/http.ts",
+      "import": {
+        "types": "./dist/plugins/http.d.mts",
+        "default": "./dist/plugins/http.mjs"
+      },
+      "require": {
+        "types": "./dist/plugins/http.d.cts",
+        "default": "./dist/plugins/http.cjs"
+      }
+    },
+    "./plugins/read-only": {
+      "dev-source": "./src/plugins/read-only.ts",
+      "import": {
+        "types": "./dist/plugins/read-only.d.mts",
+        "default": "./dist/plugins/read-only.mjs"
+      },
+      "require": {
+        "types": "./dist/plugins/read-only.d.cts",
+        "default": "./dist/plugins/read-only.cjs"
+      }
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "lint:package": "publint --strict .",
+    "lint:type": "attw --profile node16 --pack .",
+    "test": "vitest",
+    "coverage": "vitest run --coverage",
+    "coverage:open": "open coverage/index.html",
+    "build": "tsdown",
+    "dev": "tsdown --watch"
+  }
+}