@algomotion/spec 0.0.0-stage → 1.0.0-alpha.1

package/dist/kinds/tree.js

@@ -0,0 +1,380 @@
+/**
+ * The `tree` kind: rooted trees and forests. Nodes have ordered child
+ * slots; a slot may be empty (null), which binary trees use to tell a lone
+ * right child from a left one.
+ *
+ * Covers binary search trees (with rotations and red–black colours),
+ * n-ary trees, tries, recursion trees and union–find forests.
+ *
+ * Marks: `highlight` and `compare` last one step; `visit`, `settle`,
+ * `group`, `pointer`, `annotate`, `markEdge` and `labelEdge` persist.
+ *
+ * Protocol 0.5 (ADR 0034) adds root slots, pointers at empty child slots
+ * (NIL), named notes, edge marks and labels, and root lists.
+ */
+import { z } from 'zod';
+import { ElementId, Group, isElement, LIMITS, Place, PointerName, Scalar, } from "../common.js";
+import { typesOf } from "./kind.js";
+const Color = z.enum(['red', 'black']).describe('Red–black tree colour.');
+export const TreeNode = z
+    .strictObject({
+    id: ElementId,
+    value: Scalar,
+    children: z
+        .array(ElementId.nullable())
+        .max(LIMITS.elementsPerStructure)
+        .optional()
+        .describe('Child ids in order; null leaves a slot empty (e.g. no left child).'),
+    color: Color.optional(),
+})
+    .describe('A tree node.');
+const Nodes = z.array(TreeNode).max(LIMITS.elementsPerStructure);
+const RootList = z
+    .enum(['list', 'circular'])
+    .describe('Join the roots in order, as a Fibonacci heap’s root list; "circular" also joins the last root to the first.');
+/** Canonical declaration. */
+export const TreeDecl = z
+    .strictObject({
+    kind: z.literal('tree'),
+    label: z.string().max(LIMITS.textLength).optional(),
+    place: Place.optional(),
+    binary: z
+        .boolean()
+        .describe('Binary trees have exactly two child slots per node: 0 = left, 1 = right.'),
+    nodes: Nodes,
+    roots: z.array(ElementId).describe('Root ids, left to right.'),
+    rootList: RootList.optional(),
+})
+    .describe('A rooted tree or forest.');
+export const TreeDeclInput = z
+    .strictObject({
+    kind: z.literal('tree'),
+    label: z.string().max(LIMITS.textLength).optional(),
+    place: Place.optional(),
+    binary: z
+        .boolean()
+        .optional()
+        .describe('Default false, or true with `levelOrder`.'),
+    nodes: Nodes.optional(),
+    roots: z
+        .array(ElementId)
+        .optional()
+        .describe('Root ids; by default every node that is nobody’s child, in order.'),
+    rootList: RootList.optional(),
+    levelOrder: z
+        .array(Scalar)
+        .max(LIMITS.elementsPerStructure)
+        .optional()
+        .describe('Binary tree in level order as on LeetCode, null for missing nodes, e.g. [3, 9, 20, null, null, 15, 7]. Node ids are e0, e1, … in order. Use instead of `nodes`.'),
+})
+    .refine((d) => d.nodes === undefined || d.levelOrder === undefined, {
+    message: 'Give either `nodes` or `levelOrder`, not both',
+    path: ['levelOrder'],
+})
+    .superRefine((d, ctx) => {
+    if (d.levelOrder === undefined)
+        return;
+    const { consumed } = fromLevelOrder(d.levelOrder);
+    const orphan = d.levelOrder.findIndex((v, k) => k >= consumed && v !== null);
+    if (orphan >= 0)
+        ctx.addIssue({
+            code: 'custom',
+            path: ['levelOrder', orphan],
+            message: `Value ${JSON.stringify(d.levelOrder[orphan])} has no parent: every slot before it is taken or empty`,
+        });
+});
+/** Builds a binary tree from LeetCode-style level order. */
+function fromLevelOrder(values) {
+    const nodes = [];
+    const first = values[0];
+    if (values.length === 0 || first === null || first === undefined)
+        return { nodes, roots: [], consumed: Math.min(1, values.length) };
+    const queue = [];
+    const make = (value) => {
+        const node = {
+            id: `e${nodes.length}`,
+            value,
+            children: [null, null],
+        };
+        nodes.push(node);
+        queue.push(node);
+        return node.id;
+    };
+    make(first);
+    let k = 1;
+    while (queue.length > 0 && k < values.length) {
+        const parent = queue.shift();
+        for (const slot of [0, 1]) {
+            if (k >= values.length)
+                break;
+            const value = values[k++];
+            if (value !== null)
+                parent.children[slot] = make(value);
+        }
+    }
+    return { nodes, roots: ['e0'], consumed: k };
+}
+function normalizeTreeDecl(input) {
+    const { levelOrder, nodes: given, roots: givenRoots, binary, ...rest } = input;
+    if (levelOrder !== undefined) {
+        const { nodes, roots } = fromLevelOrder(levelOrder);
+        return { ...rest, binary: true, nodes, roots };
+    }
+    const nodes = given ?? [];
+    const isBinary = binary ?? false;
+    const children = new Set(nodes.flatMap((n) => n.children ?? []).filter((c) => c !== null));
+    const roots = givenRoots ?? nodes.filter((n) => !children.has(n.id)).map((n) => n.id);
+    // Binary nodes get both slots; extra children are kept so that
+    // validation can report them.
+    const normalized = isBinary
+        ? nodes.map((n) => ({
+            ...n,
+            children: [
+                n.children?.[0] ?? null,
+                n.children?.[1] ?? null,
+                ...(n.children?.slice(2) ?? []),
+            ],
+        }))
+        : nodes;
+    return { ...rest, binary: isBinary, nodes: normalized, roots };
+}
+/** Rules a schema cannot express: references exist, one parent each, no cycles. */
+export function validateTreeDecl(decl) {
+    const issues = [];
+    const index = new Map(decl.nodes.map((n, k) => [n.id, k]));
+    const parent = new Map();
+    decl.nodes.forEach((node, k) => {
+        const children = node.children ?? [];
+        if (decl.binary && children.length > 2)
+            issues.push({
+                path: ['nodes', k, 'children'],
+                message: `Node "${node.id}" has more than two child slots in a binary tree`,
+            });
+        children.forEach((child, c) => {
+            if (child === null)
+                return;
+            const path = ['nodes', k, 'children', c];
+            if (!index.has(child))
+                issues.push({
+                    path,
+                    message: `Child "${child}" is not a node of this tree`,
+                });
+            else if (parent.has(child))
+                issues.push({
+                    path,
+                    message: `Node "${child}" has two parents ("${parent.get(child)}" and "${node.id}")`,
+                });
+            else
+                parent.set(child, node.id);
+        });
+    });
+    decl.roots.forEach((root, r) => {
+        if (decl.roots.indexOf(root) !== r)
+            issues.push({
+                path: ['roots', r],
+                message: `Root "${root}" is listed twice`,
+            });
+        else if (!index.has(root))
+            issues.push({
+                path: ['roots', r],
+                message: `Root "${root}" is not a node of this tree`,
+            });
+        else if (parent.has(root))
+            issues.push({
+                path: ['roots', r],
+                message: `Root "${root}" is also the child of "${parent.get(root)}"`,
+            });
+    });
+    // Every node must be reachable from a root exactly once (no cycles).
+    const seen = new Set();
+    const stack = [...decl.roots].filter((r) => index.has(r));
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        for (const child of decl.nodes[index.get(id)].children ?? [])
+            // Missing children are reported above.
+            if (child !== null && index.has(child))
+                stack.push(child);
+    }
+    decl.nodes.forEach((node, k) => {
+        if (!seen.has(node.id))
+            issues.push({
+                path: ['nodes', k],
+                message: `Node "${node.id}" is not reachable from a root (it is in a cycle or its root is missing)`,
+                hint: 'List every root in `roots`, or omit `roots` to use all parentless nodes.',
+            });
+    });
+    return issues;
+}
+const NodeRef = ElementId.describe('A node id.');
+const Slot = z.int().min(0).max(LIMITS.elementsPerStructure);
+const SlotInput = z
+    .union([Slot, z.enum(['left', 'right'])])
+    .describe('A child position; binary trees also accept "left" (0) and "right" (1).');
+const RootSlot = Slot.describe('A position among the roots, from 0.');
+/** An empty child slot of a binary tree: the NIL leaf there. */
+const nilSlot = (slotType) => z
+    .strictObject({ parent: NodeRef, slot: slotType })
+    .describe('The empty child slot `slot` of `parent`: the NIL leaf there.');
+/** A named note's field, such as `size`, `max`, `deg` or `mark`. */
+export const NoteField = z
+    .string()
+    .max(16)
+    .regex(/^[a-z][a-z0-9-]*$/, 'Use lower-case letters, digits and hyphens, starting with a letter')
+    .describe('The field a note shows, e.g. "size"; a node holds one note per field.');
+const EdgeLabel = z
+    .union([z.string().max(16), z.number()])
+    .describe('A short label beside the edge, e.g. a code bit "0".');
+const actions = (newNode, slotType) => {
+    const slot = { slot: slotType.optional() };
+    return z.discriminatedUnion('type', [
+        z
+            .strictObject({
+            type: z.literal('addNode'),
+            node: newNode,
+            parent: NodeRef.nullable(),
+            ...slot,
+        })
+            .describe('Add a node under `parent`. Binary trees: `slot` is "left" or "right" (default the first empty one) and must be empty. Other trees: inserts at `slot`, default appends. With `parent: null` the node is a new root, at position `slot` among the roots (default last).'),
+        z
+            .strictObject({ type: z.literal('removeNode'), node: NodeRef })
+            .describe('Remove a node together with its subtree.'),
+        z
+            .strictObject({
+            type: z.literal('setChild'),
+            parent: NodeRef,
+            child: NodeRef.nullable(),
+            ...slot,
+        })
+            .describe('Move `child` (with its subtree) under `parent`, detaching it from where it was. Binary trees: `slot` is required and any child already there becomes a separate root. Other trees: inserts at `slot`, default appends. With `child: null`, removes the child at `slot` from `parent`; it becomes a separate root.'),
+        z
+            .strictObject({
+            type: z.literal('detach'),
+            node: NodeRef,
+            slot: RootSlot.optional(),
+        })
+            .describe('Detach a subtree from its parent so it becomes a separate root, at position `slot` among the roots (default last). A root with a `slot` moves there.'),
+        z
+            .strictObject({
+            type: z.literal('rotate'),
+            node: NodeRef,
+            direction: z.enum(['left', 'right']),
+        })
+            .describe('Binary trees: rotate around `node` (left rotation lifts its right child).'),
+        z
+            .strictObject({
+            type: z.literal('setValue'),
+            node: NodeRef,
+            value: Scalar,
+        })
+            .describe('Change a value.'),
+        z
+            .strictObject({ type: z.literal('swapValues'), a: NodeRef, b: NodeRef })
+            .describe('Exchange the values of two nodes (as in heapify on a tree).'),
+        z
+            .strictObject({
+            type: z.literal('setColor'),
+            node: NodeRef,
+            color: Color.nullable(),
+        })
+            .describe('Set a red–black colour; null removes it.'),
+        z
+            .strictObject({
+            type: z.literal('highlight'),
+            nodes: z.array(NodeRef).min(1).max(LIMITS.elementsPerStructure),
+        })
+            .describe('Highlight nodes (this step only).'),
+        z
+            .strictObject({ type: z.literal('compare'), a: NodeRef, b: NodeRef })
+            .describe('Mark two nodes as being compared (this step only).'),
+        z
+            .strictObject({ type: z.literal('visit'), node: NodeRef })
+            .describe('Mark a node as visited (persists).'),
+        z
+            .strictObject({ type: z.literal('settle'), node: NodeRef })
+            .describe('Mark a node as final or found (persists).'),
+        z
+            .strictObject({ type: z.literal('group'), node: NodeRef, group: Group })
+            .describe('Put a node in a categorical group 0–5; null removes it.'),
+        z
+            .strictObject({
+            type: z.literal('pointer'),
+            name: PointerName,
+            node: z.union([NodeRef, nilSlot(slotType)]).nullable(),
+        })
+            .describe('Point a named pointer (e.g. "curr") at a node, or at an empty child slot `{ "parent", "slot" }` of a binary tree (NIL); null removes it.'),
+        z
+            .strictObject({
+            type: z.literal('annotate'),
+            node: NodeRef,
+            text: z.string().max(32).nullable(),
+            field: NoteField.optional(),
+        })
+            .describe('Show a short note beside a node, e.g. its height or balance factor; null removes it. With `field`, the note is one of several the node shows, e.g. "size" and "max".'),
+        z
+            .strictObject({
+            type: z.literal('markEdge'),
+            node: NodeRef,
+            mark: z.enum(['selected', 'rejected']).nullable(),
+        })
+            .describe('Mark the edge from `node`’s parent to `node`: selected (e.g. a search path) or rejected; null clears it. Persists while the edge does.'),
+        z
+            .strictObject({
+            type: z.literal('labelEdge'),
+            node: NodeRef,
+            label: EdgeLabel.nullable(),
+        })
+            .describe('Label the edge from `node`’s parent to `node`, e.g. "0" or "1" in a Huffman tree; null removes it. Persists while the edge does.'),
+    ]);
+};
+const NewNode = z.strictObject({
+    id: ElementId,
+    value: Scalar,
+    color: Color.optional(),
+});
+const NewNodeInput = z
+    .union([NewNode, Scalar])
+    .describe('`{ "id", "value", "color"? }`, or a bare value to get a generated id.');
+export const TreeAction = actions(NewNode, Slot);
+export const TreeActionInput = actions(NewNodeInput, SlotInput);
+const slotNumber = (slot) => (slot === 'left' ? 0 : 1);
+export const treeSpec = {
+    kind: 'tree',
+    decl: TreeDecl,
+    declInput: TreeDeclInput,
+    action: TreeAction,
+    actionInput: TreeActionInput,
+    actionTypes: typesOf(TreeAction),
+    normalizeDecl: normalizeTreeDecl,
+    declIds: (decl) => decl.nodes.map((n, k) => ({ id: n.id, path: ['nodes', k, 'id'] })),
+    validateDecl: validateTreeDecl,
+    normalizeAction: (input, ctx) => {
+        let action = { ...input };
+        // A root's slot is a position among the roots, so "left" and "right"
+        // stay as written there, and the canonical schema refuses them.
+        if ('slot' in input &&
+            typeof input.slot === 'string' &&
+            !(input.type === 'addNode' && input.parent === null))
+            action = { ...action, slot: slotNumber(input.slot) };
+        if (input.type === 'pointer' &&
+            typeof input.node === 'object' &&
+            input.node !== null &&
+            typeof input.node.slot === 'string')
+            action = {
+                ...action,
+                node: { ...input.node, slot: slotNumber(input.node.slot) },
+            };
+        if (input.type === 'addNode' && !isElement(input.node))
+            action = {
+                ...action,
+                node: { id: ctx.allocateId('e'), value: input.node },
+            };
+        return action;
+    },
+    introducedIds: (action) => action.type === 'addNode'
+        ? [{ id: action.node.id, path: ['node', 'id'] }]
+        : [],
+};
+//# sourceMappingURL=tree.js.map

package/dist/kinds/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../src/kinds/tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EACL,SAAS,EACT,KAAK,EACL,SAAS,EACT,MAAM,EACN,KAAK,EACL,WAAW,EACX,MAAM,GACP,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAA6C,MAAM,WAAW,CAAC;AAE/E,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,wBAAwB,CAAC,CAAC;AAE1E,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC;KACtB,YAAY,CAAC;IACZ,EAAE,EAAE,SAAS;IACb,KAAK,EAAE,MAAM;IACb,QAAQ,EAAE,CAAC;SACR,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;SAC3B,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC;SAChC,QAAQ,EAAE;SACV,QAAQ,CACP,oEAAoE,CACrE;IACH,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;CACxB,CAAC;KACD,QAAQ,CAAC,cAAc,CAAC,CAAC;AAG5B,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;AAEjE,MAAM,QAAQ,GAAG,CAAC;KACf,IAAI,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;KAC1B,QAAQ,CACP,6GAA6G,CAC9G,CAAC;AAEJ,6BAA6B;AAC7B,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC;KACtB,YAAY,CAAC;IACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IACvB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE;IACnD,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,MAAM,EAAE,CAAC;SACN,OAAO,EAAE;SACT,QAAQ,CACP,0EAA0E,CAC3E;IACH,KAAK,EAAE,KAAK;IACZ,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,0BAA0B,CAAC;IAC9D,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;CAC9B,CAAC;KACD,QAAQ,CAAC,0BAA0B,CAAC,CAAC;AAGxC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC;KAC3B,YAAY,CAAC;IACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IACvB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE;IACnD,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,MAAM,EAAE,CAAC;SACN,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CAAC,2CAA2C,CAAC;IACxD,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,SAAS,CAAC;SAChB,QAAQ,EAAE;SACV,QAAQ,CACP,mEAAmE,CACpE;IACH,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;IAC7B,UAAU,EAAE,CAAC;SACV,KAAK,CAAC,MAAM,CAAC;SACb,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC;SAChC,QAAQ,EAAE;SACV,QAAQ,CACP,iKAAiK,CAClK;CACJ,CAAC;KACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,KAAK,SAAS,EAAE;IAClE,OAAO,EAAE,+CAA+C;IACxD,IAAI,EAAE,CAAC,YAAY,CAAC;CACrB,CAAC;KACD,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;IACtB,IAAI,CAAC,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO;IACvC,MAAM,EAAE,QAAQ,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,SAAS,CACnC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,QAAQ,IAAI,CAAC,KAAK,IAAI,CACtC,CAAC;IACF,IAAI,MAAM,IAAI,CAAC;QACb,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,YAAY,EAAE,MAAM,CAAC;YAC5B,OAAO,EAAE,SAAS,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,wDAAwD;SAC/G,CAAC,CAAC;AACP,CAAC,CAAC,CAAC;AAGL,4DAA4D;AAC5D,SAAS,cAAc,CAAC,MAAyC;IAM/D,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAC9D,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;IACpE,MAAM,KAAK,GAAkD,EAAE,CAAC;IAChE,MAAM,IAAI,GAAG,CAAC,KAA6B,EAAE,EAAE;QAC7C,MAAM,IAAI,GAAG;YACX,EAAE,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE;YACtB,KAAK;YACL,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,CAAsB;SAC5C,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,CAAC,KAAK,CAAC,CAAC;IACZ,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM;gBAAE,MAAM;YAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,CAAE,CAAC;YAC3B,IAAI,KAAK,KAAK,IAAI;gBAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;AAC/C,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAoB;IAC7C,MAAM,EACJ,UAAU,EACV,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,UAAU,EACjB,MAAM,EACN,GAAG,IAAI,EACR,GAAG,KAAK,CAAC;IACV,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IACjD,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,IAAI,EAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,MAAM,IAAI,KAAK,CAAC;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CACjE,CAAC;IACF,MAAM,KAAK,GACT,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1E,+DAA+D;IAC/D,8BAA8B;IAC9B,MAAM,UAAU,GAAG,QAAQ;QACzB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAChB,GAAG,CAAC;YACJ,QAAQ,EAAE;gBACR,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI;gBACvB,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI;gBACvB,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aAChC;SACF,CAAC,CAAC;QACL,CAAC,CAAC,KAAK,CAAC;IACV,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AACjE,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,gBAAgB,CAAC,IAAc;IAC7C,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC;gBAC9B,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,kDAAkD;aAC5E,CAAC,CAAC;QACL,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,KAAK,KAAK,IAAI;gBAAE,OAAO;YAC3B,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI;oBACJ,OAAO,EAAE,UAAU,KAAK,8BAA8B;iBACvD,CAAC,CAAC;iBACA,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;gBACxB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI;oBACJ,OAAO,EAAE,SAAS,KAAK,uBAAuB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,EAAE,IAAI;iBACrF,CAAC,CAAC;;gBACA,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;gBAClB,OAAO,EAAE,SAAS,IAAI,mBAAmB;aAC1C,CAAC,CAAC;aACA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;gBAClB,OAAO,EAAE,SAAS,IAAI,8BAA8B;aACrD,CAAC,CAAC;aACA,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;gBAClB,OAAO,EAAE,SAAS,IAAI,2BAA2B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG;aACrE,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IACH,qEAAqE;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAE,CAAC,QAAQ,IAAI,EAAE;YAC5D,uCAAuC;YACvC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;gBAClB,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,0EAA0E;gBACnG,IAAI,EAAE,0EAA0E;aACjF,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;AACjD,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;AAC7D,MAAM,SAAS,GAAG,CAAC;KAChB,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;KACxC,QAAQ,CACP,wEAAwE,CACzE,CAAC;AACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,qCAAqC,CAAC,CAAC;AAEtE,gEAAgE;AAChE,MAAM,OAAO,GAAG,CAAsB,QAAW,EAAE,EAAE,CACnD,CAAC;KACE,YAAY,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;KACjD,QAAQ,CAAC,8DAA8D,CAAC,CAAC;AAE9E,oEAAoE;AACpE,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC;KACvB,MAAM,EAAE;KACR,GAAG,CAAC,EAAE,CAAC;KACP,KAAK,CACJ,mBAAmB,EACnB,oEAAoE,CACrE;KACA,QAAQ,CACP,uEAAuE,CACxE,CAAC;AAEJ,MAAM,SAAS,GAAG,CAAC;KAChB,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;KACvC,QAAQ,CAAC,qDAAqD,CAAC,CAAC;AAEnE,MAAM,OAAO,GAAG,CACd,OAAU,EACV,QAAW,EACX,EAAE;IACF,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC;IAC3C,OAAO,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;QAClC,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;YAC1B,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,OAAO,CAAC,QAAQ,EAAE;YAC1B,GAAG,IAAI;SACR,CAAC;aACD,QAAQ,CACP,uQAAuQ,CACxQ;QACH,CAAC;aACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;aAC9D,QAAQ,CAAC,0CAA0C,CAAC;QACvD,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;YAC3B,MAAM,EAAE,OAAO;YACf,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE;YACzB,GAAG,IAAI;SACR,CAAC;aACD,QAAQ,CACP,mTAAmT,CACpT;QACH,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;YACzB,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,QAAQ,CAAC,QAAQ,EAAE;SAC1B,CAAC;aACD,QAAQ,CACP,sJAAsJ,CACvJ;QACH,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;YACzB,IAAI,EAAE,OAAO;YACb,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;SACrC,CAAC;aACD,QAAQ,CACP,2EAA2E,CAC5E;QACH,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;YAC3B,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,MAAM;SACd,CAAC;aACD,QAAQ,CAAC,iBAAiB,CAAC;QAC9B,CAAC;aACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;aACvE,QAAQ,CAAC,6DAA6D,CAAC;QAC1E,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;YAC3B,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;SACxB,CAAC;aACD,QAAQ,CAAC,0CAA0C,CAAC;QACvD,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;YAC5B,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC;SAChE,CAAC;aACD,QAAQ,CAAC,mCAAmC,CAAC;QAChD,CAAC;aACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;aACpE,QAAQ,CAAC,oDAAoD,CAAC;QACjE,CAAC;aACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;aACzD,QAAQ,CAAC,oCAAoC,CAAC;QACjD,CAAC;aACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;aAC1D,QAAQ,CAAC,2CAA2C,CAAC;QACxD,CAAC;aACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;aACvE,QAAQ,CAAC,yDAAyD,CAAC;QACtE,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;YAC1B,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;SACvD,CAAC;aACD,QAAQ,CACP,0IAA0I,CAC3I;QACH,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;YAC3B,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE;YACnC,KAAK,EAAE,SAAS,CAAC,QAAQ,EAAE;SAC5B,CAAC;aACD,QAAQ,CACP,sKAAsK,CACvK;QACH,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;YAC3B,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,EAAE;SAClD,CAAC;aACD,QAAQ,CACP,wIAAwI,CACzI;QACH,CAAC;aACE,YAAY,CAAC;YACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;YAC5B,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,SAAS,CAAC,QAAQ,EAAE;SAC5B,CAAC;aACD,QAAQ,CACP,kIAAkI,CACnI;KACJ,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,OAAO,GAAG,CAAC,CAAC,YAAY,CAAC;IAC7B,EAAE,EAAE,SAAS;IACb,KAAK,EAAE,MAAM;IACb,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;CACxB,CAAC,CAAC;AACH,MAAM,YAAY,GAAG,CAAC;KACnB,KAAK,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;KACxB,QAAQ,CACP,uEAAuE,CACxE,CAAC;AAEJ,MAAM,CAAC,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AAEjD,MAAM,CAAC,MAAM,eAAe,GAAG,OAAO,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;AAGhE,MAAM,UAAU,GAAG,CAAC,IAAsB,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEzE,MAAM,CAAC,MAAM,QAAQ,GAKhB;IACH,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,QAAQ;IACd,SAAS,EAAE,aAAa;IACxB,MAAM,EAAE,UAAU;IAClB,WAAW,EAAE,eAAe;IAC5B,WAAW,EAAE,OAAO,CAAC,UAAU,CAAC;IAChC,aAAa,EAAE,iBAAiB;IAChC,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAS,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3E,YAAY,EAAE,gBAAgB;IAC9B,eAAe,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QAC9B,IAAI,MAAM,GAA4B,EAAE,GAAG,KAAK,EAAE,CAAC;QACnD,qEAAqE;QACrE,gEAAgE;QAChE,IACE,MAAM,IAAI,KAAK;YACf,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;YAC9B,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC;YAEpD,MAAM,GAAG,EAAE,GAAG,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACvD,IACE,KAAK,CAAC,IAAI,KAAK,SAAS;YACxB,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;YAC9B,KAAK,CAAC,IAAI,KAAK,IAAI;YACnB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;YAEnC,MAAM,GAAG;gBACP,GAAG,MAAM;gBACT,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aAC3D,CAAC;QACJ,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;YACpD,MAAM,GAAG;gBACP,GAAG,MAAM;gBACT,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE;aACrD,CAAC;QACJ,OAAO,MAAoB,CAAC;IAC9B,CAAC;IACD,aAAa,EAAE,CAAC,MAAM,EAAE,EAAE,CACxB,MAAM,CAAC,IAAI,KAAK,SAAS;QACvB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QAChD,CAAC,CAAC,EAAE;CACT,CAAC"}

package/dist/parse.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Parsing pipeline: untrusted input → canonical `Visualization`.
+ *
+ * 1. Reject versions this package cannot read with a dedicated error
+ *    (ADR 0021).
+ * 2. Check the document's shape (actions only by `target` and `type`).
+ * 3. Expand shorthands in structure declarations.
+ * 4. Validate each action against the schema of its target's kind, expand
+ *    its shorthands, and check that ids it introduces are new.
+ * 5. Check that steps point into the source code: `meta.line` into
+ *    `source`, or `meta.at` at an anchor of every entry of `sources`
+ *    (ADR 0017).
+ * 6. Check sections against the steps (ADR 0020), and that `version` holds
+ *    every feature the document uses (ADR 0021).
+ *
+ * Every kind-specific step goes through the kind registry (ADR 0012).
+ *
+ * Only static validity is checked here. Whether an action is valid at its
+ * point in the timeline (e.g. an index within the current length) depends
+ * on state and is checked by the core reducer.
+ */
+import { type ProtocolError } from './errors.ts';
+import { type Result } from './result.ts';
+import { type Visualization } from './visualization.ts';
+export declare function parseVisualization(input: unknown): Result<Visualization, readonly ProtocolError[]>;
+//# sourceMappingURL=parse.d.ts.map

package/dist/parse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse.d.ts","sourceRoot":"","sources":["../src/parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,OAAO,EAGL,KAAK,aAAa,EAEnB,MAAM,aAAa,CAAC;AAUrB,OAAO,EAAW,KAAK,MAAM,EAAE,MAAM,aAAa,CAAC;AASnD,OAAO,EAKL,KAAK,aAAa,EACnB,MAAM,oBAAoB,CAAC;AAE5B,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,OAAO,GACb,MAAM,CAAC,aAAa,EAAE,SAAS,aAAa,EAAE,CAAC,CAIjD"}