@codyswann/lisa 4.71.6 → 4.71.8

package/all/copy-overwrite/scripts/threshold-ratchet-families.mjs

@@ -0,0 +1,546 @@
+// This file is managed by Lisa and IS replaced on each `lisa` run.
+// Do not edit directly — durable changes belong upstream in Lisa.
+
+/**
+ * Threshold ratchet — watched file families and value extractors.
+ *
+ * Pure extraction layer: given file contents, produce comparable constraint
+ * maps. No filesystem or git access. See threshold-ratchet.mjs for the CLI
+ * and threshold-ratchet-compare.mjs for the comparison rules.
+ */
+
+/**
+ * File families the ratchet watches. `kind` selects the extractor;
+ * `direction` applies to numeric-leaf kinds ("min" values may only rise,
+ * "max" values may only fall).
+ *
+ * PER-FAMILY POLICY, reviewed 2026-08-12. A family keeps its ratchet unless a
+ * NAMED deterministic non-regression invariant replaces the property the
+ * ratchet was providing — deleting a ratchet deletes that property with it, so
+ * "this generates churn" is a reason to find a replacement, never a reason to
+ * delete on its own:
+ *
+ *   coverage / simplecov / e2e   KEPT. Here the ratchet IS the non-regression
+ *     invariant, and no per-item equivalent exists short of committing a
+ *     per-file coverage baseline — an artifact that only ever accumulates.
+ *     Revisit if one appears.
+ *   stryker                      KEPT. `thresholds.break` is an absolute floor,
+ *     kept outright; the mutate-list comparison detects EXEMPTION ADDITIONS
+ *     rather than creep, and has no number for a pull request to nudge.
+ *   eslint / rubocop / k6 / lisa-config   KEPT, unchanged.
+ *
+ * Exactly one family was replaced, and it is not watched here and never was:
+ * the BDD traceability floor, whose numeric ratchet gave way to per-obligation
+ * checks. See `expo/copy-overwrite/scripts/bdd/baseline.mjs`.
+ *
+ * Retiring a family is SEQUENCED: the replacement invariant lands, then a
+ * `thresholdRatchet.allow` entry merges from the base side, then the mechanism
+ * changes. Never the reverse — this checker is precisely what stops a change
+ * granting itself the exception that permits it.
+ */
+export const FAMILIES = [
+  {
+    id: "coverage",
+    match: /(^|\/)(vitest|jest)\.thresholds\.json$/,
+    kind: "json-num",
+    direction: "min",
+  },
+  {
+    id: "simplecov",
+    match: /(^|\/)simplecov\.thresholds\.json$/,
+    kind: "json-num",
+    direction: "min",
+  },
+  {
+    id: "e2e",
+    match: /(^|\/)e2e\.thresholds\.json$/,
+    kind: "json-num",
+    direction: "min",
+  },
+  {
+    id: "eslint",
+    match: /(^|\/)eslint\.thresholds\.json$/,
+    kind: "json-num",
+    direction: "max",
+  },
+  {
+    id: "rubocop",
+    match: /(^|\/)rubocop\.thresholds\.yml$/,
+    kind: "rubocop-yaml",
+    direction: "max",
+  },
+  { id: "stryker", match: /(^|\/)stryker\.conf\.json$/, kind: "stryker" },
+  {
+    id: "k6",
+    match: /(^|\/)\.github\/k6\/thresholds\/[^/]+\.json$/,
+    kind: "k6",
+  },
+  {
+    // #3992. The always-on eager rule tier is concatenated into every session
+    // AND every subagent start, so its byte ceiling is a quality threshold like
+    // any other. `max` because the number is a ceiling: lowering it tightens the
+    // gate and is free, raising it re-authorises context the cleanup removed and
+    // is the change a human has to see. The tier was cut to 26,540 bytes once
+    // and regrew to 201,083 in fourteen weeks with nothing watching it.
+    id: "eager-rules",
+    match: /(^|\/)eager-rules\.thresholds\.json$/,
+    kind: "json-num",
+    direction: "max",
+  },
+  {
+    id: "lisa-config",
+    match: /(^|\/)\.lisa\.config\.json$/,
+    kind: "allow-list",
+  },
+  {
+    // The #3811 quarantine. `allow-list` is exactly right here: the list may
+    // shrink freely, and ADDING a file — re-authorising type debt that the
+    // gate would otherwise refuse — is the change that needs a human to see it.
+    id: "typecheck-quarantine",
+    match: /(^|\/)typecheck-quarantine\.json$/,
+    kind: "allow-list",
+  },
+  {
+    id: "lighthouse",
+    match: /(^|\/)(?:lighthouserc-config|lighthouserc|\.lighthouserc)\.json$/,
+    kind: "lighthouse",
+  },
+];
+
+/**
+ * Which way each Lighthouse assertion key ratchets.
+ *
+ * Lighthouse mixes floors and ceilings in one file, so assigning one direction
+ * to the whole family would silently approve half of the possible weakenings.
+ * Unknown keys stay unwatched until their direction is explicit here.
+ * @type {Readonly<Record<string, "min"|"max">>}
+ */
+export const LIGHTHOUSE_ASSERTION_DIRECTIONS = Object.freeze({
+  minScore: "min",
+  maxNumericValue: "max",
+  maxLength: "max",
+});
+
+const LIGHTHOUSE_LEVELS = Object.freeze({ off: 0, warn: 1, error: 2 });
+
+/**
+ * Extract numeric Lighthouse assertions with a direction chosen per key.
+ *
+ * A malformed array is deliberately ignored instead of being walked as an
+ * object whose numeric indices look like audit names.
+ * @param {unknown} conf Parsed lighthouserc-config.json
+ * @returns {Map<string, { value: number, direction: "min"|"max" }>} Dotted
+ *   `assertion.key` path to numeric constraint
+ */
+export function extractLighthouseAssertions(conf) {
+  const out = new Map();
+  const root =
+    conf && typeof conf === "object" && !Array.isArray(conf)
+      ? /** @type {Record<string, unknown>} */ (conf)
+      : undefined;
+  const ci =
+    root?.ci && typeof root.ci === "object" && !Array.isArray(root.ci)
+      ? /** @type {Record<string, unknown>} */ (root.ci)
+      : undefined;
+  const assert =
+    ci?.assert && typeof ci.assert === "object" && !Array.isArray(ci.assert)
+      ? /** @type {Record<string, unknown>} */ (ci.assert)
+      : undefined;
+  // Lighthouse CI's canonical shape is `ci.assert.assertions`. Keep the
+  // historical top-level shape as a compatibility lane for already-generated
+  // project configs, but never merge the two into an ambiguous hybrid.
+  const assertions = assert?.assertions ?? root?.assertions;
+  if (
+    !assertions ||
+    typeof assertions !== "object" ||
+    Array.isArray(assertions)
+  ) {
+    return out;
+  }
+  for (const [audit, spec] of Object.entries(assertions)) {
+    const level = Array.isArray(spec) ? spec[0] : spec;
+    if (typeof level === "string" && Object.hasOwn(LIGHTHOUSE_LEVELS, level)) {
+      out.set(`${audit}.$level`, {
+        value: LIGHTHOUSE_LEVELS[level],
+        direction: "min",
+      });
+    }
+    const options =
+      Array.isArray(spec) &&
+      spec.length >= 2 &&
+      spec[1] &&
+      typeof spec[1] === "object" &&
+      !Array.isArray(spec[1])
+        ? /** @type {Record<string, unknown>} */ (spec[1])
+        : spec && typeof spec === "object" && !Array.isArray(spec)
+          ? /** @type {Record<string, unknown>} */ (spec)
+          : undefined;
+    if (!options) continue;
+    for (const [key, value] of Object.entries(options)) {
+      const direction = Object.hasOwn(LIGHTHOUSE_ASSERTION_DIRECTIONS, key)
+        ? LIGHTHOUSE_ASSERTION_DIRECTIONS[key]
+        : undefined;
+      if (direction && typeof value === "number" && Number.isFinite(value)) {
+        out.set(`${audit}.${key}`, { value, direction });
+      }
+    }
+  }
+  return out;
+}
+
+/**
+ * Find the family a repo-relative path belongs to.
+ * @param {string} relPath Repo-relative path (forward slashes)
+ * @returns {(typeof FAMILIES)[number] | undefined} The matching family, or
+ *   undefined when the path is not a watched gate file
+ */
+export function familyFor(relPath) {
+  return FAMILIES.find(f => f.match.test(relPath));
+}
+
+/**
+ * Safe JSON parse.
+ * @param {string | null | undefined} text JSON text
+ * @returns {unknown | undefined} Parsed value, or undefined on failure
+ */
+export function parseJson(text) {
+  if (typeof text !== "string") return undefined;
+  try {
+    return JSON.parse(text);
+  } catch {
+    return undefined;
+  }
+}
+
+/**
+ * Walk a JSON object and collect numeric leaves as dotted-path constraints.
+ * Keys starting with "_" (e.g. `_comment`) are documentation, not thresholds.
+ * @param {unknown} node Parsed JSON value
+ * @param {"min"|"max"} direction Ratchet direction for every leaf
+ * @param {string} [prefix] Dotted path accumulated so far
+ * @returns {Map<string, { value: number, direction: "min"|"max" }>} Dotted
+ *   path → numeric constraint for every finite numeric leaf
+ */
+export function extractNumericLeaves(node, direction, prefix = "") {
+  const out = new Map();
+  if (node === null || typeof node !== "object" || Array.isArray(node)) {
+    return out;
+  }
+  for (const [key, value] of Object.entries(node)) {
+    if (key.startsWith("_")) continue;
+    const p = prefix ? `${prefix}.${key}` : key;
+    if (typeof value === "number" && Number.isFinite(value)) {
+      out.set(p, { value, direction });
+    } else if (value && typeof value === "object" && !Array.isArray(value)) {
+      for (const [cp, c] of extractNumericLeaves(value, direction, p)) {
+        out.set(cp, c);
+      }
+    }
+  }
+  return out;
+}
+
+/**
+ * Minimal parser for rubocop.thresholds.yml — a two-level document of
+ * `Section:` headers with indented `Key: <number>` scalars (comments and
+ * blank lines ignored). Deliberately NOT a general YAML parser: the file is
+ * Lisa-authored with this exact shape, and hand-parsing keeps the gate
+ * dependency-free with no backtracking-prone regexes.
+ * @param {string} text File contents
+ * @param {"min"|"max"} direction Ratchet direction for every scalar
+ * @returns {Map<string, { value: number, direction: "min"|"max" }>} Dotted
+ *   `Section.Key` path → numeric constraint
+ */
+export function extractRubocopThresholds(text, direction) {
+  const out = new Map();
+  const state = { section: "" };
+  for (const rawLine of text.split("\n")) {
+    const hash = rawLine.indexOf("#");
+    const line = (hash >= 0 ? rawLine.slice(0, hash) : rawLine).trimEnd();
+    if (!line.trim()) continue;
+    const indented = line.startsWith(" ") || line.startsWith("\t");
+    if (!indented && line.endsWith(":")) {
+      state.section = line.slice(0, -1).trim();
+      continue;
+    }
+    const colon = line.indexOf(":");
+    if (!indented || colon < 0 || !state.section) continue;
+    const key = line.slice(0, colon).trim();
+    const rawValue = line.slice(colon + 1).trim();
+    // Number("") is 0, so an empty value (e.g. a nested `Exclude:` list
+    // header) must be skipped, not recorded as a zero threshold.
+    const value = Number(rawValue);
+    if (key && rawValue !== "" && Number.isFinite(value)) {
+      out.set(`${state.section}.${key}`, { value, direction });
+    }
+  }
+  return out;
+}
+
+/**
+ * Extract the gating constraint from stryker.conf.json: only
+ * `thresholds.break` fails a run (`high`/`low` are reporting bands).
+ * @param {unknown} conf Parsed stryker.conf.json
+ * @returns {Map<string, { value: number, direction: "min"|"max" }>} The
+ *   `thresholds.break` constraint when present, otherwise an empty map
+ */
+export function extractStrykerConstraints(conf) {
+  const out = new Map();
+  const breakValue = conf?.thresholds?.break;
+  if (typeof breakValue === "number" && Number.isFinite(breakValue)) {
+    out.set("thresholds.break", { value: breakValue, direction: "min" });
+  }
+  return out;
+}
+
+/**
+ * Split a stryker `mutate` array into positive globs and negations.
+ * @param {unknown} conf Parsed stryker.conf.json
+ * @returns {{ positives: Set<string>, negations: Set<string> }} Globs that
+ *   include files vs. `!`-prefixed globs that exclude them
+ */
+export function extractStrykerMutate(conf) {
+  const positives = new Set();
+  const negations = new Set();
+  const mutate = Array.isArray(conf?.mutate) ? conf.mutate : [];
+  for (const glob of mutate) {
+    if (typeof glob !== "string") continue;
+    if (glob.startsWith("!")) negations.add(glob);
+    else positives.add(glob);
+  }
+  return { positives, negations };
+}
+
+/**
+ * The literal directory prefix a glob is rooted at, before any wildcard.
+ *
+ * `lib/**\/*.spec.ts` and `!lib/**\/*.d.ts` are both rooted at `lib`. This is
+ * what lets the ratchet tell territory a change ADDED from territory it
+ * already covered: an exclusion inside a newly added root cannot shrink a
+ * gate, because nothing there was being mutated a moment ago.
+ * @param {string} glob A stryker mutate entry, with or without a leading `!`
+ * @returns {string} The rooted prefix, or "" when the glob starts with a wildcard
+ */
+export function globRoot(glob) {
+  const bare = glob.startsWith("!") ? glob.slice(1) : glob;
+  // Backslash escapes and parent traversal make textual containment unsafe.
+  // An unknown prefix overlaps everything rather than granting an exemption.
+  if (bare.includes("\\") || bare.split("/").includes("..")) return "";
+  const rooted = [];
+  for (const segment of bare.split("/")) {
+    if (segment === "." || segment === "") continue;
+    if (["*", "?", "{", "[", "("].some(meta => segment.includes(meta))) break;
+    rooted.push(segment);
+  }
+  return rooted.join("/");
+}
+
+/**
+ * Parse one k6 threshold expression (`p(95)<1000`, `rate>=0.99`, …) into a
+ * ratchet constraint. Upper bounds (`<`, `<=`) may only decrease; lower
+ * bounds (`>`, `>=`) may only increase. Hand-parsed — no regex.
+ * @param {string} expr Threshold expression
+ * @returns {{ value: number, direction: "min"|"max" } | undefined} The bound
+ *   as a constraint, or undefined when the expression has no numeric bound
+ */
+export function parseK6Expression(expr) {
+  for (const op of ["<=", ">=", "<", ">"]) {
+    const idx = expr.indexOf(op);
+    if (idx < 0) continue;
+    const value = Number(expr.slice(idx + op.length).trim());
+    if (!Number.isFinite(value)) return undefined;
+    return { value, direction: op.startsWith("<") ? "max" : "min" };
+  }
+  return undefined;
+}
+
+/**
+ * Extract constraints from a k6 thresholds file. Each metric contributes its
+ * expression bound(s) plus (when present) `abortOnFail` boolean constraints —
+ * turning abortOnFail off makes the gate advisory, which is a weakening.
+ * Handles every documented k6 shape: a bare expression string, a single long
+ * form `{ threshold, abortOnFail }` object, and arrays mixing both.
+ * @param {unknown} conf Parsed k6 thresholds JSON
+ * @returns {{
+ *   numeric: Map<string, { value: number, direction: "min"|"max" }>,
+ *   booleans: Map<string, boolean>,
+ * }} Numeric bounds keyed by `<metric>.threshold[i]` and abortOnFail flags
+ *   keyed by `<metric>.abortOnFail` (`[i]`-suffixed for array items)
+ */
+export function extractK6Constraints(conf) {
+  const numeric = new Map();
+  const booleans = new Map();
+  const thresholds = conf?.thresholds;
+  if (thresholds && typeof thresholds === "object") {
+    for (const [metric, spec] of Object.entries(thresholds)) {
+      const isArray = Array.isArray(spec);
+      const items = isArray ? spec : [spec];
+      items.forEach((item, i) => {
+        const expr =
+          typeof item === "string"
+            ? item
+            : item && typeof item === "object" && !Array.isArray(item)
+              ? item.threshold
+              : undefined;
+        if (typeof expr === "string") {
+          const c = parseK6Expression(expr);
+          if (c) numeric.set(`${metric}.threshold[${i}]`, c);
+        }
+        if (
+          item &&
+          typeof item === "object" &&
+          !Array.isArray(item) &&
+          typeof item.abortOnFail === "boolean"
+        ) {
+          booleans.set(
+            isArray ? `${metric}.abortOnFail[${i}]` : `${metric}.abortOnFail`,
+            item.abortOnFail
+          );
+        }
+      });
+    }
+  }
+  return { numeric, booleans };
+}
+
+/**
+ * Extract thresholdRatchet.allow entries from parsed .lisa.config.json.
+ * @param {unknown} config Parsed config (may be undefined)
+ * @returns {Array<{ file: string, key: string, reason?: string, until?: unknown }>}
+ *   The well-formed allow entries; malformed entries are dropped
+ */
+export function extractAllowEntries(config) {
+  const raw = config?.thresholdRatchet?.allow;
+  if (!Array.isArray(raw)) return [];
+  return raw.filter(
+    e => e && typeof e.file === "string" && typeof e.key === "string"
+  );
+}
+
+/**
+ * The three states an allow entry's expiry condition can be in.
+ *
+ * THE DEFECT THESE EXIST FOR (#3856). An allow entry is the human-approved way
+ * for a weakening to pass the ratchet, and it had no expiry, no review and no
+ * removal path — nothing read the `reason`, so an exemption granted for a
+ * temporary condition (a migration in flight, a suite being rewritten, a
+ * dependency waiting upstream) outlived the condition and kept applying,
+ * silently, forever. The set of gates actually enforced therefore shrank
+ * monotonically while every individual decision that shrank it was correct at
+ * the time. A control whose exception list only grows converges on no control.
+ *
+ * The shape is taken from `_thresholdsDivergence` in `stryker.conf.json`,
+ * governed by `src/sync/stryker-thresholds-ownership.ts` — the one exemption
+ * surface in this repository that already stops exempting when it goes stale.
+ * Its three properties are reproduced here: the entry records its condition in
+ * a form something can evaluate, the reason says what resolves it, and once the
+ * condition passes the entry stops exempting AND says so, naming the remedy.
+ *
+ * `unchecked` is deliberately NOT `expired`. An entry written before `until`
+ * existed names a condition nothing can evaluate, which is the prose situation
+ * the ticket describes — it is reported every run, loudly, and it keeps
+ * exempting. Refusing it instead would red-wall every project mid-migration
+ * that carries a valid exception, which is the failure the ticket names as
+ * worse than the defect.
+ * @type {Readonly<Record<string, "live"|"expired"|"unchecked">>}
+ */
+export const ALLOW_STATE = Object.freeze({
+  LIVE: "live",
+  EXPIRED: "expired",
+  UNCHECKED: "unchecked",
+});
+
+/** A calendar condition, and the only shape `until` may take. */
+const ISO_DAY = /^(\d{4})-(\d{2})-(\d{2})$/u;
+
+/** An entry is live through the END of its named day, not up to its start. */
+const DAY_MS = 86_400_000;
+
+/**
+ * The instant an `until` condition stops holding.
+ *
+ * Round-tripped through `toISOString` on purpose: `Date.UTC` accepts
+ * out-of-range components and slides them, so `2026-02-31` would silently
+ * become March 3rd and `0099-01-01` would become 1999. An exemption dated a day
+ * that does not exist is a condition nobody can evaluate, and saying so is the
+ * honest answer — quietly moving it would hand the entry a different, longer
+ * life than the one written down.
+ * @param {unknown} until The entry's `until` field
+ * @returns {number | undefined} Epoch ms after which the entry has expired, or
+ *   undefined when `until` is not a calendar day anything can evaluate
+ */
+export function allowEntryExpiry(until) {
+  if (typeof until !== "string") return undefined;
+  const day = until.trim();
+  const match = ISO_DAY.exec(day);
+  if (!match) return undefined;
+  const midnight = Date.UTC(
+    Number(match[1]),
+    Number(match[2]) - 1,
+    Number(match[3])
+  );
+  if (new Date(midnight).toISOString().slice(0, 10) !== day) return undefined;
+  return midnight + DAY_MS;
+}
+
+/**
+ * Name an allow entry so a report says WHICH exemption it is talking about,
+ * and how much it covers.
+ *
+ * File-wide and key-scoped entries are spelled differently because they are
+ * different risks wearing the same shape: `key: "*"` turns off ratchet
+ * protection for every threshold in the file, and in a config diff that reads
+ * as one more approved exception.
+ * @param {{ file: string, key: string }} entry An allow entry, already
+ *   well-formed — `extractAllowEntries` is the only source of these
+ * @returns {string} Operator-readable identification of the entry
+ */
+export function describeAllowScope(entry) {
+  return entry.key === "*"
+    ? `thresholdRatchet.allow entry ${entry.file} → * (file-wide: every key in the file)`
+    : `thresholdRatchet.allow entry ${entry.file} → ${entry.key} (key-scoped)`;
+}
+
+/**
+ * Classify one allow entry's expiry condition, and say what to do about it.
+ * @param {{ file: string, key: string, reason?: unknown, until?: unknown }} entry
+ *   An allow entry
+ * @param {number} now Clock reading, injected so the check is deterministic
+ * @returns {{ state: "live"|"expired"|"unchecked", scope: string, summary: string, detail: string }}
+ *   The state, the entry's identification, a short phrase for a one-line
+ *   mention, and the full sentence naming the entry, its reason and the remedy
+ */
+export function classifyAllowEntry(entry, now) {
+  const scope = describeAllowScope(entry);
+  const because =
+    typeof entry.reason === "string" && entry.reason.trim() !== ""
+      ? ` Reason on record: ${entry.reason.trim()}`
+      : " No reason is recorded.";
+  const expiresAt = allowEntryExpiry(entry.until);
+  if (expiresAt === undefined) {
+    const summary = `names no condition anything can evaluate (until = ${JSON.stringify(entry.until ?? null)})`;
+    return {
+      state: ALLOW_STATE.UNCHECKED,
+      scope,
+      summary,
+      detail: `${scope} ${summary}, so nothing can ever end it. Give it "until": "YYYY-MM-DD" naming the day the exemption is reviewed, or delete it.${because}`,
+    };
+  }
+  const day = String(entry.until).trim();
+  if (now >= expiresAt) {
+    const summary = `expired after ${day}`;
+    return {
+      state: ALLOW_STATE.EXPIRED,
+      scope,
+      summary,
+      detail: `${scope} ${summary} and no longer exempts anything. Delete it, or record a fresh human-approved entry naming the new condition.${because}`,
+    };
+  }
+  const summary = `is live until ${day}`;
+  return {
+    state: ALLOW_STATE.LIVE,
+    scope,
+    summary,
+    detail: `${scope} ${summary}.`,
+  };
+}

package/dist/configs/repo-scan.js

@@ -12,7 +12,7 @@
  * A scratch sandbox is the dangerous one, because it is a **full second copy of
  * the tree**. Measured on this repository: a `stryker` run terminated under
  * fleet saturation left 42 MB at
- * `.stryker-tmp/bite-guard-intact/sandbox-<id>/rails/copy-overwrite/scripts/lisa-scratch-run.sh`,
+ * `.stryker-tmp/bite-guard-intact/sandbox-<id>/all/copy-overwrite/scripts/lisa-scratch-run.sh`,
  * a second copy of a file one scan asserts is unique by basename. That scan
  * failed on the NEXT run, with a clean, specific, entirely plausible message
  * about a duplicate file — and nothing in its output mentioned mutation,

package/dist/core/lisa-owned-hash-ledger.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lisa-owned-hash-ledger.d.ts","sourceRoot":"","sources":["../../src/core/lisa-owned-hash-ledger.ts"],"names":[],"mappings":"AACA,6EAA6E;AAE7E;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAC3C,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CA2yDjC,CAAC;AAEH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,+BAA+B,EAAE,QAAQ,CACpD,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CA8sDjC,CAAC"}
+{"version":3,"file":"lisa-owned-hash-ledger.d.ts","sourceRoot":"","sources":["../../src/core/lisa-owned-hash-ledger.ts"],"names":[],"mappings":"AACA,6EAA6E;AAE7E;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAC3C,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CA00DjC,CAAC;AAEH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,+BAA+B,EAAE,QAAQ,CACpD,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CA6uDjC,CAAC"}