@veloxts/cli 0.4.1 → 0.4.3

package/dist/seeding/loader.js

@@ -0,0 +1,210 @@
+/**
+ * Seeder Loader
+ *
+ * Load seeder files from the filesystem.
+ */
+import fs from 'node:fs/promises';
+import path from 'node:path';
+import { pathToFileURL } from 'node:url';
+import { filesystemError, invalidExport } from './errors.js';
+// ============================================================================
+// Constants
+// ============================================================================
+/**
+ * Default path for seeders relative to project root
+ */
+export const DEFAULT_SEEDERS_PATH = 'src/database/seeders';
+/**
+ * File patterns that indicate a seeder file
+ */
+const SEEDER_FILE_PATTERNS = [/Seeder\.(ts|js)$/, /\.seeder\.(ts|js)$/];
+/**
+ * Files to skip
+ */
+const SKIP_FILES = ['index.ts', 'index.js', 'DatabaseSeeder.ts', 'DatabaseSeeder.js'];
+// ============================================================================
+// Loader Functions
+// ============================================================================
+/**
+ * Check if seeders directory exists.
+ *
+ * @param cwd - Project root directory
+ * @param seedersPath - Path to seeders directory (relative to cwd)
+ */
+export async function seedersDirectoryExists(cwd, seedersPath = DEFAULT_SEEDERS_PATH) {
+    const fullPath = path.join(cwd, seedersPath);
+    try {
+        const stat = await fs.stat(fullPath);
+        return stat.isDirectory();
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Load all seeders from the filesystem.
+ *
+ * @param cwd - Project root directory
+ * @param seedersPath - Path to seeders directory (relative to cwd)
+ * @returns Load result with seeders and any errors
+ */
+export async function loadSeeders(cwd, seedersPath = DEFAULT_SEEDERS_PATH) {
+    const fullPath = path.join(cwd, seedersPath);
+    const seeders = [];
+    const errors = [];
+    // Check directory exists
+    if (!(await seedersDirectoryExists(cwd, seedersPath))) {
+        return { seeders: [], errors: [] };
+    }
+    // List files
+    let files;
+    try {
+        files = await fs.readdir(fullPath);
+    }
+    catch (error) {
+        const err = error instanceof Error ? error : new Error(String(error));
+        throw filesystemError('reading seeders directory', fullPath, err);
+    }
+    // Filter to seeder files
+    const seederFiles = files.filter((file) => {
+        // Skip non-seeder files
+        if (SKIP_FILES.includes(file))
+            return false;
+        // Check if matches seeder pattern
+        return SEEDER_FILE_PATTERNS.some((pattern) => pattern.test(file));
+    });
+    // Load each seeder
+    for (const file of seederFiles) {
+        const filePath = path.join(fullPath, file);
+        try {
+            const seeder = await loadSeederFile(filePath);
+            seeders.push({ seeder, filePath });
+        }
+        catch (error) {
+            const err = error instanceof Error ? error : new Error(String(error));
+            errors.push({ filePath, error: err.message });
+        }
+    }
+    return { seeders, errors };
+}
+/**
+ * Load the main DatabaseSeeder entry point.
+ *
+ * @param cwd - Project root directory
+ * @param seedersPath - Path to seeders directory (relative to cwd)
+ * @returns DatabaseSeeder if found, null otherwise
+ */
+export async function loadDatabaseSeeder(cwd, seedersPath = DEFAULT_SEEDERS_PATH) {
+    const fullPath = path.join(cwd, seedersPath);
+    // Try both .ts and .js extensions
+    for (const ext of ['ts', 'js']) {
+        const filePath = path.join(fullPath, `DatabaseSeeder.${ext}`);
+        try {
+            const stat = await fs.stat(filePath);
+            if (stat.isFile()) {
+                return await loadSeederFile(filePath);
+            }
+        }
+        catch {
+            // File doesn't exist, try next
+        }
+    }
+    return null;
+}
+/**
+ * Load a single seeder file.
+ *
+ * @param filePath - Absolute path to seeder file
+ * @returns Loaded seeder
+ */
+async function loadSeederFile(filePath) {
+    // Convert to file URL for dynamic import
+    const fileUrl = pathToFileURL(filePath).href;
+    // Dynamic import
+    let module;
+    try {
+        module = (await import(fileUrl));
+    }
+    catch (error) {
+        const err = error instanceof Error ? error : new Error(String(error));
+        throw invalidExport(filePath, `Failed to import: ${err.message}`);
+    }
+    // Look for seeder export
+    const seeder = findSeederExport(module);
+    if (!seeder) {
+        throw invalidExport(filePath, 'No valid seeder export found. Export a const named *Seeder or use default export.');
+    }
+    // Validate seeder shape
+    validateSeeder(seeder, filePath);
+    return seeder;
+}
+/**
+ * Find a seeder export in a module.
+ */
+function findSeederExport(module) {
+    // Check default export first
+    if (module.default && isSeederLike(module.default)) {
+        return module.default;
+    }
+    // Look for named export ending in 'Seeder'
+    for (const [key, value] of Object.entries(module)) {
+        if (key.endsWith('Seeder') && isSeederLike(value)) {
+            return value;
+        }
+    }
+    return null;
+}
+/**
+ * Check if a value looks like a seeder.
+ */
+function isSeederLike(value) {
+    if (!value || typeof value !== 'object')
+        return false;
+    const obj = value;
+    return typeof obj.name === 'string' && typeof obj.run === 'function';
+}
+/**
+ * Validate a seeder has the required shape.
+ */
+function validateSeeder(seeder, filePath) {
+    if (!seeder || typeof seeder !== 'object') {
+        throw invalidExport(filePath, 'Seeder must be an object');
+    }
+    const obj = seeder;
+    if (typeof obj.name !== 'string' || obj.name.length === 0) {
+        throw invalidExport(filePath, "Seeder must have a non-empty 'name' property");
+    }
+    if (typeof obj.run !== 'function') {
+        throw invalidExport(filePath, "Seeder must have a 'run' function");
+    }
+    if (obj.dependencies !== undefined && !Array.isArray(obj.dependencies)) {
+        throw invalidExport(filePath, "'dependencies' must be an array of strings");
+    }
+    if (obj.environments !== undefined && !Array.isArray(obj.environments)) {
+        throw invalidExport(filePath, "'environments' must be an array");
+    }
+    if (obj.truncate !== undefined && typeof obj.truncate !== 'function') {
+        throw invalidExport(filePath, "'truncate' must be a function");
+    }
+}
+/**
+ * Get all seeder file paths from directory.
+ *
+ * @param cwd - Project root directory
+ * @param seedersPath - Path to seeders directory (relative to cwd)
+ */
+export async function getSeederFiles(cwd, seedersPath = DEFAULT_SEEDERS_PATH) {
+    const fullPath = path.join(cwd, seedersPath);
+    if (!(await seedersDirectoryExists(cwd, seedersPath))) {
+        return [];
+    }
+    const files = await fs.readdir(fullPath);
+    return files
+        .filter((file) => {
+        if (SKIP_FILES.includes(file))
+            return false;
+        return SEEDER_FILE_PATTERNS.some((pattern) => pattern.test(file));
+    })
+        .map((file) => path.join(fullPath, file));
+}
+//# sourceMappingURL=loader.js.map

package/dist/seeding/loader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loader.js","sourceRoot":"","sources":["../../src/seeding/loader.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAClC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEzC,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAG7D,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,sBAAsB,CAAC;AAE3D;;GAEG;AACH,MAAM,oBAAoB,GAAG,CAAC,kBAAkB,EAAE,oBAAoB,CAAC,CAAC;AAExE;;GAEG;AACH,MAAM,UAAU,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,mBAAmB,EAAE,mBAAmB,CAAC,CAAC;AAEtF,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,GAAW,EACX,cAAsB,oBAAoB;IAE1C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAC7C,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,GAAW,EACX,cAAsB,oBAAoB;IAE1C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,MAAM,GAA0C,EAAE,CAAC;IAEzD,yBAAyB;IACzB,IAAI,CAAC,CAAC,MAAM,sBAAsB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC;QACtD,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IACrC,CAAC;IAED,aAAa;IACb,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACrC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACtE,MAAM,eAAe,CAAC,2BAA2B,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;IACpE,CAAC;IAED,yBAAyB;IACzB,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACxC,wBAAwB;QACxB,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAE5C,kCAAkC;QAClC,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,mBAAmB;IACnB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAE3C,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,QAAQ,CAAC,CAAC;YAC9C,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;QACrC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACtE,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC7B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,GAAW,EACX,cAAsB,oBAAoB;IAE1C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAE7C,kCAAkC;IAClC,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,kBAAkB,GAAG,EAAE,CAAC,CAAC;QAE9D,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClB,OAAO,MAAM,cAAc,CAAC,QAAQ,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,+BAA+B;QACjC,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,cAAc,CAAC,QAAgB;IAC5C,yCAAyC;IACzC,MAAM,OAAO,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC;IAE7C,iBAAiB;IACjB,IAAI,MAA+B,CAAC;IACpC,IAAI,CAAC;QACH,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,OAAO,CAAC,CAA4B,CAAC;IAC9D,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACtE,MAAM,aAAa,CAAC,QAAQ,EAAE,qBAAqB,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,yBAAyB;IACzB,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAExC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,aAAa,CACjB,QAAQ,EACR,mFAAmF,CACpF,CAAC;IACJ,CAAC;IAED,wBAAwB;IACxB,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAEjC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,MAA+B;IACvD,6BAA6B;IAC7B,IAAI,MAAM,CAAC,OAAO,IAAI,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QACnD,OAAO,MAAM,CAAC,OAAiB,CAAC;IAClC,CAAC;IAED,2CAA2C;IAC3C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,IAAI,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;YAClD,OAAO,KAAe,CAAC;QACzB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,KAAc;IAClC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAEtD,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,OAAO,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,GAAG,CAAC,GAAG,KAAK,UAAU,CAAC;AACvE,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,MAAe,EAAE,QAAgB;IACvD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC1C,MAAM,aAAa,CAAC,QAAQ,EAAE,0BAA0B,CAAC,CAAC;IAC5D,CAAC;IAED,MAAM,GAAG,GAAG,MAAiC,CAAC;IAE9C,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1D,MAAM,aAAa,CAAC,QAAQ,EAAE,8CAA8C,CAAC,CAAC;IAChF,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,GAAG,KAAK,UAAU,EAAE,CAAC;QAClC,MAAM,aAAa,CAAC,QAAQ,EAAE,mCAAmC,CAAC,CAAC;IACrE,CAAC;IAED,IAAI,GAAG,CAAC,YAAY,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;QACvE,MAAM,aAAa,CAAC,QAAQ,EAAE,4CAA4C,CAAC,CAAC;IAC9E,CAAC;IAED,IAAI,GAAG,CAAC,YAAY,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;QACvE,MAAM,aAAa,CAAC,QAAQ,EAAE,iCAAiC,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;QACrE,MAAM,aAAa,CAAC,QAAQ,EAAE,+BAA+B,CAAC,CAAC;IACjE,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,GAAW,EACX,cAAsB,oBAAoB;IAE1C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAE7C,IAAI,CAAC,CAAC,MAAM,sBAAsB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC;QACtD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAEzC,OAAO,KAAK;SACT,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACf,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC5C,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9C,CAAC"}

package/dist/seeding/registry.d.ts

@@ -0,0 +1,116 @@
+/**
+ * Seeder Registry
+ *
+ * Manages seeder registration and dependency resolution with topological sorting.
+ */
+import type { Environment, Seeder } from './types.js';
+/**
+ * Registry for managing seeders with dependency resolution.
+ *
+ * Handles seeder registration, retrieval, and ordering based on dependencies
+ * using topological sorting.
+ *
+ * @example
+ * ```typescript
+ * const registry = new SeederRegistry();
+ *
+ * registry.register(UserSeeder);
+ * registry.register(PostSeeder);  // depends on UserSeeder
+ *
+ * // Get seeders in correct execution order
+ * const ordered = registry.getInOrder();
+ * ```
+ */
+export declare class SeederRegistry {
+    private seeders;
+    /**
+     * Register a seeder in the registry.
+     *
+     * @param seeder - Seeder to register
+     * @throws Error if seeder with same name already exists
+     */
+    register(seeder: Seeder): void;
+    /**
+     * Register multiple seeders.
+     *
+     * @param seeders - Seeders to register
+     */
+    registerMany(seeders: Seeder[]): void;
+    /**
+     * Get a seeder by name.
+     *
+     * @param name - Seeder name
+     * @returns Seeder if found, undefined otherwise
+     */
+    get(name: string): Seeder | undefined;
+    /**
+     * Get a seeder by name, throwing if not found.
+     *
+     * @param name - Seeder name
+     * @returns Seeder
+     * @throws SeederError if not found
+     */
+    getOrThrow(name: string): Seeder;
+    /**
+     * Check if a seeder exists.
+     *
+     * @param name - Seeder name
+     */
+    has(name: string): boolean;
+    /**
+     * Get all registered seeder names.
+     */
+    getNames(): string[];
+    /**
+     * Get all registered seeders.
+     */
+    getAll(): Seeder[];
+    /**
+     * Get seeder count.
+     */
+    get size(): number;
+    /**
+     * Clear all registered seeders.
+     */
+    clear(): void;
+    /**
+     * Validate all seeder dependencies exist and there are no circular dependencies.
+     *
+     * @throws SeederError if dependencies are invalid
+     */
+    validateDependencies(): void;
+    /**
+     * Get all seeders in dependency order (topological sort).
+     *
+     * Seeders with no dependencies come first, then seeders that depend on them, etc.
+     *
+     * @param environment - Optional environment filter
+     * @returns Seeders in execution order
+     * @throws SeederError if circular dependency detected
+     */
+    getInOrder(environment?: Environment): Seeder[];
+    /**
+     * Get seeders filtered by names in dependency order.
+     *
+     * @param names - Seeder names to include (and their dependencies)
+     * @param environment - Optional environment filter
+     */
+    getByNames(names: string[], environment?: Environment): Seeder[];
+    /**
+     * Check if seeder should run in given environment.
+     */
+    private shouldRunInEnvironment;
+    /**
+     * Detect circular dependencies using DFS.
+     */
+    private detectCircularDependencies;
+    /**
+     * DFS helper for cycle detection.
+     */
+    private detectCycleDFS;
+    /**
+     * Find and return a cycle starting from the given node.
+     */
+    private findCycle;
+}
+//# sourceMappingURL=registry.d.ts.map

package/dist/seeding/registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../../src/seeding/registry.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAMtD;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,OAAO,CAAkC;IAEjD;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAO9B;;;;OAIG;IACH,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAMrC;;;;;OAKG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIrC;;;;;;OAMG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAQhC;;;;OAIG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAI1B;;OAEG;IACH,QAAQ,IAAI,MAAM,EAAE;IAIpB;;OAEG;IACH,MAAM,IAAI,MAAM,EAAE;IAIlB;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,KAAK,IAAI,IAAI;IAQb;;;;OAIG;IACH,oBAAoB,IAAI,IAAI;IAc5B;;;;;;;;OAQG;IACH,UAAU,CAAC,WAAW,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAmE/C;;;;;OAKG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,WAAW,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAgChE;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAQ9B;;OAEG;IACH,OAAO,CAAC,0BAA0B;IAWlC;;OAEG;IACH,OAAO,CAAC,cAAc;IAoBtB;;OAEG;IACH,OAAO,CAAC,SAAS;CAgClB"}

package/dist/seeding/registry.js

@@ -0,0 +1,298 @@
+/**
+ * Seeder Registry
+ *
+ * Manages seeder registration and dependency resolution with topological sorting.
+ */
+import { circularDependency, dependencyNotFound, seederNotFound } from './errors.js';
+// ============================================================================
+// Seeder Registry
+// ============================================================================
+/**
+ * Registry for managing seeders with dependency resolution.
+ *
+ * Handles seeder registration, retrieval, and ordering based on dependencies
+ * using topological sorting.
+ *
+ * @example
+ * ```typescript
+ * const registry = new SeederRegistry();
+ *
+ * registry.register(UserSeeder);
+ * registry.register(PostSeeder);  // depends on UserSeeder
+ *
+ * // Get seeders in correct execution order
+ * const ordered = registry.getInOrder();
+ * ```
+ */
+export class SeederRegistry {
+    seeders = new Map();
+    /**
+     * Register a seeder in the registry.
+     *
+     * @param seeder - Seeder to register
+     * @throws Error if seeder with same name already exists
+     */
+    register(seeder) {
+        if (this.seeders.has(seeder.name)) {
+            throw new Error(`Seeder '${seeder.name}' is already registered`);
+        }
+        this.seeders.set(seeder.name, seeder);
+    }
+    /**
+     * Register multiple seeders.
+     *
+     * @param seeders - Seeders to register
+     */
+    registerMany(seeders) {
+        for (const seeder of seeders) {
+            this.register(seeder);
+        }
+    }
+    /**
+     * Get a seeder by name.
+     *
+     * @param name - Seeder name
+     * @returns Seeder if found, undefined otherwise
+     */
+    get(name) {
+        return this.seeders.get(name);
+    }
+    /**
+     * Get a seeder by name, throwing if not found.
+     *
+     * @param name - Seeder name
+     * @returns Seeder
+     * @throws SeederError if not found
+     */
+    getOrThrow(name) {
+        const seeder = this.seeders.get(name);
+        if (!seeder) {
+            throw seederNotFound(name);
+        }
+        return seeder;
+    }
+    /**
+     * Check if a seeder exists.
+     *
+     * @param name - Seeder name
+     */
+    has(name) {
+        return this.seeders.has(name);
+    }
+    /**
+     * Get all registered seeder names.
+     */
+    getNames() {
+        return Array.from(this.seeders.keys());
+    }
+    /**
+     * Get all registered seeders.
+     */
+    getAll() {
+        return Array.from(this.seeders.values());
+    }
+    /**
+     * Get seeder count.
+     */
+    get size() {
+        return this.seeders.size;
+    }
+    /**
+     * Clear all registered seeders.
+     */
+    clear() {
+        this.seeders.clear();
+    }
+    // ==========================================================================
+    // Dependency Resolution
+    // ==========================================================================
+    /**
+     * Validate all seeder dependencies exist and there are no circular dependencies.
+     *
+     * @throws SeederError if dependencies are invalid
+     */
+    validateDependencies() {
+        // Check all dependencies exist
+        for (const seeder of this.seeders.values()) {
+            for (const depName of seeder.dependencies ?? []) {
+                if (!this.seeders.has(depName)) {
+                    throw dependencyNotFound(seeder.name, depName);
+                }
+            }
+        }
+        // Check for circular dependencies
+        this.detectCircularDependencies();
+    }
+    /**
+     * Get all seeders in dependency order (topological sort).
+     *
+     * Seeders with no dependencies come first, then seeders that depend on them, etc.
+     *
+     * @param environment - Optional environment filter
+     * @returns Seeders in execution order
+     * @throws SeederError if circular dependency detected
+     */
+    getInOrder(environment) {
+        this.validateDependencies();
+        // Filter by environment if specified
+        const seeders = environment
+            ? Array.from(this.seeders.values()).filter((s) => this.shouldRunInEnvironment(s, environment))
+            : Array.from(this.seeders.values());
+        // Build adjacency list and in-degree count
+        const inDegree = new Map();
+        const adjacency = new Map();
+        for (const seeder of seeders) {
+            inDegree.set(seeder.name, 0);
+            adjacency.set(seeder.name, []);
+        }
+        // Count dependencies (in-degree) and build reverse adjacency
+        for (const seeder of seeders) {
+            for (const depName of seeder.dependencies ?? []) {
+                // Only count if dependency is in our filtered set
+                if (inDegree.has(depName)) {
+                    inDegree.set(seeder.name, (inDegree.get(seeder.name) ?? 0) + 1);
+                    adjacency.get(depName)?.push(seeder.name);
+                }
+            }
+        }
+        // Kahn's algorithm for topological sort
+        const queue = [];
+        const result = [];
+        // Start with seeders that have no dependencies
+        for (const [name, degree] of inDegree) {
+            if (degree === 0) {
+                queue.push(name);
+            }
+        }
+        while (queue.length > 0) {
+            const name = queue.shift();
+            if (!name)
+                continue;
+            const seeder = this.seeders.get(name);
+            if (!seeder)
+                continue;
+            result.push(seeder);
+            // Reduce in-degree of dependents
+            for (const dependent of adjacency.get(name) ?? []) {
+                const newDegree = (inDegree.get(dependent) ?? 0) - 1;
+                inDegree.set(dependent, newDegree);
+                if (newDegree === 0) {
+                    queue.push(dependent);
+                }
+            }
+        }
+        // If result doesn't contain all seeders, there's a cycle
+        if (result.length !== seeders.length) {
+            // Find the cycle for error message
+            const remaining = seeders.filter((s) => !result.includes(s));
+            const cycle = this.findCycle(remaining[0].name);
+            throw circularDependency(cycle);
+        }
+        return result;
+    }
+    /**
+     * Get seeders filtered by names in dependency order.
+     *
+     * @param names - Seeder names to include (and their dependencies)
+     * @param environment - Optional environment filter
+     */
+    getByNames(names, environment) {
+        // Collect requested seeders and all their transitive dependencies
+        const needed = new Set();
+        const stack = [...names];
+        while (stack.length > 0) {
+            const name = stack.pop();
+            if (!name || needed.has(name))
+                continue;
+            const seeder = this.getOrThrow(name);
+            // Skip if not for this environment
+            if (environment && !this.shouldRunInEnvironment(seeder, environment)) {
+                continue;
+            }
+            needed.add(name);
+            // Add dependencies to stack
+            for (const dep of seeder.dependencies ?? []) {
+                stack.push(dep);
+            }
+        }
+        // Get all in order, then filter to only needed
+        return this.getInOrder(environment).filter((s) => needed.has(s.name));
+    }
+    // ==========================================================================
+    // Private Helpers
+    // ==========================================================================
+    /**
+     * Check if seeder should run in given environment.
+     */
+    shouldRunInEnvironment(seeder, environment) {
+        // If no environments specified, run in all
+        if (!seeder.environments || seeder.environments.length === 0) {
+            return true;
+        }
+        return seeder.environments.includes(environment);
+    }
+    /**
+     * Detect circular dependencies using DFS.
+     */
+    detectCircularDependencies() {
+        const visited = new Set();
+        const recursionStack = new Set();
+        for (const seeder of this.seeders.values()) {
+            if (!visited.has(seeder.name)) {
+                this.detectCycleDFS(seeder.name, visited, recursionStack);
+            }
+        }
+    }
+    /**
+     * DFS helper for cycle detection.
+     */
+    detectCycleDFS(name, visited, stack) {
+        visited.add(name);
+        stack.add(name);
+        const seeder = this.seeders.get(name);
+        if (!seeder)
+            return;
+        for (const depName of seeder.dependencies ?? []) {
+            if (!visited.has(depName)) {
+                this.detectCycleDFS(depName, visited, stack);
+            }
+            else if (stack.has(depName)) {
+                // Found cycle - build the cycle path for error message
+                const cycle = this.findCycle(depName);
+                throw circularDependency(cycle);
+            }
+        }
+        stack.delete(name);
+    }
+    /**
+     * Find and return a cycle starting from the given node.
+     */
+    findCycle(startName) {
+        const path = [];
+        const visited = new Set();
+        const dfs = (name) => {
+            if (path.includes(name)) {
+                // Found cycle - close it by adding the start again
+                path.push(name);
+                return true;
+            }
+            if (visited.has(name))
+                return false;
+            visited.add(name);
+            path.push(name);
+            const seeder = this.seeders.get(name);
+            for (const depName of seeder?.dependencies ?? []) {
+                if (dfs(depName))
+                    return true;
+            }
+            path.pop();
+            return false;
+        };
+        dfs(startName);
+        // Extract just the cycle portion (from first occurrence of last element)
+        const lastElement = path[path.length - 1];
+        const firstOccurrence = path.indexOf(lastElement);
+        return path.slice(firstOccurrence);
+    }
+}
+//# sourceMappingURL=registry.js.map

package/dist/seeding/registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.js","sourceRoot":"","sources":["../../src/seeding/registry.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAGrF,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,cAAc;IACjB,OAAO,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEjD;;;;;OAKG;IACH,QAAQ,CAAC,MAAc;QACrB,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,WAAW,MAAM,CAAC,IAAI,yBAAyB,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,OAAiB;QAC5B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,IAAY;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,cAAc,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,6EAA6E;IAC7E,wBAAwB;IACxB,6EAA6E;IAE7E;;;;OAIG;IACH,oBAAoB;QAClB,+BAA+B;QAC/B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;gBAChD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC/B,MAAM,kBAAkB,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;IACpC,CAAC;IAED;;;;;;;;OAQG;IACH,UAAU,CAAC,WAAyB;QAClC,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAE5B,qCAAqC;QACrC,MAAM,OAAO,GAAG,WAAW;YACzB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;YAC9F,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAEtC,2CAA2C;QAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE9C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC7B,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;QAED,6DAA6D;QAC7D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;gBAChD,kDAAkD;gBAClD,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC1B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAChE,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,+CAA+C;QAC/C,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEpB,iCAAiC;YACjC,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACnC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,yDAAyD;QACzD,IAAI,MAAM,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;YACrC,mCAAmC;YACnC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChD,MAAM,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,KAAe,EAAE,WAAyB;QACnD,kEAAkE;QAClE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAEzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAExC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAErC,mCAAmC;YACnC,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC;gBACrE,SAAS;YACX,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAEjB,4BAA4B;YAC5B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;gBAC5C,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,+CAA+C;QAC/C,OAAO,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;OAEG;IACK,sBAAsB,CAAC,MAAc,EAAE,WAAwB;QACrE,2CAA2C;QAC3C,IAAI,CAAC,MAAM,CAAC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,0BAA0B;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAAY,EAAE,OAAoB,EAAE,KAAkB;QAC3E,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM;YAAE,OAAO;QAEpB,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YAC/C,CAAC;iBAAM,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9B,uDAAuD;gBACvD,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBACtC,MAAM,kBAAkB,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,SAAiB;QACjC,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,MAAM,GAAG,GAAG,CAAC,IAAY,EAAW,EAAE;YACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,mDAAmD;gBACnD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;YAEpC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEhB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,YAAY,IAAI,EAAE,EAAE,CAAC;gBACjD,IAAI,GAAG,CAAC,OAAO,CAAC;oBAAE,OAAO,IAAI,CAAC;YAChC,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,GAAG,CAAC,SAAS,CAAC,CAAC;QAEf,yEAAyE;QACzE,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACrC,CAAC;CACF"}