@dxos/app-graph 0.3.3-main.052ad73

package/LICENSE

@@ -0,0 +1,8 @@
+MIT License 
+Copyright (c) 2022 DXOS
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/README.md

@@ -0,0 +1,13 @@
+# @dxos/app-graph
+
+## DXOS Resources
+
+- [Website](https://dxos.org)
+- [Developer Documentation](https://docs.dxos.org)
+- Talk to us on [Discord](https://discord.gg/eXVfryv3sW)
+
+## Contributions
+
+Your ideas, issues, and code are most welcome. Please take a look at our [community code of conduct](https://github.com/dxos/dxos/blob/main/CODE_OF_CONDUCT.md), the [issue guide](https://github.com/dxos/dxos/blob/main/CONTRIBUTING.md#submitting-issues), and the [PR contribution guide](https://github.com/dxos/dxos/blob/main/CONTRIBUTING.md#submitting-prs).
+
+License: [MIT](./LICENSE) Copyright 2023 © DXOS

package/dist/lib/browser/index.mjs

@@ -0,0 +1,252 @@
+// packages/sdk/app-graph/src/graph.ts
+import { deepSignal } from "deepsignal/react";
+import get from "lodash.get";
+var Graph = class {
+  constructor(_root) {
+    this._root = _root;
+    this._index = deepSignal({});
+  }
+  toJSON() {
+    const toLabel = (label) => Array.isArray(label) ? `${label[1].ns}[${label[0]}]` : label;
+    const toJSON = (node) => {
+      return {
+        id: node.id.slice(0, 16),
+        label: toLabel(node.label),
+        children: node.children.length ? node.children.map((node2) => toJSON(node2)) : void 0,
+        actions: node.actions.length ? node.actions.map(({ id, label }) => ({
+          id,
+          label: toLabel(label)
+        })) : void 0
+      };
+    };
+    return toJSON(this._root);
+  }
+  /**
+  * The root node of the graph which is the entry point for all knowledge.
+  */
+  get root() {
+    return this._root;
+  }
+  /**
+  * Get the path through the graph from the root to the node with the given id.
+  */
+  getPath(id) {
+    return this._index[id];
+  }
+  /**
+  * @internal
+  */
+  _setPath(id, path) {
+    this._index[id] = path;
+  }
+  /**
+  * Find the node with the given id in the graph.
+  */
+  findNode(id) {
+    const path = this.getPath(id);
+    if (!path) {
+      return void 0;
+    }
+    return path.length > 0 ? get(this._root, path) : this._root;
+  }
+  /**
+  * Recursive breadth-first traversal.
+  */
+  traverse({ node = this._root, direction = "down", filter, visitor }, depth = 0) {
+    if (!filter || filter(node)) {
+      visitor?.(node);
+    }
+    if (direction === "down") {
+      Object.values(node.children).forEach((child) => this.traverse({
+        node: child,
+        filter,
+        visitor
+      }));
+    } else if (direction === "up" && node.parent) {
+      this.traverse({
+        node: node.parent,
+        direction,
+        filter,
+        visitor
+      }, depth + 1);
+    }
+  }
+};
+
+// packages/sdk/app-graph/src/graph-builder.ts
+import { untracked } from "@preact/signals-react";
+import { deepSignal as deepSignal2 } from "deepsignal/react";
+import Mousetrap from "mousetrap";
+import { EventSubscriptions } from "@dxos/async";
+var GraphBuilder = class {
+  constructor() {
+    this._nodeBuilders = /* @__PURE__ */ new Map();
+    this._unsubscribe = /* @__PURE__ */ new Map();
+  }
+  /**
+  * Register a node builder which will be called in order to construct the graph.
+  */
+  addNodeBuilder(id, builder) {
+    this._nodeBuilders.set(id, builder);
+    return this;
+  }
+  /**
+  * Remove a node builder from the graph builder.
+  */
+  removeNodeBuilder(id) {
+    this._nodeBuilders.delete(id);
+    return this;
+  }
+  /**
+  * Construct the graph, starting by calling all registered node builders on the root node.
+  * Node builders will be filtered out as they are used such that they are only used once on any given path.
+  * @param root
+  * @param path
+  */
+  build(root, path = []) {
+    const graph = new Graph(root ?? this._createNode(() => graph, {
+      id: "root",
+      label: "Root"
+    }));
+    return this._build(graph, graph.root, path);
+  }
+  /**
+  * Called recursively.
+  */
+  _build(graph, node, path = [], ignoreBuilders = []) {
+    graph._setPath(node.id, path);
+    const subscriptions = this._unsubscribe.get(node.id) ?? new EventSubscriptions();
+    subscriptions.clear();
+    Array.from(this._nodeBuilders.entries()).filter(([id]) => ignoreBuilders.findIndex((ignore) => ignore === id) === -1).forEach(([_, builder]) => {
+      const unsubscribe = builder(node);
+      unsubscribe && subscriptions.add(unsubscribe);
+    });
+    this._unsubscribe.set(node.id, subscriptions);
+    return graph;
+  }
+  _createNode(getGraph, partial, path = [], ignoreBuilders = []) {
+    const node = deepSignal2({
+      parent: null,
+      data: null,
+      properties: {},
+      childrenMap: {},
+      actionsMap: {},
+      // TODO(burdon): Document.
+      ...partial,
+      // TODO(wittjosiah): Default sort.
+      get children() {
+        return Object.values(node.childrenMap);
+      },
+      get actions() {
+        return Object.values(node.actionsMap);
+      },
+      addProperty: (key, value) => {
+        untracked(() => {
+          node.properties[key] = value;
+        });
+      },
+      removeProperty: (key) => {
+        untracked(() => {
+          delete node.properties[key];
+        });
+      },
+      addNode: (builder, ...partials) => {
+        return untracked(() => {
+          return partials.map((partial2) => {
+            const builders = [
+              ...ignoreBuilders,
+              builder
+            ];
+            const childPath = [
+              ...path,
+              "childrenMap",
+              partial2.id
+            ];
+            const child = this._createNode(getGraph, {
+              ...partial2,
+              parent: node
+            }, childPath, builders);
+            node.childrenMap[child.id] = child;
+            this._build(getGraph(), child, childPath, builders);
+            return child;
+          });
+        });
+      },
+      removeNode: (id) => {
+        return untracked(() => {
+          const child = node.childrenMap[id];
+          delete node.childrenMap[id];
+          return child;
+        });
+      },
+      addAction: (...partials) => {
+        return untracked(() => {
+          return partials.map((partial2) => {
+            const action = this._createAction(partial2);
+            if (action.keyBinding) {
+              Mousetrap.bind(action.keyBinding, () => {
+                action.invoke();
+              });
+            }
+            node.actionsMap[action.id] = action;
+            return action;
+          });
+        });
+      },
+      removeAction: (id) => {
+        return untracked(() => {
+          const action = node.actionsMap[id];
+          if (action.keyBinding) {
+            Mousetrap.unbind(action.keyBinding);
+          }
+          delete node.actionsMap[id];
+          return action;
+        });
+      }
+    });
+    return node;
+  }
+  _createAction(partial) {
+    const action = deepSignal2({
+      properties: {},
+      actionsMap: {},
+      ...partial,
+      // TODO(wittjosiah): Default sort.
+      get actions() {
+        return Object.values(action.actionsMap);
+      },
+      addAction: (...partials) => {
+        return untracked(() => {
+          return partials.map((partial2) => {
+            const subAction = this._createAction(partial2);
+            action.actionsMap[subAction.id] = subAction;
+            return subAction;
+          });
+        });
+      },
+      removeAction: (id) => {
+        return untracked(() => {
+          const subAction = action.actionsMap[id];
+          delete action.actionsMap[id];
+          return subAction;
+        });
+      },
+      addProperty: (key, value) => {
+        return untracked(() => {
+          action.properties[key] = value;
+        });
+      },
+      removeProperty: (key) => {
+        return untracked(() => {
+          delete action.properties[key];
+        });
+      }
+    });
+    return action;
+  }
+};
+export {
+  Graph,
+  GraphBuilder
+};
+//# sourceMappingURL=index.mjs.map

package/dist/lib/browser/index.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/graph.ts", "../../../src/graph-builder.ts"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { deepSignal } from 'deepsignal/react';\n// TODO(wittjosiah): Remove lodash dependency.\nimport get from 'lodash.get';\n\nimport { type Label } from './action';\nimport { type Node } from './node';\n\nexport type TraversalOptions = {\n  /**\n   * The node to start traversing from. Defaults to the root node.\n   */\n  node?: Node;\n\n  /**\n   * The direction to traverse the graph. Defaults to 'down'.\n   */\n  direction?: 'up' | 'down';\n\n  /**\n   * A predicate to filter nodes which are passed to the `visitor` callback.\n   */\n  filter?: (node: Node) => boolean;\n\n  /**\n   * A callback which is called for each node visited during traversal.\n   */\n  visitor?: (node: Node) => void;\n};\n\n/**\n * The Graph represents...\n */\nexport class Graph {\n  // TODO(burdon): Document.\n  // TODO(wittjosiah): Should this support multiple paths to the same node?\n  private readonly _index = deepSignal<{ [key: string]: string[] }>({});\n\n  constructor(private readonly _root: Node) {}\n\n  toJSON() {\n    const toLabel = (label: Label) => (Array.isArray(label) ? `${label[1].ns}[${label[0]}]` : label);\n    const toJSON = (node: Node): any => {\n      return {\n        id: node.id.slice(0, 16),\n        label: toLabel(node.label),\n        children: node.children.length ? node.children.map((node) => toJSON(node)) : undefined,\n        actions: node.actions.length\n          ? node.actions.map(({ id, label }) => ({\n              id,\n              label: toLabel(label),\n            }))\n          : undefined,\n      };\n    };\n\n    return toJSON(this._root);\n  }\n\n  /**\n   * The root node of the graph which is the entry point for all knowledge.\n   */\n  get root(): Node {\n    return this._root;\n  }\n\n  /**\n   * Get the path through the graph from the root to the node with the given id.\n   */\n  getPath(id: string): string[] | undefined {\n    return this._index[id];\n  }\n\n  /**\n   * @internal\n   */\n  _setPath(id: string, path: string[]) {\n    this._index[id] = path;\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   */\n  findNode(id: string): Node | undefined {\n    const path = this.getPath(id);\n    if (!path) {\n      return undefined;\n    }\n\n    return path.length > 0 ? get(this._root, path) : this._root;\n  }\n\n  /**\n   * Recursive breadth-first traversal.\n   */\n  traverse({ node = this._root, direction = 'down', filter, visitor }: TraversalOptions, depth = 0): void {\n    if (!filter || filter(node)) {\n      visitor?.(node);\n    }\n\n    if (direction === 'down') {\n      Object.values(node.children).forEach((child) => this.traverse({ node: child, filter, visitor }));\n    } else if (direction === 'up' && node.parent) {\n      this.traverse({ node: node.parent, direction, filter, visitor }, depth + 1);\n    }\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { untracked } from '@preact/signals-react';\nimport { type RevertDeepSignal, deepSignal } from 'deepsignal/react';\nimport Mousetrap from 'mousetrap';\n\nimport { EventSubscriptions } from '@dxos/async';\n\nimport { type Action } from './action';\nimport { Graph } from './graph';\nimport { type Node, type NodeBuilder } from './node';\n\n/**\n * The builder...\n */\nexport class GraphBuilder {\n  private readonly _nodeBuilders = new Map<string, NodeBuilder>();\n  private readonly _unsubscribe = new Map<string, EventSubscriptions>();\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addNodeBuilder(id: string, builder: NodeBuilder): GraphBuilder {\n    this._nodeBuilders.set(id, builder);\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeNodeBuilder(id: string): GraphBuilder {\n    this._nodeBuilders.delete(id);\n    return this;\n  }\n\n  /**\n   * Construct the graph, starting by calling all registered node builders on the root node.\n   * Node builders will be filtered out as they are used such that they are only used once on any given path.\n   * @param root\n   * @param path\n   */\n  build(root?: Node, path: string[] = []): Graph {\n    const graph: Graph = new Graph(root ?? this._createNode(() => graph, { id: 'root', label: 'Root' }));\n    return this._build(graph, graph.root, path);\n  }\n\n  /**\n   * Called recursively.\n   */\n  private _build(graph: Graph, node: Node, path: string[] = [], ignoreBuilders: string[] = []): Graph {\n    // TODO(wittjosiah): Should this support multiple paths to the same node?\n    graph._setPath(node.id, path);\n\n    // TODO(burdon): Document.\n    const subscriptions = this._unsubscribe.get(node.id) ?? new EventSubscriptions();\n    subscriptions.clear();\n\n    Array.from(this._nodeBuilders.entries())\n      .filter(([id]) => ignoreBuilders.findIndex((ignore) => ignore === id) === -1)\n      .forEach(([_, builder]) => {\n        const unsubscribe = builder(node);\n        unsubscribe && subscriptions.add(unsubscribe);\n      });\n\n    this._unsubscribe.set(node.id, subscriptions);\n\n    return graph;\n  }\n\n  private _createNode<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    getGraph: () => Graph,\n    partial: Pick<Node, 'id' | 'label'> & Partial<Node<TData, TProperties>>,\n    path: string[] = [],\n    ignoreBuilders: string[] = [],\n  ): Node<TData, TProperties> {\n    // TODO(burdon): Document implications and rationale of deepSignal.\n    const node: Node<TData, TProperties> = deepSignal({\n      parent: null,\n      data: null as TData, // TODO(burdon): Allow null property?\n      properties: {} as TProperties,\n      childrenMap: {},\n      actionsMap: {},\n      // TODO(burdon): Document.\n      ...partial,\n\n      // TODO(wittjosiah): Default sort.\n      get children() {\n        return Object.values(node.childrenMap);\n      },\n      get actions() {\n        return Object.values(node.actionsMap);\n      },\n\n      addProperty: (key, value) => {\n        untracked(() => {\n          (node.properties as Record<string, any>)[key] = value;\n        });\n      },\n      removeProperty: (key) => {\n        untracked(() => {\n          delete (node.properties as Record<string, any>)[key];\n        });\n      },\n\n      addNode: (builder, ...partials) => {\n        return untracked(() => {\n          return partials.map((partial) => {\n            const builders = [...ignoreBuilders, builder];\n            const childPath = [...path, 'childrenMap', partial.id];\n            const child = this._createNode(getGraph, { ...partial, parent: node }, childPath, builders);\n            node.childrenMap[child.id] = child;\n            // TOOD(burdon): Defer triggering recursive updates until task has completed.\n            this._build(getGraph(), child, childPath, builders);\n            return child;\n          });\n        });\n      },\n      removeNode: (id) => {\n        return untracked(() => {\n          const child = node.childrenMap[id];\n          delete node.childrenMap[id];\n          return child;\n        });\n      },\n\n      addAction: (...partials) => {\n        return untracked(() => {\n          return partials.map((partial) => {\n            const action = this._createAction(partial);\n            if (action.keyBinding) {\n              Mousetrap.bind(action.keyBinding, () => {\n                action.invoke();\n              });\n            }\n\n            node.actionsMap[action.id] = action;\n            return action;\n          });\n        });\n      },\n      removeAction: (id) => {\n        return untracked(() => {\n          const action = node.actionsMap[id];\n          if (action.keyBinding) {\n            Mousetrap.unbind(action.keyBinding);\n          }\n\n          delete node.actionsMap[id];\n          return action;\n        });\n      },\n    }) as RevertDeepSignal<Node<TData, TProperties>>;\n\n    return node;\n  }\n\n  private _createAction<TProperties extends Record<string, any> = Record<string, any>>(\n    partial: Pick<Action, 'id' | 'label' | 'invoke'> & Partial<Action<TProperties>>,\n  ): Action<TProperties> {\n    const action: Action<TProperties> = deepSignal({\n      properties: {} as TProperties,\n      actionsMap: {},\n      ...partial,\n      // TODO(wittjosiah): Default sort.\n      get actions() {\n        return Object.values(action.actionsMap);\n      },\n      addAction: (...partials) => {\n        return untracked(() => {\n          return partials.map((partial) => {\n            const subAction = this._createAction(partial);\n            action.actionsMap[subAction.id] = subAction;\n            return subAction;\n          });\n        });\n      },\n      removeAction: (id) => {\n        return untracked(() => {\n          const subAction = action.actionsMap[id];\n          delete action.actionsMap[id];\n          return subAction;\n        });\n      },\n      addProperty: (key, value) => {\n        return untracked(() => {\n          (action.properties as Record<string, any>)[key] = value;\n        });\n      },\n      removeProperty: (key) => {\n        return untracked(() => {\n          delete (action.properties as Record<string, any>)[key];\n        });\n      },\n    }) as RevertDeepSignal<Action<TProperties>>;\n\n    return action;\n  }\n}\n"],
+  "mappings": ";AAIA,SAASA,kBAAkB;AAE3B,OAAOC,SAAS;AA8BT,IAAMC,QAAN,MAAMA;EAKXC,YAA6BC,OAAa;iBAAbA;SAFZC,SAASC,WAAwC,CAAC,CAAA;EAExB;EAE3CC,SAAS;AACP,UAAMC,UAAU,CAACC,UAAkBC,MAAMC,QAAQF,KAAAA,IAAS,GAAGA,MAAM,CAAA,EAAGG,EAAE,IAAIH,MAAM,CAAA,CAAE,MAAMA;AAC1F,UAAMF,SAAS,CAACM,SAAAA;AACd,aAAO;QACLC,IAAID,KAAKC,GAAGC,MAAM,GAAG,EAAA;QACrBN,OAAOD,QAAQK,KAAKJ,KAAK;QACzBO,UAAUH,KAAKG,SAASC,SAASJ,KAAKG,SAASE,IAAI,CAACL,UAASN,OAAOM,KAAAA,CAAAA,IAASM;QAC7EC,SAASP,KAAKO,QAAQH,SAClBJ,KAAKO,QAAQF,IAAI,CAAC,EAAEJ,IAAIL,MAAK,OAAQ;UACnCK;UACAL,OAAOD,QAAQC,KAAAA;QACjB,EAAA,IACAU;MACN;IACF;AAEA,WAAOZ,OAAO,KAAKH,KAAK;EAC1B;;;;EAKA,IAAIiB,OAAa;AACf,WAAO,KAAKjB;EACd;;;;EAKAkB,QAAQR,IAAkC;AACxC,WAAO,KAAKT,OAAOS,EAAAA;EACrB;;;;EAKAS,SAAST,IAAYU,MAAgB;AACnC,SAAKnB,OAAOS,EAAAA,IAAMU;EACpB;;;;EAKAC,SAASX,IAA8B;AACrC,UAAMU,OAAO,KAAKF,QAAQR,EAAAA;AAC1B,QAAI,CAACU,MAAM;AACT,aAAOL;IACT;AAEA,WAAOK,KAAKP,SAAS,IAAIS,IAAI,KAAKtB,OAAOoB,IAAAA,IAAQ,KAAKpB;EACxD;;;;EAKAuB,SAAS,EAAEd,OAAO,KAAKT,OAAOwB,YAAY,QAAQC,QAAQC,QAAO,GAAsBC,QAAQ,GAAS;AACtG,QAAI,CAACF,UAAUA,OAAOhB,IAAAA,GAAO;AAC3BiB,gBAAUjB,IAAAA;IACZ;AAEA,QAAIe,cAAc,QAAQ;AACxBI,aAAOC,OAAOpB,KAAKG,QAAQ,EAAEkB,QAAQ,CAACC,UAAU,KAAKR,SAAS;QAAEd,MAAMsB;QAAON;QAAQC;MAAQ,CAAA,CAAA;IAC/F,WAAWF,cAAc,QAAQf,KAAKuB,QAAQ;AAC5C,WAAKT,SAAS;QAAEd,MAAMA,KAAKuB;QAAQR;QAAWC;QAAQC;MAAQ,GAAGC,QAAQ,CAAA;IAC3E;EACF;AACF;;;ACzGA,SAASM,iBAAiB;AAC1B,SAAgCC,cAAAA,mBAAkB;AAClD,OAAOC,eAAe;AAEtB,SAASC,0BAA0B;AAS5B,IAAMC,eAAN,MAAMA;EAAN;AACYC,yBAAgB,oBAAIC,IAAAA;AACpBC,wBAAe,oBAAID,IAAAA;;;;;EAKpCE,eAAeC,IAAYC,SAAoC;AAC7D,SAAKL,cAAcM,IAAIF,IAAIC,OAAAA;AAC3B,WAAO;EACT;;;;EAKAE,kBAAkBH,IAA0B;AAC1C,SAAKJ,cAAcQ,OAAOJ,EAAAA;AAC1B,WAAO;EACT;;;;;;;EAQAK,MAAMC,MAAaC,OAAiB,CAAA,GAAW;AAC7C,UAAMC,QAAe,IAAIC,MAAMH,QAAQ,KAAKI,YAAY,MAAMF,OAAO;MAAER,IAAI;MAAQW,OAAO;IAAO,CAAA,CAAA;AACjG,WAAO,KAAKC,OAAOJ,OAAOA,MAAMF,MAAMC,IAAAA;EACxC;;;;EAKQK,OAAOJ,OAAcK,MAAYN,OAAiB,CAAA,GAAIO,iBAA2B,CAAA,GAAW;AAElGN,UAAMO,SAASF,KAAKb,IAAIO,IAAAA;AAGxB,UAAMS,gBAAgB,KAAKlB,aAAamB,IAAIJ,KAAKb,EAAE,KAAK,IAAIkB,mBAAAA;AAC5DF,kBAAcG,MAAK;AAEnBC,UAAMC,KAAK,KAAKzB,cAAc0B,QAAO,CAAA,EAClCC,OAAO,CAAC,CAACvB,EAAAA,MAAQc,eAAeU,UAAU,CAACC,WAAWA,WAAWzB,EAAAA,MAAQ,EAAC,EAC1E0B,QAAQ,CAAC,CAACC,GAAG1B,OAAAA,MAAQ;AACpB,YAAM2B,cAAc3B,QAAQY,IAAAA;AAC5Be,qBAAeZ,cAAca,IAAID,WAAAA;IACnC,CAAA;AAEF,SAAK9B,aAAaI,IAAIW,KAAKb,IAAIgB,aAAAA;AAE/B,WAAOR;EACT;EAEQE,YACNoB,UACAC,SACAxB,OAAiB,CAAA,GACjBO,iBAA2B,CAAA,GACD;AAE1B,UAAMD,OAAiCmB,YAAW;MAChDC,QAAQ;MACRC,MAAM;MACNC,YAAY,CAAC;MACbC,aAAa,CAAC;MACdC,YAAY,CAAC;;MAEb,GAAGN;;MAGH,IAAIO,WAAW;AACb,eAAOC,OAAOC,OAAO3B,KAAKuB,WAAW;MACvC;MACA,IAAIK,UAAU;AACZ,eAAOF,OAAOC,OAAO3B,KAAKwB,UAAU;MACtC;MAEAK,aAAa,CAACC,KAAKC,UAAAA;AACjBC,kBAAU,MAAA;AACPhC,eAAKsB,WAAmCQ,GAAAA,IAAOC;QAClD,CAAA;MACF;MACAE,gBAAgB,CAACH,QAAAA;AACfE,kBAAU,MAAA;AACR,iBAAQhC,KAAKsB,WAAmCQ,GAAAA;QAClD,CAAA;MACF;MAEAI,SAAS,CAAC9C,YAAY+C,aAAAA;AACpB,eAAOH,UAAU,MAAA;AACf,iBAAOG,SAASC,IAAI,CAAClB,aAAAA;AACnB,kBAAMmB,WAAW;iBAAIpC;cAAgBb;;AACrC,kBAAMkD,YAAY;iBAAI5C;cAAM;cAAewB,SAAQ/B;;AACnD,kBAAMoD,QAAQ,KAAK1C,YAAYoB,UAAU;cAAE,GAAGC;cAASE,QAAQpB;YAAK,GAAGsC,WAAWD,QAAAA;AAClFrC,iBAAKuB,YAAYgB,MAAMpD,EAAE,IAAIoD;AAE7B,iBAAKxC,OAAOkB,SAAAA,GAAYsB,OAAOD,WAAWD,QAAAA;AAC1C,mBAAOE;UACT,CAAA;QACF,CAAA;MACF;MACAC,YAAY,CAACrD,OAAAA;AACX,eAAO6C,UAAU,MAAA;AACf,gBAAMO,QAAQvC,KAAKuB,YAAYpC,EAAAA;AAC/B,iBAAOa,KAAKuB,YAAYpC,EAAAA;AACxB,iBAAOoD;QACT,CAAA;MACF;MAEAE,WAAW,IAAIN,aAAAA;AACb,eAAOH,UAAU,MAAA;AACf,iBAAOG,SAASC,IAAI,CAAClB,aAAAA;AACnB,kBAAMwB,SAAS,KAAKC,cAAczB,QAAAA;AAClC,gBAAIwB,OAAOE,YAAY;AACrBC,wBAAUC,KAAKJ,OAAOE,YAAY,MAAA;AAChCF,uBAAOK,OAAM;cACf,CAAA;YACF;AAEA/C,iBAAKwB,WAAWkB,OAAOvD,EAAE,IAAIuD;AAC7B,mBAAOA;UACT,CAAA;QACF,CAAA;MACF;MACAM,cAAc,CAAC7D,OAAAA;AACb,eAAO6C,UAAU,MAAA;AACf,gBAAMU,SAAS1C,KAAKwB,WAAWrC,EAAAA;AAC/B,cAAIuD,OAAOE,YAAY;AACrBC,sBAAUI,OAAOP,OAAOE,UAAU;UACpC;AAEA,iBAAO5C,KAAKwB,WAAWrC,EAAAA;AACvB,iBAAOuD;QACT,CAAA;MACF;IACF,CAAA;AAEA,WAAO1C;EACT;EAEQ2C,cACNzB,SACqB;AACrB,UAAMwB,SAA8BvB,YAAW;MAC7CG,YAAY,CAAC;MACbE,YAAY,CAAC;MACb,GAAGN;;MAEH,IAAIU,UAAU;AACZ,eAAOF,OAAOC,OAAOe,OAAOlB,UAAU;MACxC;MACAiB,WAAW,IAAIN,aAAAA;AACb,eAAOH,UAAU,MAAA;AACf,iBAAOG,SAASC,IAAI,CAAClB,aAAAA;AACnB,kBAAMgC,YAAY,KAAKP,cAAczB,QAAAA;AACrCwB,mBAAOlB,WAAW0B,UAAU/D,EAAE,IAAI+D;AAClC,mBAAOA;UACT,CAAA;QACF,CAAA;MACF;MACAF,cAAc,CAAC7D,OAAAA;AACb,eAAO6C,UAAU,MAAA;AACf,gBAAMkB,YAAYR,OAAOlB,WAAWrC,EAAAA;AACpC,iBAAOuD,OAAOlB,WAAWrC,EAAAA;AACzB,iBAAO+D;QACT,CAAA;MACF;MACArB,aAAa,CAACC,KAAKC,UAAAA;AACjB,eAAOC,UAAU,MAAA;AACdU,iBAAOpB,WAAmCQ,GAAAA,IAAOC;QACpD,CAAA;MACF;MACAE,gBAAgB,CAACH,QAAAA;AACf,eAAOE,UAAU,MAAA;AACf,iBAAQU,OAAOpB,WAAmCQ,GAAAA;QACpD,CAAA;MACF;IACF,CAAA;AAEA,WAAOY;EACT;AACF;",
+  "names": ["deepSignal", "get", "Graph", "constructor", "_root", "_index", "deepSignal", "toJSON", "toLabel", "label", "Array", "isArray", "ns", "node", "id", "slice", "children", "length", "map", "undefined", "actions", "root", "getPath", "_setPath", "path", "findNode", "get", "traverse", "direction", "filter", "visitor", "depth", "Object", "values", "forEach", "child", "parent", "untracked", "deepSignal", "Mousetrap", "EventSubscriptions", "GraphBuilder", "_nodeBuilders", "Map", "_unsubscribe", "addNodeBuilder", "id", "builder", "set", "removeNodeBuilder", "delete", "build", "root", "path", "graph", "Graph", "_createNode", "label", "_build", "node", "ignoreBuilders", "_setPath", "subscriptions", "get", "EventSubscriptions", "clear", "Array", "from", "entries", "filter", "findIndex", "ignore", "forEach", "_", "unsubscribe", "add", "getGraph", "partial", "deepSignal", "parent", "data", "properties", "childrenMap", "actionsMap", "children", "Object", "values", "actions", "addProperty", "key", "value", "untracked", "removeProperty", "addNode", "partials", "map", "builders", "childPath", "child", "removeNode", "addAction", "action", "_createAction", "keyBinding", "Mousetrap", "bind", "invoke", "removeAction", "unbind", "subAction"]
+}

package/dist/lib/browser/meta.json

@@ -0,0 +1 @@
+{"inputs":{"packages/sdk/app-graph/src/action.ts":{"bytes":2779,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":9066,"imports":[{"path":"deepsignal/react","kind":"import-statement","external":true},{"path":"lodash.get","kind":"import-statement","external":true}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":21055,"imports":[{"path":"@preact/signals-react","kind":"import-statement","external":true},{"path":"deepsignal/react","kind":"import-statement","external":true},{"path":"mousetrap","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"packages/sdk/app-graph/src/node.ts":{"bytes":4185,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":722,"imports":[{"path":"packages/sdk/app-graph/src/action.ts","kind":"import-statement","original":"./action"},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/testing.ts":{"bytes":11884,"imports":[],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":15267},"packages/sdk/app-graph/dist/lib/browser/index.mjs":{"imports":[{"path":"deepsignal/react","kind":"import-statement","external":true},{"path":"lodash.get","kind":"import-statement","external":true},{"path":"@preact/signals-react","kind":"import-statement","external":true},{"path":"deepsignal/react","kind":"import-statement","external":true},{"path":"mousetrap","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true}],"exports":["Graph","GraphBuilder"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":1818},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":5033}},"bytes":7009},"packages/sdk/app-graph/dist/lib/browser/testing.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":6167},"packages/sdk/app-graph/dist/lib/browser/testing.mjs":{"imports":[],"exports":["buildGraph","createTestNodeBuilder"],"entryPoint":"packages/sdk/app-graph/src/testing.ts","inputs":{"packages/sdk/app-graph/src/testing.ts":{"bytesInOutput":2180}},"bytes":2308}}}

package/dist/lib/browser/testing.mjs

@@ -0,0 +1,98 @@
+// packages/sdk/app-graph/src/testing.ts
+var createTestNodeBuilder = (id, depth = 1) => {
+  const nodes = /* @__PURE__ */ new Map();
+  const nodeBuilder = (parent) => {
+    if (checkDepth(parent) >= depth) {
+      return;
+    }
+    const [child] = parent.addNode(id, {
+      id: `${parent.id}-${id}`,
+      label: `${parent.id}-${id}`,
+      data: null,
+      parent
+    });
+    parent.addAction({
+      id: `${parent.id}-${id}`,
+      label: `${parent.id}-${id}`,
+      invoke: () => {
+      }
+    });
+    nodes.set(parent.id, parent);
+    nodes.set(child.id, child);
+  };
+  const addNode = (parentId, node) => {
+    const parent = nodes.get(parentId);
+    if (!parent) {
+      return;
+    }
+    const [child] = parent.addNode(id, node);
+    nodes.set(child.id, child);
+    return child;
+  };
+  const removeNode = (parentId, id2) => {
+    const parent = nodes.get(parentId);
+    if (!parent) {
+      return;
+    }
+    return parent.removeNode(id2);
+  };
+  const addAction = (parentId, action) => {
+    const parent = nodes.get(parentId);
+    if (!parent) {
+      return;
+    }
+    return parent.addAction(action);
+  };
+  const removeAction = (parentId, id2) => {
+    const parent = nodes.get(parentId);
+    if (!parent) {
+      return;
+    }
+    return parent.removeAction(id2);
+  };
+  const addProperty = (parentId, key, value) => {
+    const parent = nodes.get(parentId);
+    if (!parent) {
+      return;
+    }
+    return parent.addProperty(key, value);
+  };
+  const removeProperty = (parentId, key) => {
+    const parent = nodes.get(parentId);
+    if (!parent) {
+      return;
+    }
+    return parent.removeProperty(key);
+  };
+  return {
+    nodeBuilder,
+    addNode,
+    removeNode,
+    addAction,
+    removeAction,
+    addProperty,
+    removeProperty
+  };
+};
+var buildGraph = (graph, id, nodes) => {
+  addNodes(graph.root, id, nodes);
+  return graph;
+};
+var addNodes = (root, id, nodes) => {
+  nodes.forEach((node) => {
+    const [child] = root.addNode(id, node);
+    addNodes(child, id, node.children || []);
+    node.actions?.forEach((action) => child.addAction(action));
+  });
+};
+var checkDepth = (node, depth = 0) => {
+  if (!node.parent) {
+    return depth;
+  }
+  return checkDepth(node.parent, depth + 1);
+};
+export {
+  buildGraph,
+  createTestNodeBuilder
+};
+//# sourceMappingURL=testing.mjs.map

package/dist/lib/browser/testing.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/testing.ts"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Action } from './action';\nimport { type Graph } from './graph';\nimport { type NodeBuilder, type Node } from './node';\n\n/**\n * Create a test node builder that always adds nodes and actions to the specified depth.\n *\n * @param id The id of the node builder, used to identify nodes created by this builder.\n * @param depth The depth at which to add nodes and actions.\n * @default 1\n *\n * @returns A test node builder\n */\n// TODO(burdon): Change to TestNodeBuilder class (see other builder/generator patterns in client/echo).\nexport const createTestNodeBuilder = (id: string, depth = 1) => {\n  const nodes = new Map<string, Node>();\n  const nodeBuilder: NodeBuilder = (parent) => {\n    if (checkDepth(parent) >= depth) {\n      return;\n    }\n\n    const [child] = parent.addNode(id, {\n      id: `${parent.id}-${id}`,\n      label: `${parent.id}-${id}`,\n      data: null,\n      parent,\n    });\n\n    parent.addAction({\n      id: `${parent.id}-${id}`,\n      label: `${parent.id}-${id}`,\n      invoke: () => {},\n    });\n\n    nodes.set(parent.id, parent);\n    nodes.set(child.id, child);\n  };\n\n  const addNode = (parentId: string, node: Pick<Node, 'id' | 'label'> & Partial<Node>) => {\n    const parent = nodes.get(parentId);\n    if (!parent) {\n      return;\n    }\n\n    const [child] = parent.addNode(id, node);\n    nodes.set(child.id, child);\n    return child;\n  };\n\n  const removeNode = (parentId: string, id: string) => {\n    const parent = nodes.get(parentId);\n    if (!parent) {\n      return;\n    }\n\n    return parent.removeNode(id);\n  };\n\n  const addAction = (parentId: string, action: Pick<Action, 'id' | 'label' | 'invoke'> & Partial<Action>) => {\n    const parent = nodes.get(parentId);\n    if (!parent) {\n      return;\n    }\n\n    return parent.addAction(action);\n  };\n\n  const removeAction = (parentId: string, id: string) => {\n    const parent = nodes.get(parentId);\n    if (!parent) {\n      return;\n    }\n\n    return parent.removeAction(id);\n  };\n\n  const addProperty = (parentId: string, key: string, value: any) => {\n    const parent = nodes.get(parentId);\n    if (!parent) {\n      return;\n    }\n\n    return parent.addProperty(key, value);\n  };\n\n  const removeProperty = (parentId: string, key: string) => {\n    const parent = nodes.get(parentId);\n    if (!parent) {\n      return;\n    }\n\n    return parent.removeProperty(key);\n  };\n\n  return { nodeBuilder, addNode, removeNode, addAction, removeAction, addProperty, removeProperty };\n};\n\n/**\n * Build a graph from a nested list of nodes.\n *\n * @param graph Graph to add nodes to.\n * @param nodes Nodes to add to the\n *\n * @example\n * const graph = new GraphStore();\n * buildGraph(graph, [\n *   {\n *     id: 'test1',\n *     label: 'test1',\n *     children: [\n *       {\n *         id: 'test1.1',\n *         label: 'test1.1',\n *       },\n *       {\n *         id: 'test1.2',\n *         label: 'test1.2',\n *       },\n *     ],\n *   },\n *   {\n *     id: 'test2',\n *     label: 'test2',\n *   },\n * ]);\n */\n\n// TODO(wittjosiah): Type nodes.\nexport const buildGraph = (graph: Graph, id: string, nodes: any[]) => {\n  addNodes(graph.root, id, nodes);\n  return graph;\n};\n\nconst addNodes = (root: Node, id: string, nodes: any[]) => {\n  nodes.forEach((node) => {\n    const [child] = root.addNode(id, node);\n    addNodes(child, id, node.children || []);\n    node.actions?.forEach((action: any) => child.addAction(action));\n  });\n};\n\nconst checkDepth = (node: Node, depth = 0): number => {\n  if (!node.parent) {\n    return depth;\n  }\n\n  return checkDepth(node.parent, depth + 1);\n};\n"],
+  "mappings": ";AAkBO,IAAMA,wBAAwB,CAACC,IAAYC,QAAQ,MAAC;AACzD,QAAMC,QAAQ,oBAAIC,IAAAA;AAClB,QAAMC,cAA2B,CAACC,WAAAA;AAChC,QAAIC,WAAWD,MAAAA,KAAWJ,OAAO;AAC/B;IACF;AAEA,UAAM,CAACM,KAAAA,IAASF,OAAOG,QAAQR,IAAI;MACjCA,IAAI,GAAGK,OAAOL,EAAE,IAAIA,EAAAA;MACpBS,OAAO,GAAGJ,OAAOL,EAAE,IAAIA,EAAAA;MACvBU,MAAM;MACNL;IACF,CAAA;AAEAA,WAAOM,UAAU;MACfX,IAAI,GAAGK,OAAOL,EAAE,IAAIA,EAAAA;MACpBS,OAAO,GAAGJ,OAAOL,EAAE,IAAIA,EAAAA;MACvBY,QAAQ,MAAA;MAAO;IACjB,CAAA;AAEAV,UAAMW,IAAIR,OAAOL,IAAIK,MAAAA;AACrBH,UAAMW,IAAIN,MAAMP,IAAIO,KAAAA;EACtB;AAEA,QAAMC,UAAU,CAACM,UAAkBC,SAAAA;AACjC,UAAMV,SAASH,MAAMc,IAAIF,QAAAA;AACzB,QAAI,CAACT,QAAQ;AACX;IACF;AAEA,UAAM,CAACE,KAAAA,IAASF,OAAOG,QAAQR,IAAIe,IAAAA;AACnCb,UAAMW,IAAIN,MAAMP,IAAIO,KAAAA;AACpB,WAAOA;EACT;AAEA,QAAMU,aAAa,CAACH,UAAkBd,QAAAA;AACpC,UAAMK,SAASH,MAAMc,IAAIF,QAAAA;AACzB,QAAI,CAACT,QAAQ;AACX;IACF;AAEA,WAAOA,OAAOY,WAAWjB,GAAAA;EAC3B;AAEA,QAAMW,YAAY,CAACG,UAAkBI,WAAAA;AACnC,UAAMb,SAASH,MAAMc,IAAIF,QAAAA;AACzB,QAAI,CAACT,QAAQ;AACX;IACF;AAEA,WAAOA,OAAOM,UAAUO,MAAAA;EAC1B;AAEA,QAAMC,eAAe,CAACL,UAAkBd,QAAAA;AACtC,UAAMK,SAASH,MAAMc,IAAIF,QAAAA;AACzB,QAAI,CAACT,QAAQ;AACX;IACF;AAEA,WAAOA,OAAOc,aAAanB,GAAAA;EAC7B;AAEA,QAAMoB,cAAc,CAACN,UAAkBO,KAAaC,UAAAA;AAClD,UAAMjB,SAASH,MAAMc,IAAIF,QAAAA;AACzB,QAAI,CAACT,QAAQ;AACX;IACF;AAEA,WAAOA,OAAOe,YAAYC,KAAKC,KAAAA;EACjC;AAEA,QAAMC,iBAAiB,CAACT,UAAkBO,QAAAA;AACxC,UAAMhB,SAASH,MAAMc,IAAIF,QAAAA;AACzB,QAAI,CAACT,QAAQ;AACX;IACF;AAEA,WAAOA,OAAOkB,eAAeF,GAAAA;EAC/B;AAEA,SAAO;IAAEjB;IAAaI;IAASS;IAAYN;IAAWQ;IAAcC;IAAaG;EAAe;AAClG;AAiCO,IAAMC,aAAa,CAACC,OAAczB,IAAYE,UAAAA;AACnDwB,WAASD,MAAME,MAAM3B,IAAIE,KAAAA;AACzB,SAAOuB;AACT;AAEA,IAAMC,WAAW,CAACC,MAAY3B,IAAYE,UAAAA;AACxCA,QAAM0B,QAAQ,CAACb,SAAAA;AACb,UAAM,CAACR,KAAAA,IAASoB,KAAKnB,QAAQR,IAAIe,IAAAA;AACjCW,aAASnB,OAAOP,IAAIe,KAAKc,YAAY,CAAA,CAAE;AACvCd,SAAKe,SAASF,QAAQ,CAACV,WAAgBX,MAAMI,UAAUO,MAAAA,CAAAA;EACzD,CAAA;AACF;AAEA,IAAMZ,aAAa,CAACS,MAAYd,QAAQ,MAAC;AACvC,MAAI,CAACc,KAAKV,QAAQ;AAChB,WAAOJ;EACT;AAEA,SAAOK,WAAWS,KAAKV,QAAQJ,QAAQ,CAAA;AACzC;",
+  "names": ["createTestNodeBuilder", "id", "depth", "nodes", "Map", "nodeBuilder", "parent", "checkDepth", "child", "addNode", "label", "data", "addAction", "invoke", "set", "parentId", "node", "get", "removeNode", "action", "removeAction", "addProperty", "key", "value", "removeProperty", "buildGraph", "graph", "addNodes", "root", "forEach", "children", "actions"]
+}