@assemora/schema 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Assemora
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+

package/README.md

@@ -0,0 +1,35 @@
+# `@assemora/schema`
+
+Schema primitives: field definitions, type inference, neutral JSON representation.
+
+**Implementation phase:** 1 — implemented.
+
+One declaration is at once a runtime parser, a compile-time type and a JSON Schema
+description, so validation, the database, Studio forms, OpenAPI, the SDK and MCP all
+read a single source (SPEC.md §3.4, §42).
+
+```ts
+import { enumOf, number, object, string, uuid, type Infer } from '@assemora/schema'
+
+const Article = object({
+  id: uuid(),
+  title: string().min(2),
+  status: enumOf('draft', 'published'),
+  views: number().optional(),
+})
+
+type Article = Infer<typeof Article>
+// { id: string; title: string; status: 'draft' | 'published'; views?: number }
+
+const result = Article.parse(payload)
+if (!result.ok) result.issues // [{ path: ['title'], code: 'min', message: '...' }]
+```
+
+Parsing never throws — the caller decides what a failure means. Keys outside the
+declared shape are dropped rather than passed through, which is how mass assignment
+is prevented (SPEC.md §85).
+
+## Workspace dependencies
+
+_none, and there never will be any._ `pnpm boundaries` enforces it: every layer and
+every browser bundle reads this package.

package/dist/blocks.d.ts

@@ -0,0 +1,56 @@
+import { type BlockDesign } from './design.js';
+import type { Schema } from './types.js';
+export type BlockNode = {
+    /** Stable and immutable for the life of the block (SPEC.md §54). */
+    readonly id: string;
+    readonly type: string;
+    readonly version: number;
+    readonly props: Readonly<Record<string, unknown>>;
+    readonly children: readonly BlockNode[];
+    /** Hidden blocks stay in the tree and out of the rendered page (SPEC.md §60). */
+    readonly hidden?: boolean;
+    /**
+     * The seven universal controls of SPEC.md §61.
+     *
+     * Beside `props` rather than inside it: `props` is the block author's, and a
+     * framework key in there would collide with a field somebody declared.
+     */
+    readonly design?: BlockDesign;
+};
+export type BlockTree = {
+    readonly blocks: readonly BlockNode[];
+};
+export declare const emptyTree: () => BlockTree;
+/** Depth-first, parents before children. The order Studio and a renderer walk in. */
+export declare function walkBlocks(tree: BlockTree): Generator<BlockNode>;
+export declare const findBlock: (tree: BlockTree, id: string) => BlockNode | undefined;
+/** Every id in the tree, in walk order. Used to prove they stay unique. */
+export declare const blockIds: (tree: BlockTree) => string[];
+/** Validates a stored tree. What a JSONB column is checked against on the way in. */
+export declare const blockTree: () => Schema<BlockTree>;
+export type ChangedBlock = {
+    readonly id: string;
+    readonly type: string;
+    /** Which of the block's own props differ. Empty when only the design changed. */
+    readonly fields: readonly string[];
+    readonly design: boolean;
+    readonly hidden: boolean;
+};
+export type TreeChange = {
+    readonly added: readonly BlockNode[];
+    readonly removed: readonly BlockNode[];
+    readonly changed: readonly ChangedBlock[];
+    readonly moved: readonly BlockNode[];
+};
+/**
+ * What actually happened to a page (SPEC.md §65).
+ *
+ * A field-level diff of two pages says `draftTree` changed and hands over both
+ * trees, which is true and useless. This says "the hero's title changed" — the shape
+ * SPEC.md §65 shows in Studio, and the one a change set needs (SPEC.md §75).
+ *
+ * It lives here because it is knowledge about the tree, and the tree lives here: the
+ * editor, an agent and the API all read the same answer.
+ */
+export declare const diffTrees: (before: BlockTree, after: BlockTree) => TreeChange;
+//# sourceMappingURL=blocks.d.ts.map

package/dist/blocks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocks.d.ts","sourceRoot":"","sources":["../src/blocks.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,KAAK,WAAW,EAAe,MAAM,aAAa,CAAA;AAC3D,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,YAAY,CAAA;AAExC,MAAM,MAAM,SAAS,GAAG;IACtB,oEAAoE;IACpE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IACjD,QAAQ,CAAC,QAAQ,EAAE,SAAS,SAAS,EAAE,CAAA;IACvC,iFAAiF;IACjF,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAA;IACzB;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAA;CAC9B,CAAA;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE,CAAA;CACtC,CAAA;AAED,eAAO,MAAM,SAAS,QAAO,SAA6B,CAAA;AAE1D,qFAAqF;AACrF,wBAAiB,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CASjE;AAED,eAAO,MAAM,SAAS,SAAU,SAAS,MAAM,MAAM,KAAG,SAAS,GAAG,SAMnE,CAAA;AAED,2EAA2E;AAC3E,eAAO,MAAM,QAAQ,SAAU,SAAS,KAAG,MAAM,EAAkD,CAAA;AAyCnG,qFAAqF;AACrF,eAAO,MAAM,SAAS,QAAO,MAAM,CAAC,SAAS,CAmB5C,CAAA;AAED,MAAM,MAAM,YAAY,GAAG;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,iFAAiF;IACjF,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;IACxB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;CACzB,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAA;IACpC,QAAQ,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,CAAA;IACtC,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAA;IACzC,QAAQ,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAA;CACrC,CAAA;AAgCD;;;;;;;;;GASG;AACH,eAAO,MAAM,SAAS,WAAY,SAAS,SAAS,SAAS,KAAG,UAuC/D,CAAA"}

package/dist/blocks.js

@@ -0,0 +1,152 @@
+/**
+ * The block tree (SPEC.md §54).
+ *
+ * A page is a tree of blocks and never an HTML blob (SPEC.md §125.14), so the shape
+ * of that tree is data every layer agrees on: the page layer edits it, Studio renders
+ * it, an agent reads and proposes changes to it, and `@assemora/react` draws it.
+ *
+ * It lives in this package for one reason: `@assemora/react` depends on `schema` and
+ * on nothing else. Were these types in `@assemora/pages`, a browser bundle would drag
+ * the whole server layer in behind them (docs/architecture/package-graph.md).
+ */
+import { array, boolean, json, number, object, string } from './composites-bridge.js';
+import { blockDesign } from './design.js';
+export const emptyTree = () => ({ blocks: [] });
+/** Depth-first, parents before children. The order Studio and a renderer walk in. */
+export function* walkBlocks(tree) {
+    const visit = function* (nodes) {
+        for (const node of nodes) {
+            yield node;
+            yield* visit(node.children);
+        }
+    };
+    yield* visit(tree.blocks);
+}
+export const findBlock = (tree, id) => {
+    for (const node of walkBlocks(tree)) {
+        if (node.id === id)
+            return node;
+    }
+    return undefined;
+};
+/** Every id in the tree, in walk order. Used to prove they stay unique. */
+export const blockIds = (tree) => [...walkBlocks(tree)].map((node) => node.id);
+const blockNodeSchema = () => {
+    const node = {
+        kind: 'object',
+        isOptional: false,
+        isNullable: false,
+        description: 'A block in a page tree',
+        parse: (value) => {
+            const shape = object({
+                id: string().min(1),
+                type: string().min(1),
+                version: number().integer(),
+                props: json(),
+                children: array(node),
+                hidden: boolean().optional(),
+                design: blockDesign().optional(),
+            });
+            const result = shape.parse(value);
+            return result.ok ? { ok: true, value: result.value } : result;
+        },
+        toJsonSchema: () => ({
+            type: 'object',
+            properties: {
+                id: { type: 'string' },
+                type: { type: 'string' },
+                version: { type: 'integer' },
+                props: { type: 'object' },
+                children: { type: 'array', items: { $ref: '#' } },
+                hidden: { type: 'boolean' },
+                design: blockDesign().toJsonSchema(),
+            },
+            required: ['id', 'type', 'version', 'props', 'children'],
+        }),
+    };
+    return node;
+};
+/** Validates a stored tree. What a JSONB column is checked against on the way in. */
+export const blockTree = () => {
+    const blocks = array(blockNodeSchema());
+    return {
+        kind: 'object',
+        isOptional: false,
+        isNullable: false,
+        description: 'A page as a tree of blocks',
+        parse: (value) => {
+            const result = object({ blocks }).parse(value);
+            return result.ok ? { ok: true, value: result.value } : result;
+        },
+        toJsonSchema: () => ({
+            type: 'object',
+            properties: { blocks: { type: 'array' } },
+            required: ['blocks'],
+        }),
+    };
+};
+const byId = (tree) => new Map([...walkBlocks(tree)].map((node) => [node.id, node]));
+const differ = (left, right) => JSON.stringify(left ?? null) !== JSON.stringify(right ?? null);
+/**
+ * Where each block sits, as its parent and the siblings before it.
+ *
+ * The order among *surviving* siblings is what matters: a block that shifted down
+ * because something was inserted above it has not moved, and saying it did would
+ * bury the one edit somebody made under a list of everything after it.
+ */
+const positions = (tree, common) => {
+    const at = new Map();
+    const visit = (nodes, parent) => {
+        const surviving = nodes.filter((node) => common.has(node.id));
+        for (const node of nodes) {
+            at.set(node.id, `${parent}/${surviving.findIndex((sibling) => sibling.id === node.id)}`);
+            visit(node.children, node.id);
+        }
+    };
+    visit(tree.blocks, '');
+    return at;
+};
+/**
+ * What actually happened to a page (SPEC.md §65).
+ *
+ * A field-level diff of two pages says `draftTree` changed and hands over both
+ * trees, which is true and useless. This says "the hero's title changed" — the shape
+ * SPEC.md §65 shows in Studio, and the one a change set needs (SPEC.md §75).
+ *
+ * It lives here because it is knowledge about the tree, and the tree lives here: the
+ * editor, an agent and the API all read the same answer.
+ */
+export const diffTrees = (before, after) => {
+    const was = byId(before);
+    const is = byId(after);
+    const common = new Set([...was.keys()].filter((id) => is.has(id)));
+    const wasAt = positions(before, common);
+    const isAt = positions(after, common);
+    const added = [];
+    const removed = [];
+    const changed = [];
+    const moved = [];
+    for (const [id, node] of is) {
+        const previous = was.get(id);
+        if (previous === undefined) {
+            added.push(node);
+            continue;
+        }
+        const fields = [...new Set([...Object.keys(previous.props), ...Object.keys(node.props)])]
+            .filter((name) => differ(previous.props[name], node.props[name]))
+            .sort();
+        const design = differ(previous.design, node.design);
+        const hidden = (previous.hidden ?? false) !== (node.hidden ?? false);
+        if (fields.length > 0 || design || hidden) {
+            changed.push({ id, type: node.type, fields, design, hidden });
+        }
+        if (wasAt.get(id) !== isAt.get(id))
+            moved.push(node);
+    }
+    for (const [id, node] of was) {
+        if (!is.has(id))
+            removed.push(node);
+    }
+    return { added, removed, changed, moved };
+};
+//# sourceMappingURL=blocks.js.map

package/dist/blocks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocks.js","sourceRoot":"","sources":["../src/blocks.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAA;AACrF,OAAO,EAAoB,WAAW,EAAE,MAAM,aAAa,CAAA;AAyB3D,MAAM,CAAC,MAAM,SAAS,GAAG,GAAc,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;AAE1D,qFAAqF;AACrF,MAAM,SAAS,CAAC,CAAC,UAAU,CAAC,IAAe;IACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,KAA2B;QAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,CAAA;YACV,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC,CAAA;IAED,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AAC3B,CAAC;AAED,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAe,EAAE,EAAU,EAAyB,EAAE;IAC9E,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,IAAI,CAAA;IACjC,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED,2EAA2E;AAC3E,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,IAAe,EAAY,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AAEnG,MAAM,eAAe,GAAG,GAAsB,EAAE;IAC9C,MAAM,IAAI,GAAsB;QAC9B,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE,KAAK;QACjB,UAAU,EAAE,KAAK;QACjB,WAAW,EAAE,wBAAwB;QACrC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;YACf,MAAM,KAAK,GAAG,MAAM,CAAC;gBACnB,EAAE,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACnB,IAAI,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,OAAO,EAAE,MAAM,EAAE,CAAC,OAAO,EAAE;gBAC3B,KAAK,EAAE,IAAI,EAA2B;gBACtC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC;gBACrB,MAAM,EAAE,OAAO,EAAE,CAAC,QAAQ,EAAE;gBAC5B,MAAM,EAAE,WAAW,EAAE,CAAC,QAAQ,EAAE;aACjC,CAAC,CAAA;YAEF,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YAEjC,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAkB,EAAE,CAAC,CAAC,CAAC,MAAM,CAAA;QAC5E,CAAC;QACD,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;YACnB,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACtB,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACxB,OAAO,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC5B,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACzB,QAAQ,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;gBACjD,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC3B,MAAM,EAAE,WAAW,EAAE,CAAC,YAAY,EAAE;aACrC;YACD,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,CAAC;SACzD,CAAC;KACH,CAAA;IAED,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,qFAAqF;AACrF,MAAM,CAAC,MAAM,SAAS,GAAG,GAAsB,EAAE;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,eAAe,EAAE,CAAC,CAAA;IAEvC,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE,KAAK;QACjB,UAAU,EAAE,KAAK;QACjB,WAAW,EAAE,4BAA4B;QACzC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;YACf,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YAE9C,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAkB,EAAE,CAAC,CAAC,CAAC,MAAM,CAAA;QAC5E,CAAC;QACD,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;YACnB,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE;YACzC,QAAQ,EAAE,CAAC,QAAQ,CAAC;SACrB,CAAC;KACH,CAAA;AACH,CAAC,CAAA;AAkBD,MAAM,IAAI,GAAG,CAAC,IAAe,EAA0B,EAAE,CACvD,IAAI,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;AAE/D,MAAM,MAAM,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE,CACxD,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAA;AAEhE;;;;;;GAMG;AACH,MAAM,SAAS,GAAG,CAAC,IAAe,EAAE,MAA2B,EAAuB,EAAE;IACtF,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAA;IAEpC,MAAM,KAAK,GAAG,CAAC,KAA2B,EAAE,MAAc,EAAE,EAAE;QAC5D,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;QAE7D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,MAAM,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;YACxF,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC,CAAA;IAED,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;IAEtB,OAAO,EAAE,CAAA;AACX,CAAC,CAAA;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,MAAiB,EAAE,KAAgB,EAAc,EAAE;IAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAA;IACxB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;IACtB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAClE,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACvC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IAErC,MAAM,KAAK,GAAgB,EAAE,CAAA;IAC7B,MAAM,OAAO,GAAgB,EAAE,CAAA;IAC/B,MAAM,OAAO,GAAmB,EAAE,CAAA;IAClC,MAAM,KAAK,GAAgB,EAAE,CAAA;IAE7B,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAE5B,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAChB,SAAQ;QACV,CAAC;QAED,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aACtF,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;aAChE,IAAI,EAAE,CAAA;QAET,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;QACnD,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,CAAA;QAEpE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;YAC1C,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;QAC/D,CAAC;QAED,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACtD,CAAC;IAED,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACrC,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAA;AAC3C,CAAC,CAAA"}

package/dist/composites-bridge.d.ts

@@ -0,0 +1,4 @@
+/** Re-exported so `blocks.ts` can compose primitives without a circular import. */
+export { array, type ObjectSchema, object } from './composites.js';
+export { boolean, enumOf, json, number, string } from './primitives.js';
+//# sourceMappingURL=composites-bridge.d.ts.map

package/dist/composites-bridge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"composites-bridge.d.ts","sourceRoot":"","sources":["../src/composites-bridge.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,OAAO,EAAE,KAAK,EAAE,KAAK,YAAY,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAA;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAA"}

package/dist/composites-bridge.js

@@ -0,0 +1,4 @@
+/** Re-exported so `blocks.ts` can compose primitives without a circular import. */
+export { array, object } from './composites.js';
+export { boolean, enumOf, json, number, string } from './primitives.js';
+//# sourceMappingURL=composites-bridge.js.map

package/dist/composites-bridge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"composites-bridge.js","sourceRoot":"","sources":["../src/composites-bridge.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,OAAO,EAAE,KAAK,EAAqB,MAAM,EAAE,MAAM,iBAAiB,CAAA;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAA"}

package/dist/composites.d.ts

@@ -0,0 +1,19 @@
+import { type Infer, type InferShape, type OptionalSchema, type Schema, type Shape } from './types.js';
+export type ObjectSchema<S extends Shape> = Schema<InferShape<S>> & {
+    readonly shape: S;
+    describe(text: string): ObjectSchema<S>;
+    optional(): OptionalSchema<InferShape<S>>;
+    nullable(): Schema<InferShape<S> | null>;
+};
+/** `object({ email: string(), age: number().optional() })` */
+export declare const object: <S extends Shape>(shape: S) => ObjectSchema<S>;
+export type ArraySchema<E extends Schema> = Schema<Infer<E>[]> & {
+    readonly element: E;
+    min(length: number): ArraySchema<E>;
+    max(length: number): ArraySchema<E>;
+    describe(text: string): ArraySchema<E>;
+    optional(): OptionalSchema<Infer<E>[]>;
+    nullable(): Schema<Infer<E>[] | null>;
+};
+export declare const array: <E extends Schema>(element: E) => ArraySchema<E>;
+//# sourceMappingURL=composites.d.ts.map

package/dist/composites.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"composites.d.ts","sourceRoot":"","sources":["../src/composites.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,KAAK,KAAK,EACV,KAAK,UAAU,EAIf,KAAK,cAAc,EAGnB,KAAK,MAAM,EACX,KAAK,KAAK,EACX,MAAM,YAAY,CAAA;AAmBnB,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,KAAK,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG;IAClE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;IACjB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAA;IACvC,QAAQ,IAAI,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IACzC,QAAQ,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;CACzC,CAAA;AA4ED,8DAA8D;AAC9D,eAAO,MAAM,MAAM,GAAI,CAAC,SAAS,KAAK,SAAS,CAAC,KAAG,YAAY,CAAC,CAAC,CAAkC,CAAA;AAInG,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG;IAC/D,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAA;IACnB,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IACnC,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IACnC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IACtC,QAAQ,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACtC,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAA;CACtC,CAAA;AA2DD,eAAO,MAAM,KAAK,GAAI,CAAC,SAAS,MAAM,WAAW,CAAC,KAAG,WAAW,CAAC,CAAC,CAC2B,CAAA"}

package/dist/composites.js

@@ -0,0 +1,120 @@
+import { fail, failWith, nest, ok, } from './types.js';
+const optionalOf = (inner) => ({
+    ...inner,
+    isOptional: true,
+    parse: (value) => value === undefined ? ok(undefined) : inner.parse(value),
+});
+const nullableOf = (inner) => ({
+    ...inner,
+    isNullable: true,
+    parse: (value) => value === null ? ok(null) : inner.parse(value),
+    toJsonSchema: () => ({ ...inner.toJsonSchema(), nullable: true }),
+});
+const buildObject = (shape, description) => {
+    const self = {
+        kind: 'object',
+        isOptional: false,
+        isNullable: false,
+        description,
+        shape,
+        parse: (value) => {
+            if (typeof value !== 'object' || value === null || Array.isArray(value)) {
+                return fail('type', 'Expected an object');
+            }
+            const source = value;
+            const issues = [];
+            const parsed = {};
+            for (const [key, field] of Object.entries(shape)) {
+                // `hasOwn` rather than plain indexing, and rather than `in`: a shape's keys are
+                // caller-chosen — a dynamic collection names its fields in stored JSON
+                // (SPEC.md §37, §86) — and `constructor`, `toString`, `valueOf` and
+                // `hasOwnProperty` are all legal field names that `Object.prototype` answers on
+                // a value that has never been given them. Read without this, a group field
+                // called `constructor` parsed a function for a key nobody sent, and the entry
+                // could never be saved.
+                const present = Object.hasOwn(source, key);
+                const result = field.parse(present ? source[key] : undefined);
+                if (!result.ok) {
+                    issues.push(...nest(key, result.issues));
+                    continue;
+                }
+                // An absent optional key stays absent rather than becoming `undefined`,
+                // which `exactOptionalPropertyTypes` treats as two different things.
+                if (result.value === undefined && !present)
+                    continue;
+                parsed[key] = result.value;
+            }
+            // Keys that are not part of the shape are dropped, never carried through.
+            // Passing them on is how mass assignment happens (SPEC.md §85).
+            return issues.length > 0 ? failWith(issues) : ok(parsed);
+        },
+        toJsonSchema: () => {
+            const properties = {};
+            const required = [];
+            for (const [key, field] of Object.entries(shape)) {
+                properties[key] = field.toJsonSchema();
+                if (!field.isOptional)
+                    required.push(key);
+            }
+            return {
+                type: 'object',
+                properties,
+                ...(required.length > 0 ? { required } : {}),
+                additionalProperties: false,
+                ...(description === undefined ? {} : { description }),
+            };
+        },
+        describe: (text) => buildObject(shape, text),
+        optional: () => optionalOf(self),
+        nullable: () => nullableOf(self),
+    };
+    return self;
+};
+/** `object({ email: string(), age: number().optional() })` */
+export const object = (shape) => buildObject(shape, undefined);
+const buildArray = (element, state) => {
+    const self = {
+        kind: 'array',
+        isOptional: false,
+        isNullable: false,
+        description: state.description,
+        element,
+        parse: (value) => {
+            if (!Array.isArray(value))
+                return fail('type', 'Expected an array');
+            if (state.minLength !== undefined && value.length < state.minLength) {
+                return fail('min', `Must contain at least ${state.minLength} items`);
+            }
+            if (state.maxLength !== undefined && value.length > state.maxLength) {
+                return fail('max', `Must contain at most ${state.maxLength} items`);
+            }
+            const issues = [];
+            const parsed = [];
+            for (const [index, item] of value.entries()) {
+                const result = element.parse(item);
+                if (result.ok) {
+                    parsed.push(result.value);
+                }
+                else {
+                    issues.push(...nest(index, result.issues));
+                }
+            }
+            return issues.length > 0 ? failWith(issues) : ok(parsed);
+        },
+        toJsonSchema: () => ({
+            type: 'array',
+            items: element.toJsonSchema(),
+            ...(state.minLength === undefined ? {} : { minItems: state.minLength }),
+            ...(state.maxLength === undefined ? {} : { maxItems: state.maxLength }),
+            ...(state.description === undefined ? {} : { description: state.description }),
+        }),
+        min: (length) => buildArray(element, { ...state, minLength: length }),
+        max: (length) => buildArray(element, { ...state, maxLength: length }),
+        describe: (text) => buildArray(element, { ...state, description: text }),
+        optional: () => optionalOf(self),
+        nullable: () => nullableOf(self),
+    };
+    return self;
+};
+export const array = (element) => buildArray(element, { minLength: undefined, maxLength: undefined, description: undefined });
+//# sourceMappingURL=composites.js.map

package/dist/composites.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"composites.js","sourceRoot":"","sources":["../src/composites.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,IAAI,EACJ,QAAQ,EAKR,IAAI,EAEJ,EAAE,GAIH,MAAM,YAAY,CAAA;AAEnB,MAAM,UAAU,GAAG,CAAI,KAAgB,EAAqB,EAAE,CAAC,CAAC;IAC9D,GAAG,KAAK;IACR,UAAU,EAAE,IAAI;IAChB,KAAK,EAAE,CAAC,KAAc,EAA8B,EAAE,CACpD,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;CAC3D,CAAC,CAAA;AAEF,MAAM,UAAU,GAAG,CAAI,KAAgB,EAAoB,EAAE,CAAC,CAAC;IAC7D,GAAG,KAAK;IACR,UAAU,EAAE,IAAI;IAChB,KAAK,EAAE,CAAC,KAAc,EAAyB,EAAE,CAC/C,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;IAChD,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;CAClE,CAAC,CAAA;AAWF,MAAM,WAAW,GAAG,CAClB,KAAQ,EACR,WAA+B,EACd,EAAE;IACnB,MAAM,IAAI,GAAoB;QAC5B,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE,KAAK;QACjB,UAAU,EAAE,KAAK;QACjB,WAAW;QACX,KAAK;QAEL,KAAK,EAAE,CAAC,KAAc,EAA8B,EAAE;YACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxE,OAAO,IAAI,CAAC,MAAM,EAAE,oBAAoB,CAAC,CAAA;YAC3C,CAAC;YAED,MAAM,MAAM,GAAG,KAAgC,CAAA;YAC/C,MAAM,MAAM,GAAY,EAAE,CAAA;YAC1B,MAAM,MAAM,GAA4B,EAAE,CAAA;YAE1C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjD,gFAAgF;gBAChF,uEAAuE;gBACvE,oEAAoE;gBACpE,gFAAgF;gBAChF,2EAA2E;gBAC3E,8EAA8E;gBAC9E,wBAAwB;gBACxB,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;gBAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;gBAE7D,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;oBACf,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAA;oBACxC,SAAQ;gBACV,CAAC;gBAED,wEAAwE;gBACxE,qEAAqE;gBACrE,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,OAAO;oBAAE,SAAQ;gBAEpD,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAA;YAC5B,CAAC;YAED,0EAA0E;YAC1E,gEAAgE;YAChE,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAuB,CAAC,CAAA;QAC3E,CAAC;QAED,YAAY,EAAE,GAAe,EAAE;YAC7B,MAAM,UAAU,GAA+B,EAAE,CAAA;YACjD,MAAM,QAAQ,GAAa,EAAE,CAAA;YAE7B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjD,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,CAAA;gBACtC,IAAI,CAAC,KAAK,CAAC,UAAU;oBAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAC3C,CAAC;YAED,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,UAAU;gBACV,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,oBAAoB,EAAE,KAAK;gBAC3B,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;aACtD,CAAA;QACH,CAAC;QAED,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;QAC5C,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;QAChC,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;KACjC,CAAA;IAED,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,8DAA8D;AAC9D,MAAM,CAAC,MAAM,MAAM,GAAG,CAAkB,KAAQ,EAAmB,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAA;AAmBnG,MAAM,UAAU,GAAG,CAAmB,OAAU,EAAE,KAAiB,EAAkB,EAAE;IACrF,MAAM,IAAI,GAAmB;QAC3B,IAAI,EAAE,OAAO;QACb,UAAU,EAAE,KAAK;QACjB,UAAU,EAAE,KAAK;QACjB,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,OAAO;QAEP,KAAK,EAAE,CAAC,KAAc,EAA2B,EAAE;YACjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAA;YAEnE,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpE,OAAO,IAAI,CAAC,KAAK,EAAE,yBAAyB,KAAK,CAAC,SAAS,QAAQ,CAAC,CAAA;YACtE,CAAC;YACD,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpE,OAAO,IAAI,CAAC,KAAK,EAAE,wBAAwB,KAAK,CAAC,SAAS,QAAQ,CAAC,CAAA;YACrE,CAAC;YAED,MAAM,MAAM,GAAY,EAAE,CAAA;YAC1B,MAAM,MAAM,GAAe,EAAE,CAAA;YAE7B,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;gBAClC,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;oBACd,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAiB,CAAC,CAAA;gBACvC,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAA;gBAC5C,CAAC;YACH,CAAC;YAED,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;QAC1D,CAAC;QAED,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;YACnB,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,OAAO,CAAC,YAAY,EAAE;YAC7B,GAAG,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC;YACvE,GAAG,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC;YACvE,GAAG,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC;SAC/E,CAAC;QAEF,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACrE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACrE,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;QACxE,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;QAChC,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;KACjC,CAAA;IAED,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,KAAK,GAAG,CAAmB,OAAU,EAAkB,EAAE,CACpE,UAAU,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAA"}