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

package/dist/kinds/btree.js

@@ -0,0 +1,274 @@
+/**
+ * The `btree` kind (ADR 0035): multiway search trees whose nodes hold
+ * several keys in order, such as B-trees and 2-3-4 trees. A node has no
+ * children (a leaf) or one more than its keys; child `i` hangs from the
+ * gap left of key `i`. Keys are elements: they keep their ids when they
+ * move between nodes, so a drawing can follow them.
+ *
+ * A tree always has a root: an empty tree is a root leaf with no keys, as
+ * CLRS's B-TREE-CREATE makes it. The kind enforces no minimum degree, no
+ * key order and no level leaves: recipes keep those rules. Every action
+ * keeps the shape valid.
+ *
+ * Marks: `highlight` lasts one step; `settle`, `pointer` and `annotate`
+ * persist.
+ */
+import { z } from 'zod';
+import { Element, ElementId, ElementInput, isElement, LIMITS, Place, PointerName, Scalar, } from "../common.js";
+import { typesOf } from "./kind.js";
+/** Most keys one node holds. */
+export const MAX_NODE_KEYS = 32;
+const Children = z
+    .array(ElementId)
+    .max(MAX_NODE_KEYS + 1)
+    .describe('Child node ids, one more than the keys; none for a leaf.');
+export const BTreeNode = z
+    .strictObject({
+    id: ElementId,
+    keys: z.array(Element).max(MAX_NODE_KEYS),
+    children: Children.optional(),
+})
+    .describe('A node: its keys in order and its children.');
+const BTreeNodeInput = z
+    .strictObject({
+    id: ElementId,
+    keys: z
+        .array(ElementInput)
+        .max(MAX_NODE_KEYS)
+        .describe('Keys in order: values like ["G", "M"] (ids "k0", "k1", … are generated through the tree) or elements { "id", "value" }.'),
+    children: Children.optional(),
+})
+    .describe('A node: its keys in order and its children.');
+const label = z.string().max(LIMITS.textLength).optional();
+/** Canonical declaration. */
+export const BTreeDecl = z
+    .strictObject({
+    kind: z.literal('btree'),
+    label,
+    place: Place.optional(),
+    nodes: z.array(BTreeNode).min(1).max(LIMITS.elementsPerStructure),
+    root: ElementId.describe('The root node.'),
+})
+    .describe('A multiway search tree, such as a B-tree.');
+export const BTreeDeclInput = z
+    .strictObject({
+    kind: z.literal('btree'),
+    label,
+    place: Place.optional(),
+    nodes: z
+        .array(BTreeNodeInput)
+        .min(1)
+        .max(LIMITS.elementsPerStructure)
+        .optional()
+        .describe('The nodes; by default one empty root with the id "root".'),
+    root: ElementId.optional().describe('The root node; by default the node that is nobody’s child.'),
+})
+    .describe('A multiway search tree, such as a B-tree.');
+/** An empty root id, which no element id can be: validation reports it. */
+const NO_ROOT = '';
+function normalizeBTreeDecl(input) {
+    const { nodes: given = [{ id: 'root', keys: [] }], root, ...rest } = input;
+    // Generated key ids skip the ids the author wrote.
+    const taken = new Set([
+        ...given.map((n) => n.id),
+        ...given.flatMap((n) => n.keys.filter(isElement).map((k) => k.id)),
+    ]);
+    let next = 0;
+    const fresh = () => {
+        while (taken.has(`k${next}`))
+            next++;
+        return `k${next++}`;
+    };
+    const nodes = given.map((n) => ({
+        id: n.id,
+        keys: n.keys.map((k) => (isElement(k) ? k : { id: fresh(), value: k })),
+        ...(n.children === undefined ? {} : { children: n.children }),
+    }));
+    if (root !== undefined)
+        return { ...rest, nodes, root };
+    const children = new Set(nodes.flatMap((n) => n.children ?? []));
+    const parentless = nodes.filter((n) => !children.has(n.id));
+    return {
+        ...rest,
+        nodes,
+        root: parentless.length === 1 ? parentless[0].id : NO_ROOT,
+    };
+}
+/** Shape rules: size, child counts, one parent each, one root, no cycles. */
+export function validateBTreeDecl(decl) {
+    const issues = [];
+    const total = decl.nodes.reduce((n, node) => n + 1 + node.keys.length, 0);
+    if (total > LIMITS.elementsPerStructure)
+        issues.push({
+            path: ['nodes'],
+            message: `The tree holds ${total} elements, nodes and keys together; at most ${LIMITS.elementsPerStructure} are allowed`,
+        });
+    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 (children.length !== 0 && children.length !== node.keys.length + 1)
+            issues.push({
+                path: ['nodes', k, 'children'],
+                message: `Node "${node.id}" has ${node.keys.length} keys and ${children.length} children; a node has no children or one more than its keys`,
+            });
+        children.forEach((child, c) => {
+            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: parent.get(child) === node.id
+                        ? `Node "${node.id}" lists "${child}" as a child twice`
+                        : `Node "${child}" has two parents ("${parent.get(child)}" and "${node.id}")`,
+                });
+            else
+                parent.set(child, node.id);
+        });
+    });
+    if (decl.root === NO_ROOT) {
+        issues.push({
+            path: ['root'],
+            message: 'No node, or more than one, is nobody’s child',
+            hint: 'Say which node is the root with `root`.',
+        });
+        return issues;
+    }
+    if (!index.has(decl.root)) {
+        issues.push({
+            path: ['root'],
+            message: `Root "${decl.root}" is not a node of this tree`,
+        });
+        return issues;
+    }
+    if (parent.has(decl.root))
+        issues.push({
+            path: ['root'],
+            message: `Root "${decl.root}" is also the child of "${parent.get(decl.root)}"`,
+        });
+    const seen = new Set();
+    const stack = [decl.root];
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        for (const c of decl.nodes[index.get(id)].children ?? [])
+            if (index.has(c))
+                stack.push(c);
+    }
+    decl.nodes.forEach((node, k) => {
+        if (!seen.has(node.id))
+            issues.push({
+                path: ['nodes', k],
+                message: `Node "${node.id}" is not reachable from the root`,
+                hint: 'Every node but the root is the child of one node.',
+            });
+    });
+    return issues;
+}
+const NodeRef = ElementId.describe('A node id.');
+const KeyRef = ElementId.describe('A key id.');
+const Index = z.int().min(0).max(MAX_NODE_KEYS);
+const actions = (key) => z.discriminatedUnion('type', [
+    z
+        .strictObject({
+        type: z.literal('insertKey'),
+        node: NodeRef,
+        index: Index,
+        key,
+    })
+        .describe('Insert a key into a leaf at position `index`, from 0 to its number of keys.'),
+    z
+        .strictObject({ type: z.literal('removeKey'), key: KeyRef })
+        .describe('Remove a key from the leaf that holds it.'),
+    z
+        .strictObject({ type: z.literal('setKey'), key: KeyRef, value: Scalar })
+        .describe('Change a key’s value: a relabelling that keeps its cell and marks.'),
+    z
+        .strictObject({ type: z.literal('lift'), key: KeyRef, over: KeyRef })
+        .describe('The key `key`, in a leaf, leaves it and takes the place of the key `over` in an inner node, which is removed: a predecessor or successor rising in a deletion.'),
+    z
+        .strictObject({
+        type: z.literal('split'),
+        node: NodeRef,
+        index: Index,
+        newNode: ElementId,
+    })
+        .describe('Split child `index` of `node` around its middle key, at ⌊(k − 1)/2⌋ of its k keys: the middle key rises into `node` at `index`, the keys and children right of it go to the new node `newNode`, child `index + 1`. The child needs at least 3 keys.'),
+    z
+        .strictObject({ type: z.literal('grow'), newRoot: ElementId })
+        .describe('Put a new root with no keys above the root, with the old root as its one child; a split of that child follows.'),
+    z
+        .strictObject({ type: z.literal('merge'), node: NodeRef, index: Index })
+        .describe('Merge child `index` of `node`, its key `index` and child `index + 1` into child `index`; child `index + 1` goes. Both children are leaves, or both have children.'),
+    z
+        .strictObject({ type: z.literal('shrink') })
+        .describe('The root has no keys and one child: the child becomes the root.'),
+    z
+        .strictObject({
+        type: z.literal('borrow'),
+        node: NodeRef,
+        child: Index,
+        from: z.enum(['left', 'right']),
+    })
+        .describe('Child `child` of `node` takes a key from its sibling on the side `from`, through `node`. From "right": `node`’s key `child` falls to the end of the child, the right sibling’s first key rises in its place, and the sibling’s first child moves to the end of the child. From "left" it mirrors: key `child − 1` falls to the front, the left sibling’s last key rises, its last child moves to the front.'),
+    z
+        .strictObject({
+        type: z.literal('highlight'),
+        keys: z.array(KeyRef).max(LIMITS.elementsPerStructure).optional(),
+        nodes: z.array(NodeRef).max(LIMITS.elementsPerStructure).optional(),
+    })
+        .describe('Highlight keys and nodes (this step only).'),
+    z
+        .strictObject({ type: z.literal('settle'), key: KeyRef })
+        .describe('Mark a key as found (persists).'),
+    z
+        .strictObject({
+        type: z.literal('pointer'),
+        name: PointerName,
+        node: NodeRef.nullable(),
+    })
+        .describe('Point a named pointer at a node; null removes it.'),
+    z
+        .strictObject({
+        type: z.literal('annotate'),
+        node: NodeRef,
+        text: z.string().max(32).nullable(),
+    })
+        .describe('Show a short note beside a node; null removes it.'),
+]);
+export const BTreeAction = actions(Element);
+export const BTreeActionInput = actions(ElementInput);
+export const btreeSpec = {
+    kind: 'btree',
+    decl: BTreeDecl,
+    declInput: BTreeDeclInput,
+    action: BTreeAction,
+    actionInput: BTreeActionInput,
+    actionTypes: typesOf(BTreeAction),
+    normalizeDecl: normalizeBTreeDecl,
+    declIds: (decl) => decl.nodes.flatMap((n, k) => [
+        { id: n.id, path: ['nodes', k, 'id'] },
+        ...n.keys.map((key, j) => ({
+            id: key.id,
+            path: ['nodes', k, 'keys', j, 'id'],
+        })),
+    ]),
+    validateDecl: validateBTreeDecl,
+    normalizeAction: (input, ctx) => input.type === 'insertKey' && !isElement(input.key)
+        ? { ...input, key: { id: ctx.allocateId('k'), value: input.key } }
+        : input,
+    introducedIds: (action) => action.type === 'insertKey'
+        ? [{ id: action.key.id, path: ['key', 'id'] }]
+        : action.type === 'split'
+            ? [{ id: action.newNode, path: ['newNode'] }]
+            : action.type === 'grow'
+                ? [{ id: action.newRoot, path: ['newRoot'] }]
+                : [],
+};
+//# sourceMappingURL=btree.js.map

package/dist/kinds/btree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"btree.js","sourceRoot":"","sources":["../../src/kinds/btree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EACL,OAAO,EACP,SAAS,EACT,YAAY,EACZ,SAAS,EACT,MAAM,EACN,KAAK,EACL,WAAW,EACX,MAAM,GACP,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAA6C,MAAM,WAAW,CAAC;AAE/E,gCAAgC;AAChC,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC;AAEhC,MAAM,QAAQ,GAAG,CAAC;KACf,KAAK,CAAC,SAAS,CAAC;KAChB,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC;KACtB,QAAQ,CAAC,0DAA0D,CAAC,CAAC;AAExE,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC;KACvB,YAAY,CAAC;IACZ,EAAE,EAAE,SAAS;IACb,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC;IACzC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;CAC9B,CAAC;KACD,QAAQ,CAAC,6CAA6C,CAAC,CAAC;AAG3D,MAAM,cAAc,GAAG,CAAC;KACrB,YAAY,CAAC;IACZ,EAAE,EAAE,SAAS;IACb,IAAI,EAAE,CAAC;SACJ,KAAK,CAAC,YAAY,CAAC;SACnB,GAAG,CAAC,aAAa,CAAC;SAClB,QAAQ,CACP,yHAAyH,CAC1H;IACH,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;CAC9B,CAAC;KACD,QAAQ,CAAC,6CAA6C,CAAC,CAAC;AAE3D,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE,CAAC;AAE3D,6BAA6B;AAC7B,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC;KACvB,YAAY,CAAC;IACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,KAAK;IACL,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC;IACjE,IAAI,EAAE,SAAS,CAAC,QAAQ,CAAC,gBAAgB,CAAC;CAC3C,CAAC;KACD,QAAQ,CAAC,2CAA2C,CAAC,CAAC;AAGzD,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC;KAC5B,YAAY,CAAC;IACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,KAAK;IACL,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,cAAc,CAAC;SACrB,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC;SAChC,QAAQ,EAAE;SACV,QAAQ,CAAC,0DAA0D,CAAC;IACvE,IAAI,EAAE,SAAS,CAAC,QAAQ,EAAE,CAAC,QAAQ,CACjC,4DAA4D,CAC7D;CACF,CAAC;KACD,QAAQ,CAAC,2CAA2C,CAAC,CAAC;AAGzD,2EAA2E;AAC3E,MAAM,OAAO,GAAG,EAAE,CAAC;AAEnB,SAAS,kBAAkB,CAAC,KAAqB;IAC/C,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC;IAC3E,mDAAmD;IACnD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC;QACpB,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzB,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACnE,CAAC,CAAC;IACH,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,KAAK,GAAG,GAAW,EAAE;QACzB,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAAE,IAAI,EAAE,CAAC;QACrC,OAAO,IAAI,IAAI,EAAE,EAAE,CAAC;IACtB,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC;QACzC,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACvE,GAAG,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;KAC9D,CAAC,CAAC,CAAC;IACJ,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;IACjE,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,OAAO;QACL,GAAG,IAAI;QACP,KAAK;QACL,IAAI,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO;KAC5D,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,iBAAiB,CAAC,IAAe;IAC/C,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC1E,IAAI,KAAK,GAAG,MAAM,CAAC,oBAAoB;QACrC,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,CAAC,OAAO,CAAC;YACf,OAAO,EAAE,kBAAkB,KAAK,+CAA+C,MAAM,CAAC,oBAAoB,cAAc;SACzH,CAAC,CAAC;IACL,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,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;YACnE,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC;gBAC9B,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,aAAa,QAAQ,CAAC,MAAM,6DAA6D;aAC5I,CAAC,CAAC;QACL,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAC5B,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,EACL,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,EAAE;wBAC3B,CAAC,CAAC,SAAS,IAAI,CAAC,EAAE,YAAY,KAAK,oBAAoB;wBACvD,CAAC,CAAC,SAAS,KAAK,uBAAuB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,EAAE,IAAI;iBAClF,CAAC,CAAC;;gBACA,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EAAE,8CAA8C;YACvD,IAAI,EAAE,yCAAyC;SAChD,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,8BAA8B;SAC1D,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,2BAA2B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;SAC/E,CAAC,CAAC;IACL,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,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,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAE,CAAC,QAAQ,IAAI,EAAE;YACxD,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,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,kCAAkC;gBAC3D,IAAI,EAAE,mDAAmD;aAC1D,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,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC/C,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;AAEhD,MAAM,OAAO,GAAG,CAAsB,GAAM,EAAE,EAAE,CAC9C,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;IAC3B,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;QAC5B,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,KAAK;QACZ,GAAG;KACJ,CAAC;SACD,QAAQ,CACP,6EAA6E,CAC9E;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;SAC3D,QAAQ,CAAC,2CAA2C,CAAC;IACxD,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;SACvE,QAAQ,CACP,oEAAoE,CACrE;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;SACpE,QAAQ,CACP,gKAAgK,CACjK;IACH,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QACxB,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,KAAK;QACZ,OAAO,EAAE,SAAS;KACnB,CAAC;SACD,QAAQ,CACP,qPAAqP,CACtP;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;SAC7D,QAAQ,CACP,gHAAgH,CACjH;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;SACvE,QAAQ,CACP,mKAAmK,CACpK;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;SAC3C,QAAQ,CACP,iEAAiE,CAClE;IACH,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;QACzB,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,KAAK;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KAChC,CAAC;SACD,QAAQ,CACP,6YAA6Y,CAC9Y;IACH,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;QAC5B,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,QAAQ,EAAE;QACjE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,QAAQ,EAAE;KACpE,CAAC;SACD,QAAQ,CAAC,4CAA4C,CAAC;IACzD,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;SACxD,QAAQ,CAAC,iCAAiC,CAAC;IAC9C,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;QAC1B,IAAI,EAAE,WAAW;QACjB,IAAI,EAAE,OAAO,CAAC,QAAQ,EAAE;KACzB,CAAC;SACD,QAAQ,CAAC,mDAAmD,CAAC;IAChE,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;QAC3B,IAAI,EAAE,OAAO;QACb,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE;KACpC,CAAC;SACD,QAAQ,CAAC,mDAAmD,CAAC;CACjE,CAAC,CAAC;AAEL,MAAM,CAAC,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;AAE5C,MAAM,CAAC,MAAM,gBAAgB,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;AAGtD,MAAM,CAAC,MAAM,SAAS,GAKjB;IACH,IAAI,EAAE,OAAO;IACb,IAAI,EAAE,SAAS;IACf,SAAS,EAAE,cAAc;IACzB,MAAM,EAAE,WAAW;IACnB,WAAW,EAAE,gBAAgB;IAC7B,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC;IACjC,aAAa,EAAE,kBAAkB;IACjC,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAChB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAW,EAAE,CAAC;QACpC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE;QACtC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAS,EAAE,CAAC,CAAC;YAChC,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC;SACpC,CAAC,CAAC;KACJ,CAAC;IACJ,YAAY,EAAE,iBAAiB;IAC/B,eAAe,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAC9B,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC;QACjD,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE;QAClE,CAAC,CAAE,KAAqB;IAC5B,aAAa,EAAE,CAAC,MAAM,EAAE,EAAE,CACxB,MAAM,CAAC,IAAI,KAAK,WAAW;QACzB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QAC9C,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO;YACvB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YAC7C,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;gBACtB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7C,CAAC,CAAC,EAAE;CACb,CAAC"}

package/dist/kinds/graph.d.ts

@@ -0,0 +1,227 @@
+/**
+ * The `graph` kind: directed or undirected graphs with optional edge
+ * weights, for traversals, shortest paths, spanning trees, topological
+ * sorting and flows.
+ *
+ * Node ids double as names: the shorthand `"nodes": ["A", "B"]` declares
+ * nodes A and B, and the edge `["A", "B", 4]` gets the id `A-B`.
+ *
+ * Marks: `highlight` lasts one step; `visit`, `settle`, `group`, `pointer`,
+ * `annotate` and `markEdge` persist until changed or `resetMarks`.
+ */
+import { z } from 'zod';
+import { type DeclIssue, type KindSpec } from './kind.ts';
+export declare const GraphNode: z.ZodObject<{
+    id: z.ZodString;
+    value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    x: z.ZodOptional<z.ZodNumber>;
+    y: z.ZodOptional<z.ZodNumber>;
+}, z.core.$strict>;
+export type GraphNode = z.infer<typeof GraphNode>;
+export declare const GraphEdge: z.ZodObject<{
+    id: z.ZodString;
+    from: z.ZodString;
+    to: z.ZodString;
+    weight: z.ZodOptional<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+}, z.core.$strict>;
+export type GraphEdge = z.infer<typeof GraphEdge>;
+export declare const GraphLayout: z.ZodEnum<{
+    auto: "auto";
+    circle: "circle";
+    layered: "layered";
+    grid: "grid";
+    manual: "manual";
+}>;
+export type GraphLayout = z.infer<typeof GraphLayout>;
+export declare const GraphDecl: z.ZodObject<{
+    kind: z.ZodLiteral<"graph">;
+    label: z.ZodOptional<z.ZodString>;
+    place: z.ZodOptional<z.ZodEnum<{
+        main: "main";
+        side: "side";
+    }>>;
+    directed: z.ZodBoolean;
+    layout: z.ZodEnum<{
+        auto: "auto";
+        circle: "circle";
+        layered: "layered";
+        grid: "grid";
+        manual: "manual";
+    }>;
+    nodes: z.ZodArray<z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+        x: z.ZodOptional<z.ZodNumber>;
+        y: z.ZodOptional<z.ZodNumber>;
+    }, z.core.$strict>>;
+    edges: z.ZodArray<z.ZodObject<{
+        id: z.ZodString;
+        from: z.ZodString;
+        to: z.ZodString;
+        weight: z.ZodOptional<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+    }, z.core.$strict>>;
+}, z.core.$strict>;
+export type GraphDecl = z.infer<typeof GraphDecl>;
+export declare const GraphDeclInput: z.ZodObject<{
+    kind: z.ZodLiteral<"graph">;
+    label: z.ZodOptional<z.ZodString>;
+    place: z.ZodOptional<z.ZodEnum<{
+        main: "main";
+        side: "side";
+    }>>;
+    directed: z.ZodOptional<z.ZodBoolean>;
+    layout: z.ZodOptional<z.ZodEnum<{
+        auto: "auto";
+        circle: "circle";
+        layered: "layered";
+        grid: "grid";
+        manual: "manual";
+    }>>;
+    nodes: z.ZodOptional<z.ZodArray<z.ZodUnion<readonly [z.ZodObject<{
+        id: z.ZodString;
+        x: z.ZodOptional<z.ZodNumber>;
+        y: z.ZodOptional<z.ZodNumber>;
+        value: z.ZodOptional<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+    }, z.core.$strict>, z.ZodString, z.ZodNumber]>>>;
+    edges: z.ZodOptional<z.ZodArray<z.ZodUnion<readonly [z.ZodObject<{
+        from: z.ZodString;
+        to: z.ZodString;
+        weight: z.ZodOptional<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+        id: z.ZodOptional<z.ZodString>;
+    }, z.core.$strict>, z.ZodTuple<[z.ZodString, z.ZodString], null>, z.ZodTuple<[z.ZodString, z.ZodString, z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>], null>]>>>;
+}, z.core.$strict>;
+export type GraphDeclInput = z.infer<typeof GraphDeclInput>;
+export declare function validateGraphDecl(decl: GraphDecl): DeclIssue[];
+export declare const GraphAction: z.ZodDiscriminatedUnion<[z.ZodObject<{
+    type: z.ZodLiteral<"addNode">;
+    node: z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+        x: z.ZodOptional<z.ZodNumber>;
+        y: z.ZodOptional<z.ZodNumber>;
+    }, z.core.$strict>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"removeNode">;
+    node: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"setValue">;
+    node: z.ZodString;
+    value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"addEdge">;
+    edge: z.ZodObject<{
+        id: z.ZodString;
+        from: z.ZodString;
+        to: z.ZodString;
+        weight: z.ZodOptional<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+    }, z.core.$strict>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"removeEdge">;
+    edge: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"setWeight">;
+    edge: z.ZodString;
+    weight: z.ZodNullable<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"highlight">;
+    nodes: z.ZodOptional<z.ZodArray<z.ZodString>>;
+    edges: z.ZodOptional<z.ZodArray<z.ZodString>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"visit">;
+    node: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"settle">;
+    node: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"group">;
+    node: z.ZodString;
+    group: z.ZodNullable<z.ZodLiteral<0 | 1 | 4 | 2 | 3 | 5>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"pointer">;
+    name: z.ZodString;
+    node: z.ZodNullable<z.ZodString>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"annotate">;
+    node: z.ZodString;
+    text: z.ZodNullable<z.ZodString>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"markEdge">;
+    edge: z.ZodString;
+    mark: z.ZodNullable<z.ZodEnum<{
+        selected: "selected";
+        rejected: "rejected";
+    }>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"resetMarks">;
+}, z.core.$strict>], "type">;
+export type GraphAction = z.infer<typeof GraphAction>;
+export declare const GraphActionInput: z.ZodDiscriminatedUnion<[z.ZodObject<{
+    type: z.ZodLiteral<"addNode">;
+    node: z.ZodUnion<readonly [z.ZodObject<{
+        id: z.ZodString;
+        x: z.ZodOptional<z.ZodNumber>;
+        y: z.ZodOptional<z.ZodNumber>;
+        value: z.ZodOptional<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+    }, z.core.$strict>, z.ZodString, z.ZodNumber]>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"removeNode">;
+    node: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"setValue">;
+    node: z.ZodString;
+    value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"addEdge">;
+    edge: z.ZodUnion<readonly [z.ZodObject<{
+        from: z.ZodString;
+        to: z.ZodString;
+        weight: z.ZodOptional<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+        id: z.ZodOptional<z.ZodString>;
+    }, z.core.$strict>, z.ZodTuple<[z.ZodString, z.ZodString], null>, z.ZodTuple<[z.ZodString, z.ZodString, z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>], null>]>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"removeEdge">;
+    edge: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"setWeight">;
+    edge: z.ZodString;
+    weight: z.ZodNullable<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"highlight">;
+    nodes: z.ZodOptional<z.ZodArray<z.ZodString>>;
+    edges: z.ZodOptional<z.ZodArray<z.ZodString>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"visit">;
+    node: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"settle">;
+    node: z.ZodString;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"group">;
+    node: z.ZodString;
+    group: z.ZodNullable<z.ZodLiteral<0 | 1 | 4 | 2 | 3 | 5>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"pointer">;
+    name: z.ZodString;
+    node: z.ZodNullable<z.ZodString>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"annotate">;
+    node: z.ZodString;
+    text: z.ZodNullable<z.ZodString>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"markEdge">;
+    edge: z.ZodString;
+    mark: z.ZodNullable<z.ZodEnum<{
+        selected: "selected";
+        rejected: "rejected";
+    }>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"resetMarks">;
+}, z.core.$strict>], "type">;
+export type GraphActionInput = z.infer<typeof GraphActionInput>;
+export declare const graphSpec: KindSpec<{
+    decl: GraphDecl;
+    declInput: GraphDeclInput;
+    action: GraphAction;
+    actionInput: GraphActionInput;
+}>;
+//# sourceMappingURL=graph.d.ts.map

package/dist/kinds/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/kinds/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAUxB,OAAO,EAAW,KAAK,SAAS,EAAc,KAAK,QAAQ,EAAE,MAAM,WAAW,CAAC;AAI/E,eAAO,MAAM,SAAS;;;;;kBASnB,CAAC;AACJ,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,CAAC;AAoBlD,eAAO,MAAM,SAAS;;;;;kBASnB,CAAC;AACJ,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,CAAC;AAalD,eAAO,MAAM,WAAW;;;;;;EAIrB,CAAC;AACJ,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,WAAW,CAAC,CAAC;AAEtD,eAAO,MAAM,SAAS;;;;;;;;;;;;;;;;;;;;;;;;;;;kBAUC,CAAC;AACxB,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,CAAC;AAElD,eAAO,MAAM,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;kBAQzB,CAAC;AACH,MAAM,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,CAAC;AA4C5D,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,EAAE,CAuB9D;AAwFD,eAAO,MAAM,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4BAAgC,CAAC;AACzD,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,WAAW,CAAC,CAAC;AACtD,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4BAAgC,CAAC;AAC9D,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,gBAAgB,CAAC,CAAC;AAEhE,eAAO,MAAM,SAAS,EAAE,QAAQ,CAAC;IAC/B,IAAI,EAAE,SAAS,CAAC;IAChB,SAAS,EAAE,cAAc,CAAC;IAC1B,MAAM,EAAE,WAAW,CAAC;IACpB,WAAW,EAAE,gBAAgB,CAAC;CAC/B,CA0BA,CAAC"}