@lunora/seed 1.0.0-alpha.7 → 1.0.0-alpha.71

package/LICENSE.md

@@ -103,3 +103,9 @@ Unless required by applicable law or agreed to in writing, software distributed
 under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
 CONDITIONS OF ANY KIND, either express or implied. See the License for the
 specific language governing permissions and limitations under the License.
+
+<!-- DEPENDENCIES -->
+<!-- /DEPENDENCIES -->
+
+<!-- TYPE_DEPENDENCIES -->
+<!-- /TYPE_DEPENDENCIES -->

package/dist/index.d.mts

@@ -1,20 +1,20 @@
 import { Schema } from '@lunora/server';
-import { O as OverrideContext } from "./packem_shared/plan.d-BQ6LiWIk.mjs";
-export { type S as SeedCounts, type a as SeedOptions, type b as SeedOverrides, type T as TablePlan, s as seedPlan } from "./packem_shared/plan.d-BQ6LiWIk.mjs";
+import { O as OverrideContext } from "./packem_shared/plan.d-CDkBhI-1.mjs";
+export { type S as SeedCounts, type a as SeedOptions, type b as SeedOverrides, type T as TablePlan, s as seedPlan } from "./packem_shared/plan.d-CDkBhI-1.mjs";
 /**
-* A typed, schema-aware seed client — the ergonomic DX layer over {@link seedPlan}.
-*
-* Where `seedPlan` generates every table at once, the client lets you author one
-* table at a time, with autocomplete on each table's columns and live foreign-key
-* connection to whatever was seeded earlier this run. Pass your generated
-* `InsertModel` type as the type argument — or let `lunora/_generated/seed.ts`
-* do that for you — for full type inference on each table's columns.
-*
-* The client is deterministic (same `seed` ⇒ same rows and ids) and pure unless a
-* `persist` hook is supplied, in which case each generated batch is also written
-* through it (the test harness, an admin import, …). Because every row carries an
-* explicit `_id`, the returned ids are known whether or not anything is persisted.
-*/
+ * A typed, schema-aware seed client — the ergonomic DX layer over {@link seedPlan}.
+ *
+ * Where `seedPlan` generates every table at once, the client lets you author one
+ * table at a time, with autocomplete on each table's columns and live foreign-key
+ * connection to whatever was seeded earlier this run. Pass your generated
+ * `InsertModel` type as the type argument — or let `lunora/_generated/seed.ts`
+ * do that for you — for full type inference on each table's columns.
+ *
+ * The client is deterministic (same `seed` ⇒ same rows and ids) and pure unless a
+ * `persist` hook is supplied, in which case each generated batch is also written
+ * through it (the test harness, an admin import, …). Because every row carries an
+ * explicit `_id`, the returned ids are known whether or not anything is persisted.
+ */
 /** Picks a concrete count: a fixed number, or a deterministic value within `[min, max]`. */
 type CountHelper = (countOrRange: number | readonly [number, number]) => number;
 /** The per-call population spec: a count, an inclusive range, explicit partial rows, or a count callback. */
@@ -23,10 +23,10 @@ type SeedSpec<Row> = number | ReadonlyArray<Partial<Row>> | readonly [number, nu
 type FieldOverride<Value> = ((context: OverrideContext) => Value) | Value;
 /** Options for a single table call. `overrides` win over any explicit partial rows. */
 interface SeedCallOptions<Row> {
-  overrides?: { [K in keyof Row]?: FieldOverride<Row[K]> };
+  overrides?: { [K in keyof Row]?: FieldOverride<Row[K]>; };
 }
 /** The id columns the client emits, keyed by table — the result of a single table call. */
-type SeedCallResult<InsertModel, Table extends keyof InsertModel> = { [K in Table]: string[] };
+type SeedCallResult<InsertModel, Table extends keyof InsertModel> = { [K in Table]: string[]; };
 /** The seeder function exposed for one table. */
 type TableSeeder<InsertModel, Table extends keyof InsertModel> = (spec?: SeedSpec<InsertModel[Table]>, options?: SeedCallOptions<InsertModel[Table]>) => Promise<SeedCallResult<InsertModel, Table>>;
 /** The `$`-prefixed run state shared by every client. */
@@ -39,7 +39,7 @@ interface SeedClientState {
   readonly $store: Readonly<Record<string, ReadonlyArray<Record<string, unknown>>>>;
 }
 /** The per-table seeder methods plus the `$`-prefixed run state. */
-type SeedClient<InsertModel> = SeedClientState & { [Table in keyof InsertModel]: TableSeeder<InsertModel, Table> };
+type SeedClient<InsertModel> = SeedClientState & { [Table in keyof InsertModel]: TableSeeder<InsertModel, Table>; };
 /** Options for {@link createSeedClient}. */
 interface SeedClientOptions {
   /** Default row count when a table call passes no spec (default `10`). */
@@ -50,15 +50,15 @@ interface SeedClientOptions {
   seed?: number;
 }
 /**
-* Create a typed seed client for `schema`. Each table is a method; call it with a
-* count, a range, or explicit partial rows, and its foreign keys connect to rows
-* seeded earlier this run. State accumulates on `$store`/`$ids` and clears with
-* `$reset()`.
-* @example
-* const seed = createSeedClient<InsertModel>(schema, { seed: 1 });
-* const { users } = await seed.users(5);
-* const { posts } = await seed.posts((x) => x([10, 20]));
-* // posts.authorId values are drawn from `users`.
-*/
+ * Create a typed seed client for `schema`. Each table is a method; call it with a
+ * count, a range, or explicit partial rows, and its foreign keys connect to rows
+ * seeded earlier this run. State accumulates on `$store`/`$ids` and clears with
+ * `$reset()`.
+ * @example
+ * const seed = createSeedClient<InsertModel>(schema, { seed: 1 });
+ * const { users } = await seed.users(5);
+ * const { posts } = await seed.posts((x) => x([10, 20]));
+ * // posts.authorId values are drawn from `users`.
+ */
 declare const createSeedClient: <InsertModel = Record<string, Record<string, unknown>>>(schema: Schema, options?: SeedClientOptions) => SeedClient<InsertModel>;
 export { type CountHelper, type OverrideContext, type SeedCallOptions, type SeedCallResult, type SeedClient, type SeedClientOptions, type SeedSpec, createSeedClient };

package/dist/index.d.ts

@@ -1,20 +1,20 @@
 import { Schema } from '@lunora/server';
-import { O as OverrideContext } from "./packem_shared/plan.d-BQ6LiWIk.js";
-export { type S as SeedCounts, type a as SeedOptions, type b as SeedOverrides, type T as TablePlan, s as seedPlan } from "./packem_shared/plan.d-BQ6LiWIk.js";
+import { O as OverrideContext } from "./packem_shared/plan.d-CDkBhI-1.js";
+export { type S as SeedCounts, type a as SeedOptions, type b as SeedOverrides, type T as TablePlan, s as seedPlan } from "./packem_shared/plan.d-CDkBhI-1.js";
 /**
-* A typed, schema-aware seed client — the ergonomic DX layer over {@link seedPlan}.
-*
-* Where `seedPlan` generates every table at once, the client lets you author one
-* table at a time, with autocomplete on each table's columns and live foreign-key
-* connection to whatever was seeded earlier this run. Pass your generated
-* `InsertModel` type as the type argument — or let `lunora/_generated/seed.ts`
-* do that for you — for full type inference on each table's columns.
-*
-* The client is deterministic (same `seed` ⇒ same rows and ids) and pure unless a
-* `persist` hook is supplied, in which case each generated batch is also written
-* through it (the test harness, an admin import, …). Because every row carries an
-* explicit `_id`, the returned ids are known whether or not anything is persisted.
-*/
+ * A typed, schema-aware seed client — the ergonomic DX layer over {@link seedPlan}.
+ *
+ * Where `seedPlan` generates every table at once, the client lets you author one
+ * table at a time, with autocomplete on each table's columns and live foreign-key
+ * connection to whatever was seeded earlier this run. Pass your generated
+ * `InsertModel` type as the type argument — or let `lunora/_generated/seed.ts`
+ * do that for you — for full type inference on each table's columns.
+ *
+ * The client is deterministic (same `seed` ⇒ same rows and ids) and pure unless a
+ * `persist` hook is supplied, in which case each generated batch is also written
+ * through it (the test harness, an admin import, …). Because every row carries an
+ * explicit `_id`, the returned ids are known whether or not anything is persisted.
+ */
 /** Picks a concrete count: a fixed number, or a deterministic value within `[min, max]`. */
 type CountHelper = (countOrRange: number | readonly [number, number]) => number;
 /** The per-call population spec: a count, an inclusive range, explicit partial rows, or a count callback. */
@@ -23,10 +23,10 @@ type SeedSpec<Row> = number | ReadonlyArray<Partial<Row>> | readonly [number, nu
 type FieldOverride<Value> = ((context: OverrideContext) => Value) | Value;
 /** Options for a single table call. `overrides` win over any explicit partial rows. */
 interface SeedCallOptions<Row> {
-  overrides?: { [K in keyof Row]?: FieldOverride<Row[K]> };
+  overrides?: { [K in keyof Row]?: FieldOverride<Row[K]>; };
 }
 /** The id columns the client emits, keyed by table — the result of a single table call. */
-type SeedCallResult<InsertModel, Table extends keyof InsertModel> = { [K in Table]: string[] };
+type SeedCallResult<InsertModel, Table extends keyof InsertModel> = { [K in Table]: string[]; };
 /** The seeder function exposed for one table. */
 type TableSeeder<InsertModel, Table extends keyof InsertModel> = (spec?: SeedSpec<InsertModel[Table]>, options?: SeedCallOptions<InsertModel[Table]>) => Promise<SeedCallResult<InsertModel, Table>>;
 /** The `$`-prefixed run state shared by every client. */
@@ -39,7 +39,7 @@ interface SeedClientState {
   readonly $store: Readonly<Record<string, ReadonlyArray<Record<string, unknown>>>>;
 }
 /** The per-table seeder methods plus the `$`-prefixed run state. */
-type SeedClient<InsertModel> = SeedClientState & { [Table in keyof InsertModel]: TableSeeder<InsertModel, Table> };
+type SeedClient<InsertModel> = SeedClientState & { [Table in keyof InsertModel]: TableSeeder<InsertModel, Table>; };
 /** Options for {@link createSeedClient}. */
 interface SeedClientOptions {
   /** Default row count when a table call passes no spec (default `10`). */
@@ -50,15 +50,15 @@ interface SeedClientOptions {
   seed?: number;
 }
 /**
-* Create a typed seed client for `schema`. Each table is a method; call it with a
-* count, a range, or explicit partial rows, and its foreign keys connect to rows
-* seeded earlier this run. State accumulates on `$store`/`$ids` and clears with
-* `$reset()`.
-* @example
-* const seed = createSeedClient<InsertModel>(schema, { seed: 1 });
-* const { users } = await seed.users(5);
-* const { posts } = await seed.posts((x) => x([10, 20]));
-* // posts.authorId values are drawn from `users`.
-*/
+ * Create a typed seed client for `schema`. Each table is a method; call it with a
+ * count, a range, or explicit partial rows, and its foreign keys connect to rows
+ * seeded earlier this run. State accumulates on `$store`/`$ids` and clears with
+ * `$reset()`.
+ * @example
+ * const seed = createSeedClient<InsertModel>(schema, { seed: 1 });
+ * const { users } = await seed.users(5);
+ * const { posts } = await seed.posts((x) => x([10, 20]));
+ * // posts.authorId values are drawn from `users`.
+ */
 declare const createSeedClient: <InsertModel = Record<string, Record<string, unknown>>>(schema: Schema, options?: SeedClientOptions) => SeedClient<InsertModel>;
 export { type CountHelper, type OverrideContext, type SeedCallOptions, type SeedCallResult, type SeedClient, type SeedClientOptions, type SeedSpec, createSeedClient };

package/dist/index.mjs

@@ -1,2 +1 @@
-export { createSeedClient } from './packem_shared/createSeedClient-CI9LRLTi.mjs';
-export { s as seedPlan } from './packem_shared/plan-DirmkctQ.mjs';
+import{createSeedClient as o}from"./packem_shared/createSeedClient-Ew_Dt82y.mjs";import{V as a}from"./packem_shared/plan-DRy9bg5D.mjs";export{o as createSeedClient,a as seedPlan};

package/dist/packem_shared/createSeedClient-Ew_Dt82y.mjs

@@ -0,0 +1 @@
+import{l as k,V as $,w as C}from"./plan-DRy9bg5D.mjs";const S=t=>Array.isArray(t)&&t.length===2&&typeof t[0]=="number"&&typeof t[1]=="number",A=(t,u,l,s)=>{const n=o=>typeof o=="number"?o:C.int([l,u,"count"],{max:o[1],min:o[0]});return t===void 0?{count:s}:typeof t=="number"?{count:t}:typeof t=="function"?{count:t(n)}:S(t)?{count:n(t)}:{count:t.length,partials:t}},M=(t,u,l)=>{const s={};if(t!==void 0){const n=new Set(t.flatMap(o=>Object.keys(o)));for(const o of n)s[o]=c=>t[c.index-l]?.[o]}for(const[n,o]of Object.entries(u??{}))s[n]=o;return s},R=(t,u={})=>{const{defaultCount:l=10,persist:s,seed:n=0}=u,o={},c={},a={},O=async(e,r,d)=>{k(n);const{count:f,partials:y}=A(r,e,n,l),m=a[e]??0,v=$(t,{counts:{[e]:f},existingIds:c,indexOffset:{[e]:m},only:[e],overrides:{[e]:M(y,d?.overrides,m)},seed:n});let h=[];for(const{rows:p,table:i}of v){const g=p.map(x=>x._id);o[i]??=[],o[i].push(...p),c[i]??=[],c[i].push(...g),a[i]=(a[i]??0)+p.length,i===e&&(h=g),s!==void 0&&await s(i,p)}return{[e]:h}};let b=Promise.resolve();const j=(e,r,d)=>{const f=b.then(()=>O(e,r,d));return b=f.then(()=>{},()=>{}),f},w={$ids:c,$reset:()=>{for(const e of Object.keys(o))delete o[e];for(const e of Object.keys(c))delete c[e];for(const e of Object.keys(a))delete a[e]},$store:o};return new Proxy(w,{get(e,r,d){return typeof r=="string"&&!r.startsWith("$")&&Object.hasOwn(t.tables,r)?(f,y)=>j(r,f,y):Reflect.get(e,r,d)}})};export{R as createSeedClient};

package/dist/packem_shared/plan-DRy9bg5D.mjs

@@ -0,0 +1 @@
+import{LunoraError as $}from"@lunora/errors";import{faker as m}from"@faker-js/faker";import{optionalInner as C}from"@lunora/values";let x=0;const q=(e,n)=>e<n?-1:e>n?1:0,O=e=>e===void 0?"undefined":typeof e=="bigint"?`${e.toString()}n`:e===null||typeof e!="object"?JSON.stringify(e)??"null":Array.isArray(e)?`[${e.map(n=>O(n)).join(",")}]`:`{${Object.keys(e).toSorted(q).map(n=>`${JSON.stringify(n)}:${O(e[n])}`).join(",")}}`,V=(e,n)=>{let t=3735928559^n,o=1103547991^n;for(let a=0;a<e.length;a+=1){const i=e.codePointAt(a)??0;t=Math.imul(t^i,2654435761),o=Math.imul(o^i,1597334677)}return t=Math.imul(t^t>>>16,2246822507),t^=Math.imul(o^o>>>13,3266489909),o=Math.imul(o^o>>>16,2246822507),o^=Math.imul(t^t>>>13,3266489909),4294967296*(2097151&o)+(t>>>0)},G="\0",H=e=>{const n=typeof e=="string"?G+e:O(e);return V(n,x)%4294967296},K=e=>{if(typeof e=="number"){x=e>>>0;return}if(typeof e=="string"){x=V(e,0)%4294967296;return}let n=0;for(const t of e)n=Math.imul(n^t,2654435761)>>>0;x=n},d=(e,n)=>(m.seed(H(e)),n()),W=(e,n)=>{if(typeof n=="number")return n;const[t,o]=n;return d(["__count__",e],()=>m.number.int({max:o,min:t}))},X=/[a-z]/,Y=/[A-Z]/,ee=/\d/,u={bool(e){return d(e,()=>m.datatype.boolean())},city(e){return d(e,()=>m.location.city())},country(e){return d(e,()=>m.location.country())},dateString(e,n){const t=n?.min??new Date("1980-01-01T00:00:00.000Z"),o=n?.max??new Date("2020-01-01T00:00:00.000Z");return d(e,()=>m.date.between({from:t,to:o}).toISOString())},email(e){return d(e,()=>m.internet.email().toLowerCase())},firstName(e){return d(e,()=>m.person.firstName())},float(e,n){const{fractionDigits:t=2,max:o=1e3,min:a=0}=n??{};return d(e,()=>m.number.float({fractionDigits:t,max:o,min:a}))},fullName(e){return d(e,()=>m.person.fullName())},int(e,n){const{max:t=1e3,min:o=0}=n??{};return d(e,()=>m.number.int({max:t,min:o}))},lastName(e){return d(e,()=>m.person.lastName())},oneOf(e,n){if(n.length!==0)return d(e,()=>m.helpers.arrayElement(n))},paragraph(e){return d(e,()=>m.lorem.paragraph())},password(e){return d(e,()=>m.internet.password())},phoneNumber(e){return d(e,()=>m.phone.number())},scramble(e,n){const t=new Set(n?.preserve);return Array.from({length:e.length},(o,a)=>{const i=e.charAt(a);return t.has(i)?i:X.test(i)?d([e,a,"l"],()=>m.string.alpha({casing:"lower",length:1})):Y.test(i)?d([e,a,"u"],()=>m.string.alpha({casing:"upper",length:1})):ee.test(i)?d([e,a,"d"],()=>String(m.number.int({max:9,min:0}))):i}).join("")},sentence(e,n){return d(e,()=>m.lorem.sentence(n?{max:n.max??8,min:n.min??3}:void 0))},slug(e){return d(e,()=>m.lorem.slug())},streetAddress(e){return d(e,()=>m.location.streetAddress())},times(e,n,t){const o=W(e,n),a=[];for(let i=0;i<o;i+=1)a.push(t([e,i]));return a},url(e){return d(e,()=>m.internet.url())},username(e){return d(e,()=>m.internet.username())},uuid(e){return d(e,()=>m.string.uuid())},word(e){return d(e,()=>m.lorem.word())}},h=e=>e._meta??{},Z=e=>C(e)??e,z=e=>{const{column:n}=h(e);if(n?.defaultValue!==void 0||n?.defaultFn!==void 0)return!0;const t=C(e);return t===void 0?!1:z(t)},ne=(e,n)=>{const t=Z(n),o=h(t);return{fkTable:t.kind==="id"?o.tableName:void 0,hasServerDefault:z(n),kind:t.kind,name:e,nullable:o.column?.notNull===!1,optional:n.kind==="optional",validator:t}},te=e=>{const{tables:n}=e;return Object.entries(n).map(([t,o])=>({fields:Object.entries(o.shape).map(([a,i])=>ne(a,i)),name:t}))},re=(e,n)=>{const t=new Map(e.map(r=>[r.name,r])),o=r=>{const l=t.get(r);if(l===void 0)return new Set;const f=new Set;for(const g of l.fields)g.fkTable!==void 0&&g.fkTable!==r&&n.has(g.fkTable)&&f.add(g.fkTable);return f},a=[],i=new Set,s=[...n].filter(r=>t.has(r));for(;s.length>0;){const r=s.findIndex(g=>[...o(g)].every(w=>i.has(w))),l=r===-1?0:r,[f]=s.splice(l,1);if(f===void 0)break;a.push(f),i.add(f)}return a},oe=(e,n,t=new Set)=>{const o=new Map(e.map(s=>[s.name,s])),a=new Set(n),i=[...a];for(;i.length>0;){const s=i.pop();if(s===void 0)break;const r=o.get(s);if(r!==void 0&&!t.has(s))for(const l of r.fields)l.fkTable!==void 0&&l.fkTable!==s&&o.has(l.fkTable)&&!a.has(l.fkTable)&&(a.add(l.fkTable),i.push(l.fkTable))}return a},ae=e=>h(e).constraints??{},se=[{generate:e=>u.email(e),keywords:["email"]},{generate:e=>u.firstName(e),keywords:["firstname"]},{generate:e=>u.lastName(e),keywords:["lastname","surname"]},{generate:e=>u.username(e),keywords:["username"]},{generate:e=>u.fullName(e),keywords:["name"]},{generate:e=>u.sentence(e,{max:5,min:2}),keywords:["title"]},{generate:e=>u.url(e),keywords:["url","link","image","avatar"]},{generate:e=>u.phoneNumber(e),keywords:["phone"]},{generate:e=>u.paragraph(e),keywords:["description","bio","body","content","text"]},{generate:e=>u.slug(e),keywords:["slug","key","code"]},{generate:e=>u.city(e),keywords:["city"]},{generate:e=>u.country(e),keywords:["country"]},{generate:e=>u.streetAddress(e),keywords:["address","street"]},{generate:e=>u.password(e),keywords:["password","secret","token"]}],ie=new Set(["at","date","deadline","expires","expiry","since","timestamp","until"]),ue=/([a-z\d])([A-Z])/gu,le=/[\s_-]+/u,me=e=>e.replaceAll(ue,"$1 $2").split(le).filter(n=>n!=="").map(n=>n.toLowerCase()),de=4320*60*60*1e3,ce=e=>{const n=me(e).at(-1);return n!==void 0&&ie.has(n)},fe=(e,n)=>n-u.int(e,{max:de,min:0}),ge=(e,n,t)=>{const o=e.toLowerCase(),a=se.find(f=>f.keywords.some(g=>o.includes(g))),i=a===void 0?u.word(n):a.generate(n),{maxLength:s,minLength:r}=t;if(s!==void 0&&r!==void 0&&r>s)throw new $("INTERNAL",`Seed constraint error for field "${e}": minLength (${String(r)}) > maxLength (${String(s)}). Adjust the schema constraints.`);const l=s!==void 0&&i.length>s?i.slice(0,s):i;return r!==void 0&&l.length<r?l.padEnd(r,l.length>0?l:"x"):l},y=(e,n,t,o)=>{const a=Z(e),i=ae(a);if(i.enum!==void 0&&i.enum.length>0)return u.oneOf(t,i.enum);switch(a.kind){case"any":return u.word(t);case"array":{const s=h(a).inner;return s===void 0?[]:u.times(t,[1,3],r=>y(s,n,r,o))}case"bigint":return u.int(t,{max:1e6,min:0});case"boolean":return u.bool(t);case"bytes":return Array.from({length:8},(s,r)=>u.int([t,r],{max:255,min:0}));case"date":case"timestamp":return new Date(u.dateString(t)).getTime();case"from":throw new $("INTERNAL",`@lunora/seed: column "${n}" is a v.from() validator, whose external Standard Schema the seeder cannot introspect to invent a conforming value. Supply one via \`overrides\` (\`{ <table>: { ${n}: … } }\`), restrict the run with \`only\` so the table is skipped, or give the column a concrete v.* type.`);case"id":return u.uuid(t);case"literal":return h(a).value;case"null":return null;case"number":{const{maximum:s,minimum:r}=i;if(s===void 0&&r===void 0&&ce(n))return fe(t,o);if(s!==void 0&&r!==void 0&&r>s)throw new $("INTERNAL",`Seed constraint error for field "${n}": minimum (${String(r)}) > maximum (${String(s)}). Adjust the schema constraints.`);const l=r??0,f=s??1e3;return!Number.isInteger(l)||!Number.isInteger(f)?u.float(t,{max:f,min:l}):u.int(t,{max:f,min:l})}case"object":{const s=h(a).shape??{};return Object.fromEntries(Object.entries(s).map(([r,l])=>[r,y(l,r,[t,r],o)]))}case"record":{const{keyValidator:s,valueValidator:r}=h(a),l=u.times(t,[1,3],f=>{const g=s===void 0?u.word(["k",f]):String(y(s,n,["k",f],o)),w=r===void 0?u.word(["v",f]):y(r,n,["v",f],o);return[g,w]});return Object.fromEntries(l)}case"storage":return`seed/${u.uuid(t)}`;case"string":return ge(n,t,i);case"union":{const s=h(a).members??[],r=u.oneOf(t,s);return r===void 0?u.word(t):y(r,n,[t,"u"],o)}default:return u.word(t)}},pe=(e,n)=>typeof e=="function"?e(n):e,he=(e,n)=>{if(!e.optional)return e.nullable?null:u.uuid(n)},we=(e,n,t,o,a)=>{const i=e.fkTable,s=i===n?(o.get(n)??[]).slice(0,t):o.get(i)??[],r=a[i]??[];return r.length===0?s:[...s,...r]},R=(e,n,t,o)=>[e,n,t,o],be=(e,n,t,o,a,i,s)=>{if(e.fkTable!==void 0){const r=we(e,n,o,a,i);return r.length===0?he(e,t):u.oneOf(t,r)}if(!e.hasServerDefault)return y(e.validator,e.name,t,s)},Se=(e,n={})=>{const{counts:t={},defaultCount:o=10,existingIds:a={},indexOffset:i={},now:s=Date.now(),only:r,overrides:l={},seed:f=0}=n;K(f);const g=te(e);if(r!==void 0){const c=new Set(g.map(b=>b.name));for(const b of r)if(!c.has(b)){const k=g.map(N=>N.name).join(", ");throw new $("BAD_REQUEST",`unknown table "${b}" in seed \`only\` — schema defines: ${k||"(no tables)"}`)}}const w=new Set(r??g.map(c=>c.name)),F=new Set(Object.keys(a).filter(c=>!w.has(c)&&(a[c]??[]).length>0)),J=new Set([...oe(g,w,F)].filter(c=>w.has(c)||(a[c]??[]).length===0)),P=re(g,J),Q=new Map(g.map(c=>[c.name,c])),j=new Map,L={},M=[];for(const c of P){const b=Q.get(c);if(b===void 0)continue;const k=l[c]??{},N=t[c]??o,U=i[c]??0,_=[];j.set(c,_);const T=[];L[c]=T;for(let S=0;S<N;S+=1){const A=U+S,v={},E=(p,B)=>{if(Object.hasOwn(k,p)){const D=pe(k[p],{field:p,index:A,row:v,store:L,table:c});if(D!==void 0){v[p]=D;return}}const I=B();I!==void 0&&(v[p]=I)};E("_id",()=>u.uuid(R(f,c,A,"_id"))),_.push(v._id);for(const p of b.fields)E(p.name,()=>be(p,c,R(f,c,A,p.name),S,j,a,s));T.push(v)}M.push({rows:T,table:c})}return M};export{te as S,Se as V,K as l,u as w};

package/dist/packem_shared/plan.d-CDkBhI-1.d.mts

@@ -0,0 +1,88 @@
+import { Schema } from '@lunora/server';
+/**
+ * The pure, I/O-free core of seeding. {@link seedPlan} introspects a schema,
+ * generates rows table-by-table in foreign-key order, and resolves every
+ * `v.id("parent")` column to a real id of an already-generated parent row. The
+ * result feeds every adapter (test harness, CLI, studio) — none of them
+ * re-implement generation.
+ *
+ * Determinism: a `seed` value selects the global copycat mapping, and each value
+ * is hashed from `[seed, table, index, field]`, so the same `(schema, options)`
+ * always yields byte-identical rows.
+ */
+/** A row context handed to an override function. */
+interface OverrideContext {
+  field: string;
+  /** The row's absolute index (the `indexOffset` base plus its position in this batch). */
+  index: number;
+  /** The row built so far (system `_id` first, then earlier fields). */
+  row: Record<string, unknown>;
+  /**
+   * A live, read-only view of every table's rows generated so far this run,
+   * keyed by table name. Lets an override correlate across tables (e.g. copy a
+   * field from the parent row a foreign key points at). Rows for the current
+   * table accumulate as they are built, so only earlier rows are visible.
+   */
+  store: Readonly<Record<string, ReadonlyArray<Record<string, unknown>>>>;
+  table: string;
+}
+/**
+ * Per-table, per-field overrides. Each override is a static value or a function
+ * of the row context; field `_id` overrides the generated primary key.
+ */
+type SeedOverrides = Record<string, Record<string, unknown>>;
+/** Per-table row counts. */
+type SeedCounts = Record<string, number>;
+interface SeedOptions {
+  /** Rows per table; falls back to {@link SeedOptions.defaultCount} when a table is absent. */
+  counts?: SeedCounts;
+  /** Count used for any selected table not present in `counts` (default `10`). */
+  defaultCount?: number;
+  /**
+   * Ids of rows that already exist in the target store, keyed by table. Foreign
+   * keys may resolve to these in addition to freshly-seeded parents, and a
+   * parent table fully covered here is not re-seeded when it is only pulled in
+   * as an FK dependency (it is when named explicitly in `only`).
+   */
+  existingIds?: Readonly<Record<string, ReadonlyArray<string>>>;
+  /**
+   * Per-table absolute index base for generation. Defaults to `0`. A client
+   * seeding the same table across several calls passes the running total so
+   * each batch hashes from fresh indices and never collides ids with an
+   * earlier batch.
+   */
+  indexOffset?: Readonly<Record<string, number>>;
+  /**
+   * Wall-clock reference for time-valued columns (`createdAt`, `expiresAt`, …),
+   * as epoch-ms. Defaults to now.
+   *
+   * Pin it to make a plan byte-for-byte reproducible: seeding is deterministic
+   * in `seed` alone for every other column, and this is the one input that
+   * would otherwise drift between runs. A pinned `(seed, now)` pair is what
+   * makes a seeded screenshot, test fixture, or bug report replayable.
+   */
+  now?: number;
+  /**
+   * Restrict seeding to these tables. Transitive `v.id(...)` parents are added
+   * automatically (unless already covered by `existingIds`) so child foreign
+   * keys resolve to real rows. The result is still ordered by FK dependency.
+   * Default: all tables.
+   */
+  only?: ReadonlyArray<string>;
+  /** Static values or functions overriding generated columns. */
+  overrides?: SeedOverrides;
+  /** Deterministic mapping selector — same seed ⇒ same rows. Default `0`. */
+  seed?: number;
+}
+/** One table's generated rows, in insert order. Each row carries an explicit `_id`. */
+interface TablePlan {
+  rows: ReadonlyArray<Record<string, unknown>>;
+  table: string;
+}
+/**
+ * Build a deterministic, FK-consistent set of rows for `schema`.
+ * @returns one {@link TablePlan} per seeded table, ordered so a table's FK
+ * parents come before it.
+ */
+declare const seedPlan: (schema: Schema, options?: SeedOptions) => ReadonlyArray<TablePlan>;
+export { OverrideContext as O, SeedCounts as S, TablePlan as T, SeedOptions as a, SeedOverrides as b, seedPlan as s };

package/dist/packem_shared/plan.d-CDkBhI-1.d.ts

@@ -0,0 +1,88 @@
+import { Schema } from '@lunora/server';
+/**
+ * The pure, I/O-free core of seeding. {@link seedPlan} introspects a schema,
+ * generates rows table-by-table in foreign-key order, and resolves every
+ * `v.id("parent")` column to a real id of an already-generated parent row. The
+ * result feeds every adapter (test harness, CLI, studio) — none of them
+ * re-implement generation.
+ *
+ * Determinism: a `seed` value selects the global copycat mapping, and each value
+ * is hashed from `[seed, table, index, field]`, so the same `(schema, options)`
+ * always yields byte-identical rows.
+ */
+/** A row context handed to an override function. */
+interface OverrideContext {
+  field: string;
+  /** The row's absolute index (the `indexOffset` base plus its position in this batch). */
+  index: number;
+  /** The row built so far (system `_id` first, then earlier fields). */
+  row: Record<string, unknown>;
+  /**
+   * A live, read-only view of every table's rows generated so far this run,
+   * keyed by table name. Lets an override correlate across tables (e.g. copy a
+   * field from the parent row a foreign key points at). Rows for the current
+   * table accumulate as they are built, so only earlier rows are visible.
+   */
+  store: Readonly<Record<string, ReadonlyArray<Record<string, unknown>>>>;
+  table: string;
+}
+/**
+ * Per-table, per-field overrides. Each override is a static value or a function
+ * of the row context; field `_id` overrides the generated primary key.
+ */
+type SeedOverrides = Record<string, Record<string, unknown>>;
+/** Per-table row counts. */
+type SeedCounts = Record<string, number>;
+interface SeedOptions {
+  /** Rows per table; falls back to {@link SeedOptions.defaultCount} when a table is absent. */
+  counts?: SeedCounts;
+  /** Count used for any selected table not present in `counts` (default `10`). */
+  defaultCount?: number;
+  /**
+   * Ids of rows that already exist in the target store, keyed by table. Foreign
+   * keys may resolve to these in addition to freshly-seeded parents, and a
+   * parent table fully covered here is not re-seeded when it is only pulled in
+   * as an FK dependency (it is when named explicitly in `only`).
+   */
+  existingIds?: Readonly<Record<string, ReadonlyArray<string>>>;
+  /**
+   * Per-table absolute index base for generation. Defaults to `0`. A client
+   * seeding the same table across several calls passes the running total so
+   * each batch hashes from fresh indices and never collides ids with an
+   * earlier batch.
+   */
+  indexOffset?: Readonly<Record<string, number>>;
+  /**
+   * Wall-clock reference for time-valued columns (`createdAt`, `expiresAt`, …),
+   * as epoch-ms. Defaults to now.
+   *
+   * Pin it to make a plan byte-for-byte reproducible: seeding is deterministic
+   * in `seed` alone for every other column, and this is the one input that
+   * would otherwise drift between runs. A pinned `(seed, now)` pair is what
+   * makes a seeded screenshot, test fixture, or bug report replayable.
+   */
+  now?: number;
+  /**
+   * Restrict seeding to these tables. Transitive `v.id(...)` parents are added
+   * automatically (unless already covered by `existingIds`) so child foreign
+   * keys resolve to real rows. The result is still ordered by FK dependency.
+   * Default: all tables.
+   */
+  only?: ReadonlyArray<string>;
+  /** Static values or functions overriding generated columns. */
+  overrides?: SeedOverrides;
+  /** Deterministic mapping selector — same seed ⇒ same rows. Default `0`. */
+  seed?: number;
+}
+/** One table's generated rows, in insert order. Each row carries an explicit `_id`. */
+interface TablePlan {
+  rows: ReadonlyArray<Record<string, unknown>>;
+  table: string;
+}
+/**
+ * Build a deterministic, FK-consistent set of rows for `schema`.
+ * @returns one {@link TablePlan} per seeded table, ordered so a table's FK
+ * parents come before it.
+ */
+declare const seedPlan: (schema: Schema, options?: SeedOptions) => ReadonlyArray<TablePlan>;
+export { OverrideContext as O, SeedCounts as S, TablePlan as T, SeedOptions as a, SeedOverrides as b, seedPlan as s };

package/dist/packem_shared/seedPlan-3bhwPxyX.mjs

@@ -0,0 +1 @@
+import"@lunora/errors";import{V as a}from"./plan-DRy9bg5D.mjs";export{a as seedPlan};

package/dist/testing.d.mts

@@ -1,5 +1,5 @@
 import { Schema } from '@lunora/server';
 import { TestHarness } from '@lunora/testing';
-import { a as SeedOptions } from "./packem_shared/plan.d-BQ6LiWIk.mjs";
+import { a as SeedOptions } from "./packem_shared/plan.d-CDkBhI-1.mjs";
 declare const seed: (harness: TestHarness, schema: Schema, options?: SeedOptions) => Promise<Record<string, string[]>>;
 export { seed };

package/dist/testing.d.ts

@@ -1,5 +1,5 @@
 import { Schema } from '@lunora/server';
 import { TestHarness } from '@lunora/testing';
-import { a as SeedOptions } from "./packem_shared/plan.d-BQ6LiWIk.js";
+import { a as SeedOptions } from "./packem_shared/plan.d-CDkBhI-1.js";
 declare const seed: (harness: TestHarness, schema: Schema, options?: SeedOptions) => Promise<Record<string, string[]>>;
 export { seed };

package/dist/testing.mjs

@@ -1,53 +1 @@
-import { s as seedPlan, i as introspectSchema } from './packem_shared/plan-DirmkctQ.mjs';
-
-const reviveRow = (row, bigintFields, bytesFields) => {
-  if (bigintFields.size === 0 && bytesFields.size === 0) {
-    return row;
-  }
-  const revived = { ...row };
-  for (const field of bigintFields) {
-    const value = revived[field];
-    if (typeof value === "number") {
-      revived[field] = BigInt(value);
-    }
-  }
-  for (const field of bytesFields) {
-    const value = revived[field];
-    if (Array.isArray(value)) {
-      revived[field] = Uint8Array.from(value).buffer;
-    }
-  }
-  return revived;
-};
-const seed = async (harness, schema, options = {}) => {
-  const plan = seedPlan(schema, options);
-  const specs = introspectSchema(schema);
-  const bigintFieldsByTable = /* @__PURE__ */ new Map();
-  const bytesFieldsByTable = /* @__PURE__ */ new Map();
-  for (const spec of specs) {
-    const bigintFields = new Set(spec.fields.filter((field) => field.kind === "bigint").map((field) => field.name));
-    const bytesFields = new Set(spec.fields.filter((field) => field.kind === "bytes").map((field) => field.name));
-    if (bigintFields.size > 0) {
-      bigintFieldsByTable.set(spec.name, bigintFields);
-    }
-    if (bytesFields.size > 0) {
-      bytesFieldsByTable.set(spec.name, bytesFields);
-    }
-  }
-  const ids = {};
-  await harness.run(async (context) => {
-    const insert = context.db.insert;
-    for (const { rows, table } of plan) {
-      const tableIds = [];
-      const bigintFields = bigintFieldsByTable.get(table) ?? /* @__PURE__ */ new Set();
-      const bytesFields = bytesFieldsByTable.get(table) ?? /* @__PURE__ */ new Set();
-      for (const row of rows) {
-        tableIds.push(await insert(table, reviveRow(row, bigintFields, bytesFields), { allowExplicitId: true }));
-      }
-      ids[table] = tableIds;
-    }
-  });
-  return ids;
-};
-
-export { seed };
+import{V as y,S}from"./packem_shared/plan-DRy9bg5D.mjs";const b=(f,r,a)=>{if(r.size===0&&a.size===0)return f;const n={...f};for(const s of r){const e=n[s];typeof e=="number"&&(n[s]=BigInt(e))}for(const s of a){const e=n[s];Array.isArray(e)&&(n[s]=Uint8Array.from(e).buffer)}return n},z=async(f,r,a={})=>{const n=y(r,a),s=S(r),e=new Map,m=new Map;for(const o of s){const i=new Set(o.fields.filter(t=>t.kind==="bigint").map(t=>t.name)),c=new Set(o.fields.filter(t=>t.kind==="bytes").map(t=>t.name));i.size>0&&e.set(o.name,i),c.size>0&&m.set(o.name,c)}const l={};return await f.run(async o=>{const i=o.db.insert;for(const{rows:c,table:t}of n){const p=[],w=e.get(t)??new Set,u=m.get(t)??new Set;for(const d of c)p.push(await i(t,b(d,w,u),{allowExplicitId:!0}));l[t]=p}}),l};export{z as seed};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lunora/seed",
-  "version": "1.0.0-alpha.7",
+  "version": "1.0.0-alpha.71",
   "description": "Schema-driven, deterministic database seeding for Lunora: realistic fake data from defineSchema",
   "keywords": [
     "cloudflare",
@@ -47,11 +47,12 @@
     "access": "public"
   },
   "dependencies": {
-    "@faker-js/faker": "^10.5.0"
+    "@faker-js/faker": "^10.5.0",
+    "@lunora/errors": "1.0.0-alpha.21"
   },
   "peerDependencies": {
-    "@lunora/server": "1.0.0-alpha.7",
-    "@lunora/values": "1.0.0-alpha.3"
+    "@lunora/server": ">=1.0.0-alpha.24 <2.0.0-0",
+    "@lunora/values": ">=1.0.0-alpha.7 <2.0.0-0"
   },
   "engines": {
     "node": "^22.15.0 || >=24.11.0"

package/dist/packem_shared/createSeedClient-CI9LRLTi.mjs

@@ -1,92 +0,0 @@
-import { a as setHashKey, s as seedPlan, c as copycat } from './plan-DirmkctQ.mjs';
-
-const isRange = (spec) => Array.isArray(spec) && spec.length === 2 && typeof spec[0] === "number" && typeof spec[1] === "number";
-const resolveSpec = (spec, table, seed, defaultCount) => {
-  const pick = (countOrRange) => typeof countOrRange === "number" ? countOrRange : copycat.int([seed, table, "count"], { max: countOrRange[1], min: countOrRange[0] });
-  if (spec === void 0) {
-    return { count: defaultCount };
-  }
-  if (typeof spec === "number") {
-    return { count: spec };
-  }
-  if (typeof spec === "function") {
-    return { count: spec(pick) };
-  }
-  if (isRange(spec)) {
-    return { count: pick(spec) };
-  }
-  return { count: spec.length, partials: spec };
-};
-const buildOverrides = (partials, fieldOverrides, offset) => {
-  const overrides = {};
-  if (partials !== void 0) {
-    const fields = new Set(partials.flatMap((partial) => Object.keys(partial)));
-    for (const field of fields) {
-      overrides[field] = (context) => partials[context.index - offset]?.[field];
-    }
-  }
-  for (const [field, value] of Object.entries(fieldOverrides ?? {})) {
-    overrides[field] = value;
-  }
-  return overrides;
-};
-const createSeedClient = (schema, options = {}) => {
-  const { defaultCount = 10, persist, seed = 0 } = options;
-  const store = {};
-  const idsByTable = {};
-  const createdCount = {};
-  const seedTable = async (table, spec, callOptions) => {
-    setHashKey(seed);
-    const { count, partials } = resolveSpec(spec, table, seed, defaultCount);
-    const offset = createdCount[table] ?? 0;
-    const plan = seedPlan(schema, {
-      counts: { [table]: count },
-      existingIds: idsByTable,
-      indexOffset: { [table]: offset },
-      only: [table],
-      overrides: { [table]: buildOverrides(partials, callOptions?.overrides, offset) },
-      seed
-    });
-    let created = [];
-    for (const { rows, table: planned } of plan) {
-      const ids = rows.map((row) => row._id);
-      store[planned] ??= [];
-      store[planned].push(...rows);
-      idsByTable[planned] ??= [];
-      idsByTable[planned].push(...ids);
-      createdCount[planned] = (createdCount[planned] ?? 0) + rows.length;
-      if (planned === table) {
-        created = ids;
-      }
-      if (persist !== void 0) {
-        await persist(planned, rows);
-      }
-    }
-    return { [table]: created };
-  };
-  const state = {
-    $ids: idsByTable,
-    $reset: () => {
-      for (const key of Object.keys(store)) {
-        delete store[key];
-      }
-      for (const key of Object.keys(idsByTable)) {
-        delete idsByTable[key];
-      }
-      for (const key of Object.keys(createdCount)) {
-        delete createdCount[key];
-      }
-    },
-    $store: store
-  };
-  return /* @__PURE__ */ new Proxy(state, {
-    get(target, property, receiver) {
-      if (typeof property === "string" && !property.startsWith("$") && Object.hasOwn(schema.tables, property)) {
-        return (spec, callOptions) => seedTable(property, spec, callOptions);
-      }
-      return Reflect.get(target, property, receiver);
-    }
-  });
-};
-
-export { createSeedClient };

package/dist/packem_shared/plan-DirmkctQ.mjs

@@ -1,497 +0,0 @@
-import { faker } from '@faker-js/faker';
-import { optionalInner } from '@lunora/values';
-
-let hashSalt = 0;
-const compareStrings = (a, b) => {
-  if (a < b) {
-    return -1;
-  }
-  if (a > b) {
-    return 1;
-  }
-  return 0;
-};
-const stableStringify = (input) => {
-  if (input === void 0) {
-    return "undefined";
-  }
-  if (typeof input === "bigint") {
-    return `${input.toString()}n`;
-  }
-  if (input === null || typeof input !== "object") {
-    return JSON.stringify(input) ?? "null";
-  }
-  if (Array.isArray(input)) {
-    return `[${input.map((item) => stableStringify(item)).join(",")}]`;
-  }
-  const entries = Object.keys(input).toSorted(compareStrings).map((key) => `${JSON.stringify(key)}:${stableStringify(input[key])}`);
-  return `{${entries.join(",")}}`;
-};
-const cyrb53 = (text, seed) => {
-  let h1 = 3735928559 ^ seed;
-  let h2 = 1103547991 ^ seed;
-  for (let index = 0; index < text.length; index += 1) {
-    const ch = text.codePointAt(index) ?? 0;
-    h1 = Math.imul(h1 ^ ch, 2654435761);
-    h2 = Math.imul(h2 ^ ch, 1597334677);
-  }
-  h1 = Math.imul(h1 ^ h1 >>> 16, 2246822507);
-  h1 ^= Math.imul(h2 ^ h2 >>> 13, 3266489909);
-  h2 = Math.imul(h2 ^ h2 >>> 16, 2246822507);
-  h2 ^= Math.imul(h1 ^ h1 >>> 13, 3266489909);
-  return 4294967296 * (2097151 & h2) + (h1 >>> 0);
-};
-const STRING_DOMAIN_TAG = "\0";
-const hashInput = (input) => {
-  const text = typeof input === "string" ? STRING_DOMAIN_TAG + input : stableStringify(input);
-  return cyrb53(text, hashSalt) % 4294967296;
-};
-const setHashKey = (key) => {
-  if (typeof key === "number") {
-    hashSalt = key >>> 0;
-    return;
-  }
-  if (typeof key === "string") {
-    hashSalt = cyrb53(key, 0) % 4294967296;
-    return;
-  }
-  let folded = 0;
-  for (const word of key) {
-    folded = Math.imul(folded ^ word, 2654435761) >>> 0;
-  }
-  hashSalt = folded;
-};
-
-const seeded = (input, produce) => {
-  faker.seed(hashInput(input));
-  return produce();
-};
-const resolveCount = (input, range) => {
-  if (typeof range === "number") {
-    return range;
-  }
-  const [min, max] = range;
-  return seeded(["__count__", input], () => faker.number.int({ max, min }));
-};
-const capitalizeWord = (word) => word.length === 0 ? word : word.charAt(0).toUpperCase() + word.slice(1);
-const LOWER_ALPHA = /[a-z]/;
-const UPPER_ALPHA = /[A-Z]/;
-const DIGIT = /\d/;
-const copycat = {
-  bool(input) {
-    return seeded(input, () => faker.datatype.boolean());
-  },
-  char(input) {
-    return seeded(input, () => faker.string.alpha(1));
-  },
-  city(input) {
-    return seeded(input, () => faker.location.city());
-  },
-  country(input) {
-    return seeded(input, () => faker.location.country());
-  },
-  countryCode(input) {
-    return seeded(input, () => faker.location.countryCode());
-  },
-  /** ISO-8601 date string between `min`/`max` (default years 1980–2020). */
-  dateString(input, options) {
-    const min = options?.min ?? /* @__PURE__ */ new Date("1980-01-01T00:00:00.000Z");
-    const max = options?.max ?? /* @__PURE__ */ new Date("2020-01-01T00:00:00.000Z");
-    return seeded(input, () => faker.date.between({ from: min, to: max }).toISOString());
-  },
-  digit(input) {
-    return seeded(input, () => String(faker.number.int({ max: 9, min: 0 })));
-  },
-  email(input) {
-    return seeded(input, () => faker.internet.email().toLowerCase());
-  },
-  firstName(input) {
-    return seeded(input, () => faker.person.firstName());
-  },
-  float(input, options) {
-    const { fractionDigits = 2, max = 1e3, min = 0 } = options ?? {};
-    return seeded(input, () => faker.number.float({ fractionDigits, max, min }));
-  },
-  fullName(input) {
-    return seeded(input, () => faker.person.fullName());
-  },
-  hex(input) {
-    return seeded(input, () => faker.string.hexadecimal({ casing: "lower", length: 1, prefix: "" }));
-  },
-  int(input, options) {
-    const { max = 1e3, min = 0 } = options ?? {};
-    return seeded(input, () => faker.number.int({ max, min }));
-  },
-  ipv4(input) {
-    return seeded(input, () => faker.internet.ipv4());
-  },
-  lastName(input) {
-    return seeded(input, () => faker.person.lastName());
-  },
-  mac(input) {
-    return seeded(input, () => faker.internet.mac());
-  },
-  /** Pick the array element corresponding to `input`. Returns `undefined` for an empty array. */
-  oneOf(input, values) {
-    if (values.length === 0) {
-      return void 0;
-    }
-    return seeded(input, () => faker.helpers.arrayElement(values));
-  },
-  paragraph(input) {
-    return seeded(input, () => faker.lorem.paragraph());
-  },
-  password(input) {
-    return seeded(input, () => faker.internet.password());
-  },
-  phoneNumber(input) {
-    return seeded(input, () => faker.phone.number());
-  },
-  /**
-   * Scramble a string in place: letters become seeded letters (case
-   * preserved), digits become seeded digits, every other character is kept.
-   * Length is preserved. Characters listed in `preserve` pass through untouched.
-   */
-  scramble(input, options) {
-    const preserve = new Set(options?.preserve);
-    return Array.from({ length: input.length }, (_unused, index) => {
-      const char = input.charAt(index);
-      if (preserve.has(char)) {
-        return char;
-      }
-      if (LOWER_ALPHA.test(char)) {
-        return seeded([input, index, "l"], () => faker.string.alpha({ casing: "lower", length: 1 }));
-      }
-      if (UPPER_ALPHA.test(char)) {
-        return seeded([input, index, "u"], () => faker.string.alpha({ casing: "upper", length: 1 }));
-      }
-      if (DIGIT.test(char)) {
-        return seeded([input, index, "d"], () => String(faker.number.int({ max: 9, min: 0 })));
-      }
-      return char;
-    }).join("");
-  },
-  sentence(input, options) {
-    return seeded(input, () => faker.lorem.sentence(options ? { max: options.max ?? 8, min: options.min ?? 3 } : void 0));
-  },
-  slug(input) {
-    return seeded(input, () => faker.lorem.slug());
-  },
-  /** Pick a deterministic subset (size within `range`) of `values`, no repeats. */
-  someOf(input, range, values) {
-    const count = Math.min(resolveCount(["__some__", input], range), values.length);
-    return seeded(input, () => faker.helpers.arrayElements(values, count));
-  },
-  streetAddress(input) {
-    return seeded(input, () => faker.location.streetAddress());
-  },
-  streetName(input) {
-    return seeded(input, () => faker.location.street());
-  },
-  timezone(input) {
-    return seeded(input, () => faker.location.timeZone());
-  },
-  /**
-   * Call `produce` once per element for a deterministic count within `range`,
-   * passing each a distinct sub-input so the elements differ but stay stable.
-   */
-  times(input, range, produce) {
-    const count = resolveCount(input, range);
-    const out = [];
-    for (let index = 0; index < count; index += 1) {
-      out.push(produce([input, index]));
-    }
-    return out;
-  },
-  url(input) {
-    return seeded(input, () => faker.internet.url());
-  },
-  username(input) {
-    return seeded(input, () => faker.internet.username());
-  },
-  uuid(input) {
-    return seeded(input, () => faker.string.uuid());
-  },
-  word(input, options) {
-    const word = seeded(input, () => faker.lorem.word());
-    return options?.capitalize === true ? capitalizeWord(word) : word;
-  },
-  words(input, options) {
-    return seeded(input, () => faker.lorem.words(options ? { max: options.max ?? 5, min: options.min ?? 2 } : void 0));
-  }
-};
-
-const metaOf = (validator) => validator._meta ?? {};
-const unwrapOptional = (validator) => optionalInner(validator) ?? validator;
-const hasServerDefault = (validator) => {
-  const { column } = metaOf(validator);
-  if (column?.defaultValue !== void 0 || column?.defaultFn !== void 0) {
-    return true;
-  }
-  const inner = optionalInner(validator);
-  return inner === void 0 ? false : hasServerDefault(inner);
-};
-const describeField = (name, validator) => {
-  const inner = unwrapOptional(validator);
-  const meta = metaOf(inner);
-  return {
-    fkTable: inner.kind === "id" ? meta.tableName : void 0,
-    hasServerDefault: hasServerDefault(validator),
-    kind: inner.kind,
-    name,
-    // `notNull` is tri-state: `true` (default / `.notNull()`), `false`
-    // (`.nullable()`), or `undefined` (no column metadata). Only an explicit
-    // `false` means the user opted the column into SQL `NULL` — which is what
-    // `fkFallback` keys off to emit `null` for an unresolved nullable FK. This
-    // mirrors codegen's own `isNullable` (`column?.notNull === false`).
-    nullable: meta.column?.notNull === false,
-    optional: validator.kind === "optional",
-    validator: inner
-  };
-};
-const introspectSchema = (schema) => {
-  const { tables } = schema;
-  return Object.entries(tables).map(([name, table]) => {
-    return {
-      fields: Object.entries(table.shape).map(([fieldName, validator]) => describeField(fieldName, validator)),
-      name
-    };
-  });
-};
-const orderTables = (specs, selected) => {
-  const byName = new Map(specs.map((spec) => [spec.name, spec]));
-  const parentsOf = (name) => {
-    const spec = byName.get(name);
-    if (spec === void 0) {
-      return /* @__PURE__ */ new Set();
-    }
-    const parents = /* @__PURE__ */ new Set();
-    for (const field of spec.fields) {
-      if (field.fkTable !== void 0 && field.fkTable !== name && selected.has(field.fkTable)) {
-        parents.add(field.fkTable);
-      }
-    }
-    return parents;
-  };
-  const ordered = [];
-  const placed = /* @__PURE__ */ new Set();
-  const pending = [...selected].filter((name) => byName.has(name));
-  while (pending.length > 0) {
-    const readyIndex = pending.findIndex((name2) => [...parentsOf(name2)].every((parent) => placed.has(parent)));
-    const index = readyIndex === -1 ? 0 : readyIndex;
-    const [name] = pending.splice(index, 1);
-    if (name === void 0) {
-      break;
-    }
-    ordered.push(name);
-    placed.add(name);
-  }
-  return ordered;
-};
-const fkParentClosure = (specs, roots) => {
-  const byName = new Map(specs.map((spec) => [spec.name, spec]));
-  const result = new Set(roots);
-  const stack = [...result];
-  while (stack.length > 0) {
-    const name = stack.pop();
-    if (name === void 0) {
-      break;
-    }
-    const spec = byName.get(name);
-    if (spec === void 0) {
-      continue;
-    }
-    for (const field of spec.fields) {
-      if (field.fkTable !== void 0 && field.fkTable !== name && byName.has(field.fkTable) && !result.has(field.fkTable)) {
-        result.add(field.fkTable);
-        stack.push(field.fkTable);
-      }
-    }
-  }
-  return result;
-};
-
-const constraintsOf = (validator) => metaOf(validator).constraints ?? {};
-const STRING_HEURISTICS = [
-  { generate: (input) => copycat.email(input), keywords: ["email"] },
-  { generate: (input) => copycat.firstName(input), keywords: ["firstname"] },
-  { generate: (input) => copycat.lastName(input), keywords: ["lastname", "surname"] },
-  { generate: (input) => copycat.username(input), keywords: ["username"] },
-  { generate: (input) => copycat.fullName(input), keywords: ["name"] },
-  { generate: (input) => copycat.sentence(input, { max: 5, min: 2 }), keywords: ["title"] },
-  { generate: (input) => copycat.url(input), keywords: ["url", "link", "image", "avatar"] },
-  { generate: (input) => copycat.phoneNumber(input), keywords: ["phone"] },
-  { generate: (input) => copycat.paragraph(input), keywords: ["description", "bio", "body", "content", "text"] },
-  { generate: (input) => copycat.slug(input), keywords: ["slug", "key", "code"] },
-  { generate: (input) => copycat.city(input), keywords: ["city"] },
-  { generate: (input) => copycat.country(input), keywords: ["country"] },
-  { generate: (input) => copycat.streetAddress(input), keywords: ["address", "street"] },
-  { generate: (input) => copycat.password(input), keywords: ["password", "secret", "token"] }
-];
-const generateString = (fieldName, input, constraints) => {
-  const lower = fieldName.toLowerCase();
-  const rule = STRING_HEURISTICS.find((entry) => entry.keywords.some((keyword) => lower.includes(keyword)));
-  const value = rule === void 0 ? copycat.word(input) : rule.generate(input);
-  const { maxLength, minLength } = constraints;
-  if (maxLength !== void 0 && minLength !== void 0 && minLength > maxLength) {
-    throw new Error(
-      `Seed constraint error for field "${fieldName}": minLength (${String(minLength)}) > maxLength (${String(maxLength)}). Adjust the schema constraints.`
-    );
-  }
-  const truncated = maxLength !== void 0 && value.length > maxLength ? value.slice(0, maxLength) : value;
-  if (minLength !== void 0 && truncated.length < minLength) {
-    return truncated.padEnd(minLength, truncated.length > 0 ? truncated : "x");
-  }
-  return truncated;
-};
-const generateValue = (validator, fieldName, input) => {
-  const inner = unwrapOptional(validator);
-  const constraints = constraintsOf(inner);
-  if (constraints.enum !== void 0 && constraints.enum.length > 0) {
-    return copycat.oneOf(input, constraints.enum);
-  }
-  switch (inner.kind) {
-    case "any": {
-      return copycat.word(input);
-    }
-    case "array": {
-      const element = metaOf(inner).inner;
-      if (element === void 0) {
-        return [];
-      }
-      return copycat.times(input, [1, 3], (itemInput) => generateValue(element, fieldName, itemInput));
-    }
-    case "bigint": {
-      return copycat.int(input, { max: 1e6, min: 0 });
-    }
-    case "boolean": {
-      return copycat.bool(input);
-    }
-    case "bytes": {
-      return Array.from({ length: 8 }, (_, index) => copycat.int([input, index], { max: 255, min: 0 }));
-    }
-    case "date":
-    case "timestamp": {
-      return new Date(copycat.dateString(input)).getTime();
-    }
-    case "id": {
-      return copycat.uuid(input);
-    }
-    case "literal": {
-      return metaOf(inner).value;
-    }
-    case "null": {
-      return null;
-    }
-    case "number": {
-      return copycat.int(input, { max: constraints.maximum ?? 1e3, min: constraints.minimum ?? 0 });
-    }
-    case "object": {
-      const shape = metaOf(inner).shape ?? {};
-      return Object.fromEntries(Object.entries(shape).map(([key, child]) => [key, generateValue(child, key, [input, key])]));
-    }
-    case "record": {
-      const { valueValidator } = metaOf(inner);
-      const entries = copycat.times(input, [1, 3], (itemInput) => {
-        const key = copycat.word(["k", itemInput]);
-        const value = valueValidator === void 0 ? copycat.word(["v", itemInput]) : generateValue(valueValidator, fieldName, ["v", itemInput]);
-        return [key, value];
-      });
-      return Object.fromEntries(entries);
-    }
-    case "storage": {
-      return `seed/${copycat.uuid(input)}`;
-    }
-    case "string": {
-      return generateString(fieldName, input, constraints);
-    }
-    case "union": {
-      const members = metaOf(inner).members ?? [];
-      const chosen = copycat.oneOf(input, members);
-      return chosen === void 0 ? copycat.word(input) : generateValue(chosen, fieldName, [input, "u"]);
-    }
-    default: {
-      return copycat.word(input);
-    }
-  }
-};
-
-const resolveOverride = (override, context) => typeof override === "function" ? override(context) : override;
-const fkFallback = (field, input) => {
-  if (field.optional) {
-    return void 0;
-  }
-  return field.nullable ? null : copycat.uuid(input);
-};
-const fkPool = (field, table, localIndex, idsByTable, existingIds) => {
-  const fkTable = field.fkTable;
-  const seeded = fkTable === table ? (idsByTable.get(table) ?? []).slice(0, localIndex) : idsByTable.get(fkTable) ?? [];
-  const existing = existingIds[fkTable] ?? [];
-  return existing.length === 0 ? seeded : [...seeded, ...existing];
-};
-const cellInput = (seed, table, index, column) => [seed, table, index, column];
-const generateField = (field, table, input, localIndex, idsByTable, existingIds) => {
-  if (field.fkTable !== void 0) {
-    const pool = fkPool(field, table, localIndex, idsByTable, existingIds);
-    if (pool.length === 0) {
-      return fkFallback(field, input);
-    }
-    return copycat.oneOf(input, pool);
-  }
-  if (field.hasServerDefault) {
-    return void 0;
-  }
-  return generateValue(field.validator, field.name, input);
-};
-const seedPlan = (schema, options = {}) => {
-  const { counts = {}, defaultCount = 10, existingIds = {}, indexOffset = {}, only, overrides = {}, seed = 0 } = options;
-  setHashKey(seed);
-  const specs = introspectSchema(schema);
-  const requested = new Set(only ?? specs.map((spec) => spec.name));
-  const selected = new Set([...fkParentClosure(specs, requested)].filter((table) => requested.has(table) || (existingIds[table] ?? []).length === 0));
-  const order = orderTables(specs, selected);
-  const specByName = new Map(specs.map((spec) => [spec.name, spec]));
-  const idsByTable = /* @__PURE__ */ new Map();
-  const storeRows = {};
-  const plan = [];
-  for (const table of order) {
-    const spec = specByName.get(table);
-    if (spec === void 0) {
-      continue;
-    }
-    const tableOverrides = overrides[table] ?? {};
-    const count = counts[table] ?? defaultCount;
-    const offset = indexOffset[table] ?? 0;
-    const ids = [];
-    idsByTable.set(table, ids);
-    const rows = [];
-    storeRows[table] = rows;
-    for (let localIndex = 0; localIndex < count; localIndex += 1) {
-      const index = offset + localIndex;
-      const row = {};
-      const apply = (field, fallback) => {
-        if (Object.hasOwn(tableOverrides, field)) {
-          const overridden = resolveOverride(tableOverrides[field], { field, index, row, store: storeRows, table });
-          if (overridden !== void 0) {
-            row[field] = overridden;
-            return;
-          }
-        }
-        const value = fallback();
-        if (value !== void 0) {
-          row[field] = value;
-        }
-      };
-      apply("_id", () => copycat.uuid(cellInput(seed, table, index, "_id")));
-      ids.push(row._id);
-      for (const field of spec.fields) {
-        apply(field.name, () => generateField(field, table, cellInput(seed, table, index, field.name), localIndex, idsByTable, existingIds));
-      }
-      rows.push(row);
-    }
-    plan.push({ rows, table });
-  }
-  return plan;
-};
-
-export { setHashKey as a, copycat as c, introspectSchema as i, seedPlan as s };

package/dist/packem_shared/plan.d-BQ6LiWIk.d.mts

@@ -1,78 +0,0 @@
-import { Schema } from '@lunora/server';
-/**
-* The pure, I/O-free core of seeding. {@link seedPlan} introspects a schema,
-* generates rows table-by-table in foreign-key order, and resolves every
-* `v.id("parent")` column to a real id of an already-generated parent row. The
-* result feeds every adapter (test harness, CLI, studio) — none of them
-* re-implement generation.
-*
-* Determinism: a `seed` value selects the global copycat mapping, and each value
-* is hashed from `[seed, table, index, field]`, so the same `(schema, options)`
-* always yields byte-identical rows.
-*/
-/** A row context handed to an override function. */
-interface OverrideContext {
-  field: string;
-  /** The row's absolute index (the `indexOffset` base plus its position in this batch). */
-  index: number;
-  /** The row built so far (system `_id` first, then earlier fields). */
-  row: Record<string, unknown>;
-  /**
-  * A live, read-only view of every table's rows generated so far this run,
-  * keyed by table name. Lets an override correlate across tables (e.g. copy a
-  * field from the parent row a foreign key points at). Rows for the current
-  * table accumulate as they are built, so only earlier rows are visible.
-  */
-  store: Readonly<Record<string, ReadonlyArray<Record<string, unknown>>>>;
-  table: string;
-}
-/**
-* Per-table, per-field overrides. Each override is a static value or a function
-* of the row context; field `_id` overrides the generated primary key.
-*/
-type SeedOverrides = Record<string, Record<string, unknown>>;
-/** Per-table row counts. */
-type SeedCounts = Record<string, number>;
-interface SeedOptions {
-  /** Rows per table; falls back to {@link SeedOptions.defaultCount} when a table is absent. */
-  counts?: SeedCounts;
-  /** Count used for any selected table not present in `counts` (default `10`). */
-  defaultCount?: number;
-  /**
-  * Ids of rows that already exist in the target store, keyed by table. Foreign
-  * keys may resolve to these in addition to freshly-seeded parents, and a
-  * parent table fully covered here is not re-seeded when it is only pulled in
-  * as an FK dependency (it is when named explicitly in `only`).
-  */
-  existingIds?: Readonly<Record<string, ReadonlyArray<string>>>;
-  /**
-  * Per-table absolute index base for generation. Defaults to `0`. A client
-  * seeding the same table across several calls passes the running total so
-  * each batch hashes from fresh indices and never collides ids with an
-  * earlier batch.
-  */
-  indexOffset?: Readonly<Record<string, number>>;
-  /**
-  * Restrict seeding to these tables. Transitive `v.id(...)` parents are added
-  * automatically (unless already covered by `existingIds`) so child foreign
-  * keys resolve to real rows. The result is still ordered by FK dependency.
-  * Default: all tables.
-  */
-  only?: ReadonlyArray<string>;
-  /** Static values or functions overriding generated columns. */
-  overrides?: SeedOverrides;
-  /** Deterministic mapping selector — same seed ⇒ same rows. Default `0`. */
-  seed?: number;
-}
-/** One table's generated rows, in insert order. Each row carries an explicit `_id`. */
-interface TablePlan {
-  rows: ReadonlyArray<Record<string, unknown>>;
-  table: string;
-}
-/**
-* Build a deterministic, FK-consistent set of rows for `schema`.
-* @returns one {@link TablePlan} per seeded table, ordered so a table's FK
-* parents come before it.
-*/
-declare const seedPlan: (schema: Schema, options?: SeedOptions) => ReadonlyArray<TablePlan>;
-export { OverrideContext as O, SeedCounts as S, TablePlan as T, SeedOptions as a, SeedOverrides as b, seedPlan as s };

package/dist/packem_shared/plan.d-BQ6LiWIk.d.ts

@@ -1,78 +0,0 @@
-import { Schema } from '@lunora/server';
-/**
-* The pure, I/O-free core of seeding. {@link seedPlan} introspects a schema,
-* generates rows table-by-table in foreign-key order, and resolves every
-* `v.id("parent")` column to a real id of an already-generated parent row. The
-* result feeds every adapter (test harness, CLI, studio) — none of them
-* re-implement generation.
-*
-* Determinism: a `seed` value selects the global copycat mapping, and each value
-* is hashed from `[seed, table, index, field]`, so the same `(schema, options)`
-* always yields byte-identical rows.
-*/
-/** A row context handed to an override function. */
-interface OverrideContext {
-  field: string;
-  /** The row's absolute index (the `indexOffset` base plus its position in this batch). */
-  index: number;
-  /** The row built so far (system `_id` first, then earlier fields). */
-  row: Record<string, unknown>;
-  /**
-  * A live, read-only view of every table's rows generated so far this run,
-  * keyed by table name. Lets an override correlate across tables (e.g. copy a
-  * field from the parent row a foreign key points at). Rows for the current
-  * table accumulate as they are built, so only earlier rows are visible.
-  */
-  store: Readonly<Record<string, ReadonlyArray<Record<string, unknown>>>>;
-  table: string;
-}
-/**
-* Per-table, per-field overrides. Each override is a static value or a function
-* of the row context; field `_id` overrides the generated primary key.
-*/
-type SeedOverrides = Record<string, Record<string, unknown>>;
-/** Per-table row counts. */
-type SeedCounts = Record<string, number>;
-interface SeedOptions {
-  /** Rows per table; falls back to {@link SeedOptions.defaultCount} when a table is absent. */
-  counts?: SeedCounts;
-  /** Count used for any selected table not present in `counts` (default `10`). */
-  defaultCount?: number;
-  /**
-  * Ids of rows that already exist in the target store, keyed by table. Foreign
-  * keys may resolve to these in addition to freshly-seeded parents, and a
-  * parent table fully covered here is not re-seeded when it is only pulled in
-  * as an FK dependency (it is when named explicitly in `only`).
-  */
-  existingIds?: Readonly<Record<string, ReadonlyArray<string>>>;
-  /**
-  * Per-table absolute index base for generation. Defaults to `0`. A client
-  * seeding the same table across several calls passes the running total so
-  * each batch hashes from fresh indices and never collides ids with an
-  * earlier batch.
-  */
-  indexOffset?: Readonly<Record<string, number>>;
-  /**
-  * Restrict seeding to these tables. Transitive `v.id(...)` parents are added
-  * automatically (unless already covered by `existingIds`) so child foreign
-  * keys resolve to real rows. The result is still ordered by FK dependency.
-  * Default: all tables.
-  */
-  only?: ReadonlyArray<string>;
-  /** Static values or functions overriding generated columns. */
-  overrides?: SeedOverrides;
-  /** Deterministic mapping selector — same seed ⇒ same rows. Default `0`. */
-  seed?: number;
-}
-/** One table's generated rows, in insert order. Each row carries an explicit `_id`. */
-interface TablePlan {
-  rows: ReadonlyArray<Record<string, unknown>>;
-  table: string;
-}
-/**
-* Build a deterministic, FK-consistent set of rows for `schema`.
-* @returns one {@link TablePlan} per seeded table, ordered so a table's FK
-* parents come before it.
-*/
-declare const seedPlan: (schema: Schema, options?: SeedOptions) => ReadonlyArray<TablePlan>;
-export { OverrideContext as O, SeedCounts as S, TablePlan as T, SeedOptions as a, SeedOverrides as b, seedPlan as s };

package/dist/packem_shared/seedPlan-CDSmSgjY.mjs

@@ -1 +0,0 @@
-export { s as seedPlan } from './plan-DirmkctQ.mjs';