@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/lib/simple-tree/rawNode.js

@@ -2,11 +2,11 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-var _a;
-import { FlexFieldNodeSchema, FlexTreeEntityKind, flexTreeMarker, onNextChange, FlexMapNodeSchema, FlexObjectNodeSchema, } from "../feature-libraries/index.js";
+var _RawTreeNode_anchor, _a;
+import { FlexTreeEntityKind, flexTreeMarker, } from "../feature-libraries/index.js";
 import { fail } from "../util/index.js";
 /** Stores the content of the raw node, i.e. the data that was passed to the factory */
-const nodeContent = Symbol();
+export const nodeContent = Symbol();
 /**
  * Retrieve the content of a raw object node created via {@link createRawNode}.
  * @remarks
@@ -22,32 +22,18 @@ export function extractRawNodeContent(node) {
     return undefined;
 }
 /**
- * Creates a node that pretends to satisfy the given schema while wrapping the given node content.
+ * Node that pretends to satisfy the given schema while wrapping the given node content.
  * Retrieve the node content via {@link extractRawNodeContent}.
  *
  * @remarks This is useful for creating "raw" nodes: nodes which capture data about a pending insertion but are not yet inserted.
  * These raw nodes can be then used on the right-hand side of an assignment (via `=`) to the tree.
  * However, many of their properties and methods are currently unimplemented and will error if accessed.
  */
-export function createRawNode(schema, content) {
-    if (schema instanceof FlexObjectNodeSchema) {
-        return new RawObjectNode(schema, content);
-    }
-    if (schema instanceof FlexMapNodeSchema) {
-        return new RawMapNode(schema, content);
-    }
-    if (schema instanceof FlexFieldNodeSchema) {
-        return new RawFieldNode(schema, content);
-    }
-    fail("Unrecognized schema");
-}
-/**
- * The base implementation of a node created by {@link createRawNode}.
- */
 export class RawTreeNode {
     constructor(schema, content) {
         this.schema = schema;
         this[_a] = FlexTreeEntityKind.Node;
+        _RawTreeNode_anchor.set(this, void 0);
         this.type = schema.name;
         this[nodeContent] = content;
     }
@@ -63,6 +49,9 @@ export class RawTreeNode {
     tryGetField(key) {
         throw rawError("Reading fields");
     }
+    getBoxed(key) {
+        throw rawError("Reading boxed fields");
+    }
     boxedIterator() {
         throw rawError("Boxed iteration");
     }
@@ -73,74 +62,12 @@ export class RawTreeNode {
     on(eventName, listener) {
         throw rawError("Event registration");
     }
-    [(_a = flexTreeMarker, onNextChange)](fn) {
-        throw rawError("onNextChange event registration");
-    }
-}
-/**
- * The implementation of an object node created by {@link createRawNode}.
- */
-export class RawObjectNode extends RawTreeNode {
-    get localNodeKey() {
-        throw rawError("Reading local node keys");
-    }
-}
-/**
- * The implementation of a map node created by {@link createRawNode}.
- */
-export class RawMapNode extends RawTreeNode {
-    get size() {
-        return this[nodeContent].size;
-    }
-    has(key) {
-        return this[nodeContent].has(key);
-    }
-    get(key) {
-        return this[nodeContent].get(key);
-    }
-    getBoxed(key) {
-        throw rawError("Reading boxed map values");
-    }
-    keys() {
-        return this[nodeContent].keys();
-    }
-    values() {
-        throw rawError("Iterating map values");
-    }
-    entries() {
-        throw rawError("Iterating map entries");
-    }
-    forEach(callbackFn, thisArg) {
-        throw rawError("Iterating maps with forEach");
-    }
-    set(key, value) {
-        throw rawError("Setting a map entry");
-    }
-    delete(key) {
-        throw rawError("Deleting a map entry");
-    }
-    get asObject() {
-        throw rawError("Converting a map to an object");
-    }
-    [Symbol.iterator]() {
-        return this.entries();
-    }
-    boxedIterator() {
-        throw rawError("Boxed iteration");
-    }
-}
-/**
- * The implementation of a field node created by {@link createRawNode}.
- */
-export class RawFieldNode extends RawTreeNode {
-    get content() {
-        throw rawError("Reading content of an array node");
-    }
-    get boxedContent() {
-        throw rawError("Reading boxed content of an array node");
+    get anchorNode() {
+        throw rawError("Reading anchor node");
     }
 }
-function rawError(message) {
+_RawTreeNode_anchor = new WeakMap(), _a = flexTreeMarker;
+export function rawError(message) {
     return new Error(`${message ?? "Operation"} is not supported on content which has not yet been inserted into the tree`);
 }
 //# sourceMappingURL=rawNode.js.map

package/lib/simple-tree/rawNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"rawNode.js","sourceRoot":"","sources":["../../src/simple-tree/rawNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;;AAGH,OAAO,EAEN,mBAAmB,EAKnB,kBAAkB,EAMlB,cAAc,EACd,YAAY,EAEZ,iBAAiB,EACjB,oBAAoB,GAIpB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAGxC,uFAAuF;AACvF,MAAM,WAAW,GAAG,MAAM,EAAE,CAAC;AAK7B;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAY;IACjD,IAAI,IAAI,YAAY,WAAW,EAAE;QAChC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,yCAAyC,CAAC,CAAC;QACrF,OAAO,CAAC,cAAc,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1C,OAAO,OAAiB,CAAC;KACzB;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC5B,MAA0B,EAC1B,OAA0B;IAE1B,IAAI,MAAM,YAAY,oBAAoB,EAAE;QAC3C,OAAO,IAAI,aAAa,CAAC,MAAM,EAAE,OAAiB,CAAC,CAAC;KACpD;IACD,IAAI,MAAM,YAAY,iBAAiB,EAAE;QACxC,OAAO,IAAI,UAAU,CAAC,MAAM,EAAE,OAAiD,CAAC,CAAC;KACjF;IACD,IAAI,MAAM,YAAY,mBAAmB,EAAE;QAC1C,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACzC;IACD,IAAI,CAAC,qBAAqB,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,OAAgB,WAAW;IAOhC,YACiB,MAAe,EAC/B,OAAiB;QADD,WAAM,GAAN,MAAM,CAAS;QALhB,QAAgB,GAAG,kBAAkB,CAAC,IAAa,CAAC;QAQnE,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACxB,IAAI,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC;IAC7B,CAAC;IAED,IAAW,OAAO;QACjB,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAED,IAAW,WAAW;QACrB,MAAM,QAAQ,CAAC,qBAAqB,CAAC,CAAC;IACvC,CAAC;IAEM,EAAE,CACR,MAAoB;QAEpB,OAAQ,MAAkB,KAAK,IAAI,CAAC,MAAM,CAAC;IAC5C,CAAC;IAEM,WAAW,CAAC,GAAa;QAC/B,MAAM,QAAQ,CAAC,gBAAgB,CAAC,CAAC;IAClC,CAAC;IAEM,aAAa;QACnB,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAEM,UAAU;QAChB,uDAAuD;QACvD,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAIM,EAAE,CACR,SAAY,EACZ,QAA+B;QAE/B,MAAM,QAAQ,CAAC,oBAAoB,CAAC,CAAC;IACtC,CAAC;IAEM,OAhDU,cAAc,EAgDvB,YAAY,EAAC,CAAC,EAAgC;QACrD,MAAM,QAAQ,CAAC,iCAAiC,CAAC,CAAC;IACnD,CAAC;CACD;AAED;;GAEG;AACH,MAAM,OAAO,aACZ,SAAQ,WAA8B;IAGtC,IAAW,YAAY;QACtB,MAAM,QAAQ,CAAC,yBAAyB,CAAC,CAAC;IAC3C,CAAC;CACD;AAED;;GAEG;AACH,MAAM,OAAO,UACZ,SAAQ,WAA4D;IAGpE,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC;IAC/B,CAAC;IACM,GAAG,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IACM,GAAG,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAwC,CAAC;IAC1E,CAAC;IACM,QAAQ,CAAC,GAAW;QAC1B,MAAM,QAAQ,CAAC,0BAA0B,CAAC,CAAC;IAC5C,CAAC;IACM,IAAI;QACV,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,EAAgC,CAAC;IAC/D,CAAC;IACM,MAAM;QACZ,MAAM,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IACxC,CAAC;IACM,OAAO;QAGb,MAAM,QAAQ,CAAC,uBAAuB,CAAC,CAAC;IACzC,CAAC;IACM,OAAO,CACb,UAIS,EACT,OAAa;QAEb,MAAM,QAAQ,CAAC,6BAA6B,CAAC,CAAC;IAC/C,CAAC;IACM,GAAG,CAAC,GAAW,EAAE,KAAwD;QAC/E,MAAM,QAAQ,CAAC,qBAAqB,CAAC,CAAC;IACvC,CAAC;IACM,MAAM,CAAC,GAAW;QACxB,MAAM,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IACxC,CAAC;IAED,IAAW,QAAQ;QAGlB,MAAM,QAAQ,CAAC,+BAA+B,CAAC,CAAC;IACjD,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QAGvB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAEe,aAAa;QAC5B,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;CACD;AAED;;GAEG;AACH,MAAM,OAAO,YACZ,SAAQ,WAAuC;IAG/C,IAAW,OAAO;QACjB,MAAM,QAAQ,CAAC,kCAAkC,CAAC,CAAC;IACpD,CAAC;IAED,IAAW,YAAY;QACtB,MAAM,QAAQ,CAAC,wCAAwC,CAAC,CAAC;IAC1D,CAAC;CACD;AAED,SAAS,QAAQ,CAAC,OAAgB;IACjC,OAAO,IAAI,KAAK,CACf,GACC,OAAO,IAAI,WACZ,4EAA4E,CAC5E,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { FieldKey, TreeNodeSchemaIdentifier } from \"../core/index.js\";\nimport {\n\tEditableTreeEvents,\n\tFlexFieldNodeSchema,\n\tFlexTreeContext,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeTypedNode,\n\tFlexTreeEntityKind,\n\tFlexTreeMapNode,\n\tFlexTreeObjectNode,\n\tFlexTreeTypedField,\n\tFlexTreeUnboxField,\n\tFlexibleFieldContent,\n\tflexTreeMarker,\n\tonNextChange,\n\tLocalNodeKey,\n\tFlexMapNodeSchema,\n\tFlexObjectNodeSchema,\n\tFlexTreeNodeSchema,\n\tTreeStatus,\n\tFlexTreeFieldNode,\n} from \"../feature-libraries/index.js\";\nimport { fail } from \"../util/index.js\";\nimport { InsertableContent } from \"./proxies.js\";\n\n/** Stores the content of the raw node, i.e. the data that was passed to the factory */\nconst nodeContent = Symbol();\ninterface HasNodeContent<T> {\n\t[nodeContent]: T;\n}\n\n/**\n * Retrieve the content of a raw object node created via {@link createRawNode}.\n * @remarks\n * Raw nodes should only ever be processed as input once.\n * Therefore, this extraction removes the content from the node and will error if called twice on the same node.\n */\nexport function extractRawNodeContent(node: object): object | undefined {\n\tif (node instanceof RawTreeNode) {\n\t\tconst content = node[nodeContent] ?? fail(\"Node content may only be extracted once\");\n\t\tReflect.deleteProperty(node, nodeContent);\n\t\treturn content as object;\n\t}\n\n\treturn undefined;\n}\n\n/**\n * Creates a node that pretends to satisfy the given schema while wrapping the given node content.\n * Retrieve the node content via {@link extractRawNodeContent}.\n *\n * @remarks This is useful for creating \"raw\" nodes: nodes which capture data about a pending insertion but are not yet inserted.\n * These raw nodes can be then used on the right-hand side of an assignment (via `=`) to the tree.\n * However, many of their properties and methods are currently unimplemented and will error if accessed.\n */\nexport function createRawNode(\n\tschema: FlexTreeNodeSchema,\n\tcontent: InsertableContent,\n): RawTreeNode<FlexTreeNodeSchema, InsertableContent> {\n\tif (schema instanceof FlexObjectNodeSchema) {\n\t\treturn new RawObjectNode(schema, content as object);\n\t}\n\tif (schema instanceof FlexMapNodeSchema) {\n\t\treturn new RawMapNode(schema, content as ReadonlyMap<string, InsertableContent>);\n\t}\n\tif (schema instanceof FlexFieldNodeSchema) {\n\t\treturn new RawFieldNode(schema, content);\n\t}\n\tfail(\"Unrecognized schema\");\n}\n\n/**\n * The base implementation of a node created by {@link createRawNode}.\n */\nexport abstract class RawTreeNode<TSchema extends FlexTreeNodeSchema, TContent>\n\timplements FlexTreeNode, HasNodeContent<TContent>\n{\n\tpublic readonly [flexTreeMarker] = FlexTreeEntityKind.Node as const;\n\tpublic readonly [nodeContent]: TContent;\n\n\tpublic readonly type: TreeNodeSchemaIdentifier;\n\tpublic constructor(\n\t\tpublic readonly schema: TSchema,\n\t\tcontent: TContent,\n\t) {\n\t\tthis.type = schema.name;\n\t\tthis[nodeContent] = content;\n\t}\n\n\tpublic get context(): FlexTreeContext {\n\t\tthrow rawError(\"Getting context\");\n\t}\n\n\tpublic get parentField(): { parent: FlexTreeField; index: number } {\n\t\tthrow rawError(\"Accessing parentage\");\n\t}\n\n\tpublic is<TSchemaInner extends FlexTreeNodeSchema>(\n\t\tschema: TSchemaInner,\n\t): this is FlexTreeTypedNode<TSchemaInner> {\n\t\treturn (schema as unknown) === this.schema;\n\t}\n\n\tpublic tryGetField(key: FieldKey): FlexTreeField | undefined {\n\t\tthrow rawError(\"Reading fields\");\n\t}\n\n\tpublic boxedIterator(): IterableIterator<FlexTreeField> {\n\t\tthrow rawError(\"Boxed iteration\");\n\t}\n\n\tpublic treeStatus(): TreeStatus {\n\t\t// TODO: We could add a new TreeStatus for \"raw\" nodes.\n\t\tthrow rawError(\"Status querying\");\n\t}\n\n\tpublic value: undefined;\n\n\tpublic on<K extends keyof EditableTreeEvents>(\n\t\teventName: K,\n\t\tlistener: EditableTreeEvents[K],\n\t): () => void {\n\t\tthrow rawError(\"Event registration\");\n\t}\n\n\tpublic [onNextChange](fn: (node: FlexTreeNode) => void): () => void {\n\t\tthrow rawError(\"onNextChange event registration\");\n\t}\n}\n\n/**\n * The implementation of an object node created by {@link createRawNode}.\n */\nexport class RawObjectNode<TSchema extends FlexObjectNodeSchema, TContent extends object>\n\textends RawTreeNode<TSchema, TContent>\n\timplements FlexTreeObjectNode\n{\n\tpublic get localNodeKey(): LocalNodeKey | undefined {\n\t\tthrow rawError(\"Reading local node keys\");\n\t}\n}\n\n/**\n * The implementation of a map node created by {@link createRawNode}.\n */\nexport class RawMapNode<TSchema extends FlexMapNodeSchema>\n\textends RawTreeNode<TSchema, ReadonlyMap<string, InsertableContent>>\n\timplements FlexTreeMapNode<TSchema>\n{\n\tpublic get size(): number {\n\t\treturn this[nodeContent].size;\n\t}\n\tpublic has(key: string): boolean {\n\t\treturn this[nodeContent].has(key);\n\t}\n\tpublic get(key: string): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\treturn this[nodeContent].get(key) as FlexTreeUnboxField<TSchema[\"info\"]>;\n\t}\n\tpublic getBoxed(key: string): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading boxed map values\");\n\t}\n\tpublic keys(): IterableIterator<FieldKey> {\n\t\treturn this[nodeContent].keys() as IterableIterator<FieldKey>;\n\t}\n\tpublic values(): IterableIterator<FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">> {\n\t\tthrow rawError(\"Iterating map values\");\n\t}\n\tpublic entries(): IterableIterator<\n\t\t[FieldKey, FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">]\n\t> {\n\t\tthrow rawError(\"Iterating map entries\");\n\t}\n\tpublic forEach(\n\t\tcallbackFn: (\n\t\t\tvalue: FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">,\n\t\t\tkey: FieldKey,\n\t\t\tmap: FlexTreeMapNode<TSchema>,\n\t\t) => void,\n\t\tthisArg?: any,\n\t): void {\n\t\tthrow rawError(\"Iterating maps with forEach\");\n\t}\n\tpublic set(key: string, value: FlexibleFieldContent<TSchema[\"info\"]> | undefined): void {\n\t\tthrow rawError(\"Setting a map entry\");\n\t}\n\tpublic delete(key: string): void {\n\t\tthrow rawError(\"Deleting a map entry\");\n\t}\n\n\tpublic get asObject(): {\n\t\treadonly [P in FieldKey]?: FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">;\n\t} {\n\t\tthrow rawError(\"Converting a map to an object\");\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<\n\t\t[FieldKey, FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">]\n\t> {\n\t\treturn this.entries();\n\t}\n\n\tpublic override boxedIterator(): IterableIterator<FlexTreeTypedField<TSchema[\"info\"]>> {\n\t\tthrow rawError(\"Boxed iteration\");\n\t}\n}\n\n/**\n * The implementation of a field node created by {@link createRawNode}.\n */\nexport class RawFieldNode<TSchema extends FlexFieldNodeSchema>\n\textends RawTreeNode<TSchema, InsertableContent>\n\timplements FlexTreeFieldNode<TSchema>\n{\n\tpublic get content(): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading content of an array node\");\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading boxed content of an array node\");\n\t}\n}\n\nfunction rawError(message?: string): Error {\n\treturn new Error(\n\t\t`${\n\t\t\tmessage ?? \"Operation\"\n\t\t} is not supported on content which has not yet been inserted into the tree`,\n\t);\n}\n"]}
+{"version":3,"file":"rawNode.js","sourceRoot":"","sources":["../../src/simple-tree/rawNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;;AAGH,OAAO,EAEN,kBAAkB,EAOlB,cAAc,GACd,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAExC,uFAAuF;AACvF,MAAM,CAAC,MAAM,WAAW,GAAG,MAAM,EAAE,CAAC;AAKpC;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAY;IACjD,IAAI,IAAI,YAAY,WAAW,EAAE;QAChC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,yCAAyC,CAAC,CAAC;QACrF,OAAO,CAAC,cAAc,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1C,OAAO,OAAiB,CAAC;KACzB;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAgB,WAAW;IAUhC,YACiB,MAAe,EAC/B,OAAiB;QADD,WAAM,GAAN,MAAM,CAAS;QARhB,QAAgB,GAAG,kBAAkB,CAAC,IAAa,CAAC;QAGpE,sCAA4B;QAQ3B,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACxB,IAAI,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC;IAC7B,CAAC;IAED,IAAW,OAAO;QACjB,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAED,IAAW,WAAW;QACrB,MAAM,QAAQ,CAAC,qBAAqB,CAAC,CAAC;IACvC,CAAC;IAEM,EAAE,CACR,MAAoB;QAEpB,OAAQ,MAAkB,KAAK,IAAI,CAAC,MAAM,CAAC;IAC5C,CAAC;IAEM,WAAW,CAAC,GAAa;QAC/B,MAAM,QAAQ,CAAC,gBAAgB,CAAC,CAAC;IAClC,CAAC;IAEM,QAAQ,CAAC,GAAW;QAC1B,MAAM,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IACxC,CAAC;IAEM,aAAa;QACnB,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAEM,UAAU;QAChB,uDAAuD;QACvD,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAIM,EAAE,CACR,SAAY,EACZ,QAA+B;QAE/B,MAAM,QAAQ,CAAC,oBAAoB,CAAC,CAAC;IACtC,CAAC;IAED,IAAW,UAAU;QACpB,MAAM,QAAQ,CAAC,qBAAqB,CAAC,CAAC;IACvC,CAAC;CACD;0CA1DiB,cAAc;AA4DhC,MAAM,UAAU,QAAQ,CAAC,OAAgB;IACxC,OAAO,IAAI,KAAK,CACf,GACC,OAAO,IAAI,WACZ,4EAA4E,CAC5E,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Anchor, AnchorNode, FieldKey, TreeNodeSchemaIdentifier } from \"../core/index.js\";\nimport {\n\tFlexTreeContext,\n\tFlexTreeEntityKind,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeNodeEvents,\n\tFlexTreeNodeSchema,\n\tFlexTreeTypedNode,\n\tTreeStatus,\n\tflexTreeMarker,\n} from \"../feature-libraries/index.js\";\nimport { fail } from \"../util/index.js\";\n\n/** Stores the content of the raw node, i.e. the data that was passed to the factory */\nexport const nodeContent = Symbol();\ninterface HasNodeContent<T> {\n\t[nodeContent]: T;\n}\n\n/**\n * Retrieve the content of a raw object node created via {@link createRawNode}.\n * @remarks\n * Raw nodes should only ever be processed as input once.\n * Therefore, this extraction removes the content from the node and will error if called twice on the same node.\n */\nexport function extractRawNodeContent(node: object): object | undefined {\n\tif (node instanceof RawTreeNode) {\n\t\tconst content = node[nodeContent] ?? fail(\"Node content may only be extracted once\");\n\t\tReflect.deleteProperty(node, nodeContent);\n\t\treturn content as object;\n\t}\n\n\treturn undefined;\n}\n\n/**\n * Node that pretends to satisfy the given schema while wrapping the given node content.\n * Retrieve the node content via {@link extractRawNodeContent}.\n *\n * @remarks This is useful for creating \"raw\" nodes: nodes which capture data about a pending insertion but are not yet inserted.\n * These raw nodes can be then used on the right-hand side of an assignment (via `=`) to the tree.\n * However, many of their properties and methods are currently unimplemented and will error if accessed.\n */\nexport abstract class RawTreeNode<TSchema extends FlexTreeNodeSchema, TContent>\n\timplements FlexTreeNode, HasNodeContent<TContent>\n{\n\tpublic readonly [flexTreeMarker] = FlexTreeEntityKind.Node as const;\n\tpublic readonly [nodeContent]: TContent;\n\n\t#anchor: Anchor | undefined;\n\n\tpublic readonly type: TreeNodeSchemaIdentifier;\n\n\tpublic constructor(\n\t\tpublic readonly schema: TSchema,\n\t\tcontent: TContent,\n\t) {\n\t\tthis.type = schema.name;\n\t\tthis[nodeContent] = content;\n\t}\n\n\tpublic get context(): FlexTreeContext {\n\t\tthrow rawError(\"Getting context\");\n\t}\n\n\tpublic get parentField(): { parent: FlexTreeField; index: number } {\n\t\tthrow rawError(\"Accessing parentage\");\n\t}\n\n\tpublic is<TSchemaInner extends FlexTreeNodeSchema>(\n\t\tschema: TSchemaInner,\n\t): this is FlexTreeTypedNode<TSchemaInner> {\n\t\treturn (schema as unknown) === this.schema;\n\t}\n\n\tpublic tryGetField(key: FieldKey): FlexTreeField | undefined {\n\t\tthrow rawError(\"Reading fields\");\n\t}\n\n\tpublic getBoxed(key: string): never {\n\t\tthrow rawError(\"Reading boxed fields\");\n\t}\n\n\tpublic boxedIterator(): IterableIterator<FlexTreeField> {\n\t\tthrow rawError(\"Boxed iteration\");\n\t}\n\n\tpublic treeStatus(): TreeStatus {\n\t\t// TODO: We could add a new TreeStatus for \"raw\" nodes.\n\t\tthrow rawError(\"Status querying\");\n\t}\n\n\tpublic value: undefined;\n\n\tpublic on<K extends keyof FlexTreeNodeEvents>(\n\t\teventName: K,\n\t\tlistener: FlexTreeNodeEvents[K],\n\t): () => void {\n\t\tthrow rawError(\"Event registration\");\n\t}\n\n\tpublic get anchorNode(): AnchorNode {\n\t\tthrow rawError(\"Reading anchor node\");\n\t}\n}\n\nexport function rawError(message?: string): Error {\n\treturn new Error(\n\t\t`${\n\t\t\tmessage ?? \"Operation\"\n\t\t} is not supported on content which has not yet been inserted into the tree`,\n\t);\n}\n"]}

package/lib/simple-tree/schemaCaching.d.ts

@@ -0,0 +1,26 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { type FlexFieldSchema, type FlexTreeNodeSchema, TreeNodeSchemaBase } from "../feature-libraries/index.js";
+import { FieldSchema, type ImplicitFieldSchema, TreeNodeSchema } from "./schemaTypes.js";
+export declare function cachedFlexSchemaFromClassSchema(schema: TreeNodeSchema): TreeNodeSchemaBase | undefined;
+export declare function setFlexSchemaFromClassSchema(simple: TreeNodeSchema, flex: TreeNodeSchemaBase): void;
+/**
+ * Gets the {@link TreeNodeSchema} cached on the provided {@link FlexTreeNodeSchema | flexSchema}.
+ * Returns `undefined` if no cached value is found.
+ */
+export declare function tryGetSimpleNodeSchema(flexSchema: FlexTreeNodeSchema): TreeNodeSchema | undefined;
+/**
+ * Gets the {@link TreeNodeSchema} cached on the provided {@link FlexTreeNodeSchema | flexSchema}.
+ * Fails if no cached value is found.
+ */
+export declare function getSimpleNodeSchema(flexSchema: FlexTreeNodeSchema): TreeNodeSchema;
+/**
+ * Gets the {@link FieldSchema} which corresponds with the provided {@link FlexFieldSchema | flexSchema}.
+ * Caches the result on the provided `flexSchema` for future access.
+ * @param flexSchema - The flex schema on which the result will be cached.
+ * @param implicitSimpleSchema - The allowed types from which the `FieldSchema` will be derived.
+ */
+export declare function getSimpleFieldSchema(flexSchema: FlexFieldSchema, implicitSimpleSchema: ImplicitFieldSchema): FieldSchema;
+//# sourceMappingURL=schemaCaching.d.ts.map

package/lib/simple-tree/schemaCaching.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schemaCaching.d.ts","sourceRoot":"","sources":["../../src/simple-tree/schemaCaching.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EACN,KAAK,eAAe,EACpB,KAAK,kBAAkB,EACvB,kBAAkB,EAClB,MAAM,+BAA+B,CAAC;AAGvC,OAAO,EACN,WAAW,EACX,KAAK,mBAAmB,EACxB,cAAc,EAEd,MAAM,kBAAkB,CAAC;AAkB1B,wBAAgB,+BAA+B,CAC9C,MAAM,EAAE,cAAc,GACpB,kBAAkB,GAAG,SAAS,CAEhC;AAED,wBAAgB,4BAA4B,CAC3C,MAAM,EAAE,cAAc,EACtB,IAAI,EAAE,kBAAkB,GACtB,IAAI,CAKN;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,UAAU,EAAE,kBAAkB,GAAG,cAAc,GAAG,SAAS,CAKjG;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,kBAAkB,GAAG,cAAc,CAElF;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CACnC,UAAU,EAAE,eAAe,EAC3B,oBAAoB,EAAE,mBAAmB,GACvC,WAAW,CAQb"}

package/lib/simple-tree/schemaCaching.js

@@ -0,0 +1,61 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils/internal";
+import { fail } from "../util/index.js";
+import { normalizeFieldSchema, } from "./schemaTypes.js";
+/**
+ * A symbol for storing FlexTreeSchema on TreeNodeSchema.
+ * Eagerly set on leaves, and lazily set for other cases.
+ */
+const flexSchemaSymbol = Symbol(`flexSchema`);
+/**
+ * A symbol for storing TreeNodeSchema on FlexTreeNode's schema.
+ */
+const simpleNodeSchemaSymbol = Symbol(`simpleNodeSchema`);
+/**
+ * A symbol for storing {@link FieldSchema}s on a {@link FlexFieldSchema}.
+ */
+const simpleFieldSchemaSymbol = Symbol(`simpleFieldSchema`);
+export function cachedFlexSchemaFromClassSchema(schema) {
+    return schema[flexSchemaSymbol];
+}
+export function setFlexSchemaFromClassSchema(simple, flex) {
+    assert(!(flexSchemaSymbol in simple), 0x91f /* simple schema already marked */);
+    assert(!(simpleNodeSchemaSymbol in flex), 0x920 /* flex schema already marked */);
+    simple[flexSchemaSymbol] = flex;
+    flex[simpleNodeSchemaSymbol] = simple;
+}
+/**
+ * Gets the {@link TreeNodeSchema} cached on the provided {@link FlexTreeNodeSchema | flexSchema}.
+ * Returns `undefined` if no cached value is found.
+ */
+export function tryGetSimpleNodeSchema(flexSchema) {
+    if (simpleNodeSchemaSymbol in flexSchema) {
+        return flexSchema[simpleNodeSchemaSymbol];
+    }
+    return undefined;
+}
+/**
+ * Gets the {@link TreeNodeSchema} cached on the provided {@link FlexTreeNodeSchema | flexSchema}.
+ * Fails if no cached value is found.
+ */
+export function getSimpleNodeSchema(flexSchema) {
+    return tryGetSimpleNodeSchema(flexSchema) ?? fail("missing simple schema");
+}
+/**
+ * Gets the {@link FieldSchema} which corresponds with the provided {@link FlexFieldSchema | flexSchema}.
+ * Caches the result on the provided `flexSchema` for future access.
+ * @param flexSchema - The flex schema on which the result will be cached.
+ * @param implicitSimpleSchema - The allowed types from which the `FieldSchema` will be derived.
+ */
+export function getSimpleFieldSchema(flexSchema, implicitSimpleSchema) {
+    if (simpleFieldSchemaSymbol in flexSchema) {
+        return flexSchema[simpleFieldSchemaSymbol];
+    }
+    const fieldSchema = normalizeFieldSchema(implicitSimpleSchema);
+    flexSchema[simpleFieldSchemaSymbol] = fieldSchema;
+    return fieldSchema;
+}
+//# sourceMappingURL=schemaCaching.js.map

package/lib/simple-tree/schemaCaching.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schemaCaching.js","sourceRoot":"","sources":["../../src/simple-tree/schemaCaching.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qCAAqC,CAAC;AAO7D,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAExC,OAAO,EAIN,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAE1B;;;GAGG;AACH,MAAM,gBAAgB,GAAkB,MAAM,CAAC,YAAY,CAAC,CAAC;AAE7D;;GAEG;AACH,MAAM,sBAAsB,GAAkB,MAAM,CAAC,kBAAkB,CAAC,CAAC;AAEzE;;GAEG;AACH,MAAM,uBAAuB,GAAkB,MAAM,CAAC,mBAAmB,CAAC,CAAC;AAE3E,MAAM,UAAU,+BAA+B,CAC9C,MAAsB;IAEtB,OAAQ,MAAc,CAAC,gBAAgB,CAAmC,CAAC;AAC5E,CAAC;AAED,MAAM,UAAU,4BAA4B,CAC3C,MAAsB,EACtB,IAAwB;IAExB,MAAM,CAAC,CAAC,CAAC,gBAAgB,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;IAChF,MAAM,CAAC,CAAC,CAAC,sBAAsB,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACjF,MAAc,CAAC,gBAAgB,CAAC,GAAG,IAAI,CAAC;IACxC,IAAY,CAAC,sBAAsB,CAAC,GAAG,MAAM,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,UAA8B;IACpE,IAAI,sBAAsB,IAAI,UAAU,EAAE;QACzC,OAAO,UAAU,CAAC,sBAAsB,CAAmB,CAAC;KAC5D;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,UAA8B;IACjE,OAAO,sBAAsB,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,uBAAuB,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CACnC,UAA2B,EAC3B,oBAAyC;IAEzC,IAAI,uBAAuB,IAAI,UAAU,EAAE;QAC1C,OAAO,UAAU,CAAC,uBAAuB,CAAgB,CAAC;KAC1D;IAED,MAAM,WAAW,GAAG,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IAC9D,UAAkB,CAAC,uBAAuB,CAAC,GAAG,WAAW,CAAC;IAC3D,OAAO,WAAW,CAAC;AACpB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\n\nimport {\n\ttype FlexFieldSchema,\n\ttype FlexTreeNodeSchema,\n\tTreeNodeSchemaBase,\n} from \"../feature-libraries/index.js\";\nimport { fail } from \"../util/index.js\";\n\nimport {\n\tFieldSchema,\n\ttype ImplicitFieldSchema,\n\tTreeNodeSchema,\n\tnormalizeFieldSchema,\n} from \"./schemaTypes.js\";\n\n/**\n * A symbol for storing FlexTreeSchema on TreeNodeSchema.\n * Eagerly set on leaves, and lazily set for other cases.\n */\nconst flexSchemaSymbol: unique symbol = Symbol(`flexSchema`);\n\n/**\n * A symbol for storing TreeNodeSchema on FlexTreeNode's schema.\n */\nconst simpleNodeSchemaSymbol: unique symbol = Symbol(`simpleNodeSchema`);\n\n/**\n * A symbol for storing {@link FieldSchema}s on a {@link FlexFieldSchema}.\n */\nconst simpleFieldSchemaSymbol: unique symbol = Symbol(`simpleFieldSchema`);\n\nexport function cachedFlexSchemaFromClassSchema(\n\tschema: TreeNodeSchema,\n): TreeNodeSchemaBase | undefined {\n\treturn (schema as any)[flexSchemaSymbol] as TreeNodeSchemaBase | undefined;\n}\n\nexport function setFlexSchemaFromClassSchema(\n\tsimple: TreeNodeSchema,\n\tflex: TreeNodeSchemaBase,\n): void {\n\tassert(!(flexSchemaSymbol in simple), 0x91f /* simple schema already marked */);\n\tassert(!(simpleNodeSchemaSymbol in flex), 0x920 /* flex schema already marked */);\n\t(simple as any)[flexSchemaSymbol] = flex;\n\t(flex as any)[simpleNodeSchemaSymbol] = simple;\n}\n\n/**\n * Gets the {@link TreeNodeSchema} cached on the provided {@link FlexTreeNodeSchema | flexSchema}.\n * Returns `undefined` if no cached value is found.\n */\nexport function tryGetSimpleNodeSchema(flexSchema: FlexTreeNodeSchema): TreeNodeSchema | undefined {\n\tif (simpleNodeSchemaSymbol in flexSchema) {\n\t\treturn flexSchema[simpleNodeSchemaSymbol] as TreeNodeSchema;\n\t}\n\treturn undefined;\n}\n\n/**\n * Gets the {@link TreeNodeSchema} cached on the provided {@link FlexTreeNodeSchema | flexSchema}.\n * Fails if no cached value is found.\n */\nexport function getSimpleNodeSchema(flexSchema: FlexTreeNodeSchema): TreeNodeSchema {\n\treturn tryGetSimpleNodeSchema(flexSchema) ?? fail(\"missing simple schema\");\n}\n\n/**\n * Gets the {@link FieldSchema} which corresponds with the provided {@link FlexFieldSchema | flexSchema}.\n * Caches the result on the provided `flexSchema` for future access.\n * @param flexSchema - The flex schema on which the result will be cached.\n * @param implicitSimpleSchema - The allowed types from which the `FieldSchema` will be derived.\n */\nexport function getSimpleFieldSchema(\n\tflexSchema: FlexFieldSchema,\n\timplicitSimpleSchema: ImplicitFieldSchema,\n): FieldSchema {\n\tif (simpleFieldSchemaSymbol in flexSchema) {\n\t\treturn flexSchema[simpleFieldSchemaSymbol] as FieldSchema;\n\t}\n\n\tconst fieldSchema = normalizeFieldSchema(implicitSimpleSchema);\n\t(flexSchema as any)[simpleFieldSchemaSymbol] = fieldSchema;\n\treturn fieldSchema;\n}\n"]}

package/lib/simple-tree/schemaCreationUtilities.d.ts

@@ -4,8 +4,9 @@
  */
 import { EmptyObject } from "../feature-libraries/index.js";
 import { SchemaFactory, type ScopedSchemaName } from "./schemaFactory.js";
-import { InsertableObjectFromSchemaRecord, NodeKind, ObjectFromSchemaRecord, TreeNodeSchemaClass } from "./schemaTypes.js";
+import { NodeKind, TreeNodeSchemaClass } from "./schemaTypes.js";
 import { TreeNode } from "./types.js";
+import { InsertableObjectFromSchemaRecord, ObjectFromSchemaRecord } from "./objectNode.js";
 /**
  * Create a schema for a node with no state.
  * @remarks

package/lib/simple-tree/schemaCreationUtilities.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schemaCreationUtilities.d.ts","sourceRoot":"","sources":["../../src/simple-tree/schemaCreationUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,KAAK,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EACN,gCAAgC,EAEhC,QAAQ,EACR,sBAAsB,EACtB,mBAAmB,EACnB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,MAAM,SAAS,MAAM,EAAE,KAAK,SAAS,MAAM,GAAG,MAAM,EACnF,OAAO,EAAE,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,EACrC,IAAI,EAAE,KAAK;oBAa8C,KAAK;;oBAAL,KAAK;GAiB9D;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,SAAS,CAAC,MAAM,SAAS,MAAM,EAAE,KAAK,CAAC,KAAK,SAAS,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1F,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,EAC9B,OAAO,EAAE,KAAK;;;;;;MAkCd;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,SAAS,MAAM,EAAE,OAAO,EAC7D,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAC3B,OAAO,EAAE,CAEX;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,eAAe,CAAC,MAAM,SAAS,MAAM,EAAE,KAAK,CAAC,OAAO,SAAS,MAAM,EAClF,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,EAC9B,OAAO,EAAE,OAAO,EAAE;;;;;;IAwBlB"}
+{"version":3,"file":"schemaCreationUtilities.d.ts","sourceRoot":"","sources":["../../src/simple-tree/schemaCreationUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAG5D,OAAO,EAAE,aAAa,EAAE,KAAK,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAkB,QAAQ,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,gCAAgC,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAE3F;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,MAAM,SAAS,MAAM,EAAE,KAAK,SAAS,MAAM,GAAG,MAAM,EACnF,OAAO,EAAE,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,EACrC,IAAI,EAAE,KAAK;oBAa8C,KAAK;;oBAAL,KAAK;GAiB9D;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,SAAS,CAAC,MAAM,SAAS,MAAM,EAAE,KAAK,CAAC,KAAK,SAAS,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1F,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,EAC9B,OAAO,EAAE,KAAK;;;;;;MAkCd;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,SAAS,MAAM,EAAE,OAAO,EAC7D,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAC3B,OAAO,EAAE,CAEX;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,eAAe,CAAC,MAAM,SAAS,MAAM,EAAE,KAAK,CAAC,OAAO,SAAS,MAAM,EAClF,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,EAC9B,OAAO,EAAE,OAAO,EAAE;;;;;;IAwBlB"}

package/lib/simple-tree/schemaCreationUtilities.js

@@ -2,7 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { UsageError } from "@fluidframework/telemetry-utils";
+import { UsageError } from "@fluidframework/telemetry-utils/internal";
 import { fail } from "../util/index.js";
 /**
  * Create a schema for a node with no state.

package/lib/simple-tree/schemaCreationUtilities.js.map

@@ -1 +1 @@
-{"version":3,"file":"schemaCreationUtilities.js","sourceRoot":"","sources":["../../src/simple-tree/schemaCreationUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAC7D,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAYxC;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC9B,OAAqC,EACrC,IAAW;IAEX,MAAM,eAAgB,SAAQ,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,YAAmB,IAAkB;YACpC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACnB,CAAC;QACD,IAAW,KAAK;YACf,OAAO,IAAI,CAAC;QACb,CAAC;KACD;IAMD,8IAA8I;IAC9I,2CAA2C;IAC3C,yHAAyH;IACzH,iDAAiD;IACjD,qFAAqF;IACrF,MAAM,QAAQ,GAOU,eAAe,CAAC;IAExC,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,SAAS,CACxB,OAA8B,EAC9B,OAAc;IAGd,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAa,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAGlF,CAAC;IAEF,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM,EAAE;QACnC,MAAM,IAAI,UAAU,CAAC,iDAAiD,CAAC,CAAC;KACxE;IAOD,MAAM,UAAU,GAAG,CAAwB,KAAa,EAAE,EAAE;QAC3D,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAElE,CAAC;IACH,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,UAAsC,CAAC;IACnD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;QACnD,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE;YAC/B,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,KAAK;YACf,KAAK,EAAE,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC;SACtC,CAAC,CAAC;KACH;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAChC,MAA6B;IAE7B,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,eAAe,CAC9B,OAA8B,EAC9B,OAAkB;IAElB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC/B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,MAAM,EAAE;QAClC,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;KACtE;IAGD,MAAM,UAAU,GAAG,CAAyB,KAAa,EAAE,EAAE;QAC5D,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAEvB,CAAC;IACH,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,UAAsC,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;QAC3B,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE;YAChC,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,KAAK;YACf,KAAK,EAAE,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC;SACrC,CAAC,CAAC;KACH;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,qEAAqE;AACrE,kEAAkE;AAClE,4GAA4G;AAC5G,SAAS,iBAAiB,CACzB,OAA8B,EAC9B,OAAgB;IAEhB,MAAM,UAAU,GAEZ,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;QAC3B,MAAM,CAAC,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE;YACvC,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,KAAK;YACf,KAAK,EAAE,IAAI;SACX,CAAC,CAAC;KACH;IAED,OAAO,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACvC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { UsageError } from \"@fluidframework/telemetry-utils\";\nimport { fail } from \"../util/index.js\";\nimport { EmptyObject } from \"../feature-libraries/index.js\";\nimport { SchemaFactory, type ScopedSchemaName } from \"./schemaFactory.js\";\nimport {\n\tInsertableObjectFromSchemaRecord,\n\tNodeFromSchema,\n\tNodeKind,\n\tObjectFromSchemaRecord,\n\tTreeNodeSchemaClass,\n} from \"./schemaTypes.js\";\nimport { TreeNode } from \"./types.js\";\n\n/**\n * Create a schema for a node with no state.\n * @remarks\n * This is commonly used in unions when the only information needed is which kind of node the value is.\n * Enums are a common example of this pattern.\n * @internal\n */\nexport function singletonSchema<TScope extends string, TName extends string | number>(\n\tfactory: SchemaFactory<TScope, TName>,\n\tname: TName,\n) {\n\tclass SingletonSchema extends factory.object(name, {}) {\n\t\tpublic constructor(data?: EmptyObject) {\n\t\t\tsuper(data ?? {});\n\t\t}\n\t\tpublic get value(): TName {\n\t\t\treturn name;\n\t\t}\n\t}\n\n\ttype NodeType = object &\n\t\tTreeNode &\n\t\tObjectFromSchemaRecord<EmptyObject> & { readonly value: TName };\n\n\t// Returning SingletonSchema without a type conversion results in TypeScript generating something like `readonly \"__#124291@#brand\": unknown;`\n\t// for the private brand field of TreeNode.\n\t// This numeric id doesn't seem to be stable over incremental builds, and thus causes diffs if the API extractor reports.\n\t// This is avoided by doing this type conversion.\n\t// The conversion is done via assignment instead of `as` to get stronger type safety.\n\tconst toReturn: TreeNodeSchemaClass<\n\t\tScopedSchemaName<TScope, TName>,\n\t\tNodeKind.Object,\n\t\tNodeType,\n\t\tobject & InsertableObjectFromSchemaRecord<EmptyObject>,\n\t\ttrue\n\t> &\n\t\t(new () => NodeType) = SingletonSchema;\n\n\treturn toReturn;\n}\n\n/**\n * Converts an enum into a collection of schema which can be used in a union.\n * @remarks\n * Currently only supports `string` enums.\n * @example\n * ```typescript\n * enum Mode {\n * \ta = \"A\",\n * \tb = \"B\",\n * }\n * const ModeNodes = adaptEnum(schema, Mode);\n * type ModeNodes = NodeFromSchema<(typeof ModeNodes)[keyof typeof ModeNodes]>;\n * const nodeFromString: ModeNodes = ModeNodes(Mode.a);\n * const nodeFromSchema: ModeNodes = new ModeNodes.a();\n * const nameFromNode: Mode = nodeFromSchema.value;\n * class Parent extends schemaFactory.object(\"Parent\", {\n * \tmode: typedObjectValues(ModeNodes),\n * }) {}\n * ```\n * @privateRemarks\n * TODO:\n * Extends this to support numeric enums.\n * Maybe require an explicit nested scope to group them under, or at least a warning about collisions.\n * Maybe just provide `SchemaFactory.nested` to east creating nested scopes?\n * @internal\n */\nexport function adaptEnum<TScope extends string, const TEnum extends Record<string, string>>(\n\tfactory: SchemaFactory<TScope>,\n\tmembers: TEnum,\n) {\n\ttype Values = TEnum[keyof TEnum];\n\tconst values = Object.values(members) as Values[];\n\tconst inverse = new Map(Object.entries(members).map(([key, value]) => [value, key])) as Map<\n\t\tValues,\n\t\tkeyof TEnum\n\t>;\n\n\tif (inverse.size !== values.length) {\n\t\tthrow new UsageError(\"All members of enums must have distinct values.\");\n\t}\n\n\ttype TOut = {\n\t\treadonly [Property in keyof TEnum]: ReturnType<\n\t\t\ttypeof singletonSchema<TScope, TEnum[Property]>\n\t\t>;\n\t};\n\tconst factoryOut = <TValue extends Values>(value: TValue) => {\n\t\treturn new out[inverse.get(value) ?? fail(\"missing enum value\")]({}) as NodeFromSchema<\n\t\t\tReturnType<typeof singletonSchema<TScope, TValue>>\n\t\t>;\n\t};\n\tconst out = factoryOut as typeof factoryOut & TOut;\n\tfor (const [key, value] of Object.entries(members)) {\n\t\tObject.defineProperty(out, key, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\twritable: false,\n\t\t\tvalue: singletonSchema(factory, value),\n\t\t});\n\t}\n\n\treturn out;\n}\n\n/**\n * `Object.values`, but with more specific types.\n * @internal\n */\nexport function typedObjectValues<TKey extends string, TValues>(\n\tobject: Record<TKey, TValues>,\n): TValues[] {\n\treturn Object.values(object);\n}\n\n/**\n * Converts an array of distinct strings into a collection of schema which can be used like an enum style union.\n * @remarks\n * The returned collection is also a function which can be used to convert strings into {@link Unhydrated} nodes in the union.\n * Each node type has a `.value` getter which returns the associated string.\n *\n * The produced nodes use the provided strings as their `name`, and don't store any data beyond that.\n * @example\n * ```typescript\n * const Mode = enumFromStrings(schemaFactory, [\"Fun\", \"Cool\"]);\n * type Mode = NodeFromSchema<(typeof Mode)[keyof typeof Mode]>;\n * const nodeFromString: Mode = Mode(\"Fun\");\n * const nodeFromSchema: Mode = new Mode.Fun();\n * const nameFromNode = nodeFromSchema.value;\n *\n * class Parent extends schemaFactory.object(\"Parent\", { mode: typedObjectValues(Mode) }) {}\n * ```\n * @internal\n */\nexport function enumFromStrings<TScope extends string, const Members extends string>(\n\tfactory: SchemaFactory<TScope>,\n\tmembers: Members[],\n) {\n\tconst names = new Set(members);\n\tif (names.size !== members.length) {\n\t\tthrow new UsageError(\"All members of enums must have distinct names\");\n\t}\n\n\ttype TOut = Record<Members, ReturnType<typeof singletonSchema<TScope, Members>>>;\n\tconst factoryOut = <TValue extends Members>(value: TValue) => {\n\t\treturn new out[value]({}) as NodeFromSchema<\n\t\t\tReturnType<typeof singletonSchema<TScope, TValue>>\n\t\t>;\n\t};\n\tconst out = factoryOut as typeof factoryOut & TOut;\n\tfor (const name of members) {\n\t\tObject.defineProperty(out, name, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\twritable: false,\n\t\t\tvalue: singletonSchema(factory, name),\n\t\t});\n\t}\n\n\treturn out;\n}\n\n// TODO: Why does this one generate an invalid d.ts file if exported?\n// Tracked by https://github.com/microsoft/TypeScript/issues/56718\n// TODO: replace enumFromStrings above with this simpler implementation when the TypeScript bug is resolved.\nfunction _enumFromStrings2<TScope extends string, const Members extends readonly string[]>(\n\tfactory: SchemaFactory<TScope>,\n\tmembers: Members,\n) {\n\tconst enumObject: {\n\t\t[key in keyof Members as Members[key] extends string ? Members[key] : string]: Members[key];\n\t} = Object.create(null);\n\tfor (const name of members) {\n\t\tObject.defineProperty(enumObject, name, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\twritable: false,\n\t\t\tvalue: name,\n\t\t});\n\t}\n\n\treturn adaptEnum(factory, enumObject);\n}\n"]}
+{"version":3,"file":"schemaCreationUtilities.js","sourceRoot":"","sources":["../../src/simple-tree/schemaCreationUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAGtE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAOxC;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC9B,OAAqC,EACrC,IAAW;IAEX,MAAM,eAAgB,SAAQ,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,YAAmB,IAAkB;YACpC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACnB,CAAC;QACD,IAAW,KAAK;YACf,OAAO,IAAI,CAAC;QACb,CAAC;KACD;IAMD,8IAA8I;IAC9I,2CAA2C;IAC3C,yHAAyH;IACzH,iDAAiD;IACjD,qFAAqF;IACrF,MAAM,QAAQ,GAOU,eAAe,CAAC;IAExC,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,SAAS,CACxB,OAA8B,EAC9B,OAAc;IAGd,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAa,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAGlF,CAAC;IAEF,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM,EAAE;QACnC,MAAM,IAAI,UAAU,CAAC,iDAAiD,CAAC,CAAC;KACxE;IAOD,MAAM,UAAU,GAAG,CAAwB,KAAa,EAAE,EAAE;QAC3D,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAElE,CAAC;IACH,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,UAAsC,CAAC;IACnD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;QACnD,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE;YAC/B,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,KAAK;YACf,KAAK,EAAE,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC;SACtC,CAAC,CAAC;KACH;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAChC,MAA6B;IAE7B,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,eAAe,CAC9B,OAA8B,EAC9B,OAAkB;IAElB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC/B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,MAAM,EAAE;QAClC,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;KACtE;IAGD,MAAM,UAAU,GAAG,CAAyB,KAAa,EAAE,EAAE;QAC5D,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAEvB,CAAC;IACH,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,UAAsC,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;QAC3B,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE;YAChC,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,KAAK;YACf,KAAK,EAAE,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC;SACrC,CAAC,CAAC;KACH;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,qEAAqE;AACrE,kEAAkE;AAClE,4GAA4G;AAC5G,SAAS,iBAAiB,CACzB,OAA8B,EAC9B,OAAgB;IAEhB,MAAM,UAAU,GAEZ,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;QAC3B,MAAM,CAAC,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE;YACvC,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,KAAK;YACf,KAAK,EAAE,IAAI;SACX,CAAC,CAAC;KACH;IAED,OAAO,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACvC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { UsageError } from \"@fluidframework/telemetry-utils/internal\";\n\nimport { EmptyObject } from \"../feature-libraries/index.js\";\nimport { fail } from \"../util/index.js\";\n\nimport { SchemaFactory, type ScopedSchemaName } from \"./schemaFactory.js\";\nimport { NodeFromSchema, NodeKind, TreeNodeSchemaClass } from \"./schemaTypes.js\";\nimport { TreeNode } from \"./types.js\";\nimport { InsertableObjectFromSchemaRecord, ObjectFromSchemaRecord } from \"./objectNode.js\";\n\n/**\n * Create a schema for a node with no state.\n * @remarks\n * This is commonly used in unions when the only information needed is which kind of node the value is.\n * Enums are a common example of this pattern.\n * @internal\n */\nexport function singletonSchema<TScope extends string, TName extends string | number>(\n\tfactory: SchemaFactory<TScope, TName>,\n\tname: TName,\n) {\n\tclass SingletonSchema extends factory.object(name, {}) {\n\t\tpublic constructor(data?: EmptyObject) {\n\t\t\tsuper(data ?? {});\n\t\t}\n\t\tpublic get value(): TName {\n\t\t\treturn name;\n\t\t}\n\t}\n\n\ttype NodeType = object &\n\t\tTreeNode &\n\t\tObjectFromSchemaRecord<EmptyObject> & { readonly value: TName };\n\n\t// Returning SingletonSchema without a type conversion results in TypeScript generating something like `readonly \"__#124291@#brand\": unknown;`\n\t// for the private brand field of TreeNode.\n\t// This numeric id doesn't seem to be stable over incremental builds, and thus causes diffs if the API extractor reports.\n\t// This is avoided by doing this type conversion.\n\t// The conversion is done via assignment instead of `as` to get stronger type safety.\n\tconst toReturn: TreeNodeSchemaClass<\n\t\tScopedSchemaName<TScope, TName>,\n\t\tNodeKind.Object,\n\t\tNodeType,\n\t\tobject & InsertableObjectFromSchemaRecord<EmptyObject>,\n\t\ttrue\n\t> &\n\t\t(new () => NodeType) = SingletonSchema;\n\n\treturn toReturn;\n}\n\n/**\n * Converts an enum into a collection of schema which can be used in a union.\n * @remarks\n * Currently only supports `string` enums.\n * @example\n * ```typescript\n * enum Mode {\n * \ta = \"A\",\n * \tb = \"B\",\n * }\n * const ModeNodes = adaptEnum(schema, Mode);\n * type ModeNodes = NodeFromSchema<(typeof ModeNodes)[keyof typeof ModeNodes]>;\n * const nodeFromString: ModeNodes = ModeNodes(Mode.a);\n * const nodeFromSchema: ModeNodes = new ModeNodes.a();\n * const nameFromNode: Mode = nodeFromSchema.value;\n * class Parent extends schemaFactory.object(\"Parent\", {\n * \tmode: typedObjectValues(ModeNodes),\n * }) {}\n * ```\n * @privateRemarks\n * TODO:\n * Extends this to support numeric enums.\n * Maybe require an explicit nested scope to group them under, or at least a warning about collisions.\n * Maybe just provide `SchemaFactory.nested` to east creating nested scopes?\n * @internal\n */\nexport function adaptEnum<TScope extends string, const TEnum extends Record<string, string>>(\n\tfactory: SchemaFactory<TScope>,\n\tmembers: TEnum,\n) {\n\ttype Values = TEnum[keyof TEnum];\n\tconst values = Object.values(members) as Values[];\n\tconst inverse = new Map(Object.entries(members).map(([key, value]) => [value, key])) as Map<\n\t\tValues,\n\t\tkeyof TEnum\n\t>;\n\n\tif (inverse.size !== values.length) {\n\t\tthrow new UsageError(\"All members of enums must have distinct values.\");\n\t}\n\n\ttype TOut = {\n\t\treadonly [Property in keyof TEnum]: ReturnType<\n\t\t\ttypeof singletonSchema<TScope, TEnum[Property]>\n\t\t>;\n\t};\n\tconst factoryOut = <TValue extends Values>(value: TValue) => {\n\t\treturn new out[inverse.get(value) ?? fail(\"missing enum value\")]({}) as NodeFromSchema<\n\t\t\tReturnType<typeof singletonSchema<TScope, TValue>>\n\t\t>;\n\t};\n\tconst out = factoryOut as typeof factoryOut & TOut;\n\tfor (const [key, value] of Object.entries(members)) {\n\t\tObject.defineProperty(out, key, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\twritable: false,\n\t\t\tvalue: singletonSchema(factory, value),\n\t\t});\n\t}\n\n\treturn out;\n}\n\n/**\n * `Object.values`, but with more specific types.\n * @internal\n */\nexport function typedObjectValues<TKey extends string, TValues>(\n\tobject: Record<TKey, TValues>,\n): TValues[] {\n\treturn Object.values(object);\n}\n\n/**\n * Converts an array of distinct strings into a collection of schema which can be used like an enum style union.\n * @remarks\n * The returned collection is also a function which can be used to convert strings into {@link Unhydrated} nodes in the union.\n * Each node type has a `.value` getter which returns the associated string.\n *\n * The produced nodes use the provided strings as their `name`, and don't store any data beyond that.\n * @example\n * ```typescript\n * const Mode = enumFromStrings(schemaFactory, [\"Fun\", \"Cool\"]);\n * type Mode = NodeFromSchema<(typeof Mode)[keyof typeof Mode]>;\n * const nodeFromString: Mode = Mode(\"Fun\");\n * const nodeFromSchema: Mode = new Mode.Fun();\n * const nameFromNode = nodeFromSchema.value;\n *\n * class Parent extends schemaFactory.object(\"Parent\", { mode: typedObjectValues(Mode) }) {}\n * ```\n * @internal\n */\nexport function enumFromStrings<TScope extends string, const Members extends string>(\n\tfactory: SchemaFactory<TScope>,\n\tmembers: Members[],\n) {\n\tconst names = new Set(members);\n\tif (names.size !== members.length) {\n\t\tthrow new UsageError(\"All members of enums must have distinct names\");\n\t}\n\n\ttype TOut = Record<Members, ReturnType<typeof singletonSchema<TScope, Members>>>;\n\tconst factoryOut = <TValue extends Members>(value: TValue) => {\n\t\treturn new out[value]({}) as NodeFromSchema<\n\t\t\tReturnType<typeof singletonSchema<TScope, TValue>>\n\t\t>;\n\t};\n\tconst out = factoryOut as typeof factoryOut & TOut;\n\tfor (const name of members) {\n\t\tObject.defineProperty(out, name, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\twritable: false,\n\t\t\tvalue: singletonSchema(factory, name),\n\t\t});\n\t}\n\n\treturn out;\n}\n\n// TODO: Why does this one generate an invalid d.ts file if exported?\n// Tracked by https://github.com/microsoft/TypeScript/issues/56718\n// TODO: replace enumFromStrings above with this simpler implementation when the TypeScript bug is resolved.\nfunction _enumFromStrings2<TScope extends string, const Members extends readonly string[]>(\n\tfactory: SchemaFactory<TScope>,\n\tmembers: Members,\n) {\n\tconst enumObject: {\n\t\t[key in keyof Members as Members[key] extends string ? Members[key] : string]: Members[key];\n\t} = Object.create(null);\n\tfor (const name of members) {\n\t\tObject.defineProperty(enumObject, name, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\twritable: false,\n\t\t\tvalue: name,\n\t\t});\n\t}\n\n\treturn adaptEnum(factory, enumObject);\n}\n"]}

package/lib/simple-tree/schemaFactory.d.ts

@@ -2,12 +2,14 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { RestrictiveReadonlyRecord } from "../util/index.js";
-import { FlexTreeNode } from "../feature-libraries/index.js";
 import { TreeValue } from "../core/index.js";
-import { AllowedTypes, FieldKind, FieldSchema, ImplicitAllowedTypes, ImplicitFieldSchema, InsertableObjectFromSchemaRecord, InsertableTreeNodeFromImplicitAllowedTypes, InsertableTypedNode, NodeFromSchema, NodeKind, ObjectFromSchemaRecord, TreeMapNode, TreeNodeSchema, TreeNodeSchemaClass, WithType } from "./schemaTypes.js";
-import { TreeNode } from "./types.js";
-import { TreeArrayNode } from "./treeArrayNode.js";
+import { Unenforced } from "../feature-libraries/index.js";
+import { RestrictiveReadonlyRecord } from "../util/index.js";
+import { FieldKind, FieldSchema, ImplicitAllowedTypes, ImplicitFieldSchema, InsertableTreeNodeFromImplicitAllowedTypes, NodeKind, TreeNodeSchema, TreeNodeSchemaClass, WithType, type FieldProps } from "./schemaTypes.js";
+import { TreeArrayNode } from "./arrayNode.js";
+import { InsertableObjectFromSchemaRecord, TreeObjectNode } from "./objectNode.js";
+import { TreeMapNode } from "./mapNode.js";
+import { InsertableObjectFromSchemaRecordUnsafe, InsertableTreeNodeFromImplicitAllowedTypesUnsafe, TreeArrayNodeUnsafe, TreeMapNodeUnsafe, TreeObjectNodeUnsafe } from "./typesUnsafe.js";
 /**
  * Gets the leaf domain schema compatible with a given {@link TreeValue}.
  */
@@ -135,11 +137,12 @@ export declare class SchemaFactory<out TScope extends string | undefined = strin
      */
     private nodeSchema;
     /**
-     * Define a {@link TreeNodeSchema} for an object node.
+     * Define a {@link TreeNodeSchema} for a {@link TreeObjectNode}.
      *
      * @param name - Unique identifier for this schema within this factory's scope.
+     * @param fields - Schema for fields of the object node's schema. Defines what children can be placed under each key.
      */
-    object<const Name extends TName, const T extends RestrictiveReadonlyRecord<string, ImplicitFieldSchema>>(name: Name, t: T): TreeNodeSchemaClass<ScopedSchemaName<TScope, Name>, NodeKind.Object, TreeNode & ObjectFromSchemaRecord<T> & WithType<ScopedSchemaName<TScope, Name>>, object & InsertableObjectFromSchemaRecord<T>, true, T>;
+    object<const Name extends TName, const T extends RestrictiveReadonlyRecord<string, ImplicitFieldSchema>>(name: Name, fields: T): TreeNodeSchemaClass<ScopedSchemaName<TScope, Name>, NodeKind.Object, TreeObjectNode<T, ScopedSchemaName<TScope, Name>>, object & InsertableObjectFromSchemaRecord<T>, true, T>;
     /**
      * Define a structurally typed {@link TreeNodeSchema} for a {@link TreeMapNode}.
      *
@@ -179,10 +182,8 @@ export declare class SchemaFactory<out TScope extends string | undefined = strin
      * Define a {@link TreeNodeSchema} for a {@link (TreeMapNode:interface)}.
      *
      * @param name - Unique identifier for this schema within this factory's scope.
-     *
-     * @remarks See remarks on {@link SchemaFactory.namedArray_internal}.
      */
-    namedMap_internal<Name extends TName | string, const T extends ImplicitAllowedTypes, const ImplicitlyConstructable extends boolean>(name: Name, allowedTypes: T, customizable: boolean, implicitlyConstructable: ImplicitlyConstructable): TreeNodeSchemaClass<ScopedSchemaName<TScope, Name>, NodeKind.Map, TreeMapNode<T> & WithType<ScopedSchemaName<TScope, Name>>, Iterable<[string, InsertableTreeNodeFromImplicitAllowedTypes<T>]>, ImplicitlyConstructable, T>;
+    private namedMap;
     /**
      * Define a structurally typed {@link TreeNodeSchema} for a {@link (TreeArrayNode:interface)}.
      *
@@ -238,47 +239,95 @@ export declare class SchemaFactory<out TScope extends string | undefined = strin
      * @remarks
      * This is not intended to be used directly, use the overload of `array` which takes a name instead.
      * This is only public to work around a compiler limitation.
-     *
-     * @privateRemarks
-     * TODO: this should be made private or protected.
-     * Doing so breaks due to:
-     * `src/class-tree/schemaFactoryRecursive.ts:42:9 - error TS2310: Type 'Array' recursively references itself as a base type.`
-     * Once recursive APIs are better sorted out and integrated into this class, switch this back to private.
      */
-    namedArray_internal<Name extends TName | string, const T extends ImplicitAllowedTypes, const ImplicitlyConstructable extends boolean>(name: Name, allowedTypes: T, customizable: boolean, implicitlyConstructable: ImplicitlyConstructable): TreeNodeSchemaClass<ScopedSchemaName<TScope, Name>, NodeKind.Array, TreeArrayNode<T> & WithType<ScopedSchemaName<TScope, string>>, Iterable<InsertableTreeNodeFromImplicitAllowedTypes<T>>, ImplicitlyConstructable, T>;
+    private namedArray;
     /**
-     * Make a field optional instead of the default which is required.
+     * Make a field optional instead of the default, which is required.
+     *
+     * @param t - The types allowed under the field.
+     * @param props - Optional properties to associate with the field.
      */
-    optional<const T extends ImplicitAllowedTypes>(t: T): FieldSchema<FieldKind.Optional, T>;
+    optional<const T extends ImplicitAllowedTypes>(t: T, props?: FieldProps): FieldSchema<FieldKind.Optional, T>;
     /**
-     * Function which can be used for its compile time side-effects to tweak the evaluation order of recursive types to make them compile.
-     * @remarks
-     * Some related information in https://github.com/microsoft/TypeScript/issues/55758.
+     * Make a field explicitly required.
      *
-     * Also be aware that code which relies on this tends to break VSCode's IntelliSense every time anything related to that code (even comments) is edited.
-     * Running the command `TypeScript: Restart TS Server` with the schema file focused should fix it.
-     * Sometimes this does not work: closing all open files except the schema before running the command can help.
-     * Real compile errors (for example elsewhere in the file) can also cause the IntelliSense to not work correctly ever after `TypeScript: Restart TS Server`.
+     * @param t - The types allowed under the field.
+     * @param props - Optional properties to associate with the field.
      *
-     * Intellisense has also shown problems when schema files with recursive types are part of a cyclic file dependency.
-     * Splitting the schema into its own file with minimal dependencies can help with this.
-     *
-     * Ensure `"noImplicitAny": true` is set in the `tsconfig.json`.
-     * Without it, recursive types that are not working properly can infer `any` and give very non-type-safe results instead of erroring.
+     * @remarks
+     * Fields are required by default, but this API can be used to make the required nature explicit in the schema,
+     * and allows associating custom {@link FieldProps | properties} with the field.
+     */
+    required<const T extends ImplicitAllowedTypes>(t: T, props?: FieldProps): FieldSchema<FieldKind.Required, T>;
+    /**
+     * Make a field of type identifier instead of the default which is required.
+     */
+    get identifier(): FieldSchema<FieldKind.Identifier>;
+    /**
+     * {@link SchemaFactory.object} except tweaked to work better for recursive types.
+     * Use with {@link ValidateRecursiveSchema} for improved type safety.
+     * @remarks
+     * This version of {@link SchemaFactory.object} has fewer type constraints to work around TypeScript limitations, see {@link Unenforced}.
+     * See {@link ValidateRecursiveSchema} for additional information about using recursive schema.
      *
-     * @example
-     * ```typescript
-     * const factory = new SchemaFactory("example");
-     * const recursiveReference = () => RecursiveObject;
-     * factory.fixRecursiveReference(recursiveReference);
-     * export class RecursiveObject extends factory.object("exampleObject", {
-     * 	recursive: [recursiveReference],
-     * }) {}
-     * ```
-     * @deprecated Use special `recursive` versions of builders instead of relying on this.
+     * Additionally `ImplicitlyConstructable` is disabled (forcing use of constructor) to avoid
+     * `error TS2589: Type instantiation is excessively deep and possibly infinite.`
+     * which otherwise gets reported at sometimes incorrect source locations that vary based on incremental builds.
+     */
+    objectRecursive<const Name extends TName, const T extends Unenforced<RestrictiveReadonlyRecord<string, ImplicitFieldSchema>>>(name: Name, t: T): TreeNodeSchemaClass<ScopedSchemaName<TScope, Name>, NodeKind.Object, TreeObjectNodeUnsafe<T, ScopedSchemaName<TScope, Name>>, object & InsertableObjectFromSchemaRecordUnsafe<T>, false, T>;
+    /**
+     * {@link SchemaFactory.optional} except tweaked to work better for recursive types.
+     * Use with {@link ValidateRecursiveSchema} for improved type safety.
+     * @remarks
+     * This version of {@link SchemaFactory.optional} has fewer type constraints to work around TypeScript limitations, see {@link Unenforced}.
+     * See {@link ValidateRecursiveSchema} for additional information about using recursive schema.
+     */
+    optionalRecursive<const T extends Unenforced<readonly (() => TreeNodeSchema)[]>>(t: T): import("./typesUnsafe.js").FieldSchemaUnsafe<FieldKind.Optional, T>;
+    /**
+     * `SchemaFactory.array` except tweaked to work better for recursive types.
+     * Use with {@link ValidateRecursiveSchema} for improved type safety.
+     * @remarks
+     * This version of `SchemaFactory.array` uses the same workarounds as {@link SchemaFactory.objectRecursive}.
+     * See {@link ValidateRecursiveSchema} for additional information about using recursive schema.
+     */
+    arrayRecursive<const Name extends TName, const T extends Unenforced<ImplicitAllowedTypes>>(name: Name, allowedTypes: T): TreeNodeSchemaClass<ScopedSchemaName<TScope, Name>, NodeKind.Array, TreeArrayNodeUnsafe<T> & WithType<ScopedSchemaName<TScope, Name>>, {
+        /**
+         * Iterator for the iterable of content for this node.
+         * @privateRemarks
+         * Wrapping the constructor parameter for recursive arrays and maps in an inlined object type avoids (for unknown reasons)
+         * the following compile error when declaring the recursive schema:
+         * `Function implicitly has return type 'any' because it does not have a return type annotation and is referenced directly or indirectly in one of its return expressions.`
+         * To benefit from this without impacting the API, the definition of `Iterable` has been inlined as such an object.
+         *
+         * If this workaround is kept, ideally this comment would be deduplicated with the other instance of it.
+         * Unfortunately attempts to do this failed to avoid the compile error this was introduced to solve.
+         */
+        [Symbol.iterator](): Iterator<InsertableTreeNodeFromImplicitAllowedTypesUnsafe<T>>;
+    }, false, T>;
+    /**
+     * `SchemaFactory.map` except tweaked to work better for recursive types.
+     * Use with {@link ValidateRecursiveSchema} for improved type safety.
+     * @remarks
+     * This version of `SchemaFactory.map` uses the same workarounds as {@link SchemaFactory.objectRecursive}.
+     * See {@link ValidateRecursiveSchema} for additional information about using recursive schema.
      */
-    fixRecursiveReference<T extends AllowedTypes>(...types: T): void;
+    mapRecursive<Name extends TName, const T extends Unenforced<ImplicitAllowedTypes>>(name: Name, allowedTypes: T): TreeNodeSchemaClass<ScopedSchemaName<TScope, Name>, NodeKind.Map, TreeMapNodeUnsafe<T> & WithType<ScopedSchemaName<TScope, Name>>, {
+        /**
+         * Iterator for the iterable of content for this node.
+         * @privateRemarks
+         * Wrapping the constructor parameter for recursive arrays and maps in an inlined object type avoids (for unknown reasons)
+         * the following compile error when declaring the recursive schema:
+         * `Function implicitly has return type 'any' because it does not have a return type annotation and is referenced directly or indirectly in one of its return expressions.`
+         * To benefit from this without impacting the API, the definition of `Iterable` has been inlined as such an object.
+         *
+         * If this workaround is kept, ideally this comment would be deduplicated with the other instance of it.
+         * Unfortunately attempts to do this failed to avoid the compile error this was introduced to solve.
+         */
+        [Symbol.iterator](): Iterator<[
+            string,
+            InsertableTreeNodeFromImplicitAllowedTypesUnsafe<T>
+        ]>;
+    }, false, T>;
 }
-export declare function createTree<T extends TreeNodeSchema>(schema: T, data: InsertableTypedNode<T> | FlexTreeNode): NodeFromSchema<T>;
 export declare function structuralName<const T extends string>(collectionName: T, allowedTypes: TreeNodeSchema | readonly TreeNodeSchema[]): `${T}<${string}>`;
 //# sourceMappingURL=schemaFactory.d.ts.map

package/lib/simple-tree/schemaFactory.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schemaFactory.d.ts","sourceRoot":"","sources":["../../src/simple-tree/schemaFactory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,yBAAyB,EAAgC,MAAM,kBAAkB,CAAC;AAC3F,OAAO,EACN,YAAY,EASZ,MAAM,+BAA+B,CAAC;AAEvC,OAAO,EAA4B,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAWvE,OAAO,EACN,YAAY,EACZ,SAAS,EACT,WAAW,EACX,oBAAoB,EACpB,mBAAmB,EACnB,gCAAgC,EAChC,0CAA0C,EAC1C,mBAAmB,EACnB,cAAc,EACd,QAAQ,EACR,sBAAsB,EACtB,WAAW,EAEX,cAAc,EACd,mBAAmB,EAEnB,QAAQ,EAER,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AA6CnD;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG,cAAc,CAkBhE;AAQD;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,CAC3B,MAAM,SAAS,MAAM,GAAG,SAAS,EACjC,KAAK,SAAS,MAAM,GAAG,MAAM,IAC1B,MAAM,SAAS,SAAS,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,MAAM,IAAI,KAAK,EAAE,CAAC;AAOjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsDG;AACH,qBAAa,aAAa,CACzB,GAAG,CAAC,MAAM,SAAS,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,EAC1D,KAAK,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM;aASH,KAAK,EAAE,MAAM;IAPhD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0C;IAE1E;;;;OAIG;gBACgC,KAAK,EAAE,MAAM;IAEhD,OAAO,CAAC,MAAM;IAOd;;;;;;;;;;;;OAYG;IACH,SAAgB,MAAM,kFAAgB;IAEtC;;;;;;;;;;;;;OAaG;IACH,SAAgB,MAAM,kFAAgB;IAEtC;;OAEG;IACH,SAAgB,OAAO,qFAAiB;IAExC;;;;;;;OAOG;IACH,SAAgB,IAAI,4EAAc;IAElC;;OAEG;IACH,SAAgB,MAAM,sZAAgB;IAEtC;;;OAGG;IACH,OAAO,CAAC,UAAU;IAwDlB;;;;OAIG;IACI,MAAM,CACZ,KAAK,CAAC,IAAI,SAAS,KAAK,EACxB,KAAK,CAAC,CAAC,SAAS,yBAAyB,CAAC,MAAM,EAAE,mBAAmB,CAAC,EACrE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAkDlB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACI,GAAG,CAAC,KAAK,CAAC,CAAC,SAAS,cAAc,GAAG,SAAS,cAAc,EAAE,EACpE,YAAY,EAAE,CAAC,GACb,cAAc,CAChB,gBAAgB,CAAC,MAAM,EAAE,OAAO,MAAM,GAAG,CAAC,EAC1C,QAAQ,CAAC,GAAG,EACZ,WAAW,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,MAAM,GAAG,CAAC,CAAC,EACrE,QAAQ,CAAC,CAAC,MAAM,EAAE,0CAA0C,CAAC,CAAC,CAAC,CAAC,CAAC,EACjE,IAAI,EACJ,CAAC,CACD;IAED;;;;;;;;;OASG;IACI,GAAG,CAAC,IAAI,SAAS,KAAK,EAAE,KAAK,CAAC,CAAC,SAAS,oBAAoB,EAClE,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,CAAC,GACb,mBAAmB,CACrB,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,EAC9B,QAAQ,CAAC,GAAG,EACZ,WAAW,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,EACzD,QAAQ,CAAC,CAAC,MAAM,EAAE,0CAA0C,CAAC,CAAC,CAAC,CAAC,CAAC,EACjE,IAAI,EACJ,CAAC,CACD;IAsCD;;;;;;OAMG;IACI,iBAAiB,CACvB,IAAI,SAAS,KAAK,GAAG,MAAM,EAC3B,KAAK,CAAC,CAAC,SAAS,oBAAoB,EACpC,KAAK,CAAC,uBAAuB,SAAS,OAAO,EAE7C,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,CAAC,EACf,YAAY,EAAE,OAAO,EACrB,uBAAuB,EAAE,uBAAuB;IA0CjD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAgCG;IACI,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,cAAc,GAAG,SAAS,cAAc,EAAE,EACtE,YAAY,EAAE,CAAC,GACb,cAAc,CAChB,gBAAgB,CAAC,MAAM,EAAE,SAAS,MAAM,GAAG,CAAC,EAC5C,QAAQ,CAAC,KAAK,EACd,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,SAAS,MAAM,GAAG,CAAC,CAAC,EACzE,QAAQ,CAAC,0CAA0C,CAAC,CAAC,CAAC,CAAC,EACvD,IAAI,EACJ,CAAC,CACD;IAED;;;;;;;;;;;OAWG;IACI,KAAK,CAAC,KAAK,CAAC,IAAI,SAAS,KAAK,EAAE,KAAK,CAAC,CAAC,SAAS,oBAAoB,EAC1E,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,CAAC,GACb,mBAAmB,CACrB,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,EAC9B,QAAQ,CAAC,KAAK,EACd,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,EAC3D,QAAQ,CAAC,0CAA0C,CAAC,CAAC,CAAC,CAAC,EACvD,IAAI,EACJ,CAAC,CACD;IA8BD;;;;;;;;;;;;;;OAcG;IACI,mBAAmB,CACzB,IAAI,SAAS,KAAK,GAAG,MAAM,EAC3B,KAAK,CAAC,CAAC,SAAS,oBAAoB,EACpC,KAAK,CAAC,uBAAuB,SAAS,OAAO,EAE7C,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,CAAC,EACf,YAAY,EAAE,OAAO,EACrB,uBAAuB,EAAE,uBAAuB;IA8CjD;;OAEG;IACI,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,oBAAoB,EACnD,CAAC,EAAE,CAAC,GACF,WAAW,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;IAIrC;;;;;;;;;;;;;;;;;;;;;;;;;;OA0BG;IACI,qBAAqB,CAAC,CAAC,SAAS,YAAY,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI;CACvE;AAGD,wBAAgB,UAAU,CAAC,CAAC,SAAS,cAAc,EAClD,MAAM,EAAE,CAAC,EACT,IAAI,EAAE,mBAAmB,CAAC,CAAC,CAAC,GAAG,YAAY,GACzC,cAAc,CAAC,CAAC,CAAC,CAYnB;AAED,wBAAgB,cAAc,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACpD,cAAc,EAAE,CAAC,EACjB,YAAY,EAAE,cAAc,GAAG,SAAS,cAAc,EAAE,GACtD,GAAG,CAAC,IAAI,MAAM,GAAG,CAkBnB"}
+{"version":3,"file":"schemaFactory.d.ts","sourceRoot":"","sources":["../../src/simple-tree/schemaFactory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAEN,UAAU,EAKV,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,yBAAyB,EAAgC,MAAM,kBAAkB,CAAC;AAW3F,OAAO,EACN,SAAS,EACT,WAAW,EACX,oBAAoB,EACpB,mBAAmB,EACnB,0CAA0C,EAC1C,QAAQ,EACR,cAAc,EACd,mBAAmB,EACnB,QAAQ,EAER,KAAK,UAAU,EACf,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAe,MAAM,gBAAgB,CAAC;AAE5D,OAAO,EAAE,gCAAgC,EAAE,cAAc,EAAgB,MAAM,iBAAiB,CAAC;AACjG,OAAO,EAAE,WAAW,EAAa,MAAM,cAAc,CAAC;AACtD,OAAO,EACN,sCAAsC,EACtC,gDAAgD,EAChD,mBAAmB,EACnB,iBAAiB,EACjB,oBAAoB,EACpB,MAAM,kBAAkB,CAAC;AAG1B;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG,cAAc,CAkBhE;AAED;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,CAC3B,MAAM,SAAS,MAAM,GAAG,SAAS,EACjC,KAAK,SAAS,MAAM,GAAG,MAAM,IAC1B,MAAM,SAAS,SAAS,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,MAAM,IAAI,KAAK,EAAE,CAAC;AAOjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsDG;AACH,qBAAa,aAAa,CACzB,GAAG,CAAC,MAAM,SAAS,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,EAC1D,KAAK,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM;aASH,KAAK,EAAE,MAAM;IAPhD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0C;IAE1E;;;;OAIG;gBACgC,KAAK,EAAE,MAAM;IAEhD,OAAO,CAAC,MAAM;IAOd;;;;;;;;;;;;OAYG;IACH,SAAgB,MAAM,kFAAgB;IAEtC;;;;;;;;;;;;;OAaG;IACH,SAAgB,MAAM,kFAAgB;IAEtC;;OAEG;IACH,SAAgB,OAAO,qFAAiB;IAExC;;;;;;;OAOG;IACH,SAAgB,IAAI,4EAAc;IAElC;;OAEG;IACH,SAAgB,MAAM,sZAAgB;IAEtC;;;OAGG;IACH,OAAO,CAAC,UAAU;IAwDlB;;;;;OAKG;IACI,MAAM,CACZ,KAAK,CAAC,IAAI,SAAS,KAAK,EACxB,KAAK,CAAC,CAAC,SAAS,yBAAyB,CAAC,MAAM,EAAE,mBAAmB,CAAC,EAEtE,IAAI,EAAE,IAAI,EACV,MAAM,EAAE,CAAC,GACP,mBAAmB,CACrB,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,EAC9B,QAAQ,CAAC,MAAM,EACf,cAAc,CAAC,CAAC,EAAE,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,EACjD,MAAM,GAAG,gCAAgC,CAAC,CAAC,CAAC,EAC5C,IAAI,EACJ,CAAC,CACD;IAID;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACI,GAAG,CAAC,KAAK,CAAC,CAAC,SAAS,cAAc,GAAG,SAAS,cAAc,EAAE,EACpE,YAAY,EAAE,CAAC,GACb,cAAc,CAChB,gBAAgB,CAAC,MAAM,EAAE,OAAO,MAAM,GAAG,CAAC,EAC1C,QAAQ,CAAC,GAAG,EACZ,WAAW,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,MAAM,GAAG,CAAC,CAAC,EACrE,QAAQ,CAAC,CAAC,MAAM,EAAE,0CAA0C,CAAC,CAAC,CAAC,CAAC,CAAC,EACjE,IAAI,EACJ,CAAC,CACD;IAED;;;;;;;;;OASG;IACI,GAAG,CAAC,IAAI,SAAS,KAAK,EAAE,KAAK,CAAC,CAAC,SAAS,oBAAoB,EAClE,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,CAAC,GACb,mBAAmB,CACrB,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,EAC9B,QAAQ,CAAC,GAAG,EACZ,WAAW,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,EACzD,QAAQ,CAAC,CAAC,MAAM,EAAE,0CAA0C,CAAC,CAAC,CAAC,CAAC,CAAC,EACjE,IAAI,EACJ,CAAC,CACD;IAsCD;;;;OAIG;IACH,OAAO,CAAC,QAAQ;IAuBhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAgCG;IACI,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,cAAc,GAAG,SAAS,cAAc,EAAE,EACtE,YAAY,EAAE,CAAC,GACb,cAAc,CAChB,gBAAgB,CAAC,MAAM,EAAE,SAAS,MAAM,GAAG,CAAC,EAC5C,QAAQ,CAAC,KAAK,EACd,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,SAAS,MAAM,GAAG,CAAC,CAAC,EACzE,QAAQ,CAAC,0CAA0C,CAAC,CAAC,CAAC,CAAC,EACvD,IAAI,EACJ,CAAC,CACD;IAED;;;;;;;;;;;OAWG;IACI,KAAK,CAAC,KAAK,CAAC,IAAI,SAAS,KAAK,EAAE,KAAK,CAAC,CAAC,SAAS,oBAAoB,EAC1E,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,CAAC,GACb,mBAAmB,CACrB,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,EAC9B,QAAQ,CAAC,KAAK,EACd,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,EAC3D,QAAQ,CAAC,0CAA0C,CAAC,CAAC,CAAC,CAAC,EACvD,IAAI,EACJ,CAAC,CACD;IA8BD;;;;;;;;OAQG;IACH,OAAO,CAAC,UAAU;IAuBlB;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,oBAAoB,EACnD,CAAC,EAAE,CAAC,EACJ,KAAK,CAAC,EAAE,UAAU,GAChB,WAAW,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;IAIrC;;;;;;;;;OASG;IACI,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,oBAAoB,EACnD,CAAC,EAAE,CAAC,EACJ,KAAK,CAAC,EAAE,UAAU,GAChB,WAAW,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;IAIrC;;OAEG;IACH,IAAW,UAAU,IAAI,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAEzD;IAED;;;;;;;;;;OAUG;IACI,eAAe,CACrB,KAAK,CAAC,IAAI,SAAS,KAAK,EACxB,KAAK,CAAC,CAAC,SAAS,UAAU,CAAC,yBAAyB,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,EACjF,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAelB;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAK,CAAC,CAAC,SAAS,UAAU,CAAC,SAAS,CAAC,MAAM,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAI5F;;;;;;OAMG;IACI,cAAc,CACpB,KAAK,CAAC,IAAI,SAAS,KAAK,EACxB,KAAK,CAAC,CAAC,SAAS,UAAU,CAAC,oBAAoB,CAAC,EAC/C,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC;QAyB1B;;;;;;;;;;WAUG;6BACkB,SAAS,iDAAiD,CAAC,CAAC,CAAC;;IAOrF;;;;;;OAMG;IACI,YAAY,CAAC,IAAI,SAAS,KAAK,EAAE,KAAK,CAAC,CAAC,SAAS,UAAU,CAAC,oBAAoB,CAAC,EACvF,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,CAAC;QAiCb;;;;;;;;;;WAUG;6BACkB,SACpB;YAAC,MAAM;YAAE,iDAAiD,CAAC,CAAC;SAAC,CAC7D;;CAMJ;AAED,wBAAgB,cAAc,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACpD,cAAc,EAAE,CAAC,EACjB,YAAY,EAAE,cAAc,GAAG,SAAS,cAAc,EAAE,GACtD,GAAG,CAAC,IAAI,MAAM,GAAG,CAkBnB"}