@avi770/testteam 3.0.0 → 3.2.0

package/dist/core/tech-debt/tech-debt-tracker.js

@@ -0,0 +1,533 @@
+/**
+ * Technical Debt Tracker (#20) — implementation.
+ *
+ * This is a COMPOSITE operational layer: it composes, aggregates, and annotates
+ * findings from engine agents #68/#69/#70/#83.  It never calls external tools
+ * or re-scans the codebase — all analysis is derived from the pre-collected
+ * engine outputs supplied in `TechDebtTrackerInput`.
+ *
+ * Design contract:
+ *   - Pure + deterministic given fixed inputs (and an optional clock override).
+ *   - Read-only by default; refactors are PROPOSED, never applied.
+ *   - No swallowed errors; every path is explicit.
+ *   - No gameable scoring: ROI = interest/effort (transparent math).
+ *   - Never rounds up (Avi's QA standard): fractional hours are preserved.
+ *
+ * Spec: blueprint/agents/20-technical-debt-tracker.md
+ * Improvements folded in: #1 (diff-aware), #2 (hotspot), #3 (debt ROI),
+ *   #4 (bug/incident correlation via BugHistoryRecord), #5 (sequenced roadmap),
+ *   #6 (coverage gaps), #10 (safe-refactor gate), #12 (knowledge risk),
+ *   #13 (debt budget), #15 (trend), #16 (explainable prioritization).
+ */
+import { createHash } from 'node:crypto';
+// ────────────────────────────────────────────────────────────────
+// Constants
+// ────────────────────────────────────────────────────────────────
+/** Coverage percentage below which a file is considered under-tested. */
+const DEFAULT_COVERAGE_THRESHOLD = 60;
+/**
+ * Hotspot score threshold: files with score >= this AND debt are marked hotspots.
+ * score = commitCount × complexityFindingCount.
+ */
+const HOTSPOT_SCORE_THRESHOLD = 2;
+// Effort calibration (ideal engineer-hours) per category — tuned to be honest,
+// not aspirationally low.  These represent single-file, focused fixes.
+const EFFORT_BY_CATEGORY = {
+    'dead-code': 0.5, // remove + verify no callers
+    'type-safety': 0.75, // annotate + propagate types
+    'complexity': 3.0, // extract + test new sub-functions
+    'static-analysis': 1.0, // lint/TS fix; varies, this is the median
+    'coverage-gap': 2.0, // write meaningful tests
+    'dependency': 1.5, // upgrade + smoke-test
+    'duplication': 2.5, // de-duplicate + refactor
+    'architecture': 8.0, // architectural change; bounded, not aspirational
+};
+// Interest rate calibration (hours/sprint saved by fixing this) per category.
+const INTEREST_BY_CATEGORY = {
+    'dead-code': 0.1,
+    'type-safety': 0.5,
+    'complexity': 1.5, // hard to reason about → bugs & slow reviews
+    'static-analysis': 0.25,
+    'coverage-gap': 1.0, // uncovered risky code → production incidents
+    'dependency': 0.75, // security drift + breakage risk
+    'duplication': 0.75, // fix-one-forget-two cost
+    'architecture': 3.0, // coupling slows every feature team
+};
+// ────────────────────────────────────────────────────────────────
+// Internal helpers
+// ────────────────────────────────────────────────────────────────
+function isoNow(clock) {
+    return clock ? clock() : new Date().toISOString();
+}
+/** Extract the repo-relative file path from a Finding (may be undefined). */
+function fileOf(f) {
+    return f.file ?? '';
+}
+/**
+ * Map engine agentId to DebtCategory.
+ * Only the four known engine agents (68/69/70/83) are accepted.
+ * An unknown agentId indicates misconfiguration and must never be silently
+ * mapped — it is quarantined by throwing so the caller can detect the issue.
+ */
+function categoryForAgent(agentId) {
+    if (agentId === 68)
+        return 'dead-code';
+    if (agentId === 69)
+        return 'type-safety';
+    if (agentId === 70)
+        return 'complexity';
+    if (agentId === 83)
+        return 'static-analysis';
+    // Unknown engine agent: reject loudly so misconfiguration is visible.
+    // Returning a default would silently swallow the error (must-fix #4).
+    throw new Error(`categoryForAgent: unknown agentId ${agentId}. ` +
+        `Only engine agents 68 (dead-code), 69 (type-safety), 70 (complexity), ` +
+        `and 83 (static-analysis) are supported.`);
+}
+/**
+ * Stable, collision-resistant debt item id derived from a SHA-256 hash of
+ * the full filePath + category.  Truncated to 12 hex characters (48 bits of
+ * entropy) — adequate for a single-run debt inventory while remaining readable.
+ *
+ * Using a hash instead of a truncated path prefix eliminates:
+ *  - Non-determinism across runs (must-fix #5)
+ *  - Collisions for long paths (two paths differing only in the first 40 chars
+ *    would previously produce the same id)
+ */
+function debtId(filePath, category) {
+    const hash = createHash('sha256')
+        .update(`${category}\x00${filePath}`)
+        .digest('hex')
+        .slice(0, 12);
+    return `debt-${category}-${hash}`;
+}
+// ────────────────────────────────────────────────────────────────
+// Diff-aware filtering (Improvement #1)
+// ────────────────────────────────────────────────────────────────
+/**
+ * When a DiffScope is present, keep only findings whose file is in the changed
+ * set.  Findings with no file path (module-level) are kept unconditionally.
+ * Asserts no full re-scan: callers supply pre-filtered engine output; this
+ * function enforces the filter on what was passed in.
+ */
+function applyDiffFilter(findings, diffScope) {
+    if (!diffScope)
+        return findings;
+    const changed = new Set(diffScope.changedFiles);
+    return findings.filter((f) => {
+        const fp = fileOf(f);
+        return fp === '' || changed.has(fp);
+    });
+}
+// ────────────────────────────────────────────────────────────────
+// Hotspot analysis (Improvement #2)
+// ────────────────────────────────────────────────────────────────
+/**
+ * Build a map of filePath → complexity finding count from #70 findings.
+ * This is the "complexity" axis of the hotspot heatmap.
+ */
+function buildComplexityMap(complexityFindings) {
+    const map = new Map();
+    for (const f of complexityFindings) {
+        const fp = fileOf(f);
+        if (fp) {
+            map.set(fp, (map.get(fp) ?? 0) + 1);
+        }
+    }
+    return map;
+}
+/**
+ * Compute hotspots: score = commitCount × complexityFindingCount.
+ * Files with no complexity findings score 0 (still returned, but rank last).
+ * Sorted descending by score.
+ */
+function computeHotspots(churnData, complexityMap) {
+    const hotspots = churnData.map((c) => {
+        const complexityFindingCount = complexityMap.get(c.filePath) ?? 0;
+        const score = c.commitCount * complexityFindingCount;
+        return { filePath: c.filePath, commitCount: c.commitCount, complexityFindingCount, score };
+    });
+    // Also include files that have complexity findings but no churn record
+    // (score defaults to 0 × complexity = 0, but the file is still tracked).
+    for (const [fp, complexityFindingCount] of complexityMap) {
+        if (!hotspots.some((h) => h.filePath === fp)) {
+            hotspots.push({ filePath: fp, commitCount: 0, complexityFindingCount, score: 0 });
+        }
+    }
+    return hotspots.sort((a, b) => b.score - a.score);
+}
+// ────────────────────────────────────────────────────────────────
+// Knowledge-risk / bus-factor (Improvement #12)
+// ────────────────────────────────────────────────────────────────
+function knowledgeRisk(filePath, churnData) {
+    if (!churnData)
+        return null;
+    const record = churnData.find((c) => c.filePath === filePath);
+    if (!record?.authors)
+        return null;
+    return record.authors.length <= 1 ? 'sole-author' : 'shared';
+}
+function buildDebtItem(p) {
+    const effortHours = EFFORT_BY_CATEGORY[p.category];
+    const interestHoursPerSprint = INTEREST_BY_CATEGORY[p.category];
+    // ROI: floor(interest/effort, 4 decimal places) — deterministic, no rounding up.
+    const roi = effortHours > 0
+        ? Math.floor((interestHoursPerSprint / effortHours) * 10_000) / 10_000
+        : 0;
+    const isHotspot = p.hotspotScore >= HOTSPOT_SCORE_THRESHOLD;
+    // Explainable prioritization (Improvement #16) — show the math.
+    const hotspotNote = isHotspot
+        ? `hotspot(score=${p.hotspotScore})`
+        : `stable(score=${p.hotspotScore})`;
+    const coverageNote = p.hasCoverageGap ? '+coverage-gap' : '';
+    const bugNote = p.bugCorrelation ? `+bug-corr(${p.bugCorrelation})` : '';
+    const knNote = p.knowledgeRiskValue === 'sole-author' ? '+sole-author-risk' : '';
+    const priorityRationale = `category=${p.category} effort=${effortHours}h interest=${interestHoursPerSprint}h/sprint ` +
+        `roi=${roi} ${hotspotNote}${coverageNote}${bugNote}${knNote}`;
+    return {
+        id: p.id,
+        category: p.category,
+        sourceFindings: p.sourceFindings,
+        filePath: p.filePath,
+        description: p.description,
+        effortHours,
+        interestHoursPerSprint,
+        roi,
+        isHotspot,
+        hasCoverageGap: p.hasCoverageGap,
+        priorityRationale,
+        bugCorrelation: p.bugCorrelation,
+        knowledgeRisk: p.knowledgeRiskValue,
+    };
+}
+// ────────────────────────────────────────────────────────────────
+// Aggregation: findings → debt items
+// ────────────────────────────────────────────────────────────────
+// ────────────────────────────────────────────────────────────────
+// Bug/incident correlation (Improvement #4)
+// ────────────────────────────────────────────────────────────────
+/**
+ * Build a lookup map from filePath → bug correlation label.
+ * When a file appears in the bug history its debt item receives a non-null
+ * bugCorrelation string showing "N bug(s) — <optional label>".
+ *
+ * Files not in the history stay null (no evidence = no assertion).
+ */
+function buildBugCorrelationMap(bugHistory) {
+    const map = new Map();
+    if (!bugHistory)
+        return map;
+    for (const record of bugHistory) {
+        const suffix = record.label ? ` — ${record.label}` : '';
+        map.set(record.filePath, `${record.bugCount} bug(s)${suffix}`);
+    }
+    return map;
+}
+/**
+ * Aggregate engine findings into DebtItems.
+ * Groups findings by (category × filePath) using a NESTED Map so that
+ * filePaths containing '::' cannot corrupt the key (must-fix #2 — the old
+ * string-concatenated `"${category}::${filePath}"` key was split back with
+ * `key.split('::')` which truncates any filePath that itself contains '::').
+ */
+function aggregateDebtItems(allFindings, hotspots, coverageByFile, coverageThreshold, churnData, bugHistory) {
+    // Nested Map: category → (filePath → Finding[])
+    // Eliminates the string-split ambiguity entirely.
+    const grouped = new Map();
+    for (const f of allFindings) {
+        const fp = fileOf(f);
+        const category = categoryForAgent(f.agentId); // throws on unknown agentId
+        let byFile = grouped.get(category);
+        if (!byFile) {
+            byFile = new Map();
+            grouped.set(category, byFile);
+        }
+        const existing = byFile.get(fp);
+        if (existing) {
+            existing.push(f);
+        }
+        else {
+            byFile.set(fp, [f]);
+        }
+    }
+    const hotspotMap = new Map(hotspots.map((h) => [h.filePath, h.score]));
+    const bugCorrelationMap = buildBugCorrelationMap(bugHistory);
+    const items = [];
+    for (const [category, byFile] of grouped) {
+        for (const [fp, findings] of byFile) {
+            const filePath = fp || '(module-level)';
+            const hotspotScore = hotspotMap.get(fp) ?? 0;
+            const coveragePct = coverageByFile?.[fp];
+            const hasCoverageGap = coveragePct !== undefined && coveragePct < coverageThreshold;
+            // Consolidate descriptions: first finding's description + count suffix.
+            const description = findings.length === 1
+                ? (findings[0]?.description ?? '')
+                : `${findings[0]?.description ?? ''} (+ ${findings.length - 1} more in this file)`;
+            // Bug correlation (Improvement #4): evidence-based, not a stub.
+            const bugCorrelation = bugCorrelationMap.get(fp) ?? null;
+            items.push(buildDebtItem({
+                id: debtId(fp, category), // hash of full path + category (must-fix #5)
+                category,
+                sourceFindings: findings.map((f) => f.id),
+                filePath,
+                description,
+                hotspotScore,
+                hasCoverageGap,
+                bugCorrelation,
+                knowledgeRiskValue: knowledgeRisk(fp, churnData),
+            }));
+        }
+    }
+    return items;
+}
+// ────────────────────────────────────────────────────────────────
+// Ranking (Improvement #3 + #16): ROI-ranked, hotspot-boosted
+// ────────────────────────────────────────────────────────────────
+/**
+ * Rank debt items.
+ * Primary:   hotspot (true first)
+ * Secondary: hasCoverageGap (true first) — riskier
+ * Tertiary:  roi descending
+ * Quaternary: effortHours ascending (tiebreak on ease)
+ *
+ * Explicit sort criteria make the "fix first" order deterministic and
+ * explainable (Improvement #16) — no opaque composite score.
+ */
+function rankDebtItems(items) {
+    return [...items].sort((a, b) => {
+        if (a.isHotspot !== b.isHotspot)
+            return a.isHotspot ? -1 : 1;
+        if (a.hasCoverageGap !== b.hasCoverageGap)
+            return a.hasCoverageGap ? -1 : 1;
+        if (a.roi !== b.roi)
+            return b.roi - a.roi;
+        return a.effortHours - b.effortHours;
+    });
+}
+// ────────────────────────────────────────────────────────────────
+// Sequenced refactoring roadmap (Improvements #5, #10)
+// ────────────────────────────────────────────────────────────────
+/**
+ * Build a dependency-aware, sequenced roadmap from ranked debt items.
+ *
+ * Sequencing heuristic (dependency-awareness without a full dep graph):
+ *   1. Architecture items first (unblocking everything that depends on structure).
+ *   2. Complexity items (tests depend on simpler code).
+ *   3. Type-safety (easier once complexity is tamed).
+ *   4. Coverage-gap items (add tests to now-simpler code).
+ *   5. Dead-code and static-analysis (cleanup when structure is solid).
+ *   6. Remaining categories.
+ *
+ * Each proposal's gateStatus is always 'proposed' — only a human can approve
+ * (Improvement #10, operating rule: never auto-merges a refactor).
+ */
+const SEQUENCE_ORDER = [
+    'architecture',
+    'complexity',
+    'type-safety',
+    'coverage-gap',
+    'dead-code',
+    'static-analysis',
+    'duplication',
+    'dependency',
+];
+function buildRoadmap(rankedItems, clock) {
+    // Group items by category, then sequence the groups.
+    const byCategory = new Map();
+    for (const item of rankedItems) {
+        const existing = byCategory.get(item.category);
+        if (existing) {
+            existing.push(item);
+        }
+        else {
+            byCategory.set(item.category, [item]);
+        }
+    }
+    const proposals = [];
+    let seq = 1;
+    // Walk categories in dependency order.
+    const orderedCategories = [
+        ...SEQUENCE_ORDER.filter((c) => byCategory.has(c)),
+        ...[...byCategory.keys()].filter((c) => !SEQUENCE_ORDER.includes(c)),
+    ];
+    for (const category of orderedCategories) {
+        const items = byCategory.get(category) ?? [];
+        // Collapse items in the same category into one proposal (pragmatic grouping).
+        const debtItemIds = items.map((i) => i.id);
+        const totalEffort = items.reduce((sum, i) => sum + i.effortHours, 0);
+        const rationale = `Fix ${items.length} ${category} issue(s) first because: ` +
+            items
+                .slice(0, 3)
+                .map((i) => i.priorityRationale)
+                .join(' | ');
+        proposals.push({
+            id: `refactor-${seq}-${category}`,
+            sequence: seq++,
+            debtItemIds,
+            title: `Refactor: resolve ${items.length} ${category} item(s)`,
+            rationale,
+            estimatedEffortHours: totalEffort,
+            testsRequired: true,
+            gateStatus: 'proposed',
+        });
+    }
+    const totalEffortHours = proposals.reduce((sum, p) => sum + p.estimatedEffortHours, 0);
+    return {
+        generatedAt: isoNow(clock),
+        proposals,
+        totalEffortHours,
+    };
+}
+// ────────────────────────────────────────────────────────────────
+// Debt-budget ratchet (Improvement #13)
+// ────────────────────────────────────────────────────────────────
+function checkBudget(items, budget) {
+    const currentDebtItems = items.length;
+    const currentTotalEffortHours = items.reduce((sum, i) => sum + i.effortHours, 0);
+    const itemsExceeded = currentDebtItems > budget.maxDebtItems;
+    const effortExceeded = currentTotalEffortHours > budget.maxTotalEffortHours;
+    if (itemsExceeded || effortExceeded) {
+        const reasons = [];
+        if (itemsExceeded) {
+            reasons.push(`debt items ${currentDebtItems} > ceiling ${budget.maxDebtItems}`);
+        }
+        if (effortExceeded) {
+            reasons.push(`effort ${currentTotalEffortHours}h > ceiling ${budget.maxTotalEffortHours}h`);
+        }
+        return {
+            status: 'exceeded',
+            currentDebtItems,
+            currentTotalEffortHours,
+            blockPR: true,
+            reason: `Debt budget exceeded: ${reasons.join('; ')}`,
+        };
+    }
+    return {
+        status: 'ok',
+        currentDebtItems,
+        currentTotalEffortHours,
+        blockPR: false,
+        reason: `Within budget (items: ${currentDebtItems}/${budget.maxDebtItems}, effort: ${currentTotalEffortHours}h/${budget.maxTotalEffortHours}h)`,
+    };
+}
+// ────────────────────────────────────────────────────────────────
+// Trend computation (Improvement #15)
+// ────────────────────────────────────────────────────────────────
+function computeTrend(priorSnapshots, currentItems, clock) {
+    const capturedAt = isoNow(clock);
+    const totalDebtItems = currentItems.length;
+    const totalEffortHours = currentItems.reduce((sum, i) => sum + i.effortHours, 0);
+    // Content-addressed snapshot id: deterministic, yet distinct for distinct metrics
+    // even under a fixed clock (the old `snap-${iso}` collided within the same ms).
+    const snapHash = createHash('sha256')
+        .update(`${capturedAt}\x00${totalDebtItems}\x00${totalEffortHours}`)
+        .digest('hex')
+        .slice(0, 8);
+    const currentSnapshot = {
+        snapshotId: `snap-${snapHash}`,
+        capturedAt,
+        totalDebtItems,
+        totalEffortHours,
+    };
+    const allSnapshots = [...(priorSnapshots ?? []), currentSnapshot];
+    const first = allSnapshots[0];
+    const last = allSnapshots[allSnapshots.length - 1];
+    const netItemDelta = (last?.totalDebtItems ?? 0) - (first?.totalDebtItems ?? 0);
+    const netEffortDelta = (last?.totalEffortHours ?? 0) - (first?.totalEffortHours ?? 0);
+    return { snapshots: allSnapshots, netItemDelta, netEffortDelta };
+}
+// ────────────────────────────────────────────────────────────────
+// Main entry point
+// ────────────────────────────────────────────────────────────────
+/**
+ * Run the Technical Debt Tracker.
+ *
+ * Compose engine findings, compute hotspots, rank debt items by ROI, build a
+ * sequenced refactoring roadmap, check the debt budget, and return a full
+ * `TechDebtReport`.  Pure function — no side effects, no file I/O.
+ */
+export function runTechDebtTracker(input) {
+    const clock = input.clock;
+    const coverageThreshold = input.coverageThreshold ?? DEFAULT_COVERAGE_THRESHOLD;
+    // ── Step 1: Collect all engine findings ──────────────────────
+    const allEngineFindings = [
+        ...input.deadCodeFindings.findings,
+        ...input.typeSafetyFindings.findings,
+        ...input.complexityFindings.findings,
+        ...input.staticAnalysisFindings.findings,
+    ];
+    // ── Step 2: Diff-aware filter (Improvement #1) ───────────────
+    // When a diffScope is provided, only changed files are analysed.
+    // This is the canonical "no full re-scan" enforcement.
+    const filteredFindings = applyDiffFilter(allEngineFindings, input.diffScope);
+    // Track which files were actually analysed.
+    const filesAnalysed = input.diffScope
+        ? [...input.diffScope.changedFiles]
+        : [...new Set(filteredFindings.map(fileOf).filter(Boolean))];
+    // ── Step 3: Hotspot analysis (Improvement #2) ────────────────
+    const complexityFindings = input.diffScope
+        ? applyDiffFilter(input.complexityFindings.findings, input.diffScope)
+        : input.complexityFindings.findings;
+    const complexityMap = buildComplexityMap(complexityFindings);
+    const hotspots = computeHotspots(input.churnData ?? [], complexityMap);
+    // ── Step 4: Aggregate findings → debt items ──────────────────
+    const rawItems = aggregateDebtItems(filteredFindings, hotspots, input.coverageByFile, coverageThreshold, input.churnData, input.bugHistory);
+    // ── Step 5: Rank (ROI-first, hotspot-boosted) ────────────────
+    const rankedItems = rankDebtItems(rawItems);
+    // ── Step 6: Coverage gaps (Improvement #6) ───────────────────
+    const coverageGaps = rankedItems.filter((i) => i.hasCoverageGap);
+    // ── Step 7: Sequenced refactoring roadmap (Improvements #5/#10) ─
+    const roadmap = buildRoadmap(rankedItems, clock);
+    // ── Step 8: Budget ratchet (Improvement #13) ─────────────────
+    const budgetCheck = input.budget ? checkBudget(rankedItems, input.budget) : null;
+    // ── Step 8b: Trend vs prior snapshots (Improvement #15) ──────
+    // Wire priorSnapshots into the run: when supplied, the report carries the trend.
+    // (Previously priorSnapshots was an unread input — callers had to invoke
+    // computeTrend separately. computeTrend stays exported for standalone use.)
+    const trend = input.priorSnapshots
+        ? computeTrend(input.priorSnapshots, rankedItems, clock)
+        : null;
+    // ── Step 9: Generate report ───────────────────────────────────
+    // Content-addressed id: timestamp + a short hash of the ranked inventory, so two
+    // reports under the same clock but with different debt are distinct.
+    const contentHash = createHash('sha256')
+        .update(rankedItems.map((i) => i.id).join('\x00'))
+        .digest('hex')
+        .slice(0, 8);
+    const reportId = `tdt-${isoNow(clock).replace(/[^0-9T]/g, '').slice(0, 15)}-${contentHash}`;
+    return {
+        reportId,
+        generatedAt: isoNow(clock),
+        isDiffAwareRun: Boolean(input.diffScope),
+        filesAnalysed,
+        debtInventory: rankedItems,
+        hotspots,
+        roadmap,
+        coverageGaps,
+        budgetCheck,
+        trend,
+    };
+}
+// ────────────────────────────────────────────────────────────────
+// Trend (exported separately — callers compose it with a report)
+// ────────────────────────────────────────────────────────────────
+export { computeTrend };
+// ────────────────────────────────────────────────────────────────
+// Refactor gate guard (Improvement #10 — machine-readable rule)
+// ────────────────────────────────────────────────────────────────
+/**
+ * Returns true if a RefactorProposal is allowed to proceed — ONLY if
+ * `gateStatus === 'approved'` (set externally by the human-gate harness).
+ *
+ * This function is intentionally typed against the full `RefactorProposal`
+ * interface (not `{ gateStatus: string }`) so that the TypeScript compiler
+ * catches callers passing proposals that can never have gateStatus='approved'
+ * due to a missing union arm (must-fix #1).
+ *
+ * Auto-merge check: 'proposed' and 'gated-awaiting-human' always return false,
+ * enforcing the "never auto-merges a refactor" operating rule.
+ */
+export function isRefactorApproved(proposal) {
+    return proposal.gateStatus === 'approved';
+}
+//# sourceMappingURL=tech-debt-tracker.js.map

package/dist/core/tech-debt/tech-debt-tracker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tech-debt-tracker.js","sourceRoot":"","sources":["../../../core/tech-debt/tech-debt-tracker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAmBH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,mEAAmE;AACnE,YAAY;AACZ,mEAAmE;AAEnE,yEAAyE;AACzE,MAAM,0BAA0B,GAAG,EAAE,CAAC;AAEtC;;;GAGG;AACH,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC,+EAA+E;AAC/E,uEAAuE;AACvE,MAAM,kBAAkB,GAA2C;IACjE,WAAW,EAAS,GAAG,EAAG,6BAA6B;IACvD,aAAa,EAAO,IAAI,EAAE,6BAA6B;IACvD,YAAY,EAAQ,GAAG,EAAG,mCAAmC;IAC7D,iBAAiB,EAAG,GAAG,EAAG,0CAA0C;IACpE,cAAc,EAAM,GAAG,EAAG,yBAAyB;IACnD,YAAY,EAAQ,GAAG,EAAG,uBAAuB;IACjD,aAAa,EAAO,GAAG,EAAG,0BAA0B;IACpD,cAAc,EAAM,GAAG,EAAG,kDAAkD;CAC7E,CAAC;AAEF,8EAA8E;AAC9E,MAAM,oBAAoB,GAA2C;IACnE,WAAW,EAAS,GAAG;IACvB,aAAa,EAAO,GAAG;IACvB,YAAY,EAAQ,GAAG,EAAG,6CAA6C;IACvE,iBAAiB,EAAG,IAAI;IACxB,cAAc,EAAM,GAAG,EAAG,8CAA8C;IACxE,YAAY,EAAQ,IAAI,EAAE,iCAAiC;IAC3D,aAAa,EAAO,IAAI,EAAE,0BAA0B;IACpD,cAAc,EAAM,GAAG,EAAG,oCAAoC;CAC/D,CAAC;AAEF,mEAAmE;AACnE,mBAAmB;AACnB,mEAAmE;AAEnE,SAAS,MAAM,CAAC,KAAoB;IAClC,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AACpD,CAAC;AAED,6EAA6E;AAC7E,SAAS,MAAM,CAAC,CAAU;IACxB,OAAO,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;AACtB,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,OAAe;IACvC,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,WAAW,CAAC;IACvC,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,aAAa,CAAC;IACzC,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,YAAY,CAAC;IACxC,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,iBAAiB,CAAC;IAC7C,sEAAsE;IACtE,sEAAsE;IACtE,MAAM,IAAI,KAAK,CACb,qCAAqC,OAAO,IAAI;QAChD,wEAAwE;QACxE,yCAAyC,CAC1C,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,MAAM,CAAC,QAAgB,EAAE,QAAsB;IACtD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;SAC9B,MAAM,CAAC,GAAG,QAAQ,OAAO,QAAQ,EAAE,CAAC;SACpC,MAAM,CAAC,KAAK,CAAC;SACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAChB,OAAO,QAAQ,QAAQ,IAAI,IAAI,EAAE,CAAC;AACpC,CAAC;AAED,mEAAmE;AACnE,wCAAwC;AACxC,mEAAmE;AAEnE;;;;;GAKG;AACH,SAAS,eAAe,CACtB,QAA4B,EAC5B,SAAgC;IAEhC,IAAI,CAAC,SAAS;QAAE,OAAO,QAAQ,CAAC;IAChC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;IAChD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,EAAE,KAAK,EAAE,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,mEAAmE;AACnE,oCAAoC;AACpC,mEAAmE;AAEnE;;;GAGG;AACH,SAAS,kBAAkB,CACzB,kBAAsC;IAEtC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,EAAE,CAAC;YACP,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CACtB,SAAiC,EACjC,aAAkC;IAElC,MAAM,QAAQ,GAAc,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC9C,MAAM,sBAAsB,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,GAAG,sBAAsB,CAAC;QACrD,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC;IAC7F,CAAC,CAAC,CAAC;IAEH,uEAAuE;IACvE,yEAAyE;IACzE,KAAK,MAAM,CAAC,EAAE,EAAE,sBAAsB,CAAC,IAAI,aAAa,EAAE,CAAC;QACzD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,EAAE,CAAC;YAC7C,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACpD,CAAC;AAED,mEAAmE;AACnE,gDAAgD;AAChD,mEAAmE;AAEnE,SAAS,aAAa,CACpB,QAAgB,EAChB,SAA6C;IAE7C,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5B,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;IAC9D,IAAI,CAAC,MAAM,EAAE,OAAO;QAAE,OAAO,IAAI,CAAC;IAClC,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC/D,CAAC;AAkBD,SAAS,aAAa,CAAC,CAAsB;IAC3C,MAAM,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,sBAAsB,GAAG,oBAAoB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAChE,iFAAiF;IACjF,MAAM,GAAG,GAAG,WAAW,GAAG,CAAC;QACzB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,sBAAsB,GAAG,WAAW,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM;QACtE,CAAC,CAAC,CAAC,CAAC;IAEN,MAAM,SAAS,GAAG,CAAC,CAAC,YAAY,IAAI,uBAAuB,CAAC;IAE5D,gEAAgE;IAChE,MAAM,WAAW,GAAG,SAAS;QAC3B,CAAC,CAAC,iBAAiB,CAAC,CAAC,YAAY,GAAG;QACpC,CAAC,CAAC,gBAAgB,CAAC,CAAC,YAAY,GAAG,CAAC;IACtC,MAAM,YAAY,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7D,MAAM,OAAO,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IACzE,MAAM,MAAM,GAAG,CAAC,CAAC,kBAAkB,KAAK,aAAa,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;IACjF,MAAM,iBAAiB,GACrB,YAAY,CAAC,CAAC,QAAQ,WAAW,WAAW,cAAc,sBAAsB,WAAW;QAC3F,OAAO,GAAG,IAAI,WAAW,GAAG,YAAY,GAAG,OAAO,GAAG,MAAM,EAAE,CAAC;IAEhE,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,cAAc,EAAE,CAAC,CAAC,cAAc;QAChC,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,WAAW;QACX,sBAAsB;QACtB,GAAG;QACH,SAAS;QACT,cAAc,EAAE,CAAC,CAAC,cAAc;QAChC,iBAAiB;QACjB,cAAc,EAAE,CAAC,CAAC,cAAc;QAChC,aAAa,EAAE,CAAC,CAAC,kBAAkB;KACpC,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,qCAAqC;AACrC,mEAAmE;AAEnE,mEAAmE;AACnE,4CAA4C;AAC5C,mEAAmE;AAEnE;;;;;;GAMG;AACH,SAAS,sBAAsB,CAC7B,UAAmD;IAEnD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,IAAI,CAAC,UAAU;QAAE,OAAO,GAAG,CAAC;IAC5B,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,QAAQ,UAAU,MAAM,EAAE,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAS,kBAAkB,CACzB,WAA+B,EAC/B,QAA4B,EAC5B,cAA4D,EAC5D,iBAAyB,EACzB,SAA6C,EAC7C,UAAmD;IAEnD,gDAAgD;IAChD,kDAAkD;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwC,CAAC;IAEhE,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,4BAA4B;QAC1E,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,iBAAiB,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,MAAM,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,EAAE,IAAI,gBAAgB,CAAC;YACxC,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,WAAW,GAAG,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,cAAc,GAClB,WAAW,KAAK,SAAS,IAAI,WAAW,GAAG,iBAAiB,CAAC;YAE/D,wEAAwE;YACxE,MAAM,WAAW,GACf,QAAQ,CAAC,MAAM,KAAK,CAAC;gBACnB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,IAAI,EAAE,CAAC;gBAClC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,IAAI,EAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,qBAAqB,CAAC;YAEvF,gEAAgE;YAChE,MAAM,cAAc,GAAG,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;YAEzD,KAAK,CAAC,IAAI,CACR,aAAa,CAAC;gBACZ,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,6CAA6C;gBACvE,QAAQ;gBACR,cAAc,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzC,QAAQ;gBACR,WAAW;gBACX,YAAY;gBACZ,cAAc;gBACd,cAAc;gBACd,kBAAkB,EAAE,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC;aACjD,CAAC,CACH,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,mEAAmE;AACnE,8DAA8D;AAC9D,mEAAmE;AAEnE;;;;;;;;;GASG;AACH,SAAS,aAAa,CAAC,KAAiB;IACtC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;YAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,cAAc,KAAK,CAAC,CAAC,cAAc;YAAE,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;YAAE,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;QAC1C,OAAO,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,mEAAmE;AACnE,uDAAuD;AACvD,mEAAmE;AAEnE;;;;;;;;;;;;;GAaG;AACH,MAAM,cAAc,GAAmB;IACrC,cAAc;IACd,YAAY;IACZ,aAAa;IACb,cAAc;IACd,WAAW;IACX,iBAAiB;IACjB,aAAa;IACb,YAAY;CACb,CAAC;AAEF,SAAS,YAAY,CACnB,WAAgC,EAChC,KAAiC;IAEjC,qDAAqD;IACrD,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,uCAAuC;IACvC,MAAM,iBAAiB,GAAmB;QACxC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,GAAI,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAoB;KACzF,CAAC;IAEF,KAAK,MAAM,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC7C,8EAA8E;QAC9E,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACrE,MAAM,SAAS,GACb,OAAO,KAAK,CAAC,MAAM,IAAI,QAAQ,2BAA2B;YAC1D,KAAK;iBACF,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;iBACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC;iBAC/B,IAAI,CAAC,KAAK,CAAC,CAAC;QAEjB,SAAS,CAAC,IAAI,CAAC;YACb,EAAE,EAAE,YAAY,GAAG,IAAI,QAAQ,EAAE;YACjC,QAAQ,EAAE,GAAG,EAAE;YACf,WAAW;YACX,KAAK,EAAE,qBAAqB,KAAK,CAAC,MAAM,IAAI,QAAQ,UAAU;YAC9D,SAAS;YACT,oBAAoB,EAAE,WAAW;YACjC,aAAa,EAAE,IAAI;YACnB,UAAU,EAAE,UAAU;SACvB,CAAC,CAAC;IACL,CAAC;IAED,MAAM,gBAAgB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;IAEvF,OAAO;QACL,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC;QAC1B,SAAS;QACT,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,wCAAwC;AACxC,mEAAmE;AAEnE,SAAS,WAAW,CAClB,KAA0B,EAC1B,MAAkB;IAElB,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,CAAC;IACtC,MAAM,uBAAuB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAEjF,MAAM,aAAa,GAAG,gBAAgB,GAAG,MAAM,CAAC,YAAY,CAAC;IAC7D,MAAM,cAAc,GAAG,uBAAuB,GAAG,MAAM,CAAC,mBAAmB,CAAC;IAE5E,IAAI,aAAa,IAAI,cAAc,EAAE,CAAC;QACpC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,aAAa,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CACV,cAAc,gBAAgB,cAAc,MAAM,CAAC,YAAY,EAAE,CAClE,CAAC;QACJ,CAAC;QACD,IAAI,cAAc,EAAE,CAAC;YACnB,OAAO,CAAC,IAAI,CACV,UAAU,uBAAuB,eAAe,MAAM,CAAC,mBAAmB,GAAG,CAC9E,CAAC;QACJ,CAAC;QACD,OAAO;YACL,MAAM,EAAE,UAAU;YAClB,gBAAgB;YAChB,uBAAuB;YACvB,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,yBAAyB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SACtD,CAAC;IACJ,CAAC;IAED,OAAO;QACL,MAAM,EAAE,IAAI;QACZ,gBAAgB;QAChB,uBAAuB;QACvB,OAAO,EAAE,KAAK;QACd,MAAM,EAAE,yBAAyB,gBAAgB,IAAI,MAAM,CAAC,YAAY,aAAa,uBAAuB,KAAK,MAAM,CAAC,mBAAmB,IAAI;KAChJ,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,sCAAsC;AACtC,mEAAmE;AAEnE,SAAS,YAAY,CACnB,cAAmD,EACnD,YAAiC,EACjC,KAAiC;IAEjC,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC;IAC3C,MAAM,gBAAgB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACjF,kFAAkF;IAClF,gFAAgF;IAChF,MAAM,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC;SAClC,MAAM,CAAC,GAAG,UAAU,OAAO,cAAc,OAAO,gBAAgB,EAAE,CAAC;SACnE,MAAM,CAAC,KAAK,CAAC;SACb,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACf,MAAM,eAAe,GAAiB;QACpC,UAAU,EAAE,QAAQ,QAAQ,EAAE;QAC9B,UAAU;QACV,cAAc;QACd,gBAAgB;KACjB,CAAC;IAEF,MAAM,YAAY,GAAmB,CAAC,GAAG,CAAC,cAAc,IAAI,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;IAClF,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEnD,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,cAAc,IAAI,CAAC,CAAC,CAAC;IAChF,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,gBAAgB,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,gBAAgB,IAAI,CAAC,CAAC,CAAC;IAEtF,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;AACnE,CAAC;AAED,mEAAmE;AACnE,mBAAmB;AACnB,mEAAmE;AAEnE;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAqC;IACtE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,MAAM,iBAAiB,GAAG,KAAK,CAAC,iBAAiB,IAAI,0BAA0B,CAAC;IAEhF,gEAAgE;IAChE,MAAM,iBAAiB,GAAuB;QAC5C,GAAG,KAAK,CAAC,gBAAgB,CAAC,QAAQ;QAClC,GAAG,KAAK,CAAC,kBAAkB,CAAC,QAAQ;QACpC,GAAG,KAAK,CAAC,kBAAkB,CAAC,QAAQ;QACpC,GAAG,KAAK,CAAC,sBAAsB,CAAC,QAAQ;KACzC,CAAC;IAEF,gEAAgE;IAChE,iEAAiE;IACjE,uDAAuD;IACvD,MAAM,gBAAgB,GAAG,eAAe,CAAC,iBAAiB,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IAE7E,4CAA4C;IAC5C,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS;QACnC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC;QACnC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAE/D,gEAAgE;IAChE,MAAM,kBAAkB,GAAG,KAAK,CAAC,SAAS;QACxC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,kBAAkB,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC;QACrE,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,QAAQ,CAAC;IACtC,MAAM,aAAa,GAAG,kBAAkB,CAAC,kBAAkB,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,SAAS,IAAI,EAAE,EAAE,aAAa,CAAC,CAAC;IAEvE,gEAAgE;IAChE,MAAM,QAAQ,GAAG,kBAAkB,CACjC,gBAAgB,EAChB,QAAQ,EACR,KAAK,CAAC,cAAc,EACpB,iBAAiB,EACjB,KAAK,CAAC,SAAS,EACf,KAAK,CAAC,UAAU,CACjB,CAAC;IAEF,gEAAgE;IAChE,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IAE5C,gEAAgE;IAChE,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;IAEjE,mEAAmE;IACnE,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IAEjD,gEAAgE;IAChE,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,WAAW,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAEjF,gEAAgE;IAChE,iFAAiF;IACjF,yEAAyE;IACzE,4EAA4E;IAC5E,MAAM,KAAK,GAAG,KAAK,CAAC,cAAc;QAChC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,cAAc,EAAE,WAAW,EAAE,KAAK,CAAC;QACxD,CAAC,CAAC,IAAI,CAAC;IAET,iEAAiE;IACjE,iFAAiF;IACjF,qEAAqE;IACrE,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC;SACrC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SACjD,MAAM,CAAC,KAAK,CAAC;SACb,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACf,MAAM,QAAQ,GAAG,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;IAE5F,OAAO;QACL,QAAQ;QACR,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC;QAC1B,cAAc,EAAE,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;QACxC,aAAa;QACb,aAAa,EAAE,WAAW;QAC1B,QAAQ;QACR,OAAO;QACP,YAAY;QACZ,WAAW;QACX,KAAK;KACN,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,iEAAiE;AACjE,mEAAmE;AAEnE,OAAO,EAAE,YAAY,EAAE,CAAC;AAExB,mEAAmE;AACnE,gEAAgE;AAChE,mEAAmE;AAEnE;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAoC;IACrE,OAAO,QAAQ,CAAC,UAAU,KAAK,UAAU,CAAC;AAC5C,CAAC"}