@contraagent/ui 0.0.0-stage → 0.1.0

package/dist/elements/overview/logic.d.ts

@@ -0,0 +1,442 @@
+import { type JournalRow, type Plan, type PlanGroup, type PlanNode, type TaskState } from '@contraagent/api';
+/** The state a mark of several tasks shows: the most severe of them. */
+export declare const worstState: (nodes: readonly PlanNode[]) => TaskState;
+/** A layer segment that enters a loop box: `loop:<line>`, `loop:<outer>.<inner>` for a nested one. */
+export declare const LOOP_SEGMENT = "loop:";
+/** One mark of a node: a unit's tasks (a kind node), or a unit's flow calls (a function node). */
+export interface GraphMark {
+    /** The task it opens (the running one, else the last), or the flow call it stands for. */
+    key: string;
+    unit: string;
+    state: TaskState;
+    /** The tasks it stands for. */
+    count: number;
+    keys: string[];
+    /** A function node's mark: the function (`module.qualname`) it enters. */
+    flow?: string;
+    /** In a loop box: the passes its unit's tasks (or flow calls) of this node ran in, when more than 1. */
+    passes?: number;
+    /** A function node's mark: its tasks by state (those of the flow calls it started included). */
+    counts?: NodeCounts;
+    /** A function node's mark whose flow call raised or was closed: what it raised (`<type>: <message>`), '' when not recorded. */
+    error?: string;
+}
+export type NodeCounts = Pick<PlanGroup, 'total' | 'done' | 'failed' | 'running' | 'pending' | 'skipped' | 'blocked'>;
+export interface GraphNode {
+    id: string;
+    /** `kind`: tasks created in the layer's own function; `flow`: tasks created in a function it called. */
+    type: 'kind' | 'flow';
+    /** The plan group's id, or the function's `module.qualname`. */
+    name: string;
+    label: string;
+    /** The kinds of its tasks. */
+    kinds: string[];
+    /** A kind node: who runs its tasks (`mixed` when its kinds differ); null for a function node. */
+    executor: 'agent' | 'python' | 'mixed' | null;
+    /** The loop box it is drawn in (its innermost), or null. */
+    box: string | null;
+    /** One slot per unit of the layer, in the layer's unit order: null where the unit has no mark here. Empty for a node without units. */
+    units: (GraphMark | null)[];
+    /** Its marks without a unit. */
+    single: GraphMark[];
+    /** Its tasks also wait for each other. */
+    inOrder: boolean;
+    /** Its tasks by state (in a function node, those of the flow calls they started included); in a loop box, each unit's latest pass. */
+    counts: NodeCounts;
+    /** A function node: its flow calls (in a loop box, each unit's latest pass); 0 for a kind node. */
+    calls: number;
+    /** A function node: those of its flow calls that raised or were closed. */
+    errors: number;
+}
+/** The nodes created by one loop of the layer's function; a nested loop is a box inside it. */
+export interface LoopBox {
+    /** `loop:<line>`, `loop:<outer>.<inner>` for a nested loop. */
+    id: string;
+    /** The loop's first line. */
+    loop: number;
+    /** The file the loop is in (the layer's function's file, as recorded); '' when not known. */
+    file: string;
+    /** The loop box this one is nested in, or null when it is at the layer's top level. */
+    parent: string | null;
+    /** Its last pass: the most passes of this loop (never a nested loop's) in one run of it. */
+    passes: number;
+    /** How many units ran each number of passes of it, fewest first: `[[1, 4], [2, 1]]`. */
+    spread: [passes: number, units: number][];
+    /** Its items (node ids and nested loop box ids) by layer, each layer in drawing order. */
+    layers: string[][];
+}
+export interface GraphEdge {
+    from: string;
+    to: string;
+    /** Tasks of `to` joined to a task of `from`. */
+    tasks: number;
+    /** `after`: waits for its output; `created`: created after its result (and does not wait for its output). */
+    type: 'after' | 'created';
+    /** It goes back to a loop's next pass (or otherwise closes a cycle): the loop box stands for it, it is not drawn. */
+    back: boolean;
+}
+/** An edge from a task outside the layer, named by the node it is in at the nearest layer that holds both. */
+export interface GraphStub {
+    id: string;
+    label: string;
+    to: string;
+    tasks: number;
+    type: 'after' | 'created';
+}
+/** One place an edge passes: a slot (`id`) of a container (`in`: '' for the layer's top level, else a loop box id). */
+export interface RouteStep {
+    id: string;
+    in: string;
+}
+/**
+ * A drawn edge (or a stub's), as the slots it passes from its source to its target:
+ * a point (`~...`) on every layer it crosses, and a loop box's id where it leaves or
+ * enters that box.
+ */
+export interface EdgeRoute {
+    from: string;
+    to: string;
+    type: 'after' | 'created';
+    steps: RouteStep[];
+}
+/** Where a layer's items are: what `layerGraph` keeps when it is given it back. */
+export interface LayerOrder {
+    /** The top level's layers: nodes, loop boxes and stubs. */
+    layers: string[][];
+    boxes: Record<string, string[][]>;
+}
+export interface LayerGraph {
+    /** The layer: function names, outermost first. */
+    path: string[];
+    /** Every node, in drawing order. */
+    nodes: GraphNode[];
+    /** Node and loop box ids by layer, each layer in drawing order. */
+    layers: string[][];
+    boxes: LoopBox[];
+    edges: GraphEdge[];
+    stubs: GraphStub[];
+    /** The units with a mark in this layer, in the order the run first scheduled them. */
+    units: string[];
+    /** Each container's slots by layer, in drawing order: '' for the top level, a loop box's id for its inside. */
+    slots: Record<string, string[][]>;
+    /** The drawn edges and the stubs' edges, with the slots they pass. */
+    routes: EdgeRoute[];
+    order: LayerOrder;
+}
+/** A function's name without its module. */
+export declare const shortName: (fn: string) => string;
+/** The loop box ids for a loop chain, outermost first: `loop:7`, then `loop:7.9`, ... */
+export declare const boxChain: (loops: readonly number[]) => string[];
+/** True for a point where an edge crosses a layer. */
+export declare const isPoint: (id: string) => boolean;
+/**
+ * The layer `path` of the plan's flow. Pass the `order` of the last graph of this layer as
+ * `prev` to keep its nodes in place; `down` routes the edges for a drawing top to bottom
+ * (a box's label is then on the side its edges come in).
+ */
+export declare function layerGraph(plan: Plan, path?: readonly string[], prev?: LayerOrder, down?: boolean): LayerGraph;
+/**
+ * The layer the graph opens on: from the top, down while a layer has a single
+ * node and it is a function's. It stops at a single function node whose flow call
+ * raised or was closed, so a run that failed inside a flow opens on the node that
+ * shows it, not inside it. A failed or not started task does not stop it: the layer
+ * below shows that task's own mark. A static flow lands on its kinds.
+ */
+export declare function autoLayer(plan: Plan): string[];
+/** A layer's segments: its path, and the loop box entered at its end (null when none). */
+export declare function splitLayer(segments: readonly string[]): {
+    path: string[];
+    loop: string | null;
+};
+/**
+ * The layer `segments` names, as the plan has it: the segments themselves when the
+ * plan has that layer (a prefix of a task's flow path, and the loop box after it);
+ * else, when the last function is named by its `module.qualname` (or, failing that,
+ * its name) and the plan reaches it by one flow path only, that flow path, with the
+ * loop box when the layer there has it. Null when the plan has no such layer.
+ */
+export declare function resolveLayer(plan: Plan, segments: readonly string[]): string[] | null;
+/** One level up from `segments`: null at the top (the layer the graph opens on, `auto`), [] for that layer. */
+export declare function parentLayer(segments: readonly string[], auto: readonly string[]): string[] | null;
+/** A column of a loop's passes: one node, in one pass of each loop from the unrolled box down to the node's own box. */
+export interface MatrixColumn {
+    node: GraphNode;
+    /** The passes, the unrolled box's loop first. */
+    passes: number[];
+}
+/** A header cell over the columns: a pass of a loop, a nested loop, or a node. */
+export type MatrixHead = {
+    type: 'pass';
+    box: LoopBox;
+    pass: number;
+    span: number;
+    rows: number;
+} | {
+    type: 'loop';
+    box: LoopBox;
+    span: number;
+    rows: number;
+} | {
+    type: 'node';
+    node: GraphNode;
+    passes: number[];
+    span: number;
+    rows: number;
+};
+export interface MatrixRow {
+    /** The unit, or '' for the tasks without one. */
+    unit: string;
+    /** How many passes of the unrolled loop it ran (in every run of the loop). */
+    passes: number;
+    /** The most severe state of its marks. */
+    state: TaskState;
+    /** One per column: its mark, or null where it has none. */
+    cells: (GraphMark | null)[];
+}
+/** A loop box with its passes unrolled: a row per unit, a column per (node, pass), nested loops as nested column groups. */
+export interface PassMatrix {
+    box: LoopBox;
+    columns: MatrixColumn[];
+    /** The header rows, outermost first; a node's cell spans down to the last. */
+    head: MatrixHead[][];
+    /** The units that have a task in the box, in the layer's order; the tasks without a unit last. */
+    rows: MatrixRow[];
+}
+/**
+ * The loop box `box` of layer `path` with its passes unrolled; null when the layer has
+ * no such box. Each task is in the column of its node and of its passes of the box's
+ * loop and of every loop nested in it, so an inner loop's passes are counted within
+ * each pass of the outer one. A column no task reached is left out.
+ */
+export declare function passMatrix(plan: Plan, path: readonly string[], box: string, prev?: LayerOrder): PassMatrix | null;
+/** How a loop's units are sorted: as scheduled, most passes first, or the most severe state first. */
+export type MatrixSort = 'order' | 'passes' | 'state';
+/** `rows` sorted by `by`; a tie keeps the scheduled order. */
+export declare function sortRows(rows: readonly MatrixRow[], by: MatrixSort): MatrixRow[];
+/**
+ * Where a key moves in a grid of marks (`has[r][c]`: a mark there), from (`r`, `c`):
+ * left and right to the next mark in the row, up and down to the nearest row with a
+ * mark in the column, Home and End to the row's first and last, with Ctrl to the
+ * first and last row's, PageUp and PageDown `page` rows. Null when it does not move.
+ */
+export declare function gridStep(has: readonly (readonly boolean[])[], r: number, c: number, key: string, ctrl?: boolean, page?: number): [number, number] | null;
+/**
+ * A mark's selection id: its node, the passes of its column in a loop's passes
+ * (`|1.2`), and its unit, or its key for a mark without one (`kind:review@7#gamma`).
+ */
+export declare const markSel: (node: string, m: Pick<GraphMark, "unit" | "key">, passes?: readonly number[]) => string;
+/** What a selection id names: a mark (with its node, and its column's passes in a loop's passes), a node or a loop box. */
+export type Selected = {
+    type: 'mark';
+    id: string;
+    node: GraphNode;
+    mark: GraphMark;
+    passes: number[];
+} | {
+    type: 'node';
+    id: string;
+    node: GraphNode;
+} | {
+    type: 'box';
+    id: string;
+    box: LoopBox;
+};
+/**
+ * What `sel` names in a layer's graph, or, with `matrix`, in a loop's passes (a mark
+ * there names its column's passes); null when it names nothing there.
+ */
+export declare function selected(g: LayerGraph, matrix: PassMatrix | null, sel: string): Selected | null;
+/** The tasks of a layer's nodes by state, added up. */
+export declare function layerCounts(nodes: readonly Pick<GraphNode, 'counts'>[]): NodeCounts;
+/** How a node lays out its unit marks: as many columns as units up to 12, then 10, then 20; smaller marks as they grow. */
+export declare function markGrid(units: number): {
+    cols: number;
+    size: number;
+};
+/** Above this many marks, a node shows a bar of its counts and lists its failed marks. */
+export declare const BAR_MARKS = 200;
+/** A node shows its marks as a bar of counts. */
+export declare const asBar: (n: Pick<GraphNode, "units" | "single">) => boolean;
+/** A node's bar: each state's share of its marks, in `order`, the states it has only. */
+export declare function barParts(c: NodeCounts, order: readonly TaskState[]): {
+    state: TaskState;
+    n: number;
+    pct: number;
+}[];
+/**
+ * The node joined to `from` along a drawn edge: a later one (`later`, that waits for
+ * it or was created after it) or an earlier one; of several, the one nearest across
+ * the flow (`across`), then the first in drawing order. Null when there is none.
+ */
+export declare function alongEdge(g: LayerGraph, from: string, dir: 'later' | 'earlier', across: (id: string) => number): string | null;
+export interface Size {
+    w: number;
+    h: number;
+}
+/** A rectangle in the drawing. */
+export interface Rect {
+    x: number;
+    y: number;
+    w: number;
+    h: number;
+}
+/** A straight stretch of an edge along the flow, from `a` to `b`, `at` across it; an edge bends between two. */
+export interface Run {
+    a: number;
+    b: number;
+    at: number;
+}
+export interface GraphLayout {
+    /** The drawing's size, its margin included. */
+    w: number;
+    h: number;
+    /** Every node, stub and loop box, by id. */
+    at: Record<string, Rect>;
+    /** Every route, with its runs. */
+    edges: {
+        from: string;
+        to: string;
+        type: 'after' | 'created';
+        runs: Run[];
+    }[];
+    /** Each loop box's return to its next pass. */
+    returns: LoopReturn[];
+    down: boolean;
+}
+/**
+ * A loop box's return to its next pass, along the flow (`u`) and across it (`v`): from
+ * the far side of its last layer's outermost item (`from`, at `v0`) out to a band
+ * past its content (`band`), back along the band, and in to its first layer's
+ * outermost item (`to`, at `v1`). Left to right the band is under the nodes; top to
+ * bottom, on their right.
+ */
+export interface LoopReturn {
+    box: string;
+    from: number;
+    v0: number;
+    to: number;
+    v1: number;
+    band: number;
+}
+/** The spaces of a drawing; left to right unless `down`. */
+export interface LayoutSpace {
+    /** Between two layers, at the top level and in a loop box. */
+    gap: number;
+    boxGap: number;
+    /** Between two items of a layer, and next to a point an edge passes. */
+    sep: number;
+    pointSep: number;
+    /** A loop box's padding, and the space under its label. */
+    pad: number;
+    /** The space after a box's content, across the flow: the band its return to the next pass runs in. */
+    padEnd: number;
+    margin: number;
+}
+/** The band past a loop box's content that its return to the next pass runs in, and the return's corner radius. */
+export declare const RETURN_BAND = 24;
+export declare const SPACE: Record<'across' | 'down', LayoutSpace>;
+/**
+ * Where everything of a layer's graph is drawn, from the sizes of its nodes, its stubs
+ * and its loop boxes' labels (`lbl:<box id>`): left to right, or top to bottom when
+ * `down`. Each container is laid out inside out, a box being one item of its parent:
+ * its layers side by side, an item at the start of its layer; across the flow, each
+ * item as near as its order allows to the items it is joined to (sweeps of weighted
+ * isotonic regression), so chains run straight. An edge runs along its points and
+ * bends only in the gap between two layers; it enters and leaves a box where its
+ * point inside is, and never passes a node or a box's label.
+ */
+export declare function layoutGraph(g: LayerGraph, sizes: ReadonlyMap<string, Size>, down?: boolean): GraphLayout;
+/**
+ * A loop box's return as an SVG path: out from its last layer to the band, back along
+ * it with rounded corners, and in to its first layer, stopping `gap` short of each item.
+ */
+export declare function returnPath(r: LoopReturn, down?: boolean, gap?: number): string;
+/** An edge's line as an SVG path: its runs, joined by a curve in each gap where it bends. */
+export declare function edgePath(runs: readonly Run[], down?: boolean): string;
+/** A view of the graph: its scale and where its top left corner sits in the frame. */
+export interface View {
+    k: number;
+    x: number;
+    y: number;
+}
+/**
+ * The frame's height and the view that shows the whole graph: scaled down to fit the
+ * frame's width and at most `maxH` of height, never scaled up, and centred.
+ */
+export declare function fitView(graphW: number, graphH: number, frameW: number, maxH: number): View & {
+    h: number;
+};
+/** `v` scaled by `factor` about the point (`cx`, `cy`) of the frame, within `min` and `max`. */
+export declare function zoomView(v: View, factor: number, cx: number, cy: number, min: number, max: number): View;
+/**
+ * The run's figures, from the journal. Only tries that ran count: a task
+ * refused before launch (`invalid_input`) has a row but is not a try, not an
+ * agent session and not a failed attempt; tasks are counted by `deriveRun`.
+ */
+export interface Kpis {
+    /** Tries that ran. */
+    attempts: number;
+    python: number;
+    /** Agent sessions: tries an agent ran. */
+    launches: number;
+    /** Tries that ran and failed. */
+    bad: number;
+    launchWall: number;
+    pythonWall: number;
+    /** Tries after a task's first, and the tasks they belong to. */
+    retries: number;
+    retriedTasks: number;
+    /** The keys of the tasks that were retried / had fix-ups (to open one directly when it is the only one). */
+    retriedKeys: string[];
+    fixupKeys: string[];
+    /** Fix-ups (sessions resumed with check errors), and the tasks that had any. */
+    fixups: number;
+    fixupTasks: number;
+    /** Model switches after a rate limit, and the tasks that switched. */
+    switches: number;
+    switchTasks: number;
+}
+export declare function kpis(journal: readonly JournalRow[]): Kpis;
+/** Finished tasks older than this before the newest are left out. */
+export declare const TIMELINE_WINDOW_MS: number;
+/** Something running now, as the timeline draws it. */
+export interface LiveBar {
+    kind: string;
+    cls: 'llm' | 'py';
+    /** Epoch ms it started. */
+    t0: number;
+}
+export interface TimelineBar {
+    /** `py`, `llm`, `bad` (ran and failed), `idle` (a task that never started) for a finished row; `run` for a running one. */
+    cls: 'py' | 'llm' | 'bad' | 'idle' | 'run';
+    start: number;
+    end: number;
+    live: boolean;
+    /** Which of its lane's stacked tracks it is drawn on: overlapping bars (a retry beside its failed try) get their own. */
+    track: number;
+    row?: JournalRow;
+}
+export interface TimelineLane {
+    name: string;
+    /** Any of its bars is an agent launch. */
+    llm: boolean;
+    bars: TimelineBar[];
+    /** How many tracks its bars are stacked on (at least 1). */
+    tracks: number;
+}
+export interface Timeline {
+    t0: number;
+    span: number;
+    lanes: TimelineLane[];
+    /** Finished tasks left out of the window. */
+    hidden: number;
+    live: boolean;
+}
+/** Every finished task as a bar on its kind's lane, running ones growing to `now`. Null when there is nothing to draw. */
+export declare function timeline(journal: readonly JournalRow[], live: readonly LiveBar[], now: number): Timeline | null;
+/** A bar's left edge and width, in percent of the span; a live bar grows to `now`. */
+export declare function barBox(b: TimelineBar, tl: Pick<Timeline, 't0' | 'span'>, now: number): {
+    left: number;
+    width: number;
+};
+//# sourceMappingURL=logic.d.ts.map

package/dist/elements/overview/logic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logic.d.ts","sourceRoot":"","sources":["../../../src/elements/overview/logic.ts"],"names":[],"mappings":"AAEA,OAAO,EAAwB,KAAK,UAAU,EAAE,KAAK,IAAI,EAAE,KAAK,SAAS,EAAE,KAAK,QAAQ,EAAE,KAAK,SAAS,EAAE,MAAM,kBAAkB,CAAC;AA6BnI,wEAAwE;AACxE,eAAO,MAAM,UAAU,GAAI,OAAO,SAAS,QAAQ,EAAE,KAAG,SACoC,CAAC;AAI7F,sGAAsG;AACtG,eAAO,MAAM,YAAY,UAAU,CAAC;AAEpC,kGAAkG;AAClG,MAAM,WAAW,SAAS;IACxB,0FAA0F;IAC1F,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,SAAS,CAAC;IACjB,+BAA+B;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,0EAA0E;IAC1E,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,wGAAwG;IACxG,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,gGAAgG;IAChG,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,+HAA+H;IAC/H,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC,CAAC;AAEtH,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,wGAAwG;IACxG,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IACtB,gEAAgE;IAChE,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,8BAA8B;IAC9B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,iGAAiG;IACjG,QAAQ,EAAE,OAAO,GAAG,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC;IAC9C,4DAA4D;IAC5D,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IACnB,uIAAuI;IACvI,KAAK,EAAE,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC;IAC5B,gCAAgC;IAChC,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,0CAA0C;IAC1C,OAAO,EAAE,OAAO,CAAC;IACjB,sIAAsI;IACtI,MAAM,EAAE,UAAU,CAAC;IACnB,mGAAmG;IACnG,KAAK,EAAE,MAAM,CAAC;IACd,2EAA2E;IAC3E,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,+FAA+F;AAC/F,MAAM,WAAW,OAAO;IACtB,+DAA+D;IAC/D,EAAE,EAAE,MAAM,CAAC;IACX,6BAA6B;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,6FAA6F;IAC7F,IAAI,EAAE,MAAM,CAAC;IACb,uFAAuF;IACvF,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,4FAA4F;IAC5F,MAAM,EAAE,MAAM,CAAC;IACf,wFAAwF;IACxF,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;IAC1C,0FAA0F;IAC1F,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,gDAAgD;IAChD,KAAK,EAAE,MAAM,CAAC;IACd,6GAA6G;IAC7G,IAAI,EAAE,OAAO,GAAG,SAAS,CAAC;IAC1B,qHAAqH;IACrH,IAAI,EAAE,OAAO,CAAC;CACf;AAED,8GAA8G;AAC9G,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,OAAO,GAAG,SAAS,CAAC;CAC3B;AAED,uHAAuH;AACvH,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,OAAO,GAAG,SAAS,CAAC;IAC1B,KAAK,EAAE,SAAS,EAAE,CAAC;CACpB;AAED,mFAAmF;AACnF,MAAM,WAAW,UAAU;IACzB,2DAA2D;IAC3D,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;CACnC;AAED,MAAM,WAAW,UAAU;IACzB,kDAAkD;IAClD,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,oCAAoC;IACpC,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,mEAAmE;IACnE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,KAAK,EAAE,OAAO,EAAE,CAAC;IACjB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,sFAAsF;IACtF,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,+GAA+G;IAC/G,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAClC,sEAAsE;IACtE,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,KAAK,EAAE,UAAU,CAAC;CACnB;AA4FD,4CAA4C;AAC5C,eAAO,MAAM,SAAS,GAAI,IAAI,MAAM,KAAG,MAAiD,CAAC;AAiBzF,yFAAyF;AACzF,eAAO,MAAM,QAAQ,GAAI,OAAO,SAAS,MAAM,EAAE,KAAG,MAAM,EAA8E,CAAC;AA2OzI,sDAAsD;AACtD,eAAO,MAAM,OAAO,GAAI,IAAI,MAAM,KAAG,OAA6B,CAAC;AAuYnE;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAE,SAAS,MAAM,EAAO,EAAE,IAAI,CAAC,EAAE,UAAU,EAAE,IAAI,UAAQ,GAAG,UAAU,CAEhH;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,CA4B9C;AAED,0FAA0F;AAC1F,wBAAgB,UAAU,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG;IAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,CAG/F;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAgBrF;AAED,+GAA+G;AAC/G,wBAAgB,WAAW,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAIjG;AAID,wHAAwH;AACxH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,SAAS,CAAC;IAChB,iDAAiD;IACjD,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,kFAAkF;AAClF,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACxE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC1D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEpF,MAAM,WAAW,SAAS;IACxB,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;IACb,8EAA8E;IAC9E,MAAM,EAAE,MAAM,CAAC;IACf,0CAA0C;IAC1C,KAAK,EAAE,SAAS,CAAC;IACjB,2DAA2D;IAC3D,KAAK,EAAE,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC;CAC7B;AAED,4HAA4H;AAC5H,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,OAAO,CAAC;IACb,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,8EAA8E;IAC9E,IAAI,EAAE,UAAU,EAAE,EAAE,CAAC;IACrB,kGAAkG;IAClG,IAAI,EAAE,SAAS,EAAE,CAAC;CACnB;AAID;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,UAAU,GAAG,UAAU,GAAG,IAAI,CAqEjH;AAED,sGAAsG;AACtG,MAAM,MAAM,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEtD,8DAA8D;AAC9D,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,SAAS,EAAE,EAAE,EAAE,EAAE,UAAU,GAAG,SAAS,EAAE,CAIhF;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,SAAS,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,UAAQ,EAAE,IAAI,SAAK,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAiDlJ;AAID;;;GAGG;AACH,eAAO,MAAM,OAAO,GAAI,MAAM,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,MAAM,GAAG,KAAK,CAAC,EAAE,SAAQ,SAAS,MAAM,EAAO,KAAG,MAC/B,CAAC;AAE7E,2HAA2H;AAC3H,MAAM,MAAM,QAAQ,GAChB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GAC7C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,CAAC;AAE9C;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,GAAG,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,CAsB/F;AAED,uDAAuD;AACvD,wBAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,GAAG,UAAU,CAInF;AAID,2HAA2H;AAC3H,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAItE;AAED,0FAA0F;AAC1F,eAAO,MAAM,SAAS,MAAM,CAAC;AAE7B,iDAAiD;AACjD,eAAO,MAAM,KAAK,GAAI,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,GAAG,QAAQ,CAAC,KAAG,OAAiF,CAAC;AAEjJ,yFAAyF;AACzF,wBAAgB,QAAQ,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG;IAAE,KAAK,EAAE,SAAS,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,EAAE,CAEnH;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,GAAG,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,GAAG,MAAM,GAAG,IAAI,CAM9H;AAID,MAAM,WAAW,IAAI;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,kCAAkC;AAClC,MAAM,WAAW,IAAI;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,gHAAgH;AAChH,MAAM,WAAW,GAAG;IAClB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,WAAW;IAC1B,+CAA+C;IAC/C,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,4CAA4C;IAC5C,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACzB,kCAAkC;IAClC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,GAAG,SAAS,CAAC;QAAC,IAAI,EAAE,GAAG,EAAE,CAAA;KAAE,EAAE,CAAC;IAC9E,+CAA+C;IAC/C,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,IAAI,EAAE,OAAO,CAAC;CACf;AAED;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACd;AAED,4DAA4D;AAC5D,MAAM,WAAW,WAAW;IAC1B,8DAA8D;IAC9D,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,wEAAwE;IACxE,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,2DAA2D;IAC3D,GAAG,EAAE,MAAM,CAAC;IACZ,sGAAsG;IACtG,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,mHAAmH;AACnH,eAAO,MAAM,WAAW,KAAK,CAAC;AAG9B,eAAO,MAAM,KAAK,EAAE,MAAM,CAAC,QAAQ,GAAG,MAAM,EAAE,WAAW,CAGxD,CAAC;AAsBF;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,IAAI,UAAQ,GAAG,WAAW,CA4NtG;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,UAAQ,EAAE,GAAG,SAAI,GAAG,MAAM,CAYvE;AAED,6FAA6F;AAC7F,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,EAAE,EAAE,IAAI,UAAQ,GAAG,MAAM,CAkBnE;AAGD,sFAAsF;AACtF,MAAM,WAAW,IAAI;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG;IAAE,CAAC,EAAE,MAAM,CAAA;CAAE,CAM1G;AAED,gGAAgG;AAChG,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAIxG;AAID;;;;GAIG;AACH,MAAM,WAAW,IAAI;IACnB,sBAAsB;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,0CAA0C;IAC1C,QAAQ,EAAE,MAAM,CAAC;IACjB,iCAAiC;IACjC,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,gEAAgE;IAChE,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,4GAA4G;IAC5G,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,gFAAgF;IAChF,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,wBAAgB,IAAI,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,GAAG,IAAI,CA0BzD;AAID,qEAAqE;AACrE,eAAO,MAAM,kBAAkB,QAAa,CAAC;AAG7C,uDAAuD;AACvD,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,KAAK,GAAG,IAAI,CAAC;IAClB,2BAA2B;IAC3B,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,WAAW;IAC1B,2HAA2H;IAC3H,GAAG,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC;IAC3C,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,OAAO,CAAC;IACd,yHAAyH;IACzH,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,CAAC,EAAE,UAAU,CAAC;CAClB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,0CAA0C;IAC1C,GAAG,EAAE,OAAO,CAAC;IACb,IAAI,EAAE,WAAW,EAAE,CAAC;IACpB,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,6CAA6C;IAC7C,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,OAAO,CAAC;CACf;AAOD,0HAA0H;AAC1H,wBAAgB,QAAQ,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,EAAE,IAAI,EAAE,SAAS,OAAO,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,CA8B/G;AAED,sFAAsF;AACtF,wBAAgB,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAKtH"}