@fern-api/fdr-sdk 1.1.24-e30ed51fda → 1.1.24-e3bdb9c0a9

package/dist/utils/traversers/index.js

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

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,26 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,39 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,8 @@
+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

@@ -0,0 +1 @@
+{"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

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

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

@@ -0,0 +1 @@
+{"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"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fern-api/fdr-sdk",
-  "version": "1.1.24-e30ed51fda",
+  "version": "1.1.24-e3bdb9c0a9",
   "repository": {
     "type": "git",
     "url": "https://github.com/fern-api/fern-platform.git",