@neurcode-ai/cli 0.9.65 → 0.10.0

package/dist/governance/canonical-ordering.js

@@ -0,0 +1,189 @@
+"use strict";
+/**
+ * Canonical Deterministic Ordering (Phase 1 — Canonical Deterministic Ordering)
+ *
+ * Single source of truth for finding sort order across:
+ *   - replayChecksum generation
+ *   - provenance serialization
+ *   - governance envelope emission
+ *   - telemetry harvesting
+ *
+ * INVARIANT:
+ *   Any two invocations on the same logical finding set MUST produce
+ *   the same ordered array, regardless of:
+ *   - filesystem traversal order
+ *   - async execution timing
+ *   - insertion order
+ *   - Map iteration order
+ *   - Object.keys() order
+ *
+ * Canonical sort key (evaluated in priority order):
+ *   1. severity          (BLOCKING > ADVISORY > INFO > unknown)
+ *   2. determinismClassification (deterministic-structural > deterministic-semantic
+ *                                 > heuristic-advisory > llm-assisted-planning > unknown)
+ *   3. ruleId            (ascending lexicographic)
+ *   4. filePath          (ascending lexicographic, normalized to forward slashes)
+ *   5. line              (ascending numeric, missing = 0)
+ *   6. column            (ascending numeric, missing = 0)
+ *   7. findingId         (ascending lexicographic — stable tiebreaker, always unique)
+ *
+ * These rules ensure a total order: no two distinct findings can be equal on
+ * all 7 keys simultaneously (findingId is always unique by construction).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.canonicalFindingOrderingKey = canonicalFindingOrderingKey;
+exports.sortCanonicalFindingsStable = sortCanonicalFindingsStable;
+exports.validateCanonicalOrder = validateCanonicalOrder;
+// ── Rank tables ───────────────────────────────────────────────────────────────
+/**
+ * Severity rank — higher number = sorted first (BLOCKING first).
+ * Deterministic: closed set, no dynamic lookup.
+ */
+function rankSeverity(s) {
+    switch (s) {
+        case 'BLOCKING': return 3;
+        case 'ADVISORY': return 2;
+        case 'INFO': return 1;
+        default: return 0;
+    }
+}
+/**
+ * Determinism classification rank — higher = sorted first (structural first).
+ * Deterministic: closed set, no dynamic lookup.
+ */
+function rankDeterminism(d) {
+    switch (d) {
+        case 'deterministic-structural': return 4;
+        case 'deterministic-semantic': return 3;
+        case 'heuristic-advisory': return 2;
+        case 'llm-assisted-planning': return 1;
+        default: return 0;
+    }
+}
+/** Normalize a file path to use forward slashes for cross-platform stability. */
+function normalizePath(p) {
+    return p.replace(/\\/g, '/');
+}
+// ── Public API ────────────────────────────────────────────────────────────────
+/**
+ * Compute the canonical ordering key for a single finding.
+ *
+ * Returns a tuple whose elements, compared left-to-right, produce the
+ * canonical ordering defined above. Useful for inspection and testing.
+ *
+ * Format: [severityRank, determinismRank, ruleId, filePath, line, column, id]
+ */
+function canonicalFindingOrderingKey(f) {
+    return [
+        rankSeverity(f.severity),
+        rankDeterminism(f.determinismClassification),
+        f.structuralMetadata?.ruleId ?? '',
+        normalizePath(f.evidence?.filePath ?? ''),
+        f.evidence?.line ?? 0,
+        f.evidence?.column ?? 0,
+        f.id,
+    ];
+}
+/**
+ * Sort findings into the canonical deterministic order.
+ *
+ * Properties:
+ *   - Pure function — NEVER mutates the input array
+ *   - Stable across process restarts for identical inputs
+ *   - Independent of insertion order, Map iteration, filesystem traversal
+ *   - Total order — no two distinct findings can compare as equal
+ *
+ * @param findings  Any array of GovernanceFinding (may be in any order)
+ * @returns         New sorted array (input is not mutated)
+ */
+function sortCanonicalFindingsStable(findings) {
+    return [...findings].sort((a, b) => {
+        // 1. Severity descending (BLOCKING first)
+        const sA = rankSeverity(a.severity);
+        const sB = rankSeverity(b.severity);
+        if (sA !== sB)
+            return sB - sA;
+        // 2. Determinism classification descending (structural first)
+        const dA = rankDeterminism(a.determinismClassification);
+        const dB = rankDeterminism(b.determinismClassification);
+        if (dA !== dB)
+            return dB - dA;
+        // 3. Rule ID ascending
+        const rA = a.structuralMetadata?.ruleId ?? '';
+        const rB = b.structuralMetadata?.ruleId ?? '';
+        if (rA !== rB)
+            return rA < rB ? -1 : 1;
+        // 4. File path ascending (normalized)
+        const fA = normalizePath(a.evidence?.filePath ?? '');
+        const fB = normalizePath(b.evidence?.filePath ?? '');
+        if (fA !== fB)
+            return fA < fB ? -1 : 1;
+        // 5. Line number ascending (missing = 0)
+        const lA = a.evidence?.line ?? 0;
+        const lB = b.evidence?.line ?? 0;
+        if (lA !== lB)
+            return lA - lB;
+        // 6. Column number ascending (missing = 0)
+        const cA = a.evidence?.column ?? 0;
+        const cB = b.evidence?.column ?? 0;
+        if (cA !== cB)
+            return cA - cB;
+        // 7. Finding ID ascending — guaranteed unique tiebreaker
+        return a.id < b.id ? -1 : a.id > b.id ? 1 : 0;
+    });
+}
+/**
+ * Validate that a finding array is already in canonical order.
+ *
+ * Returns the index of the first out-of-order finding pair, or -1 if
+ * the array is already sorted. Used for invariant checking.
+ *
+ * Emits a console.warn if ordering drift is detected.
+ *
+ * @param findings  Array to validate (not mutated)
+ * @param context   Caller label for the warning (e.g. 'envelope-emit')
+ * @returns         Index of first violation, or -1 if canonical
+ */
+function validateCanonicalOrder(findings, context) {
+    for (let i = 1; i < findings.length; i++) {
+        const prev = findings[i - 1];
+        const curr = findings[i];
+        const kPrev = canonicalFindingOrderingKey(prev);
+        const kCurr = canonicalFindingOrderingKey(curr);
+        // Compare tuple element by element
+        for (let k = 0; k < kPrev.length; k++) {
+            const pv = kPrev[k];
+            const cv = kCurr[k];
+            if (typeof pv === 'number' && typeof cv === 'number') {
+                if (pv > cv) {
+                    console.warn(`[neurcode/canonical-ordering] ORDERING DRIFT at index ${i} in ${context}. ` +
+                        `Finding "${prev.id}" (key[${k}]=${pv}) appears before "${curr.id}" (key[${k}]=${cv}) ` +
+                        `but canonical order requires ascending value at position ${k}. ` +
+                        `Run sortCanonicalFindingsStable() before serialization.`);
+                    return i;
+                }
+                if (pv < cv)
+                    break; // correct order for this pair
+            }
+            else if (typeof pv === 'string' && typeof cv === 'string') {
+                // Numeric keys are descending (rank), string keys are ascending
+                // Keys 0 and 1 are ranks (descending means higher rank first = larger number first)
+                if (k <= 1) {
+                    // These are rank values stored as numbers — already handled above
+                    break;
+                }
+                if (pv > cv) {
+                    console.warn(`[neurcode/canonical-ordering] ORDERING DRIFT at index ${i} in ${context}. ` +
+                        `Finding "${prev.id}" (key[${k}]="${pv}") appears before "${curr.id}" ` +
+                        `(key[${k}]="${cv}") but canonical order requires ascending string at position ${k}. ` +
+                        `Run sortCanonicalFindingsStable() before serialization.`);
+                    return i;
+                }
+                if (pv < cv)
+                    break; // correct order for this pair
+            }
+        }
+    }
+    return -1;
+}
+//# sourceMappingURL=canonical-ordering.js.map

package/dist/governance/canonical-ordering.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical-ordering.js","sourceRoot":"","sources":["../../src/governance/canonical-ordering.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;;AAgDH,kEAYC;AAcD,kEAmCC;AAcD,wDA8CC;AArKD,iFAAiF;AAEjF;;;GAGG;AACH,SAAS,YAAY,CAAC,CAAS;IAC7B,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC;QAC1B,KAAK,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC;QAC1B,KAAK,MAAM,CAAC,CAAK,OAAO,CAAC,CAAC;QAC1B,OAAO,CAAC,CAAS,OAAO,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,CAAS;IAChC,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,0BAA0B,CAAC,CAAC,OAAO,CAAC,CAAC;QAC1C,KAAK,wBAAwB,CAAC,CAAG,OAAO,CAAC,CAAC;QAC1C,KAAK,oBAAoB,CAAC,CAAO,OAAO,CAAC,CAAC;QAC1C,KAAK,uBAAuB,CAAC,CAAI,OAAO,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAyB,OAAO,CAAC,CAAC;IAC5C,CAAC;AACH,CAAC;AAED,iFAAiF;AACjF,SAAS,aAAa,CAAC,CAAS;IAC9B,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC/B,CAAC;AAED,iFAAiF;AAEjF;;;;;;;GAOG;AACH,SAAgB,2BAA2B,CAAC,CAAoB;IAG9D,OAAO;QACL,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC;QACxB,eAAe,CAAC,CAAC,CAAC,yBAAyB,CAAC;QAC5C,CAAC,CAAC,kBAAkB,EAAE,MAAM,IAAI,EAAE;QAClC,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,IAAI,EAAE,CAAC;QACzC,CAAC,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC;QACrB,CAAC,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC;QACvB,CAAC,CAAC,EAAE;KACI,CAAC;AACb,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,2BAA2B,CAAC,QAA6B;IACvE,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjC,0CAA0C;QAC1C,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAE9B,8DAA8D;QAC9D,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC;QACxD,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC;QACxD,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAE9B,uBAAuB;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,kBAAkB,EAAE,MAAM,IAAI,EAAE,CAAC;QAC9C,MAAM,EAAE,GAAG,CAAC,CAAC,kBAAkB,EAAE,MAAM,IAAI,EAAE,CAAC;QAC9C,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvC,sCAAsC;QACtC,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC;QACrD,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvC,yCAAyC;QACzC,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,CAAC;QACjC,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAE9B,2CAA2C;QAC3C,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC,CAAC;QACnC,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAE9B,yDAAyD;QACzD,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,sBAAsB,CACpC,QAA6B,EAC7B,OAAe;IAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,KAAK,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC;QAEhD,mCAAmC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;gBACrD,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,CACV,yDAAyD,CAAC,OAAO,OAAO,IAAI;wBAC5E,YAAY,IAAI,CAAC,EAAE,UAAU,CAAC,KAAK,EAAE,qBAAqB,IAAI,CAAC,EAAE,UAAU,CAAC,KAAK,EAAE,IAAI;wBACvF,4DAA4D,CAAC,IAAI;wBACjE,yDAAyD,CAC1D,CAAC;oBACF,OAAO,CAAC,CAAC;gBACX,CAAC;gBACD,IAAI,EAAE,GAAG,EAAE;oBAAE,MAAM,CAAC,8BAA8B;YACpD,CAAC;iBAAM,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;gBAC5D,gEAAgE;gBAChE,oFAAoF;gBACpF,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACX,kEAAkE;oBAClE,MAAM;gBACR,CAAC;gBACD,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,CACV,yDAAyD,CAAC,OAAO,OAAO,IAAI;wBAC5E,YAAY,IAAI,CAAC,EAAE,UAAU,CAAC,MAAM,EAAE,sBAAsB,IAAI,CAAC,EAAE,IAAI;wBACvE,QAAQ,CAAC,MAAM,EAAE,gEAAgE,CAAC,IAAI;wBACtF,yDAAyD,CAC1D,CAAC;oBACF,OAAO,CAAC,CAAC;gBACX,CAAC;gBACD,IAAI,EAAE,GAAG,EAAE;oBAAE,MAAM,CAAC,8BAA8B;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC"}

package/dist/governance/canonical-pipeline.d.ts

@@ -1,9 +1,16 @@
-import type { GovernanceFinding, GovernanceReplayIntegrity, GovernanceVerificationEnvelope } from '@neurcode-ai/contracts';
+import type { DriftIntelligenceReport, GovernanceFinding, GovernanceReplayIntegrity, GovernanceVerificationEnvelope } from '@neurcode-ai/contracts';
 import type { StructuralViolation } from '../structural-rules/types';
 import type { IntentIssue } from '../intent-engine/matcher';
 import type { FlowIssue } from '../intent-engine/flow-validator';
 import type { RegressionIssue } from '../intent-engine/regression';
 import type { RuleViolation } from '@neurcode-ai/policy-engine';
+/**
+ * Strip structural:* prefixed violations from the policy-engine row list.
+ * These are already represented in structuralViolations — keeping them in
+ * policyViolations causes cross-source duplicate GovernanceFinding objects.
+ * Called by attachCanonicalGovernance before building the envelope.
+ */
+export declare function stripStructuralPolicyRows(violations: RuleViolation[]): RuleViolation[];
 export declare function findingFromStructural(v: StructuralViolation): GovernanceFinding;
 export declare function findingFromPolicyEngine(v: RuleViolation): GovernanceFinding;
 export declare function findingFromIntentIssue(i: IntentIssue): GovernanceFinding;
@@ -21,6 +28,7 @@ export declare function buildGovernanceVerificationEnvelope(input: {
         file: string;
         message?: string;
     }>;
+    driftIntelligence?: DriftIntelligenceReport | null;
     constraintMessages?: Array<{
         message: string;
         file?: string;

package/dist/governance/canonical-pipeline.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"canonical-pipeline.d.ts","sourceRoot":"","sources":["../../src/governance/canonical-pipeline.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAEV,iBAAiB,EACjB,yBAAyB,EAEzB,8BAA8B,EAC/B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AACrE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AACnE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAoChE,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,mBAAmB,GAAG,iBAAiB,CAkC/E;AAED,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,aAAa,GAAG,iBAAiB,CAyB3E;AAED,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,WAAW,GAAG,iBAAiB,CAgBxE;AAED,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,SAAS,GAAG,iBAAiB,CAepE;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,eAAe,GAAG,iBAAiB,CAc3E;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,iBAAiB,CAcjF;AAED,wBAAgB,+BAA+B,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,iBAAiB,CAcpG;AAmGD,wBAAgB,mCAAmC,CACjD,KAAK,EAAE;IACL,oBAAoB,CAAC,EAAE,mBAAmB,EAAE,CAAC;IAC7C,gBAAgB,CAAC,EAAE,aAAa,EAAE,CAAC;IACnC,YAAY,CAAC,EAAE,WAAW,EAAE,CAAC;IAC7B,UAAU,CAAC,EAAE,SAAS,EAAE,CAAC;IACzB,WAAW,CAAC,EAAE,eAAe,EAAE,CAAC;IAChC,UAAU,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvD,kBAAkB,CAAC,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC/D,UAAU,CAAC,EAAE,iBAAiB,CAAC,oBAAoB,CAAC,CAAC;CACtD,GACA,8BAA8B,CAwChC;AAuDD;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CA+BnG;AAED,wBAAgB,iCAAiC,CAAC,KAAK,EAAE;IACvD,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACzC,oBAAoB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChD,GAAG,yBAAyB,CA8D5B"}
+{"version":3,"file":"canonical-pipeline.d.ts","sourceRoot":"","sources":["../../src/governance/canonical-pipeline.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAIV,uBAAuB,EAEvB,iBAAiB,EACjB,yBAAyB,EAEzB,8BAA8B,EAE/B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AACrE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AACnE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAehE;;;;;GAKG;AACH,wBAAgB,yBAAyB,CAAC,UAAU,EAAE,aAAa,EAAE,GAAG,aAAa,EAAE,CAEtF;AAgCD,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,mBAAmB,GAAG,iBAAiB,CAkC/E;AAED,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,aAAa,GAAG,iBAAiB,CAyB3E;AAED,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,WAAW,GAAG,iBAAiB,CAgBxE;AAED,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,SAAS,GAAG,iBAAiB,CAepE;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,eAAe,GAAG,iBAAiB,CAc3E;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,iBAAiB,CAcjF;AA+GD,wBAAgB,+BAA+B,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,iBAAiB,CAcpG;AAgKD,wBAAgB,mCAAmC,CACjD,KAAK,EAAE;IACL,oBAAoB,CAAC,EAAE,mBAAmB,EAAE,CAAC;IAC7C,gBAAgB,CAAC,EAAE,aAAa,EAAE,CAAC;IACnC,YAAY,CAAC,EAAE,WAAW,EAAE,CAAC;IAC7B,UAAU,CAAC,EAAE,SAAS,EAAE,CAAC;IACzB,WAAW,CAAC,EAAE,eAAe,EAAE,CAAC;IAChC,UAAU,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvD,iBAAiB,CAAC,EAAE,uBAAuB,GAAG,IAAI,CAAC;IACnD,kBAAkB,CAAC,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC/D,UAAU,CAAC,EAAE,iBAAiB,CAAC,oBAAoB,CAAC,CAAC;CACtD,GACA,8BAA8B,CAuFhC;AA2FD;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAoCnG;AAED,wBAAgB,iCAAiC,CAAC,KAAK,EAAE;IACvD,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACzC,oBAAoB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChD,GAAG,yBAAyB,CAsL5B"}