@warlock.js/core 5.31.0 → 5.32.0

package/esm/database/index.d.mts

@@ -1,5 +1,7 @@
 import { DatabaseLogModel } from "./models/database-log/database-log.mjs";
+import "./models/database-log/index.mjs";
 import { SeedClock, SeedContext, SeedRecordRef, SeedResult, SeederMetadata, Track, TrackableModel } from "./seeds/types.mjs";
 import { Seeder, seeder } from "./seeds/seeder.mjs";
 import { SeederDependencyCycleError, UnknownSeederDependencyError } from "./seeds/seeder.errors.mjs";
-import { useComputedModel, useComputedSlug, useHashedPassword } from "./utils.mjs";
+import { useComputedModel, useComputedSlug, useHashedPassword } from "./utils.mjs";
+export { DatabaseLogModel, SeedClock, SeedContext, SeedRecordRef, SeedResult, Seeder, SeederDependencyCycleError, SeederMetadata, Track, TrackableModel, UnknownSeederDependencyError, seeder, useComputedModel, useComputedSlug, useHashedPassword };

package/esm/database/index.mjs

@@ -4,4 +4,4 @@ import { seeder } from "./seeds/seeder.mjs";
 import { SeederDependencyCycleError, UnknownSeederDependencyError } from "./seeds/seeder.errors.mjs";
 import { useComputedModel, useComputedSlug, useHashedPassword } from "./utils.mjs";
 
-export {  };
+export { DatabaseLogModel, SeederDependencyCycleError, UnknownSeederDependencyError, seeder, useComputedModel, useComputedSlug, useHashedPassword };

package/esm/database/migrate-action.mjs

@@ -148,5 +148,5 @@ async function loadAllMigrations() {
 }
 
 //#endregion
-export { migrateAction };
+export { loadAllMigrations, loadMigrationFile, migrateAction };
 //# sourceMappingURL=migrate-action.mjs.map

package/esm/database/models/database-log/database-log.d.mts

@@ -1,6 +1,5 @@
 import { Infer } from "@warlock.js/seal";
 import { Model } from "@warlock.js/cascade";
-
 //#region ../../packages/core/src/database/models/database-log/database-log.d.ts
 declare const schema: import("@warlock.js/seal").ObjectValidator<{
   module: import("@warlock.js/seal").StringValidator & import("@warlock.js/seal").StandardSchemaV1<string, string>;
@@ -13,7 +12,7 @@ declare const schema: import("@warlock.js/seal").ObjectValidator<{
   date: import("@warlock.js/seal").StringValidator & import("@warlock.js/seal").StandardSchemaV1<string, string>;
 }>;
 type LogSchema = Infer.Output<typeof schema>;
-declare class DatabaseLogModel extends Model<LogSchema> {
+export declare class DatabaseLogModel extends Model<LogSchema> {
   /**
    * Table name
    */
@@ -50,5 +49,5 @@ declare class DatabaseLogModel extends Model<LogSchema> {
   get(field: string, defaultValue?: any): any;
 }
 //#endregion
-export { DatabaseLogModel };
+export {};
 //# sourceMappingURL=database-log.d.mts.map

package/esm/database/models/database-log/database-log.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"database-log.d.mts","names":[],"sources":["../../../../../../../../../../packages/core/src/database/models/database-log/database-log.ts"],"mappings":";;;;cAGM,MAAA,6BAAM,eAAA;;;;;;;;;;KASP,SAAA,GAAY,KAAA,CAAM,MAAM,QAAQ,MAAA;AAAA,cAExB,gBAAA,SAAyB,KAAK,CAAC,SAAA;;;;SAI5B,KAAA;;;;SAKA,MAAA,6BAAM,eAAA;;;;;;;;;;EAXR;;;;EAAA,wBAiBY,YAAA;EAjBW;;AAAM;EAAN,IAyBxB,OAAA;EAvBiB;;;EAAA,IA8BjB,KAAA;EA9B+B;;;EAqCnC,GAAA,CAAI,KAAA,UAAe,YAAA;AAAA"}
+{"version":3,"file":"database-log.d.mts","names":[],"sources":["../../../../../../../../../../packages/core/src/database/models/database-log/database-log.ts"],"mappings":";;;cAGM,mCAAM;;;;;;;;;;KASP,YAAY,MAAM,cAAc;qBAExB,yBAAyB,MAAM;;;;SAI5B;;;;SAKA,mCAAM;;;;;;;;;;;;;;0BAMI;;;;MAQb;;;;MAOA;;;;EAOJ,IAAI,eAAe"}

package/esm/database/models/database-log/index.d.mts

@@ -1 +1,2 @@
-import { DatabaseLogModel } from "./database-log.mjs";
+import { DatabaseLogModel } from "./database-log.mjs";
+export { DatabaseLogModel };

package/esm/database/models/database-log/index.mjs

@@ -1,3 +1,3 @@
 import { DatabaseLogModel } from "./database-log.mjs";
 
-export {  };
+export { DatabaseLogModel };

package/esm/database/seed-command-action.mjs

@@ -119,5 +119,5 @@ async function loadSeedFile(absPath) {
 }
 
 //#endregion
-export { seedCommandAction };
+export { clearAllTables, dropSeedRecords, seedCommandAction };
 //# sourceMappingURL=seed-command-action.mjs.map

package/esm/database/seeds/seeder.d.mts

@@ -1,7 +1,6 @@
 import { SeedContext, SeedResult } from "./types.mjs";
-
 //#region ../../packages/core/src/database/seeds/seeder.d.ts
-type Seeder = {
+export type Seeder = {
   /**
    * Seed name
    */
@@ -55,7 +54,6 @@ type Seeder = {
 /**
  * Create a new seeder
  */
-declare function seeder(seeder: Seeder): Seeder;
+export declare function seeder(seeder: Seeder): Seeder;
 //#endregion
-export { Seeder, seeder };
 //# sourceMappingURL=seeder.d.mts.map

package/esm/database/seeds/seeder.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"seeder.d.mts","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/seeder.ts"],"mappings":";;;KAEY,MAAA;;AAAZ;;EAIE,IAAA;EA6CS;;;EAzCT,OAAA;EAyC8B;;;EArC9B,WAAA;EAIA;;;EAAA,SAAA;EAiCA;;;EA7BA,IAAA;EA6B+B;;AAAU;EAzBzC,KAAA;EA+BoB;;;;;;;EAvBpB,SAAA;;;;;;;;;;;;;;;;;EAiBA,GAAA,CAAI,GAAA,EAAK,WAAA,GAAc,OAAA,CAAQ,UAAA;AAAA;;;;iBAMjB,MAAA,CAAO,MAAA,EAAQ,MAAA,GAAM,MAAA"}
+{"version":3,"file":"seeder.d.mts","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/seeder.ts"],"mappings":";;YAEY;;;;EAIV;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;;;;;;;EAQA;;;;;;;;;;;;;;;;;EAiBA,IAAI,KAAK,cAAc,QAAQ;;;;;wBAMjB,OAAO,QAAQ,SAAM"}

package/esm/database/seeds/seeder.errors.d.mts

@@ -4,7 +4,7 @@
  * registered with the manager. Surfaces the offending dependent + the missing
  * dependency so the misconfiguration is obvious without spelunking.
  */
-declare class UnknownSeederDependencyError extends Error {
+export declare class UnknownSeederDependencyError extends Error {
   readonly seeder: string;
   readonly dependency: string;
   /** Stable Warlock error code; `warlock explain WL6001` prints the fix. */
@@ -15,12 +15,11 @@ declare class UnknownSeederDependencyError extends Error {
  * Thrown when the `dependsOn` graph contains a cycle, which would make a
  * deterministic run order impossible. Carries the cycle path for diagnosis.
  */
-declare class SeederDependencyCycleError extends Error {
+export declare class SeederDependencyCycleError extends Error {
   readonly cycle: string[];
   /** Stable Warlock error code; `warlock explain WL6002` prints the fix. */
   readonly code = "WL6002";
   constructor(cycle: string[]);
 }
 //#endregion
-export { SeederDependencyCycleError, UnknownSeederDependencyError };
 //# sourceMappingURL=seeder.errors.d.mts.map

package/esm/database/seeds/seeder.errors.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"seeder.errors.d.mts","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/seeder.errors.ts"],"mappings":";;AAKA;;;;cAAa,4BAAA,SAAqC,KAAK;EAAA,SAKnC,MAAA;EAAA,SACA,UAAA;EAJF;EAAA,SAAA,IAAA;cAGE,MAAA,UACA,UAAA;AAAA;;AAAkB;AAatC;;cAAa,0BAAA,SAAmC,KAAK;EAAA,SAIhB,KAAA;EAJW;EAAA,SAE9B,IAAA;cAEmB,KAAA;AAAA"}
+{"version":3,"file":"seeder.errors.d.mts","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/seeder.errors.ts"],"mappings":";;;;;;qBAKa,qCAAqC;WAK9B;WACA;;WAJF;EAEhB,YACkB,gBACA;;;;;;qBAaP,mCAAmC;WAIX;;WAFnB;EAEhB,YAAmC"}

package/esm/database/seeds/seeders.manager.mjs

@@ -148,7 +148,8 @@ var SeedersManager = class {
 			if (status === "visited") return;
 			if (status === "visiting") {
 				const cycleStart = path.indexOf(seeder.name);
-				throw new SeederDependencyCycleError(path.slice(cycleStart >= 0 ? cycleStart : 0).concat(seeder.name));
+				const cycle = path.slice(cycleStart >= 0 ? cycleStart : 0).concat(seeder.name);
+				throw new SeederDependencyCycleError(cycle);
 			}
 			state.set(seeder.name, "visiting");
 			for (const dependency of seeder.dependsOn ?? []) visit(byName.get(dependency), [...path, seeder.name]);

package/esm/database/seeds/seeders.manager.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"seeders.manager.mjs","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/seeders.manager.ts"],"sourcesContent":["import { colors } from \"@mongez/copper\";\nimport {\n  type DataSource,\n  type DriverContract,\n  DatabaseWriterValidationError,\n  dataSourceRegistry,\n  migrationRunner,\n  transaction,\n} from \"@warlock.js/cascade\";\nimport type { Seeder } from \"./seeder\";\nimport { SeederDependencyCycleError, UnknownSeederDependencyError } from \"./seeder.errors\";\nimport { SeedRecordsTableMigration } from \"./seed-records-table-migration\";\nimport { SeedsTableMigration } from \"./seeds-table-migration\";\nimport type {\n  SeedClock,\n  SeederMetadata,\n  SeedRecordRef,\n  SeedResult,\n  Track,\n  TrackableModel,\n} from \"./types\";\nimport { seedRecordsTableName, seedsTableName } from \"./utils\";\n\nexport type SeedersManagerOptions = {\n  datasource?: DataSource;\n  /**\n   * Clock the manager reads for the `now` it hands each seeder AND for its own\n   * metadata timestamps (`createdAt` / `firstRunAt` / `lastRunAt` / a tracked\n   * ref's `runAt`). Defaults to `() => new Date()`. Override it to make a\n   * historical back-fill or a test deterministic — every timestamp a run\n   * produces then comes from this one clock.\n   */\n  clock?: SeedClock;\n};\n\nexport class SeedersManager {\n  public seeders: Seeder[] = [];\n\n  // Not optional: the constructor assigns unconditionally, falling back to\n  // dataSourceRegistry.get(), which itself returns a DataSource rather than\n  // undefined. The `?` here described the OPTIONS field, not this one, and made\n  // every read of `this.datasource.driver` a type error. The options field stays\n  // optional, because that input genuinely is.\n  protected datasource: DataSource;\n\n  /**\n   * The single clock every timestamp in a run reads from. Defaults to\n   * `() => new Date()`; overridable via {@link SeedersManagerOptions.clock}.\n   */\n  protected readonly now: SeedClock;\n\n  public constructor(protected options?: SeedersManagerOptions) {\n    this.datasource = options?.datasource ?? dataSourceRegistry.get();\n    this.now = options?.clock ?? (() => new Date());\n  }\n\n  /**\n   * Register new seeder\n   */\n  public register(...seeders: Seeder[]) {\n    this.seeders.push(...seeders);\n    return this;\n  }\n\n  /**\n   * Initialize before running\n   */\n  protected async init() {\n    if (!(await this.driver.blueprint.tableExists(seedsTableName))) {\n      await migrationRunner.run(SeedsTableMigration);\n    }\n\n    if (!(await this.driver.blueprint.tableExists(seedRecordsTableName))) {\n      await migrationRunner.run(SeedRecordsTableMigration);\n    }\n  }\n\n  /**\n   * Run seeders\n   */\n  public async run(withTransaction = true) {\n    await this.init();\n\n    this.prepareSeeders();\n\n    console.log(`🌱 Running ${this.seeders.length} seeder(s)...\\n`);\n\n    let successCount = 0;\n    let skippedCount = 0;\n    let failedCount = 0;\n\n    for (const seeder of this.seeders) {\n      // Check if already executed\n      if (seeder.once && (await this.seederIsExecutedBefore(seeder))) {\n        console.log(`⏭️  Skipping ${colors.yellow(seeder.name)} (already executed)`);\n        skippedCount++;\n        continue;\n      }\n\n      try {\n        console.log(`🔄 Running ${colors.green(seeder.name)}...`);\n        const startTime = Date.now();\n\n        const refs: SeedRecordRef[] = [];\n        const track = this.createTracker(seeder, refs);\n\n        const runSeeder = async () => {\n          // Keep LAST-RUN refs only: drop the prior refs for this seeder before\n          // writing the new ones, so `--drop` undo stays bounded.\n          await this.driver.deleteMany(seedRecordsTableName, { seeder: seeder.name });\n\n          const result = await seeder.run({\n            track,\n            now: this.now,\n            batchSize: seeder.batchSize ?? 0,\n          });\n\n          if (refs.length > 0) {\n            await this.driver.insertMany(\n              seedRecordsTableName,\n              refs.map((ref) => ({ ...ref })),\n            );\n          }\n\n          return result;\n        };\n\n        const result = withTransaction ? await transaction(runSeeder) : await runSeeder();\n\n        const duration = Date.now() - startTime;\n\n        // Auto-derive recordsCreated from the track count; a returned\n        // SeedResult is an optional fallback when nothing was tracked.\n        const recordsCreated = refs.length > 0 ? refs.length : (result?.recordsCreated ?? 0);\n\n        await this.storeSeedsResults(seeder, { recordsCreated });\n\n        console.log(\n          `✅ ${colors.green(seeder.name)} completed (${duration}ms, ${recordsCreated} records)\\n`,\n        );\n        successCount++;\n      } catch (error: any) {\n        const err = error as Error;\n        console.error(`❌ ${colors.red(seeder.name)} failed:`, err.message);\n        console.log(err);\n        failedCount++;\n\n        if (error instanceof DatabaseWriterValidationError) {\n          console.log(error.errors);\n        }\n\n        // Re-throw to stop execution (or continue to next seed based on your preference)\n        throw error;\n      }\n    }\n\n    // Summary\n    console.log(\"\\n\" + \"=\".repeat(50));\n    console.log(`✅ Success: ${successCount}`);\n\n    if (skippedCount > 0) console.log(`⏭️  Skipped: ${skippedCount}`);\n\n    if (failedCount > 0) console.log(`❌ Failed: ${failedCount}`);\n\n    console.log(\"=\".repeat(50));\n  }\n\n  /**\n   * Build a `track` helper bound to the given seeder. Tracked refs are pushed\n   * into `refs` and persisted (within the run transaction) by the caller.\n   *\n   * Every overload returns its first argument so it can be chained inline.\n   */\n  protected createTracker(seeder: Seeder, refs: SeedRecordRef[]): Track {\n    const push = (table: string, recordId: number | string) => {\n      refs.push({ seeder: seeder.name, table, recordId, runAt: this.now() });\n    };\n\n    function track<T extends TrackableModel>(model: T): T;\n    function track<T extends TrackableModel>(models: T[]): T[];\n    function track(table: string, id: number | string): string;\n    function track(\n      arg: TrackableModel | TrackableModel[] | string,\n      id?: number | string,\n    ): TrackableModel | TrackableModel[] | string {\n      if (typeof arg === \"string\") {\n        push(arg, id as number | string);\n\n        return arg;\n      }\n\n      if (Array.isArray(arg)) {\n        for (const model of arg) {\n          push(model.getTableName(), model.id);\n        }\n\n        return arg;\n      }\n\n      push(arg.getTableName(), arg.id);\n\n      return arg;\n    }\n\n    return track;\n  }\n\n  /**\n   * Sort seeds\n   */\n  public sort() {\n    this.seeders = this.seeders.sort((a, b) => {\n      const orderA = a.order ?? Number.MAX_SAFE_INTEGER;\n      const orderB = b.order ?? Number.MAX_SAFE_INTEGER;\n      return orderA - orderB;\n    });\n\n    return this;\n  }\n\n  /**\n   * Prepare seeders to order by the seeder order, then resolve `dependsOn`.\n   *\n   * Dependencies are honored via a topological sort layered over the existing\n   * numeric `order` tie-break: among seeders whose dependencies are already\n   * satisfied, the lowest `order` (then registration order) runs first. Throws\n   * {@link UnknownSeederDependencyError} for a missing dependency and\n   * {@link SeederDependencyCycleError} for a cycle.\n   */\n  public prepareSeeders() {\n    this.seeders = this.seeders.filter((seeder) => seeder.enabled !== false);\n\n    this.sort();\n\n    this.seeders = this.resolveDependencies(this.seeders);\n\n    return this;\n  }\n\n  /**\n   * Topologically sort `seeders` by their `dependsOn` names. The input is\n   * assumed pre-sorted by `order` (see {@link sort}); that ordering is used as\n   * the tie-break so dependency-free siblings keep their `order` sequence.\n   */\n  protected resolveDependencies(seeders: Seeder[]): Seeder[] {\n    const byName = new Map<string, Seeder>();\n\n    for (const seeder of seeders) {\n      byName.set(seeder.name, seeder);\n    }\n\n    // Validate dependencies up-front so an unknown name is a clear error rather\n    // than a silently dropped edge.\n    for (const seeder of seeders) {\n      for (const dependency of seeder.dependsOn ?? []) {\n        if (!byName.has(dependency)) {\n          throw new UnknownSeederDependencyError(seeder.name, dependency);\n        }\n      }\n    }\n\n    const sorted: Seeder[] = [];\n    const state = new Map<string, \"visiting\" | \"visited\">();\n\n    const visit = (seeder: Seeder, path: string[]) => {\n      const status = state.get(seeder.name);\n\n      if (status === \"visited\") {\n        return;\n      }\n\n      if (status === \"visiting\") {\n        const cycleStart = path.indexOf(seeder.name);\n        const cycle = path.slice(cycleStart >= 0 ? cycleStart : 0).concat(seeder.name);\n\n        throw new SeederDependencyCycleError(cycle);\n      }\n\n      state.set(seeder.name, \"visiting\");\n\n      for (const dependency of seeder.dependsOn ?? []) {\n        // Presence already validated above; the `!` is safe.\n        visit(byName.get(dependency)!, [...path, seeder.name]);\n      }\n\n      state.set(seeder.name, \"visited\");\n      sorted.push(seeder);\n    };\n\n    // Iterate in the incoming (order-sorted, registration-stable) sequence so\n    // dependency-free seeders preserve their `order` tie-break.\n    for (const seeder of seeders) {\n      visit(seeder, []);\n    }\n\n    return sorted;\n  }\n\n  /**\n   * Store seed results in db\n   */\n  public async storeSeedsResults(seeder: Seeder, result: SeedResult) {\n    const oldResult = await this.getMetadata(seeder);\n\n    // log with an emoji icon at beginning of text no of total craeted records\n    console.log(`📊 Total records created: ${result.recordsCreated}`);\n\n    // Read the single overridable clock once so every timestamp in this write\n    // is identical (and pinned in a deterministic / historical run).\n    const now = this.now();\n\n    if (oldResult) {\n      // Update existing record - use query builder with WHERE clause\n      await this.driver\n        .queryBuilder(seedsTableName)\n        .where(\"name\", seeder.name)\n        .update({\n          runCount: oldResult.runCount + 1,\n          lastRunAt: now,\n          totalRecordsCreated: oldResult.totalRecordsCreated + result.recordsCreated,\n          lastRunRecordsCreated: result.recordsCreated,\n        });\n\n      // now display total created records so far\n      console.log(\n        `📊 Total records created so far: ${oldResult.totalRecordsCreated + result.recordsCreated}`,\n      );\n    } else {\n      // Insert new record\n      await this.driver.insert(seedsTableName, {\n        name: seeder.name,\n        createdAt: now,\n        firstRunAt: now,\n        lastRunAt: now,\n        runCount: 1,\n        totalRecordsCreated: result.recordsCreated,\n        lastRunRecordsCreated: result.recordsCreated,\n      });\n    }\n  }\n\n  /**\n   * Get seed info from database\n   */\n  // Returns null when the seeder has never run. first() has always resolved to\n  // SeederMetadata | null; annotating it as non-null pushed that lie to every\n  // caller, each of which already branches on the absent case.\n  protected getMetadata(seeder: Seeder): Promise<SeederMetadata | null> {\n    const driver = this.datasource.driver;\n\n    return driver.queryBuilder(seedsTableName).where(\"name\", seeder.name).first();\n  }\n\n  /**\n   * Get driver instance\n   */\n  protected get driver(): DriverContract {\n    return this.datasource.driver;\n  }\n\n  /**\n   * Check if seeder has been executed before\n   */\n  protected async seederIsExecutedBefore(seeder: Seeder) {\n    return !!(await this.getMetadata(seeder));\n  }\n}\n"],"mappings":";;;;;;;;AAmCA,IAAa,iBAAb,MAA4B;CAgB1B,AAAO,YAAY,AAAU,SAAiC;EAAjC;iBAfF,CAAC;EAgB1B,KAAK,aAAa,SAAS,cAAc,mBAAmB,IAAI;EAChE,KAAK,MAAM,SAAS,gCAAgB,IAAI,KAAK;CAC/C;;;;CAKA,AAAO,SAAS,GAAG,SAAmB;EACpC,KAAK,QAAQ,KAAK,GAAG,OAAO;EAC5B,OAAO;CACT;;;;CAKA,MAAgB,OAAO;EACrB,IAAI,CAAE,MAAM,KAAK,OAAO,UAAU,oBAA0B,GAC1D,MAAM,gBAAgB,IAAI,mBAAmB;EAG/C,IAAI,CAAE,MAAM,KAAK,OAAO,UAAU,2BAAgC,GAChE,MAAM,gBAAgB,IAAI,yBAAyB;CAEvD;;;;CAKA,MAAa,IAAI,kBAAkB,MAAM;EACvC,MAAM,KAAK,KAAK;EAEhB,KAAK,eAAe;EAEpB,QAAQ,IAAI,cAAc,KAAK,QAAQ,OAAO,gBAAgB;EAE9D,IAAI,eAAe;EACnB,IAAI,eAAe;EACnB,IAAI,cAAc;EAElB,KAAK,MAAM,UAAU,KAAK,SAAS;GAEjC,IAAI,OAAO,QAAS,MAAM,KAAK,uBAAuB,MAAM,GAAI;IAC9D,QAAQ,IAAI,gBAAgB,OAAO,OAAO,OAAO,IAAI,EAAE,oBAAoB;IAC3E;IACA;GACF;GAEA,IAAI;IACF,QAAQ,IAAI,cAAc,OAAO,MAAM,OAAO,IAAI,EAAE,IAAI;IACxD,MAAM,YAAY,KAAK,IAAI;IAE3B,MAAM,OAAwB,CAAC;IAC/B,MAAM,QAAQ,KAAK,cAAc,QAAQ,IAAI;IAE7C,MAAM,YAAY,YAAY;KAG5B,MAAM,KAAK,OAAO,WAAW,sBAAsB,EAAE,QAAQ,OAAO,KAAK,CAAC;KAE1E,MAAM,SAAS,MAAM,OAAO,IAAI;MAC9B;MACA,KAAK,KAAK;MACV,WAAW,OAAO,aAAa;KACjC,CAAC;KAED,IAAI,KAAK,SAAS,GAChB,MAAM,KAAK,OAAO,WAChB,sBACA,KAAK,KAAK,SAAS,EAAE,GAAG,IAAI,EAAE,CAChC;KAGF,OAAO;IACT;IAEA,MAAM,SAAS,kBAAkB,MAAM,YAAY,SAAS,IAAI,MAAM,UAAU;IAEhF,MAAM,WAAW,KAAK,IAAI,IAAI;IAI9B,MAAM,iBAAiB,KAAK,SAAS,IAAI,KAAK,SAAU,QAAQ,kBAAkB;IAElF,MAAM,KAAK,kBAAkB,QAAQ,EAAE,eAAe,CAAC;IAEvD,QAAQ,IACN,KAAK,OAAO,MAAM,OAAO,IAAI,EAAE,cAAc,SAAS,MAAM,eAAe,YAC7E;IACA;GACF,SAAS,OAAY;IACnB,MAAM,MAAM;IACZ,QAAQ,MAAM,KAAK,OAAO,IAAI,OAAO,IAAI,EAAE,WAAW,IAAI,OAAO;IACjE,QAAQ,IAAI,GAAG;IACf;IAEA,IAAI,iBAAiB,+BACnB,QAAQ,IAAI,MAAM,MAAM;IAI1B,MAAM;GACR;EACF;EAGA,QAAQ,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;EACjC,QAAQ,IAAI,cAAc,cAAc;EAExC,IAAI,eAAe,GAAG,QAAQ,IAAI,gBAAgB,cAAc;EAEhE,IAAI,cAAc,GAAG,QAAQ,IAAI,aAAa,aAAa;EAE3D,QAAQ,IAAI,IAAI,OAAO,EAAE,CAAC;CAC5B;;;;;;;CAQA,AAAU,cAAc,QAAgB,MAA8B;EACpE,MAAM,QAAQ,OAAe,aAA8B;GACzD,KAAK,KAAK;IAAE,QAAQ,OAAO;IAAM;IAAO;IAAU,OAAO,KAAK,IAAI;GAAE,CAAC;EACvE;EAKA,SAAS,MACP,KACA,IAC4C;GAC5C,IAAI,OAAO,QAAQ,UAAU;IAC3B,KAAK,KAAK,EAAqB;IAE/B,OAAO;GACT;GAEA,IAAI,MAAM,QAAQ,GAAG,GAAG;IACtB,KAAK,MAAM,SAAS,KAClB,KAAK,MAAM,aAAa,GAAG,MAAM,EAAE;IAGrC,OAAO;GACT;GAEA,KAAK,IAAI,aAAa,GAAG,IAAI,EAAE;GAE/B,OAAO;EACT;EAEA,OAAO;CACT;;;;CAKA,AAAO,OAAO;EACZ,KAAK,UAAU,KAAK,QAAQ,MAAM,GAAG,MAAM;GAGzC,QAFe,EAAE,SAAS,OAAO,qBAClB,EAAE,SAAS,OAAO;EAEnC,CAAC;EAED,OAAO;CACT;;;;;;;;;;CAWA,AAAO,iBAAiB;EACtB,KAAK,UAAU,KAAK,QAAQ,QAAQ,WAAW,OAAO,YAAY,KAAK;EAEvE,KAAK,KAAK;EAEV,KAAK,UAAU,KAAK,oBAAoB,KAAK,OAAO;EAEpD,OAAO;CACT;;;;;;CAOA,AAAU,oBAAoB,SAA6B;EACzD,MAAM,yBAAS,IAAI,IAAoB;EAEvC,KAAK,MAAM,UAAU,SACnB,OAAO,IAAI,OAAO,MAAM,MAAM;EAKhC,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,cAAc,OAAO,aAAa,CAAC,GAC5C,IAAI,CAAC,OAAO,IAAI,UAAU,GACxB,MAAM,IAAI,6BAA6B,OAAO,MAAM,UAAU;EAKpE,MAAM,SAAmB,CAAC;EAC1B,MAAM,wBAAQ,IAAI,IAAoC;EAEtD,MAAM,SAAS,QAAgB,SAAmB;GAChD,MAAM,SAAS,MAAM,IAAI,OAAO,IAAI;GAEpC,IAAI,WAAW,WACb;GAGF,IAAI,WAAW,YAAY;IACzB,MAAM,aAAa,KAAK,QAAQ,OAAO,IAAI;IAG3C,MAAM,IAAI,2BAFI,KAAK,MAAM,cAAc,IAAI,aAAa,CAAC,CAAC,CAAC,OAAO,OAAO,IAEhC,CAAC;GAC5C;GAEA,MAAM,IAAI,OAAO,MAAM,UAAU;GAEjC,KAAK,MAAM,cAAc,OAAO,aAAa,CAAC,GAE5C,MAAM,OAAO,IAAI,UAAU,GAAI,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC;GAGvD,MAAM,IAAI,OAAO,MAAM,SAAS;GAChC,OAAO,KAAK,MAAM;EACpB;EAIA,KAAK,MAAM,UAAU,SACnB,MAAM,QAAQ,CAAC,CAAC;EAGlB,OAAO;CACT;;;;CAKA,MAAa,kBAAkB,QAAgB,QAAoB;EACjE,MAAM,YAAY,MAAM,KAAK,YAAY,MAAM;EAG/C,QAAQ,IAAI,6BAA6B,OAAO,gBAAgB;EAIhE,MAAM,MAAM,KAAK,IAAI;EAErB,IAAI,WAAW;GAEb,MAAM,KAAK,OACR,aAAa,cAAc,CAAC,CAC5B,MAAM,QAAQ,OAAO,IAAI,CAAC,CAC1B,OAAO;IACN,UAAU,UAAU,WAAW;IAC/B,WAAW;IACX,qBAAqB,UAAU,sBAAsB,OAAO;IAC5D,uBAAuB,OAAO;GAChC,CAAC;GAGH,QAAQ,IACN,oCAAoC,UAAU,sBAAsB,OAAO,gBAC7E;EACF,OAEE,MAAM,KAAK,OAAO,OAAO,gBAAgB;GACvC,MAAM,OAAO;GACb,WAAW;GACX,YAAY;GACZ,WAAW;GACX,UAAU;GACV,qBAAqB,OAAO;GAC5B,uBAAuB,OAAO;EAChC,CAAC;CAEL;;;;CAQA,AAAU,YAAY,QAAgD;EAGpE,OAFe,KAAK,WAAW,OAEjB,aAAa,cAAc,CAAC,CAAC,MAAM,QAAQ,OAAO,IAAI,CAAC,CAAC,MAAM;CAC9E;;;;CAKA,IAAc,SAAyB;EACrC,OAAO,KAAK,WAAW;CACzB;;;;CAKA,MAAgB,uBAAuB,QAAgB;EACrD,OAAO,CAAC,CAAE,MAAM,KAAK,YAAY,MAAM;CACzC;AACF"}
+{"version":3,"file":"seeders.manager.mjs","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/seeders.manager.ts"],"sourcesContent":["import { colors } from \"@mongez/copper\";\nimport {\n  type DataSource,\n  type DriverContract,\n  DatabaseWriterValidationError,\n  dataSourceRegistry,\n  migrationRunner,\n  transaction,\n} from \"@warlock.js/cascade\";\nimport type { Seeder } from \"./seeder\";\nimport { SeederDependencyCycleError, UnknownSeederDependencyError } from \"./seeder.errors\";\nimport { SeedRecordsTableMigration } from \"./seed-records-table-migration\";\nimport { SeedsTableMigration } from \"./seeds-table-migration\";\nimport type {\n  SeedClock,\n  SeederMetadata,\n  SeedRecordRef,\n  SeedResult,\n  Track,\n  TrackableModel,\n} from \"./types\";\nimport { seedRecordsTableName, seedsTableName } from \"./utils\";\n\nexport type SeedersManagerOptions = {\n  datasource?: DataSource;\n  /**\n   * Clock the manager reads for the `now` it hands each seeder AND for its own\n   * metadata timestamps (`createdAt` / `firstRunAt` / `lastRunAt` / a tracked\n   * ref's `runAt`). Defaults to `() => new Date()`. Override it to make a\n   * historical back-fill or a test deterministic — every timestamp a run\n   * produces then comes from this one clock.\n   */\n  clock?: SeedClock;\n};\n\nexport class SeedersManager {\n  public seeders: Seeder[] = [];\n\n  // Not optional: the constructor assigns unconditionally, falling back to\n  // dataSourceRegistry.get(), which itself returns a DataSource rather than\n  // undefined. The `?` here described the OPTIONS field, not this one, and made\n  // every read of `this.datasource.driver` a type error. The options field stays\n  // optional, because that input genuinely is.\n  protected datasource: DataSource;\n\n  /**\n   * The single clock every timestamp in a run reads from. Defaults to\n   * `() => new Date()`; overridable via {@link SeedersManagerOptions.clock}.\n   */\n  protected readonly now: SeedClock;\n\n  public constructor(protected options?: SeedersManagerOptions) {\n    this.datasource = options?.datasource ?? dataSourceRegistry.get();\n    this.now = options?.clock ?? (() => new Date());\n  }\n\n  /**\n   * Register new seeder\n   */\n  public register(...seeders: Seeder[]) {\n    this.seeders.push(...seeders);\n    return this;\n  }\n\n  /**\n   * Initialize before running\n   */\n  protected async init() {\n    if (!(await this.driver.blueprint.tableExists(seedsTableName))) {\n      await migrationRunner.run(SeedsTableMigration);\n    }\n\n    if (!(await this.driver.blueprint.tableExists(seedRecordsTableName))) {\n      await migrationRunner.run(SeedRecordsTableMigration);\n    }\n  }\n\n  /**\n   * Run seeders\n   */\n  public async run(withTransaction = true) {\n    await this.init();\n\n    this.prepareSeeders();\n\n    console.log(`🌱 Running ${this.seeders.length} seeder(s)...\\n`);\n\n    let successCount = 0;\n    let skippedCount = 0;\n    let failedCount = 0;\n\n    for (const seeder of this.seeders) {\n      // Check if already executed\n      if (seeder.once && (await this.seederIsExecutedBefore(seeder))) {\n        console.log(`⏭️  Skipping ${colors.yellow(seeder.name)} (already executed)`);\n        skippedCount++;\n        continue;\n      }\n\n      try {\n        console.log(`🔄 Running ${colors.green(seeder.name)}...`);\n        const startTime = Date.now();\n\n        const refs: SeedRecordRef[] = [];\n        const track = this.createTracker(seeder, refs);\n\n        const runSeeder = async () => {\n          // Keep LAST-RUN refs only: drop the prior refs for this seeder before\n          // writing the new ones, so `--drop` undo stays bounded.\n          await this.driver.deleteMany(seedRecordsTableName, { seeder: seeder.name });\n\n          const result = await seeder.run({\n            track,\n            now: this.now,\n            batchSize: seeder.batchSize ?? 0,\n          });\n\n          if (refs.length > 0) {\n            await this.driver.insertMany(\n              seedRecordsTableName,\n              refs.map((ref) => ({ ...ref })),\n            );\n          }\n\n          return result;\n        };\n\n        const result = withTransaction ? await transaction(runSeeder) : await runSeeder();\n\n        const duration = Date.now() - startTime;\n\n        // Auto-derive recordsCreated from the track count; a returned\n        // SeedResult is an optional fallback when nothing was tracked.\n        const recordsCreated = refs.length > 0 ? refs.length : (result?.recordsCreated ?? 0);\n\n        await this.storeSeedsResults(seeder, { recordsCreated });\n\n        console.log(\n          `✅ ${colors.green(seeder.name)} completed (${duration}ms, ${recordsCreated} records)\\n`,\n        );\n        successCount++;\n      } catch (error: any) {\n        const err = error as Error;\n        console.error(`❌ ${colors.red(seeder.name)} failed:`, err.message);\n        console.log(err);\n        failedCount++;\n\n        if (error instanceof DatabaseWriterValidationError) {\n          console.log(error.errors);\n        }\n\n        // Re-throw to stop execution (or continue to next seed based on your preference)\n        throw error;\n      }\n    }\n\n    // Summary\n    console.log(\"\\n\" + \"=\".repeat(50));\n    console.log(`✅ Success: ${successCount}`);\n\n    if (skippedCount > 0) console.log(`⏭️  Skipped: ${skippedCount}`);\n\n    if (failedCount > 0) console.log(`❌ Failed: ${failedCount}`);\n\n    console.log(\"=\".repeat(50));\n  }\n\n  /**\n   * Build a `track` helper bound to the given seeder. Tracked refs are pushed\n   * into `refs` and persisted (within the run transaction) by the caller.\n   *\n   * Every overload returns its first argument so it can be chained inline.\n   */\n  protected createTracker(seeder: Seeder, refs: SeedRecordRef[]): Track {\n    const push = (table: string, recordId: number | string) => {\n      refs.push({ seeder: seeder.name, table, recordId, runAt: this.now() });\n    };\n\n    function track<T extends TrackableModel>(model: T): T;\n    function track<T extends TrackableModel>(models: T[]): T[];\n    function track(table: string, id: number | string): string;\n    function track(\n      arg: TrackableModel | TrackableModel[] | string,\n      id?: number | string,\n    ): TrackableModel | TrackableModel[] | string {\n      if (typeof arg === \"string\") {\n        push(arg, id as number | string);\n\n        return arg;\n      }\n\n      if (Array.isArray(arg)) {\n        for (const model of arg) {\n          push(model.getTableName(), model.id);\n        }\n\n        return arg;\n      }\n\n      push(arg.getTableName(), arg.id);\n\n      return arg;\n    }\n\n    return track;\n  }\n\n  /**\n   * Sort seeds\n   */\n  public sort() {\n    this.seeders = this.seeders.sort((a, b) => {\n      const orderA = a.order ?? Number.MAX_SAFE_INTEGER;\n      const orderB = b.order ?? Number.MAX_SAFE_INTEGER;\n      return orderA - orderB;\n    });\n\n    return this;\n  }\n\n  /**\n   * Prepare seeders to order by the seeder order, then resolve `dependsOn`.\n   *\n   * Dependencies are honored via a topological sort layered over the existing\n   * numeric `order` tie-break: among seeders whose dependencies are already\n   * satisfied, the lowest `order` (then registration order) runs first. Throws\n   * {@link UnknownSeederDependencyError} for a missing dependency and\n   * {@link SeederDependencyCycleError} for a cycle.\n   */\n  public prepareSeeders() {\n    this.seeders = this.seeders.filter((seeder) => seeder.enabled !== false);\n\n    this.sort();\n\n    this.seeders = this.resolveDependencies(this.seeders);\n\n    return this;\n  }\n\n  /**\n   * Topologically sort `seeders` by their `dependsOn` names. The input is\n   * assumed pre-sorted by `order` (see {@link sort}); that ordering is used as\n   * the tie-break so dependency-free siblings keep their `order` sequence.\n   */\n  protected resolveDependencies(seeders: Seeder[]): Seeder[] {\n    const byName = new Map<string, Seeder>();\n\n    for (const seeder of seeders) {\n      byName.set(seeder.name, seeder);\n    }\n\n    // Validate dependencies up-front so an unknown name is a clear error rather\n    // than a silently dropped edge.\n    for (const seeder of seeders) {\n      for (const dependency of seeder.dependsOn ?? []) {\n        if (!byName.has(dependency)) {\n          throw new UnknownSeederDependencyError(seeder.name, dependency);\n        }\n      }\n    }\n\n    const sorted: Seeder[] = [];\n    const state = new Map<string, \"visiting\" | \"visited\">();\n\n    const visit = (seeder: Seeder, path: string[]) => {\n      const status = state.get(seeder.name);\n\n      if (status === \"visited\") {\n        return;\n      }\n\n      if (status === \"visiting\") {\n        const cycleStart = path.indexOf(seeder.name);\n        const cycle = path.slice(cycleStart >= 0 ? cycleStart : 0).concat(seeder.name);\n\n        throw new SeederDependencyCycleError(cycle);\n      }\n\n      state.set(seeder.name, \"visiting\");\n\n      for (const dependency of seeder.dependsOn ?? []) {\n        // Presence already validated above; the `!` is safe.\n        visit(byName.get(dependency)!, [...path, seeder.name]);\n      }\n\n      state.set(seeder.name, \"visited\");\n      sorted.push(seeder);\n    };\n\n    // Iterate in the incoming (order-sorted, registration-stable) sequence so\n    // dependency-free seeders preserve their `order` tie-break.\n    for (const seeder of seeders) {\n      visit(seeder, []);\n    }\n\n    return sorted;\n  }\n\n  /**\n   * Store seed results in db\n   */\n  public async storeSeedsResults(seeder: Seeder, result: SeedResult) {\n    const oldResult = await this.getMetadata(seeder);\n\n    // log with an emoji icon at beginning of text no of total craeted records\n    console.log(`📊 Total records created: ${result.recordsCreated}`);\n\n    // Read the single overridable clock once so every timestamp in this write\n    // is identical (and pinned in a deterministic / historical run).\n    const now = this.now();\n\n    if (oldResult) {\n      // Update existing record - use query builder with WHERE clause\n      await this.driver\n        .queryBuilder(seedsTableName)\n        .where(\"name\", seeder.name)\n        .update({\n          runCount: oldResult.runCount + 1,\n          lastRunAt: now,\n          totalRecordsCreated: oldResult.totalRecordsCreated + result.recordsCreated,\n          lastRunRecordsCreated: result.recordsCreated,\n        });\n\n      // now display total created records so far\n      console.log(\n        `📊 Total records created so far: ${oldResult.totalRecordsCreated + result.recordsCreated}`,\n      );\n    } else {\n      // Insert new record\n      await this.driver.insert(seedsTableName, {\n        name: seeder.name,\n        createdAt: now,\n        firstRunAt: now,\n        lastRunAt: now,\n        runCount: 1,\n        totalRecordsCreated: result.recordsCreated,\n        lastRunRecordsCreated: result.recordsCreated,\n      });\n    }\n  }\n\n  /**\n   * Get seed info from database\n   */\n  // Returns null when the seeder has never run. first() has always resolved to\n  // SeederMetadata | null; annotating it as non-null pushed that lie to every\n  // caller, each of which already branches on the absent case.\n  protected getMetadata(seeder: Seeder): Promise<SeederMetadata | null> {\n    const driver = this.datasource.driver;\n\n    return driver.queryBuilder(seedsTableName).where(\"name\", seeder.name).first();\n  }\n\n  /**\n   * Get driver instance\n   */\n  protected get driver(): DriverContract {\n    return this.datasource.driver;\n  }\n\n  /**\n   * Check if seeder has been executed before\n   */\n  protected async seederIsExecutedBefore(seeder: Seeder) {\n    return !!(await this.getMetadata(seeder));\n  }\n}\n"],"mappings":";;;;;;;;AAmCA,IAAa,iBAAb,MAA4B;CAgB1B,AAAO,YAAY,AAAU,SAAiC;EAAjC;iBAfF,CAAC;EAgB1B,KAAK,aAAa,SAAS,cAAc,mBAAmB,IAAI;EAChE,KAAK,MAAM,SAAS,gCAAgB,IAAI,KAAK;CAC/C;;;;CAKA,AAAO,SAAS,GAAG,SAAmB;EACpC,KAAK,QAAQ,KAAK,GAAG,OAAO;EAC5B,OAAO;CACT;;;;CAKA,MAAgB,OAAO;EACrB,IAAI,CAAE,MAAM,KAAK,OAAO,UAAU,oBAA0B,GAC1D,MAAM,gBAAgB,IAAI,mBAAmB;EAG/C,IAAI,CAAE,MAAM,KAAK,OAAO,UAAU,2BAAgC,GAChE,MAAM,gBAAgB,IAAI,yBAAyB;CAEvD;;;;CAKA,MAAa,IAAI,kBAAkB,MAAM;EACvC,MAAM,KAAK,KAAK;EAEhB,KAAK,eAAe;EAEpB,QAAQ,IAAI,cAAc,KAAK,QAAQ,OAAO,gBAAgB;EAE9D,IAAI,eAAe;EACnB,IAAI,eAAe;EACnB,IAAI,cAAc;EAElB,KAAK,MAAM,UAAU,KAAK,SAAS;GAEjC,IAAI,OAAO,QAAS,MAAM,KAAK,uBAAuB,MAAM,GAAI;IAC9D,QAAQ,IAAI,gBAAgB,OAAO,OAAO,OAAO,IAAI,EAAE,oBAAoB;IAC3E;IACA;GACF;GAEA,IAAI;IACF,QAAQ,IAAI,cAAc,OAAO,MAAM,OAAO,IAAI,EAAE,IAAI;IACxD,MAAM,YAAY,KAAK,IAAI;IAE3B,MAAM,OAAwB,CAAC;IAC/B,MAAM,QAAQ,KAAK,cAAc,QAAQ,IAAI;IAE7C,MAAM,YAAY,YAAY;KAG5B,MAAM,KAAK,OAAO,WAAW,sBAAsB,EAAE,QAAQ,OAAO,KAAK,CAAC;KAE1E,MAAM,SAAS,MAAM,OAAO,IAAI;MAC9B;MACA,KAAK,KAAK;MACV,WAAW,OAAO,aAAa;KACjC,CAAC;KAED,IAAI,KAAK,SAAS,GAChB,MAAM,KAAK,OAAO,WAChB,sBACA,KAAK,KAAK,SAAS,EAAE,GAAG,IAAI,EAAE,CAChC;KAGF,OAAO;IACT;IAEA,MAAM,SAAS,kBAAkB,MAAM,YAAY,SAAS,IAAI,MAAM,UAAU;IAEhF,MAAM,WAAW,KAAK,IAAI,IAAI;IAI9B,MAAM,iBAAiB,KAAK,SAAS,IAAI,KAAK,SAAU,QAAQ,kBAAkB;IAElF,MAAM,KAAK,kBAAkB,QAAQ,EAAE,eAAe,CAAC;IAEvD,QAAQ,IACN,KAAK,OAAO,MAAM,OAAO,IAAI,EAAE,cAAc,SAAS,MAAM,eAAe,YAC7E;IACA;GACF,SAAS,OAAY;IACnB,MAAM,MAAM;IACZ,QAAQ,MAAM,KAAK,OAAO,IAAI,OAAO,IAAI,EAAE,WAAW,IAAI,OAAO;IACjE,QAAQ,IAAI,GAAG;IACf;IAEA,IAAI,iBAAiB,+BACnB,QAAQ,IAAI,MAAM,MAAM;IAI1B,MAAM;GACR;EACF;EAGA,QAAQ,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;EACjC,QAAQ,IAAI,cAAc,cAAc;EAExC,IAAI,eAAe,GAAG,QAAQ,IAAI,gBAAgB,cAAc;EAEhE,IAAI,cAAc,GAAG,QAAQ,IAAI,aAAa,aAAa;EAE3D,QAAQ,IAAI,IAAI,OAAO,EAAE,CAAC;CAC5B;;;;;;;CAQA,AAAU,cAAc,QAAgB,MAA8B;EACpE,MAAM,QAAQ,OAAe,aAA8B;GACzD,KAAK,KAAK;IAAE,QAAQ,OAAO;IAAM;IAAO;IAAU,OAAO,KAAK,IAAI;GAAE,CAAC;EACvE;EAKA,SAAS,MACP,KACA,IAC4C;GAC5C,IAAI,OAAO,QAAQ,UAAU;IAC3B,KAAK,KAAK,EAAqB;IAE/B,OAAO;GACT;GAEA,IAAI,MAAM,QAAQ,GAAG,GAAG;IACtB,KAAK,MAAM,SAAS,KAClB,KAAK,MAAM,aAAa,GAAG,MAAM,EAAE;IAGrC,OAAO;GACT;GAEA,KAAK,IAAI,aAAa,GAAG,IAAI,EAAE;GAE/B,OAAO;EACT;EAEA,OAAO;CACT;;;;CAKA,AAAO,OAAO;EACZ,KAAK,UAAU,KAAK,QAAQ,MAAM,GAAG,MAAM;GAGzC,QAFe,EAAE,SAAS,OAAO,qBAClB,EAAE,SAAS,OAAO;EAEnC,CAAC;EAED,OAAO;CACT;;;;;;;;;;CAWA,AAAO,iBAAiB;EACtB,KAAK,UAAU,KAAK,QAAQ,QAAQ,WAAW,OAAO,YAAY,KAAK;EAEvE,KAAK,KAAK;EAEV,KAAK,UAAU,KAAK,oBAAoB,KAAK,OAAO;EAEpD,OAAO;CACT;;;;;;CAOA,AAAU,oBAAoB,SAA6B;EACzD,MAAM,yBAAS,IAAI,IAAoB;EAEvC,KAAK,MAAM,UAAU,SACnB,OAAO,IAAI,OAAO,MAAM,MAAM;EAKhC,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,cAAc,OAAO,aAAa,CAAC,GAC5C,IAAI,CAAC,OAAO,IAAI,UAAU,GACxB,MAAM,IAAI,6BAA6B,OAAO,MAAM,UAAU;EAKpE,MAAM,SAAmB,CAAC;EAC1B,MAAM,wBAAQ,IAAI,IAAoC;EAEtD,MAAM,SAAS,QAAgB,SAAmB;GAChD,MAAM,SAAS,MAAM,IAAI,OAAO,IAAI;GAEpC,IAAI,WAAW,WACb;GAGF,IAAI,WAAW,YAAY;IACzB,MAAM,aAAa,KAAK,QAAQ,OAAO,IAAI;IAC3C,MAAM,QAAQ,KAAK,MAAM,cAAc,IAAI,aAAa,CAAC,CAAC,CAAC,OAAO,OAAO,IAAI;IAE7E,MAAM,IAAI,2BAA2B,KAAK;GAC5C;GAEA,MAAM,IAAI,OAAO,MAAM,UAAU;GAEjC,KAAK,MAAM,cAAc,OAAO,aAAa,CAAC,GAE5C,MAAM,OAAO,IAAI,UAAU,GAAI,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC;GAGvD,MAAM,IAAI,OAAO,MAAM,SAAS;GAChC,OAAO,KAAK,MAAM;EACpB;EAIA,KAAK,MAAM,UAAU,SACnB,MAAM,QAAQ,CAAC,CAAC;EAGlB,OAAO;CACT;;;;CAKA,MAAa,kBAAkB,QAAgB,QAAoB;EACjE,MAAM,YAAY,MAAM,KAAK,YAAY,MAAM;EAG/C,QAAQ,IAAI,6BAA6B,OAAO,gBAAgB;EAIhE,MAAM,MAAM,KAAK,IAAI;EAErB,IAAI,WAAW;GAEb,MAAM,KAAK,OACR,aAAa,cAAc,CAAC,CAC5B,MAAM,QAAQ,OAAO,IAAI,CAAC,CAC1B,OAAO;IACN,UAAU,UAAU,WAAW;IAC/B,WAAW;IACX,qBAAqB,UAAU,sBAAsB,OAAO;IAC5D,uBAAuB,OAAO;GAChC,CAAC;GAGH,QAAQ,IACN,oCAAoC,UAAU,sBAAsB,OAAO,gBAC7E;EACF,OAEE,MAAM,KAAK,OAAO,OAAO,gBAAgB;GACvC,MAAM,OAAO;GACb,WAAW;GACX,YAAY;GACZ,WAAW;GACX,UAAU;GACV,qBAAqB,OAAO;GAC5B,uBAAuB,OAAO;EAChC,CAAC;CAEL;;;;CAQA,AAAU,YAAY,QAAgD;EAGpE,OAFe,KAAK,WAAW,OAEjB,aAAa,cAAc,CAAC,CAAC,MAAM,QAAQ,OAAO,IAAI,CAAC,CAAC,MAAM;CAC9E;;;;CAKA,IAAc,SAAyB;EACrC,OAAO,KAAK,WAAW;CACzB;;;;CAKA,MAAgB,uBAAuB,QAAgB;EACrD,OAAO,CAAC,CAAE,MAAM,KAAK,YAAY,MAAM;CACzC;AACF"}

package/esm/database/seeds/types.d.mts

@@ -1,8 +1,8 @@
 //#region ../../packages/core/src/database/seeds/types.d.ts
-type SeedResult = {
+export type SeedResult = {
   recordsCreated: number;
 };
-type SeederMetadata = {
+export type SeederMetadata = {
   name: string;
   createdAt: number;
   firstRunAt: number;
@@ -18,7 +18,7 @@ type SeederMetadata = {
  * this structural type keeps `track` decoupled from the concrete `Model`
  * class so seeds can also hand in lightweight test doubles.
  */
-type TrackableModel = {
+export type TrackableModel = {
   /**
    * Owning table / collection name.
    */
@@ -31,7 +31,7 @@ type TrackableModel = {
 /**
  * A single tracked record reference, persisted to the `seed_records` table.
  */
-type SeedRecordRef = {
+export type SeedRecordRef = {
   /**
    * Owning seeder name.
    */
@@ -60,7 +60,7 @@ type SeedRecordRef = {
  * const user = track(await User.create({ ... }));
  * ```
  */
-type Track = {
+export type Track = {
   /**
    * Track a single model. Reads `model.getTableName()` + `model.id`.
    *
@@ -89,11 +89,11 @@ type Track = {
  * manager's own metadata timestamps deterministic — both read from this single
  * clock, so a test or a back-fill can pin every timestamp to one value.
  */
-type SeedClock = () => Date;
+export type SeedClock = () => Date;
 /**
  * Context passed to a seeder's `run()`.
  */
-type SeedContext = {
+export type SeedContext = {
   /**
    * Tracker used to register created records for later undo via
    * `warlock seed --drop`.
@@ -128,5 +128,4 @@ type SeedContext = {
   batchSize: number;
 };
 //#endregion
-export { SeedClock, SeedContext, SeedRecordRef, SeedResult, SeederMetadata, Track, TrackableModel };
 //# sourceMappingURL=types.d.mts.map

package/esm/database/seeds/types.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.mts","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/types.ts"],"mappings":";KAAY,UAAA;EACV,cAAc;AAAA;AAAA,KAGJ,cAAA;EACV,IAAA;EACA,SAAA;EACA,UAAA;EACA,SAAA;EACA,QAAA;EACA,mBAAA;EACA,qBAAA;AAAA;;;;;;;AAAqB;KAUX,cAAA;EAAc;;;EAIxB,YAAA;EAUU;;;EANV,EAAE;AAAA;;;;KAMQ,aAAA;EAgBC;AAAA;AAcb;EA1BE,MAAA;EA0Be;;;EAtBf,KAAA;EAkCW;;;EA9BX,QAAA;EA8B0C;;;EA1B1C,KAAA,EAAO,IAAI;AAAA;;;;;;;;;;AAgCwB;AAYrC;KA9BY,KAAA;;;AA8BsB;AAKlC;;aA7Ba,cAAA,EAAgB,KAAA,EAAO,CAAA,GAAI,CAAA;EAgDxB;;;;;EAAA,WA1CH,cAAA,EAAgB,MAAA,EAAQ,CAAA,KAAM,CAAA;EAuDhC;AAAA;;;;EAAA,CAjDR,KAAA,UAAe,EAAA;AAAA;;;;;;;;;;KAYN,SAAA,SAAkB,IAAI;;;;KAKtB,WAAA;;;;;EAKV,KAAA,EAAO,KAAA;;;;;;;;;;;;;;EAcP,GAAA,EAAK,SAAS;;;;;;;;;;;;;EAad,SAAA;AAAA"}
+{"version":3,"file":"types.d.mts","names":[],"sources":["../../../../../../../../../packages/core/src/database/seeds/types.ts"],"mappings":";YAAY;EACV;;YAGU;EACV;EACA;EACA;EACA;EACA;EACA;EACA;;;;;;;;;YAUU;;;;EAIV;;;;EAIA;;;;;YAMU;;;;EAIV;;;;EAIA;;;;EAIA;;;;EAIA,OAAO;;;;;;;;;;;;;YAcG;;;;;;GAMT,UAAU,gBAAgB,OAAO,IAAI;;;;;;GAMrC,UAAU,gBAAgB,QAAQ,MAAM;;;;;;GAMxC,eAAe;;;;;;;;;;;YAYN,kBAAkB;;;;YAKlB;;;;;EAKV,OAAO;;;;;;;;;;;;;;EAcP,KAAK;;;;;;;;;;;;;EAaL"}

package/esm/database/utils.d.mts

@@ -1,6 +1,5 @@
 import { ComputedCallback, SchemaContext } from "@warlock.js/seal";
 import { Model } from "@warlock.js/cascade";
-
 //#region ../../packages/core/src/database/utils.d.ts
 /**
  * Hash password on saving if password changes.
@@ -9,16 +8,16 @@ import { Model } from "@warlock.js/cascade";
  * `encryption.password.salt`). Core must never import `@warlock.js/auth`:
  * auth depends on core, and its `authService.hashPassword` only delegates here.
  */
-declare const useHashedPassword: () => import("@warlock.js/seal").TransformerCallback;
+export declare const useHashedPassword: () => import("@warlock.js/seal").TransformerCallback;
 type ComputedCallbackModel = (data: any, model: Model, context: SchemaContext) => any | Promise<any>;
 /**
  * Generate computed value based on other fields
  */
-declare function useComputedModel(callback: ComputedCallbackModel): ComputedCallback;
+export declare function useComputedModel(callback: ComputedCallbackModel): ComputedCallback;
 /**
  * Generate slug based on a field on saving
  */
-declare function useComputedSlug(field?: string, scope?: "global" | "sibling"): ComputedCallback;
+export declare function useComputedSlug(field?: string, scope?: "global" | "sibling"): ComputedCallback;
 //#endregion
-export { useComputedModel, useComputedSlug, useHashedPassword };
+export {};
 //# sourceMappingURL=utils.d.mts.map

package/esm/database/utils.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"utils.d.mts","names":[],"sources":["../../../../../../../../packages/core/src/database/utils.ts"],"mappings":";;;;;;AAaA;;;;AAOI;cAPS,iBAAA,mCAAiB,mBAO1B;AAAA,KAEC,qBAAA,IACH,IAAA,OACA,KAAA,EAAO,KAAA,EACP,OAAA,EAAS,aAAA,WACA,OAAA;;;;iBAKK,gBAAA,CAAiB,QAAA,EAAU,qBAAA,GAAqB,gBAAA;;;;iBAWhD,eAAA,CAAgB,KAAA,WAAiB,KAAA,0BAAuC,gBAAA"}
+{"version":3,"file":"utils.d.mts","names":[],"sources":["../../../../../../../../packages/core/src/database/utils.ts"],"mappings":";;;;;;;;;;qBAaa,oDAAiB;KASzB,yBACH,WACA,OAAO,OACP,SAAS,wBACA;;;;wBAKK,iBAAiB,UAAU,wBAAqB;;;;wBAWhD,gBAAgB,gBAAiB,+BAAuC"}

package/esm/dev-server/app-module-registry.mjs

@@ -48,5 +48,5 @@ function getDevelopmentAppModuleRegistry() {
 }
 
 //#endregion
-export { getDevelopmentAppModuleRegistry };
+export { DevelopmentAppModuleRegistry, getDevelopmentAppModuleRegistry };
 //# sourceMappingURL=app-module-registry.mjs.map

package/esm/dev-server/create-worker.mjs

@@ -10,7 +10,7 @@ import { Worker } from "worker_threads";
 *
 * The worker shares the CALLING module's extension: `.ts` when core runs from
 * source (loaded via tsx), `.mjs` when core is published. Source workers are
-* loaded through tsx's `tsImport` API from a JavaScript bootstrap; published
+* loaded after registering tsx in a JavaScript bootstrap; published
 * `.mjs` workers run as-is.
 *
 * @param workerPath - Relative path to worker file WITHOUT extension (e.g., "./workers/ts-health.worker")
@@ -35,8 +35,10 @@ function createWorker(workerPath, baseUrl, options) {
 	const workerFilePath = fileURLToPath$1(workerUrl);
 	const workerOptions = { ...options };
 	if (isSource) {
-		const tsxApi = pathToFileURL(createRequire(import.meta.url).resolve("tsx/esm/api")).href;
-		return new Worker(`import(${JSON.stringify(tsxApi)}).then(({ tsImport }) => tsImport(${JSON.stringify(workerUrl.href)}, ${JSON.stringify(baseUrl)}));`, {
+		const require = createRequire(import.meta.url);
+		const tsxApi = pathToFileURL(require.resolve("tsx/esm/api")).href;
+		const bootstrap = `import(${JSON.stringify(tsxApi)}).then(({ register }) => { register(); return import(${JSON.stringify(workerUrl.href)}); });`;
+		return new Worker(bootstrap, {
 			...workerOptions,
 			eval: true
 		});

package/esm/dev-server/create-worker.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"create-worker.mjs","names":["fileURLToPath"],"sources":["../../../../../../../../packages/core/src/dev-server/create-worker.ts"],"sourcesContent":["import path from \"node:path\";\nimport { createRequire } from \"node:module\";\nimport { pathToFileURL } from \"node:url\";\nimport { fileURLToPath } from \"url\";\nimport { Worker, type WorkerOptions } from \"worker_threads\";\n\n/**\n * Options for creating a health check worker\n */\nexport type CreateWorkerOptions = WorkerOptions & {\n  /**\n   * Worker data to pass to the worker thread\n   */\n  workerData?: Record<string, unknown>;\n};\n\n/**\n * Create a worker that works in both dev (TypeScript) and production (JavaScript) environments.\n *\n * The worker shares the CALLING module's extension: `.ts` when core runs from\n * source (loaded via tsx), `.mjs` when core is published. Source workers are\n * loaded through tsx's `tsImport` API from a JavaScript bootstrap; published\n * `.mjs` workers run as-is.\n *\n * @param workerPath - Relative path to worker file WITHOUT extension (e.g., \"./workers/ts-health.worker\")\n * @param baseUrl - The import.meta.url of the calling module (used to resolve relative paths)\n * @param options - Additional worker options\n * @returns A new Worker instance\n *\n * @example\n * ```typescript\n * // In FilesHealthcareManager\n * const worker = createWorker(\n *   \"./workers/ts-health.worker\",\n *   import.meta.url,\n *   { workerData: { cwd: process.cwd() } }\n * );\n * ```\n */\nexport function createWorker(\n  workerPath: string,\n  baseUrl: string,\n  options?: CreateWorkerOptions,\n): Worker {\n  // The worker shares the CALLING module's extension: `.ts` from source (needs the\n  // tsx loader to execute), `.mjs` when core is published.\n  const callerExtension = path.extname(fileURLToPath(baseUrl));\n  const isSource = callerExtension === \".ts\" || callerExtension === \".tsx\";\n  const workerUrl = new URL(`${workerPath}${callerExtension}`, baseUrl);\n  const workerFilePath = fileURLToPath(workerUrl);\n\n  const workerOptions: WorkerOptions = {\n    ...options,\n  };\n\n  if (isSource) {\n    // Node 22.15 resolves a worker's entry before tsx's --import hook can\n    // handle its .ts extension. Bootstrap JS, then load the entry through\n    // tsx's supported API instead. Resolve from core, even when the app does\n    // not depend on tsx directly.\n    const require = createRequire(import.meta.url);\n    const tsxApi = pathToFileURL(require.resolve(\"tsx/esm/api\")).href;\n    const bootstrap = `import(${JSON.stringify(tsxApi)}).then(({ tsImport }) => tsImport(${JSON.stringify(workerUrl.href)}, ${JSON.stringify(baseUrl)}));`;\n    return new Worker(bootstrap, { ...workerOptions, eval: true });\n  }\n\n  return new Worker(workerFilePath, workerOptions);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgB,aACd,YACA,SACA,SACQ;CAGR,MAAM,kBAAkB,KAAK,QAAQA,gBAAc,OAAO,CAAC;CAC3D,MAAM,WAAW,oBAAoB,SAAS,oBAAoB;CAClE,MAAM,YAAY,IAAI,IAAI,GAAG,aAAa,mBAAmB,OAAO;CACpE,MAAM,iBAAiBA,gBAAc,SAAS;CAE9C,MAAM,gBAA+B,EACnC,GAAG,QACL;CAEA,IAAI,UAAU;EAMZ,MAAM,SAAS,cADC,cAAc,OAAO,KAAK,GACP,CAAC,CAAC,QAAQ,aAAa,CAAC,CAAC,CAAC;EAE7D,OAAO,IAAI,OAAO,UADU,KAAK,UAAU,MAAM,EAAE,oCAAoC,KAAK,UAAU,UAAU,IAAI,EAAE,IAAI,KAAK,UAAU,OAAO,EAAE,MACrH;GAAE,GAAG;GAAe,MAAM;EAAK,CAAC;CAC/D;CAEA,OAAO,IAAI,OAAO,gBAAgB,aAAa;AACjD"}
+{"version":3,"file":"create-worker.mjs","names":["fileURLToPath"],"sources":["../../../../../../../../packages/core/src/dev-server/create-worker.ts"],"sourcesContent":["import path from \"node:path\";\nimport { createRequire } from \"node:module\";\nimport { pathToFileURL } from \"node:url\";\nimport { fileURLToPath } from \"url\";\nimport { Worker, type WorkerOptions } from \"worker_threads\";\n\n/**\n * Options for creating a health check worker\n */\nexport type CreateWorkerOptions = WorkerOptions & {\n  /**\n   * Worker data to pass to the worker thread\n   */\n  workerData?: Record<string, unknown>;\n};\n\n/**\n * Create a worker that works in both dev (TypeScript) and production (JavaScript) environments.\n *\n * The worker shares the CALLING module's extension: `.ts` when core runs from\n * source (loaded via tsx), `.mjs` when core is published. Source workers are\n * loaded after registering tsx in a JavaScript bootstrap; published\n * `.mjs` workers run as-is.\n *\n * @param workerPath - Relative path to worker file WITHOUT extension (e.g., \"./workers/ts-health.worker\")\n * @param baseUrl - The import.meta.url of the calling module (used to resolve relative paths)\n * @param options - Additional worker options\n * @returns A new Worker instance\n *\n * @example\n * ```typescript\n * // In FilesHealthcareManager\n * const worker = createWorker(\n *   \"./workers/ts-health.worker\",\n *   import.meta.url,\n *   { workerData: { cwd: process.cwd() } }\n * );\n * ```\n */\nexport function createWorker(\n  workerPath: string,\n  baseUrl: string,\n  options?: CreateWorkerOptions,\n): Worker {\n  // The worker shares the CALLING module's extension: `.ts` from source (needs the\n  // tsx loader to execute), `.mjs` when core is published.\n  const callerExtension = path.extname(fileURLToPath(baseUrl));\n  const isSource = callerExtension === \".ts\" || callerExtension === \".tsx\";\n  const workerUrl = new URL(`${workerPath}${callerExtension}`, baseUrl);\n  const workerFilePath = fileURLToPath(workerUrl);\n\n  const workerOptions: WorkerOptions = {\n    ...options,\n  };\n\n  if (isSource) {\n    // Node 22.15 resolves a worker's entry before tsx's --import hook can\n    // handle its .ts extension. Bootstrap JS, then load the entry through\n    // tsx's supported API instead. Resolve from core, even when the app does\n    // not depend on tsx directly.\n    // Register for the worker's lifetime without a namespace: Node 24's sync\n    // resolve hook returns no format for unprefixed require(\"fs\"), so tsImport's\n    // namespace gets appended to node:fs and Node tries to open it as a file.\n    // Each worker already has its own module environment.\n    const require = createRequire(import.meta.url);\n    const tsxApi = pathToFileURL(require.resolve(\"tsx/esm/api\")).href;\n    const bootstrap = `import(${JSON.stringify(tsxApi)}).then(({ register }) => { register(); return import(${JSON.stringify(workerUrl.href)}); });`;\n    return new Worker(bootstrap, { ...workerOptions, eval: true });\n  }\n\n  return new Worker(workerFilePath, workerOptions);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgB,aACd,YACA,SACA,SACQ;CAGR,MAAM,kBAAkB,KAAK,QAAQA,gBAAc,OAAO,CAAC;CAC3D,MAAM,WAAW,oBAAoB,SAAS,oBAAoB;CAClE,MAAM,YAAY,IAAI,IAAI,GAAG,aAAa,mBAAmB,OAAO;CACpE,MAAM,iBAAiBA,gBAAc,SAAS;CAE9C,MAAM,gBAA+B,EACnC,GAAG,QACL;CAEA,IAAI,UAAU;EASZ,MAAM,UAAU,cAAc,YAAY,GAAG;EAC7C,MAAM,SAAS,cAAc,QAAQ,QAAQ,aAAa,CAAC,CAAC,CAAC;EAC7D,MAAM,YAAY,UAAU,KAAK,UAAU,MAAM,EAAE,uDAAuD,KAAK,UAAU,UAAU,IAAI,EAAE;EACzI,OAAO,IAAI,OAAO,WAAW;GAAE,GAAG;GAAe,MAAM;EAAK,CAAC;CAC/D;CAEA,OAAO,IAAI,OAAO,gBAAgB,aAAa;AACjD"}

package/esm/dev-server/dependency-graph.d.mts

@@ -1,5 +1,4 @@
 import { FileManager } from "./file-manager.mjs";
-
 //#region ../../packages/core/src/dev-server/dependency-graph.d.ts
 /**
  * Dependency Graph
@@ -11,7 +10,7 @@ import { FileManager } from "./file-manager.mjs";
  * can distinguish runtime cycles from ones formed purely by `import type`
  * edges — the latter are erased by TypeScript and have no runtime effect.
  */
-declare class DependencyGraph {
+export declare class DependencyGraph {
   /**
    * Map of file -> files it depends on (imports).
    * Key: relative file path.
@@ -130,5 +129,4 @@ declare class DependencyGraph {
   };
 }
 //#endregion
-export { DependencyGraph };
 //# sourceMappingURL=dependency-graph.d.mts.map

package/esm/dev-server/dependency-graph.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"dependency-graph.d.mts","names":[],"sources":["../../../../../../../../packages/core/src/dev-server/dependency-graph.ts"],"mappings":";;;;;AAYA;;;;;;;;cAAa,eAAA;EA0L4B;;;;;EAAA,QApL/B,YAAA;EAkBY;;;;;EAAA,QAXZ,UAAA;EAiD+C;;;;EAAA,QA3C/C,KAAA;EA8EU;;;EAzEX,KAAA,CAAM,KAAA,EAAO,GAAA,SAAY,WAAA;EA2G9B;;;;;;;;;EArEK,aAAA,CAAc,IAAA,UAAc,UAAA,UAAoB,UAAA;EA4HlC;;;;;EAlGd,gBAAA,CAAiB,IAAA,UAAc,UAAA;EA+M9B;;;;EAtMD,UAAA,CAAW,IAAA;;;;;;;;;;;;EAgCX,UAAA,CACL,IAAA,UACA,eAAA,EAAiB,GAAA,UACjB,oBAAA,GAAsB,GAAA;;;;;;EA+BjB,eAAA,CAAgB,IAAA,WAAe,GAAA;;;;;EAc/B,cAAA,CAAe,IAAA,UAAc,UAAA;;;;;;EAS7B,aAAA,CAAc,IAAA,WAAe,GAAA;;;;;;;;EAW7B,oBAAA,CAAqB,IAAA;;;;;;;;;;;;;EA+BrB,0BAAA;;;;;;;UA2CC,cAAA;;;;;UAwBA,iCAAA;;;;EAwGD,QAAA"}
+{"version":3,"file":"dependency-graph.d.mts","names":[],"sources":["../../../../../../../../packages/core/src/dev-server/dependency-graph.ts"],"mappings":";;;;;;;;;;;;qBAYa;;;;;;UAMH;;;;;;UAOA;;;;;UAMA;;;;EAKD,MAAM,OAAO,YAAY;;;;;;;;;;EAsCzB,cAAc,cAAc,oBAAoB;;;;;;EA0BhD,iBAAiB,cAAc;;;;;EAS/B,WAAW;;;;;;;;;;;;EAgCX,WACL,cACA,iBAAiB,aACjB,uBAAsB;;;;;;EA+BjB,gBAAgB,eAAe;;;;;EAc/B,eAAe,cAAc;;;;;;EAS7B,cAAc,eAAe;;;;;;;;EAW7B,qBAAqB;;;;;;;;;;;;;EA+BrB;;;;;;;UA2CC;;;;;UAwBA;;;;EAwGD"}

package/esm/dev-server/dependency-graph.mjs

@@ -130,7 +130,7 @@ var DependencyGraph = class {
 	*/
 	getInvalidationChain(file) {
 		const chain = [file];
-		const visited = new Set([file]);
+		const visited = /* @__PURE__ */ new Set([file]);
 		const traverse = (current) => {
 			const deps = this.getDependents(current);
 			for (const dep of deps) if (!visited.has(dep)) {

package/esm/dev-server/dependency-graph.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"dependency-graph.mjs","names":[],"sources":["../../../../../../../../packages/core/src/dev-server/dependency-graph.ts"],"sourcesContent":["import type { FileManager } from \"./file-manager\";\n\n/**\n * Dependency Graph\n * Tracks bidirectional relationships between files:\n * - dependencies: files that this file imports\n * - dependents: files that import this file\n *\n * Each forward edge also carries an `isTypeOnly` flag so cycle detection\n * can distinguish runtime cycles from ones formed purely by `import type`\n * edges — the latter are erased by TypeScript and have no runtime effect.\n */\nexport class DependencyGraph {\n  /**\n   * Map of file -> files it depends on (imports).\n   * Key: relative file path.\n   * Value: relative dependency path → `{ isTypeOnly }` for that edge.\n   */\n  private dependencies = new Map<string, Map<string, { isTypeOnly: boolean }>>();\n\n  /**\n   * Map of file -> files that depend on it (importers)\n   * Key: relative file path\n   * Value: Set of relative file paths that import this file\n   */\n  private dependents = new Map<string, Set<string>>();\n\n  /**\n   * Reference to the files map for accessing FileManager instances\n   * Used to read per-file typeOnlyDependencies during graph build.\n   */\n  private files: Map<string, FileManager> | null = null;\n\n  /**\n   * Build dependency graph from FileManager map\n   */\n  public build(files: Map<string, FileManager>) {\n    this.files = files;\n\n    this.dependencies.clear();\n    this.dependents.clear();\n\n    for (const [relativePath, fileManager] of files) {\n      if (!this.dependencies.has(relativePath)) {\n        this.dependencies.set(relativePath, new Map());\n      }\n\n      if (!this.dependents.has(relativePath)) {\n        this.dependents.set(relativePath, new Set());\n      }\n\n      for (const dependency of fileManager.dependencies) {\n        const isTypeOnly = fileManager.typeOnlyDependencies.has(dependency);\n\n        this.addDependency(relativePath, dependency, isTypeOnly);\n      }\n    }\n\n    const cycles = this.detectCircularDependencies();\n\n    if (cycles.length > 0) {\n      this.displayCircularDependencyWarnings(cycles);\n    }\n  }\n\n  /**\n   * Add a dependency relationship.\n   * If the edge already exists, the type-only flag is ANDed: any runtime\n   * statement between the two files makes the edge runtime permanently.\n   *\n   * @param file The file that has the dependency\n   * @param dependency The file being depended upon\n   * @param isTypeOnly Whether every reference from `file` to `dependency` is type-only\n   */\n  public addDependency(file: string, dependency: string, isTypeOnly: boolean = false) {\n    if (!this.dependencies.has(file)) {\n      this.dependencies.set(file, new Map());\n    }\n\n    if (!this.dependents.has(dependency)) {\n      this.dependents.set(dependency, new Set());\n    }\n\n    const edges = this.dependencies.get(file)!;\n    const existing = edges.get(dependency);\n\n    if (existing) {\n      existing.isTypeOnly = existing.isTypeOnly && isTypeOnly;\n    } else {\n      edges.set(dependency, { isTypeOnly });\n    }\n\n    this.dependents.get(dependency)!.add(file);\n  }\n\n  /**\n   * Remove a dependency relationship\n   * @param file The file that has the dependency\n   * @param dependency The file being depended upon\n   */\n  public removeDependency(file: string, dependency: string) {\n    this.dependencies.get(file)?.delete(dependency);\n    this.dependents.get(dependency)?.delete(file);\n  }\n\n  /**\n   * Remove all relationships for a file\n   * @param file The file to remove\n   */\n  public removeFile(file: string) {\n    const deps = this.dependencies.get(file);\n\n    if (deps) {\n      for (const dependency of deps.keys()) {\n        this.dependents.get(dependency)?.delete(file);\n      }\n    }\n\n    const dependents = this.dependents.get(file);\n\n    if (dependents) {\n      for (const dependent of dependents) {\n        this.dependencies.get(dependent)?.delete(file);\n      }\n    }\n\n    this.dependencies.delete(file);\n    this.dependents.delete(file);\n  }\n\n  /**\n   * Update dependencies for a file.\n   *\n   * Accepts the updated `Set<string>` of dependency paths; when the caller\n   * has per-edge type-only info, pass `typeOnlyDependencies` so the new\n   * edges get the correct flag. Missing flag defaults to runtime.\n   *\n   * @param file The file to update\n   * @param newDependencies New set of dependency paths\n   * @param typeOnlyDependencies Subset of `newDependencies` whose edges are type-only\n   */\n  public updateFile(\n    file: string,\n    newDependencies: Set<string>,\n    typeOnlyDependencies: Set<string> = new Set(),\n  ) {\n    const oldEdges = this.dependencies.get(file) ?? new Map<string, { isTypeOnly: boolean }>();\n\n    for (const oldDep of oldEdges.keys()) {\n      if (!newDependencies.has(oldDep)) {\n        this.removeDependency(file, oldDep);\n      }\n    }\n\n    for (const newDep of newDependencies) {\n      const isTypeOnly = typeOnlyDependencies.has(newDep);\n      const existing = oldEdges.get(newDep);\n\n      if (!existing) {\n        this.addDependency(file, newDep, isTypeOnly);\n\n        continue;\n      }\n\n      if (existing.isTypeOnly !== isTypeOnly) {\n        existing.isTypeOnly = isTypeOnly;\n      }\n    }\n  }\n\n  /**\n   * Get files that this file depends on (imports)\n   * @param file The file to check\n   * @returns Set of files this file imports\n   */\n  public getDependencies(file: string): Set<string> {\n    const edges = this.dependencies.get(file);\n\n    if (!edges) {\n      return new Set();\n    }\n\n    return new Set(edges.keys());\n  }\n\n  /**\n   * Check whether the edge `file → dependency` is type-only.\n   * Returns false if the edge does not exist.\n   */\n  public isEdgeTypeOnly(file: string, dependency: string): boolean {\n    return this.dependencies.get(file)?.get(dependency)?.isTypeOnly === true;\n  }\n\n  /**\n   * Get files that depend on this file (importers)\n   * @param file The file to check\n   * @returns Set of files that import this file\n   */\n  public getDependents(file: string): Set<string> {\n    return this.dependents.get(file) || new Set();\n  }\n\n  /**\n   * Get invalidation chain for a file\n   * Returns all files that need to be reloaded when this file changes\n   * Includes the file itself and all transitive dependents\n   * @param file The file that changed\n   * @returns Array of files to invalidate (in order)\n   */\n  public getInvalidationChain(file: string): string[] {\n    const chain: string[] = [file];\n    const visited = new Set([file]);\n\n    const traverse = (current: string) => {\n      const deps = this.getDependents(current);\n      for (const dep of deps) {\n        if (!visited.has(dep)) {\n          visited.add(dep);\n          chain.push(dep);\n          traverse(dep); // Recursive traversal\n        }\n      }\n    };\n\n    traverse(file);\n    return chain;\n  }\n\n  /**\n   * Detect circular dependencies in the dependency graph.\n   * Uses depth-first search to find cycles.\n   *\n   * Filtering rule (per-edge): a cycle is suppressed when **any** edge in\n   * the chain is type-only. TypeScript erases type-only imports entirely,\n   * so a single type-only edge breaks the cycle at runtime. Only warn when\n   * every edge is a runtime binding — that's the cycle that actually loops\n   * at load time.\n   *\n   * @returns Array of circular dependency chains (each chain is an array of file paths)\n   */\n  public detectCircularDependencies(): string[][] {\n    const cycles: string[][] = [];\n    const visited = new Set<string>();\n    const recursionStack = new Set<string>();\n\n    const dfs = (file: string, path: string[]): void => {\n      visited.add(file);\n      recursionStack.add(file);\n      path.push(file);\n\n      const edges = this.dependencies.get(file);\n\n      if (edges) {\n        for (const dep of edges.keys()) {\n          if (!visited.has(dep)) {\n            dfs(dep, [...path]);\n          } else if (recursionStack.has(dep)) {\n            const cycleStart = path.indexOf(dep);\n            const cycle = [...path.slice(cycleStart), dep];\n\n            cycles.push(cycle);\n          }\n        }\n      }\n\n      recursionStack.delete(file);\n    };\n\n    for (const file of this.dependencies.keys()) {\n      if (!visited.has(file)) {\n        dfs(file, []);\n      }\n    }\n\n    return cycles.filter((cycle) => this.isRuntimeCycle(cycle));\n  }\n\n  /**\n   * True iff every edge in the cycle is a runtime binding. The cycle array\n   * ends with a duplicate of its start (`[A, B, C, A]`) so we walk the\n   * consecutive pairs once — any type-only edge means TS erases the loop\n   * and there is no runtime cycle to report.\n   */\n  private isRuntimeCycle(cycle: string[]): boolean {\n    for (let index = 0; index < cycle.length - 1; index++) {\n      const from = cycle[index];\n      const to = cycle[index + 1];\n\n      // `index < cycle.length - 1` bounds both reads. Skipping an unreadable\n      // edge rather than defaulting: this decides whether a cycle is\n      // TYPE-ONLY, and a `?? \"\"` would ask `isEdgeTypeOnly(\"\", \"\")`, whose\n      // answer is about a pair of edges that do not exist. A cycle wrongly\n      // classified as type-only is a real circular import reported as harmless.\n      if (from === undefined || to === undefined) continue;\n\n      if (this.isEdgeTypeOnly(from, to)) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Display circular dependency warnings in a formatted, user-friendly way\n   * Shows each cycle with visual tree structure and helpful recommendations\n   */\n  private displayCircularDependencyWarnings(cycles: string[][]): void {\n    const colors = {\n      yellow: (text: string) => `\\x1b[33m${text}\\x1b[0m`,\n      cyan: (text: string) => `\\x1b[36m${text}\\x1b[0m`,\n      dim: (text: string) => `\\x1b[2m${text}\\x1b[0m`,\n      bold: (text: string) => `\\x1b[1m${text}\\x1b[0m`,\n      green: (text: string) => `\\x1b[32m${text}\\x1b[0m`,\n    };\n\n    console.log(\"\");\n    console.log(colors.yellow(\"⚠️  Circular Dependencies Detected\"));\n    console.log(colors.dim(\"━\".repeat(60)));\n    console.log(\"\");\n    console.log(\n      colors.dim(\n        `Found ${colors.bold(cycles.length.toString())} circular dependency chain${cycles.length > 1 ? \"s\" : \"\"}`,\n      ),\n    );\n    console.log(\"\");\n\n    cycles.forEach((cycle, index) => {\n      console.log(colors.cyan(`  ${index + 1}. Cycle with ${cycle.length - 1} files:`));\n      console.log(\"\");\n\n      // Display the cycle chain\n      cycle.forEach((file, fileIndex) => {\n        const isLast = fileIndex === cycle.length - 1;\n        const arrow = isLast ? colors.dim(\"   └─→ \") : colors.dim(\"   ├─→ \");\n        const fileName = file.split(\"/\").pop() || file;\n        const filePath = colors.dim(file.replace(fileName, \"\"));\n\n        if (isLast) {\n          // Last item is the same as first (completes the cycle)\n          console.log(\n            arrow + colors.yellow(`${filePath}${colors.bold(fileName)} (cycle completes)`),\n          );\n        } else {\n          console.log(arrow + filePath + colors.bold(fileName));\n        }\n      });\n\n      console.log(\"\");\n    });\n\n    console.log(colors.dim(\"━\".repeat(60)));\n    console.log(colors.yellow(\"💡 How to Fix:\"));\n    console.log(\"\");\n\n    // This whole block prints \"How to Fix\" advice for a cycle that was just\n    // reported, so there is always one — but this is diagnostic OUTPUT, and a\n    // formatter that throws while explaining a problem replaces the problem\n    // with itself. An empty list simply has no example to show.\n    const exampleCycle = cycles[0] ?? [];\n    const fileA = exampleCycle[0]?.split(\"/\").pop() || \"fileA.ts\";\n    const fileB = exampleCycle[1]?.split(\"/\").pop() || \"fileB.ts\";\n    const stripExt = (file: string) => file.replace(/\\.tsx?$/, \"\");\n\n    const kind = classifyCycle(exampleCycle);\n\n    if (kind === \"resource\" || kind === \"model\") {\n      // Cascade's `lazy()` is purpose-built for circular relations between\n      // resources and models — recommend it first, not as a footnote.\n      console.log(colors.green(`  ✨ Use lazy() for the back-reference`));\n      console.log(\n        colors.dim(\n          `   ${kind === \"resource\" ? \"Resources\" : \"Models\"} that reference each other should declare`,\n        ),\n      );\n      console.log(colors.dim(`   one side with lazy() so the import resolves at access time:`));\n      console.log(\"\");\n      console.log(colors.dim(`     import { lazy } from \"@warlock.js/cascade\";`));\n      console.log(colors.dim(`     // inside ${fileB}:`));\n      console.log(\n        colors.dim(\n          `     other: lazy(() => ${kind === \"resource\" ? \"OtherResource\" : \"OtherModel\"})`,\n        ),\n      );\n      console.log(\"\");\n    } else {\n      // Generic cycle — dynamic import is the most common reliable fix.\n      console.log(colors.green(`  ✨ Convert one edge to a dynamic import`));\n      console.log(colors.dim(`   In ${fileB}, change:`));\n      console.log(colors.dim(`     import { SomeClass } from \"./${stripExt(fileA)}\";`));\n      console.log(colors.dim(`   To:`));\n      console.log(colors.dim(`     const { SomeClass } = await import(\"./${stripExt(fileA)}\");`));\n      console.log(\"\");\n    }\n\n    console.log(colors.dim(\"  Other options:\"));\n    console.log(colors.dim(\"    • Extract the shared symbols into a third file both can import.\"));\n    console.log(\n      colors.dim(\"    • Pass the dependency as a constructor/function parameter instead.\"),\n    );\n    console.log(\"\");\n\n    console.log(colors.dim(\"━\".repeat(60)));\n    console.log(colors.dim(\"   Circular dependencies can cause HMR issues and hard-to-debug\"));\n    console.log(colors.dim(\"   initialization order problems. Consider refactoring.\"));\n    console.log(\"\");\n  }\n\n  /**\n   * Get statistics about the dependency graph\n   */\n  public getStats() {\n    let totalDependencies = 0;\n    let maxDependencies = 0;\n    let maxDependents = 0;\n    let mostDependedFile = \"\";\n    let mostDependingFile = \"\";\n\n    for (const [file, deps] of this.dependencies) {\n      totalDependencies += deps.size;\n      if (deps.size > maxDependencies) {\n        maxDependencies = deps.size;\n        mostDependingFile = file;\n      }\n    }\n\n    for (const [file, deps] of this.dependents) {\n      if (deps.size > maxDependents) {\n        maxDependents = deps.size;\n        mostDependedFile = file;\n      }\n    }\n\n    return {\n      totalFiles: this.dependencies.size,\n      totalDependencies,\n      avgDependenciesPerFile: totalDependencies / this.dependencies.size || 0,\n      maxDependencies,\n      maxDependents,\n      mostDependingFile,\n      mostDependedFile,\n    };\n  }\n}\n\n/**\n * Pick the most useful \"fix-it\" hint for a cycle by inspecting the file\n * extensions involved. Cascade resources/models have a first-class fix\n * (`lazy()`); generic cycles just want a dynamic import.\n */\nfunction classifyCycle(cycle: string[]): \"resource\" | \"model\" | \"generic\" {\n  const files = cycle.slice(0, -1); // last entry repeats the first\n  if (files.every((file) => file.endsWith(\".resource.ts\") || file.endsWith(\".resource.tsx\"))) {\n    return \"resource\";\n  }\n  if (files.every((file) => file.endsWith(\".model.ts\") || file.endsWith(\".model.tsx\"))) {\n    return \"model\";\n  }\n  return \"generic\";\n}\n"],"mappings":";;;;;;;;;;;AAYA,IAAa,kBAAb,MAA6B;;sCAMJ,IAAI,IAAkD;oCAOxD,IAAI,IAAyB;eAMD;;;;;CAKjD,AAAO,MAAM,OAAiC;EAC5C,KAAK,QAAQ;EAEb,KAAK,aAAa,MAAM;EACxB,KAAK,WAAW,MAAM;EAEtB,KAAK,MAAM,CAAC,cAAc,gBAAgB,OAAO;GAC/C,IAAI,CAAC,KAAK,aAAa,IAAI,YAAY,GACrC,KAAK,aAAa,IAAI,8BAAc,IAAI,IAAI,CAAC;GAG/C,IAAI,CAAC,KAAK,WAAW,IAAI,YAAY,GACnC,KAAK,WAAW,IAAI,8BAAc,IAAI,IAAI,CAAC;GAG7C,KAAK,MAAM,cAAc,YAAY,cAAc;IACjD,MAAM,aAAa,YAAY,qBAAqB,IAAI,UAAU;IAElE,KAAK,cAAc,cAAc,YAAY,UAAU;GACzD;EACF;EAEA,MAAM,SAAS,KAAK,2BAA2B;EAE/C,IAAI,OAAO,SAAS,GAClB,KAAK,kCAAkC,MAAM;CAEjD;;;;;;;;;;CAWA,AAAO,cAAc,MAAc,YAAoB,aAAsB,OAAO;EAClF,IAAI,CAAC,KAAK,aAAa,IAAI,IAAI,GAC7B,KAAK,aAAa,IAAI,sBAAM,IAAI,IAAI,CAAC;EAGvC,IAAI,CAAC,KAAK,WAAW,IAAI,UAAU,GACjC,KAAK,WAAW,IAAI,4BAAY,IAAI,IAAI,CAAC;EAG3C,MAAM,QAAQ,KAAK,aAAa,IAAI,IAAI;EACxC,MAAM,WAAW,MAAM,IAAI,UAAU;EAErC,IAAI,UACF,SAAS,aAAa,SAAS,cAAc;OAE7C,MAAM,IAAI,YAAY,EAAE,WAAW,CAAC;EAGtC,KAAK,WAAW,IAAI,UAAU,CAAC,CAAE,IAAI,IAAI;CAC3C;;;;;;CAOA,AAAO,iBAAiB,MAAc,YAAoB;EACxD,KAAK,aAAa,IAAI,IAAI,CAAC,EAAE,OAAO,UAAU;EAC9C,KAAK,WAAW,IAAI,UAAU,CAAC,EAAE,OAAO,IAAI;CAC9C;;;;;CAMA,AAAO,WAAW,MAAc;EAC9B,MAAM,OAAO,KAAK,aAAa,IAAI,IAAI;EAEvC,IAAI,MACF,KAAK,MAAM,cAAc,KAAK,KAAK,GACjC,KAAK,WAAW,IAAI,UAAU,CAAC,EAAE,OAAO,IAAI;EAIhD,MAAM,aAAa,KAAK,WAAW,IAAI,IAAI;EAE3C,IAAI,YACF,KAAK,MAAM,aAAa,YACtB,KAAK,aAAa,IAAI,SAAS,CAAC,EAAE,OAAO,IAAI;EAIjD,KAAK,aAAa,OAAO,IAAI;EAC7B,KAAK,WAAW,OAAO,IAAI;CAC7B;;;;;;;;;;;;CAaA,AAAO,WACL,MACA,iBACA,uCAAoC,IAAI,IAAI,GAC5C;EACA,MAAM,WAAW,KAAK,aAAa,IAAI,IAAI,qBAAK,IAAI,IAAqC;EAEzF,KAAK,MAAM,UAAU,SAAS,KAAK,GACjC,IAAI,CAAC,gBAAgB,IAAI,MAAM,GAC7B,KAAK,iBAAiB,MAAM,MAAM;EAItC,KAAK,MAAM,UAAU,iBAAiB;GACpC,MAAM,aAAa,qBAAqB,IAAI,MAAM;GAClD,MAAM,WAAW,SAAS,IAAI,MAAM;GAEpC,IAAI,CAAC,UAAU;IACb,KAAK,cAAc,MAAM,QAAQ,UAAU;IAE3C;GACF;GAEA,IAAI,SAAS,eAAe,YAC1B,SAAS,aAAa;EAE1B;CACF;;;;;;CAOA,AAAO,gBAAgB,MAA2B;EAChD,MAAM,QAAQ,KAAK,aAAa,IAAI,IAAI;EAExC,IAAI,CAAC,OACH,uBAAO,IAAI,IAAI;EAGjB,OAAO,IAAI,IAAI,MAAM,KAAK,CAAC;CAC7B;;;;;CAMA,AAAO,eAAe,MAAc,YAA6B;EAC/D,OAAO,KAAK,aAAa,IAAI,IAAI,CAAC,EAAE,IAAI,UAAU,CAAC,EAAE,eAAe;CACtE;;;;;;CAOA,AAAO,cAAc,MAA2B;EAC9C,OAAO,KAAK,WAAW,IAAI,IAAI,qBAAK,IAAI,IAAI;CAC9C;;;;;;;;CASA,AAAO,qBAAqB,MAAwB;EAClD,MAAM,QAAkB,CAAC,IAAI;EAC7B,MAAM,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC;EAE9B,MAAM,YAAY,YAAoB;GACpC,MAAM,OAAO,KAAK,cAAc,OAAO;GACvC,KAAK,MAAM,OAAO,MAChB,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;IACrB,QAAQ,IAAI,GAAG;IACf,MAAM,KAAK,GAAG;IACd,SAAS,GAAG;GACd;EAEJ;EAEA,SAAS,IAAI;EACb,OAAO;CACT;;;;;;;;;;;;;CAcA,AAAO,6BAAyC;EAC9C,MAAM,SAAqB,CAAC;EAC5B,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,iCAAiB,IAAI,IAAY;EAEvC,MAAM,OAAO,MAAc,SAAyB;GAClD,QAAQ,IAAI,IAAI;GAChB,eAAe,IAAI,IAAI;GACvB,KAAK,KAAK,IAAI;GAEd,MAAM,QAAQ,KAAK,aAAa,IAAI,IAAI;GAExC,IAAI,OACF;SAAK,MAAM,OAAO,MAAM,KAAK,GAC3B,IAAI,CAAC,QAAQ,IAAI,GAAG,GAClB,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC;SACb,IAAI,eAAe,IAAI,GAAG,GAAG;KAClC,MAAM,aAAa,KAAK,QAAQ,GAAG;KACnC,MAAM,QAAQ,CAAC,GAAG,KAAK,MAAM,UAAU,GAAG,GAAG;KAE7C,OAAO,KAAK,KAAK;IACnB;GACF;GAGF,eAAe,OAAO,IAAI;EAC5B;EAEA,KAAK,MAAM,QAAQ,KAAK,aAAa,KAAK,GACxC,IAAI,CAAC,QAAQ,IAAI,IAAI,GACnB,IAAI,MAAM,CAAC,CAAC;EAIhB,OAAO,OAAO,QAAQ,UAAU,KAAK,eAAe,KAAK,CAAC;CAC5D;;;;;;;CAQA,AAAQ,eAAe,OAA0B;EAC/C,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,SAAS,GAAG,SAAS;GACrD,MAAM,OAAO,MAAM;GACnB,MAAM,KAAK,MAAM,QAAQ;GAOzB,IAAI,SAAS,UAAa,OAAO,QAAW;GAE5C,IAAI,KAAK,eAAe,MAAM,EAAE,GAC9B,OAAO;EAEX;EAEA,OAAO;CACT;;;;;CAMA,AAAQ,kCAAkC,QAA0B;EAClE,MAAM,SAAS;GACb,SAAS,SAAiB,WAAW,KAAK;GAC1C,OAAO,SAAiB,WAAW,KAAK;GACxC,MAAM,SAAiB,UAAU,KAAK;GACtC,OAAO,SAAiB,UAAU,KAAK;GACvC,QAAQ,SAAiB,WAAW,KAAK;EAC3C;EAEA,QAAQ,IAAI,EAAE;EACd,QAAQ,IAAI,OAAO,OAAO,oCAAoC,CAAC;EAC/D,QAAQ,IAAI,OAAO,IAAI,IAAI,OAAO,EAAE,CAAC,CAAC;EACtC,QAAQ,IAAI,EAAE;EACd,QAAQ,IACN,OAAO,IACL,SAAS,OAAO,KAAK,OAAO,OAAO,SAAS,CAAC,EAAE,4BAA4B,OAAO,SAAS,IAAI,MAAM,IACvG,CACF;EACA,QAAQ,IAAI,EAAE;EAEd,OAAO,SAAS,OAAO,UAAU;GAC/B,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,eAAe,MAAM,SAAS,EAAE,QAAQ,CAAC;GAChF,QAAQ,IAAI,EAAE;GAGd,MAAM,SAAS,MAAM,cAAc;IACjC,MAAM,SAAS,cAAc,MAAM,SAAS;IAC5C,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS,IAAI,OAAO,IAAI,SAAS;IACnE,MAAM,WAAW,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;IAC1C,MAAM,WAAW,OAAO,IAAI,KAAK,QAAQ,UAAU,EAAE,CAAC;IAEtD,IAAI,QAEF,QAAQ,IACN,QAAQ,OAAO,OAAO,GAAG,WAAW,OAAO,KAAK,QAAQ,EAAE,mBAAmB,CAC/E;SAEA,QAAQ,IAAI,QAAQ,WAAW,OAAO,KAAK,QAAQ,CAAC;GAExD,CAAC;GAED,QAAQ,IAAI,EAAE;EAChB,CAAC;EAED,QAAQ,IAAI,OAAO,IAAI,IAAI,OAAO,EAAE,CAAC,CAAC;EACtC,QAAQ,IAAI,OAAO,OAAO,gBAAgB,CAAC;EAC3C,QAAQ,IAAI,EAAE;EAMd,MAAM,eAAe,OAAO,MAAM,CAAC;EACnC,MAAM,QAAQ,aAAa,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;EACnD,MAAM,QAAQ,aAAa,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;EACnD,MAAM,YAAY,SAAiB,KAAK,QAAQ,WAAW,EAAE;EAE7D,MAAM,OAAO,cAAc,YAAY;EAEvC,IAAI,SAAS,cAAc,SAAS,SAAS;GAG3C,QAAQ,IAAI,OAAO,MAAM,uCAAuC,CAAC;GACjE,QAAQ,IACN,OAAO,IACL,MAAM,SAAS,aAAa,cAAc,SAAS,0CACrD,CACF;GACA,QAAQ,IAAI,OAAO,IAAI,gEAAgE,CAAC;GACxF,QAAQ,IAAI,EAAE;GACd,QAAQ,IAAI,OAAO,IAAI,kDAAkD,CAAC;GAC1E,QAAQ,IAAI,OAAO,IAAI,kBAAkB,MAAM,EAAE,CAAC;GAClD,QAAQ,IACN,OAAO,IACL,0BAA0B,SAAS,aAAa,kBAAkB,aAAa,EACjF,CACF;GACA,QAAQ,IAAI,EAAE;EAChB,OAAO;GAEL,QAAQ,IAAI,OAAO,MAAM,0CAA0C,CAAC;GACpE,QAAQ,IAAI,OAAO,IAAI,SAAS,MAAM,UAAU,CAAC;GACjD,QAAQ,IAAI,OAAO,IAAI,qCAAqC,SAAS,KAAK,EAAE,GAAG,CAAC;GAChF,QAAQ,IAAI,OAAO,IAAI,QAAQ,CAAC;GAChC,QAAQ,IAAI,OAAO,IAAI,8CAA8C,SAAS,KAAK,EAAE,IAAI,CAAC;GAC1F,QAAQ,IAAI,EAAE;EAChB;EAEA,QAAQ,IAAI,OAAO,IAAI,kBAAkB,CAAC;EAC1C,QAAQ,IAAI,OAAO,IAAI,qEAAqE,CAAC;EAC7F,QAAQ,IACN,OAAO,IAAI,wEAAwE,CACrF;EACA,QAAQ,IAAI,EAAE;EAEd,QAAQ,IAAI,OAAO,IAAI,IAAI,OAAO,EAAE,CAAC,CAAC;EACtC,QAAQ,IAAI,OAAO,IAAI,iEAAiE,CAAC;EACzF,QAAQ,IAAI,OAAO,IAAI,yDAAyD,CAAC;EACjF,QAAQ,IAAI,EAAE;CAChB;;;;CAKA,AAAO,WAAW;EAChB,IAAI,oBAAoB;EACxB,IAAI,kBAAkB;EACtB,IAAI,gBAAgB;EACpB,IAAI,mBAAmB;EACvB,IAAI,oBAAoB;EAExB,KAAK,MAAM,CAAC,MAAM,SAAS,KAAK,cAAc;GAC5C,qBAAqB,KAAK;GAC1B,IAAI,KAAK,OAAO,iBAAiB;IAC/B,kBAAkB,KAAK;IACvB,oBAAoB;GACtB;EACF;EAEA,KAAK,MAAM,CAAC,MAAM,SAAS,KAAK,YAC9B,IAAI,KAAK,OAAO,eAAe;GAC7B,gBAAgB,KAAK;GACrB,mBAAmB;EACrB;EAGF,OAAO;GACL,YAAY,KAAK,aAAa;GAC9B;GACA,wBAAwB,oBAAoB,KAAK,aAAa,QAAQ;GACtE;GACA;GACA;GACA;EACF;CACF;AACF;;;;;;AAOA,SAAS,cAAc,OAAmD;CACxE,MAAM,QAAQ,MAAM,MAAM,GAAG,EAAE;CAC/B,IAAI,MAAM,OAAO,SAAS,KAAK,SAAS,cAAc,KAAK,KAAK,SAAS,eAAe,CAAC,GACvF,OAAO;CAET,IAAI,MAAM,OAAO,SAAS,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,YAAY,CAAC,GACjF,OAAO;CAET,OAAO;AACT"}
+{"version":3,"file":"dependency-graph.mjs","names":[],"sources":["../../../../../../../../packages/core/src/dev-server/dependency-graph.ts"],"sourcesContent":["import type { FileManager } from \"./file-manager\";\n\n/**\n * Dependency Graph\n * Tracks bidirectional relationships between files:\n * - dependencies: files that this file imports\n * - dependents: files that import this file\n *\n * Each forward edge also carries an `isTypeOnly` flag so cycle detection\n * can distinguish runtime cycles from ones formed purely by `import type`\n * edges — the latter are erased by TypeScript and have no runtime effect.\n */\nexport class DependencyGraph {\n  /**\n   * Map of file -> files it depends on (imports).\n   * Key: relative file path.\n   * Value: relative dependency path → `{ isTypeOnly }` for that edge.\n   */\n  private dependencies = new Map<string, Map<string, { isTypeOnly: boolean }>>();\n\n  /**\n   * Map of file -> files that depend on it (importers)\n   * Key: relative file path\n   * Value: Set of relative file paths that import this file\n   */\n  private dependents = new Map<string, Set<string>>();\n\n  /**\n   * Reference to the files map for accessing FileManager instances\n   * Used to read per-file typeOnlyDependencies during graph build.\n   */\n  private files: Map<string, FileManager> | null = null;\n\n  /**\n   * Build dependency graph from FileManager map\n   */\n  public build(files: Map<string, FileManager>) {\n    this.files = files;\n\n    this.dependencies.clear();\n    this.dependents.clear();\n\n    for (const [relativePath, fileManager] of files) {\n      if (!this.dependencies.has(relativePath)) {\n        this.dependencies.set(relativePath, new Map());\n      }\n\n      if (!this.dependents.has(relativePath)) {\n        this.dependents.set(relativePath, new Set());\n      }\n\n      for (const dependency of fileManager.dependencies) {\n        const isTypeOnly = fileManager.typeOnlyDependencies.has(dependency);\n\n        this.addDependency(relativePath, dependency, isTypeOnly);\n      }\n    }\n\n    const cycles = this.detectCircularDependencies();\n\n    if (cycles.length > 0) {\n      this.displayCircularDependencyWarnings(cycles);\n    }\n  }\n\n  /**\n   * Add a dependency relationship.\n   * If the edge already exists, the type-only flag is ANDed: any runtime\n   * statement between the two files makes the edge runtime permanently.\n   *\n   * @param file The file that has the dependency\n   * @param dependency The file being depended upon\n   * @param isTypeOnly Whether every reference from `file` to `dependency` is type-only\n   */\n  public addDependency(file: string, dependency: string, isTypeOnly: boolean = false) {\n    if (!this.dependencies.has(file)) {\n      this.dependencies.set(file, new Map());\n    }\n\n    if (!this.dependents.has(dependency)) {\n      this.dependents.set(dependency, new Set());\n    }\n\n    const edges = this.dependencies.get(file)!;\n    const existing = edges.get(dependency);\n\n    if (existing) {\n      existing.isTypeOnly = existing.isTypeOnly && isTypeOnly;\n    } else {\n      edges.set(dependency, { isTypeOnly });\n    }\n\n    this.dependents.get(dependency)!.add(file);\n  }\n\n  /**\n   * Remove a dependency relationship\n   * @param file The file that has the dependency\n   * @param dependency The file being depended upon\n   */\n  public removeDependency(file: string, dependency: string) {\n    this.dependencies.get(file)?.delete(dependency);\n    this.dependents.get(dependency)?.delete(file);\n  }\n\n  /**\n   * Remove all relationships for a file\n   * @param file The file to remove\n   */\n  public removeFile(file: string) {\n    const deps = this.dependencies.get(file);\n\n    if (deps) {\n      for (const dependency of deps.keys()) {\n        this.dependents.get(dependency)?.delete(file);\n      }\n    }\n\n    const dependents = this.dependents.get(file);\n\n    if (dependents) {\n      for (const dependent of dependents) {\n        this.dependencies.get(dependent)?.delete(file);\n      }\n    }\n\n    this.dependencies.delete(file);\n    this.dependents.delete(file);\n  }\n\n  /**\n   * Update dependencies for a file.\n   *\n   * Accepts the updated `Set<string>` of dependency paths; when the caller\n   * has per-edge type-only info, pass `typeOnlyDependencies` so the new\n   * edges get the correct flag. Missing flag defaults to runtime.\n   *\n   * @param file The file to update\n   * @param newDependencies New set of dependency paths\n   * @param typeOnlyDependencies Subset of `newDependencies` whose edges are type-only\n   */\n  public updateFile(\n    file: string,\n    newDependencies: Set<string>,\n    typeOnlyDependencies: Set<string> = new Set(),\n  ) {\n    const oldEdges = this.dependencies.get(file) ?? new Map<string, { isTypeOnly: boolean }>();\n\n    for (const oldDep of oldEdges.keys()) {\n      if (!newDependencies.has(oldDep)) {\n        this.removeDependency(file, oldDep);\n      }\n    }\n\n    for (const newDep of newDependencies) {\n      const isTypeOnly = typeOnlyDependencies.has(newDep);\n      const existing = oldEdges.get(newDep);\n\n      if (!existing) {\n        this.addDependency(file, newDep, isTypeOnly);\n\n        continue;\n      }\n\n      if (existing.isTypeOnly !== isTypeOnly) {\n        existing.isTypeOnly = isTypeOnly;\n      }\n    }\n  }\n\n  /**\n   * Get files that this file depends on (imports)\n   * @param file The file to check\n   * @returns Set of files this file imports\n   */\n  public getDependencies(file: string): Set<string> {\n    const edges = this.dependencies.get(file);\n\n    if (!edges) {\n      return new Set();\n    }\n\n    return new Set(edges.keys());\n  }\n\n  /**\n   * Check whether the edge `file → dependency` is type-only.\n   * Returns false if the edge does not exist.\n   */\n  public isEdgeTypeOnly(file: string, dependency: string): boolean {\n    return this.dependencies.get(file)?.get(dependency)?.isTypeOnly === true;\n  }\n\n  /**\n   * Get files that depend on this file (importers)\n   * @param file The file to check\n   * @returns Set of files that import this file\n   */\n  public getDependents(file: string): Set<string> {\n    return this.dependents.get(file) || new Set();\n  }\n\n  /**\n   * Get invalidation chain for a file\n   * Returns all files that need to be reloaded when this file changes\n   * Includes the file itself and all transitive dependents\n   * @param file The file that changed\n   * @returns Array of files to invalidate (in order)\n   */\n  public getInvalidationChain(file: string): string[] {\n    const chain: string[] = [file];\n    const visited = new Set([file]);\n\n    const traverse = (current: string) => {\n      const deps = this.getDependents(current);\n      for (const dep of deps) {\n        if (!visited.has(dep)) {\n          visited.add(dep);\n          chain.push(dep);\n          traverse(dep); // Recursive traversal\n        }\n      }\n    };\n\n    traverse(file);\n    return chain;\n  }\n\n  /**\n   * Detect circular dependencies in the dependency graph.\n   * Uses depth-first search to find cycles.\n   *\n   * Filtering rule (per-edge): a cycle is suppressed when **any** edge in\n   * the chain is type-only. TypeScript erases type-only imports entirely,\n   * so a single type-only edge breaks the cycle at runtime. Only warn when\n   * every edge is a runtime binding — that's the cycle that actually loops\n   * at load time.\n   *\n   * @returns Array of circular dependency chains (each chain is an array of file paths)\n   */\n  public detectCircularDependencies(): string[][] {\n    const cycles: string[][] = [];\n    const visited = new Set<string>();\n    const recursionStack = new Set<string>();\n\n    const dfs = (file: string, path: string[]): void => {\n      visited.add(file);\n      recursionStack.add(file);\n      path.push(file);\n\n      const edges = this.dependencies.get(file);\n\n      if (edges) {\n        for (const dep of edges.keys()) {\n          if (!visited.has(dep)) {\n            dfs(dep, [...path]);\n          } else if (recursionStack.has(dep)) {\n            const cycleStart = path.indexOf(dep);\n            const cycle = [...path.slice(cycleStart), dep];\n\n            cycles.push(cycle);\n          }\n        }\n      }\n\n      recursionStack.delete(file);\n    };\n\n    for (const file of this.dependencies.keys()) {\n      if (!visited.has(file)) {\n        dfs(file, []);\n      }\n    }\n\n    return cycles.filter((cycle) => this.isRuntimeCycle(cycle));\n  }\n\n  /**\n   * True iff every edge in the cycle is a runtime binding. The cycle array\n   * ends with a duplicate of its start (`[A, B, C, A]`) so we walk the\n   * consecutive pairs once — any type-only edge means TS erases the loop\n   * and there is no runtime cycle to report.\n   */\n  private isRuntimeCycle(cycle: string[]): boolean {\n    for (let index = 0; index < cycle.length - 1; index++) {\n      const from = cycle[index];\n      const to = cycle[index + 1];\n\n      // `index < cycle.length - 1` bounds both reads. Skipping an unreadable\n      // edge rather than defaulting: this decides whether a cycle is\n      // TYPE-ONLY, and a `?? \"\"` would ask `isEdgeTypeOnly(\"\", \"\")`, whose\n      // answer is about a pair of edges that do not exist. A cycle wrongly\n      // classified as type-only is a real circular import reported as harmless.\n      if (from === undefined || to === undefined) continue;\n\n      if (this.isEdgeTypeOnly(from, to)) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Display circular dependency warnings in a formatted, user-friendly way\n   * Shows each cycle with visual tree structure and helpful recommendations\n   */\n  private displayCircularDependencyWarnings(cycles: string[][]): void {\n    const colors = {\n      yellow: (text: string) => `\\x1b[33m${text}\\x1b[0m`,\n      cyan: (text: string) => `\\x1b[36m${text}\\x1b[0m`,\n      dim: (text: string) => `\\x1b[2m${text}\\x1b[0m`,\n      bold: (text: string) => `\\x1b[1m${text}\\x1b[0m`,\n      green: (text: string) => `\\x1b[32m${text}\\x1b[0m`,\n    };\n\n    console.log(\"\");\n    console.log(colors.yellow(\"⚠️  Circular Dependencies Detected\"));\n    console.log(colors.dim(\"━\".repeat(60)));\n    console.log(\"\");\n    console.log(\n      colors.dim(\n        `Found ${colors.bold(cycles.length.toString())} circular dependency chain${cycles.length > 1 ? \"s\" : \"\"}`,\n      ),\n    );\n    console.log(\"\");\n\n    cycles.forEach((cycle, index) => {\n      console.log(colors.cyan(`  ${index + 1}. Cycle with ${cycle.length - 1} files:`));\n      console.log(\"\");\n\n      // Display the cycle chain\n      cycle.forEach((file, fileIndex) => {\n        const isLast = fileIndex === cycle.length - 1;\n        const arrow = isLast ? colors.dim(\"   └─→ \") : colors.dim(\"   ├─→ \");\n        const fileName = file.split(\"/\").pop() || file;\n        const filePath = colors.dim(file.replace(fileName, \"\"));\n\n        if (isLast) {\n          // Last item is the same as first (completes the cycle)\n          console.log(\n            arrow + colors.yellow(`${filePath}${colors.bold(fileName)} (cycle completes)`),\n          );\n        } else {\n          console.log(arrow + filePath + colors.bold(fileName));\n        }\n      });\n\n      console.log(\"\");\n    });\n\n    console.log(colors.dim(\"━\".repeat(60)));\n    console.log(colors.yellow(\"💡 How to Fix:\"));\n    console.log(\"\");\n\n    // This whole block prints \"How to Fix\" advice for a cycle that was just\n    // reported, so there is always one — but this is diagnostic OUTPUT, and a\n    // formatter that throws while explaining a problem replaces the problem\n    // with itself. An empty list simply has no example to show.\n    const exampleCycle = cycles[0] ?? [];\n    const fileA = exampleCycle[0]?.split(\"/\").pop() || \"fileA.ts\";\n    const fileB = exampleCycle[1]?.split(\"/\").pop() || \"fileB.ts\";\n    const stripExt = (file: string) => file.replace(/\\.tsx?$/, \"\");\n\n    const kind = classifyCycle(exampleCycle);\n\n    if (kind === \"resource\" || kind === \"model\") {\n      // Cascade's `lazy()` is purpose-built for circular relations between\n      // resources and models — recommend it first, not as a footnote.\n      console.log(colors.green(`  ✨ Use lazy() for the back-reference`));\n      console.log(\n        colors.dim(\n          `   ${kind === \"resource\" ? \"Resources\" : \"Models\"} that reference each other should declare`,\n        ),\n      );\n      console.log(colors.dim(`   one side with lazy() so the import resolves at access time:`));\n      console.log(\"\");\n      console.log(colors.dim(`     import { lazy } from \"@warlock.js/cascade\";`));\n      console.log(colors.dim(`     // inside ${fileB}:`));\n      console.log(\n        colors.dim(\n          `     other: lazy(() => ${kind === \"resource\" ? \"OtherResource\" : \"OtherModel\"})`,\n        ),\n      );\n      console.log(\"\");\n    } else {\n      // Generic cycle — dynamic import is the most common reliable fix.\n      console.log(colors.green(`  ✨ Convert one edge to a dynamic import`));\n      console.log(colors.dim(`   In ${fileB}, change:`));\n      console.log(colors.dim(`     import { SomeClass } from \"./${stripExt(fileA)}\";`));\n      console.log(colors.dim(`   To:`));\n      console.log(colors.dim(`     const { SomeClass } = await import(\"./${stripExt(fileA)}\");`));\n      console.log(\"\");\n    }\n\n    console.log(colors.dim(\"  Other options:\"));\n    console.log(colors.dim(\"    • Extract the shared symbols into a third file both can import.\"));\n    console.log(\n      colors.dim(\"    • Pass the dependency as a constructor/function parameter instead.\"),\n    );\n    console.log(\"\");\n\n    console.log(colors.dim(\"━\".repeat(60)));\n    console.log(colors.dim(\"   Circular dependencies can cause HMR issues and hard-to-debug\"));\n    console.log(colors.dim(\"   initialization order problems. Consider refactoring.\"));\n    console.log(\"\");\n  }\n\n  /**\n   * Get statistics about the dependency graph\n   */\n  public getStats() {\n    let totalDependencies = 0;\n    let maxDependencies = 0;\n    let maxDependents = 0;\n    let mostDependedFile = \"\";\n    let mostDependingFile = \"\";\n\n    for (const [file, deps] of this.dependencies) {\n      totalDependencies += deps.size;\n      if (deps.size > maxDependencies) {\n        maxDependencies = deps.size;\n        mostDependingFile = file;\n      }\n    }\n\n    for (const [file, deps] of this.dependents) {\n      if (deps.size > maxDependents) {\n        maxDependents = deps.size;\n        mostDependedFile = file;\n      }\n    }\n\n    return {\n      totalFiles: this.dependencies.size,\n      totalDependencies,\n      avgDependenciesPerFile: totalDependencies / this.dependencies.size || 0,\n      maxDependencies,\n      maxDependents,\n      mostDependingFile,\n      mostDependedFile,\n    };\n  }\n}\n\n/**\n * Pick the most useful \"fix-it\" hint for a cycle by inspecting the file\n * extensions involved. Cascade resources/models have a first-class fix\n * (`lazy()`); generic cycles just want a dynamic import.\n */\nfunction classifyCycle(cycle: string[]): \"resource\" | \"model\" | \"generic\" {\n  const files = cycle.slice(0, -1); // last entry repeats the first\n  if (files.every((file) => file.endsWith(\".resource.ts\") || file.endsWith(\".resource.tsx\"))) {\n    return \"resource\";\n  }\n  if (files.every((file) => file.endsWith(\".model.ts\") || file.endsWith(\".model.tsx\"))) {\n    return \"model\";\n  }\n  return \"generic\";\n}\n"],"mappings":";;;;;;;;;;;AAYA,IAAa,kBAAb,MAA6B;;sCAMJ,IAAI,IAAkD;oCAOxD,IAAI,IAAyB;eAMD;;;;;CAKjD,AAAO,MAAM,OAAiC;EAC5C,KAAK,QAAQ;EAEb,KAAK,aAAa,MAAM;EACxB,KAAK,WAAW,MAAM;EAEtB,KAAK,MAAM,CAAC,cAAc,gBAAgB,OAAO;GAC/C,IAAI,CAAC,KAAK,aAAa,IAAI,YAAY,GACrC,KAAK,aAAa,IAAI,8BAAc,IAAI,IAAI,CAAC;GAG/C,IAAI,CAAC,KAAK,WAAW,IAAI,YAAY,GACnC,KAAK,WAAW,IAAI,8BAAc,IAAI,IAAI,CAAC;GAG7C,KAAK,MAAM,cAAc,YAAY,cAAc;IACjD,MAAM,aAAa,YAAY,qBAAqB,IAAI,UAAU;IAElE,KAAK,cAAc,cAAc,YAAY,UAAU;GACzD;EACF;EAEA,MAAM,SAAS,KAAK,2BAA2B;EAE/C,IAAI,OAAO,SAAS,GAClB,KAAK,kCAAkC,MAAM;CAEjD;;;;;;;;;;CAWA,AAAO,cAAc,MAAc,YAAoB,aAAsB,OAAO;EAClF,IAAI,CAAC,KAAK,aAAa,IAAI,IAAI,GAC7B,KAAK,aAAa,IAAI,sBAAM,IAAI,IAAI,CAAC;EAGvC,IAAI,CAAC,KAAK,WAAW,IAAI,UAAU,GACjC,KAAK,WAAW,IAAI,4BAAY,IAAI,IAAI,CAAC;EAG3C,MAAM,QAAQ,KAAK,aAAa,IAAI,IAAI;EACxC,MAAM,WAAW,MAAM,IAAI,UAAU;EAErC,IAAI,UACF,SAAS,aAAa,SAAS,cAAc;OAE7C,MAAM,IAAI,YAAY,EAAE,WAAW,CAAC;EAGtC,KAAK,WAAW,IAAI,UAAU,CAAC,CAAE,IAAI,IAAI;CAC3C;;;;;;CAOA,AAAO,iBAAiB,MAAc,YAAoB;EACxD,KAAK,aAAa,IAAI,IAAI,CAAC,EAAE,OAAO,UAAU;EAC9C,KAAK,WAAW,IAAI,UAAU,CAAC,EAAE,OAAO,IAAI;CAC9C;;;;;CAMA,AAAO,WAAW,MAAc;EAC9B,MAAM,OAAO,KAAK,aAAa,IAAI,IAAI;EAEvC,IAAI,MACF,KAAK,MAAM,cAAc,KAAK,KAAK,GACjC,KAAK,WAAW,IAAI,UAAU,CAAC,EAAE,OAAO,IAAI;EAIhD,MAAM,aAAa,KAAK,WAAW,IAAI,IAAI;EAE3C,IAAI,YACF,KAAK,MAAM,aAAa,YACtB,KAAK,aAAa,IAAI,SAAS,CAAC,EAAE,OAAO,IAAI;EAIjD,KAAK,aAAa,OAAO,IAAI;EAC7B,KAAK,WAAW,OAAO,IAAI;CAC7B;;;;;;;;;;;;CAaA,AAAO,WACL,MACA,iBACA,uCAAoC,IAAI,IAAI,GAC5C;EACA,MAAM,WAAW,KAAK,aAAa,IAAI,IAAI,qBAAK,IAAI,IAAqC;EAEzF,KAAK,MAAM,UAAU,SAAS,KAAK,GACjC,IAAI,CAAC,gBAAgB,IAAI,MAAM,GAC7B,KAAK,iBAAiB,MAAM,MAAM;EAItC,KAAK,MAAM,UAAU,iBAAiB;GACpC,MAAM,aAAa,qBAAqB,IAAI,MAAM;GAClD,MAAM,WAAW,SAAS,IAAI,MAAM;GAEpC,IAAI,CAAC,UAAU;IACb,KAAK,cAAc,MAAM,QAAQ,UAAU;IAE3C;GACF;GAEA,IAAI,SAAS,eAAe,YAC1B,SAAS,aAAa;EAE1B;CACF;;;;;;CAOA,AAAO,gBAAgB,MAA2B;EAChD,MAAM,QAAQ,KAAK,aAAa,IAAI,IAAI;EAExC,IAAI,CAAC,OACH,uBAAO,IAAI,IAAI;EAGjB,OAAO,IAAI,IAAI,MAAM,KAAK,CAAC;CAC7B;;;;;CAMA,AAAO,eAAe,MAAc,YAA6B;EAC/D,OAAO,KAAK,aAAa,IAAI,IAAI,CAAC,EAAE,IAAI,UAAU,CAAC,EAAE,eAAe;CACtE;;;;;;CAOA,AAAO,cAAc,MAA2B;EAC9C,OAAO,KAAK,WAAW,IAAI,IAAI,qBAAK,IAAI,IAAI;CAC9C;;;;;;;;CASA,AAAO,qBAAqB,MAAwB;EAClD,MAAM,QAAkB,CAAC,IAAI;EAC7B,MAAM,0BAAU,IAAI,IAAI,CAAC,IAAI,CAAC;EAE9B,MAAM,YAAY,YAAoB;GACpC,MAAM,OAAO,KAAK,cAAc,OAAO;GACvC,KAAK,MAAM,OAAO,MAChB,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;IACrB,QAAQ,IAAI,GAAG;IACf,MAAM,KAAK,GAAG;IACd,SAAS,GAAG;GACd;EAEJ;EAEA,SAAS,IAAI;EACb,OAAO;CACT;;;;;;;;;;;;;CAcA,AAAO,6BAAyC;EAC9C,MAAM,SAAqB,CAAC;EAC5B,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,iCAAiB,IAAI,IAAY;EAEvC,MAAM,OAAO,MAAc,SAAyB;GAClD,QAAQ,IAAI,IAAI;GAChB,eAAe,IAAI,IAAI;GACvB,KAAK,KAAK,IAAI;GAEd,MAAM,QAAQ,KAAK,aAAa,IAAI,IAAI;GAExC,IAAI,OACF;SAAK,MAAM,OAAO,MAAM,KAAK,GAC3B,IAAI,CAAC,QAAQ,IAAI,GAAG,GAClB,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC;SACb,IAAI,eAAe,IAAI,GAAG,GAAG;KAClC,MAAM,aAAa,KAAK,QAAQ,GAAG;KACnC,MAAM,QAAQ,CAAC,GAAG,KAAK,MAAM,UAAU,GAAG,GAAG;KAE7C,OAAO,KAAK,KAAK;IACnB;GACF;GAGF,eAAe,OAAO,IAAI;EAC5B;EAEA,KAAK,MAAM,QAAQ,KAAK,aAAa,KAAK,GACxC,IAAI,CAAC,QAAQ,IAAI,IAAI,GACnB,IAAI,MAAM,CAAC,CAAC;EAIhB,OAAO,OAAO,QAAQ,UAAU,KAAK,eAAe,KAAK,CAAC;CAC5D;;;;;;;CAQA,AAAQ,eAAe,OAA0B;EAC/C,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,SAAS,GAAG,SAAS;GACrD,MAAM,OAAO,MAAM;GACnB,MAAM,KAAK,MAAM,QAAQ;GAOzB,IAAI,SAAS,UAAa,OAAO,QAAW;GAE5C,IAAI,KAAK,eAAe,MAAM,EAAE,GAC9B,OAAO;EAEX;EAEA,OAAO;CACT;;;;;CAMA,AAAQ,kCAAkC,QAA0B;EAClE,MAAM,SAAS;GACb,SAAS,SAAiB,WAAW,KAAK;GAC1C,OAAO,SAAiB,WAAW,KAAK;GACxC,MAAM,SAAiB,UAAU,KAAK;GACtC,OAAO,SAAiB,UAAU,KAAK;GACvC,QAAQ,SAAiB,WAAW,KAAK;EAC3C;EAEA,QAAQ,IAAI,EAAE;EACd,QAAQ,IAAI,OAAO,OAAO,oCAAoC,CAAC;EAC/D,QAAQ,IAAI,OAAO,IAAI,IAAI,OAAO,EAAE,CAAC,CAAC;EACtC,QAAQ,IAAI,EAAE;EACd,QAAQ,IACN,OAAO,IACL,SAAS,OAAO,KAAK,OAAO,OAAO,SAAS,CAAC,EAAE,4BAA4B,OAAO,SAAS,IAAI,MAAM,IACvG,CACF;EACA,QAAQ,IAAI,EAAE;EAEd,OAAO,SAAS,OAAO,UAAU;GAC/B,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,eAAe,MAAM,SAAS,EAAE,QAAQ,CAAC;GAChF,QAAQ,IAAI,EAAE;GAGd,MAAM,SAAS,MAAM,cAAc;IACjC,MAAM,SAAS,cAAc,MAAM,SAAS;IAC5C,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS,IAAI,OAAO,IAAI,SAAS;IACnE,MAAM,WAAW,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;IAC1C,MAAM,WAAW,OAAO,IAAI,KAAK,QAAQ,UAAU,EAAE,CAAC;IAEtD,IAAI,QAEF,QAAQ,IACN,QAAQ,OAAO,OAAO,GAAG,WAAW,OAAO,KAAK,QAAQ,EAAE,mBAAmB,CAC/E;SAEA,QAAQ,IAAI,QAAQ,WAAW,OAAO,KAAK,QAAQ,CAAC;GAExD,CAAC;GAED,QAAQ,IAAI,EAAE;EAChB,CAAC;EAED,QAAQ,IAAI,OAAO,IAAI,IAAI,OAAO,EAAE,CAAC,CAAC;EACtC,QAAQ,IAAI,OAAO,OAAO,gBAAgB,CAAC;EAC3C,QAAQ,IAAI,EAAE;EAMd,MAAM,eAAe,OAAO,MAAM,CAAC;EACnC,MAAM,QAAQ,aAAa,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;EACnD,MAAM,QAAQ,aAAa,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;EACnD,MAAM,YAAY,SAAiB,KAAK,QAAQ,WAAW,EAAE;EAE7D,MAAM,OAAO,cAAc,YAAY;EAEvC,IAAI,SAAS,cAAc,SAAS,SAAS;GAG3C,QAAQ,IAAI,OAAO,MAAM,uCAAuC,CAAC;GACjE,QAAQ,IACN,OAAO,IACL,MAAM,SAAS,aAAa,cAAc,SAAS,0CACrD,CACF;GACA,QAAQ,IAAI,OAAO,IAAI,gEAAgE,CAAC;GACxF,QAAQ,IAAI,EAAE;GACd,QAAQ,IAAI,OAAO,IAAI,kDAAkD,CAAC;GAC1E,QAAQ,IAAI,OAAO,IAAI,kBAAkB,MAAM,EAAE,CAAC;GAClD,QAAQ,IACN,OAAO,IACL,0BAA0B,SAAS,aAAa,kBAAkB,aAAa,EACjF,CACF;GACA,QAAQ,IAAI,EAAE;EAChB,OAAO;GAEL,QAAQ,IAAI,OAAO,MAAM,0CAA0C,CAAC;GACpE,QAAQ,IAAI,OAAO,IAAI,SAAS,MAAM,UAAU,CAAC;GACjD,QAAQ,IAAI,OAAO,IAAI,qCAAqC,SAAS,KAAK,EAAE,GAAG,CAAC;GAChF,QAAQ,IAAI,OAAO,IAAI,QAAQ,CAAC;GAChC,QAAQ,IAAI,OAAO,IAAI,8CAA8C,SAAS,KAAK,EAAE,IAAI,CAAC;GAC1F,QAAQ,IAAI,EAAE;EAChB;EAEA,QAAQ,IAAI,OAAO,IAAI,kBAAkB,CAAC;EAC1C,QAAQ,IAAI,OAAO,IAAI,qEAAqE,CAAC;EAC7F,QAAQ,IACN,OAAO,IAAI,wEAAwE,CACrF;EACA,QAAQ,IAAI,EAAE;EAEd,QAAQ,IAAI,OAAO,IAAI,IAAI,OAAO,EAAE,CAAC,CAAC;EACtC,QAAQ,IAAI,OAAO,IAAI,iEAAiE,CAAC;EACzF,QAAQ,IAAI,OAAO,IAAI,yDAAyD,CAAC;EACjF,QAAQ,IAAI,EAAE;CAChB;;;;CAKA,AAAO,WAAW;EAChB,IAAI,oBAAoB;EACxB,IAAI,kBAAkB;EACtB,IAAI,gBAAgB;EACpB,IAAI,mBAAmB;EACvB,IAAI,oBAAoB;EAExB,KAAK,MAAM,CAAC,MAAM,SAAS,KAAK,cAAc;GAC5C,qBAAqB,KAAK;GAC1B,IAAI,KAAK,OAAO,iBAAiB;IAC/B,kBAAkB,KAAK;IACvB,oBAAoB;GACtB;EACF;EAEA,KAAK,MAAM,CAAC,MAAM,SAAS,KAAK,YAC9B,IAAI,KAAK,OAAO,eAAe;GAC7B,gBAAgB,KAAK;GACrB,mBAAmB;EACrB;EAGF,OAAO;GACL,YAAY,KAAK,aAAa;GAC9B;GACA,wBAAwB,oBAAoB,KAAK,aAAa,QAAQ;GACtE;GACA;GACA;GACA;EACF;CACF;AACF;;;;;;AAOA,SAAS,cAAc,OAAmD;CACxE,MAAM,QAAQ,MAAM,MAAM,GAAG,EAAE;CAC/B,IAAI,MAAM,OAAO,SAAS,KAAK,SAAS,cAAc,KAAK,KAAK,SAAS,eAAe,CAAC,GACvF,OAAO;CAET,IAAI,MAAM,OAAO,SAAS,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,YAAY,CAAC,GACjF,OAAO;CAET,OAAO;AACT"}

package/esm/dev-server/extract-translation-keys.mjs

@@ -1,4 +1,4 @@
-import ts from "typescript";
+import { expressionOf, forEachChild, isCallExpression, isIdentifier, isObjectLiteralExpression, isPropertyAssignment, isStringLiteral, keyName, valueText } from "../tooling/syntax/ast.mjs";
 
 //#region ../../packages/core/src/dev-server/extract-translation-keys.ts
 /**
@@ -21,46 +21,45 @@ function extractTranslationKeys(sourceFile) {
 	const keys = /* @__PURE__ */ new Set();
 	const visit = (node) => {
 		if (isGroupedTranslationsCall(node)) collectFromCall(node, keys);
-		ts.forEachChild(node, visit);
+		forEachChild(node, visit);
 	};
-	ts.forEachChild(sourceFile, visit);
+	forEachChild(sourceFile, visit);
 	return Array.from(keys).sort();
 }
 function isGroupedTranslationsCall(node) {
-	return ts.isCallExpression(node) && ts.isIdentifier(node.expression) && node.expression.text === "groupedTranslations";
+	return isCallExpression(node) && isIdentifier(expressionOf(node)) && valueText(expressionOf(node)) === "groupedTranslations";
 }
 function collectFromCall(call, keys) {
 	const [first, second] = call.arguments;
 	if (first === void 0) return;
 	if (second !== void 0) {
-		if (ts.isStringLiteral(first) && ts.isObjectLiteralExpression(second)) collectLeaves(second, first.text, keys);
+		if (isStringLiteral(first) && isObjectLiteralExpression(second)) collectLeaves(second, valueText(first), keys);
 		return;
 	}
-	if (ts.isObjectLiteralExpression(first)) for (const property of first.properties) {
-		if (!ts.isPropertyAssignment(property)) continue;
-		const groupName = getPropertyName(property.name);
+	if (isObjectLiteralExpression(first)) for (const property of first.properties) {
+		if (!isPropertyAssignment(property)) continue;
+		const groupName = getPropertyName(property.key);
 		if (groupName === void 0) continue;
-		if (ts.isObjectLiteralExpression(property.initializer)) collectLeaves(property.initializer, groupName, keys);
+		if (isObjectLiteralExpression(property.value)) collectLeaves(property.value, groupName, keys);
 	}
 }
 function collectLeaves(object, prefix, keys) {
 	for (const property of object.properties) {
-		if (!ts.isPropertyAssignment(property)) continue;
-		const key = getPropertyName(property.name);
+		if (!isPropertyAssignment(property)) continue;
+		const key = getPropertyName(property.key);
 		if (key === void 0) continue;
-		if (!ts.isObjectLiteralExpression(property.initializer)) continue;
+		if (!isObjectLiteralExpression(property.value)) continue;
 		const path = `${prefix}.${key}`;
-		if (isLeaf(property.initializer)) keys.add(path);
-		else collectLeaves(property.initializer, path, keys);
+		if (isLeaf(property.value)) keys.add(path);
+		else collectLeaves(property.value, path, keys);
 	}
 }
 /** A locale map (`{ en: "...", ar: "..." }`) has no object-literal children. */
 function isLeaf(object) {
-	return !object.properties.some((property) => ts.isPropertyAssignment(property) && ts.isObjectLiteralExpression(property.initializer));
+	return !object.properties.some((property) => isPropertyAssignment(property) && isObjectLiteralExpression(property.value));
 }
 function getPropertyName(name) {
-	if (name === void 0) return;
-	if (ts.isIdentifier(name) || ts.isStringLiteral(name) || ts.isNumericLiteral(name)) return name.text;
+	return keyName(name);
 }
 
 //#endregion