@scriptc/compiler 0.2.5 → 0.2.7

package/ambient/scriptc-node-fallback.d.ts

@@ -250,24 +250,8 @@ declare var process: {
    * preserved. The boolean is Node's backpressure signal — these synchronous
    * writes always return true. Static BufferEncoding arguments and the
    * completion callback overloads match Node's WritableStream surface. */
-  stdout: {
-    write(data: string | Uint8Array, callback?: (error?: Error | null) => void): boolean;
-    write(
-      data: string | Uint8Array,
-      encoding: BufferEncoding,
-      callback?: (error?: Error | null) => void,
-    ): boolean;
-    readonly isTTY: boolean;
-  };
-  stderr: {
-    write(data: string | Uint8Array, callback?: (error?: Error | null) => void): boolean;
-    write(
-      data: string | Uint8Array,
-      encoding: BufferEncoding,
-      callback?: (error?: Error | null) => void,
-    ): boolean;
-    readonly isTTY: boolean;
-  };
+  stdout: import("tty").WriteStream;
+  stderr: import("tty").WriteStream;
   /* The stdin stream, the piped-input slice: the TTY probe, the
    * data/end/error events (on and once — a 'data' listener keeps the
    * event loop alive until EOF, like Node's flowing stdin), destroy()
@@ -601,7 +585,7 @@ interface BufferConstructor {
   from(data: string, encoding?: BufferEncoding): Buffer;
   /* The ArrayBuffer form is the VIEW construction: x.buffer with an
    * optional byte offset/length shares x's storage (the subarray rule). */
-  from(data: ArrayBuffer, byteOffset?: number, length?: number): Buffer;
+  from(data: ArrayBuffer | SharedArrayBuffer, byteOffset?: number, length?: number): Buffer;
   from(data: Uint8Array | readonly number[]): Buffer;
   alloc(size: number, fill?: string | number | Uint8Array, encoding?: BufferEncoding): Buffer;
   compare(buf1: Uint8Array, buf2: Uint8Array): number;
@@ -1118,24 +1102,13 @@ interface ImportMeta {
  * directory, open 'x'"). `rmSync` removes FILES only (like Node without
  * `recursive`); empty directories go through `rmdirSync`. */
 declare module "node:fs" {
-  /* The lowered forms first. The string-encoding overload's result is
-   * CONDITIONAL so a runtime encoding value (an untyped JS parameter —
-   * test/common fixtures.js's readFixtureKey(name, enc)) infers `any`
-   * (the lowering dispatches at runtime: undefined/null read Buffers,
-   * utf8 a string, anything else throws) while a literal utf8 keeps the
-   * string result TypeScript callers chain on. The encoding-less
-   * overload is the Buffer read. */
-  export function readFileSync<T extends string>(
-    path: string,
-    encoding: T,
-  ): T extends "utf8" ? string : T extends "utf-8" ? string : any;
-  export function readFileSync(path: string): Buffer;
-  /* The file-descriptor forms — a read(2) loop to EOF from the current
-   * position; the stdin pattern is readFileSync(0, "utf8"). */
-  export function readFileSync(fd: number, encoding: "utf8" | "utf-8"): string;
-  export function readFileSync(fd: number): Buffer;
-  /* The options-object spelling of the utf8 form. */
-  export function readFileSync(path: string, options: { encoding: "utf8" | "utf-8" }): string;
+  export function readFileSync(path: string | number, encoding: BufferEncoding): string;
+  export function readFileSync(
+    path: string | number,
+    options: { encoding: BufferEncoding },
+  ): string;
+  export function readFileSync(path: string | number): Buffer;
+  export function readFileSync(path: string, options: unknown): string | Buffer;
   /* Error-first callbacks select string or Buffer data from their encoding.
    * Unknown options retain that union until the caller validates the value. */
   export function readFile(
@@ -4107,23 +4080,61 @@ declare module "node:dns" {
   export * from "dns";
 }
 
-/* node:worker_threads — the MAIN-THREAD slice only. A compiled binary is
- * always the main thread (no JS-engine thread machinery exists), so
- * isMainThread lowers to `true` and threadId to 0 — Node's main-thread
- * answers exactly. Worker itself is declared surface without a lowering:
- * constructing one fences at the site; the CLASS as a value participates
- * in identity-only flows. */
+/* node:worker_threads — native workers use statically compiled entry points.
+ * Lowering and runtime diagnostics define the supported options and methods. */
 declare module "worker_threads" {
   export const isMainThread: boolean;
+  export const isInternalThread: boolean;
   export const threadId: number;
+  export interface WorkerOptions {
+    workerData?: unknown;
+    transferList?: readonly unknown[];
+    argv?: readonly unknown[];
+    name?: string;
+    [option: string]: unknown;
+  }
   export class Worker {
-    constructor(filename: string | URL, options?: unknown);
-    on(event: string, listener: (...args: unknown[]) => void): void;
-    postMessage(value: unknown): void;
+    constructor(filename: string | URL, options?: WorkerOptions);
+    readonly threadId: number;
+    on(event: "online", listener: () => void): this;
+    on(event: "message", listener: (value: any) => void): this;
+    on(event: "error", listener: (error: Error) => void): this;
+    on(event: "exit", listener: (code: number) => void): this;
+    on(event: string, listener: (...args: any[]) => void): this;
+    once(event: string, listener: (...args: any[]) => void): this;
+    off(event: string, listener: (...args: any[]) => void): this;
+    addListener(event: string, listener: (...args: any[]) => void): this;
+    removeListener(event: string, listener: (...args: any[]) => void): this;
+    prependListener(event: string, listener: (...args: any[]) => void): this;
+    prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+    postMessage(value: unknown, transferList?: readonly unknown[]): void;
+    ref(): void;
+    unref(): void;
     terminate(): Promise<number>;
+    removeAllListeners(event?: string): this;
+    listenerCount(event: string, listener?: (...args: any[]) => void): number;
+  }
+  export class MessagePort {
+    on(event: "message", listener: (value: any) => void): this;
+    on(event: "close", listener: () => void): this;
+    on(event: string, listener: (...args: any[]) => void): this;
+    once(event: string, listener: (...args: any[]) => void): this;
+    off(event: string, listener: (...args: any[]) => void): this;
+    addListener(event: string, listener: (...args: any[]) => void): this;
+    removeListener(event: string, listener: (...args: any[]) => void): this;
+    prependListener(event: string, listener: (...args: any[]) => void): this;
+    prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+    postMessage(value: unknown, transferList?: readonly unknown[]): void;
+    start(): void;
+    close(callback?: () => void): void;
+    ref(): void;
+    unref(): void;
+    hasRef(): boolean;
+    removeAllListeners(event?: string): this;
+    listenerCount(event: string, listener?: (...args: any[]) => void): number;
   }
-  export const parentPort: unknown;
-  export const workerData: unknown;
+  export const parentPort: MessagePort | null;
+  export const workerData: any;
 }
 declare module "node:worker_threads" {
   export * from "worker_threads";
@@ -4176,6 +4187,9 @@ declare module "tty" {
       callback?: (error?: Error | null) => void,
     ): boolean;
     readonly isTTY: boolean;
+    readonly columns: number;
+    readonly rows: number;
+    getWindowSize(): [number, number];
   }
   export function isatty(fd: number): boolean;
 }

package/dist/backend/cycle-analysis.d.ts

@@ -1,14 +1,26 @@
 import type { IrModule } from "../ir/ir.js";
 /** Cycle capability for native code generation.
- * Greatest fixpoint over shapes and unions: start optimistic (everything
- * cycle-capable), repeatedly drop shapes with no cycle-capable field and
- * unions with no cycle-capable arm until stable. Closures, checked values and promises
- * are always cycle-capable; strings never are; arrays/Sets inherit their
- * element type's capability and Maps inherit either key or value capability.
- * A HIERARCHY is one unit of capability
- * (a base-typed slot can hold any subclass and retain touches the cycle
- * header, so header presence must be uniform across an extends tree): a
- * unit is cycle-capable iff ANY member is — every backend uses the same grouping. */
+ * Nodes are shape units and unions; edges are the references their fields
+ * and arms can hold (collections flattened into their element, key and
+ * value types). Closures, checked values, class values, caught values and
+ * promises are INTRINSIC: they can reach anything, so a unit holding one is
+ * on a potential cycle. Strings never are.
+ *
+ * An edge is IMMUTABLE when it can only be stored while its owner is still
+ * under construction (cycle-mutability.ts derives this from the IR): such an
+ * object can only point to objects that existed before it, so a heap cycle
+ * made only of immutable edges is impossible. Union arms are immutable (the
+ * boxes are), and any edge through an array, Map, or Set is mutable because
+ * the container's contents are. A strongly connected component is
+ * cycle-capable iff it contains an intrinsic unit or a mutable internal
+ * edge; a unit or union is traced iff it can reach a cycle-capable
+ * component. With every edge mutable this is exactly the earlier greatest
+ * fixpoint: traced iff the unit reaches a cycle or an intrinsic reference.
+ *
+ * A HIERARCHY is one unit of capability (a base-typed slot can hold any
+ * subclass and retain touches the cycle header, so header presence must be
+ * uniform across an extends tree): a unit is cycle-capable iff ANY member
+ * is — every backend uses the same grouping. */
 export declare function computeTraced(mod: IrModule): {
     shapes: Set<string>;
     unions: Set<string>;

package/dist/backend/cycle-analysis.js

@@ -1,36 +1,29 @@
 import { funcOf, mapOf, RUNTIME_EMITTER_CLASS, STRING, VOID } from "../ir/ir.js";
+import { computeCycleMutability, fieldKey } from "./cycle-mutability.js";
 /** Cycle capability for native code generation.
- * Greatest fixpoint over shapes and unions: start optimistic (everything
- * cycle-capable), repeatedly drop shapes with no cycle-capable field and
- * unions with no cycle-capable arm until stable. Closures, checked values and promises
- * are always cycle-capable; strings never are; arrays/Sets inherit their
- * element type's capability and Maps inherit either key or value capability.
- * A HIERARCHY is one unit of capability
- * (a base-typed slot can hold any subclass and retain touches the cycle
- * header, so header presence must be uniform across an extends tree): a
- * unit is cycle-capable iff ANY member is — every backend uses the same grouping. */
+ * Nodes are shape units and unions; edges are the references their fields
+ * and arms can hold (collections flattened into their element, key and
+ * value types). Closures, checked values, class values, caught values and
+ * promises are INTRINSIC: they can reach anything, so a unit holding one is
+ * on a potential cycle. Strings never are.
+ *
+ * An edge is IMMUTABLE when it can only be stored while its owner is still
+ * under construction (cycle-mutability.ts derives this from the IR): such an
+ * object can only point to objects that existed before it, so a heap cycle
+ * made only of immutable edges is impossible. Union arms are immutable (the
+ * boxes are), and any edge through an array, Map, or Set is mutable because
+ * the container's contents are. A strongly connected component is
+ * cycle-capable iff it contains an intrinsic unit or a mutable internal
+ * edge; a unit or union is traced iff it can reach a cycle-capable
+ * component. With every edge mutable this is exactly the earlier greatest
+ * fixpoint: traced iff the unit reaches a cycle or an intrinsic reference.
+ *
+ * A HIERARCHY is one unit of capability (a base-typed slot can hold any
+ * subclass and retain touches the cycle header, so header presence must be
+ * uniform across an extends tree): a unit is cycle-capable iff ANY member
+ * is — every backend uses the same grouping. */
 export function computeTraced(mod) {
     const classes = mod.classes ?? [];
-    const shapeDefs = [
-        ...classes.map((c) => ({
-            key: `object:${c.name}`,
-            fields: [
-                ...c.fields,
-                ...(c.name === RUNTIME_EMITTER_CLASS
-                    ? [{ name: "<listeners>", type: funcOf([], VOID) }]
-                    : []),
-                ...(c.localCaptures !== undefined
-                    ? [{ name: "<class>", type: { kind: "classval", className: c.name } }]
-                    : []),
-            ],
-        })),
-        ...(mod.records ?? []).map((r) => ({
-            key: `record:${r.id}`,
-            fields: r.indexValue
-                ? [...r.fields, { name: "<overflow>", type: mapOf(STRING, r.indexValue) }]
-                : r.fields,
-        })),
-    ];
     // Hierarchy units: root lookup over the base links (classes with a base
     // or a subclass — and the runtime emitter class — form units under their
     // root; standalone classes and records stay singleton units).
@@ -51,28 +44,52 @@ export function computeTraced(mod) {
             roots.set(member, cur);
         return cur;
     };
-    const capability = () => ({
+    const unitOfClass = (name) => `object:${rootOf(name)}`;
+    const mutability = computeCycleMutability(mod, unitOfClass);
+    const shapeDefs = [
+        ...classes.map((c) => ({
+            key: `object:${c.name}`,
+            unit: unitOfClass(c.name),
+            fields: [
+                ...c.fields,
+                ...(c.name === RUNTIME_EMITTER_CLASS
+                    ? [{ name: "<listeners>", type: funcOf([], VOID) }]
+                    : []),
+                ...(c.localCaptures !== undefined
+                    ? [{ name: "<class>", type: { kind: "classval", className: c.name } }]
+                    : []),
+            ],
+        })),
+        ...(mod.records ?? []).map((r) => ({
+            key: `record:${r.id}`,
+            unit: `record:${r.id}`,
+            fields: r.indexValue
+                ? [...r.fields, { name: "<overflow>", type: mapOf(STRING, r.indexValue) }]
+                : r.fields,
+        })),
+    ];
+    const node = () => ({
         intrinsic: false,
-        dependencies: new Set(),
-        dependents: [],
-        remaining: 0,
+        edges: new Map(),
+        index: -1,
+        low: 0,
+        onStack: false,
+        component: -1,
+        reverse: [],
+        traced: false,
     });
     const units = new Map();
     const shapes = new Map();
-    const unions = new Map((mod.unions ?? []).map((u) => [u.id, capability()]));
+    const unions = new Map((mod.unions ?? []).map((u) => [u.id, node()]));
     for (const s of shapeDefs) {
-        const key = s.key.startsWith("object:")
-            ? `object:${rootOf(s.key.slice("object:".length))}`
-            : s.key;
-        let unit = units.get(key);
+        let unit = units.get(s.unit);
         if (!unit)
-            units.set(key, (unit = capability()));
+            units.set(s.unit, (unit = node()));
         shapes.set(s.key, unit);
     }
-    // Each field/arm is an OR of intrinsic capability and referenced units.
-    // Flatten collections into these edges; repeated references count once.
-    const addType = (unit, t) => {
-        if (unit.intrinsic)
+    // Each field/arm is an OR of intrinsic capability and referenced nodes.
+    const addType = (from, t, mutable) => {
+        if (from.intrinsic)
             return;
         switch (t.kind) {
             case "func":
@@ -80,8 +97,8 @@ export function computeTraced(mod) {
             case "classval":
             case "promise":
             case "caught":
-                unit.intrinsic = true;
-                unit.dependencies.clear();
+                from.intrinsic = true;
+                from.edges.clear();
                 break;
             case "object":
             case "record":
@@ -90,44 +107,99 @@ export function computeTraced(mod) {
                     ? unions.get(t.unionId)
                     : shapes.get(t.kind === "object" ? `object:${t.className}` : `record:${t.shapeId}`);
                 if (dependency)
-                    unit.dependencies.add(dependency);
+                    from.edges.set(dependency, (from.edges.get(dependency) ?? false) || mutable);
                 break;
             }
             case "map":
-                addType(unit, t.key);
-                addType(unit, t.value);
+                addType(from, t.key, true);
+                addType(from, t.value, true);
                 break;
             case "set":
             case "array":
-                addType(unit, t.elem);
+                addType(from, t.elem, true);
                 break;
         }
     };
-    for (const s of shapeDefs)
+    for (const s of shapeDefs) {
+        const unitMutable = mutability.all || mutability.units.has(s.unit);
         for (const field of s.fields)
-            addType(shapes.get(s.key), field.type);
+            addType(shapes.get(s.key), field.type, unitMutable || mutability.fields.has(fieldKey(s.unit, field.name)));
+    }
     for (const u of mod.unions ?? [])
         for (const arm of u.arms)
-            addType(unions.get(u.id), arm);
-    const pending = [];
-    for (const unit of [...units.values(), ...unions.values()]) {
-        unit.remaining = unit.dependencies.size;
-        for (const dependency of unit.dependencies)
-            dependency.dependents.push(unit);
-        if (!unit.intrinsic && unit.remaining === 0)
-            pending.push(unit);
+            addType(unions.get(u.id), arm, mutability.all);
+    // Tarjan's strongly connected components, iteratively (shape chains can
+    // be thousands deep).
+    const all = [...units.values(), ...unions.values()];
+    const stack = [];
+    const componentCapable = [];
+    let nextIndex = 0;
+    for (const start of all) {
+        if (start.index >= 0)
+            continue;
+        const work = [];
+        const enter = (n) => {
+            n.index = n.low = nextIndex++;
+            n.onStack = true;
+            stack.push(n);
+            work.push({ n, next: [...n.edges.keys()], i: 0 });
+        };
+        enter(start);
+        while (work.length > 0) {
+            const frame = work[work.length - 1];
+            if (frame.i < frame.next.length) {
+                const m = frame.next[frame.i++];
+                if (m.index < 0)
+                    enter(m);
+                else if (m.onStack)
+                    frame.n.low = Math.min(frame.n.low, m.index);
+                continue;
+            }
+            work.pop();
+            const n = frame.n;
+            if (work.length > 0) {
+                const parent = work[work.length - 1].n;
+                parent.low = Math.min(parent.low, n.low);
+            }
+            if (n.low !== n.index)
+                continue;
+            const id = componentCapable.length;
+            const members = [];
+            let member;
+            do {
+                member = stack.pop();
+                member.onStack = false;
+                member.component = id;
+                members.push(member);
+            } while (member !== n);
+            let capable = false;
+            for (const m of members) {
+                if (m.intrinsic)
+                    capable = true;
+                for (const [dependency, mutable] of m.edges)
+                    if (mutable && dependency.component === id)
+                        capable = true;
+            }
+            componentCapable.push(capable);
+        }
     }
-    // Peel incapable leaves. Units in cycles retain a dependency, and units
-    // containing intrinsic references never enter the removal queue.
+    // Traced: reaches a cycle-capable component (reverse reachability).
+    for (const n of all)
+        for (const dependency of n.edges.keys())
+            dependency.reverse.push(n);
+    const pending = all.filter((n) => componentCapable[n.component]);
+    for (const n of pending)
+        n.traced = true;
     for (let i = 0; i < pending.length; i++) {
-        for (const dependent of pending[i].dependents) {
-            if (--dependent.remaining === 0 && !dependent.intrinsic)
-                pending.push(dependent);
+        for (const dependent of pending[i].reverse) {
+            if (dependent.traced)
+                continue;
+            dependent.traced = true;
+            pending.push(dependent);
         }
     }
-    const retained = (unit) => unit.intrinsic || unit.remaining > 0;
-    const tracedShapes = new Set([...shapes].filter(([, unit]) => retained(unit)).map(([key]) => key));
-    const tracedUnions = new Set([...unions].filter(([, unit]) => retained(unit)).map(([id]) => id));
+    const tracedShapes = new Set([...shapes].filter(([, unit]) => unit.traced).map(([key]) => key));
+    const tracedUnions = new Set([...unions].filter(([, n]) => n.traced).map(([id]) => id));
     return { shapes: tracedShapes, unions: tracedUnions };
 }
 //# sourceMappingURL=cycle-analysis.js.map

package/dist/backend/cycle-analysis.js.map

@@ -1 +1 @@
-{"version":3,"file":"cycle-analysis.js","sourceRoot":"","sources":["../../src/backend/cycle-analysis.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,qBAAqB,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAEjF;;;;;;;;;qFASqF;AACrF,MAAM,UAAU,aAAa,CAAC,GAAa;IACzC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC;IAClC,MAAM,SAAS,GAAG;QAChB,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACrB,GAAG,EAAE,UAAU,CAAC,CAAC,IAAI,EAAE;YACvB,MAAM,EAAE;gBACN,GAAG,CAAC,CAAC,MAAM;gBACX,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,qBAAqB;oBAClC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;oBACnD,CAAC,CAAC,EAAE,CAAC;gBACP,GAAG,CAAC,CAAC,CAAC,aAAa,KAAK,SAAS;oBAC/B,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,UAAmB,EAAE,SAAS,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC/E,CAAC,CAAC,EAAE,CAAC;aACR;SACF,CAAC,CAAC;QACH,GAAG,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjC,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE;YACrB,MAAM,EAAE,CAAC,CAAC,UAAU;gBAClB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC1E,CAAC,CAAC,CAAC,CAAC,MAAM;SACb,CAAC,CAAC;KACJ,CAAC;IACF,wEAAwE;IACxE,yEAAyE;IACzE,8DAA8D;IAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAU,CAAC,CAAC,CAAC;IAC9E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAU,EAAE;QACtC,IAAI,GAAG,GAAG,IAAI,CAAC;QACf,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM;YAC/C,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;QACD,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;QAC5B,KAAK,MAAM,MAAM,IAAI,IAAI;YAAE,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAClD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IAOF,MAAM,UAAU,GAAG,GAAe,EAAE,CAAC,CAAC;QACpC,SAAS,EAAE,KAAK;QAChB,YAAY,EAAE,IAAI,GAAG,EAAE;QACvB,UAAU,EAAE,EAAE;QACd,SAAS,EAAE,CAAC;KACb,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5E,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;YACrC,CAAC,CAAC,UAAU,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE;YACnD,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACV,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;IACD,wEAAwE;IACxE,wEAAwE;IACxE,MAAM,OAAO,GAAG,CAAC,IAAgB,EAAE,CAAS,EAAQ,EAAE;QACpD,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAC3B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,MAAM,CAAC;YACZ,KAAK,KAAK,CAAC;YACX,KAAK,UAAU,CAAC;YAChB,KAAK,SAAS,CAAC;YACf,KAAK,QAAQ;gBACX,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACtB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;gBAC1B,MAAM;YACR,KAAK,QAAQ,CAAC;YACd,KAAK,QAAQ,CAAC;YACd,KAAK,OAAO,EAAE,CAAC;gBACb,MAAM,UAAU,GACd,CAAC,CAAC,IAAI,KAAK,OAAO;oBAChB,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;oBACvB,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;gBACxF,IAAI,UAAU;oBAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAClD,MAAM;YACR,CAAC;YACD,KAAK,KAAK;gBACR,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrB,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBACvB,MAAM;YACR,KAAK,KAAK,CAAC;YACX,KAAK,OAAO;gBACV,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;gBACtB,MAAM;QACV,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,MAAM;YAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACjG,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,IAAI,EAAE;QAAE,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,EAAE,GAAG,CAAC,CAAC;IAC5F,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAC3D,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;QACxC,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,YAAY;YAAE,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7E,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC;IACD,wEAAwE;IACxE,iEAAiE;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,KAAK,MAAM,SAAS,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,UAAU,EAAE,CAAC;YAC/C,IAAI,EAAE,SAAS,CAAC,SAAS,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS;gBAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,IAAgB,EAAW,EAAE,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrF,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CACrE,CAAC;IACF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;AACxD,CAAC"}
+{"version":3,"file":"cycle-analysis.js","sourceRoot":"","sources":["../../src/backend/cycle-analysis.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,qBAAqB,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AACjF,OAAO,EAAE,sBAAsB,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAEzE;;;;;;;;;;;;;;;;;;;;;gDAqBgD;AAChD,MAAM,UAAU,aAAa,CAAC,GAAa;IACzC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC;IAClC,wEAAwE;IACxE,yEAAyE;IACzE,8DAA8D;IAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAU,CAAC,CAAC,CAAC;IAC9E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAU,EAAE;QACtC,IAAI,GAAG,GAAG,IAAI,CAAC;QACf,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM;YAC/C,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;QACD,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;QAC5B,KAAK,MAAM,MAAM,IAAI,IAAI;YAAE,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAClD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,WAAW,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,UAAU,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;IACvE,MAAM,UAAU,GAAG,sBAAsB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG;QAChB,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACrB,GAAG,EAAE,UAAU,CAAC,CAAC,IAAI,EAAE;YACvB,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC;YACzB,MAAM,EAAE;gBACN,GAAG,CAAC,CAAC,MAAM;gBACX,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,qBAAqB;oBAClC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;oBACnD,CAAC,CAAC,EAAE,CAAC;gBACP,GAAG,CAAC,CAAC,CAAC,aAAa,KAAK,SAAS;oBAC/B,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,UAAmB,EAAE,SAAS,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC/E,CAAC,CAAC,EAAE,CAAC;aACR;SACF,CAAC,CAAC;QACH,GAAG,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjC,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE;YACrB,IAAI,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE;YACtB,MAAM,EAAE,CAAC,CAAC,UAAU;gBAClB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC1E,CAAC,CAAC,CAAC,CAAC,MAAM;SACb,CAAC,CAAC;KACJ,CAAC;IAYF,MAAM,IAAI,GAAG,GAAS,EAAE,CAAC,CAAC;QACxB,SAAS,EAAE,KAAK;QAChB,KAAK,EAAE,IAAI,GAAG,EAAE;QAChB,KAAK,EAAE,CAAC,CAAC;QACT,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,KAAK;QACd,SAAS,EAAE,CAAC,CAAC;QACb,OAAO,EAAE,EAAE;QACX,MAAM,EAAE,KAAK;KACd,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACtE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;IACD,wEAAwE;IACxE,MAAM,OAAO,GAAG,CAAC,IAAU,EAAE,CAAS,EAAE,OAAgB,EAAQ,EAAE;QAChE,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAC3B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,MAAM,CAAC;YACZ,KAAK,KAAK,CAAC;YACX,KAAK,UAAU,CAAC;YAChB,KAAK,SAAS,CAAC;YACf,KAAK,QAAQ;gBACX,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACnB,MAAM;YACR,KAAK,QAAQ,CAAC;YACd,KAAK,QAAQ,CAAC;YACd,KAAK,OAAO,EAAE,CAAC;gBACb,MAAM,UAAU,GACd,CAAC,CAAC,IAAI,KAAK,OAAO;oBAChB,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;oBACvB,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;gBACxF,IAAI,UAAU;oBACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC;gBAC/E,MAAM;YACR,CAAC;YACD,KAAK,KAAK;gBACR,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAC3B,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC7B,MAAM;YACR,KAAK,KAAK,CAAC;YACX,KAAK,OAAO;gBACV,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnE,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,MAAM;YAC1B,OAAO,CACL,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAE,EAClB,KAAK,CAAC,IAAI,EACV,WAAW,IAAI,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CACnE,CAAC;IACN,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,IAAI,EAAE;QAC9B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,EAAE,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC;IAE5E,wEAAwE;IACxE,sBAAsB;IACtB,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACpD,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,gBAAgB,GAAc,EAAE,CAAC;IACvC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC;YAAE,SAAS;QAC/B,MAAM,IAAI,GAA2C,EAAE,CAAC;QACxD,MAAM,KAAK,GAAG,CAAC,CAAO,EAAQ,EAAE;YAC9B,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,SAAS,EAAE,CAAC;YAC9B,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC,CAAC;QACF,KAAK,CAAC,KAAK,CAAC,CAAC;QACb,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;YACrC,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAE,CAAC;gBACjC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;oBAAE,KAAK,CAAC,CAAC,CAAC,CAAC;qBACrB,IAAI,CAAC,CAAC,OAAO;oBAAE,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,SAAS;YACX,CAAC;YACD,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YAClB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3C,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK;gBAAE,SAAS;YAChC,MAAM,EAAE,GAAG,gBAAgB,CAAC,MAAM,CAAC;YACnC,MAAM,OAAO,GAAW,EAAE,CAAC;YAC3B,IAAI,MAAY,CAAC;YACjB,GAAG,CAAC;gBACF,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACtB,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC;gBACvB,MAAM,CAAC,SAAS,GAAG,EAAE,CAAC;gBACtB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC,QAAQ,MAAM,KAAK,CAAC,EAAE;YACvB,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,IAAI,CAAC,CAAC,SAAS;oBAAE,OAAO,GAAG,IAAI,CAAC;gBAChC,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK;oBACzC,IAAI,OAAO,IAAI,UAAU,CAAC,SAAS,KAAK,EAAE;wBAAE,OAAO,GAAG,IAAI,CAAC;YAC/D,CAAC;YACD,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,oEAAoE;IACpE,KAAK,MAAM,CAAC,IAAI,GAAG;QAAE,KAAK,MAAM,UAAU,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE;YAAE,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzF,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,KAAK,MAAM,SAAS,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,OAAO,EAAE,CAAC;YAC5C,IAAI,SAAS,CAAC,MAAM;gBAAE,SAAS;YAC/B,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAChG,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACxF,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;AACxD,CAAC"}