@fuzdev/fuz_gitops 0.57.0

package/dist/changeset_generator.js

@@ -0,0 +1,110 @@
+/**
+ * Auto-generation of changesets for dependency updates during publishing.
+ *
+ * Creates changesets when packages need to republish due to updated dependencies.
+ * For parsing existing changesets, see `changeset_reader.ts`.
+ */
+import { writeFile, mkdir } from 'node:fs/promises';
+import { join } from 'node:path';
+import { existsSync } from 'node:fs';
+import { strip_version_prefix } from './version_utils.js';
+/**
+ * Creates a changeset file for dependency updates.
+ * Returns the path to the created changeset file.
+ */
+export const create_changeset_for_dependency_updates = async (repo, updates, options = {}) => {
+    const { log } = options;
+    const changesets_dir = join(repo.repo_dir, '.changeset');
+    // Ensure .changeset directory exists
+    if (!existsSync(changesets_dir)) {
+        await mkdir(changesets_dir, { recursive: true });
+    }
+    // Generate a unique filename
+    const timestamp = Date.now();
+    const random = Math.random().toString(36).substring(2, 8);
+    const filename = `dependency-update-${timestamp}-${random}.md`;
+    const filepath = join(changesets_dir, filename);
+    // Determine the required bump type based on updates
+    const required_bump = calculate_required_bump(repo, updates);
+    // Generate changeset content
+    const content = generate_changeset_content(repo.library.name, updates, required_bump);
+    // Write the changeset file
+    await writeFile(filepath, content, 'utf8');
+    log?.info(`  Created changeset: ${filename}`);
+    return filepath;
+};
+const calculate_required_bump = (repo, updates) => {
+    const current_version = repo.library.package_json.version || '0.0.0';
+    const [major] = current_version.split('.').map(Number);
+    const is_pre_1_0 = major === 0;
+    // Check if any dependency had breaking changes
+    const has_breaking = updates.some((u) => u.breaking);
+    if (has_breaking) {
+        // Breaking changes propagate
+        // Pre-1.0: use minor for breaking changes
+        // 1.0+: use major for breaking changes
+        return is_pre_1_0 ? 'minor' : 'major';
+    }
+    // For non-breaking dependency updates, always use patch
+    return 'patch';
+};
+/**
+ * Generates markdown changeset content for dependency updates.
+ *
+ * Creates properly formatted changeset with YAML frontmatter, summary,
+ * and categorized list of breaking vs regular updates. Output format
+ * matches changesets CLI for consistency.
+ *
+ * @param package_name package receiving the dependency updates
+ * @param updates list of dependency changes with version info
+ * @param bump_type required bump type (calculated from breaking changes)
+ * @returns markdown content ready to write to .changeset/*.md file
+ */
+export const generate_changeset_content = (package_name, updates, bump_type) => {
+    // Group updates by type
+    const breaking_updates = updates.filter((u) => u.breaking);
+    const regular_updates = updates.filter((u) => !u.breaking);
+    let message = 'Update dependencies';
+    if (breaking_updates.length > 0) {
+        message = 'Update dependencies (BREAKING CHANGES)';
+    }
+    const lines = ['---', `"${package_name}": ${bump_type}`, '---', '', message, ''];
+    if (breaking_updates.length > 0) {
+        lines.push('Breaking dependency changes:');
+        for (const update of breaking_updates) {
+            lines.push(`- ${update.package_name}: ${update.from_version} → ${update.to_version} (${update.bump_type})`);
+        }
+        lines.push('');
+    }
+    if (regular_updates.length > 0) {
+        if (breaking_updates.length > 0) {
+            lines.push('Other dependency updates:');
+        }
+        else {
+            lines.push('Updated dependencies:');
+        }
+        for (const update of regular_updates) {
+            lines.push(`- ${update.package_name}: ${update.from_version} → ${update.to_version} (${update.bump_type})`);
+        }
+        lines.push('');
+    }
+    return lines.join('\n');
+};
+export const create_dependency_updates = (dependencies, published_versions) => {
+    const updates = [];
+    for (const [dep_name, current_version] of dependencies) {
+        const published = published_versions.get(dep_name);
+        if (published) {
+            // Strip version prefix (^, ~, etc)
+            const clean_current = strip_version_prefix(current_version);
+            updates.push({
+                package_name: dep_name,
+                from_version: clean_current,
+                to_version: published.new_version,
+                bump_type: published.bump_type,
+                breaking: published.breaking,
+            });
+        }
+    }
+    return updates;
+};

package/dist/changeset_reader.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Changeset parsing and version prediction from `.changeset/*.md` files.
+ *
+ * Reads changesets to determine which packages need publishing and their version bumps.
+ * For auto-generating changesets during publishing, see `changeset_generator.ts`.
+ */
+import type { Logger } from '@fuzdev/fuz_util/log.js';
+import type { LocalRepo } from './local_repo.js';
+import type { BumpType } from './semver.js';
+export interface ChangesetInfo {
+    filename: string;
+    packages: Array<{
+        name: string;
+        bump_type: BumpType;
+    }>;
+    summary: string;
+}
+/**
+ * Parses changeset content string from markdown format.
+ *
+ * Pure function for testability - no file I/O, just string parsing.
+ * Extracts package names, bump types, and summary from YAML frontmatter format.
+ * Returns null if format is invalid or no packages found.
+ *
+ * Expected format:
+ * ---
+ * "package-name": patch
+ * "@scope/package": minor
+ * ---
+ *
+ * Summary of changes
+ *
+ * @param content changeset markdown with YAML frontmatter
+ * @param filename optional filename for error reporting context
+ * @returns parsed changeset info or null if invalid format
+ */
+export declare const parse_changeset_content: (content: string, filename?: string) => ChangesetInfo | null;
+export declare const parse_changeset_file: (filepath: string, log?: Logger) => Promise<ChangesetInfo | null>;
+export declare const read_changesets: (repo: LocalRepo, log?: Logger) => Promise<Array<ChangesetInfo>>;
+/**
+ * Determines the bump type for a package from its changesets.
+ *
+ * When multiple changesets exist for the same package, returns the highest
+ * bump type (major > minor > patch) to ensure the most significant change
+ * is reflected in the version bump.
+ *
+ * @returns the highest bump type, or null if package has no changesets
+ */
+export declare const determine_bump_from_changesets: (changesets: Array<ChangesetInfo>, package_name: string) => BumpType | null;
+/**
+ * Checks if a repo has any changeset files (excluding README.md).
+ *
+ * Used by preflight checks and publishing workflow to determine which packages
+ * need to be published. Returns false if .changeset directory doesn't exist
+ * or contains only README.md.
+ *
+ * @returns true if repo has unpublished changesets
+ */
+export declare const has_changesets: (repo: LocalRepo) => Promise<boolean>;
+/**
+ * Predicts the next version by analyzing all changesets in a repo.
+ *
+ * Reads all changesets, determines the highest bump type for the package,
+ * and calculates the next version. Returns null if no changesets found.
+ *
+ * Critical for dry-run mode accuracy - allows simulating publishes without
+ * actually running `gro publish` which consumes changesets.
+ *
+ * @returns predicted version and bump type, or null if no changesets
+ */
+export declare const predict_next_version: (repo: LocalRepo, log?: Logger) => Promise<{
+    version: string;
+    bump_type: BumpType;
+} | null>;
+//# sourceMappingURL=changeset_reader.d.ts.map

package/dist/changeset_reader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"changeset_reader.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/changeset_reader.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,yBAAyB,CAAC;AAKpD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAC/C,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,aAAa,CAAC;AAG1C,MAAM,WAAW,aAAa;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,QAAQ,CAAA;KAAC,CAAC,CAAC;IACrD,OAAO,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,uBAAuB,GACnC,SAAS,MAAM,EACf,iBAAyB,KACvB,aAAa,GAAG,IAmClB,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAChC,UAAU,MAAM,EAChB,MAAM,MAAM,KACV,OAAO,CAAC,aAAa,GAAG,IAAI,CAgB9B,CAAC;AAEF,eAAO,MAAM,eAAe,GAC3B,MAAM,SAAS,EACf,MAAM,MAAM,KACV,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAsB9B,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,8BAA8B,GAC1C,YAAY,KAAK,CAAC,aAAa,CAAC,EAChC,cAAc,MAAM,KAClB,QAAQ,GAAG,IAcb,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,cAAc,GAAU,MAAM,SAAS,KAAG,OAAO,CAAC,OAAO,CAarE,CAAC;AAEF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,oBAAoB,GAChC,MAAM,SAAS,EACf,MAAM,MAAM,KACV,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,QAAQ,CAAA;CAAC,GAAG,IAAI,CAsBvD,CAAC"}

package/dist/changeset_reader.js

@@ -0,0 +1,167 @@
+/**
+ * Changeset parsing and version prediction from `.changeset/*.md` files.
+ *
+ * Reads changesets to determine which packages need publishing and their version bumps.
+ * For auto-generating changesets during publishing, see `changeset_generator.ts`.
+ */
+import { existsSync } from 'node:fs';
+import { readdir, readFile } from 'node:fs/promises';
+import { join } from 'node:path';
+import { compare_bump_types, calculate_next_version } from './version_utils.js';
+/**
+ * Parses changeset content string from markdown format.
+ *
+ * Pure function for testability - no file I/O, just string parsing.
+ * Extracts package names, bump types, and summary from YAML frontmatter format.
+ * Returns null if format is invalid or no packages found.
+ *
+ * Expected format:
+ * ---
+ * "package-name": patch
+ * "@scope/package": minor
+ * ---
+ *
+ * Summary of changes
+ *
+ * @param content changeset markdown with YAML frontmatter
+ * @param filename optional filename for error reporting context
+ * @returns parsed changeset info or null if invalid format
+ */
+export const parse_changeset_content = (content, filename = 'changeset.md') => {
+    // Match frontmatter between --- markers
+    const frontmatter_match = /^---\s*\n([\s\S]*?)\n---\s*\n([\s\S]*)/.exec(content);
+    if (!frontmatter_match) {
+        return null;
+    }
+    const frontmatter = frontmatter_match[1];
+    const summary = frontmatter_match[2].trim();
+    // Parse package entries
+    const packages = [];
+    // Match lines like: "package-name": patch
+    // or: '@scope/package': minor
+    // Allow leading whitespace
+    const package_regex = /^\s*["']([^"']+)["']\s*:\s*(major|minor|patch)\s*$/gm;
+    let match;
+    while ((match = package_regex.exec(frontmatter)) !== null) {
+        packages.push({
+            name: match[1],
+            bump_type: match[2],
+        });
+    }
+    if (packages.length === 0) {
+        return null;
+    }
+    return {
+        filename,
+        packages,
+        summary,
+    };
+};
+export const parse_changeset_file = async (filepath, log) => {
+    try {
+        const content = await readFile(filepath, 'utf8');
+        const filename = filepath.split('/').pop() || '';
+        const result = parse_changeset_content(content, filename);
+        if (!result) {
+            log?.warn(`  Invalid changeset format in ${filepath}`);
+        }
+        return result;
+    }
+    catch (error) {
+        log?.error(`  Failed to parse changeset ${filepath}: ${error}`);
+        return null;
+    }
+};
+export const read_changesets = async (repo, log) => {
+    const changesets_dir = join(repo.repo_dir, '.changeset');
+    try {
+        const files = await readdir(changesets_dir);
+        const changeset_files = files.filter((f) => f.endsWith('.md') && f !== 'README.md');
+        const changesets = [];
+        for (const file of changeset_files) {
+            const filepath = join(changesets_dir, file);
+            const changeset = await parse_changeset_file(filepath, log); // eslint-disable-line no-await-in-loop
+            if (changeset) {
+                changesets.push(changeset);
+            }
+        }
+        return changesets;
+    }
+    catch (_error) {
+        // No .changeset directory or error reading
+        return [];
+    }
+};
+/**
+ * Determines the bump type for a package from its changesets.
+ *
+ * When multiple changesets exist for the same package, returns the highest
+ * bump type (major > minor > patch) to ensure the most significant change
+ * is reflected in the version bump.
+ *
+ * @returns the highest bump type, or null if package has no changesets
+ */
+export const determine_bump_from_changesets = (changesets, package_name) => {
+    let highest_bump = null;
+    for (const changeset of changesets) {
+        for (const pkg of changeset.packages) {
+            if (pkg.name === package_name) {
+                if (!highest_bump || compare_bump_types(pkg.bump_type, highest_bump) > 0) {
+                    highest_bump = pkg.bump_type;
+                }
+            }
+        }
+    }
+    return highest_bump;
+};
+/**
+ * Checks if a repo has any changeset files (excluding README.md).
+ *
+ * Used by preflight checks and publishing workflow to determine which packages
+ * need to be published. Returns false if .changeset directory doesn't exist
+ * or contains only README.md.
+ *
+ * @returns true if repo has unpublished changesets
+ */
+export const has_changesets = async (repo) => {
+    const changesets_dir = join(repo.repo_dir, '.changeset');
+    if (!existsSync(changesets_dir)) {
+        return false;
+    }
+    try {
+        const files = await readdir(changesets_dir);
+        // Look for markdown files that aren't the README
+        return files.some((file) => file.endsWith('.md') && file !== 'README.md');
+    }
+    catch {
+        return false;
+    }
+};
+/**
+ * Predicts the next version by analyzing all changesets in a repo.
+ *
+ * Reads all changesets, determines the highest bump type for the package,
+ * and calculates the next version. Returns null if no changesets found.
+ *
+ * Critical for dry-run mode accuracy - allows simulating publishes without
+ * actually running `gro publish` which consumes changesets.
+ *
+ * @returns predicted version and bump type, or null if no changesets
+ */
+export const predict_next_version = async (repo, log) => {
+    const changesets = await read_changesets(repo, log);
+    if (changesets.length === 0) {
+        return null;
+    }
+    const bump_type = determine_bump_from_changesets(changesets, repo.library.name);
+    if (!bump_type) {
+        return null;
+    }
+    const current_version = repo.library.package_json.version || '0.0.0';
+    const next_version = calculate_next_version(current_version, bump_type);
+    log?.debug(`  Predicted ${repo.library.name}: ${current_version} → ${next_version} (${bump_type})`);
+    return {
+        version: next_version,
+        bump_type,
+    };
+};

package/dist/constants.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Maximum number of iterations for fixed-point iteration during publishing.
+ * Used in both plan generation and actual publishing to resolve transitive dependency cascades.
+ *
+ * In practice, most repos converge in 2-3 iterations.
+ * Deep dependency chains may require more iterations.
+ */
+export declare const MAX_ITERATIONS = 10;
+//# sourceMappingURL=constants.d.ts.map

package/dist/constants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/constants.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,KAAK,CAAC"}

package/dist/constants.js

@@ -0,0 +1,8 @@
+/**
+ * Maximum number of iterations for fixed-point iteration during publishing.
+ * Used in both plan generation and actual publishing to resolve transitive dependency cascades.
+ *
+ * In practice, most repos converge in 2-3 iterations.
+ * Deep dependency chains may require more iterations.
+ */
+export const MAX_ITERATIONS = 10;

package/dist/dependency_graph.d.ts

@@ -0,0 +1,120 @@
+/**
+ * Dependency graph data structure and algorithms for multi-repo publishing.
+ *
+ * Provides `DependencyGraph` class with topological sort and cycle detection.
+ * For validation workflow and publishing order computation, see `graph_validation.ts`.
+ */
+import type { LocalRepo } from './local_repo.js';
+export declare const DEPENDENCY_TYPE: {
+    readonly PROD: "prod";
+    readonly PEER: "peer";
+    readonly DEV: "dev";
+};
+export type DependencyType = (typeof DEPENDENCY_TYPE)[keyof typeof DEPENDENCY_TYPE];
+export interface DependencySpec {
+    type: DependencyType;
+    version: string;
+    resolved?: string;
+}
+export interface DependencyGraphJson {
+    nodes: Array<{
+        name: string;
+        version: string;
+        dependencies: Array<{
+            name: string;
+            spec: DependencySpec;
+        }>;
+        dependents: Array<string>;
+        publishable: boolean;
+    }>;
+    edges: Array<{
+        from: string;
+        to: string;
+    }>;
+}
+export interface DependencyNode {
+    name: string;
+    version: string;
+    repo?: LocalRepo;
+    dependencies: Map<string, DependencySpec>;
+    dependents: Set<string>;
+    publishable: boolean;
+}
+export declare class DependencyGraph {
+    nodes: Map<string, DependencyNode>;
+    edges: Map<string, Set<string>>;
+    constructor();
+    init_from_repos(repos: Array<LocalRepo>): void;
+    get_node(name: string): DependencyNode | undefined;
+    get_dependents(name: string): Set<string>;
+    get_dependencies(name: string): Map<string, DependencySpec>;
+    /**
+     * Computes topological sort order for dependency graph.
+     *
+     * Uses Kahn's algorithm with alphabetical ordering within tiers for
+     * deterministic results. Throws if cycles detected.
+     *
+     * @param exclude_dev if true, excludes dev dependencies to break cycles.
+     *   Publishing uses exclude_dev=true to handle circular dev deps.
+     * @returns array of package names in dependency order (dependencies before dependents)
+     * @throws {Error} if circular dependencies detected in included dependency types
+     */
+    topological_sort(exclude_dev?: boolean): Array<string>;
+    detect_cycles(): Array<Array<string>>;
+    /**
+     * Detects circular dependencies, categorized by severity.
+     *
+     * Production/peer cycles prevent publishing (impossible to order packages).
+     * Dev cycles are normal (test utils, shared configs) and safely ignored.
+     *
+     * Uses DFS traversal with recursion stack to identify back edges.
+     * Deduplicates cycles using sorted cycle keys.
+     *
+     * @returns object with production_cycles (errors) and dev_cycles (info)
+     */
+    detect_cycles_by_type(): {
+        production_cycles: Array<Array<string>>;
+        dev_cycles: Array<Array<string>>;
+    };
+    toJSON(): DependencyGraphJson;
+}
+/**
+ * Builder for creating and analyzing dependency graphs.
+ */
+export declare class DependencyGraphBuilder {
+    /**
+     * Constructs dependency graph from local repos.
+     *
+     * Two-pass algorithm: first creates nodes, then builds edges (dependents).
+     * Prioritizes prod/peer deps over dev deps when same package appears in
+     * multiple dependency types (stronger constraint wins).
+     *
+     * @returns fully initialized dependency graph with all nodes and edges
+     */
+    build_from_repos(repos: Array<LocalRepo>): DependencyGraph;
+    /**
+     * Computes publishing order using topological sort with dev deps excluded.
+     *
+     * Excludes dev dependencies to break circular dev dependency cycles while
+     * preserving production/peer dependency ordering. This allows patterns like
+     * shared test utilities that depend on each other for development.
+     *
+     * @returns package names in safe publishing order (dependencies before dependents)
+     * @throws {Error} if production/peer cycles detected (cannot be resolved by exclusion)
+     */
+    compute_publishing_order(graph: DependencyGraph): Array<string>;
+    analyze(graph: DependencyGraph): {
+        production_cycles: Array<Array<string>>;
+        dev_cycles: Array<Array<string>>;
+        wildcard_deps: Array<{
+            pkg: string;
+            dep: string;
+            version: string;
+        }>;
+        missing_peers: Array<{
+            pkg: string;
+            dep: string;
+        }>;
+    };
+}
+//# sourceMappingURL=dependency_graph.d.ts.map

package/dist/dependency_graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency_graph.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/dependency_graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAG/C,eAAO,MAAM,eAAe;;;;CAIlB,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,OAAO,eAAe,CAAC,CAAC;AAEpF,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,cAAc,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,mBAAmB;IACnC,KAAK,EAAE,KAAK,CAAC;QACZ,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,YAAY,EAAE,KAAK,CAAC;YAAC,IAAI,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,cAAc,CAAA;SAAC,CAAC,CAAC;QAC1D,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1B,WAAW,EAAE,OAAO,CAAC;KACrB,CAAC,CAAC;IACH,KAAK,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAC,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC1C,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,WAAW,EAAE,OAAO,CAAC;CACrB;AAED,qBAAa,eAAe;IAC3B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACnC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;;IAOzB,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI;IAoDrD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAIlD,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAIzC,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC;IAK3D;;;;;;;;;;OAUG;IACH,gBAAgB,CAAC,WAAW,UAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;IAuEpD,aAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAqCrC;;;;;;;;;;OAUG;IACH,qBAAqB,IAAI;QACxB,iBAAiB,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACxC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;KACjC;IA2FD,MAAM,IAAI,mBAAmB;CAqB7B;AAED;;GAEG;AACH,qBAAa,sBAAsB;IAClC;;;;;;;;OAQG;IACH,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,eAAe;IAM1D;;;;;;;;;OASG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC;IAI/D,OAAO,CAAC,KAAK,EAAE,eAAe,GAAG;QAChC,iBAAiB,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACxC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACjC,aAAa,EAAE,KAAK,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAC,CAAC,CAAC;QAClE,aAAa,EAAE,KAAK,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAC,CAAC,CAAC;KACjD;CAmBD"}