@warlock.js/core 5.0.2 → 5.2.0

package/esm/database/seeds/seeder.errors.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"seeder.errors.mjs","names":[],"sources":["../../../../../../../../core/src/database/seeds/seeder.errors.ts"],"sourcesContent":["/**\n * Thrown when a seeder's `dependsOn` references a seeder name that is not\n * registered with the manager. Surfaces the offending dependent + the missing\n * dependency so the misconfiguration is obvious without spelunking.\n */\nexport class UnknownSeederDependencyError extends Error {\n  public constructor(\n    public readonly seeder: string,\n    public readonly dependency: string,\n  ) {\n    super(\n      `Seeder \"${seeder}\" depends on \"${dependency}\", but no seeder with that name is registered.`,\n    );\n    this.name = \"UnknownSeederDependencyError\";\n  }\n}\n\n/**\n * Thrown when the `dependsOn` graph contains a cycle, which would make a\n * deterministic run order impossible. Carries the cycle path for diagnosis.\n */\nexport class SeederDependencyCycleError extends Error {\n  public constructor(public readonly cycle: string[]) {\n    super(`Seeder dependency cycle detected: ${cycle.join(\" -> \")}`);\n    this.name = \"SeederDependencyCycleError\";\n  }\n}\n"],"mappings":";;;;;;AAKA,IAAa,+BAAb,cAAkD,MAAM;CACtD,AAAO,YACL,AAAgB,QAChB,AAAgB,YAChB;EACA,MACE,WAAW,OAAO,gBAAgB,WAAW,+CAC/C;EALgB;EACA;EAKhB,KAAK,OAAO;CACd;AACF;;;;;AAMA,IAAa,6BAAb,cAAgD,MAAM;CACpD,AAAO,YAAY,AAAgB,OAAiB;EAClD,MAAM,qCAAqC,MAAM,KAAK,MAAM,GAAG;EAD9B;EAEjC,KAAK,OAAO;CACd;AACF"}
+{"version":3,"file":"seeder.errors.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/database/seeds/seeder.errors.ts"],"sourcesContent":["/**\n * Thrown when a seeder's `dependsOn` references a seeder name that is not\n * registered with the manager. Surfaces the offending dependent + the missing\n * dependency so the misconfiguration is obvious without spelunking.\n */\nexport class UnknownSeederDependencyError extends Error {\n  public constructor(\n    public readonly seeder: string,\n    public readonly dependency: string,\n  ) {\n    super(\n      `Seeder \"${seeder}\" depends on \"${dependency}\", but no seeder with that name is registered.`,\n    );\n    this.name = \"UnknownSeederDependencyError\";\n  }\n}\n\n/**\n * Thrown when the `dependsOn` graph contains a cycle, which would make a\n * deterministic run order impossible. Carries the cycle path for diagnosis.\n */\nexport class SeederDependencyCycleError extends Error {\n  public constructor(public readonly cycle: string[]) {\n    super(`Seeder dependency cycle detected: ${cycle.join(\" -> \")}`);\n    this.name = \"SeederDependencyCycleError\";\n  }\n}\n"],"mappings":";;;;;;AAKA,IAAa,+BAAb,cAAkD,MAAM;CACtD,AAAO,YACL,AAAgB,QAChB,AAAgB,YAChB;EACA,MACE,WAAW,OAAO,gBAAgB,WAAW,+CAC/C;EALgB;EACA;EAKhB,KAAK,OAAO;CACd;AACF;;;;;AAMA,IAAa,6BAAb,cAAgD,MAAM;CACpD,AAAO,YAAY,AAAgB,OAAiB;EAClD,MAAM,qCAAqC,MAAM,KAAK,MAAM,GAAG;EAD9B;EAEjC,KAAK,OAAO;CACd;AACF"}

package/esm/database/seeds/seeder.mjs

@@ -1,4 +1,4 @@
-//#region ../core/src/database/seeds/seeder.ts
+//#region core/src/database/seeds/seeder.ts
 /**
 * Create a new seeder
 */

package/esm/database/seeds/seeder.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"seeder.mjs","names":[],"sources":["../../../../../../../../core/src/database/seeds/seeder.ts"],"sourcesContent":["import { SeedContext, SeedResult } from \"./types\";\n\nexport type Seeder = {\n  /**\n   * Seed name\n   */\n  name: string;\n  /**\n   * Whether to enable it\n   */\n  enabled?: boolean;\n  /**\n   * Seed description\n   */\n  description?: string;\n  /**\n   * List of dependent seeds to run first\n   */\n  dependsOn?: string[];\n  /**\n   * Whether to run it once\n   */\n  once?: boolean;\n  /**\n   * Seed execution order\n   */\n  order?: number;\n  /**\n   * Batch size.\n   *\n   * Surfaced to `run()` as {@link SeedContext.batchSize} (defaulting to this\n   * value, or `0` when unset) so a seed can forward it to\n   * `Model.createMany(rows, { batchSize })`.\n   */\n  batchSize?: number;\n  /**\n   * Run seed.\n   *\n   * Receives a {@link SeedContext} exposing:\n   * - `track` — registers the records this seed creates so they can be undone\n   *   by `warlock seed --drop`. Auto-derives `recordsCreated` from the track\n   *   count; an explicitly returned {@link SeedResult} is an optional fallback.\n   * - `now` — the injectable clock to read instead of an ambient `new Date()` /\n   *   `dayjs()`, so historical seeds and the seeds-log share one overridable\n   *   clock.\n   * - `batchSize` — the suggested bulk-insert batch size (from this seeder's\n   *   `batchSize`, default `0`).\n   *\n   * The `ctx` parameter is optional at the call site — an existing zero-arg\n   * `run()` keeps working unchanged.\n   */\n  run(ctx: SeedContext): Promise<SeedResult | void>;\n};\n\n/**\n * Create a new seeder\n */\nexport function seeder(seeder: Seeder) {\n  return seeder;\n}\n"],"mappings":";;;;AAyDA,SAAgB,OAAO,QAAgB;CACrC,OAAO;AACT"}
+{"version":3,"file":"seeder.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/database/seeds/seeder.ts"],"sourcesContent":["import { type SeedContext, type SeedResult } from \"./types\";\n\nexport type Seeder = {\n  /**\n   * Seed name\n   */\n  name: string;\n  /**\n   * Whether to enable it\n   */\n  enabled?: boolean;\n  /**\n   * Seed description\n   */\n  description?: string;\n  /**\n   * List of dependent seeds to run first\n   */\n  dependsOn?: string[];\n  /**\n   * Whether to run it once\n   */\n  once?: boolean;\n  /**\n   * Seed execution order\n   */\n  order?: number;\n  /**\n   * Batch size.\n   *\n   * Surfaced to `run()` as {@link SeedContext.batchSize} (defaulting to this\n   * value, or `0` when unset) so a seed can forward it to\n   * `Model.createMany(rows, { batchSize })`.\n   */\n  batchSize?: number;\n  /**\n   * Run seed.\n   *\n   * Receives a {@link SeedContext} exposing:\n   * - `track` — registers the records this seed creates so they can be undone\n   *   by `warlock seed --drop`. Auto-derives `recordsCreated` from the track\n   *   count; an explicitly returned {@link SeedResult} is an optional fallback.\n   * - `now` — the injectable clock to read instead of an ambient `new Date()` /\n   *   `dayjs()`, so historical seeds and the seeds-log share one overridable\n   *   clock.\n   * - `batchSize` — the suggested bulk-insert batch size (from this seeder's\n   *   `batchSize`, default `0`).\n   *\n   * The `ctx` parameter is optional at the call site — an existing zero-arg\n   * `run()` keeps working unchanged.\n   */\n  run(ctx: SeedContext): Promise<SeedResult | void>;\n};\n\n/**\n * Create a new seeder\n */\nexport function seeder(seeder: Seeder) {\n  return seeder;\n}\n"],"mappings":";;;;AAyDA,SAAgB,OAAO,QAAgB;CACrC,OAAO;AACT"}

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

@@ -5,7 +5,7 @@ import { SeedsTableMigration } from "./seeds-table-migration.mjs";
 import { DatabaseWriterValidationError, dataSourceRegistry, migrationRunner, transaction } from "@warlock.js/cascade";
 import { colors } from "@mongez/copper";
 
-//#region ../core/src/database/seeds/seeders.manager.ts
+//#region core/src/database/seeds/seeders.manager.ts
 var SeedersManager = class {
 	constructor(options) {
 		this.options = options;

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

@@ -1 +1 @@
-{"version":3,"file":"seeders.manager.mjs","names":[],"sources":["../../../../../../../../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 { Seeder } from \"./seeder\";\nimport { SeederDependencyCycleError, UnknownSeederDependencyError } from \"./seeder.errors\";\nimport { SeedRecordsTableMigration } from \"./seed-records-table-migration\";\nimport { SeedsTableMigration } from \"./seeds-table-migration\";\nimport {\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  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  protected getMetadata(seeder: Seeder): Promise<SeederMetadata> {\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;CAW1B,AAAO,YAAY,AAAU,SAAiC;EAAjC;iBAVF,CAAC;EAW1B,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;;;;CAKA,AAAU,YAAY,QAAyC;EAG7D,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":["C:/Work/Warlock.js/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 { Seeder } from \"./seeder\";\nimport { SeederDependencyCycleError, UnknownSeederDependencyError } from \"./seeder.errors\";\nimport { SeedRecordsTableMigration } from \"./seed-records-table-migration\";\nimport { SeedsTableMigration } from \"./seeds-table-migration\";\nimport {\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,EAAE,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,EAC3B,MAAM,QAAQ,OAAO,IAAI,EACzB,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,EAAE,MAAM,QAAQ,OAAO,IAAI,EAAE,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/seeds-table-migration.mjs

@@ -1,7 +1,7 @@
 import { seedsTableName } from "./utils.mjs";
 import { Migration } from "@warlock.js/cascade";
 
-//#region ../core/src/database/seeds/seeds-table-migration.ts
+//#region core/src/database/seeds/seeds-table-migration.ts
 var SeedsTableMigration = class extends Migration {
 	constructor(..._args) {
 		super(..._args);
@@ -22,7 +22,7 @@ var SeedsTableMigration = class extends Migration {
 		this.int("lastRunRecordsCreated").default(0);
 	}
 	down() {
-		this.dropTableIfExists(seedsTableName);
+		this.dropTableIfExists();
 	}
 };
 

package/esm/database/seeds/seeds-table-migration.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"seeds-table-migration.mjs","names":[],"sources":["../../../../../../../../core/src/database/seeds/seeds-table-migration.ts"],"sourcesContent":["import { Migration } from \"@warlock.js/cascade\";\nimport { seedsTableName } from \"./utils\";\n\nexport class SeedsTableMigration extends Migration {\n  public static migrationName = \"seeds-table-migration\";\n  public table = seedsTableName;\n\n  public up() {\n    this.createTableIfNotExists();\n\n    this.id();\n    this.text(\"name\").unique();\n    this.int(\"runCount\").default(0);\n    this.dateTime(\"createdAt\").useCurrent();\n    this.dateTime(\"firstRunAt\").useCurrent();\n    this.dateTime(\"lastRunAt\").useCurrent();\n    this.int(\"totalRecordsCreated\").default(0);\n    this.int(\"lastRunRecordsCreated\").default(0);\n  }\n\n  public down() {\n    this.dropTableIfExists(seedsTableName);\n  }\n}\n"],"mappings":";;;;AAGA,IAAa,sBAAb,cAAyC,UAAU;;;eAElC;;;uBADe;;CAG9B,AAAO,KAAK;EACV,KAAK,uBAAuB;EAE5B,KAAK,GAAG;EACR,KAAK,KAAK,MAAM,CAAC,CAAC,OAAO;EACzB,KAAK,IAAI,UAAU,CAAC,CAAC,QAAQ,CAAC;EAC9B,KAAK,SAAS,WAAW,CAAC,CAAC,WAAW;EACtC,KAAK,SAAS,YAAY,CAAC,CAAC,WAAW;EACvC,KAAK,SAAS,WAAW,CAAC,CAAC,WAAW;EACtC,KAAK,IAAI,qBAAqB,CAAC,CAAC,QAAQ,CAAC;EACzC,KAAK,IAAI,uBAAuB,CAAC,CAAC,QAAQ,CAAC;CAC7C;CAEA,AAAO,OAAO;EACZ,KAAK,kBAAkB,cAAc;CACvC;AACF"}
+{"version":3,"file":"seeds-table-migration.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/database/seeds/seeds-table-migration.ts"],"sourcesContent":["import { Migration } from \"@warlock.js/cascade\";\nimport { seedsTableName } from \"./utils\";\n\nexport class SeedsTableMigration extends Migration {\n  public static migrationName = \"seeds-table-migration\";\n  public table = seedsTableName;\n\n  public up() {\n    this.createTableIfNotExists();\n\n    this.id();\n    this.text(\"name\").unique();\n    this.int(\"runCount\").default(0);\n    this.dateTime(\"createdAt\").useCurrent();\n    this.dateTime(\"firstRunAt\").useCurrent();\n    this.dateTime(\"lastRunAt\").useCurrent();\n    this.int(\"totalRecordsCreated\").default(0);\n    this.int(\"lastRunRecordsCreated\").default(0);\n  }\n\n  public down() {\n    // No argument: dropTableIfExists() operates on `this.table`, set as a class\n    // field above. The name passed here was silently ignored at runtime.\n    this.dropTableIfExists();\n  }\n}\n"],"mappings":";;;;AAGA,IAAa,sBAAb,cAAyC,UAAU;;;eAElC;;;uBADe;;CAG9B,AAAO,KAAK;EACV,KAAK,uBAAuB;EAE5B,KAAK,GAAG;EACR,KAAK,KAAK,MAAM,EAAE,OAAO;EACzB,KAAK,IAAI,UAAU,EAAE,QAAQ,CAAC;EAC9B,KAAK,SAAS,WAAW,EAAE,WAAW;EACtC,KAAK,SAAS,YAAY,EAAE,WAAW;EACvC,KAAK,SAAS,WAAW,EAAE,WAAW;EACtC,KAAK,IAAI,qBAAqB,EAAE,QAAQ,CAAC;EACzC,KAAK,IAAI,uBAAuB,EAAE,QAAQ,CAAC;CAC7C;CAEA,AAAO,OAAO;EAGZ,KAAK,kBAAkB;CACzB;AACF"}

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

@@ -1,4 +1,4 @@
-//#region ../core/src/database/seeds/types.d.ts
+//#region core/src/database/seeds/types.d.ts
 type SeedResult = {
   recordsCreated: number;
 };

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

@@ -1 +1 @@
-{"version":3,"file":"types.d.mts","names":[],"sources":["../../../../../../../../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":["C:/Work/Warlock.js/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"}

package/esm/database/seeds/utils.mjs

@@ -1,4 +1,4 @@
-//#region ../core/src/database/seeds/utils.ts
+//#region core/src/database/seeds/utils.ts
 const seedsTableName = "_seeds";
 /**
 * Table that stores per-record references created by seeders, written via the

package/esm/database/seeds/utils.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"utils.mjs","names":[],"sources":["../../../../../../../../core/src/database/seeds/utils.ts"],"sourcesContent":["export const seedsTableName = \"_seeds\";\n\n/**\n * Table that stores per-record references created by seeders, written via the\n * `track` helper. Backs `warlock seed --drop`.\n */\nexport const seedRecordsTableName = \"_seed_records\";\n"],"mappings":";AAAA,MAAa,iBAAiB;;;;;AAM9B,MAAa,uBAAuB"}
+{"version":3,"file":"utils.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/database/seeds/utils.ts"],"sourcesContent":["export const seedsTableName = \"_seeds\";\n\n/**\n * Table that stores per-record references created by seeders, written via the\n * `track` helper. Backs `warlock seed --drop`.\n */\nexport const seedRecordsTableName = \"_seed_records\";\n"],"mappings":";AAAA,MAAa,iBAAiB;;;;;AAM9B,MAAa,uBAAuB"}

package/esm/database/utils.d.mts

@@ -1,7 +1,7 @@
 import { ComputedCallback, SchemaContext } from "@warlock.js/seal";
 import { Model } from "@warlock.js/cascade";
 
-//#region ../core/src/database/utils.d.ts
+//#region core/src/database/utils.d.ts
 /**
  * Hash password on saving if password changes
  */

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

@@ -1 +1 @@
-{"version":3,"file":"utils.d.mts","names":[],"sources":["../../../../../../../core/src/database/utils.ts"],"mappings":";;;;;;AASA;cAAa,iBAAA,mCAAiB,mBAO1B;AAAA,KAEC,qBAAA,IACH,IAAA,OACA,KAAA,EAAO,KAAA,EACP,OAAA,EAAS,aAAA,WACA,OAAA;;AANP;AAAC;iBAWW,gBAAA,CAAiB,QAAA,EAAU,qBAAA,GAAqB,gBAAA;;;;iBAWhD,eAAA,CAAgB,KAAA,WAAiB,KAAA,0BAAuC,gBAAA"}
+{"version":3,"file":"utils.d.mts","names":[],"sources":["C:/Work/Warlock.js/core/src/database/utils.ts"],"mappings":";;;;;;AASA;cAAa,iBAAA,mCAAiB,mBAO1B;AAAA,KAEC,qBAAA,IACH,IAAA,OACA,KAAA,EAAO,KAAA,EACP,OAAA,EAAS,aAAA,WACA,OAAA;;AANP;AAAC;iBAWW,gBAAA,CAAiB,QAAA,EAAU,qBAAA,GAAqB,gBAAA;;;;iBAWhD,eAAA,CAAgB,KAAA,WAAiB,KAAA,0BAAuC,gBAAA"}

package/esm/database/utils.mjs

@@ -3,7 +3,7 @@ import { slugify } from "@mongez/slug";
 import { get } from "@mongez/reinforcements";
 import { authService } from "@warlock.js/auth";
 
-//#region ../core/src/database/utils.ts
+//#region core/src/database/utils.ts
 /**
 * Hash password on saving if password changes
 */

package/esm/database/utils.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"utils.mjs","names":[],"sources":["../../../../../../../core/src/database/utils.ts"],"sourcesContent":["import { get } from \"@mongez/reinforcements\";\nimport { slugify } from \"@mongez/slug\";\nimport { authService } from \"@warlock.js/auth\";\nimport { Model, useModelTransformer } from \"@warlock.js/cascade\";\nimport { ComputedCallback, SchemaContext } from \"@warlock.js/seal\";\n\n/**\n * Hash password on saving if password changes\n */\nexport const useHashedPassword = () =>\n  useModelTransformer(({ value, isChanged, isNew }) => {\n    if (!value) return value;\n\n    if (!isNew && !isChanged) return value;\n\n    return authService.hashPassword(String(value));\n  });\n\ntype ComputedCallbackModel = (\n  data: any,\n  model: Model,\n  context: SchemaContext,\n) => any | Promise<any>;\n\n/**\n * Generate computed value based on other fields\n */\nexport function useComputedModel(callback: ComputedCallbackModel) {\n  const computedCallback: ComputedCallback = (data, context) => {\n    return callback(data, context.rootContext!.model, context);\n  };\n\n  return computedCallback;\n}\n\n/**\n * Generate slug based on a field on saving\n */\nexport function useComputedSlug(field = \"title\", scope: \"global\" | \"sibling\" = \"sibling\") {\n  return useComputedModel((data, model, context) => {\n    const value = scope === \"sibling\" ? data[field] : get(context.allValues, field);\n\n    if (!value) return model.get(field);\n\n    return slugify(value);\n  });\n}\n"],"mappings":";;;;;;;;;AASA,MAAa,0BACX,qBAAqB,EAAE,OAAO,WAAW,YAAY;CACnD,IAAI,CAAC,OAAO,OAAO;CAEnB,IAAI,CAAC,SAAS,CAAC,WAAW,OAAO;CAEjC,OAAO,YAAY,aAAa,OAAO,KAAK,CAAC;AAC/C,CAAC;;;;AAWH,SAAgB,iBAAiB,UAAiC;CAChE,MAAM,oBAAsC,MAAM,YAAY;EAC5D,OAAO,SAAS,MAAM,QAAQ,YAAa,OAAO,OAAO;CAC3D;CAEA,OAAO;AACT;;;;AAKA,SAAgB,gBAAgB,QAAQ,SAAS,QAA8B,WAAW;CACxF,OAAO,kBAAkB,MAAM,OAAO,YAAY;EAChD,MAAM,QAAQ,UAAU,YAAY,KAAK,SAAS,IAAI,QAAQ,WAAW,KAAK;EAE9E,IAAI,CAAC,OAAO,OAAO,MAAM,IAAI,KAAK;EAElC,OAAO,QAAQ,KAAK;CACtB,CAAC;AACH"}
+{"version":3,"file":"utils.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/database/utils.ts"],"sourcesContent":["import { get } from \"@mongez/reinforcements\";\nimport { slugify } from \"@mongez/slug\";\nimport { authService } from \"@warlock.js/auth\";\nimport { Model, useModelTransformer } from \"@warlock.js/cascade\";\nimport { type ComputedCallback, type SchemaContext } from \"@warlock.js/seal\";\n\n/**\n * Hash password on saving if password changes\n */\nexport const useHashedPassword = () =>\n  useModelTransformer(({ value, isChanged, isNew }) => {\n    if (!value) return value;\n\n    if (!isNew && !isChanged) return value;\n\n    return authService.hashPassword(String(value));\n  });\n\ntype ComputedCallbackModel = (\n  data: any,\n  model: Model,\n  context: SchemaContext,\n) => any | Promise<any>;\n\n/**\n * Generate computed value based on other fields\n */\nexport function useComputedModel(callback: ComputedCallbackModel) {\n  const computedCallback: ComputedCallback = (data, context) => {\n    return callback(data, context.rootContext!.model, context);\n  };\n\n  return computedCallback;\n}\n\n/**\n * Generate slug based on a field on saving\n */\nexport function useComputedSlug(field = \"title\", scope: \"global\" | \"sibling\" = \"sibling\") {\n  return useComputedModel((data, model, context) => {\n    const value = scope === \"sibling\" ? data[field] : get(context.allValues, field);\n\n    if (!value) return model.get(field);\n\n    return slugify(value);\n  });\n}\n"],"mappings":";;;;;;;;;AASA,MAAa,0BACX,qBAAqB,EAAE,OAAO,WAAW,YAAY;CACnD,IAAI,CAAC,OAAO,OAAO;CAEnB,IAAI,CAAC,SAAS,CAAC,WAAW,OAAO;CAEjC,OAAO,YAAY,aAAa,OAAO,KAAK,CAAC;AAC/C,CAAC;;;;AAWH,SAAgB,iBAAiB,UAAiC;CAChE,MAAM,oBAAsC,MAAM,YAAY;EAC5D,OAAO,SAAS,MAAM,QAAQ,YAAa,OAAO,OAAO;CAC3D;CAEA,OAAO;AACT;;;;AAKA,SAAgB,gBAAgB,QAAQ,SAAS,QAA8B,WAAW;CACxF,OAAO,kBAAkB,MAAM,OAAO,YAAY;EAChD,MAAM,QAAQ,UAAU,YAAY,KAAK,SAAS,IAAI,QAAQ,WAAW,KAAK;EAE9E,IAAI,CAAC,OAAO,OAAO,MAAM,IAAI,KAAK;EAElC,OAAO,QAAQ,KAAK;CACtB,CAAC;AACH"}

package/esm/dev-server/check-for-updates.mjs

@@ -9,7 +9,7 @@ import { devServerShortcuts } from "./shortcuts.mjs";
 import { clearCachedLatestVersion, readCachedLatestVersion, writeCachedLatestVersion } from "./update-check-cache.mjs";
 import { colors } from "@mongez/copper";
 
-//#region ../core/src/dev-server/check-for-updates.ts
+//#region core/src/dev-server/check-for-updates.ts
 /** The package whose version represents the whole (lockstep) family. */
 const CORE_PACKAGE = "@warlock.js/core";
 /** Where developers can read what changed between releases. */

package/esm/dev-server/check-for-updates.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"check-for-updates.mjs","names":[],"sources":["../../../../../../../core/src/dev-server/check-for-updates.ts"],"sourcesContent":["import { colors } from \"@mongez/copper\";\nimport { updateWarlockPackages } from \"../updater/update-warlock-packages\";\nimport { getWarlockVersion } from \"../utils/framework-vesion\";\nimport { fetchLatestVersion } from \"../utils/npm-registry\";\nimport { isNewerVersion } from \"../utils/version-compare\";\nimport { warlockConfigManager } from \"../warlock-config\";\nimport type { DevelopmentServer } from \"./development-server\";\nimport { restartDevServer } from \"./restart-dev-server\";\nimport { devServerShortcuts } from \"./shortcuts\";\nimport {\n  clearCachedLatestVersion,\n  readCachedLatestVersion,\n  writeCachedLatestVersion,\n} from \"./update-check-cache\";\n\n/** The package whose version represents the whole (lockstep) family. */\nconst CORE_PACKAGE = \"@warlock.js/core\";\n\n/** Where developers can read what changed between releases. */\nconst CHANGELOG_URL = \"https://warlock.js.org/changelog/\";\n\n/** The key that applies the update without leaving the dev server. */\nconst UPDATE_SHORTCUT_KEY = \"u\";\n\n/**\n * Abort budget for the notice's registry lookup. Deliberately much shorter\n * than the `warlock update` command's: nobody is waiting on this answer, and\n * a network that hangs (captive portal, dead VPN, flaky DNS) must not leave a\n * pending request and a live timer sitting around behind a running dev server.\n */\nconst UPDATE_CHECK_TIMEOUT_MS = 5_000;\n\n/**\n * Check npm for a newer `@warlock.js/core` release and, if one exists, print\n * a short non-blocking notice to the terminal. Because the whole family is\n * released in lockstep, core's version stands in for every `@warlock.js/*`\n * package, so a single lookup is enough.\n *\n * When a `devServer` is passed and the terminal is interactive, the notice\n * also arms the `u` shortcut: one keypress updates every `@warlock.js/*`\n * dependency, installs, and restarts the server.\n *\n * Designed to be called fire-and-forget once the dev server is ready: it\n * never throws, never blocks startup, and stays silent unless there is a\n * genuinely newer version to report. Automatically skipped in CI, in\n * non-interactive (non-TTY) shells, and when `devServer.checkForUpdates` is\n * set to `false`.\n */\nexport async function checkForFrameworkUpdate(devServer?: DevelopmentServer): Promise<void> {\n  try {\n    if (!isUpdateCheckEnabled()) {\n      return;\n    }\n\n    const devServerConfig = await warlockConfigManager.get(\"devServer\");\n\n    if (devServerConfig?.checkForUpdates === false) {\n      return;\n    }\n\n    const currentVersion = await getWarlockVersion();\n    const latestVersion = await resolveLatestVersion();\n\n    if (!latestVersion || !isNewerVersion(latestVersion, currentVersion)) {\n      return;\n    }\n\n    printUpdateNotice(currentVersion, latestVersion, offerUpdateShortcut(devServer));\n  } catch {\n    // An update check is a convenience — never let it disrupt the dev server.\n  }\n}\n\n/**\n * The latest published core version, preferring a recent cached answer over a\n * network round-trip. Every `warlock dev` boot would otherwise hit npm, which\n * is a lot of traffic for a question whose answer changes a few times a month.\n */\nasync function resolveLatestVersion(): Promise<string | undefined> {\n  const cached = await readCachedLatestVersion();\n\n  if (cached) {\n    return cached;\n  }\n\n  const latestVersion = await fetchLatestVersion(CORE_PACKAGE, UPDATE_CHECK_TIMEOUT_MS);\n\n  // A failed lookup is deliberately NOT cached as \"no version\" — that would\n  // silence the notice for a day over one flaky moment. Only real answers are\n  // remembered; offline simply re-asks next boot.\n  if (latestVersion) {\n    await writeCachedLatestVersion(latestVersion);\n  }\n\n  return latestVersion;\n}\n\n/**\n * Whether an update check should run at all in the current environment.\n * Mirrors npm's own update-notifier conventions: stay quiet in CI, in\n * non-interactive shells, and when explicitly opted out via env.\n */\nfunction isUpdateCheckEnabled(): boolean {\n  if (process.env.CI) {\n    return false;\n  }\n\n  if (process.env.NO_UPDATE_NOTIFIER) {\n    return false;\n  }\n\n  if (!process.stdout.isTTY) {\n    return false;\n  }\n\n  return true;\n}\n\n/**\n * Arm the `u` shortcut, if there is a server to restart and a terminal that\n * can deliver keypresses. Returns whether the notice may advertise it.\n */\nfunction offerUpdateShortcut(devServer?: DevelopmentServer): boolean {\n  if (!devServer) {\n    return false;\n  }\n\n  return devServerShortcuts.register({\n    key: UPDATE_SHORTCUT_KEY,\n    description: \"update @warlock.js packages and restart\",\n    handler: () => updateAndRestart(devServer),\n  });\n}\n\n/**\n * The `u` handler: rewrite the `@warlock.js/*` versions, install them, and\n * come back up on the new ones.\n *\n * The shortcut is dropped and the terminal released first, so the package\n * manager child owns stdin (and a second `u` can't stack a parallel install).\n * Releasing has to be explicit: the standing shortcut bar keeps other keys\n * registered, so dropping `u` alone would leave us in raw mode.\n *\n * The terminal is taken back — and `u` re-armed — only for the cases worth\n * retrying: an unreachable registry, or a restart that could not be started.\n */\nasync function updateAndRestart(devServer: DevelopmentServer): Promise<void> {\n  devServerShortcuts.unregister(UPDATE_SHORTCUT_KEY);\n  devServerShortcuts.release();\n\n  console.log();\n\n  const result = await updateWarlockPackages();\n\n  if (result.outcome === \"updated\") {\n    // The remembered answer described the version we just replaced.\n    await clearCachedLatestVersion();\n\n    const restarted = await restartDevServer(devServer);\n\n    if (!restarted) {\n      devServerShortcuts.resume();\n      console.log(`     ${colors.dim(\"Restart the dev server manually to load the new version.\")}`);\n    }\n\n    return;\n  }\n\n  devServerShortcuts.resume();\n\n  if (result.outcome === \"registry-unreachable\") {\n    printShortcutRetryHint();\n    offerUpdateShortcut(devServer);\n    return;\n  }\n\n  // Anything else — a failed install, or a notice that turned out to be stale —\n  // leaves the shortcut off on purpose: package.json is already rewritten, so a\n  // second `u` would just report \"up to date\" and hide the real problem.\n}\n\n/**\n * Print the \"update available\" notice in the dev-logger's visual style.\n *\n * @param canPressKey Whether the `u` shortcut is armed. When it is not (piped\n *                    stdin, CI, a supervisor), fall back to the command the\n *                    developer can run by hand.\n */\nfunction printUpdateNotice(\n  currentVersion: string,\n  latestVersion: string,\n  canPressKey: boolean,\n): void {\n  console.log();\n  console.log(\n    `  ${colors.yellow(\"⚡\")} ${colors.bold(\"A new version of Warlock.js is available\")}  ` +\n      `${colors.dim(currentVersion)} ${colors.dim(\"→\")} ${colors.greenBright(latestVersion)}`,\n  );\n\n  if (canPressKey) {\n    console.log(\n      `     ${colors.dim(\"Press\")} ${colors.bold(colors.cyan(UPDATE_SHORTCUT_KEY))} ` +\n        `${colors.dim(\"to update all @warlock.js packages and restart\")}`,\n    );\n  } else {\n    console.log(\n      `     ${colors.dim(\"Run\")} ${colors.cyan(\"npx warlock update\")} ` +\n        `${colors.dim(\"to update all @warlock.js packages\")}`,\n    );\n  }\n\n  console.log(`     ${colors.dim(\"Changelog\")} ${colors.cyan(CHANGELOG_URL)}`);\n  console.log();\n}\n\n/** Tell the developer the shortcut is still available after a failed try. */\nfunction printShortcutRetryHint(): void {\n  console.log(\n    `     ${colors.dim(\"Press\")} ${colors.bold(colors.cyan(UPDATE_SHORTCUT_KEY))} ` +\n      `${colors.dim(\"to try again once you are back online\")}`,\n  );\n  console.log();\n}\n"],"mappings":";;;;;;;;;;;;;AAgBA,MAAM,eAAe;;AAGrB,MAAM,gBAAgB;;AAGtB,MAAM,sBAAsB;;;;;;;AAQ5B,MAAM,0BAA0B;;;;;;;;;;;;;;;;;AAkBhC,eAAsB,wBAAwB,WAA8C;CAC1F,IAAI;EACF,IAAI,CAAC,qBAAqB,GACxB;EAKF,KAAI,MAF0B,qBAAqB,IAAI,WAAW,EAE/C,EAAE,oBAAoB,OACvC;EAGF,MAAM,iBAAiB,MAAM,kBAAkB;EAC/C,MAAM,gBAAgB,MAAM,qBAAqB;EAEjD,IAAI,CAAC,iBAAiB,CAAC,eAAe,eAAe,cAAc,GACjE;EAGF,kBAAkB,gBAAgB,eAAe,oBAAoB,SAAS,CAAC;CACjF,QAAQ,CAER;AACF;;;;;;AAOA,eAAe,uBAAoD;CACjE,MAAM,SAAS,MAAM,wBAAwB;CAE7C,IAAI,QACF,OAAO;CAGT,MAAM,gBAAgB,MAAM,mBAAmB,cAAc,uBAAuB;CAKpF,IAAI,eACF,MAAM,yBAAyB,aAAa;CAG9C,OAAO;AACT;;;;;;AAOA,SAAS,uBAAgC;CACvC,IAAI,QAAQ,IAAI,IACd,OAAO;CAGT,IAAI,QAAQ,IAAI,oBACd,OAAO;CAGT,IAAI,CAAC,QAAQ,OAAO,OAClB,OAAO;CAGT,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,WAAwC;CACnE,IAAI,CAAC,WACH,OAAO;CAGT,OAAO,mBAAmB,SAAS;EACjC,KAAK;EACL,aAAa;EACb,eAAe,iBAAiB,SAAS;CAC3C,CAAC;AACH;;;;;;;;;;;;;AAcA,eAAe,iBAAiB,WAA6C;CAC3E,mBAAmB,WAAW,mBAAmB;CACjD,mBAAmB,QAAQ;CAE3B,QAAQ,IAAI;CAEZ,MAAM,SAAS,MAAM,sBAAsB;CAE3C,IAAI,OAAO,YAAY,WAAW;EAEhC,MAAM,yBAAyB;EAI/B,IAAI,CAAC,MAFmB,iBAAiB,SAAS,GAElC;GACd,mBAAmB,OAAO;GAC1B,QAAQ,IAAI,QAAQ,OAAO,IAAI,0DAA0D,GAAG;EAC9F;EAEA;CACF;CAEA,mBAAmB,OAAO;CAE1B,IAAI,OAAO,YAAY,wBAAwB;EAC7C,uBAAuB;EACvB,oBAAoB,SAAS;EAC7B;CACF;AAKF;;;;;;;;AASA,SAAS,kBACP,gBACA,eACA,aACM;CACN,QAAQ,IAAI;CACZ,QAAQ,IACN,KAAK,OAAO,OAAO,GAAG,EAAE,GAAG,OAAO,KAAK,0CAA0C,EAAE,IAC9E,OAAO,IAAI,cAAc,EAAE,GAAG,OAAO,IAAI,GAAG,EAAE,GAAG,OAAO,YAAY,aAAa,GACxF;CAEA,IAAI,aACF,QAAQ,IACN,QAAQ,OAAO,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,OAAO,KAAK,mBAAmB,CAAC,EAAE,GACxE,OAAO,IAAI,gDAAgD,GAClE;MAEA,QAAQ,IACN,QAAQ,OAAO,IAAI,KAAK,EAAE,GAAG,OAAO,KAAK,oBAAoB,EAAE,GAC1D,OAAO,IAAI,oCAAoC,GACtD;CAGF,QAAQ,IAAI,QAAQ,OAAO,IAAI,WAAW,EAAE,GAAG,OAAO,KAAK,aAAa,GAAG;CAC3E,QAAQ,IAAI;AACd;;AAGA,SAAS,yBAA+B;CACtC,QAAQ,IACN,QAAQ,OAAO,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,OAAO,KAAK,mBAAmB,CAAC,EAAE,GACxE,OAAO,IAAI,uCAAuC,GACzD;CACA,QAAQ,IAAI;AACd"}
+{"version":3,"file":"check-for-updates.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/dev-server/check-for-updates.ts"],"sourcesContent":["import { colors } from \"@mongez/copper\";\nimport { updateWarlockPackages } from \"../updater/update-warlock-packages\";\nimport { getWarlockVersion } from \"../utils/framework-vesion\";\nimport { fetchLatestVersion } from \"../utils/npm-registry\";\nimport { isNewerVersion } from \"../utils/version-compare\";\nimport { warlockConfigManager } from \"../warlock-config\";\nimport type { DevelopmentServer } from \"./development-server\";\nimport { restartDevServer } from \"./restart-dev-server\";\nimport { devServerShortcuts } from \"./shortcuts\";\nimport {\n  clearCachedLatestVersion,\n  readCachedLatestVersion,\n  writeCachedLatestVersion,\n} from \"./update-check-cache\";\n\n/** The package whose version represents the whole (lockstep) family. */\nconst CORE_PACKAGE = \"@warlock.js/core\";\n\n/** Where developers can read what changed between releases. */\nconst CHANGELOG_URL = \"https://warlock.js.org/changelog/\";\n\n/** The key that applies the update without leaving the dev server. */\nconst UPDATE_SHORTCUT_KEY = \"u\";\n\n/**\n * Abort budget for the notice's registry lookup. Deliberately much shorter\n * than the `warlock update` command's: nobody is waiting on this answer, and\n * a network that hangs (captive portal, dead VPN, flaky DNS) must not leave a\n * pending request and a live timer sitting around behind a running dev server.\n */\nconst UPDATE_CHECK_TIMEOUT_MS = 5_000;\n\n/**\n * Check npm for a newer `@warlock.js/core` release and, if one exists, print\n * a short non-blocking notice to the terminal. Because the whole family is\n * released in lockstep, core's version stands in for every `@warlock.js/*`\n * package, so a single lookup is enough.\n *\n * When a `devServer` is passed and the terminal is interactive, the notice\n * also arms the `u` shortcut: one keypress updates every `@warlock.js/*`\n * dependency, installs, and restarts the server.\n *\n * Designed to be called fire-and-forget once the dev server is ready: it\n * never throws, never blocks startup, and stays silent unless there is a\n * genuinely newer version to report. Automatically skipped in CI, in\n * non-interactive (non-TTY) shells, and when `devServer.checkForUpdates` is\n * set to `false`.\n */\nexport async function checkForFrameworkUpdate(devServer?: DevelopmentServer): Promise<void> {\n  try {\n    if (!isUpdateCheckEnabled()) {\n      return;\n    }\n\n    const devServerConfig = await warlockConfigManager.get(\"devServer\");\n\n    if (devServerConfig?.checkForUpdates === false) {\n      return;\n    }\n\n    const currentVersion = await getWarlockVersion();\n    const latestVersion = await resolveLatestVersion();\n\n    if (!latestVersion || !isNewerVersion(latestVersion, currentVersion)) {\n      return;\n    }\n\n    printUpdateNotice(currentVersion, latestVersion, offerUpdateShortcut(devServer));\n  } catch {\n    // An update check is a convenience — never let it disrupt the dev server.\n  }\n}\n\n/**\n * The latest published core version, preferring a recent cached answer over a\n * network round-trip. Every `warlock dev` boot would otherwise hit npm, which\n * is a lot of traffic for a question whose answer changes a few times a month.\n */\nasync function resolveLatestVersion(): Promise<string | undefined> {\n  const cached = await readCachedLatestVersion();\n\n  if (cached) {\n    return cached;\n  }\n\n  const latestVersion = await fetchLatestVersion(CORE_PACKAGE, UPDATE_CHECK_TIMEOUT_MS);\n\n  // A failed lookup is deliberately NOT cached as \"no version\" — that would\n  // silence the notice for a day over one flaky moment. Only real answers are\n  // remembered; offline simply re-asks next boot.\n  if (latestVersion) {\n    await writeCachedLatestVersion(latestVersion);\n  }\n\n  return latestVersion;\n}\n\n/**\n * Whether an update check should run at all in the current environment.\n * Mirrors npm's own update-notifier conventions: stay quiet in CI, in\n * non-interactive shells, and when explicitly opted out via env.\n */\nfunction isUpdateCheckEnabled(): boolean {\n  if (process.env.CI) {\n    return false;\n  }\n\n  if (process.env.NO_UPDATE_NOTIFIER) {\n    return false;\n  }\n\n  if (!process.stdout.isTTY) {\n    return false;\n  }\n\n  return true;\n}\n\n/**\n * Arm the `u` shortcut, if there is a server to restart and a terminal that\n * can deliver keypresses. Returns whether the notice may advertise it.\n */\nfunction offerUpdateShortcut(devServer?: DevelopmentServer): boolean {\n  if (!devServer) {\n    return false;\n  }\n\n  return devServerShortcuts.register({\n    key: UPDATE_SHORTCUT_KEY,\n    description: \"update @warlock.js packages and restart\",\n    handler: () => updateAndRestart(devServer),\n  });\n}\n\n/**\n * The `u` handler: rewrite the `@warlock.js/*` versions, install them, and\n * come back up on the new ones.\n *\n * The shortcut is dropped and the terminal released first, so the package\n * manager child owns stdin (and a second `u` can't stack a parallel install).\n * Releasing has to be explicit: the standing shortcut bar keeps other keys\n * registered, so dropping `u` alone would leave us in raw mode.\n *\n * The terminal is taken back — and `u` re-armed — only for the cases worth\n * retrying: an unreachable registry, or a restart that could not be started.\n */\nasync function updateAndRestart(devServer: DevelopmentServer): Promise<void> {\n  devServerShortcuts.unregister(UPDATE_SHORTCUT_KEY);\n  devServerShortcuts.release();\n\n  console.log();\n\n  const result = await updateWarlockPackages();\n\n  if (result.outcome === \"updated\") {\n    // The remembered answer described the version we just replaced.\n    await clearCachedLatestVersion();\n\n    const restarted = await restartDevServer(devServer);\n\n    if (!restarted) {\n      devServerShortcuts.resume();\n      console.log(`     ${colors.dim(\"Restart the dev server manually to load the new version.\")}`);\n    }\n\n    return;\n  }\n\n  devServerShortcuts.resume();\n\n  if (result.outcome === \"registry-unreachable\") {\n    printShortcutRetryHint();\n    offerUpdateShortcut(devServer);\n    return;\n  }\n\n  // Anything else — a failed install, or a notice that turned out to be stale —\n  // leaves the shortcut off on purpose: package.json is already rewritten, so a\n  // second `u` would just report \"up to date\" and hide the real problem.\n}\n\n/**\n * Print the \"update available\" notice in the dev-logger's visual style.\n *\n * @param canPressKey Whether the `u` shortcut is armed. When it is not (piped\n *                    stdin, CI, a supervisor), fall back to the command the\n *                    developer can run by hand.\n */\nfunction printUpdateNotice(\n  currentVersion: string,\n  latestVersion: string,\n  canPressKey: boolean,\n): void {\n  console.log();\n  console.log(\n    `  ${colors.yellow(\"⚡\")} ${colors.bold(\"A new version of Warlock.js is available\")}  ` +\n      `${colors.dim(currentVersion)} ${colors.dim(\"→\")} ${colors.greenBright(latestVersion)}`,\n  );\n\n  if (canPressKey) {\n    console.log(\n      `     ${colors.dim(\"Press\")} ${colors.bold(colors.cyan(UPDATE_SHORTCUT_KEY))} ` +\n        `${colors.dim(\"to update all @warlock.js packages and restart\")}`,\n    );\n  } else {\n    console.log(\n      `     ${colors.dim(\"Run\")} ${colors.cyan(\"npx warlock update\")} ` +\n        `${colors.dim(\"to update all @warlock.js packages\")}`,\n    );\n  }\n\n  console.log(`     ${colors.dim(\"Changelog\")} ${colors.cyan(CHANGELOG_URL)}`);\n  console.log();\n}\n\n/** Tell the developer the shortcut is still available after a failed try. */\nfunction printShortcutRetryHint(): void {\n  console.log(\n    `     ${colors.dim(\"Press\")} ${colors.bold(colors.cyan(UPDATE_SHORTCUT_KEY))} ` +\n      `${colors.dim(\"to try again once you are back online\")}`,\n  );\n  console.log();\n}\n"],"mappings":";;;;;;;;;;;;;AAgBA,MAAM,eAAe;;AAGrB,MAAM,gBAAgB;;AAGtB,MAAM,sBAAsB;;;;;;;AAQ5B,MAAM,0BAA0B;;;;;;;;;;;;;;;;;AAkBhC,eAAsB,wBAAwB,WAA8C;CAC1F,IAAI;EACF,IAAI,CAAC,qBAAqB,GACxB;EAKF,KAAI,MAF0B,qBAAqB,IAAI,WAAW,IAE7C,oBAAoB,OACvC;EAGF,MAAM,iBAAiB,MAAM,kBAAkB;EAC/C,MAAM,gBAAgB,MAAM,qBAAqB;EAEjD,IAAI,CAAC,iBAAiB,CAAC,eAAe,eAAe,cAAc,GACjE;EAGF,kBAAkB,gBAAgB,eAAe,oBAAoB,SAAS,CAAC;CACjF,QAAQ,CAER;AACF;;;;;;AAOA,eAAe,uBAAoD;CACjE,MAAM,SAAS,MAAM,wBAAwB;CAE7C,IAAI,QACF,OAAO;CAGT,MAAM,gBAAgB,MAAM,mBAAmB,cAAc,uBAAuB;CAKpF,IAAI,eACF,MAAM,yBAAyB,aAAa;CAG9C,OAAO;AACT;;;;;;AAOA,SAAS,uBAAgC;CACvC,IAAI,QAAQ,IAAI,IACd,OAAO;CAGT,IAAI,QAAQ,IAAI,oBACd,OAAO;CAGT,IAAI,CAAC,QAAQ,OAAO,OAClB,OAAO;CAGT,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,WAAwC;CACnE,IAAI,CAAC,WACH,OAAO;CAGT,OAAO,mBAAmB,SAAS;EACjC,KAAK;EACL,aAAa;EACb,eAAe,iBAAiB,SAAS;CAC3C,CAAC;AACH;;;;;;;;;;;;;AAcA,eAAe,iBAAiB,WAA6C;CAC3E,mBAAmB,WAAW,mBAAmB;CACjD,mBAAmB,QAAQ;CAE3B,QAAQ,IAAI;CAEZ,MAAM,SAAS,MAAM,sBAAsB;CAE3C,IAAI,OAAO,YAAY,WAAW;EAEhC,MAAM,yBAAyB;EAI/B,IAAI,CAAC,MAFmB,iBAAiB,SAAS,GAElC;GACd,mBAAmB,OAAO;GAC1B,QAAQ,IAAI,QAAQ,OAAO,IAAI,0DAA0D,GAAG;EAC9F;EAEA;CACF;CAEA,mBAAmB,OAAO;CAE1B,IAAI,OAAO,YAAY,wBAAwB;EAC7C,uBAAuB;EACvB,oBAAoB,SAAS;EAC7B;CACF;AAKF;;;;;;;;AASA,SAAS,kBACP,gBACA,eACA,aACM;CACN,QAAQ,IAAI;CACZ,QAAQ,IACN,KAAK,OAAO,OAAO,GAAG,EAAE,GAAG,OAAO,KAAK,0CAA0C,EAAE,IAC9E,OAAO,IAAI,cAAc,EAAE,GAAG,OAAO,IAAI,GAAG,EAAE,GAAG,OAAO,YAAY,aAAa,GACxF;CAEA,IAAI,aACF,QAAQ,IACN,QAAQ,OAAO,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,OAAO,KAAK,mBAAmB,CAAC,EAAE,GACxE,OAAO,IAAI,gDAAgD,GAClE;MAEA,QAAQ,IACN,QAAQ,OAAO,IAAI,KAAK,EAAE,GAAG,OAAO,KAAK,oBAAoB,EAAE,GAC1D,OAAO,IAAI,oCAAoC,GACtD;CAGF,QAAQ,IAAI,QAAQ,OAAO,IAAI,WAAW,EAAE,GAAG,OAAO,KAAK,aAAa,GAAG;CAC3E,QAAQ,IAAI;AACd;;AAGA,SAAS,yBAA+B;CACtC,QAAQ,IACN,QAAQ,OAAO,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,OAAO,KAAK,mBAAmB,CAAC,EAAE,GACxE,OAAO,IAAI,uCAAuC,GACzD;CACA,QAAQ,IAAI;AACd"}

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

@@ -2,7 +2,7 @@ import path from "node:path";
 import { fileURLToPath } from "url";
 import { Worker } from "worker_threads";
 
-//#region ../core/src/dev-server/create-worker.ts
+//#region core/src/dev-server/create-worker.ts
 /**
 * Create a worker that works in both dev (TypeScript) and production (JavaScript) environments.
 *

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

@@ -1 +1 @@
-{"version":3,"file":"create-worker.mjs","names":[],"sources":["../../../../../../../core/src/dev-server/create-worker.ts"],"sourcesContent":["import path from \"node:path\";\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 * run through the tsx loader; published `.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  // Source workers are TypeScript — run them through the tsx loader.\n  if (isSource) {\n    workerOptions.execArgv = [...(options?.execArgv || []), \"--import\", \"tsx/esm\"];\n  }\n\n  return new Worker(workerFilePath, workerOptions);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,SAAgB,aACd,YACA,SACA,SACQ;CAGR,MAAM,kBAAkB,KAAK,QAAQ,cAAc,OAAO,CAAC;CAC3D,MAAM,WAAW,oBAAoB,SAAS,oBAAoB;CAElE,MAAM,iBAAiB,cAAc,IADf,IAAI,GAAG,aAAa,mBAAmB,OAChB,CAAC;CAE9C,MAAM,gBAA+B,EACnC,GAAG,QACL;CAGA,IAAI,UACF,cAAc,WAAW;EAAC,GAAI,SAAS,YAAY,CAAC;EAAI;EAAY;CAAS;CAG/E,OAAO,IAAI,OAAO,gBAAgB,aAAa;AACjD"}
+{"version":3,"file":"create-worker.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/dev-server/create-worker.ts"],"sourcesContent":["import path from \"node:path\";\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 * run through the tsx loader; published `.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  // Source workers are TypeScript — run them through the tsx loader.\n  if (isSource) {\n    workerOptions.execArgv = [...(options?.execArgv || []), \"--import\", \"tsx/esm\"];\n  }\n\n  return new Worker(workerFilePath, workerOptions);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,SAAgB,aACd,YACA,SACA,SACQ;CAGR,MAAM,kBAAkB,KAAK,QAAQ,cAAc,OAAO,CAAC;CAC3D,MAAM,WAAW,oBAAoB,SAAS,oBAAoB;CAElE,MAAM,iBAAiB,cAAc,IADf,IAAI,GAAG,aAAa,mBAAmB,OAChB,CAAC;CAE9C,MAAM,gBAA+B,EACnC,GAAG,QACL;CAGA,IAAI,UACF,cAAc,WAAW;EAAC,GAAI,SAAS,YAAY,CAAC;EAAI;EAAY;CAAS;CAG/E,OAAO,IAAI,OAAO,gBAAgB,aAAa;AACjD"}

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

@@ -1,6 +1,6 @@
 import { FileManager } from "./file-manager.mjs";
 
-//#region ../core/src/dev-server/dependency-graph.d.ts
+//#region core/src/dev-server/dependency-graph.d.ts
 /**
  * Dependency Graph
  * Tracks bidirectional relationships between files:

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

@@ -1 +1 @@
-{"version":3,"file":"dependency-graph.d.mts","names":[],"sources":["../../../../../../../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;EAwM9B;;;;EA/LD,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;;;;;UAiBA,iCAAA;;;;EAgGD,QAAA"}
+{"version":3,"file":"dependency-graph.d.mts","names":[],"sources":["C:/Work/Warlock.js/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;EAwM9B;;;;EA/LD,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,CAAA;;;;;;;UA2CC,cAAA;;;;;UAiBA,iCAAA;;;;EAgGD,QAAA,CAAA"}

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

@@ -1,4 +1,4 @@
-//#region ../core/src/dev-server/dependency-graph.ts
+//#region core/src/dev-server/dependency-graph.ts
 /**
 * Dependency Graph
 * Tracks bidirectional relationships between files:

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

@@ -1 +1 @@
-{"version":3,"file":"dependency-graph.mjs","names":[],"sources":["../../../../../../../core/src/dev-server/dependency-graph.ts"],"sourcesContent":["import type { FileManager } from \"./file-manager\";\r\n\r\n/**\r\n * Dependency Graph\r\n * Tracks bidirectional relationships between files:\r\n * - dependencies: files that this file imports\r\n * - dependents: files that import this file\r\n *\r\n * Each forward edge also carries an `isTypeOnly` flag so cycle detection\r\n * can distinguish runtime cycles from ones formed purely by `import type`\r\n * edges — the latter are erased by TypeScript and have no runtime effect.\r\n */\r\nexport class DependencyGraph {\r\n  /**\r\n   * Map of file -> files it depends on (imports).\r\n   * Key: relative file path.\r\n   * Value: relative dependency path → `{ isTypeOnly }` for that edge.\r\n   */\r\n  private dependencies = new Map<string, Map<string, { isTypeOnly: boolean }>>();\r\n\r\n  /**\r\n   * Map of file -> files that depend on it (importers)\r\n   * Key: relative file path\r\n   * Value: Set of relative file paths that import this file\r\n   */\r\n  private dependents = new Map<string, Set<string>>();\r\n\r\n  /**\r\n   * Reference to the files map for accessing FileManager instances\r\n   * Used to read per-file typeOnlyDependencies during graph build.\r\n   */\r\n  private files: Map<string, FileManager> | null = null;\r\n\r\n  /**\r\n   * Build dependency graph from FileManager map\r\n   */\r\n  public build(files: Map<string, FileManager>) {\r\n    this.files = files;\r\n\r\n    this.dependencies.clear();\r\n    this.dependents.clear();\r\n\r\n    for (const [relativePath, fileManager] of files) {\r\n      if (!this.dependencies.has(relativePath)) {\r\n        this.dependencies.set(relativePath, new Map());\r\n      }\r\n\r\n      if (!this.dependents.has(relativePath)) {\r\n        this.dependents.set(relativePath, new Set());\r\n      }\r\n\r\n      for (const dependency of fileManager.dependencies) {\r\n        const isTypeOnly = fileManager.typeOnlyDependencies.has(dependency);\r\n\r\n        this.addDependency(relativePath, dependency, isTypeOnly);\r\n      }\r\n    }\r\n\r\n    const cycles = this.detectCircularDependencies();\r\n\r\n    if (cycles.length > 0) {\r\n      this.displayCircularDependencyWarnings(cycles);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Add a dependency relationship.\r\n   * If the edge already exists, the type-only flag is ANDed: any runtime\r\n   * statement between the two files makes the edge runtime permanently.\r\n   *\r\n   * @param file The file that has the dependency\r\n   * @param dependency The file being depended upon\r\n   * @param isTypeOnly Whether every reference from `file` to `dependency` is type-only\r\n   */\r\n  public addDependency(file: string, dependency: string, isTypeOnly: boolean = false) {\r\n    if (!this.dependencies.has(file)) {\r\n      this.dependencies.set(file, new Map());\r\n    }\r\n\r\n    if (!this.dependents.has(dependency)) {\r\n      this.dependents.set(dependency, new Set());\r\n    }\r\n\r\n    const edges = this.dependencies.get(file)!;\r\n    const existing = edges.get(dependency);\r\n\r\n    if (existing) {\r\n      existing.isTypeOnly = existing.isTypeOnly && isTypeOnly;\r\n    } else {\r\n      edges.set(dependency, { isTypeOnly });\r\n    }\r\n\r\n    this.dependents.get(dependency)!.add(file);\r\n  }\r\n\r\n  /**\r\n   * Remove a dependency relationship\r\n   * @param file The file that has the dependency\r\n   * @param dependency The file being depended upon\r\n   */\r\n  public removeDependency(file: string, dependency: string) {\r\n    this.dependencies.get(file)?.delete(dependency);\r\n    this.dependents.get(dependency)?.delete(file);\r\n  }\r\n\r\n  /**\r\n   * Remove all relationships for a file\r\n   * @param file The file to remove\r\n   */\r\n  public removeFile(file: string) {\r\n    const deps = this.dependencies.get(file);\r\n\r\n    if (deps) {\r\n      for (const dependency of deps.keys()) {\r\n        this.dependents.get(dependency)?.delete(file);\r\n      }\r\n    }\r\n\r\n    const dependents = this.dependents.get(file);\r\n\r\n    if (dependents) {\r\n      for (const dependent of dependents) {\r\n        this.dependencies.get(dependent)?.delete(file);\r\n      }\r\n    }\r\n\r\n    this.dependencies.delete(file);\r\n    this.dependents.delete(file);\r\n  }\r\n\r\n  /**\r\n   * Update dependencies for a file.\r\n   *\r\n   * Accepts the updated `Set<string>` of dependency paths; when the caller\r\n   * has per-edge type-only info, pass `typeOnlyDependencies` so the new\r\n   * edges get the correct flag. Missing flag defaults to runtime.\r\n   *\r\n   * @param file The file to update\r\n   * @param newDependencies New set of dependency paths\r\n   * @param typeOnlyDependencies Subset of `newDependencies` whose edges are type-only\r\n   */\r\n  public updateFile(\r\n    file: string,\r\n    newDependencies: Set<string>,\r\n    typeOnlyDependencies: Set<string> = new Set(),\r\n  ) {\r\n    const oldEdges = this.dependencies.get(file) ?? new Map<string, { isTypeOnly: boolean }>();\r\n\r\n    for (const oldDep of oldEdges.keys()) {\r\n      if (!newDependencies.has(oldDep)) {\r\n        this.removeDependency(file, oldDep);\r\n      }\r\n    }\r\n\r\n    for (const newDep of newDependencies) {\r\n      const isTypeOnly = typeOnlyDependencies.has(newDep);\r\n      const existing = oldEdges.get(newDep);\r\n\r\n      if (!existing) {\r\n        this.addDependency(file, newDep, isTypeOnly);\r\n\r\n        continue;\r\n      }\r\n\r\n      if (existing.isTypeOnly !== isTypeOnly) {\r\n        existing.isTypeOnly = isTypeOnly;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Get files that this file depends on (imports)\r\n   * @param file The file to check\r\n   * @returns Set of files this file imports\r\n   */\r\n  public getDependencies(file: string): Set<string> {\r\n    const edges = this.dependencies.get(file);\r\n\r\n    if (!edges) {\r\n      return new Set();\r\n    }\r\n\r\n    return new Set(edges.keys());\r\n  }\r\n\r\n  /**\r\n   * Check whether the edge `file → dependency` is type-only.\r\n   * Returns false if the edge does not exist.\r\n   */\r\n  public isEdgeTypeOnly(file: string, dependency: string): boolean {\r\n    return this.dependencies.get(file)?.get(dependency)?.isTypeOnly === true;\r\n  }\r\n\r\n  /**\r\n   * Get files that depend on this file (importers)\r\n   * @param file The file to check\r\n   * @returns Set of files that import this file\r\n   */\r\n  public getDependents(file: string): Set<string> {\r\n    return this.dependents.get(file) || new Set();\r\n  }\r\n\r\n  /**\r\n   * Get invalidation chain for a file\r\n   * Returns all files that need to be reloaded when this file changes\r\n   * Includes the file itself and all transitive dependents\r\n   * @param file The file that changed\r\n   * @returns Array of files to invalidate (in order)\r\n   */\r\n  public getInvalidationChain(file: string): string[] {\r\n    const chain: string[] = [file];\r\n    const visited = new Set([file]);\r\n\r\n    const traverse = (current: string) => {\r\n      const deps = this.getDependents(current);\r\n      for (const dep of deps) {\r\n        if (!visited.has(dep)) {\r\n          visited.add(dep);\r\n          chain.push(dep);\r\n          traverse(dep); // Recursive traversal\r\n        }\r\n      }\r\n    };\r\n\r\n    traverse(file);\r\n    return chain;\r\n  }\r\n\r\n  /**\r\n   * Detect circular dependencies in the dependency graph.\r\n   * Uses depth-first search to find cycles.\r\n   *\r\n   * Filtering rule (per-edge): a cycle is suppressed when **any** edge in\r\n   * the chain is type-only. TypeScript erases type-only imports entirely,\r\n   * so a single type-only edge breaks the cycle at runtime. Only warn when\r\n   * every edge is a runtime binding — that's the cycle that actually loops\r\n   * at load time.\r\n   *\r\n   * @returns Array of circular dependency chains (each chain is an array of file paths)\r\n   */\r\n  public detectCircularDependencies(): string[][] {\r\n    const cycles: string[][] = [];\r\n    const visited = new Set<string>();\r\n    const recursionStack = new Set<string>();\r\n\r\n    const dfs = (file: string, path: string[]): void => {\r\n      visited.add(file);\r\n      recursionStack.add(file);\r\n      path.push(file);\r\n\r\n      const edges = this.dependencies.get(file);\r\n\r\n      if (edges) {\r\n        for (const dep of edges.keys()) {\r\n          if (!visited.has(dep)) {\r\n            dfs(dep, [...path]);\r\n          } else if (recursionStack.has(dep)) {\r\n            const cycleStart = path.indexOf(dep);\r\n            const cycle = [...path.slice(cycleStart), dep];\r\n\r\n            cycles.push(cycle);\r\n          }\r\n        }\r\n      }\r\n\r\n      recursionStack.delete(file);\r\n    };\r\n\r\n    for (const file of this.dependencies.keys()) {\r\n      if (!visited.has(file)) {\r\n        dfs(file, []);\r\n      }\r\n    }\r\n\r\n    return cycles.filter((cycle) => this.isRuntimeCycle(cycle));\r\n  }\r\n\r\n  /**\r\n   * True iff every edge in the cycle is a runtime binding. The cycle array\r\n   * ends with a duplicate of its start (`[A, B, C, A]`) so we walk the\r\n   * consecutive pairs once — any type-only edge means TS erases the loop\r\n   * and there is no runtime cycle to report.\r\n   */\r\n  private isRuntimeCycle(cycle: string[]): boolean {\r\n    for (let index = 0; index < cycle.length - 1; index++) {\r\n      const from = cycle[index];\r\n      const to = cycle[index + 1];\r\n\r\n      if (this.isEdgeTypeOnly(from, to)) {\r\n        return false;\r\n      }\r\n    }\r\n\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Display circular dependency warnings in a formatted, user-friendly way\r\n   * Shows each cycle with visual tree structure and helpful recommendations\r\n   */\r\n  private displayCircularDependencyWarnings(cycles: string[][]): void {\r\n    const colors = {\r\n      yellow: (text: string) => `\\x1b[33m${text}\\x1b[0m`,\r\n      cyan: (text: string) => `\\x1b[36m${text}\\x1b[0m`,\r\n      dim: (text: string) => `\\x1b[2m${text}\\x1b[0m`,\r\n      bold: (text: string) => `\\x1b[1m${text}\\x1b[0m`,\r\n      green: (text: string) => `\\x1b[32m${text}\\x1b[0m`,\r\n    };\r\n\r\n    console.log(\"\");\r\n    console.log(colors.yellow(\"⚠️  Circular Dependencies Detected\"));\r\n    console.log(colors.dim(\"━\".repeat(60)));\r\n    console.log(\"\");\r\n    console.log(\r\n      colors.dim(\r\n        `Found ${colors.bold(cycles.length.toString())} circular dependency chain${cycles.length > 1 ? \"s\" : \"\"}`,\r\n      ),\r\n    );\r\n    console.log(\"\");\r\n\r\n    cycles.forEach((cycle, index) => {\r\n      console.log(colors.cyan(`  ${index + 1}. Cycle with ${cycle.length - 1} files:`));\r\n      console.log(\"\");\r\n\r\n      // Display the cycle chain\r\n      cycle.forEach((file, fileIndex) => {\r\n        const isLast = fileIndex === cycle.length - 1;\r\n        const arrow = isLast ? colors.dim(\"   └─→ \") : colors.dim(\"   ├─→ \");\r\n        const fileName = file.split(\"/\").pop() || file;\r\n        const filePath = colors.dim(file.replace(fileName, \"\"));\r\n\r\n        if (isLast) {\r\n          // Last item is the same as first (completes the cycle)\r\n          console.log(\r\n            arrow + colors.yellow(`${filePath}${colors.bold(fileName)} (cycle completes)`),\r\n          );\r\n        } else {\r\n          console.log(arrow + filePath + colors.bold(fileName));\r\n        }\r\n      });\r\n\r\n      console.log(\"\");\r\n    });\r\n\r\n    console.log(colors.dim(\"━\".repeat(60)));\r\n    console.log(colors.yellow(\"💡 How to Fix:\"));\r\n    console.log(\"\");\r\n\r\n    const exampleCycle = cycles[0];\r\n    const fileA = exampleCycle[0]?.split(\"/\").pop() || \"fileA.ts\";\r\n    const fileB = exampleCycle[1]?.split(\"/\").pop() || \"fileB.ts\";\r\n    const stripExt = (file: string) => file.replace(/\\.tsx?$/, \"\");\r\n\r\n    const kind = classifyCycle(exampleCycle);\r\n\r\n    if (kind === \"resource\" || kind === \"model\") {\r\n      // Cascade's `lazy()` is purpose-built for circular relations between\r\n      // resources and models — recommend it first, not as a footnote.\r\n      console.log(colors.green(`  ✨ Use lazy() for the back-reference`));\r\n      console.log(\r\n        colors.dim(\r\n          `   ${kind === \"resource\" ? \"Resources\" : \"Models\"} that reference each other should declare`,\r\n        ),\r\n      );\r\n      console.log(colors.dim(`   one side with lazy() so the import resolves at access time:`));\r\n      console.log(\"\");\r\n      console.log(colors.dim(`     import { lazy } from \"@warlock.js/cascade\";`));\r\n      console.log(colors.dim(`     // inside ${fileB}:`));\r\n      console.log(colors.dim(`     other: lazy(() => ${kind === \"resource\" ? \"OtherResource\" : \"OtherModel\"})`));\r\n      console.log(\"\");\r\n    } else {\r\n      // Generic cycle — dynamic import is the most common reliable fix.\r\n      console.log(colors.green(`  ✨ Convert one edge to a dynamic import`));\r\n      console.log(colors.dim(`   In ${fileB}, change:`));\r\n      console.log(colors.dim(`     import { SomeClass } from \"./${stripExt(fileA)}\";`));\r\n      console.log(colors.dim(`   To:`));\r\n      console.log(\r\n        colors.dim(`     const { SomeClass } = await import(\"./${stripExt(fileA)}\");`),\r\n      );\r\n      console.log(\"\");\r\n    }\r\n\r\n    console.log(colors.dim(\"  Other options:\"));\r\n    console.log(colors.dim(\"    • Extract the shared symbols into a third file both can import.\"));\r\n    console.log(colors.dim(\"    • Pass the dependency as a constructor/function parameter instead.\"));\r\n    console.log(\"\");\r\n\r\n    console.log(colors.dim(\"━\".repeat(60)));\r\n    console.log(colors.dim(\"   Circular dependencies can cause HMR issues and hard-to-debug\"));\r\n    console.log(colors.dim(\"   initialization order problems. Consider refactoring.\"));\r\n    console.log(\"\");\r\n  }\r\n\r\n  /**\r\n   * Get statistics about the dependency graph\r\n   */\r\n  public getStats() {\r\n    let totalDependencies = 0;\r\n    let maxDependencies = 0;\r\n    let maxDependents = 0;\r\n    let mostDependedFile = \"\";\r\n    let mostDependingFile = \"\";\r\n\r\n    for (const [file, deps] of this.dependencies) {\r\n      totalDependencies += deps.size;\r\n      if (deps.size > maxDependencies) {\r\n        maxDependencies = deps.size;\r\n        mostDependingFile = file;\r\n      }\r\n    }\r\n\r\n    for (const [file, deps] of this.dependents) {\r\n      if (deps.size > maxDependents) {\r\n        maxDependents = deps.size;\r\n        mostDependedFile = file;\r\n      }\r\n    }\r\n\r\n    return {\r\n      totalFiles: this.dependencies.size,\r\n      totalDependencies,\r\n      avgDependenciesPerFile: totalDependencies / this.dependencies.size || 0,\r\n      maxDependencies,\r\n      maxDependents,\r\n      mostDependingFile,\r\n      mostDependedFile,\r\n    };\r\n  }\r\n}\r\n\r\n/**\r\n * Pick the most useful \"fix-it\" hint for a cycle by inspecting the file\r\n * extensions involved. Cascade resources/models have a first-class fix\r\n * (`lazy()`); generic cycles just want a dynamic import.\r\n */\r\nfunction classifyCycle(cycle: string[]): \"resource\" | \"model\" | \"generic\" {\r\n  const files = cycle.slice(0, -1); // last entry repeats the first\r\n  if (files.every(file => file.endsWith(\".resource.ts\") || file.endsWith(\".resource.tsx\"))) {\r\n    return \"resource\";\r\n  }\r\n  if (files.every(file => file.endsWith(\".model.ts\") || file.endsWith(\".model.tsx\"))) {\r\n    return \"model\";\r\n  }\r\n  return \"generic\";\r\n}\r\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;GAEzB,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;EAEd,MAAM,eAAe,OAAO;EAC5B,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,IAAI,OAAO,IAAI,0BAA0B,SAAS,aAAa,kBAAkB,aAAa,EAAE,CAAC;GACzG,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,IACN,OAAO,IAAI,8CAA8C,SAAS,KAAK,EAAE,IAAI,CAC/E;GACA,QAAQ,IAAI,EAAE;EAChB;EAEA,QAAQ,IAAI,OAAO,IAAI,kBAAkB,CAAC;EAC1C,QAAQ,IAAI,OAAO,IAAI,qEAAqE,CAAC;EAC7F,QAAQ,IAAI,OAAO,IAAI,wEAAwE,CAAC;EAChG,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,OAAM,SAAQ,KAAK,SAAS,cAAc,KAAK,KAAK,SAAS,eAAe,CAAC,GACrF,OAAO;CAET,IAAI,MAAM,OAAM,SAAQ,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,YAAY,CAAC,GAC/E,OAAO;CAET,OAAO;AACT"}
+{"version":3,"file":"dependency-graph.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/dev-server/dependency-graph.ts"],"sourcesContent":["import type { FileManager } from \"./file-manager\";\r\n\r\n/**\r\n * Dependency Graph\r\n * Tracks bidirectional relationships between files:\r\n * - dependencies: files that this file imports\r\n * - dependents: files that import this file\r\n *\r\n * Each forward edge also carries an `isTypeOnly` flag so cycle detection\r\n * can distinguish runtime cycles from ones formed purely by `import type`\r\n * edges — the latter are erased by TypeScript and have no runtime effect.\r\n */\r\nexport class DependencyGraph {\r\n  /**\r\n   * Map of file -> files it depends on (imports).\r\n   * Key: relative file path.\r\n   * Value: relative dependency path → `{ isTypeOnly }` for that edge.\r\n   */\r\n  private dependencies = new Map<string, Map<string, { isTypeOnly: boolean }>>();\r\n\r\n  /**\r\n   * Map of file -> files that depend on it (importers)\r\n   * Key: relative file path\r\n   * Value: Set of relative file paths that import this file\r\n   */\r\n  private dependents = new Map<string, Set<string>>();\r\n\r\n  /**\r\n   * Reference to the files map for accessing FileManager instances\r\n   * Used to read per-file typeOnlyDependencies during graph build.\r\n   */\r\n  private files: Map<string, FileManager> | null = null;\r\n\r\n  /**\r\n   * Build dependency graph from FileManager map\r\n   */\r\n  public build(files: Map<string, FileManager>) {\r\n    this.files = files;\r\n\r\n    this.dependencies.clear();\r\n    this.dependents.clear();\r\n\r\n    for (const [relativePath, fileManager] of files) {\r\n      if (!this.dependencies.has(relativePath)) {\r\n        this.dependencies.set(relativePath, new Map());\r\n      }\r\n\r\n      if (!this.dependents.has(relativePath)) {\r\n        this.dependents.set(relativePath, new Set());\r\n      }\r\n\r\n      for (const dependency of fileManager.dependencies) {\r\n        const isTypeOnly = fileManager.typeOnlyDependencies.has(dependency);\r\n\r\n        this.addDependency(relativePath, dependency, isTypeOnly);\r\n      }\r\n    }\r\n\r\n    const cycles = this.detectCircularDependencies();\r\n\r\n    if (cycles.length > 0) {\r\n      this.displayCircularDependencyWarnings(cycles);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Add a dependency relationship.\r\n   * If the edge already exists, the type-only flag is ANDed: any runtime\r\n   * statement between the two files makes the edge runtime permanently.\r\n   *\r\n   * @param file The file that has the dependency\r\n   * @param dependency The file being depended upon\r\n   * @param isTypeOnly Whether every reference from `file` to `dependency` is type-only\r\n   */\r\n  public addDependency(file: string, dependency: string, isTypeOnly: boolean = false) {\r\n    if (!this.dependencies.has(file)) {\r\n      this.dependencies.set(file, new Map());\r\n    }\r\n\r\n    if (!this.dependents.has(dependency)) {\r\n      this.dependents.set(dependency, new Set());\r\n    }\r\n\r\n    const edges = this.dependencies.get(file)!;\r\n    const existing = edges.get(dependency);\r\n\r\n    if (existing) {\r\n      existing.isTypeOnly = existing.isTypeOnly && isTypeOnly;\r\n    } else {\r\n      edges.set(dependency, { isTypeOnly });\r\n    }\r\n\r\n    this.dependents.get(dependency)!.add(file);\r\n  }\r\n\r\n  /**\r\n   * Remove a dependency relationship\r\n   * @param file The file that has the dependency\r\n   * @param dependency The file being depended upon\r\n   */\r\n  public removeDependency(file: string, dependency: string) {\r\n    this.dependencies.get(file)?.delete(dependency);\r\n    this.dependents.get(dependency)?.delete(file);\r\n  }\r\n\r\n  /**\r\n   * Remove all relationships for a file\r\n   * @param file The file to remove\r\n   */\r\n  public removeFile(file: string) {\r\n    const deps = this.dependencies.get(file);\r\n\r\n    if (deps) {\r\n      for (const dependency of deps.keys()) {\r\n        this.dependents.get(dependency)?.delete(file);\r\n      }\r\n    }\r\n\r\n    const dependents = this.dependents.get(file);\r\n\r\n    if (dependents) {\r\n      for (const dependent of dependents) {\r\n        this.dependencies.get(dependent)?.delete(file);\r\n      }\r\n    }\r\n\r\n    this.dependencies.delete(file);\r\n    this.dependents.delete(file);\r\n  }\r\n\r\n  /**\r\n   * Update dependencies for a file.\r\n   *\r\n   * Accepts the updated `Set<string>` of dependency paths; when the caller\r\n   * has per-edge type-only info, pass `typeOnlyDependencies` so the new\r\n   * edges get the correct flag. Missing flag defaults to runtime.\r\n   *\r\n   * @param file The file to update\r\n   * @param newDependencies New set of dependency paths\r\n   * @param typeOnlyDependencies Subset of `newDependencies` whose edges are type-only\r\n   */\r\n  public updateFile(\r\n    file: string,\r\n    newDependencies: Set<string>,\r\n    typeOnlyDependencies: Set<string> = new Set(),\r\n  ) {\r\n    const oldEdges = this.dependencies.get(file) ?? new Map<string, { isTypeOnly: boolean }>();\r\n\r\n    for (const oldDep of oldEdges.keys()) {\r\n      if (!newDependencies.has(oldDep)) {\r\n        this.removeDependency(file, oldDep);\r\n      }\r\n    }\r\n\r\n    for (const newDep of newDependencies) {\r\n      const isTypeOnly = typeOnlyDependencies.has(newDep);\r\n      const existing = oldEdges.get(newDep);\r\n\r\n      if (!existing) {\r\n        this.addDependency(file, newDep, isTypeOnly);\r\n\r\n        continue;\r\n      }\r\n\r\n      if (existing.isTypeOnly !== isTypeOnly) {\r\n        existing.isTypeOnly = isTypeOnly;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Get files that this file depends on (imports)\r\n   * @param file The file to check\r\n   * @returns Set of files this file imports\r\n   */\r\n  public getDependencies(file: string): Set<string> {\r\n    const edges = this.dependencies.get(file);\r\n\r\n    if (!edges) {\r\n      return new Set();\r\n    }\r\n\r\n    return new Set(edges.keys());\r\n  }\r\n\r\n  /**\r\n   * Check whether the edge `file → dependency` is type-only.\r\n   * Returns false if the edge does not exist.\r\n   */\r\n  public isEdgeTypeOnly(file: string, dependency: string): boolean {\r\n    return this.dependencies.get(file)?.get(dependency)?.isTypeOnly === true;\r\n  }\r\n\r\n  /**\r\n   * Get files that depend on this file (importers)\r\n   * @param file The file to check\r\n   * @returns Set of files that import this file\r\n   */\r\n  public getDependents(file: string): Set<string> {\r\n    return this.dependents.get(file) || new Set();\r\n  }\r\n\r\n  /**\r\n   * Get invalidation chain for a file\r\n   * Returns all files that need to be reloaded when this file changes\r\n   * Includes the file itself and all transitive dependents\r\n   * @param file The file that changed\r\n   * @returns Array of files to invalidate (in order)\r\n   */\r\n  public getInvalidationChain(file: string): string[] {\r\n    const chain: string[] = [file];\r\n    const visited = new Set([file]);\r\n\r\n    const traverse = (current: string) => {\r\n      const deps = this.getDependents(current);\r\n      for (const dep of deps) {\r\n        if (!visited.has(dep)) {\r\n          visited.add(dep);\r\n          chain.push(dep);\r\n          traverse(dep); // Recursive traversal\r\n        }\r\n      }\r\n    };\r\n\r\n    traverse(file);\r\n    return chain;\r\n  }\r\n\r\n  /**\r\n   * Detect circular dependencies in the dependency graph.\r\n   * Uses depth-first search to find cycles.\r\n   *\r\n   * Filtering rule (per-edge): a cycle is suppressed when **any** edge in\r\n   * the chain is type-only. TypeScript erases type-only imports entirely,\r\n   * so a single type-only edge breaks the cycle at runtime. Only warn when\r\n   * every edge is a runtime binding — that's the cycle that actually loops\r\n   * at load time.\r\n   *\r\n   * @returns Array of circular dependency chains (each chain is an array of file paths)\r\n   */\r\n  public detectCircularDependencies(): string[][] {\r\n    const cycles: string[][] = [];\r\n    const visited = new Set<string>();\r\n    const recursionStack = new Set<string>();\r\n\r\n    const dfs = (file: string, path: string[]): void => {\r\n      visited.add(file);\r\n      recursionStack.add(file);\r\n      path.push(file);\r\n\r\n      const edges = this.dependencies.get(file);\r\n\r\n      if (edges) {\r\n        for (const dep of edges.keys()) {\r\n          if (!visited.has(dep)) {\r\n            dfs(dep, [...path]);\r\n          } else if (recursionStack.has(dep)) {\r\n            const cycleStart = path.indexOf(dep);\r\n            const cycle = [...path.slice(cycleStart), dep];\r\n\r\n            cycles.push(cycle);\r\n          }\r\n        }\r\n      }\r\n\r\n      recursionStack.delete(file);\r\n    };\r\n\r\n    for (const file of this.dependencies.keys()) {\r\n      if (!visited.has(file)) {\r\n        dfs(file, []);\r\n      }\r\n    }\r\n\r\n    return cycles.filter((cycle) => this.isRuntimeCycle(cycle));\r\n  }\r\n\r\n  /**\r\n   * True iff every edge in the cycle is a runtime binding. The cycle array\r\n   * ends with a duplicate of its start (`[A, B, C, A]`) so we walk the\r\n   * consecutive pairs once — any type-only edge means TS erases the loop\r\n   * and there is no runtime cycle to report.\r\n   */\r\n  private isRuntimeCycle(cycle: string[]): boolean {\r\n    for (let index = 0; index < cycle.length - 1; index++) {\r\n      const from = cycle[index];\r\n      const to = cycle[index + 1];\r\n\r\n      if (this.isEdgeTypeOnly(from, to)) {\r\n        return false;\r\n      }\r\n    }\r\n\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Display circular dependency warnings in a formatted, user-friendly way\r\n   * Shows each cycle with visual tree structure and helpful recommendations\r\n   */\r\n  private displayCircularDependencyWarnings(cycles: string[][]): void {\r\n    const colors = {\r\n      yellow: (text: string) => `\\x1b[33m${text}\\x1b[0m`,\r\n      cyan: (text: string) => `\\x1b[36m${text}\\x1b[0m`,\r\n      dim: (text: string) => `\\x1b[2m${text}\\x1b[0m`,\r\n      bold: (text: string) => `\\x1b[1m${text}\\x1b[0m`,\r\n      green: (text: string) => `\\x1b[32m${text}\\x1b[0m`,\r\n    };\r\n\r\n    console.log(\"\");\r\n    console.log(colors.yellow(\"⚠️  Circular Dependencies Detected\"));\r\n    console.log(colors.dim(\"━\".repeat(60)));\r\n    console.log(\"\");\r\n    console.log(\r\n      colors.dim(\r\n        `Found ${colors.bold(cycles.length.toString())} circular dependency chain${cycles.length > 1 ? \"s\" : \"\"}`,\r\n      ),\r\n    );\r\n    console.log(\"\");\r\n\r\n    cycles.forEach((cycle, index) => {\r\n      console.log(colors.cyan(`  ${index + 1}. Cycle with ${cycle.length - 1} files:`));\r\n      console.log(\"\");\r\n\r\n      // Display the cycle chain\r\n      cycle.forEach((file, fileIndex) => {\r\n        const isLast = fileIndex === cycle.length - 1;\r\n        const arrow = isLast ? colors.dim(\"   └─→ \") : colors.dim(\"   ├─→ \");\r\n        const fileName = file.split(\"/\").pop() || file;\r\n        const filePath = colors.dim(file.replace(fileName, \"\"));\r\n\r\n        if (isLast) {\r\n          // Last item is the same as first (completes the cycle)\r\n          console.log(\r\n            arrow + colors.yellow(`${filePath}${colors.bold(fileName)} (cycle completes)`),\r\n          );\r\n        } else {\r\n          console.log(arrow + filePath + colors.bold(fileName));\r\n        }\r\n      });\r\n\r\n      console.log(\"\");\r\n    });\r\n\r\n    console.log(colors.dim(\"━\".repeat(60)));\r\n    console.log(colors.yellow(\"💡 How to Fix:\"));\r\n    console.log(\"\");\r\n\r\n    const exampleCycle = cycles[0];\r\n    const fileA = exampleCycle[0]?.split(\"/\").pop() || \"fileA.ts\";\r\n    const fileB = exampleCycle[1]?.split(\"/\").pop() || \"fileB.ts\";\r\n    const stripExt = (file: string) => file.replace(/\\.tsx?$/, \"\");\r\n\r\n    const kind = classifyCycle(exampleCycle);\r\n\r\n    if (kind === \"resource\" || kind === \"model\") {\r\n      // Cascade's `lazy()` is purpose-built for circular relations between\r\n      // resources and models — recommend it first, not as a footnote.\r\n      console.log(colors.green(`  ✨ Use lazy() for the back-reference`));\r\n      console.log(\r\n        colors.dim(\r\n          `   ${kind === \"resource\" ? \"Resources\" : \"Models\"} that reference each other should declare`,\r\n        ),\r\n      );\r\n      console.log(colors.dim(`   one side with lazy() so the import resolves at access time:`));\r\n      console.log(\"\");\r\n      console.log(colors.dim(`     import { lazy } from \"@warlock.js/cascade\";`));\r\n      console.log(colors.dim(`     // inside ${fileB}:`));\r\n      console.log(colors.dim(`     other: lazy(() => ${kind === \"resource\" ? \"OtherResource\" : \"OtherModel\"})`));\r\n      console.log(\"\");\r\n    } else {\r\n      // Generic cycle — dynamic import is the most common reliable fix.\r\n      console.log(colors.green(`  ✨ Convert one edge to a dynamic import`));\r\n      console.log(colors.dim(`   In ${fileB}, change:`));\r\n      console.log(colors.dim(`     import { SomeClass } from \"./${stripExt(fileA)}\";`));\r\n      console.log(colors.dim(`   To:`));\r\n      console.log(\r\n        colors.dim(`     const { SomeClass } = await import(\"./${stripExt(fileA)}\");`),\r\n      );\r\n      console.log(\"\");\r\n    }\r\n\r\n    console.log(colors.dim(\"  Other options:\"));\r\n    console.log(colors.dim(\"    • Extract the shared symbols into a third file both can import.\"));\r\n    console.log(colors.dim(\"    • Pass the dependency as a constructor/function parameter instead.\"));\r\n    console.log(\"\");\r\n\r\n    console.log(colors.dim(\"━\".repeat(60)));\r\n    console.log(colors.dim(\"   Circular dependencies can cause HMR issues and hard-to-debug\"));\r\n    console.log(colors.dim(\"   initialization order problems. Consider refactoring.\"));\r\n    console.log(\"\");\r\n  }\r\n\r\n  /**\r\n   * Get statistics about the dependency graph\r\n   */\r\n  public getStats() {\r\n    let totalDependencies = 0;\r\n    let maxDependencies = 0;\r\n    let maxDependents = 0;\r\n    let mostDependedFile = \"\";\r\n    let mostDependingFile = \"\";\r\n\r\n    for (const [file, deps] of this.dependencies) {\r\n      totalDependencies += deps.size;\r\n      if (deps.size > maxDependencies) {\r\n        maxDependencies = deps.size;\r\n        mostDependingFile = file;\r\n      }\r\n    }\r\n\r\n    for (const [file, deps] of this.dependents) {\r\n      if (deps.size > maxDependents) {\r\n        maxDependents = deps.size;\r\n        mostDependedFile = file;\r\n      }\r\n    }\r\n\r\n    return {\r\n      totalFiles: this.dependencies.size,\r\n      totalDependencies,\r\n      avgDependenciesPerFile: totalDependencies / this.dependencies.size || 0,\r\n      maxDependencies,\r\n      maxDependents,\r\n      mostDependingFile,\r\n      mostDependedFile,\r\n    };\r\n  }\r\n}\r\n\r\n/**\r\n * Pick the most useful \"fix-it\" hint for a cycle by inspecting the file\r\n * extensions involved. Cascade resources/models have a first-class fix\r\n * (`lazy()`); generic cycles just want a dynamic import.\r\n */\r\nfunction classifyCycle(cycle: string[]): \"resource\" | \"model\" | \"generic\" {\r\n  const files = cycle.slice(0, -1); // last entry repeats the first\r\n  if (files.every(file => file.endsWith(\".resource.ts\") || file.endsWith(\".resource.tsx\"))) {\r\n    return \"resource\";\r\n  }\r\n  if (files.every(file => file.endsWith(\".model.ts\") || file.endsWith(\".model.tsx\"))) {\r\n    return \"model\";\r\n  }\r\n  return \"generic\";\r\n}\r\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,EAAG,IAAI,IAAI;CAC3C;;;;;;CAOA,AAAO,iBAAiB,MAAc,YAAoB;EACxD,KAAK,aAAa,IAAI,IAAI,GAAG,OAAO,UAAU;EAC9C,KAAK,WAAW,IAAI,UAAU,GAAG,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,GAAG,OAAO,IAAI;EAIhD,MAAM,aAAa,KAAK,WAAW,IAAI,IAAI;EAE3C,IAAI,YACF,KAAK,MAAM,aAAa,YACtB,KAAK,aAAa,IAAI,SAAS,GAAG,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,GAAG,IAAI,UAAU,GAAG,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;GAEzB,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,EAAE,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;EAEd,MAAM,eAAe,OAAO;EAC5B,MAAM,QAAQ,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,KAAK;EACnD,MAAM,QAAQ,aAAa,IAAI,MAAM,GAAG,EAAE,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,IAAI,OAAO,IAAI,0BAA0B,SAAS,aAAa,kBAAkB,aAAa,EAAE,CAAC;GACzG,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,IACN,OAAO,IAAI,8CAA8C,SAAS,KAAK,EAAE,IAAI,CAC/E;GACA,QAAQ,IAAI,EAAE;EAChB;EAEA,QAAQ,IAAI,OAAO,IAAI,kBAAkB,CAAC;EAC1C,QAAQ,IAAI,OAAO,IAAI,qEAAqE,CAAC;EAC7F,QAAQ,IAAI,OAAO,IAAI,wEAAwE,CAAC;EAChG,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,OAAM,SAAQ,KAAK,SAAS,cAAc,KAAK,KAAK,SAAS,eAAe,CAAC,GACrF,OAAO;CAET,IAAI,MAAM,OAAM,SAAQ,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,YAAY,CAAC,GAC/E,OAAO;CAET,OAAO;AACT"}

package/esm/dev-server/dev-logger.mjs

@@ -2,7 +2,7 @@ import { Path } from "../utils/normalized-path.mjs";
 import { colors } from "@mongez/copper";
 import dayjs from "dayjs";
 
-//#region ../core/src/dev-server/dev-logger.ts
+//#region core/src/dev-server/dev-logger.ts
 /**
 * Dev server logger — Vite-style formatting helpers.
 */
@@ -70,9 +70,6 @@ function devLogHMR(file, dependents) {
 	const depInfo = dependents ? colors.dim(` +${dependents} module${dependents > 1 ? "s" : ""}`) : "";
 	console.log(`${timestamp()} 🔥 ${colors.green("hmr update")} ${colors.dim(relativePath)}${depInfo}`);
 }
-function devLogReady(message) {
-	console.log(`\n${timestamp()}  ${colors.green("➜")}  ${colors.bold(message)}`);
-}
 function devLogSection(title) {
 	console.log(`\n${timestamp()} ${colors.bold(colors.cyan(title))}`);
 }
@@ -106,5 +103,5 @@ function formatModuleNotFoundError(error, suggestions) {
 const devServeLog = devLog;
 
 //#endregion
-export { devLogDim, devLogError, devLogHMR, devLogInfo, devLogReady, devLogSection, devLogSuccess, devLogWarn, devServeLog, formatModuleNotFoundError };
+export { devLogDim, devLogError, devLogHMR, devLogInfo, devLogSection, devLogSuccess, devLogWarn, devServeLog, formatModuleNotFoundError };
 //# sourceMappingURL=dev-logger.mjs.map

package/esm/dev-server/dev-logger.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"dev-logger.mjs","names":[],"sources":["../../../../../../../core/src/dev-server/dev-logger.ts"],"sourcesContent":["import { colors } from \"@mongez/copper\";\nimport dayjs from \"dayjs\";\nimport { Path } from \"../utils/normalized-path\";\n\n/**\n * Dev server logger — Vite-style formatting helpers.\n */\n\nfunction timestamp(): string {\n  return colors.dim(`${dayjs().format(\"HH:mm:ss A\")}`);\n}\n\nexport function devLog(message: string) {\n  console.log(`${timestamp()} ${message}`);\n}\n\nexport function devLogSuccess(message: string) {\n  console.log(`${timestamp()} ${colors.green(\"✓\")} ${colors.green(message)}`);\n}\n\n/**\n * Colourise a stack trace so the eye lands on *your* code.\n *\n * - Error header (`ReferenceError: x is not defined`) → bold red.\n * - Frames in project `src/` → highlighted: a green `›` pointer, yellow\n *   function name, cyan relative path, dim `:line:col`. These are almost\n *   always where the bug is.\n * - Framework (`@warlock.js`), `node_modules`, and `node:` internal frames\n *   → dimmed and relativised. Still there for context, just out of the way.\n *\n * Source maps are enabled in dev, so the paths/lines here are already the\n * original `.ts` locations — this only changes how they're painted.\n */\nexport function formatErrorStack(stack: string): string {\n  const frame = /^(\\s*)at (.+?) \\((.+):(\\d+):(\\d+)\\)$/;\n  const bareFrame = /^(\\s*)at (.+):(\\d+):(\\d+)$/;\n  let headerDone = false;\n\n  return stack\n    .split(\"\\n\")\n    .map(line => {\n      const withFn = line.match(frame);\n      const bare = line.match(bareFrame);\n\n      if (!withFn && !bare) {\n        // Header line(s) before the first frame.\n        const painted = headerDone ? colors.dim(line) : colors.bold(colors.red(line));\n        return painted;\n      }\n\n      headerDone = true;\n\n      const fn = withFn ? withFn[2] : \"\";\n      const file = withFn ? withFn[3] : bare![2];\n      const lineNo = withFn ? withFn[4] : bare![3];\n      const col = withFn ? withFn[5] : bare![4];\n\n      const isNodeInternal = file.startsWith(\"node:\");\n      const isDep = file.includes(\"node_modules\");\n      const isFramework = /[\\\\/]@warlock\\.js[\\\\/]/.test(file);\n      const isUserCode = !isNodeInternal && !isDep && !isFramework;\n\n      const rel = isNodeInternal ? file : Path.toRelative(file);\n      const loc = `:${lineNo}:${col}`;\n\n      if (isUserCode) {\n        return (\n          `  ${colors.green(\"›\")} ${colors.dim(\"at\")} ` +\n          `${colors.yellow(fn || \"<anonymous>\")} ` +\n          `${colors.cyan(rel)}${colors.dim(loc)}`\n        );\n      }\n\n      const label = fn ? `at ${fn} ${rel}${loc}` : `at ${rel}${loc}`;\n      return `    ${colors.dim(label)}`;\n    })\n    .join(\"\\n\");\n}\n\nexport function devLogError(message: string, error?: any) {\n  console.log(`${timestamp()} ${colors.red(\"✗\")} ${colors.red(message)}`);\n  if (error?.stack) console.log(formatErrorStack(error.stack));\n}\n\nexport function devLogWarn(message: string) {\n  console.log(`${timestamp()} ${colors.yellow(\"⚠\")} ${colors.yellow(message)}`);\n}\n\nexport function devLogInfo(message: string) {\n  console.log(`${timestamp()} ${colors.cyan(message)}`);\n}\n\nexport function devLogDim(message: string) {\n  console.log(`${timestamp()} ${colors.dim(message)}`);\n}\n\nexport function devLogHMR(file: string, dependents?: number) {\n  const relativePath = Path.toRelative(file);\n  const depInfo = dependents\n    ? colors.dim(` +${dependents} module${dependents > 1 ? \"s\" : \"\"}`)\n    : \"\";\n  console.log(\n    `${timestamp()} 🔥 ${colors.green(\"hmr update\")} ${colors.dim(relativePath)}${depInfo}`,\n  );\n}\n\nexport function devLogConfig(file: string, connectors?: string[]) {\n  const relativePath = Path.toRelative(file);\n  const connectorInfo =\n    connectors && connectors.length > 0 ? colors.dim(` → restarting ${connectors.join(\", \")}`) : \"\";\n  console.log(\n    `${timestamp()} ${colors.cyan(\"config reload\")} ${colors.dim(relativePath)}${connectorInfo}`,\n  );\n}\n\nexport function devLogReady(message: string) {\n  console.log(`\\n${timestamp()}  ${colors.green(\"➜\")}  ${colors.bold(message)}`);\n}\n\nexport function devLogSection(title: string) {\n  console.log(`\\n${timestamp()} ${colors.bold(colors.cyan(title))}`);\n}\n\n/**\n * Format ERR_MODULE_NOT_FOUND so the displayed paths are relative to the\n * project root. The loader hook keeps source paths in the URL so we only\n * need to strip the absolute prefix — no cache-path translation any more.\n */\nexport function formatModuleNotFoundError(error: Error, suggestions?: string[]): string {\n  const match = error.message.match(/Cannot find module '([^']+)' imported from '([^']+)'/);\n  if (!match) return error.message;\n\n  const [, modulePath, importerPath] = match;\n  const lines: string[] = [\n    \"\",\n    `${colors.red(\"❌ MODULE NOT FOUND\")}`,\n    \"\",\n    `${colors.dim(\"Cannot find:\")} ${colors.cyan(Path.toRelative(modulePath))}`,\n    \"\",\n    `${colors.dim(\"Imported by:\")}`,\n    `  ${colors.yellow(\"→\")} ${colors.white(Path.toRelative(importerPath))}`,\n  ];\n\n  if (suggestions && suggestions.length > 0) {\n    lines.push(\"\");\n    lines.push(`${colors.dim(\"Did you mean?\")}`);\n    suggestions.forEach(s => lines.push(`  ${colors.cyan(\"→\")} ${colors.green(s)}`));\n  }\n\n  lines.push(\"\");\n  return lines.join(\"\\n\");\n}\n\n/** @deprecated alias retained for older callers. Use `devLog` directly. */\nexport const devServeLog = devLog;\n"],"mappings":";;;;;;;;AAQA,SAAS,YAAoB;CAC3B,OAAO,OAAO,IAAI,GAAG,MAAM,CAAC,CAAC,OAAO,YAAY,GAAG;AACrD;AAEA,SAAgB,OAAO,SAAiB;CACtC,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,SAAS;AACzC;AAEA,SAAgB,cAAc,SAAiB;CAC7C,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,MAAM,GAAG,EAAE,GAAG,OAAO,MAAM,OAAO,GAAG;AAC5E;;;;;;;;;;;;;;AAeA,SAAgB,iBAAiB,OAAuB;CACtD,MAAM,QAAQ;CACd,MAAM,YAAY;CAClB,IAAI,aAAa;CAEjB,OAAO,MACJ,MAAM,IAAI,CAAC,CACX,KAAI,SAAQ;EACX,MAAM,SAAS,KAAK,MAAM,KAAK;EAC/B,MAAM,OAAO,KAAK,MAAM,SAAS;EAEjC,IAAI,CAAC,UAAU,CAAC,MAGd,OADgB,aAAa,OAAO,IAAI,IAAI,IAAI,OAAO,KAAK,OAAO,IAAI,IAAI,CAAC;EAI9E,aAAa;EAEb,MAAM,KAAK,SAAS,OAAO,KAAK;EAChC,MAAM,OAAO,SAAS,OAAO,KAAK,KAAM;EACxC,MAAM,SAAS,SAAS,OAAO,KAAK,KAAM;EAC1C,MAAM,MAAM,SAAS,OAAO,KAAK,KAAM;EAEvC,MAAM,iBAAiB,KAAK,WAAW,OAAO;EAC9C,MAAM,QAAQ,KAAK,SAAS,cAAc;EAC1C,MAAM,cAAc,yBAAyB,KAAK,IAAI;EACtD,MAAM,aAAa,CAAC,kBAAkB,CAAC,SAAS,CAAC;EAEjD,MAAM,MAAM,iBAAiB,OAAO,KAAK,WAAW,IAAI;EACxD,MAAM,MAAM,IAAI,OAAO,GAAG;EAE1B,IAAI,YACF,OACE,KAAK,OAAO,MAAM,GAAG,EAAE,GAAG,OAAO,IAAI,IAAI,EAAE,GACxC,OAAO,OAAO,MAAM,aAAa,EAAE,GACnC,OAAO,KAAK,GAAG,IAAI,OAAO,IAAI,GAAG;EAIxC,MAAM,QAAQ,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,MAAM,MAAM;EACzD,OAAO,OAAO,OAAO,IAAI,KAAK;CAChC,CAAC,CAAC,CACD,KAAK,IAAI;AACd;AAEA,SAAgB,YAAY,SAAiB,OAAa;CACxD,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,IAAI,GAAG,EAAE,GAAG,OAAO,IAAI,OAAO,GAAG;CACtE,IAAI,OAAO,OAAO,QAAQ,IAAI,iBAAiB,MAAM,KAAK,CAAC;AAC7D;AAEA,SAAgB,WAAW,SAAiB;CAC1C,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,OAAO,GAAG,EAAE,GAAG,OAAO,OAAO,OAAO,GAAG;AAC9E;AAEA,SAAgB,WAAW,SAAiB;CAC1C,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,KAAK,OAAO,GAAG;AACtD;AAEA,SAAgB,UAAU,SAAiB;CACzC,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,IAAI,OAAO,GAAG;AACrD;AAEA,SAAgB,UAAU,MAAc,YAAqB;CAC3D,MAAM,eAAe,KAAK,WAAW,IAAI;CACzC,MAAM,UAAU,aACZ,OAAO,IAAI,KAAK,WAAW,SAAS,aAAa,IAAI,MAAM,IAAI,IAC/D;CACJ,QAAQ,IACN,GAAG,UAAU,EAAE,MAAM,OAAO,MAAM,YAAY,EAAE,GAAG,OAAO,IAAI,YAAY,IAAI,SAChF;AACF;AAWA,SAAgB,YAAY,SAAiB;CAC3C,QAAQ,IAAI,KAAK,UAAU,EAAE,IAAI,OAAO,MAAM,GAAG,EAAE,IAAI,OAAO,KAAK,OAAO,GAAG;AAC/E;AAEA,SAAgB,cAAc,OAAe;CAC3C,QAAQ,IAAI,KAAK,UAAU,EAAE,GAAG,OAAO,KAAK,OAAO,KAAK,KAAK,CAAC,GAAG;AACnE;;;;;;AAOA,SAAgB,0BAA0B,OAAc,aAAgC;CACtF,MAAM,QAAQ,MAAM,QAAQ,MAAM,sDAAsD;CACxF,IAAI,CAAC,OAAO,OAAO,MAAM;CAEzB,MAAM,GAAG,YAAY,gBAAgB;CACrC,MAAM,QAAkB;EACtB;EACA,GAAG,OAAO,IAAI,oBAAoB;EAClC;EACA,GAAG,OAAO,IAAI,cAAc,EAAE,GAAG,OAAO,KAAK,KAAK,WAAW,UAAU,CAAC;EACxE;EACA,GAAG,OAAO,IAAI,cAAc;EAC5B,KAAK,OAAO,OAAO,GAAG,EAAE,GAAG,OAAO,MAAM,KAAK,WAAW,YAAY,CAAC;CACvE;CAEA,IAAI,eAAe,YAAY,SAAS,GAAG;EACzC,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,GAAG,OAAO,IAAI,eAAe,GAAG;EAC3C,YAAY,SAAQ,MAAK,MAAM,KAAK,KAAK,OAAO,KAAK,GAAG,EAAE,GAAG,OAAO,MAAM,CAAC,GAAG,CAAC;CACjF;CAEA,MAAM,KAAK,EAAE;CACb,OAAO,MAAM,KAAK,IAAI;AACxB;;AAGA,MAAa,cAAc"}
+{"version":3,"file":"dev-logger.mjs","names":[],"sources":["C:/Work/Warlock.js/core/src/dev-server/dev-logger.ts"],"sourcesContent":["import { colors } from \"@mongez/copper\";\nimport dayjs from \"dayjs\";\nimport { Path } from \"../utils/normalized-path\";\n\n/**\n * Dev server logger — Vite-style formatting helpers.\n */\n\nfunction timestamp(): string {\n  return colors.dim(`${dayjs().format(\"HH:mm:ss A\")}`);\n}\n\nexport function devLog(message: string) {\n  console.log(`${timestamp()} ${message}`);\n}\n\nexport function devLogSuccess(message: string) {\n  console.log(`${timestamp()} ${colors.green(\"✓\")} ${colors.green(message)}`);\n}\n\n/**\n * Colourise a stack trace so the eye lands on *your* code.\n *\n * - Error header (`ReferenceError: x is not defined`) → bold red.\n * - Frames in project `src/` → highlighted: a green `›` pointer, yellow\n *   function name, cyan relative path, dim `:line:col`. These are almost\n *   always where the bug is.\n * - Framework (`@warlock.js`), `node_modules`, and `node:` internal frames\n *   → dimmed and relativised. Still there for context, just out of the way.\n *\n * Source maps are enabled in dev, so the paths/lines here are already the\n * original `.ts` locations — this only changes how they're painted.\n */\nexport function formatErrorStack(stack: string): string {\n  const frame = /^(\\s*)at (.+?) \\((.+):(\\d+):(\\d+)\\)$/;\n  const bareFrame = /^(\\s*)at (.+):(\\d+):(\\d+)$/;\n  let headerDone = false;\n\n  return stack\n    .split(\"\\n\")\n    .map(line => {\n      const withFn = line.match(frame);\n      const bare = line.match(bareFrame);\n\n      if (!withFn && !bare) {\n        // Header line(s) before the first frame.\n        const painted = headerDone ? colors.dim(line) : colors.bold(colors.red(line));\n        return painted;\n      }\n\n      headerDone = true;\n\n      const fn = withFn ? withFn[2] : \"\";\n      const file = withFn ? withFn[3] : bare![2];\n      const lineNo = withFn ? withFn[4] : bare![3];\n      const col = withFn ? withFn[5] : bare![4];\n\n      const isNodeInternal = file.startsWith(\"node:\");\n      const isDep = file.includes(\"node_modules\");\n      const isFramework = /[\\\\/]@warlock\\.js[\\\\/]/.test(file);\n      const isUserCode = !isNodeInternal && !isDep && !isFramework;\n\n      const rel = isNodeInternal ? file : Path.toRelative(file);\n      const loc = `:${lineNo}:${col}`;\n\n      if (isUserCode) {\n        return (\n          `  ${colors.green(\"›\")} ${colors.dim(\"at\")} ` +\n          `${colors.yellow(fn || \"<anonymous>\")} ` +\n          `${colors.cyan(rel)}${colors.dim(loc)}`\n        );\n      }\n\n      const label = fn ? `at ${fn} ${rel}${loc}` : `at ${rel}${loc}`;\n      return `    ${colors.dim(label)}`;\n    })\n    .join(\"\\n\");\n}\n\nexport function devLogError(message: string, error?: any) {\n  console.log(`${timestamp()} ${colors.red(\"✗\")} ${colors.red(message)}`);\n  if (error?.stack) console.log(formatErrorStack(error.stack));\n}\n\nexport function devLogWarn(message: string) {\n  console.log(`${timestamp()} ${colors.yellow(\"⚠\")} ${colors.yellow(message)}`);\n}\n\nexport function devLogInfo(message: string) {\n  console.log(`${timestamp()} ${colors.cyan(message)}`);\n}\n\nexport function devLogDim(message: string) {\n  console.log(`${timestamp()} ${colors.dim(message)}`);\n}\n\nexport function devLogHMR(file: string, dependents?: number) {\n  const relativePath = Path.toRelative(file);\n  const depInfo = dependents\n    ? colors.dim(` +${dependents} module${dependents > 1 ? \"s\" : \"\"}`)\n    : \"\";\n  console.log(\n    `${timestamp()} 🔥 ${colors.green(\"hmr update\")} ${colors.dim(relativePath)}${depInfo}`,\n  );\n}\n\nexport function devLogConfig(file: string, connectors?: string[]) {\n  const relativePath = Path.toRelative(file);\n  const connectorInfo =\n    connectors && connectors.length > 0 ? colors.dim(` → restarting ${connectors.join(\", \")}`) : \"\";\n  console.log(\n    `${timestamp()} ${colors.cyan(\"config reload\")} ${colors.dim(relativePath)}${connectorInfo}`,\n  );\n}\n\nexport function devLogReady(message: string) {\n  console.log(`\\n${timestamp()}  ${colors.green(\"➜\")}  ${colors.bold(message)}`);\n}\n\nexport function devLogSection(title: string) {\n  console.log(`\\n${timestamp()} ${colors.bold(colors.cyan(title))}`);\n}\n\n/**\n * Format ERR_MODULE_NOT_FOUND so the displayed paths are relative to the\n * project root. The loader hook keeps source paths in the URL so we only\n * need to strip the absolute prefix — no cache-path translation any more.\n */\nexport function formatModuleNotFoundError(error: Error, suggestions?: string[]): string {\n  const match = error.message.match(/Cannot find module '([^']+)' imported from '([^']+)'/);\n  if (!match) return error.message;\n\n  const [, modulePath, importerPath] = match;\n  const lines: string[] = [\n    \"\",\n    `${colors.red(\"❌ MODULE NOT FOUND\")}`,\n    \"\",\n    `${colors.dim(\"Cannot find:\")} ${colors.cyan(Path.toRelative(modulePath))}`,\n    \"\",\n    `${colors.dim(\"Imported by:\")}`,\n    `  ${colors.yellow(\"→\")} ${colors.white(Path.toRelative(importerPath))}`,\n  ];\n\n  if (suggestions && suggestions.length > 0) {\n    lines.push(\"\");\n    lines.push(`${colors.dim(\"Did you mean?\")}`);\n    suggestions.forEach(s => lines.push(`  ${colors.cyan(\"→\")} ${colors.green(s)}`));\n  }\n\n  lines.push(\"\");\n  return lines.join(\"\\n\");\n}\n\n/** @deprecated alias retained for older callers. Use `devLog` directly. */\nexport const devServeLog = devLog;\n"],"mappings":";;;;;;;;AAQA,SAAS,YAAoB;CAC3B,OAAO,OAAO,IAAI,GAAG,MAAM,EAAE,OAAO,YAAY,GAAG;AACrD;AAEA,SAAgB,OAAO,SAAiB;CACtC,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,SAAS;AACzC;AAEA,SAAgB,cAAc,SAAiB;CAC7C,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,MAAM,GAAG,EAAE,GAAG,OAAO,MAAM,OAAO,GAAG;AAC5E;;;;;;;;;;;;;;AAeA,SAAgB,iBAAiB,OAAuB;CACtD,MAAM,QAAQ;CACd,MAAM,YAAY;CAClB,IAAI,aAAa;CAEjB,OAAO,MACJ,MAAM,IAAI,EACV,KAAI,SAAQ;EACX,MAAM,SAAS,KAAK,MAAM,KAAK;EAC/B,MAAM,OAAO,KAAK,MAAM,SAAS;EAEjC,IAAI,CAAC,UAAU,CAAC,MAGd,OADgB,aAAa,OAAO,IAAI,IAAI,IAAI,OAAO,KAAK,OAAO,IAAI,IAAI,CAAC;EAI9E,aAAa;EAEb,MAAM,KAAK,SAAS,OAAO,KAAK;EAChC,MAAM,OAAO,SAAS,OAAO,KAAK,KAAM;EACxC,MAAM,SAAS,SAAS,OAAO,KAAK,KAAM;EAC1C,MAAM,MAAM,SAAS,OAAO,KAAK,KAAM;EAEvC,MAAM,iBAAiB,KAAK,WAAW,OAAO;EAC9C,MAAM,QAAQ,KAAK,SAAS,cAAc;EAC1C,MAAM,cAAc,yBAAyB,KAAK,IAAI;EACtD,MAAM,aAAa,CAAC,kBAAkB,CAAC,SAAS,CAAC;EAEjD,MAAM,MAAM,iBAAiB,OAAO,KAAK,WAAW,IAAI;EACxD,MAAM,MAAM,IAAI,OAAO,GAAG;EAE1B,IAAI,YACF,OACE,KAAK,OAAO,MAAM,GAAG,EAAE,GAAG,OAAO,IAAI,IAAI,EAAE,GACxC,OAAO,OAAO,MAAM,aAAa,EAAE,GACnC,OAAO,KAAK,GAAG,IAAI,OAAO,IAAI,GAAG;EAIxC,MAAM,QAAQ,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,MAAM,MAAM;EACzD,OAAO,OAAO,OAAO,IAAI,KAAK;CAChC,CAAC,EACA,KAAK,IAAI;AACd;AAEA,SAAgB,YAAY,SAAiB,OAAa;CACxD,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,IAAI,GAAG,EAAE,GAAG,OAAO,IAAI,OAAO,GAAG;CACtE,IAAI,OAAO,OAAO,QAAQ,IAAI,iBAAiB,MAAM,KAAK,CAAC;AAC7D;AAEA,SAAgB,WAAW,SAAiB;CAC1C,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,OAAO,GAAG,EAAE,GAAG,OAAO,OAAO,OAAO,GAAG;AAC9E;AAEA,SAAgB,WAAW,SAAiB;CAC1C,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,KAAK,OAAO,GAAG;AACtD;AAEA,SAAgB,UAAU,SAAiB;CACzC,QAAQ,IAAI,GAAG,UAAU,EAAE,GAAG,OAAO,IAAI,OAAO,GAAG;AACrD;AAEA,SAAgB,UAAU,MAAc,YAAqB;CAC3D,MAAM,eAAe,KAAK,WAAW,IAAI;CACzC,MAAM,UAAU,aACZ,OAAO,IAAI,KAAK,WAAW,SAAS,aAAa,IAAI,MAAM,IAAI,IAC/D;CACJ,QAAQ,IACN,GAAG,UAAU,EAAE,MAAM,OAAO,MAAM,YAAY,EAAE,GAAG,OAAO,IAAI,YAAY,IAAI,SAChF;AACF;AAeA,SAAgB,cAAc,OAAe;CAC3C,QAAQ,IAAI,KAAK,UAAU,EAAE,GAAG,OAAO,KAAK,OAAO,KAAK,KAAK,CAAC,GAAG;AACnE;;;;;;AAOA,SAAgB,0BAA0B,OAAc,aAAgC;CACtF,MAAM,QAAQ,MAAM,QAAQ,MAAM,sDAAsD;CACxF,IAAI,CAAC,OAAO,OAAO,MAAM;CAEzB,MAAM,GAAG,YAAY,gBAAgB;CACrC,MAAM,QAAkB;EACtB;EACA,GAAG,OAAO,IAAI,oBAAoB;EAClC;EACA,GAAG,OAAO,IAAI,cAAc,EAAE,GAAG,OAAO,KAAK,KAAK,WAAW,UAAU,CAAC;EACxE;EACA,GAAG,OAAO,IAAI,cAAc;EAC5B,KAAK,OAAO,OAAO,GAAG,EAAE,GAAG,OAAO,MAAM,KAAK,WAAW,YAAY,CAAC;CACvE;CAEA,IAAI,eAAe,YAAY,SAAS,GAAG;EACzC,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,GAAG,OAAO,IAAI,eAAe,GAAG;EAC3C,YAAY,SAAQ,MAAK,MAAM,KAAK,KAAK,OAAO,KAAK,GAAG,EAAE,GAAG,OAAO,MAAM,CAAC,GAAG,CAAC;CACjF;CAEA,MAAM,KAAK,EAAE;CACb,OAAO,MAAM,KAAK,IAAI;AACxB;;AAGA,MAAa,cAAc"}

package/esm/dev-server/development-server.mjs

@@ -4,18 +4,19 @@ import { ConnectorLifecyclePhase } from "../connectors/types.mjs";
 import { connectorsManager } from "../connectors/connectors-manager.mjs";
 import { warlockConfigManager } from "../warlock-config/warlock-config.manager.mjs";
 import "../warlock-config/index.mjs";
-import { devLogInfo, devLogReady, devLogSection, devLogWarn, devServeLog } from "./dev-logger.mjs";
+import { devLogInfo, devLogSection, devLogWarn, devServeLog } from "./dev-logger.mjs";
 import { MANIFEST_PATH } from "./flags.mjs";
 import { filesOrchestrator } from "./files-orchestrator.mjs";
 import { restartDevServer } from "./restart-dev-server.mjs";
 import { devServerShortcuts } from "./shortcuts.mjs";
 import { LayerExecutor } from "./layer-executor.mjs";
+import { printReadyBlock } from "./ready-block.mjs";
 import { typeGenerator } from "./type-generator.mjs";
 import { colors } from "@mongez/copper";
 import events from "@mongez/events";
 import { fileExistsAsync, unlinkAsync } from "@warlock.js/fs";
 
-//#region ../core/src/dev-server/development-server.ts
+//#region core/src/dev-server/development-server.ts
 /**
 * Top-level coordinator for `warlock dev`. Wires the file orchestrator, the
 * connectors, and the layer executor together, and listens for the watcher's
@@ -46,12 +47,12 @@ var DevelopmentServer = class {
 			this.layerExecutor = new LayerExecutor(filesOrchestrator.getDependencyGraph(), filesOrchestrator.specialFilesCollector, filesOrchestrator.moduleLoader, (absolutePath) => filesOrchestrator.bumpVersion(absolutePath), () => filesOrchestrator.flushVersionBumps());
 			this.running = true;
 			const duration = performance.now() - startedAt;
-			devLogReady(`Development Server is ready in ${colors.greenBright(parseDuration(duration))}`);
 			Application.markBooted({
 				environment: Application.environment,
 				runtimeStrategy: Application.runtimeStrategy,
 				bootDurationMs: duration
 			});
+			printReadyBlock(duration);
 			const devServerConfig = await warlockConfigManager.get("devServer");
 			const generateTypings = this.options.generateTypings ?? devServerConfig?.generateTypings ?? true;
 			const healthCheckers = this.options.healthCheckers ?? devServerConfig?.healthCheckers ?? true;
@@ -129,11 +130,6 @@ function isEnvPath(path) {
 	const basename = path.split("/").pop() ?? path;
 	return basename === ".env" || basename.startsWith(".env.");
 }
-function parseDuration(ms) {
-	if (ms < 1e3) return `${ms.toFixed(2)}ms`;
-	if (ms > 6e4) return `${(ms / 6e4).toFixed(2)}m`;
-	return `${(ms / 1e3).toFixed(2)}s`;
-}
 
 //#endregion
 export { DevelopmentServer };