@cr_docs_t/dts 0.34.0 → 0.35.1

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

@@ -70,7 +70,6 @@ export declare class FTree {
      */
     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

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

@@ -1 +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;IAiChD;;;;;OAKG;IACH,IAAI,IAAI,UAAU;IAqBlB;;;;;OAKG;IACH,IAAI,CAAC,QAAQ,EAAE,UAAU;IA0EzB,QAAQ;IAIR,KAAK;CASR"}
+{"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;;;;OAIG;IACH,OAAO,CAAC,kBAAkB;IA+B1B;;;;;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;IAiChD;;;;;OAKG;IACH,IAAI,IAAI,UAAU;IAqBlB;;;;;OAKG;IACH,IAAI,CAAC,QAAQ,EAAE,UAAU;IA0EzB,QAAQ;IAIR,KAAK;CASR"}

package/dist/dts/FugueTree/FTree.js

@@ -74,7 +74,6 @@ export class FTree {
         this.updateSize(node, 1);
     }
     /**
-     * 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
@@ -91,9 +90,10 @@ export class FTree {
             let i = 0;
             for (; i < right.length; i++) {
                 const sib = right[i];
-                const isLessThanSib = this.isLess(node.rightOrigin, sib.rightOrigin);
+                const isLessThanSib = this.isLess(sib.rightOrigin ?? null, node.rightOrigin ?? null);
                 const isEqualRightOrigin = node.rightOrigin === sib.rightOrigin;
-                const isGreaterSender = node.id.sender > sib.id.sender;
+                const senderCmp = node.id.sender.localeCompare(sib.id.sender);
+                const isGreaterSender = senderCmp > 0 || (senderCmp === 0 && node.id.counter > sib.id.counter);
                 if (!(isLessThanSib || (isEqualRightOrigin && isGreaterSender)))
                     break;
             }

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

@@ -12,7 +12,9 @@ export declare class FugueTree {
     userIdentity: string;
     pendingMsgs: Map<string, FugueMessage>;
     readonly batchSize = 800;
-    constructor(ws: WebSocket | null, documentID: string, userIdentity: string);
+    private lastIndex;
+    private lastNode;
+    constructor(ws: WebSocket | null, documentID: string, userIdentity: string, replicaID?: string);
     /**
      * Make msg key for pending messages map
      * @param msg - the message to make key for
@@ -124,6 +126,7 @@ export declare class FugueTree {
      * @returns the index of the given node in the visible string
      */
     getVisibleIndex(node: FNode): number;
+    nextNonDescendant(node: FNode): FNode | null;
     getState(): FTree;
     clear(): void;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"FugueTree.d.ts","sourceRoot":"","sources":["../../../src/dts/FugueTree/FugueTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAA+B,MAAM,kCAAkC,CAAC;AAK7F,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,YAAY,CAAC;AAE9C;;GAEG;AACH,qBAAa,SAAS;IAClB,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,IAAI,CAAQ;IACpB,EAAE,EAAE,SAAS,GAAG,IAAI,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,SAAS,SAAmB;IACrC,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,4BAAmC;IAE9C,QAAQ,CAAC,SAAS,OAAO;gBAEb,EAAE,EAAE,SAAS,GAAG,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;IAO1E;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAIlB;;;OAGG;IACG,SAAS,CAAC,GAAG,EAAE,YAAY,GAAG,YAAY,EAAE;IAYlD;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IAiDlB;;;;OAIG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAa5C;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAOnC;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAuBlB;;;;OAIG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAU5C;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM;IAKpB;;;;OAIG;IACH,OAAO,CAAC,WAAW;IAgCnB;;;;OAIG;IACH,OAAO,CAAC,cAAc;IAkBtB;;;;OAIG;IACH,MAAM,CAAC,GAAG,EAAE,YAAY,GAAG,YAAY,EAAE,GAAG,YAAY,EAAE;IAuB1D;;;;OAIG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAS1B;;;OAGG;IACH,MAAM,IAAI,MAAM;IAIhB;;;OAGG;IACH,OAAO,IAAI,MAAM;IAWjB,QAAQ;IAIR;;;OAGG;IACH,IAAI,IAAI,UAAU;IAKlB;;;OAGG;IACH,IAAI,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI;IAK5B;;;;;OAKG;IACH,SAAS,IAAI,MAAM;IAInB;;;;OAIG;IACH,OAAO,CAAC,EAAE,EAAE,EAAE;IAId;;;;OAIG;IACH,eAAe,CAAC,IAAI,EAAE,KAAK;IAI3B,QAAQ;IAIR,KAAK;CAGR"}
+{"version":3,"file":"FugueTree.d.ts","sourceRoot":"","sources":["../../../src/dts/FugueTree/FugueTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAA+B,MAAM,kCAAkC,CAAC;AAK7F,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,YAAY,CAAC;AAE9C;;GAEG;AACH,qBAAa,SAAS;IAClB,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,IAAI,CAAQ;IACpB,EAAE,EAAE,SAAS,GAAG,IAAI,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,4BAAmC;IAE9C,QAAQ,CAAC,SAAS,OAAO;IACzB,OAAO,CAAC,SAAS,CAAM;IACvB,OAAO,CAAC,QAAQ,CAAgC;gBAEpC,EAAE,EAAE,SAAS,GAAG,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM;IAQ9F;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAIlB;;;OAGG;IACG,SAAS,CAAC,GAAG,EAAE,YAAY,GAAG,YAAY,EAAE;IAYlD;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IA+ClB;;;;OAIG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAa5C;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAOnC;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAuBlB;;;;OAIG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAU5C;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM;IAKpB;;;;OAIG;IACH,OAAO,CAAC,WAAW;IAgCnB;;;;OAIG;IACH,OAAO,CAAC,cAAc;IAkBtB;;;;OAIG;IACH,MAAM,CAAC,GAAG,EAAE,YAAY,GAAG,YAAY,EAAE,GAAG,YAAY,EAAE;IAuB1D;;;;OAIG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAS1B;;;OAGG;IACH,MAAM,IAAI,MAAM;IAIhB;;;OAGG;IACH,OAAO,IAAI,MAAM;IAWjB,QAAQ;IAIR;;;OAGG;IACH,IAAI,IAAI,UAAU;IAKlB;;;OAGG;IACH,IAAI,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI;IAK5B;;;;;OAKG;IACH,SAAS,IAAI,MAAM;IAInB;;;;OAIG;IACH,OAAO,CAAC,EAAE,EAAE,EAAE;IAId;;;;OAIG;IACH,eAAe,CAAC,IAAI,EAAE,KAAK;IAI3B,iBAAiB,CAAC,IAAI,EAAE,KAAK;IAI7B,QAAQ;IAIR,KAAK;CAIR"}

package/dist/dts/FugueTree/FugueTree.js

@@ -1,22 +1,24 @@
 import { Operation } from "../../types/FugueTree/Message.js";
 import { MessageType } from "../../types/Message.js";
-import { chunkArray, randomString } from "../../utils/index.js";
+import { chunkArray } from "../../utils/index.js";
 import { Serializer } from "../Serailizers/General.js";
 import { FTree } from "./FTree.js";
 /**
  * A Fugue Tree CRDT, with insert and delete operations.
  */
 export class FugueTree {
-    constructor(ws, documentID, userIdentity) {
+    constructor(ws, documentID, userIdentity, replicaID) {
         this.counter = 0;
-        this.replicaID = randomString(3);
         this.pendingMsgs = new Map();
         // Tentative
         this.batchSize = 800;
+        this.lastIndex = -1;
+        this.lastNode = undefined;
         this.ws = ws;
         this.documentID = documentID;
         this.userIdentity = userIdentity;
         this.tree = new FTree();
+        this.replicaID = replicaID ?? crypto.randomUUID();
     }
     /**
      * Make msg key for pending messages map
@@ -49,8 +51,6 @@ export class FugueTree {
      */
     insertImpl(index, value) {
         const id = { sender: this.replicaID, counter: this.counter };
-        // PERF: optimize by caching the last accessed node and its index,
-        // so that if the next insert is nearby, we can start from there instead of the root
         this.counter++;
         const leftOrigin = index === 0 ? this.tree.root : this.tree.getByIndex(this.tree.root, index - 1);
         let msg;
@@ -329,10 +329,14 @@ export class FugueTree {
     getVisibleIndex(node) {
         return this.tree.getVisibleIndex(node);
     }
+    nextNonDescendant(node) {
+        return this.tree.nextNonDescendant(node);
+    }
     getState() {
         return this.tree;
     }
     clear() {
+        this.counter = 0;
         return this.tree.clear();
     }
 }

package/dist/tests/unit/AST.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=AST.test.d.ts.map

package/dist/tests/unit/AST.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AST.test.d.ts","sourceRoot":"","sources":["../../../src/tests/unit/AST.test.ts"],"names":[],"mappings":""}

package/dist/tests/unit/AST.test.js

@@ -0,0 +1,111 @@
+import { parseCST } from "../../treesitter/types/AST";
+import { getParser } from "./mocks/BragiAST-mocks.js";
+import { breadthFirstAstTraversalFunc, postorderAstTraversalFunc, preoderAstTraversalFunc, } from "../../treesitter/index.js";
+describe("AST Codegen and Parsing", () => {
+    let parser;
+    let tree = null;
+    beforeAll(async () => {
+        parser = await getParser();
+    });
+    afterEach(() => {
+        if (tree) {
+            tree.delete();
+            tree = null;
+        }
+    });
+    afterAll(() => {
+        if (parser) {
+            parser.delete();
+        }
+    });
+    describe("parseCST", () => {
+        it("should parse a simple LaTeX document into a flat node map", () => {
+            const code = `
+                \\documentclass{article}
+                \\begin{document}
+                Hello, World!
+                \\end{document}
+            `;
+            tree = parser.parse(code);
+            if (!tree || !tree.rootNode) {
+                throw new Error("Parser failed to return a valid tree");
+            }
+            const ast = parseCST(tree.rootNode);
+            expect(ast.rootId).toBeDefined();
+            expect(ast.nodes.has(ast.rootId)).toBe(true);
+            const root = ast.nodes.get(ast.rootId);
+            expect(root?.type).toBe("source_file");
+            expect(root?.childrenIds.length).toBeGreaterThan(0);
+            root?.childrenIds.forEach((id) => {
+                expect(ast.nodes.has(id)).toBe(true);
+            });
+        });
+        it("should correctly wire parent-child relationships", () => {
+            const code = `\\begin{enumerate} \\item test \\end{enumerate}`;
+            tree = parser.parse(code);
+            if (!tree?.rootNode)
+                return;
+            const ast = parseCST(tree.rootNode);
+            const nodes = Array.from(ast.nodes.values());
+            const itemNode = nodes.find((n) => n.type === "enum_item");
+            const parentNode = nodes.find((n) => n.id === itemNode?.parentId);
+            expect(itemNode).toBeDefined();
+            expect(parentNode).toBeDefined();
+            expect(parentNode?.type).toBe("generic_environment");
+        });
+        it("should capture text content for leaf nodes", () => {
+            const code = `SpecificTextContent`;
+            tree = parser.parse(code);
+            if (!tree?.rootNode)
+                return;
+            const ast = parseCST(tree.rootNode);
+            const textNode = Array.from(ast.nodes.values()).find((n) => n.text.includes("SpecificTextContent"));
+            expect(textNode).toBeDefined();
+        });
+        it("should throw an error if no root node is provided", () => {
+            expect(() => parseCST(null)).toThrow("No root node provided");
+        });
+    });
+    describe("Node Metadata", () => {
+        it("should ensure every node in the map has a valid type and text field", () => {
+            const code = `\\section{Title}`;
+            tree = parser.parse(code);
+            if (!tree?.rootNode)
+                return;
+            const ast = parseCST(tree.rootNode);
+            ast.nodes.forEach((node) => {
+                expect(typeof node.type).toBe("string");
+                expect(typeof node.text).toBe("string");
+                expect(node.id).toBeDefined();
+            });
+        });
+    });
+    describe("AST Traversal", () => {
+        let ast;
+        beforeAll(() => {
+            const code = `\\section{A} Text \\textbf{B}`;
+            tree = parser.parse(code);
+            if (!tree?.rootNode)
+                throw new Error("Parse failed");
+            ast = parseCST(tree.rootNode);
+        });
+        it("should be traversable in Pre-order (Root -> L -> R)", () => {
+            const visited = [];
+            preoderAstTraversalFunc(ast, (node) => visited.push(node.type));
+            expect(visited[0]).toBe("source_file");
+            expect(visited.length).toBe(ast.nodes.size);
+        });
+        it("should be traversable in Post-order (Left -> Right -> Root)", () => {
+            const visited = [];
+            postorderAstTraversalFunc(ast, (node) => visited.push(node.type));
+            expect(visited[visited.length - 1]).toBe("source_file");
+            expect(visited.length).toBe(ast.nodes.size);
+        });
+        it("should be traversable in Breadth-First (Level Order)", () => {
+            const visited = [];
+            breadthFirstAstTraversalFunc(ast, (node) => visited.push(node.type));
+            expect(visited[0]).toBe("source_file");
+            expect(visited.length).toBe(ast.nodes.size);
+        });
+    });
+});

package/dist/tests/unit/FTree.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=FTree.test.d.ts.map

package/dist/tests/unit/FTree.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FTree.test.d.ts","sourceRoot":"","sources":["../../../src/tests/unit/FTree.test.ts"],"names":[],"mappings":""}