@fern-api/fdr-sdk 1.2.15-770f9aebe4 → 1.2.15-d6440e1983

package/dist/utils/traversers/__test__/fixture.js

@@ -1,38 +0,0 @@
-export const FIXTURE = {
-    id: 0,
-    children: [
-        {
-            id: 1,
-            children: [
-                {
-                    id: 2,
-                    children: [
-                        {
-                            id: 3,
-                            children: []
-                        }
-                    ]
-                },
-                {
-                    id: 4,
-                    children: [
-                        {
-                            id: 5,
-                            children: []
-                        }
-                    ]
-                }
-            ]
-        },
-        {
-            id: 6,
-            children: [
-                {
-                    id: 7,
-                    children: []
-                }
-            ]
-        }
-    ]
-};
-//# sourceMappingURL=fixture.js.map

package/dist/utils/traversers/__test__/fixture.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fixture.js","sourceRoot":"","sources":["../../../../src/utils/traversers/__test__/fixture.ts"],"names":[],"mappings":"AAKA,MAAM,CAAC,MAAM,OAAO,GAAW;IAC3B,EAAE,EAAE,CAAC;IACL,QAAQ,EAAE;QACN;YACI,EAAE,EAAE,CAAC;YACL,QAAQ,EAAE;gBACN;oBACI,EAAE,EAAE,CAAC;oBACL,QAAQ,EAAE;wBACN;4BACI,EAAE,EAAE,CAAC;4BACL,QAAQ,EAAE,EAAE;yBACf;qBACJ;iBACJ;gBACD;oBACI,EAAE,EAAE,CAAC;oBACL,QAAQ,EAAE;wBACN;4BACI,EAAE,EAAE,CAAC;4BACL,QAAQ,EAAE,EAAE;yBACf;qBACJ;iBACJ;aACJ;SACJ;QACD;YACI,EAAE,EAAE,CAAC;YACL,QAAQ,EAAE;gBACN;oBACI,EAAE,EAAE,CAAC;oBACL,QAAQ,EAAE,EAAE;iBACf;aACJ;SACJ;KACJ;CACJ,CAAC"}

package/dist/utils/traversers/__test__/prunetree.test.d.ts

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

package/dist/utils/traversers/__test__/prunetree.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"prunetree.test.d.ts","sourceRoot":"","sources":["../../../../src/utils/traversers/__test__/prunetree.test.ts"],"names":[],"mappings":""}

package/dist/utils/traversers/__test__/prunetree.test.js

@@ -1,79 +0,0 @@
-import { prunetree } from "../prunetree";
-import { FIXTURE } from "./fixture";
-const DELETER = (parent, child) => {
-    if (parent == null) {
-        return "deleted";
-    }
-    parent.children = parent.children.filter((c) => c.id !== child.id);
-    if (parent.children.length === 0) {
-        return "should-delete-parent";
-    }
-    return "deleted";
-};
-const testPruner = (predicate) => {
-    const [pruned] = prunetree(structuredClone(FIXTURE), {
-        predicate,
-        getChildren: (node) => node.children,
-        deleter: DELETER,
-        getPointer: (node) => node.id
-    });
-    return pruned;
-};
-describe("prunetree", () => {
-    it("should return the same tree if the predicate returns true for all nodes", () => {
-        const pruned = testPruner(() => {
-            return true;
-        });
-        expect(pruned).toStrictEqual(FIXTURE);
-    });
-    it("should return undefined if the predicate returns false for all nodes", () => {
-        const pruned = testPruner(() => {
-            return false;
-        });
-        expect(pruned).toBeUndefined();
-    });
-    it("should prune the tree if the predicate returns false for some nodes", () => {
-        const pruned = testPruner((node) => {
-            return node.id !== 1;
-        });
-        expect(pruned).toStrictEqual({
-            id: 0,
-            children: [
-                {
-                    id: 6,
-                    children: [
-                        {
-                            id: 7,
-                            children: []
-                        }
-                    ]
-                }
-            ]
-        });
-    });
-    it("should prune parents that don't have children, but not leaf nodes", () => {
-        const pruned = testPruner((node) => {
-            return node.id !== 7 && node.id !== 3;
-        });
-        expect(pruned).toStrictEqual({
-            id: 0,
-            children: [
-                {
-                    id: 1,
-                    children: [
-                        {
-                            id: 4,
-                            children: [
-                                {
-                                    id: 5,
-                                    children: []
-                                }
-                            ]
-                        }
-                    ]
-                }
-            ]
-        });
-    });
-});
-//# sourceMappingURL=prunetree.test.js.map

package/dist/utils/traversers/__test__/prunetree.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prunetree.test.js","sourceRoot":"","sources":["../../../../src/utils/traversers/__test__/prunetree.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAEzC,OAAO,EAAE,OAAO,EAAe,MAAM,WAAW,CAAC;AAEjD,MAAM,OAAO,GAAG,CAAC,MAA0B,EAAE,KAAa,EAAiB,EAAE;IACzE,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;QACjB,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC;IAEnE,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,sBAAsB,CAAC;IAClC,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,SAAoC,EAAsB,EAAE;IAC5E,MAAM,CAAC,MAAM,CAAC,GAAG,SAAS,CAAiC,eAAe,CAAC,OAAO,CAAC,EAAE;QACjF,SAAS;QACT,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ;QACpC,OAAO,EAAE,OAAO;QAChB,UAAU,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE;KAChC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACvB,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;QAC/E,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE;YAC3B,OAAO,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC5E,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE;YAC3B,OAAO,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,CAAC,CAAC,aAAa,EAAE,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC3E,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/B,OAAO,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC;YACzB,EAAE,EAAE,CAAC;YACL,QAAQ,EAAE;gBACN;oBACI,EAAE,EAAE,CAAC;oBACL,QAAQ,EAAE;wBACN;4BACI,EAAE,EAAE,CAAC;4BACL,QAAQ,EAAE,EAAE;yBACf;qBACJ;iBACJ;aACJ;SACJ,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QACzE,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/B,OAAO,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC;YACzB,EAAE,EAAE,CAAC;YACL,QAAQ,EAAE;gBACN;oBACI,EAAE,EAAE,CAAC;oBACL,QAAQ,EAAE;wBACN;4BACI,EAAE,EAAE,CAAC;4BACL,QAAQ,EAAE;gCACN;oCACI,EAAE,EAAE,CAAC;oCACL,QAAQ,EAAE,EAAE;iCACf;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;SACJ,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/utils/traversers/bfs.d.ts

@@ -1,3 +0,0 @@
-import { type TraverserGetChildren, type TraverserVisit } from "./types";
-export declare function bfs<N, P extends N = N>(root: N, visit: TraverserVisit<N, P>, getChildren: TraverserGetChildren<N, P>, isParent?: (node: N) => node is P): void;
-//# sourceMappingURL=bfs.d.ts.map

package/dist/utils/traversers/bfs.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../src/utils/traversers/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAc,KAAK,oBAAoB,EAAE,KAAK,cAAc,EAAE,MAAM,SAAS,CAAC;AAErF,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAClC,IAAI,EAAE,CAAC,EACP,KAAK,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,EAC3B,WAAW,EAAE,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,EACvC,QAAQ,GAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,IAAI,CAA6B,GAC7D,IAAI,CAqBN"}

package/dist/utils/traversers/bfs.js

@@ -1,23 +0,0 @@
-import { SKIP, STOP } from "./types";
-export function bfs(root, visit, getChildren, isParent = (node) => true) {
-    const queue = [[root, []]];
-    while (queue.length > 0) {
-        const [node, parents] = queue.shift() ?? [];
-        if (!node) {
-            continue;
-        }
-        const next = visit(node, parents ?? []);
-        if (next === SKIP) {
-            continue;
-        }
-        else if (next === STOP) {
-            return;
-        }
-        if (isParent(node)) {
-            for (const child of [...getChildren(node)]) {
-                queue.push([child, [...(parents ?? []), node]]);
-            }
-        }
-    }
-}
-//# sourceMappingURL=bfs.js.map

package/dist/utils/traversers/bfs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../src/utils/traversers/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,IAAI,EAAkD,MAAM,SAAS,CAAC;AAErF,MAAM,UAAU,GAAG,CACf,IAAO,EACP,KAA2B,EAC3B,WAAuC,EACvC,WAAmC,CAAC,IAAI,EAAa,EAAE,CAAC,IAAI;IAE5D,MAAM,KAAK,GAAe,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,SAAS;QACb,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;QAExC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAChB,SAAS;QACb,CAAC;aAAM,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACvB,OAAO;QACX,CAAC;QAED,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACzC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC"}

package/dist/utils/traversers/dfs.d.ts

@@ -1,3 +0,0 @@
-import { type TraverserGetChildren, type TraverserVisit } from "./types";
-export declare function dfs<N, P extends N = N>(root: N, visit: TraverserVisit<N, P>, getChildren: TraverserGetChildren<N, P>, isParent?: (node: N) => node is P): void;
-//# sourceMappingURL=dfs.d.ts.map

package/dist/utils/traversers/dfs.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"dfs.d.ts","sourceRoot":"","sources":["../../../src/utils/traversers/dfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAc,KAAK,oBAAoB,EAAE,KAAK,cAAc,EAAE,MAAM,SAAS,CAAC;AAErF,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAClC,IAAI,EAAE,CAAC,EACP,KAAK,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,EAC3B,WAAW,EAAE,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,EACvC,QAAQ,GAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,IAAI,CAA6B,GAC7D,IAAI,CAqBN"}

package/dist/utils/traversers/dfs.js

@@ -1,23 +0,0 @@
-import { SKIP, STOP } from "./types";
-export function dfs(root, visit, getChildren, isParent = (node) => true) {
-    const stack = [[root, []]];
-    while (stack.length > 0) {
-        const [node, parents] = stack.pop() ?? [];
-        if (!node) {
-            continue;
-        }
-        const next = visit(node, parents ?? []);
-        if (next === SKIP) {
-            continue;
-        }
-        else if (next === STOP) {
-            return;
-        }
-        if (isParent(node)) {
-            for (const child of [...getChildren(node)].reverse()) {
-                stack.push([child, [...(parents ?? []), node]]);
-            }
-        }
-    }
-}
-//# sourceMappingURL=dfs.js.map

package/dist/utils/traversers/dfs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dfs.js","sourceRoot":"","sources":["../../../src/utils/traversers/dfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,IAAI,EAAkD,MAAM,SAAS,CAAC;AAErF,MAAM,UAAU,GAAG,CACf,IAAO,EACP,KAA2B,EAC3B,WAAuC,EACvC,WAAmC,CAAC,IAAI,EAAa,EAAE,CAAC,IAAI;IAE5D,MAAM,KAAK,GAAe,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,SAAS;QACb,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;QAExC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAChB,SAAS;QACb,CAAC;aAAM,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACvB,OAAO;QACX,CAAC;QAED,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;gBACnD,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC"}

package/dist/utils/traversers/index.d.ts

@@ -1,4 +0,0 @@
-export * from "./bfs";
-export * from "./dfs";
-export * from "./types";
-//# sourceMappingURL=index.d.ts.map

package/dist/utils/traversers/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/traversers/index.ts"],"names":[],"mappings":"AAAA,cAAc,OAAO,CAAC;AACtB,cAAc,OAAO,CAAC;AACtB,cAAc,SAAS,CAAC"}

package/dist/utils/traversers/index.js

@@ -1,4 +0,0 @@
-export * from "./bfs";
-export * from "./dfs";
-export * from "./types";
-//# sourceMappingURL=index.js.map

package/dist/utils/traversers/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/traversers/index.ts"],"names":[],"mappings":"AAAA,cAAc,OAAO,CAAC;AACtB,cAAc,OAAO,CAAC;AACtB,cAAc,SAAS,CAAC"}

package/dist/utils/traversers/prunetree.d.ts

@@ -1,26 +0,0 @@
-import type { DeleterAction } from "./types";
-interface PruneTreeOptions<NODE, PARENT extends NODE = NODE, POINTER = NODE> {
-    /**
-     * @param node the node to check
-     * @returns **false** if the node SHOULD be deleted
-     */
-    predicate: (node: NODE, parents: readonly PARENT[]) => boolean;
-    getChildren: (node: PARENT) => readonly NODE[];
-    /**
-     * @param parent the parent node
-     * @param child the child that should be deleted
-     * @returns the pointer to the child node, or **null** if the child cannot be deleted
-     */
-    deleter: (parent: PARENT | undefined, child: NODE) => DeleterAction;
-    /**
-     * If there are circular references, we can use this function to get a unique identifier for the node.
-     *
-     * @param node
-     * @returns the unique identifier for the node
-     * @default node => node as unknown as POINTER (the reference itself is used as the identifier)
-     */
-    getPointer?: (node: NODE) => POINTER;
-}
-export declare function prunetree<NODE, ROOT extends NODE = NODE, PARENT extends NODE = NODE, POINTER = NODE>(root: ROOT, opts: PruneTreeOptions<NODE, PARENT, POINTER>): [result: ROOT | undefined, deleted: ReadonlySet<POINTER>];
-export {};
-//# sourceMappingURL=prunetree.d.ts.map

package/dist/utils/traversers/prunetree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"prunetree.d.ts","sourceRoot":"","sources":["../../../src/utils/traversers/prunetree.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAE7C,UAAU,gBAAgB,CAAC,IAAI,EAAE,MAAM,SAAS,IAAI,GAAG,IAAI,EAAE,OAAO,GAAG,IAAI;IACvE;;;OAGG;IACH,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,KAAK,OAAO,CAAC;IAC/D,WAAW,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,SAAS,IAAI,EAAE,CAAC;IAE/C;;;;OAIG;IACH,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,KAAK,EAAE,IAAI,KAAK,aAAa,CAAC;IAEpE;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,CAAC;CACxC;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,SAAS,IAAI,GAAG,IAAI,EAAE,MAAM,SAAS,IAAI,GAAG,IAAI,EAAE,OAAO,GAAG,IAAI,EAChG,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,GAC9C,CAAC,MAAM,EAAE,IAAI,GAAG,SAAS,EAAE,OAAO,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC,CAkD3D"}

package/dist/utils/traversers/prunetree.js

@@ -1,39 +0,0 @@
-import { bfs } from "./bfs";
-export function prunetree(root, opts) {
-    const { predicate, getChildren, deleter, getPointer = (node) => node } = opts;
-    const deleted = new Set();
-    // nodes is a stack of nodes in reverse order (the root node is the last element, and the "deepest" leaf node is the first element)
-    const nodes = [];
-    bfs(root, (node, parents) => {
-        nodes.unshift([node, parents]);
-    }, getChildren);
-    nodes.forEach(([node, parents]) => {
-        const order = [...parents, node];
-        const deletedIdx = order.findIndex((n) => deleted.has(getPointer(n)));
-        if (deletedIdx !== -1) {
-            order.slice(deletedIdx).forEach((n) => deleted.add(getPointer(n)));
-            return;
-        }
-        // continue traversal if the node is not to be deleted
-        if (predicate(node, parents)) {
-            return;
-        }
-        const ancestors = [...parents];
-        const parent = ancestors.pop();
-        let action = deleter(parent, node);
-        let toDelete = node;
-        while (action === "should-delete-parent" && parent != null) {
-            deleted.add(getPointer(toDelete));
-            toDelete = parent;
-            action = deleter(ancestors.pop(), parent);
-        }
-        if (action === "deleted") {
-            deleted.add(getPointer(toDelete));
-        }
-    });
-    if (deleted.has(getPointer(root))) {
-        return [undefined, deleted];
-    }
-    return [root, deleted];
-}
-//# sourceMappingURL=prunetree.js.map

package/dist/utils/traversers/prunetree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prunetree.js","sourceRoot":"","sources":["../../../src/utils/traversers/prunetree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AA4B5B,MAAM,UAAU,SAAS,CACrB,IAAU,EACV,IAA6C;IAE7C,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,IAA0B,EAAE,GAAG,IAAI,CAAC;IAEpG,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;IAEnC,mIAAmI;IACnI,MAAM,KAAK,GAAgC,EAAE,CAAC;IAE9C,GAAG,CACC,IAAI,EACJ,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE;QACd,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IACnC,CAAC,EACD,WAAW,CACd,CAAC;IAEF,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,EAAE,IAAI,CAAC,CAAC;QACjC,MAAM,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;YACpB,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,OAAO;QACX,CAAC;QAED,sDAAsD;QACtD,IAAI,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YAC3B,OAAO;QACX,CAAC;QACD,MAAM,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;QAE/B,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACnC,IAAI,QAAQ,GAAG,IAAI,CAAC;QAEpB,OAAO,MAAM,KAAK,sBAAsB,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACzD,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;YAClC,QAAQ,GAAG,MAAM,CAAC;YAClB,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9C,CAAC;QAED,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAChC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AAC3B,CAAC"}

package/dist/utils/traversers/types.d.ts

@@ -1,8 +0,0 @@
-export declare const SKIP: "skip";
-export declare const STOP = false;
-export declare const CONTINUE = true;
-export type Action = typeof CONTINUE | typeof SKIP | typeof STOP | void;
-export type TraverserVisit<N, P extends N = N> = (node: N, parents: readonly P[]) => Action;
-export type TraverserGetChildren<N, P extends N = N> = (parent: P) => readonly N[];
-export type DeleterAction = "deleted" | "should-delete-parent" | "noop";
-//# sourceMappingURL=types.d.ts.map

package/dist/utils/traversers/types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/utils/traversers/types.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,IAAI,EAAG,MAAe,CAAC;AACpC,eAAO,MAAM,IAAI,QAAQ,CAAC;AAC1B,eAAO,MAAM,QAAQ,OAAO,CAAC;AAE7B,MAAM,MAAM,MAAM,GAAG,OAAO,QAAQ,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,IAAI,CAAC;AAExE,MAAM,MAAM,cAAc,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,KAAK,MAAM,CAAC;AAC5F,MAAM,MAAM,oBAAoB,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,SAAS,CAAC,EAAE,CAAC;AAEnF,MAAM,MAAM,aAAa,GAAG,SAAS,GAAG,sBAAsB,GAAG,MAAM,CAAC"}

package/dist/utils/traversers/types.js

@@ -1,4 +0,0 @@
-export const SKIP = "skip";
-export const STOP = false;
-export const CONTINUE = true;
-//# sourceMappingURL=types.js.map

package/dist/utils/traversers/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/utils/traversers/types.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,IAAI,GAAG,MAAe,CAAC;AACpC,MAAM,CAAC,MAAM,IAAI,GAAG,KAAK,CAAC;AAC1B,MAAM,CAAC,MAAM,QAAQ,GAAG,IAAI,CAAC"}