@cr_docs_t/dts 0.24.0 → 0.26.0

package/dist/dts/Fugue/FNode.d.ts

@@ -1,8 +1,6 @@
-import { Operation } from "../../types";
-export declare class FNode<P> {
+export declare class FListNode<P> {
     value?: string;
-    operation?: Operation;
     position: P;
-    constructor(position: P, value?: string, operation?: Operation);
+    constructor(position: P, value?: string);
 }
 //# sourceMappingURL=FNode.d.ts.map

package/dist/dts/Fugue/FNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"FNode.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/FNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC,qBAAa,KAAK,CAAC,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,QAAQ,EAAE,CAAC,CAAC;gBAEA,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS;CAIjE"}
+{"version":3,"file":"FNode.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/FNode.ts"],"names":[],"mappings":"AAEA,qBAAa,SAAS,CAAC,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,CAAC,CAAC;gBAEA,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM;CAI1C"}

package/dist/dts/Fugue/FNode.js

@@ -1,5 +1,5 @@
-export class FNode {
-    constructor(position, value, operation) {
+export class FListNode {
+    constructor(position, value) {
         this.value = value;
         this.position = position;
     }

package/dist/dts/Fugue/FugueList.d.ts

@@ -1,4 +1,4 @@
-import { FugueState, FugueMessage } from "../../types/index.js";
+import { FugueState, FugueMessage } from "../../types/Fugue/index.js";
 import { UniquelyDenseTotalOrder } from "../TotalOrder/UniquelyDenseTotalOrder.js";
 /**
  * A Fugue List CRDT, with insert and delete operations

package/dist/dts/Fugue/FugueList.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"FugueList.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/FugueList.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAa,MAAM,sBAAsB,CAAC;AAC3E,OAAO,EAAE,uBAAuB,EAAE,MAAM,0CAA0C,CAAC;AAGnF;;GAEG;AACH,qBAAa,SAAS,CAAC,CAAC;IACpB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAM;IAC1B,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC;IACvC,eAAe,SAAK;IACpB,EAAE,EAAE,SAAS,GAAG,IAAI,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC;IACjC,QAAQ,CAAC,SAAS,OAAO;gBAEb,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,GAAG,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,MAAM;IAOnH;;;OAGG;IACH,OAAO,CAAC,SAAS;IAQjB,OAAO,CAAC,oBAAoB;IAmB5B;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IAqBxB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IASxB;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAgBnC;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAiD3C;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAexB;;;;OAIG;IACH,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAajD;;;;;OAKG;IACH,gBAAgB,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS;IAejD;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM;IAsBpB;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAsD3C;;;OAGG;IACH,OAAO,IAAI,MAAM;IAmBjB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAcpB;;;OAGG;IACH,OAAO,CAAC,WAAW;IAsGnB;;;OAGG;IACH,MAAM,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAW/C,SAAS,IAAI,MAAM;IAInB;;OAEG;IACH,cAAc;CAOjB"}
+{"version":3,"file":"FugueList.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/FugueList.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAa,MAAM,4BAA4B,CAAC;AACjF,OAAO,EAAE,uBAAuB,EAAE,MAAM,0CAA0C,CAAC;AAGnF;;GAEG;AACH,qBAAa,SAAS,CAAC,CAAC;IACpB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAM;IAC1B,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC;IACvC,eAAe,SAAK;IACpB,EAAE,EAAE,SAAS,GAAG,IAAI,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC;IACjC,QAAQ,CAAC,SAAS,OAAO;gBAGrB,UAAU,EAAE,uBAAuB,CAAC,CAAC,CAAC,EACtC,EAAE,EAAE,SAAS,GAAG,IAAI,EACpB,UAAU,EAAE,MAAM,EAClB,YAAY,CAAC,EAAE,MAAM;IAQzB;;;OAGG;IACH,OAAO,CAAC,SAAS;IAQjB,OAAO,CAAC,oBAAoB;IAmB5B;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IAqBxB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IASxB;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAenC;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAiD3C;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAcxB;;;;OAIG;IACH,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAajD;;;;;OAKG;IACH,gBAAgB,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS;IAejD;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM;IAqBpB;;;;;OAKG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAqD3C;;;OAGG;IACH,OAAO,IAAI,MAAM;IAmBjB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAcpB;;;OAGG;IACH,OAAO,CAAC,WAAW;IAqGnB;;;OAGG;IACH,MAAM,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE;IAW/C,SAAS,IAAI,MAAM;IAInB;;OAEG;IACH,cAAc;CAOjB"}

package/dist/dts/Fugue/FugueList.js

@@ -1,6 +1,6 @@
-import { FNode } from "./FNode.js";
-import { Operation } from "../../types/index.js";
-import { FugueMessageSerialzier } from "../Serailizers/index.js";
+import { FListNode } from "./FNode.js";
+import { Operation } from "../../types/Fugue/index.js";
+import { FugueMessageSerialzier } from "../Serailizers/Fugue/index.js";
 /**
  * A Fugue List CRDT, with insert and delete operations
  */
@@ -59,13 +59,13 @@ export class FugueList {
             // Don't insert if it already exists,
             // TODO: ideally this should trigger a collision resolution
             if (!existing) {
-                cell.push(new FNode(position, value, Operation.INSERT));
+                cell.push(new FListNode(position, value));
                 cell.sort((a, b) => this.totalOrder.compare(a.position, b.position));
             }
         }
         // Insert new cell at index
         else {
-            this.state.splice(index, 0, [new FNode(position, value, Operation.INSERT)]);
+            this.state.splice(index, 0, [new FListNode(position, value)]);
         }
     }
     /**
@@ -88,7 +88,6 @@ export class FugueList {
      */
     insert(index, value) {
         const pos = this.generatePosition(index);
-        console.log({ index, pos });
         this.insertAtPosition(pos, value);
         this.propagate({
             documentID: this.documentID,
@@ -121,7 +120,7 @@ export class FugueList {
         for (const c of value) {
             const pos = this.totalOrder.createBetween(cL, rA);
             // Collect new cells
-            newCells.push([new FNode(pos, c, Operation.INSERT)]);
+            newCells.push([new FListNode(pos, c)]);
             // Batch propagate
             msgs.push({
                 documentID: this.documentID,
@@ -158,7 +157,6 @@ export class FugueList {
             if (node) {
                 // Tombstone the node, TODO: Implement garbage collection
                 node.value = undefined;
-                node.operation = Operation.DELETE;
                 return;
             }
         }
@@ -205,7 +203,6 @@ export class FugueList {
      */
     delete(index) {
         const position = this.findVisiblePosition(index);
-        console.log({ index, position });
         if (!position) {
             console.warn(`No element at position -> ${position}`);
             return;
@@ -245,7 +242,6 @@ export class FugueList {
                         const pos = n.position;
                         // Tombstone the node
                         n.value = undefined;
-                        n.operation = Operation.DELETE;
                         deletedCount++;
                         // Batch
                         msgs.push({
@@ -347,7 +343,6 @@ export class FugueList {
                     const node = cell.find((n) => this.totalOrder.compare(n.position, pos) === 0);
                     if (node && node.value !== undefined) {
                         node.value = undefined; // Tombstone
-                        node.operation = Operation.DELETE;
                     }
                 }
             }
@@ -369,7 +364,7 @@ export class FugueList {
                     const existing = cell.find((n) => this.totalOrder.compare(n.position, position) === 0);
                     // Don't insert if it already exists
                     if (!existing) {
-                        cell.push(new FNode(position, data ? data : undefined, data ? Operation.INSERT : Operation.DELETE));
+                        cell.push(new FListNode(position, data ? data : undefined));
                         cell.sort((a, b) => this.totalOrder.compare(a.position, b.position));
                     }
                 }
@@ -379,11 +374,11 @@ export class FugueList {
                     // - This index is not contiguous with the previous group
                     if (startIdx === -1) {
                         startIdx = idx;
-                        batchCells = [[new FNode(position, data ? data : undefined, data ? Operation.INSERT : Operation.DELETE)]];
+                        batchCells = [[new FListNode(position, data ? data : undefined)]];
                     }
                     // If the index is the same as startIdx, continue the batch
                     else if (idx === startIdx) {
-                        batchCells.push([new FNode(position, data ? data : undefined, data ? Operation.INSERT : Operation.DELETE)]);
+                        batchCells.push([new FListNode(position, data ? data : undefined)]);
                     }
                     // The index is different, i.e. not contiguous, so flush the current batch,
                     // commit it and start a new one
@@ -396,7 +391,7 @@ export class FugueList {
                         // we must add the length of the batch we just inserted.
                         const shift = idx >= startIdx ? batchCells.length : 0;
                         startIdx = idx + shift;
-                        batchCells = [[new FNode(position, data ? data : undefined, data ? Operation.INSERT : Operation.DELETE)]];
+                        batchCells = [[new FListNode(position, data ? data : undefined)]];
                     }
                 }
             }

package/dist/dts/Fugue/index.d.ts

@@ -1,3 +1,2 @@
-export * from "./FNode.js";
 export * from "./FugueList.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/dts/Fugue/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/dts/Fugue/index.ts"],"names":[],"mappings":"AACA,cAAc,gBAAgB,CAAC"}

package/dist/dts/Fugue/index.js

@@ -1,2 +1,2 @@
-export * from "./FNode.js";
+// export * from "./FNode.js";
 export * from "./FugueList.js";

package/dist/dts/FugueTree/FTree.d.ts

@@ -0,0 +1,147 @@
+export type NodeSide = "L" | "R";
+/**
+ * Lamport type identifier containing the sender replica id
+ * and a counter
+ */
+export type ID = {
+    sender: string;
+    counter: number;
+};
+/**
+ * Represents a node in a FTree. Each node corresponds to a character in the document, with a:
+ * - unique ID that identifies the node and allows it to be referenced by other nodes (e.g. for insertions to the right of it).
+ * - character value (null for the root node and deleted nodes)
+ * - boolean isDeleted indicating whether the character has been deleted
+ * - parent pointer to the node's parent (null for the root)
+ * - side indicating whether the node is a left or right child of its parent (the root is considered a right child)
+ * - leftChildren and rightChildren arrays containing the node's children on each side, sorted in the order they were inserted (with ties broken by sender ID)
+ * - size of the subtree rooted at this node, counting only non-deleted nodes, for performance of index-based operations
+ * - rightOrigin pointer to the node to the right of which this node was inserted, if any (null if inserted at the end of its siblings, undefined if not yet set)
+ */
+export interface FNode {
+    id: ID;
+    value: string | null;
+    isDeleted: boolean;
+    parent: FNode | null;
+    side: NodeSide;
+    leftChildren: FNode[];
+    rightChildren: FNode[];
+    size: number;
+    rightOrigin?: FNode | null;
+}
+/**
+ * Serializable version of FNode used for saving/loading. Pointers to other nodes are replaced with IDs,
+ * and children arrays are omitted since they can be reconstructed from parent and rightOrigin pointers.
+ */
+export interface FNodeSave {
+    value: string | null;
+    isDeleted: boolean;
+    parent: ID | null;
+    side: NodeSide;
+    size: number;
+    rightOrigin?: ID | null;
+}
+/**
+ * FTree is a CRDT for collaborative text editing. It represents the document as a tree of nodes,
+ * where each node corresponds to a character. The tree structure encodes the relative ordering
+ * of characters, and each node has a unique ID that allows it to be referenced by other nodes.
+ * The tree supports insertions and deletions of characters, and can be traversed in order to reconstruct the document text.
+ *
+ */
+export declare class FTree {
+    readonly root: FNode;
+    private readonly nodes;
+    constructor();
+    /**
+     * Get the node with the given ID. Throws an error if no such node exists.
+     * @param id - the ID of the node to retrieve
+     * @returns  the node with the given ID
+     */
+    getByID(id: ID): FNode;
+    /**
+     * Add a node to the tree with the given ID, value, parent, side, and optional rightOrigin.
+     * The node is inserted among its siblings according to the order defined by rightOrigin and sender ID,
+     * and the size of all ancestors is updated accordingly.
+     * @param id - the ID of the new node
+     * @param value - the character value of the new node
+     * @param parent - the parent node of the new node
+     * @param side - the side (left or right) of the new node with respect to its parent
+     * @param rightOriginID - the ID of the node to the right of which the new node was inserted, or null if inserted at the end of its siblings (optional)
+     */
+    addNode(id: ID, value: string, parent: FNode, side: NodeSide, rightOriginID?: ID | null): void;
+    /**
+     * TODO: Maybe change the children types to linked list to make insertions more efficient, since we expect many insertions at the end of the siblings.
+     * Inserts a node into the correct position among its parent node's children arrays based on the
+     * node's rightOrigin and sender ID, and the existing order of its rightOrigin among its siblings.
+     * @param node - The node to insert into its siblings
+     */
+    private insertIntoSiblings;
+    /**
+     * Determines whether node a should come before node b in the document order, based on their rightOrigin and sender ID.
+     * returns true if a should come before b, false otherwise. i.e. a < b
+     * @param a - the first node to compare
+     * @param b - the second node to compare
+     */
+    private isLess;
+    /**
+     * Find the depth of a node in the tree, defined as the number of edges from the node to the root. The root has depth 0.
+     * @param node - the node whose depth to calculate
+     * @returns the depth of the node in the tree
+     */
+    depth(node: FNode): number;
+    /**
+     * Update the size of a node and all its ancestors by adding delta.
+     * This should be called whenever a node is inserted or deleted to keep the size values accurate.
+     * @param node - the node whose size and ancestors' sizes to update
+     * @param delta - the amount to add to the size of the node and its ancestors (positive for insertions, negative for deletions)
+     */
+    updateSize(node: FNode, delta: number): void;
+    /**
+     * Get the node by index from a starting node, i.e. the node corresponding to the index-th non-deleted
+     * character in the subtree rooted at the starting node, where indices are 0-based.
+     * @param node - node to start the search from (e.g. the root for document-level indexing)
+     * @param index - the index of the node to retrieve among the non-deleted nodes in the subtree rooted at the starting node
+     * @returns the node corresponding to the index-th non-deleted character in the subtree rooted at the starting node
+     */
+    getByIndex(node: FNode, index: number): FNode;
+    /**
+     * Get the index of a node disregarding the deleted nodes starting from the root
+     * @param node - the node whose index to calculate among the non-deleted nodes in the subtree rooted at the root
+     * @returns the index of the node among the non-deleted nodes in the subtree rooted at the root
+     */
+    getVisibleIndex(node: FNode): number;
+    /**
+     * Get the leftmost descendant of a node, i.e. the node corresponding to the first non-deleted character in the subtree
+     * rooted at the given node in document order.
+     * @param node - the node whose leftmost descendant to find
+     * @returns the leftmost descendant of the given node
+     */
+    leftmostDescendant(node: FNode): FNode;
+    /**
+     * Get the next non-descendant of a node, i.e. the node corresponding to the next non-deleted character in document order
+     * that is not in the subtree rooted at the given node.
+     * @param node - the node whose next non-descendant to find
+     * @returns the next non-descendant of the given node, or null if there is no such node (i.e. the given node is the last non-deleted character in document order)
+     */
+    nextNonDescendant(node: FNode): FNode | null;
+    /**
+     * Traverse the subtree rooted at a node in document order, yielding the value of each non-deleted node.
+     * @param node - the node to traverse from
+     */
+    traverse(node: FNode): IterableIterator<string>;
+    /**
+     * Serialize the tree into a Uint8Array. The tree is converted into a JSON object where each node is
+     * represented by its value, isDeleted flag, parent ID, side, size, and rightOrigin ID (if applicable).
+     * The JSON object is then converted to a string and encoded as a Uint8Array for storage or transmission.
+     * @returns a Uint8Array containing the serialized tree data
+     */
+    save(): Uint8Array;
+    /**
+     * Load the tree from a Uint8Array containing serialized tree data in the format produced by the save() method.
+     * The data is parsed from JSON format, and the tree is reconstructed by first creating all nodes without setting their parent or rightOrigin pointers,
+     * then filling in the parent and rightOrigin pointers, and finally calling insertIntoSiblings on each node to reconstruct the children arrays.
+     * @param saveData - a Uint8Array containing the serialized tree data to load
+     */
+    load(saveData: Uint8Array): void;
+}
+//# sourceMappingURL=FTree.d.ts.map

package/dist/dts/FugueTree/FTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FTree.d.ts","sourceRoot":"","sources":["../../../src/dts/FugueTree/FTree.ts"],"names":[],"mappings":"AACA,MAAM,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,EAAE,GAAG;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACnB,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,WAAW,KAAK;IAClB,EAAE,EAAE,EAAE,CAAC;IACP,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,EAAE,KAAK,GAAG,IAAI,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC;IACf,YAAY,EAAE,KAAK,EAAE,CAAC;IACtB,aAAa,EAAE,KAAK,EAAE,CAAC;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;CAC9B;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACtB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC;IAClB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC;CAC3B;AAED;;;;;;GAMG;AACH,qBAAa,KAAK;IAGd,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IAGrB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA8B;;IAgBpD;;;;OAIG;IACH,OAAO,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK;IAStB;;;;;;;;;OASG;IACH,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,CAAC,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI;IAiC9F;;;;;OAKG;IACH,OAAO,CAAC,kBAAkB;IA8B1B;;;;;OAKG;IACH,OAAO,CAAC,MAAM;IAiDd;;;;OAIG;IACH,KAAK,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM;IAU1B;;;;;OAKG;IACH,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAQ5C;;;;;;OAMG;IACH,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK;IAkC7C;;;;OAIG;IACH,eAAe,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM;IAoCpC;;;;;OAKG;IACH,kBAAkB,CAAC,IAAI,EAAE,KAAK,GAAG,KAAK;IAMtC;;;;;OAKG;IACH,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,KAAK,GAAG,IAAI;IAoB5C;;;OAGG;IACF,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,gBAAgB,CAAC,MAAM,CAAC;IAmChD;;;;;OAKG;IACH,IAAI,IAAI,UAAU;IAqBlB;;;;;OAKG;IACH,IAAI,CAAC,QAAQ,EAAE,UAAU;CAiF5B"}