@fluidframework/ai-collab 2.10.0-306579

package/dist/explicit-strategy/agentEditReducer.js

@@ -0,0 +1,394 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.applyAgentEdit = void 0;
+const internal_1 = require("@fluidframework/core-utils/internal");
+const runtime_utils_1 = require("@fluidframework/runtime-utils");
+const internal_2 = require("@fluidframework/telemetry-utils/internal");
+const internal_3 = require("@fluidframework/tree/internal");
+const agentEditTypes_js_1 = require("./agentEditTypes.js");
+const promptGeneration_js_1 = require("./promptGeneration.js");
+const utils_js_1 = require("./utils.js");
+function populateDefaults(json, definitionMap) {
+    if (typeof json === "object") {
+        if (json === null) {
+            return;
+        }
+        if (Array.isArray(json)) {
+            for (const element of json) {
+                populateDefaults(element, definitionMap);
+            }
+        }
+        else {
+            (0, internal_1.assert)(typeof json[agentEditTypes_js_1.typeField] === "string", "The typeField must be present in new JSON content");
+            const nodeSchema = definitionMap.get(json[agentEditTypes_js_1.typeField]);
+            (0, internal_1.assert)(nodeSchema?.kind === internal_3.NodeKind.Object, "Expected object schema");
+        }
+    }
+}
+function getSchemaIdentifier(content) {
+    switch (typeof content) {
+        case "boolean": {
+            return internal_3.booleanSchema.identifier;
+        }
+        case "number": {
+            return internal_3.numberSchema.identifier;
+        }
+        case "string": {
+            return internal_3.stringSchema.identifier;
+        }
+        case "object": {
+            if (content === null) {
+                return internal_3.nullSchema.identifier;
+            }
+            if (Array.isArray(content)) {
+                throw new internal_2.UsageError("Arrays are not currently supported in this context");
+            }
+            if ((0, runtime_utils_1.isFluidHandle)(content)) {
+                return internal_3.handleSchema.identifier;
+            }
+            return content[agentEditTypes_js_1.typeField];
+        }
+        default: {
+            throw new internal_2.UsageError("Unsupported content type");
+        }
+    }
+}
+function contentWithIds(content, idGenerator) {
+    return JSON.parse((0, promptGeneration_js_1.toDecoratedJson)(idGenerator, content));
+}
+/**
+ * Manages applying the various types of {@link TreeEdit}'s to a a given {@link TreeNode}.
+ */
+function applyAgentEdit(treeEdit, idGenerator, definitionMap, validator) {
+    assertObjectIdsExist(treeEdit, idGenerator);
+    switch (treeEdit.type) {
+        case "insert": {
+            const { array, index } = getPlaceInfo(treeEdit.destination, idGenerator);
+            const parentNodeSchema = internal_3.Tree.schema(array);
+            populateDefaults(treeEdit.content, definitionMap);
+            const schemaIdentifier = getSchemaIdentifier(treeEdit.content);
+            // We assume that the parentNode for inserts edits are guaranteed to be an arrayNode.
+            const allowedTypes = [
+                ...(0, internal_3.normalizeAllowedTypes)(parentNodeSchema.info),
+            ];
+            for (const allowedType of allowedTypes.values()) {
+                if (allowedType.identifier === schemaIdentifier && typeof allowedType === "function") {
+                    const simpleNodeSchema = allowedType;
+                    const insertNode = new simpleNodeSchema(treeEdit.content);
+                    validator?.(insertNode);
+                    array.insertAt(index, insertNode);
+                    return {
+                        ...treeEdit,
+                        content: contentWithIds(insertNode, idGenerator),
+                    };
+                }
+            }
+            (0, utils_js_1.fail)("inserted node must be of an allowed type");
+        }
+        case "remove": {
+            const source = treeEdit.source;
+            if (isObjectTarget(source)) {
+                const node = getNodeFromTarget(source, idGenerator);
+                const parentNode = internal_3.Tree.parent(node);
+                // Case for deleting rootNode
+                if (parentNode === undefined) {
+                    throw new internal_2.UsageError("The root is required, and cannot be removed. Please use modify edit instead.");
+                }
+                else if (internal_3.Tree.schema(parentNode).kind === internal_3.NodeKind.Array) {
+                    const nodeIndex = internal_3.Tree.key(node);
+                    parentNode.removeAt(nodeIndex);
+                }
+                else {
+                    const fieldKey = internal_3.Tree.key(node);
+                    const parentSchema = internal_3.Tree.schema(parentNode);
+                    const fieldSchema = parentSchema.info[fieldKey] ??
+                        (0, utils_js_1.fail)("Expected field schema");
+                    if (fieldSchema instanceof internal_3.FieldSchema && fieldSchema.kind === internal_3.FieldKind.Optional) {
+                        // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                        parentNode[fieldKey] = undefined;
+                    }
+                    else {
+                        throw new internal_2.UsageError(`${fieldKey} is required, and cannot be removed. Please use modify edit instead.`);
+                    }
+                }
+            }
+            else if (isRange(source)) {
+                const { array, startIndex, endIndex } = getRangeInfo(source, idGenerator);
+                array.removeRange(startIndex, endIndex);
+            }
+            return treeEdit;
+        }
+        case "modify": {
+            const node = getNodeFromTarget(treeEdit.target, idGenerator);
+            const { treeNodeSchema } = getSimpleNodeSchema(node);
+            const fieldSchema = treeNodeSchema.info[treeEdit.field] ??
+                (0, utils_js_1.fail)("Expected field schema");
+            const modification = treeEdit.modification;
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-assignment, @typescript-eslint/no-unsafe-member-access
+            const schemaIdentifier = modification[agentEditTypes_js_1.typeField];
+            let insertedObject;
+            // if fieldSchema is a LeafnodeSchema, we can check that it's a valid type and set the field.
+            if (isPrimitive(modification)) {
+                // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                node[treeEdit.field] = modification;
+            }
+            // If the fieldSchema is a function we can grab the constructor and make an instance of that node.
+            else if (typeof fieldSchema === "function") {
+                const simpleSchema = fieldSchema;
+                populateDefaults(modification, definitionMap);
+                const constructedModification = new simpleSchema(modification);
+                validator?.(constructedModification);
+                insertedObject = constructedModification;
+                if (Array.isArray(modification)) {
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                    const field = node[treeEdit.field];
+                    (0, internal_1.assert)(Array.isArray(field), "the field must be an array node");
+                    (0, internal_1.assert)(Array.isArray(constructedModification), "the modification must be an array node");
+                    field.removeRange(0);
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                    node[treeEdit.field] = constructedModification;
+                }
+                else {
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                    node[treeEdit.field] = constructedModification;
+                }
+            }
+            // If the fieldSchema is of type FieldSchema, we can check its allowed types and set the field.
+            else if (fieldSchema instanceof internal_3.FieldSchema) {
+                if (fieldSchema.kind === internal_3.FieldKind.Optional && modification === undefined) {
+                    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                    node[treeEdit.field] = undefined;
+                }
+                else {
+                    for (const allowedType of fieldSchema.allowedTypeSet.values()) {
+                        if (allowedType.identifier === schemaIdentifier) {
+                            if (typeof allowedType === "function") {
+                                const simpleSchema = allowedType;
+                                const constructedObject = new simpleSchema(modification);
+                                insertedObject = constructedObject;
+                                // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                                node[treeEdit.field] = constructedObject;
+                            }
+                            else {
+                                // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access
+                                node[treeEdit.field] = modification;
+                            }
+                        }
+                    }
+                }
+            }
+            return insertedObject === undefined
+                ? treeEdit
+                : {
+                    ...treeEdit,
+                    modification: contentWithIds(insertedObject, idGenerator),
+                };
+        }
+        case "move": {
+            // TODO: need to add schema check for valid moves
+            const source = treeEdit.source;
+            const destination = treeEdit.destination;
+            const { array: destinationArrayNode, index: destinationIndex } = getPlaceInfo(destination, idGenerator);
+            if (isObjectTarget(source)) {
+                const sourceNode = getNodeFromTarget(source, idGenerator);
+                const sourceIndex = internal_3.Tree.key(sourceNode);
+                const sourceArrayNode = internal_3.Tree.parent(sourceNode);
+                const sourceArraySchema = internal_3.Tree.schema(sourceArrayNode);
+                if (sourceArraySchema.kind !== internal_3.NodeKind.Array) {
+                    throw new internal_2.UsageError("the source node must be within an arrayNode");
+                }
+                const destinationArraySchema = internal_3.Tree.schema(destinationArrayNode);
+                const allowedTypes = [
+                    ...(0, internal_3.normalizeAllowedTypes)(destinationArraySchema.info),
+                ];
+                const nodeToMove = sourceArrayNode.at(sourceIndex);
+                (0, internal_1.assert)(nodeToMove !== undefined, "node to move must exist");
+                if (isNodeAllowedType(nodeToMove, allowedTypes)) {
+                    destinationArrayNode.moveRangeToIndex(destinationIndex, sourceIndex, sourceIndex + 1, sourceArrayNode);
+                }
+                else {
+                    throw new internal_2.UsageError("Illegal node type in destination array");
+                }
+            }
+            else if (isRange(source)) {
+                const { array, startIndex: sourceStartIndex, endIndex: sourceEndIndex, } = getRangeInfo(source, idGenerator);
+                const destinationArraySchema = internal_3.Tree.schema(destinationArrayNode);
+                const allowedTypes = [
+                    ...(0, internal_3.normalizeAllowedTypes)(destinationArraySchema.info),
+                ];
+                for (let i = sourceStartIndex; i < sourceEndIndex; i++) {
+                    const nodeToMove = array.at(i);
+                    (0, internal_1.assert)(nodeToMove !== undefined, "node to move must exist");
+                    if (!isNodeAllowedType(nodeToMove, allowedTypes)) {
+                        throw new internal_2.UsageError("Illegal node type in destination array");
+                    }
+                }
+                destinationArrayNode.moveRangeToIndex(destinationIndex, sourceStartIndex, sourceEndIndex, array);
+            }
+            return treeEdit;
+        }
+        default: {
+            (0, utils_js_1.fail)("invalid tree edit");
+        }
+    }
+}
+exports.applyAgentEdit = applyAgentEdit;
+function isNodeAllowedType(node, allowedTypes) {
+    for (const allowedType of allowedTypes) {
+        if (internal_3.Tree.is(node, allowedType)) {
+            return true;
+        }
+    }
+    return false;
+}
+function isPrimitive(content) {
+    return (typeof content === "number" ||
+        typeof content === "string" ||
+        typeof content === "boolean" ||
+        content === undefined ||
+        content === null);
+}
+function isObjectTarget(selection) {
+    return Object.keys(selection).length === 1 && "target" in selection;
+}
+function isRange(selection) {
+    return "from" in selection && "to" in selection;
+}
+function getRangeInfo(range, idGenerator) {
+    const { array: arrayFrom, index: startIndex } = getPlaceInfo(range.from, idGenerator);
+    const { array: arrayTo, index: endIndex } = getPlaceInfo(range.to, idGenerator);
+    if (arrayFrom !== arrayTo) {
+        throw new internal_2.UsageError('The "from" node and "to" nodes of the range must be in the same parent array.');
+    }
+    return { array: arrayFrom, startIndex, endIndex };
+}
+function getPlaceInfo(place, idGenerator) {
+    if (place.type === "arrayPlace") {
+        const parent = idGenerator.getNode(place.parentId) ?? (0, utils_js_1.fail)("Expected parent node");
+        const child = parent[place.field];
+        if (child === undefined) {
+            throw new internal_2.UsageError(`No child under field field`);
+        }
+        const schema = internal_3.Tree.schema(child);
+        if (schema.kind !== internal_3.NodeKind.Array) {
+            throw new internal_2.UsageError("Expected child to be in an array node");
+        }
+        return {
+            array: child,
+            index: place.location === "start" ? 0 : child.length,
+        };
+    }
+    else {
+        const node = getNodeFromTarget(place, idGenerator);
+        const nodeIndex = internal_3.Tree.key(node);
+        const parent = internal_3.Tree.parent(node);
+        if (parent === undefined) {
+            throw new internal_2.UsageError("TODO: root node target not supported");
+        }
+        const schema = internal_3.Tree.schema(parent);
+        if (schema.kind !== internal_3.NodeKind.Array) {
+            throw new internal_2.UsageError("Expected child to be in an array node");
+        }
+        return {
+            array: parent,
+            index: place.place === "before" ? nodeIndex : nodeIndex + 1,
+        };
+    }
+}
+/**
+ * Returns the target node with the matching internal objectId using the provided {@link ObjectTarget}
+ */
+function getNodeFromTarget(target, idGenerator) {
+    const node = idGenerator.getNode(target.target);
+    (0, internal_1.assert)(node !== undefined, "objectId does not exist in nodeMap");
+    return node;
+}
+/**
+ * Checks that the objectIds of the Tree Nodes within the givin the {@link TreeEdit} exist within the given {@link IdGenerator}
+ *
+ * @throws An {@link UsageError} if the objectIdKey does not exist in the {@link IdGenerator}
+ */
+function assertObjectIdsExist(treeEdit, idGenerator) {
+    switch (treeEdit.type) {
+        case "insert": {
+            if (treeEdit.destination.type === "objectPlace") {
+                if (idGenerator.getNode(treeEdit.destination.target) === undefined) {
+                    throw new internal_2.UsageError(`objectIdKey ${treeEdit.destination.target} does not exist`);
+                }
+            }
+            else {
+                if (idGenerator.getNode(treeEdit.destination.parentId) === undefined) {
+                    throw new internal_2.UsageError(`objectIdKey ${treeEdit.destination.parentId} does not exist`);
+                }
+            }
+            break;
+        }
+        case "remove": {
+            if (isRange(treeEdit.source)) {
+                const missingObjectIds = [
+                    treeEdit.source.from.target,
+                    treeEdit.source.to.target,
+                ].filter((id) => !idGenerator.getNode(id));
+                if (missingObjectIds.length > 0) {
+                    throw new internal_2.UsageError(`objectIdKeys [${missingObjectIds}] does not exist`);
+                }
+            }
+            else if (isObjectTarget(treeEdit.source) &&
+                idGenerator.getNode(treeEdit.source.target) === undefined) {
+                throw new internal_2.UsageError(`objectIdKey ${treeEdit.source.target} does not exist`);
+            }
+            break;
+        }
+        case "modify": {
+            if (idGenerator.getNode(treeEdit.target.target) === undefined) {
+                throw new internal_2.UsageError(`objectIdKey ${treeEdit.target.target} does not exist`);
+            }
+            break;
+        }
+        case "move": {
+            const invalidObjectIds = [];
+            // check the source
+            if (isRange(treeEdit.source)) {
+                const missingObjectIds = [
+                    treeEdit.source.from.target,
+                    treeEdit.source.to.target,
+                ].filter((id) => !idGenerator.getNode(id));
+                if (missingObjectIds.length > 0) {
+                    invalidObjectIds.push(...missingObjectIds);
+                }
+            }
+            else if (isObjectTarget(treeEdit.source) &&
+                idGenerator.getNode(treeEdit.source.target) === undefined) {
+                invalidObjectIds.push(treeEdit.source.target);
+            }
+            // check the destination
+            if (treeEdit.destination.type === "objectPlace") {
+                if (idGenerator.getNode(treeEdit.destination.target) === undefined) {
+                    invalidObjectIds.push(treeEdit.destination.target);
+                }
+            }
+            else {
+                if (idGenerator.getNode(treeEdit.destination.parentId) === undefined) {
+                    invalidObjectIds.push(treeEdit.destination.parentId);
+                }
+            }
+            if (invalidObjectIds.length > 0) {
+                throw new internal_2.UsageError(`objectIdKeys [${invalidObjectIds}] does not exist`);
+            }
+            break;
+        }
+        default: {
+            break;
+        }
+    }
+}
+function getSimpleNodeSchema(node) {
+    const treeNodeSchema = internal_3.Tree.schema(node);
+    const simpleNodeSchema = treeNodeSchema;
+    return { treeNodeSchema, simpleNodeSchema };
+}
+//# sourceMappingURL=agentEditReducer.js.map

package/dist/explicit-strategy/agentEditReducer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agentEditReducer.js","sourceRoot":"","sources":["../../src/explicit-strategy/agentEditReducer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAC7D,iEAA8D;AAC9D,uEAAsE;AACtE,4DAkBuC;AAEvC,2DAU6B;AAG7B,+DAAwD;AACxD,yCAAkC;AAElC,SAAS,gBAAgB,CACxB,IAAe,EACf,aAAoD;IAEpD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO;QACR,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC5B,gBAAgB,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;YAC1C,CAAC;QACF,CAAC;aAAM,CAAC;YACP,IAAA,iBAAM,EACL,OAAO,IAAI,CAAC,6BAAS,CAAC,KAAK,QAAQ,EACnC,mDAAmD,CACnD,CAAC;YACF,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,6BAAS,CAAC,CAAC,CAAC;YACtD,IAAA,iBAAM,EAAC,UAAU,EAAE,IAAI,KAAK,mBAAQ,CAAC,MAAM,EAAE,wBAAwB,CAAC,CAAC;QACxE,CAAC;IACF,CAAC;AACF,CAAC;AAED,SAAS,mBAAmB,CAAC,OAAsB;IAClD,QAAQ,OAAO,OAAO,EAAE,CAAC;QACxB,KAAK,SAAS,CAAC,CAAC,CAAC;YAChB,OAAO,wBAAa,CAAC,UAAU,CAAC;QACjC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,OAAO,uBAAY,CAAC,UAAU,CAAC;QAChC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,OAAO,uBAAY,CAAC,UAAU,CAAC;QAChC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACtB,OAAO,qBAAU,CAAC,UAAU,CAAC;YAC9B,CAAC;YACD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,qBAAU,CAAC,oDAAoD,CAAC,CAAC;YAC5E,CAAC;YACD,IAAI,IAAA,6BAAa,EAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,uBAAY,CAAC,UAAU,CAAC;YAChC,CAAC;YACD,OAAO,OAAO,CAAC,6BAAS,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;YACT,MAAM,IAAI,qBAAU,CAAC,0BAA0B,CAAC,CAAC;QAClD,CAAC;IACF,CAAC;AACF,CAAC;AAED,SAAS,cAAc,CAAC,OAAiB,EAAE,WAAwB;IAClE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAA,qCAAe,EAAC,WAAW,EAAE,OAAO,CAAC,CAAmB,CAAC;AAC5E,CAAC;AAED;;GAEG;AACH,SAAgB,cAAc,CAC7B,QAAkB,EAClB,WAAwB,EACxB,aAAoD,EACpD,SAAoC;IAEpC,oBAAoB,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IAC5C,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;YAEzE,MAAM,gBAAgB,GAAG,eAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,gBAAgB,CAAC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;YAElD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAE/D,qFAAqF;YACrF,MAAM,YAAY,GAAG;gBACpB,GAAG,IAAA,gCAAqB,EAAC,gBAAgB,CAAC,IAA4B,CAAC;aACvE,CAAC;YAEF,KAAK,MAAM,WAAW,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjD,IAAI,WAAW,CAAC,UAAU,KAAK,gBAAgB,IAAI,OAAO,WAAW,KAAK,UAAU,EAAE,CAAC;oBACtF,MAAM,gBAAgB,GAAG,WAA0D,CAAC;oBACpF,MAAM,UAAU,GAAG,IAAI,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;oBAC1D,SAAS,EAAE,CAAC,UAAU,CAAC,CAAC;oBACxB,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAwD,CAAC,CAAC;oBAChF,OAAO;wBACN,GAAG,QAAQ;wBACX,OAAO,EAAE,cAAc,CAAC,UAAU,EAAE,WAAW,CAAC;qBAChD,CAAC;gBACH,CAAC;YACF,CAAC;YACD,IAAA,eAAI,EAAC,0CAA0C,CAAC,CAAC;QAClD,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACpD,MAAM,UAAU,GAAG,eAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACrC,6BAA6B;gBAC7B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC9B,MAAM,IAAI,qBAAU,CACnB,8EAA8E,CAC9E,CAAC;gBACH,CAAC;qBAAM,IAAI,eAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,KAAK,mBAAQ,CAAC,KAAK,EAAE,CAAC;oBAC5D,MAAM,SAAS,GAAG,eAAI,CAAC,GAAG,CAAC,IAAI,CAAW,CAAC;oBAC1C,UAA4B,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACnD,CAAC;qBAAM,CAAC;oBACP,MAAM,QAAQ,GAAG,eAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAChC,MAAM,YAAY,GAAG,eAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;oBAC7C,MAAM,WAAW,GACf,YAAY,CAAC,IAA4C,CAAC,QAAQ,CAAC;wBACpE,IAAA,eAAI,EAAC,uBAAuB,CAAC,CAAC;oBAC/B,IAAI,WAAW,YAAY,sBAAW,IAAI,WAAW,CAAC,IAAI,KAAK,oBAAS,CAAC,QAAQ,EAAE,CAAC;wBACnF,0GAA0G;wBACzG,UAAkB,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;oBAC3C,CAAC;yBAAM,CAAC;wBACP,MAAM,IAAI,qBAAU,CACnB,GAAG,QAAQ,sEAAsE,CACjF,CAAC;oBACH,CAAC;gBACF,CAAC;YACF,CAAC;iBAAM,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5B,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1E,KAAK,CAAC,WAAW,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YACzC,CAAC;YACD,OAAO,QAAQ,CAAC;QACjB,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC7D,MAAM,EAAE,cAAc,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAErD,MAAM,WAAW,GACf,cAAc,CAAC,IAA4C,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAC5E,IAAA,eAAI,EAAC,uBAAuB,CAAC,CAAC;YAE/B,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC;YAE3C,mJAAmJ;YACnJ,MAAM,gBAAgB,GAAI,YAAoB,CAAC,6BAAS,CAAC,CAAC;YAE1D,IAAI,cAAoC,CAAC;YACzC,6FAA6F;YAC7F,IAAI,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC/B,0GAA0G;gBACzG,IAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC;YAC9C,CAAC;YACD,kGAAkG;iBAC7F,IAAI,OAAO,WAAW,KAAK,UAAU,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAG,WAA0D,CAAC;gBAChF,gBAAgB,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;gBAC9C,MAAM,uBAAuB,GAAG,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC;gBAC/D,SAAS,EAAE,CAAC,uBAAuB,CAAC,CAAC;gBACrC,cAAc,GAAG,uBAAuB,CAAC;gBAEzC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;oBACjC,0GAA0G;oBAC1G,MAAM,KAAK,GAAI,IAAY,CAAC,QAAQ,CAAC,KAAK,CAAkB,CAAC;oBAC7D,IAAA,iBAAM,EAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,iCAAiC,CAAC,CAAC;oBAChE,IAAA,iBAAM,EACL,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,EACtC,wCAAwC,CACxC,CAAC;oBACF,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;oBACrB,0GAA0G;oBACzG,IAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,uBAAuB,CAAC;gBACzD,CAAC;qBAAM,CAAC;oBACP,0GAA0G;oBACzG,IAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,uBAAuB,CAAC;gBACzD,CAAC;YACF,CAAC;YACD,+FAA+F;iBAC1F,IAAI,WAAW,YAAY,sBAAW,EAAE,CAAC;gBAC7C,IAAI,WAAW,CAAC,IAAI,KAAK,oBAAS,CAAC,QAAQ,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAC3E,0GAA0G;oBACzG,IAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;gBAC3C,CAAC;qBAAM,CAAC;oBACP,KAAK,MAAM,WAAW,IAAI,WAAW,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;wBAC/D,IAAI,WAAW,CAAC,UAAU,KAAK,gBAAgB,EAAE,CAAC;4BACjD,IAAI,OAAO,WAAW,KAAK,UAAU,EAAE,CAAC;gCACvC,MAAM,YAAY,GAAG,WAER,CAAC;gCACd,MAAM,iBAAiB,GAAG,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC;gCACzD,cAAc,GAAG,iBAAiB,CAAC;gCACnC,0GAA0G;gCACzG,IAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,iBAAiB,CAAC;4BACnD,CAAC;iCAAM,CAAC;gCACP,0GAA0G;gCACzG,IAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC;4BAC9C,CAAC;wBACF,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;YACD,OAAO,cAAc,KAAK,SAAS;gBAClC,CAAC,CAAC,QAAQ;gBACV,CAAC,CAAC;oBACA,GAAG,QAAQ;oBACX,YAAY,EAAE,cAAc,CAAC,cAAc,EAAE,WAAW,CAAC;iBACzD,CAAC;QACL,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACb,iDAAiD;YACjD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC;YACzC,MAAM,EAAE,KAAK,EAAE,oBAAoB,EAAE,KAAK,EAAE,gBAAgB,EAAE,GAAG,YAAY,CAC5E,WAAW,EACX,WAAW,CACX,CAAC;YAEF,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5B,MAAM,UAAU,GAAG,iBAAiB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1D,MAAM,WAAW,GAAG,eAAI,CAAC,GAAG,CAAC,UAAU,CAAW,CAAC;gBACnD,MAAM,eAAe,GAAG,eAAI,CAAC,MAAM,CAAC,UAAU,CAAkB,CAAC;gBACjE,MAAM,iBAAiB,GAAG,eAAI,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;gBACvD,IAAI,iBAAiB,CAAC,IAAI,KAAK,mBAAQ,CAAC,KAAK,EAAE,CAAC;oBAC/C,MAAM,IAAI,qBAAU,CAAC,6CAA6C,CAAC,CAAC;gBACrE,CAAC;gBACD,MAAM,sBAAsB,GAAG,eAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;gBACjE,MAAM,YAAY,GAAG;oBACpB,GAAG,IAAA,gCAAqB,EAAC,sBAAsB,CAAC,IAA4B,CAAC;iBAC7E,CAAC;gBACF,MAAM,UAAU,GAAG,eAAe,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;gBACnD,IAAA,iBAAM,EAAC,UAAU,KAAK,SAAS,EAAE,yBAAyB,CAAC,CAAC;gBAC5D,IAAI,iBAAiB,CAAC,UAAsB,EAAE,YAAY,CAAC,EAAE,CAAC;oBAC7D,oBAAoB,CAAC,gBAAgB,CACpC,gBAAgB,EAChB,WAAW,EACX,WAAW,GAAG,CAAC,EACf,eAAe,CACf,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACP,MAAM,IAAI,qBAAU,CAAC,wCAAwC,CAAC,CAAC;gBAChE,CAAC;YACF,CAAC;iBAAM,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5B,MAAM,EACL,KAAK,EACL,UAAU,EAAE,gBAAgB,EAC5B,QAAQ,EAAE,cAAc,GACxB,GAAG,YAAY,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACtC,MAAM,sBAAsB,GAAG,eAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;gBACjE,MAAM,YAAY,GAAG;oBACpB,GAAG,IAAA,gCAAqB,EAAC,sBAAsB,CAAC,IAA4B,CAAC;iBAC7E,CAAC;gBACF,KAAK,IAAI,CAAC,GAAG,gBAAgB,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;oBACxD,MAAM,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC/B,IAAA,iBAAM,EAAC,UAAU,KAAK,SAAS,EAAE,yBAAyB,CAAC,CAAC;oBAC5D,IAAI,CAAC,iBAAiB,CAAC,UAAsB,EAAE,YAAY,CAAC,EAAE,CAAC;wBAC9D,MAAM,IAAI,qBAAU,CAAC,wCAAwC,CAAC,CAAC;oBAChE,CAAC;gBACF,CAAC;gBACD,oBAAoB,CAAC,gBAAgB,CACpC,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,EACd,KAAK,CACL,CAAC;YACH,CAAC;YACD,OAAO,QAAQ,CAAC;QACjB,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;YACT,IAAA,eAAI,EAAC,mBAAmB,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;AACF,CAAC;AA9MD,wCA8MC;AAED,SAAS,iBAAiB,CAAC,IAAc,EAAE,YAA8B;IACxE,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACxC,IAAI,eAAI,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACb,CAAC;IACF,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,OAAgB;IACpC,OAAO,CACN,OAAO,OAAO,KAAK,QAAQ;QAC3B,OAAO,OAAO,KAAK,QAAQ;QAC3B,OAAO,OAAO,KAAK,SAAS;QAC5B,OAAO,KAAK,SAAS;QACrB,OAAO,KAAK,IAAI,CAChB,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,SAAoB;IAC3C,OAAO,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,IAAI,SAAS,CAAC;AACrE,CAAC;AAED,SAAS,OAAO,CAAC,SAAoB;IACpC,OAAO,MAAM,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC;AACjD,CAAC;AAQD,SAAS,YAAY,CAAC,KAAY,EAAE,WAAwB;IAC3D,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACtF,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IAEhF,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;QAC3B,MAAM,IAAI,qBAAU,CACnB,+EAA+E,CAC/E,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AACnD,CAAC;AAED,SAAS,YAAY,CACpB,KAA+B,EAC/B,WAAwB;IAKxB,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,IAAA,eAAI,EAAC,sBAAsB,CAAC,CAAC;QACnF,MAAM,KAAK,GAAI,MAA6C,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1E,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,qBAAU,CAAC,4BAA4B,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,MAAM,GAAG,eAAI,CAAC,MAAM,CAAC,KAAiB,CAAC,CAAC;QAC9C,IAAI,MAAM,CAAC,IAAI,KAAK,mBAAQ,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,IAAI,qBAAU,CAAC,uCAAuC,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO;YACN,KAAK,EAAE,KAAsB;YAC7B,KAAK,EAAE,KAAK,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,KAAuB,CAAC,MAAM;SACvE,CAAC;IACH,CAAC;SAAM,CAAC;QACP,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,eAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,eAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,IAAI,qBAAU,CAAC,sCAAsC,CAAC,CAAC;QAC9D,CAAC;QACD,MAAM,MAAM,GAAG,eAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,IAAI,KAAK,mBAAQ,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,IAAI,qBAAU,CAAC,uCAAuC,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO;YACN,KAAK,EAAE,MAAkC;YACzC,KAAK,EAAE,KAAK,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAE,SAAoB,CAAC,CAAC,CAAE,SAAoB,GAAG,CAAC;SACnF,CAAC;IACH,CAAC;AACF,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,MAAoB,EAAE,WAAwB;IACxE,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChD,IAAA,iBAAM,EAAC,IAAI,KAAK,SAAS,EAAE,oCAAoC,CAAC,CAAC;IACjE,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,QAAkB,EAAE,WAAwB;IACzE,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,IAAI,QAAQ,CAAC,WAAW,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACjD,IAAI,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE,CAAC;oBACpE,MAAM,IAAI,qBAAU,CAAC,eAAe,QAAQ,CAAC,WAAW,CAAC,MAAM,iBAAiB,CAAC,CAAC;gBACnF,CAAC;YACF,CAAC;iBAAM,CAAC;gBACP,IAAI,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;oBACtE,MAAM,IAAI,qBAAU,CAAC,eAAe,QAAQ,CAAC,WAAW,CAAC,QAAQ,iBAAiB,CAAC,CAAC;gBACrF,CAAC;YACF,CAAC;YACD,MAAM;QACP,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,gBAAgB,GAAG;oBACxB,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM;oBAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM;iBACzB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE3C,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACjC,MAAM,IAAI,qBAAU,CAAC,iBAAiB,gBAAgB,kBAAkB,CAAC,CAAC;gBAC3E,CAAC;YACF,CAAC;iBAAM,IACN,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAC/B,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,SAAS,EACxD,CAAC;gBACF,MAAM,IAAI,qBAAU,CAAC,eAAe,QAAQ,CAAC,MAAM,CAAC,MAAM,iBAAiB,CAAC,CAAC;YAC9E,CAAC;YACD,MAAM;QACP,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,IAAI,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC/D,MAAM,IAAI,qBAAU,CAAC,eAAe,QAAQ,CAAC,MAAM,CAAC,MAAM,iBAAiB,CAAC,CAAC;YAC9E,CAAC;YACD,MAAM;QACP,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACb,MAAM,gBAAgB,GAAa,EAAE,CAAC;YACtC,mBAAmB;YACnB,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,gBAAgB,GAAG;oBACxB,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM;oBAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM;iBACzB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE3C,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACjC,gBAAgB,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;gBAC5C,CAAC;YACF,CAAC;iBAAM,IACN,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAC/B,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,SAAS,EACxD,CAAC;gBACF,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC/C,CAAC;YAED,wBAAwB;YACxB,IAAI,QAAQ,CAAC,WAAW,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACjD,IAAI,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE,CAAC;oBACpE,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBACpD,CAAC;YACF,CAAC;iBAAM,CAAC;gBACP,IAAI,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;oBACtE,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;gBACtD,CAAC;YACF,CAAC;YACD,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,qBAAU,CAAC,iBAAiB,gBAAgB,kBAAkB,CAAC,CAAC;YAC3E,CAAC;YACD,MAAM;QACP,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;YACT,MAAM;QACP,CAAC;IACF,CAAC;AACF,CAAC;AAOD,SAAS,mBAAmB,CAAC,IAAc;IAC1C,MAAM,cAAc,GAAG,eAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,gBAAgB,GAAG,cAA6D,CAAC;IACvF,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,CAAC;AAC7C,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\";\nimport { isFluidHandle } from \"@fluidframework/runtime-utils\";\nimport { UsageError } from \"@fluidframework/telemetry-utils/internal\";\nimport {\n\tTree,\n\tNodeKind,\n\ttype ImplicitAllowedTypes,\n\ttype TreeArrayNode,\n\ttype TreeNode,\n\ttype TreeNodeSchema,\n\ttype SimpleNodeSchema,\n\tFieldKind,\n\tFieldSchema,\n\tnormalizeAllowedTypes,\n\ttype ImplicitFieldSchema,\n\tbooleanSchema,\n\thandleSchema,\n\tnullSchema,\n\tnumberSchema,\n\tstringSchema,\n\ttype IterableTreeArrayContent,\n} from \"@fluidframework/tree/internal\";\n\nimport {\n\ttype TreeEdit,\n\ttype ObjectTarget,\n\ttype Selection,\n\ttype Range,\n\ttype ObjectPlace,\n\ttype ArrayPlace,\n\ttype TreeEditObject,\n\ttype TreeEditValue,\n\ttypeField,\n} from \"./agentEditTypes.js\";\nimport type { IdGenerator } from \"./idGenerator.js\";\nimport type { JsonValue } from \"./jsonTypes.js\";\nimport { toDecoratedJson } from \"./promptGeneration.js\";\nimport { fail } from \"./utils.js\";\n\nfunction populateDefaults(\n\tjson: JsonValue,\n\tdefinitionMap: ReadonlyMap<string, SimpleNodeSchema>,\n): void {\n\tif (typeof json === \"object\") {\n\t\tif (json === null) {\n\t\t\treturn;\n\t\t}\n\t\tif (Array.isArray(json)) {\n\t\t\tfor (const element of json) {\n\t\t\t\tpopulateDefaults(element, definitionMap);\n\t\t\t}\n\t\t} else {\n\t\t\tassert(\n\t\t\t\ttypeof json[typeField] === \"string\",\n\t\t\t\t\"The typeField must be present in new JSON content\",\n\t\t\t);\n\t\t\tconst nodeSchema = definitionMap.get(json[typeField]);\n\t\t\tassert(nodeSchema?.kind === NodeKind.Object, \"Expected object schema\");\n\t\t}\n\t}\n}\n\nfunction getSchemaIdentifier(content: TreeEditValue): string | undefined {\n\tswitch (typeof content) {\n\t\tcase \"boolean\": {\n\t\t\treturn booleanSchema.identifier;\n\t\t}\n\t\tcase \"number\": {\n\t\t\treturn numberSchema.identifier;\n\t\t}\n\t\tcase \"string\": {\n\t\t\treturn stringSchema.identifier;\n\t\t}\n\t\tcase \"object\": {\n\t\t\tif (content === null) {\n\t\t\t\treturn nullSchema.identifier;\n\t\t\t}\n\t\t\tif (Array.isArray(content)) {\n\t\t\t\tthrow new UsageError(\"Arrays are not currently supported in this context\");\n\t\t\t}\n\t\t\tif (isFluidHandle(content)) {\n\t\t\t\treturn handleSchema.identifier;\n\t\t\t}\n\t\t\treturn content[typeField];\n\t\t}\n\t\tdefault: {\n\t\t\tthrow new UsageError(\"Unsupported content type\");\n\t\t}\n\t}\n}\n\nfunction contentWithIds(content: TreeNode, idGenerator: IdGenerator): TreeEditObject {\n\treturn JSON.parse(toDecoratedJson(idGenerator, content)) as TreeEditObject;\n}\n\n/**\n * Manages applying the various types of {@link TreeEdit}'s to a a given {@link TreeNode}.\n */\nexport function applyAgentEdit(\n\ttreeEdit: TreeEdit,\n\tidGenerator: IdGenerator,\n\tdefinitionMap: ReadonlyMap<string, SimpleNodeSchema>,\n\tvalidator?: (edit: TreeNode) => void,\n): TreeEdit {\n\tassertObjectIdsExist(treeEdit, idGenerator);\n\tswitch (treeEdit.type) {\n\t\tcase \"insert\": {\n\t\t\tconst { array, index } = getPlaceInfo(treeEdit.destination, idGenerator);\n\n\t\t\tconst parentNodeSchema = Tree.schema(array);\n\t\t\tpopulateDefaults(treeEdit.content, definitionMap);\n\n\t\t\tconst schemaIdentifier = getSchemaIdentifier(treeEdit.content);\n\n\t\t\t// We assume that the parentNode for inserts edits are guaranteed to be an arrayNode.\n\t\t\tconst allowedTypes = [\n\t\t\t\t...normalizeAllowedTypes(parentNodeSchema.info as ImplicitAllowedTypes),\n\t\t\t];\n\n\t\t\tfor (const allowedType of allowedTypes.values()) {\n\t\t\t\tif (allowedType.identifier === schemaIdentifier && typeof allowedType === \"function\") {\n\t\t\t\t\tconst simpleNodeSchema = allowedType as unknown as new (dummy: unknown) => TreeNode;\n\t\t\t\t\tconst insertNode = new simpleNodeSchema(treeEdit.content);\n\t\t\t\t\tvalidator?.(insertNode);\n\t\t\t\t\tarray.insertAt(index, insertNode as unknown as IterableTreeArrayContent<never>);\n\t\t\t\t\treturn {\n\t\t\t\t\t\t...treeEdit,\n\t\t\t\t\t\tcontent: contentWithIds(insertNode, idGenerator),\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\t\t\tfail(\"inserted node must be of an allowed type\");\n\t\t}\n\t\tcase \"remove\": {\n\t\t\tconst source = treeEdit.source;\n\t\t\tif (isObjectTarget(source)) {\n\t\t\t\tconst node = getNodeFromTarget(source, idGenerator);\n\t\t\t\tconst parentNode = Tree.parent(node);\n\t\t\t\t// Case for deleting rootNode\n\t\t\t\tif (parentNode === undefined) {\n\t\t\t\t\tthrow new UsageError(\n\t\t\t\t\t\t\"The root is required, and cannot be removed. Please use modify edit instead.\",\n\t\t\t\t\t);\n\t\t\t\t} else if (Tree.schema(parentNode).kind === NodeKind.Array) {\n\t\t\t\t\tconst nodeIndex = Tree.key(node) as number;\n\t\t\t\t\t(parentNode as TreeArrayNode).removeAt(nodeIndex);\n\t\t\t\t} else {\n\t\t\t\t\tconst fieldKey = Tree.key(node);\n\t\t\t\t\tconst parentSchema = Tree.schema(parentNode);\n\t\t\t\t\tconst fieldSchema =\n\t\t\t\t\t\t(parentSchema.info as Record<string, ImplicitFieldSchema>)[fieldKey] ??\n\t\t\t\t\t\tfail(\"Expected field schema\");\n\t\t\t\t\tif (fieldSchema instanceof FieldSchema && fieldSchema.kind === FieldKind.Optional) {\n\t\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t\t\t(parentNode as any)[fieldKey] = undefined;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new UsageError(\n\t\t\t\t\t\t\t`${fieldKey} is required, and cannot be removed. Please use modify edit instead.`,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (isRange(source)) {\n\t\t\t\tconst { array, startIndex, endIndex } = getRangeInfo(source, idGenerator);\n\t\t\t\tarray.removeRange(startIndex, endIndex);\n\t\t\t}\n\t\t\treturn treeEdit;\n\t\t}\n\t\tcase \"modify\": {\n\t\t\tconst node = getNodeFromTarget(treeEdit.target, idGenerator);\n\t\t\tconst { treeNodeSchema } = getSimpleNodeSchema(node);\n\n\t\t\tconst fieldSchema =\n\t\t\t\t(treeNodeSchema.info as Record<string, ImplicitFieldSchema>)[treeEdit.field] ??\n\t\t\t\tfail(\"Expected field schema\");\n\n\t\t\tconst modification = treeEdit.modification;\n\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-assignment, @typescript-eslint/no-unsafe-member-access\n\t\t\tconst schemaIdentifier = (modification as any)[typeField];\n\n\t\t\tlet insertedObject: TreeNode | undefined;\n\t\t\t// if fieldSchema is a LeafnodeSchema, we can check that it's a valid type and set the field.\n\t\t\tif (isPrimitive(modification)) {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t(node as any)[treeEdit.field] = modification;\n\t\t\t}\n\t\t\t// If the fieldSchema is a function we can grab the constructor and make an instance of that node.\n\t\t\telse if (typeof fieldSchema === \"function\") {\n\t\t\t\tconst simpleSchema = fieldSchema as unknown as new (dummy: unknown) => TreeNode;\n\t\t\t\tpopulateDefaults(modification, definitionMap);\n\t\t\t\tconst constructedModification = new simpleSchema(modification);\n\t\t\t\tvalidator?.(constructedModification);\n\t\t\t\tinsertedObject = constructedModification;\n\n\t\t\t\tif (Array.isArray(modification)) {\n\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t\tconst field = (node as any)[treeEdit.field] as TreeArrayNode;\n\t\t\t\t\tassert(Array.isArray(field), \"the field must be an array node\");\n\t\t\t\t\tassert(\n\t\t\t\t\t\tArray.isArray(constructedModification),\n\t\t\t\t\t\t\"the modification must be an array node\",\n\t\t\t\t\t);\n\t\t\t\t\tfield.removeRange(0);\n\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t\t(node as any)[treeEdit.field] = constructedModification;\n\t\t\t\t} else {\n\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t\t(node as any)[treeEdit.field] = constructedModification;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If the fieldSchema is of type FieldSchema, we can check its allowed types and set the field.\n\t\t\telse if (fieldSchema instanceof FieldSchema) {\n\t\t\t\tif (fieldSchema.kind === FieldKind.Optional && modification === undefined) {\n\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t\t(node as any)[treeEdit.field] = undefined;\n\t\t\t\t} else {\n\t\t\t\t\tfor (const allowedType of fieldSchema.allowedTypeSet.values()) {\n\t\t\t\t\t\tif (allowedType.identifier === schemaIdentifier) {\n\t\t\t\t\t\t\tif (typeof allowedType === \"function\") {\n\t\t\t\t\t\t\t\tconst simpleSchema = allowedType as unknown as new (\n\t\t\t\t\t\t\t\t\tdummy: unknown,\n\t\t\t\t\t\t\t\t) => TreeNode;\n\t\t\t\t\t\t\t\tconst constructedObject = new simpleSchema(modification);\n\t\t\t\t\t\t\t\tinsertedObject = constructedObject;\n\t\t\t\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t\t\t\t\t(node as any)[treeEdit.field] = constructedObject;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\n\t\t\t\t\t\t\t\t(node as any)[treeEdit.field] = modification;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn insertedObject === undefined\n\t\t\t\t? treeEdit\n\t\t\t\t: {\n\t\t\t\t\t\t...treeEdit,\n\t\t\t\t\t\tmodification: contentWithIds(insertedObject, idGenerator),\n\t\t\t\t\t};\n\t\t}\n\t\tcase \"move\": {\n\t\t\t// TODO: need to add schema check for valid moves\n\t\t\tconst source = treeEdit.source;\n\t\t\tconst destination = treeEdit.destination;\n\t\t\tconst { array: destinationArrayNode, index: destinationIndex } = getPlaceInfo(\n\t\t\t\tdestination,\n\t\t\t\tidGenerator,\n\t\t\t);\n\n\t\t\tif (isObjectTarget(source)) {\n\t\t\t\tconst sourceNode = getNodeFromTarget(source, idGenerator);\n\t\t\t\tconst sourceIndex = Tree.key(sourceNode) as number;\n\t\t\t\tconst sourceArrayNode = Tree.parent(sourceNode) as TreeArrayNode;\n\t\t\t\tconst sourceArraySchema = Tree.schema(sourceArrayNode);\n\t\t\t\tif (sourceArraySchema.kind !== NodeKind.Array) {\n\t\t\t\t\tthrow new UsageError(\"the source node must be within an arrayNode\");\n\t\t\t\t}\n\t\t\t\tconst destinationArraySchema = Tree.schema(destinationArrayNode);\n\t\t\t\tconst allowedTypes = [\n\t\t\t\t\t...normalizeAllowedTypes(destinationArraySchema.info as ImplicitAllowedTypes),\n\t\t\t\t];\n\t\t\t\tconst nodeToMove = sourceArrayNode.at(sourceIndex);\n\t\t\t\tassert(nodeToMove !== undefined, \"node to move must exist\");\n\t\t\t\tif (isNodeAllowedType(nodeToMove as TreeNode, allowedTypes)) {\n\t\t\t\t\tdestinationArrayNode.moveRangeToIndex(\n\t\t\t\t\t\tdestinationIndex,\n\t\t\t\t\t\tsourceIndex,\n\t\t\t\t\t\tsourceIndex + 1,\n\t\t\t\t\t\tsourceArrayNode,\n\t\t\t\t\t);\n\t\t\t\t} else {\n\t\t\t\t\tthrow new UsageError(\"Illegal node type in destination array\");\n\t\t\t\t}\n\t\t\t} else if (isRange(source)) {\n\t\t\t\tconst {\n\t\t\t\t\tarray,\n\t\t\t\t\tstartIndex: sourceStartIndex,\n\t\t\t\t\tendIndex: sourceEndIndex,\n\t\t\t\t} = getRangeInfo(source, idGenerator);\n\t\t\t\tconst destinationArraySchema = Tree.schema(destinationArrayNode);\n\t\t\t\tconst allowedTypes = [\n\t\t\t\t\t...normalizeAllowedTypes(destinationArraySchema.info as ImplicitAllowedTypes),\n\t\t\t\t];\n\t\t\t\tfor (let i = sourceStartIndex; i < sourceEndIndex; i++) {\n\t\t\t\t\tconst nodeToMove = array.at(i);\n\t\t\t\t\tassert(nodeToMove !== undefined, \"node to move must exist\");\n\t\t\t\t\tif (!isNodeAllowedType(nodeToMove as TreeNode, allowedTypes)) {\n\t\t\t\t\t\tthrow new UsageError(\"Illegal node type in destination array\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tdestinationArrayNode.moveRangeToIndex(\n\t\t\t\t\tdestinationIndex,\n\t\t\t\t\tsourceStartIndex,\n\t\t\t\t\tsourceEndIndex,\n\t\t\t\t\tarray,\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn treeEdit;\n\t\t}\n\t\tdefault: {\n\t\t\tfail(\"invalid tree edit\");\n\t\t}\n\t}\n}\n\nfunction isNodeAllowedType(node: TreeNode, allowedTypes: TreeNodeSchema[]): boolean {\n\tfor (const allowedType of allowedTypes) {\n\t\tif (Tree.is(node, allowedType)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nfunction isPrimitive(content: unknown): boolean {\n\treturn (\n\t\ttypeof content === \"number\" ||\n\t\ttypeof content === \"string\" ||\n\t\ttypeof content === \"boolean\" ||\n\t\tcontent === undefined ||\n\t\tcontent === null\n\t);\n}\n\nfunction isObjectTarget(selection: Selection): selection is ObjectTarget {\n\treturn Object.keys(selection).length === 1 && \"target\" in selection;\n}\n\nfunction isRange(selection: Selection): selection is Range {\n\treturn \"from\" in selection && \"to\" in selection;\n}\n\ninterface RangeInfo {\n\tarray: TreeArrayNode;\n\tstartIndex: number;\n\tendIndex: number;\n}\n\nfunction getRangeInfo(range: Range, idGenerator: IdGenerator): RangeInfo {\n\tconst { array: arrayFrom, index: startIndex } = getPlaceInfo(range.from, idGenerator);\n\tconst { array: arrayTo, index: endIndex } = getPlaceInfo(range.to, idGenerator);\n\n\tif (arrayFrom !== arrayTo) {\n\t\tthrow new UsageError(\n\t\t\t'The \"from\" node and \"to\" nodes of the range must be in the same parent array.',\n\t\t);\n\t}\n\n\treturn { array: arrayFrom, startIndex, endIndex };\n}\n\nfunction getPlaceInfo(\n\tplace: ObjectPlace | ArrayPlace,\n\tidGenerator: IdGenerator,\n): {\n\tarray: TreeArrayNode;\n\tindex: number;\n} {\n\tif (place.type === \"arrayPlace\") {\n\t\tconst parent = idGenerator.getNode(place.parentId) ?? fail(\"Expected parent node\");\n\t\tconst child = (parent as unknown as Record<string, unknown>)[place.field];\n\t\tif (child === undefined) {\n\t\t\tthrow new UsageError(`No child under field field`);\n\t\t}\n\t\tconst schema = Tree.schema(child as TreeNode);\n\t\tif (schema.kind !== NodeKind.Array) {\n\t\t\tthrow new UsageError(\"Expected child to be in an array node\");\n\t\t}\n\t\treturn {\n\t\t\tarray: child as TreeArrayNode,\n\t\t\tindex: place.location === \"start\" ? 0 : (child as TreeArrayNode).length,\n\t\t};\n\t} else {\n\t\tconst node = getNodeFromTarget(place, idGenerator);\n\t\tconst nodeIndex = Tree.key(node);\n\t\tconst parent = Tree.parent(node);\n\t\tif (parent === undefined) {\n\t\t\tthrow new UsageError(\"TODO: root node target not supported\");\n\t\t}\n\t\tconst schema = Tree.schema(parent);\n\t\tif (schema.kind !== NodeKind.Array) {\n\t\t\tthrow new UsageError(\"Expected child to be in an array node\");\n\t\t}\n\t\treturn {\n\t\t\tarray: parent as unknown as TreeArrayNode,\n\t\t\tindex: place.place === \"before\" ? (nodeIndex as number) : (nodeIndex as number) + 1,\n\t\t};\n\t}\n}\n\n/**\n * Returns the target node with the matching internal objectId using the provided {@link ObjectTarget}\n */\nfunction getNodeFromTarget(target: ObjectTarget, idGenerator: IdGenerator): TreeNode {\n\tconst node = idGenerator.getNode(target.target);\n\tassert(node !== undefined, \"objectId does not exist in nodeMap\");\n\treturn node;\n}\n\n/**\n * Checks that the objectIds of the Tree Nodes within the givin the {@link TreeEdit} exist within the given {@link IdGenerator}\n *\n * @throws An {@link UsageError} if the objectIdKey does not exist in the {@link IdGenerator}\n */\nfunction assertObjectIdsExist(treeEdit: TreeEdit, idGenerator: IdGenerator): void {\n\tswitch (treeEdit.type) {\n\t\tcase \"insert\": {\n\t\t\tif (treeEdit.destination.type === \"objectPlace\") {\n\t\t\t\tif (idGenerator.getNode(treeEdit.destination.target) === undefined) {\n\t\t\t\t\tthrow new UsageError(`objectIdKey ${treeEdit.destination.target} does not exist`);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (idGenerator.getNode(treeEdit.destination.parentId) === undefined) {\n\t\t\t\t\tthrow new UsageError(`objectIdKey ${treeEdit.destination.parentId} does not exist`);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase \"remove\": {\n\t\t\tif (isRange(treeEdit.source)) {\n\t\t\t\tconst missingObjectIds = [\n\t\t\t\t\ttreeEdit.source.from.target,\n\t\t\t\t\ttreeEdit.source.to.target,\n\t\t\t\t].filter((id) => !idGenerator.getNode(id));\n\n\t\t\t\tif (missingObjectIds.length > 0) {\n\t\t\t\t\tthrow new UsageError(`objectIdKeys [${missingObjectIds}] does not exist`);\n\t\t\t\t}\n\t\t\t} else if (\n\t\t\t\tisObjectTarget(treeEdit.source) &&\n\t\t\t\tidGenerator.getNode(treeEdit.source.target) === undefined\n\t\t\t) {\n\t\t\t\tthrow new UsageError(`objectIdKey ${treeEdit.source.target} does not exist`);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase \"modify\": {\n\t\t\tif (idGenerator.getNode(treeEdit.target.target) === undefined) {\n\t\t\t\tthrow new UsageError(`objectIdKey ${treeEdit.target.target} does not exist`);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase \"move\": {\n\t\t\tconst invalidObjectIds: string[] = [];\n\t\t\t// check the source\n\t\t\tif (isRange(treeEdit.source)) {\n\t\t\t\tconst missingObjectIds = [\n\t\t\t\t\ttreeEdit.source.from.target,\n\t\t\t\t\ttreeEdit.source.to.target,\n\t\t\t\t].filter((id) => !idGenerator.getNode(id));\n\n\t\t\t\tif (missingObjectIds.length > 0) {\n\t\t\t\t\tinvalidObjectIds.push(...missingObjectIds);\n\t\t\t\t}\n\t\t\t} else if (\n\t\t\t\tisObjectTarget(treeEdit.source) &&\n\t\t\t\tidGenerator.getNode(treeEdit.source.target) === undefined\n\t\t\t) {\n\t\t\t\tinvalidObjectIds.push(treeEdit.source.target);\n\t\t\t}\n\n\t\t\t// check the destination\n\t\t\tif (treeEdit.destination.type === \"objectPlace\") {\n\t\t\t\tif (idGenerator.getNode(treeEdit.destination.target) === undefined) {\n\t\t\t\t\tinvalidObjectIds.push(treeEdit.destination.target);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (idGenerator.getNode(treeEdit.destination.parentId) === undefined) {\n\t\t\t\t\tinvalidObjectIds.push(treeEdit.destination.parentId);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (invalidObjectIds.length > 0) {\n\t\t\t\tthrow new UsageError(`objectIdKeys [${invalidObjectIds}] does not exist`);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tdefault: {\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\ninterface SchemaInfo {\n\ttreeNodeSchema: TreeNodeSchema;\n\tsimpleNodeSchema: new (dummy: unknown) => TreeNode;\n}\n\nfunction getSimpleNodeSchema(node: TreeNode): SchemaInfo {\n\tconst treeNodeSchema = Tree.schema(node);\n\tconst simpleNodeSchema = treeNodeSchema as unknown as new (dummy: unknown) => TreeNode;\n\treturn { treeNodeSchema, simpleNodeSchema };\n}\n"]}

package/dist/explicit-strategy/agentEditTypes.d.ts

@@ -0,0 +1,158 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import type { JsonPrimitive } from "./jsonTypes.js";
+/**
+ * TODO: The current scheme does not allow manipulation of arrays of primitive values because you cannot refer to them.
+ * We could accomplish this via a path (probably JSON Pointer or JSONPath) from a possibly-null objectId, or wrap arrays in an identified object.
+ *
+ * TODO: only 100 object fields total are allowed by OpenAI right now, so larger schemas will fail faster if we have a bunch of schema types generated for type-specific edits.
+ *
+ * TODO: experiment using https://github.com/outlines-dev/outlines (and maybe a llama model) to avoid many of the annoyances of OpenAI's JSON Schema subset.
+ *
+ * TODO: without field count limits, we could generate a schema for valid paths from the root object to any field, but it's not clear how useful that would be.
+ *
+ * TODO: We don't supported nested arrays yet.
+ *
+ * TODO: Add a prompt suggestion API!
+ *
+ * TODO: Could encourage the model to output more technical explanations of the edits (e.g. "insert a new Foo after "Foo2").
+ *
+ * TODO: Get explanation strings from o1.
+ *
+ * TODO: Tests of range edits.
+ *
+ * TODO: Handle 429 rate limit error from OpenAI.
+ *
+ * TODO: Add an app-specific guidance string.
+ *
+ * TODO: Give the model a final chance to evaluate the result.
+ *
+ * TODO: Separate system prompt into [system, user, system] for security.
+ *
+ * TODO: Top level arrays are not supported with current DSL.
+ *
+ * TODO: Structured Output fails when multiple schema types have the same first field name (e.g. id: sf.identifier on multiple types).
+ *
+ * TODO: Pass descriptions from schema metadata to the generated TS types that we put in the prompt
+ */
+/**
+ * This is the field we force the LLM to generate to avoid any type ambiguity (e.g. a vector and a point both have x/y and are ambiguous without the LLM telling us which it means).
+ */
+export declare const typeField = "__fluid_type";
+/**
+ * A field that is  auto-generated and injected into nodes before passing data to the LLM to ensure the LLM can refer to nodes in a stable way.
+ */
+export declare const objectIdKey = "__fluid_objectId";
+/**
+ * Describes an edit to a field within a node.
+ * @remarks TODO: what is the [key: string] for?
+ */
+export interface TreeEditObject {
+    [key: string]: TreeEditValue;
+    [typeField]: string;
+}
+/**
+ * An array of {@link TreeEditValue}'s, allowing a single {@link TreeEdit} to contain edits to multiple fields.
+ */
+export type TreeEditArray = TreeEditValue[];
+/**
+ * The potential values for a given {@link TreeEdit}.
+ * @remarks These values are typically a field within a node or an entire node,
+ */
+export type TreeEditValue = JsonPrimitive | TreeEditObject | TreeEditArray;
+/**
+ * This is the the final object we expected from an LLM response.
+ * @remarks Because TreeEdit can be multiple different types (polymorphic),
+ * we need to wrap to avoid anyOf at the root level when generating the necessary JSON Schema.
+ */
+export interface EditWrapper {
+    edit: TreeEdit | null;
+}
+/**
+ * Union type representing all possible types of edits that can be made to a tree.
+ */
+export type TreeEdit = Insert | Modify | Remove | Move;
+/**
+ * The base interface for all types of {@link TreeEdit}.
+ */
+export interface Edit {
+    explanation: string;
+    type: "insert" | "modify" | "remove" | "move";
+}
+/**
+ * This object provides a way to 'select' either a given node or a range of nodes in an array.
+ */
+export type Selection = ObjectTarget | Range;
+/**
+ * A Target object for an {@link TreeEdit}, identified by the target object's Id
+ */
+export interface ObjectTarget {
+    target: string;
+}
+/**
+ * Desribes where an object can be inserted into an array.
+ * For example, if you have an array with 5 objects, and you insert an object at index 3, this differentiates whether you want
+ * the existing item at index 3 to be shifted forward (if the 'location' is 'start') or shifted backwards (if the 'location' is 'end')
+ *
+ * @remarks TODO: Allow support for nested arrays
+ */
+export interface ArrayPlace {
+    type: "arrayPlace";
+    parentId: string;
+    field: string;
+    location: "start" | "end";
+}
+/**
+ * Desribes where an object can be inserted into an array.
+ * For example, if you have an array with 5 objects, and you insert an object at index 3, this differentiates whether you want
+ * the existing item at index 3 to be shifted forward (if the 'location' is 'start') or shifted backwards (if the 'location' is 'end')
+ *
+ * @remarks Why does this and {@link ArrayPlace} exist together?
+ */
+export interface ObjectPlace extends ObjectTarget {
+    type: "objectPlace";
+    place: "before" | "after";
+}
+/**
+ * A range of objects within an array. This allows the LLM to select multiple nodes at once,
+ * for example during an {@link Remove} operation to remove a range of nodes.
+ */
+export interface Range {
+    from: ObjectPlace;
+    to: ObjectPlace;
+}
+/**
+ * Describes an operation to insert a new node into the tree.
+ */
+export interface Insert extends Edit {
+    type: "insert";
+    content: TreeEditObject | JsonPrimitive;
+    destination: ObjectPlace | ArrayPlace;
+}
+/**
+ * Describes an operation to modify an existing node in the tree.
+ */
+export interface Modify extends Edit {
+    type: "modify";
+    target: ObjectTarget;
+    field: string;
+    modification: TreeEditValue;
+}
+/**
+ * Describes an operation to remove either a specific node or a range of nodes in an array.
+ */
+export interface Remove extends Edit {
+    type: "remove";
+    source: Selection;
+}
+/**
+ * Describes an operation to move a node within an array
+ */
+export interface Move extends Edit {
+    type: "move";
+    source: Selection;
+    destination: ObjectPlace | ArrayPlace;
+}
+//# sourceMappingURL=agentEditTypes.d.ts.map

package/dist/explicit-strategy/agentEditTypes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agentEditTypes.d.ts","sourceRoot":"","sources":["../../src/explicit-strategy/agentEditTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAEpD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS,iBAAiB,CAAC;AAExC;;GAEG;AACH,eAAO,MAAM,WAAW,qBAAqB,CAAC;AAE9C;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC9B,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa,CAAC;IAC7B,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AACD;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,aAAa,EAAE,CAAC;AAE5C;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,aAAa,GAAG,cAAc,GAAG,aAAa,CAAC;AAE3E;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAE3B,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AAEvD;;GAEG;AACH,MAAM,WAAW,IAAI;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,CAAC;CAC9C;AAED;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,YAAY,GAAG,KAAK,CAAC;AAE7C;;GAEG;AACH,MAAM,WAAW,YAAY;IAC5B,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IAC1B,IAAI,EAAE,YAAY,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,OAAO,GAAG,KAAK,CAAC;CAC1B;AAED;;;;;;GAMG;AACH,MAAM,WAAW,WAAY,SAAQ,YAAY;IAChD,IAAI,EAAE,aAAa,CAAC;IAEpB,KAAK,EAAE,QAAQ,GAAG,OAAO,CAAC;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,KAAK;IACrB,IAAI,EAAE,WAAW,CAAC;IAClB,EAAE,EAAE,WAAW,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,MAAO,SAAQ,IAAI;IACnC,IAAI,EAAE,QAAQ,CAAC;IACf,OAAO,EAAE,cAAc,GAAG,aAAa,CAAC;IACxC,WAAW,EAAE,WAAW,GAAG,UAAU,CAAC;CACtC;AAED;;GAEG;AACH,MAAM,WAAW,MAAO,SAAQ,IAAI;IACnC,IAAI,EAAE,QAAQ,CAAC;IACf,MAAM,EAAE,YAAY,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,aAAa,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,MAAO,SAAQ,IAAI;IACnC,IAAI,EAAE,QAAQ,CAAC;IACf,MAAM,EAAE,SAAS,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,IAAK,SAAQ,IAAI;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,SAAS,CAAC;IAClB,WAAW,EAAE,WAAW,GAAG,UAAU,CAAC;CACtC"}