@dxos/plugin-explorer 0.8.4-main.c4373fc → 0.8.4-main.d9fc60f731

package/dist/lib/neutral/chunk-3D7BYXOR.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/ExplorerPlugin.tsx", "raw-loader:/__w/dxos/dxos/packages/plugins/plugin-explorer/PLUGIN.mdl?raw"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Plugin } from '@dxos/app-framework';\nimport { AppPlugin } from '@dxos/app-toolkit';\n\nimport { CreateObject, ReactSurface } from '#capabilities';\nimport { meta } from '#meta';\nimport { translations } from '#translations';\nimport { Graph } from '#types';\n\n// eslint-disable-next-line import/no-relative-packages\nimport pluginSpec from '../PLUGIN.mdl?raw';\n\nexport const ExplorerPlugin = Plugin.define(meta).pipe(\n  AppPlugin.addCreateObjectModule({ activate: CreateObject }),\n  AppPlugin.addSchemaModule({ schema: [Graph.Graph] }),\n  AppPlugin.addSurfaceModule({ activate: ReactSurface }),\n  AppPlugin.addTranslationsModule({ translations }),\n  AppPlugin.addPluginAssetModule({\n    asset: { pluginId: meta.id, path: 'PLUGIN.mdl', content: pluginSpec, mimeType: 'application/x-mdl' },\n  }),\n  Plugin.make,\n);\n\nexport default ExplorerPlugin;\n", "---\nid: org.dxos.plugin.explorer\nname: ExplorerPlugin\nversion: 0.1.0\n---\n\nAn interactive hypergraph visualization plugin for `DXOS` Composer that reveals relationships between objects in a workspace.\nThe plugin renders a live `Graph` object \u2014 backed by a `View` and a `QueryAST` query \u2014 through four switchable layout\nvariants: force-directed, radial cluster, edge bundling, and lattice.\nNode colours are derived from ECHO object types; hovering a node triggers an anchor-card preview.\n\n## Extensions\n\nThe following extension dialects are used in this document.\nEach extension is defined in the Appendix or resolved via its URI.\n\n| Term        | URI                            |\n|-------------|--------------------------------|\n| `type`      | `org.dxos.mdl.type@1.0`       |\n| `feat`      | `org.dxos.mdl.feat@1.0`       |\n| `test`      | `org.dxos.mdl.test@1.0`       |\n| `component` | `org.dxos.mdl.component@1.0`  |\n| `op`        | `org.dxos.mdl.op@1.0`         |\n\n## Types\n\n```mdl\ntype QueryInput\n  fields:\n    raw?: string               # raw query string entered by the user\n    ast: QueryAST.Query        # compiled AST produced by QueryBuilder\n```\n\n```mdl\ntype GraphObject\n  desc: ECHO-persistent object that describes a hypergraph visualisation session.\n  fields:\n    name?: string\n    view: Ref<View>            # schema view that defines visible fields\n    query: QueryInput\n```\n\n```mdl\ntype ExplorerVariant\n  literals: force | cluster | bundle | lattice\n```\n\n## Components\n\n```mdl\ncomponent ExplorerArticle\n  desc: |\n    Top-level article / section surface for a Graph object.\n    Renders one of four SVG layout variants and a toolbar for switching between them.\n  props:\n    role: article | section\n    subject: Ref<View>\n    attendableId?: string\n  state:\n    variant: ExplorerVariant        # active layout; default force\n    filter?: Filter.Any             # compiled from toolbar query input\n    model?: SpaceGraphModel         # live reactive graph built from db + filter\n  slots:\n    toolbar?: ReactNode             # shown only when role === article\n  actions:\n    setVariant(v: ExplorerVariant)\n    setFilter(raw: string)\n  layout: |\n    \u250C\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n    \u2502 [toolbar slot \u2014 article only]  \u2502\n    \u2502  [QueryEditor] [variant tabs]  \u2502\n    \u251C\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n    \u2502                                \u2502\n    \u2502   SVG canvas (force / cluster  \u2502\n    \u2502   / bundle / lattice)          \u2502\n    \u2502                                \u2502\n    \u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n```\n\n```mdl\ncomponent Visualization\n  desc: |\n    Internal component that owns a single persistent SVG.Graph mount.\n    Swaps the active GraphProjector when the variant changes, seeding the\n    new projector with the previous layout so node positions tween smoothly.\n  props:\n    variant: ExplorerVariant\n    model: SpaceGraphModel\n  state:\n    projector?: GraphProjector<SpaceGraphNode>\n  actions:\n    createProjector(variant: ExplorerVariant, prev?: GraphLayout) \u2192 GraphProjector\n    createRenderNode(variant: ExplorerVariant) \u2192 RenderNode\n```\n\n## Operations\n\n```mdl\nop createGraph\n  desc: |\n    Creates a new Graph object scoped to a target space or collection.\n    Derives a ViewModel from the database for the selected typename, then\n    writes the object via SpaceOperation.AddObject.\n  input:\n    name?: string\n    typename?: string            # ECHO typename used to seed the initial view\n    target: Space | Collection\n    targetNodeId?: string\n  output: GraphObject\n  effects: [echo:write]\n  note: |\n    The typename is resolved through ViewModel.makeFromDatabase; the resulting\n    View is stored as a Ref inside the Graph object.\n```\n\n```mdl\nop buildFilter\n  desc: |\n    Compiles a raw query string into a Filter via QueryBuilder.\n    Pure \u2014 no side effects; result is passed to SpaceGraphModel.setFilter.\n  input:\n    raw: string\n  output: Filter.Any\n  errors:\n    ParseError: raw string is not valid query syntax\n```\n\n## Features\n\n```mdl\nfeat F-1: Graph Object\n\n  req F-1.1: A Graph object stores a name, a View ref, and a compiled QueryAST.\n  req F-1.2:\n    when: user creates a new graph\n    then: op:createGraph derives a ViewModel from the chosen typename and writes the Graph to ECHO\n\n  req F-1.3:\n    when: Graph is persisted\n    then: it appears in the space object list and can be opened as an article\n```\n\n```mdl\nfeat F-2: Live Graph Model\n\n  req F-2.1:\n    when: ExplorerArticle mounts with a valid Graph subject\n    then: SpaceGraphModel is opened against the subject's database\n\n  req F-2.2:\n    when: user types a query in the toolbar\n    then: op:buildFilter compiles the raw string; model.setFilter applied; SVG re-renders\n\n  req F-2.3:\n    when: Graph is unmounted\n    then: SpaceGraphModel is closed and all subscriptions released\n\n  req F-2.4:\n    when: an ECHO object in the database changes\n    then: SpaceGraphModel emits an update and SVG.Graph re-renders without full remount\n    tags: [reactive, collaborative]\n```\n\n```mdl\nfeat F-3: Visualization Variants\n\n  req F-3.1:\n    when: variant tab is selected\n    then: Visualization swaps projector; previous node x/y seed the new projector so positions tween\n\n  req F-3.2:\n    when: variant is force\n    then: SVG.Zoom wrapper is mounted enabling pan/zoom drag interaction\n\n  req F-3.3:\n    when: variant is cluster or bundle\n    then: no SVG.Zoom wrapper; leaves grouped by typename; radial labels fade in after tween\n\n  req F-3.4:\n    when: variant is lattice\n    then: nodes rendered as small rounded rectangles sorted by typename then label\n\n  req F-3.5:\n    when: variant is cluster and user clicks a root or group node\n    then: subtree toggles collapsed/expanded via GraphClusterProjector.toggleCollapsed\n```\n\n```mdl\nfeat F-4: Node Interaction\n\n  req F-4.1:\n    when: pointer enters a node\n    then: DxAnchorActivate event dispatched with the object's DXN and label, kind: card\n\n  req F-4.2:\n    when: pointer leaves a node\n    then: DxAnchorActivate cleared (onNodeHover called with null)\n\n  req F-4.3:\n    when: node has no underlying ECHO object (synthetic root / group)\n    then: no preview dispatched; node rendered in neutral colour\n```\n\n## Acceptance\n\n```mdl\ntest T-1: Graph creation\n  given: user opens the object creation dialog and selects Graph\n  when: a typename is selected and the form submitted\n  then:\n    - op:createGraph runs without error\n    - new Graph object visible in space object list\n    - Graph.view references a valid View object\n```\n\n```mdl\ntest T-2: Article mounts model\n  given: a Graph with a populated query\n  when: ExplorerArticle is rendered with role === article\n  then:\n    - SpaceGraphModel is opened\n    - SVG canvas renders nodes derived from the database\n    - toolbar shows QueryEditor and variant tabs\n```\n\n```mdl\ntest T-3: Variant switch preserves positions\n  given: force variant is active with nodes positioned\n  when: user switches to cluster variant\n  then:\n    - projector is recreated from previous layout\n    - nodes tween from old positions to cluster target positions\n    - SVG.Zoom wrapper is absent in the new mount\n```\n\n```mdl\ntest T-4: Query filter updates graph\n  given: ExplorerArticle is open with all objects visible\n  when: user types a typename filter in QueryEditor\n  then:\n    - op:buildFilter returns a Filter without error\n    - SpaceGraphModel.setFilter applied\n    - only matching nodes remain visible in the SVG\n```\n\n```mdl\ntest T-5: Node hover preview\n  given: force-directed graph with at least one ECHO object node\n  when: pointer enters that node\n  then:\n    - DxAnchorActivate event fired with correct DXN\n    - kind === card\n```\n\n```mdl\ntest T-6: Lattice sort order\n  given: database contains objects of two typenames A and B\n  when: lattice variant is active\n  then:\n    - all typename-A nodes appear before typename-B nodes (or vice-versa, consistent order)\n    - within each group nodes are ordered alphabetically by label\n```\n\n```mdl\ntest T-7: Model closed on unmount\n  given: ExplorerArticle is mounted and SpaceGraphModel is open\n  when: component unmounts\n  then:\n    - SpaceGraphModel.close() is called\n    - no lingering ECHO subscriptions remain\n```\n\n---\n\n## Appendix: Extension Definitions\n\nExtension block types used in this document are defined below using\nthe core `ext` primitive \u2014 the only construct the base language provides.\n\n```mdl\next type\n  uri: org.dxos.mdl.type@1.0\n  desc: A named data structure with typed fields and optional literals.\n  fields:\n    desc?: Prose\n    fields?: FieldMap        # name[?]: TypeExpr  (# inline comment)\n    literals?: UnionList     # a | b | c\n    extends?: TypeRef[]\n```\n\n```mdl\next feat\n  uri: org.dxos.mdl.feat@1.0\n  desc: A named feature grouping one or more requirements.\n  fields:\n    desc?: Prose\n    req: RequirementList\n  nesting: self              # feat blocks may contain feat blocks\n```\n\n```mdl\next test\n  uri: org.dxos.mdl.test@1.0\n  desc: An acceptance scenario expressed as given / when / then steps.\n  fields:\n    given?: Step | Step[]\n    when?: Step | Step[]\n    then: Step | Step[]\n    tags?: TagList\n```\n\n```mdl\next component\n  uri: org.dxos.mdl.component@1.0\n  desc: A UI component with props, internal state, slots, actions, and events.\n  fields:\n    desc?: Prose\n    props?: FieldMap            # external inputs (immutable inside component)\n    state?: FieldMap            # internal reactive state\n    slots?: FieldMap            # named ReactNode injection points\n    actions?: ActionMap         # methods the component exposes or handles\n    emits?: EventMap            # events the component raises to its parent\n    layout?: CodeBlock          # ASCII sketch of visual structure (non-normative)\n```\n\n```mdl\next op\n  uri: org.dxos.mdl.op@1.0\n  desc: |\n    A named operation with typed inputs, outputs, and declared errors.\n    Pure ops have no effects or requires. Effectful ops declare both.\n  fields:\n    desc?: Prose\n    input?: FieldMap            # named input parameters\n    output?: TypeExpr           # return type\n    errors?: ErrorMap           # name: Prose  (when this error occurs)\n    effects?: EffectList        # echo:read | echo:write | http | fs | ...\n    requires?: ServiceList      # injected service dependencies\n    note?: Prose                # implementation guidance (non-normative)\n```\n"],
+  "mappings": ";AAIA,SAASA,cAAc;AACvB,SAASC,iBAAiB;AAE1B,SAASC,cAAcC,oBAAoB;AAC3C,SAASC,YAAY;AACrB,SAASC,oBAAoB;AAC7B,SAASC,aAAa;;;ACVtB;;;ADeO,IAAMC,iBAAiBC,OAAOC,OAAOC,IAAAA,EAAMC,KAChDC,UAAUC,sBAAsB;EAAEC,UAAUC;AAAa,CAAA,GACzDH,UAAUI,gBAAgB;EAAEC,QAAQ;IAACC,MAAMA;;AAAO,CAAA,GAClDN,UAAUO,iBAAiB;EAAEL,UAAUM;AAAa,CAAA,GACpDR,UAAUS,sBAAsB;EAAEC;AAAa,CAAA,GAC/CV,UAAUW,qBAAqB;EAC7BC,OAAO;IAAEC,UAAUf,KAAKgB;IAAIC,MAAM;IAAcC,SAASC;IAAYC,UAAU;EAAoB;AACrG,CAAA,GACAtB,OAAOuB,IAAI;AAGb,IAAA,yBAAexB;",
+  "names": ["Plugin", "AppPlugin", "CreateObject", "ReactSurface", "meta", "translations", "Graph", "ExplorerPlugin", "Plugin", "define", "meta", "pipe", "AppPlugin", "addCreateObjectModule", "activate", "CreateObject", "addSchemaModule", "schema", "Graph", "addSurfaceModule", "ReactSurface", "addTranslationsModule", "translations", "addPluginAssetModule", "asset", "pluginId", "id", "path", "content", "pluginSpec", "mimeType", "make"]
+}

package/dist/lib/neutral/chunk-42BYLQQA.mjs

@@ -0,0 +1,42 @@
+// src/meta.ts
+import { Plugin } from "@dxos/app-framework";
+import { DXN } from "@dxos/keys";
+import { trim } from "@dxos/util";
+var meta = Plugin.makeMeta({
+  key: DXN.make("org.dxos.plugin.explorer"),
+  name: "Explorer",
+  author: "DXOS",
+  description: trim`
+    Explorer is an interactive hypergraph visualization plugin that reveals the relationships
+    between objects stored in your DXOS workspace. Each Graph document is backed by a live
+    ECHO query and a View that you configure — Explorer keeps the visualization synchronized
+    with the database in real time so every peer immediately sees changes made by collaborators.
+
+    The plugin offers four switchable layout algorithms for the same data set: a physics-based
+    force-directed graph for freeform exploration, a radial cluster layout that groups objects
+    by type around a central root, an edge-bundling layout that tames visual clutter on dense
+    graphs, and a lattice grid that arranges objects in a sorted matrix sorted by type and label.
+    Switching between layouts smoothly tweens node positions so spatial context is preserved.
+
+    Nodes are coloured by their ECHO object type, and hovering any node opens an anchor-card
+    preview panel with the object's details without leaving the graph view.
+    The toolbar's query editor lets you filter the visible node set on the fly using
+    the same query syntax available across Composer.
+
+    A new Graph document can be created from the object-creation dialog; Explorer automatically
+    derives an initial View from the chosen type and persists both to ECHO so the graph is
+    immediately shareable and replicable across the space.
+  `,
+  icon: "ph--graph--regular",
+  iconHue: "green",
+  source: "https://github.com/dxos/dxos/tree/main/packages/plugins/plugin-explorer",
+  spec: "PLUGIN.mdl",
+  screenshots: [
+    "https://dxos.network/plugin-details-explorer-dark.png"
+  ]
+});
+
+export {
+  meta
+};
+//# sourceMappingURL=chunk-42BYLQQA.mjs.map

package/dist/lib/neutral/chunk-42BYLQQA.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/meta.ts"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Plugin } from '@dxos/app-framework';\nimport { DXN } from '@dxos/keys';\nimport { trim } from '@dxos/util';\n\nexport const meta = Plugin.makeMeta({\n  key: DXN.make('org.dxos.plugin.explorer'),\n  name: 'Explorer',\n  author: 'DXOS',\n  description: trim`\n    Explorer is an interactive hypergraph visualization plugin that reveals the relationships\n    between objects stored in your DXOS workspace. Each Graph document is backed by a live\n    ECHO query and a View that you configure — Explorer keeps the visualization synchronized\n    with the database in real time so every peer immediately sees changes made by collaborators.\n\n    The plugin offers four switchable layout algorithms for the same data set: a physics-based\n    force-directed graph for freeform exploration, a radial cluster layout that groups objects\n    by type around a central root, an edge-bundling layout that tames visual clutter on dense\n    graphs, and a lattice grid that arranges objects in a sorted matrix sorted by type and label.\n    Switching between layouts smoothly tweens node positions so spatial context is preserved.\n\n    Nodes are coloured by their ECHO object type, and hovering any node opens an anchor-card\n    preview panel with the object's details without leaving the graph view.\n    The toolbar's query editor lets you filter the visible node set on the fly using\n    the same query syntax available across Composer.\n\n    A new Graph document can be created from the object-creation dialog; Explorer automatically\n    derives an initial View from the chosen type and persists both to ECHO so the graph is\n    immediately shareable and replicable across the space.\n  `,\n  icon: 'ph--graph--regular',\n  iconHue: 'green',\n  source: 'https://github.com/dxos/dxos/tree/main/packages/plugins/plugin-explorer',\n  spec: 'PLUGIN.mdl',\n  screenshots: ['https://dxos.network/plugin-details-explorer-dark.png'],\n});\n"],
+  "mappings": ";AAIA,SAASA,cAAc;AACvB,SAASC,WAAW;AACpB,SAASC,YAAY;AAEd,IAAMC,OAAOH,OAAOI,SAAS;EAClCC,KAAKJ,IAAIK,KAAK,0BAAA;EACdC,MAAM;EACNC,QAAQ;EACRC,aAAaP;;;;;;;;;;;;;;;;;;;;;EAqBbQ,MAAM;EACNC,SAAS;EACTC,QAAQ;EACRC,MAAM;EACNC,aAAa;IAAC;;AAChB,CAAA;",
+  "names": ["Plugin", "DXN", "trim", "meta", "makeMeta", "key", "make", "name", "author", "description", "icon", "iconHue", "source", "spec", "screenshots"]
+}

package/dist/lib/neutral/chunk-7XUDLV6E.mjs

@@ -0,0 +1,287 @@
+// src/components/Tree/types/types.ts
+var treeTypeToTreeNode = (tree, rootId = tree.root, visited = /* @__PURE__ */ new Set()) => {
+  const node = tree.nodes[rootId];
+  if (!node) {
+    return void 0;
+  }
+  if (visited.has(rootId)) {
+    return {
+      id: rootId,
+      label: labelOf(node),
+      data: node.data
+    };
+  }
+  visited.add(rootId);
+  return {
+    id: rootId,
+    label: labelOf(node),
+    data: node.data,
+    children: node.children.map((childId) => treeTypeToTreeNode(tree, childId, visited)).filter((c) => Boolean(c))
+  };
+};
+var labelOf = (node) => {
+  return typeof node.data?.text === "string" ? node.data.text : void 0;
+};
+
+// src/components/Tree/types/tree.ts
+import * as Schema from "effect/Schema";
+import { DXN, Key, Obj, Ref, Type } from "@dxos/echo";
+import { TestSchema } from "@dxos/echo/testing";
+import { invariant } from "@dxos/invariant";
+var __dxlog_file = "/__w/dxos/dxos/packages/plugins/plugin-explorer/src/components/Tree/types/tree.ts";
+var TreeNodeType = Schema.Struct({
+  id: Key.EntityId,
+  children: Schema.mutable(Schema.Array(Key.EntityId)),
+  data: Schema.mutable(Schema.Record({
+    key: Schema.String,
+    value: Schema.Any
+  })),
+  ref: Schema.optional(Ref.Ref(TestSchema.Expando))
+}).pipe(Schema.mutable);
+var TreeType = Schema.Struct({
+  root: Key.EntityId,
+  nodes: Schema.mutable(Schema.Record({
+    key: Key.EntityId,
+    value: TreeNodeType
+  }))
+}).pipe(Type.makeObject(DXN.make("org.dxos.type.tree", "0.1.0")));
+var Tree = class _Tree {
+  static create = () => {
+    const id = Key.EntityId.random();
+    return Obj.make(TreeType, {
+      root: id,
+      nodes: {
+        [id]: {
+          id,
+          children: [],
+          data: {
+            text: ""
+          }
+        }
+      }
+    });
+  };
+  _tree;
+  constructor(tree) {
+    this._tree = tree ?? _Tree.create();
+  }
+  get tree() {
+    return this._tree;
+  }
+  // TODO(burdon): Make reactive.
+  get size() {
+    return Object.keys(this._tree.nodes).length;
+  }
+  get root() {
+    return this.getNode(this._tree.root);
+  }
+  //
+  // Traversal
+  //
+  /**
+  * Recursively traverse the tree until the callback returns a value.
+  */
+  tranverse(callback, root = this._tree.root, depth = 0) {
+    const node = this._tree.nodes[root];
+    const result = callback(node, depth);
+    if (result !== void 0) {
+      return result;
+    }
+    for (const childId of node.children) {
+      const result2 = this.tranverse(callback, childId, depth + 1);
+      if (result2 !== void 0) {
+        return result2;
+      }
+    }
+  }
+  getNode(id) {
+    const node = this._tree.nodes[id];
+    invariant(node, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 77, S: this, A: ["node", ""] });
+    return node;
+  }
+  /**
+  * Get the children of a node.
+  */
+  getChildNodes(node) {
+    return node.children.map((id) => this.getNode(id));
+  }
+  /**
+  * Get the parent of a node.
+  */
+  getParent(node) {
+    const parent = this.tranverse((n) => {
+      if (n.children.includes(node.id)) {
+        return n;
+      }
+    });
+    return parent ?? null;
+  }
+  /**
+  * Get the next node in the tree.
+  */
+  getNext(node, hierarchical = true) {
+    if (hierarchical && node.children.length) {
+      return this.getChildNodes(node)[0];
+    } else {
+      const parent = this.getParent(node);
+      if (parent) {
+        const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);
+        if (idx < parent.children.length - 1) {
+          return this.getNode(parent.children[idx + 1]);
+        } else {
+          return this.getNext(parent, false);
+        }
+      }
+    }
+  }
+  /**
+  * Get the previous node in the tree.
+  */
+  getPrevious(node, hierarchical = true) {
+    const parent = this.getParent(node);
+    const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);
+    if (idx === 0) {
+      if (hierarchical) {
+        return parent;
+      }
+    } else {
+      const previous = this.getNode(parent.children[idx - 1]);
+      if (hierarchical && previous.children.length) {
+        return this.getLastDescendent(previous);
+      }
+      return previous;
+    }
+  }
+  /**
+  * Get the last descendent of a node.
+  */
+  getLastDescendent(node) {
+    const children = this.getChildNodes(node);
+    const last = children.length ? children[children.length - 1] : void 0;
+    if (last) {
+      return this.getLastDescendent(last);
+    }
+    return node;
+  }
+  //
+  // Mutations
+  //
+  /**
+  * Clear tree.
+  */
+  clear() {
+    const root = this._tree.nodes[this._tree.root];
+    root.children.length = 0;
+    Obj.update(this._tree, (obj) => {
+      obj.nodes = {
+        [root.id]: root
+      };
+    });
+  }
+  /**
+  * Add node.
+  */
+  addNode(parent, node, index) {
+    if (!node) {
+      const id = Key.EntityId.random();
+      node = {
+        id,
+        children: [],
+        data: {
+          text: ""
+        }
+      };
+    }
+    const nodeToAdd = node;
+    Obj.update(this._tree, (obj) => {
+      obj.nodes[nodeToAdd.id] = nodeToAdd;
+      parent.children.splice(index ?? parent.children.length, 0, nodeToAdd.id);
+    });
+    return node;
+  }
+  /**
+  * Delete node.
+  */
+  deleteNode(parent, id) {
+    const node = this._tree.nodes[id];
+    if (!node) {
+      return void 0;
+    }
+    Obj.update(this._tree, (obj) => {
+      delete obj.nodes[node.id];
+    });
+    const idx = parent.children.findIndex((child) => child === id);
+    if (idx !== -1) {
+      Obj.update(this._tree, () => {
+        parent.children.splice(idx, 1);
+      });
+    }
+    return node;
+  }
+  /**
+  * Move child node.
+  */
+  moveNode(node, from, to) {
+    invariant(from >= 0 && from < node.children.length, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 197, S: this, A: ["from >= 0 && from < node.children.length", ""] });
+    invariant(to >= 0 && to < node.children.length, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 198, S: this, A: ["to >= 0 && to < node.children.length", ""] });
+    if (from === to) {
+      return null;
+    }
+    const child = node.children[from];
+    Obj.update(this._tree, () => {
+      node.children.splice(from, 1);
+      node.children.splice(to, 0, child);
+    });
+    return this.getNode(child);
+  }
+  /**
+  * Indent node.
+  */
+  indentNode(node) {
+    const parent = this.getParent(node);
+    if (!parent) {
+      return;
+    }
+    const idx = parent.children.findIndex((child) => child === node.id);
+    if (idx < 1 || idx >= parent.children.length) {
+      return;
+    }
+    const previous = this.getNode(parent.children[idx - 1]);
+    Obj.update(this._tree, () => {
+      parent.children.splice(idx, 1);
+      previous.children.push(node.id);
+    });
+  }
+  /**
+  * Unindent node.
+  */
+  unindentNode(node) {
+    const parent = this.getParent(node);
+    if (!parent) {
+      return;
+    }
+    const ancestor = this.getParent(parent);
+    if (!ancestor) {
+      return;
+    }
+    const nodeIdx = parent.children.findIndex((id) => id === node.id);
+    let rest = [];
+    Obj.update(this._tree, () => {
+      const removed = parent.children.splice(nodeIdx, parent.children.length - nodeIdx);
+      rest = removed.slice(1);
+    });
+    const parentIdx = this.getChildNodes(ancestor).findIndex((n) => n.id === parent.id);
+    Obj.update(this._tree, () => {
+      ancestor.children.splice(parentIdx + 1, 0, node.id);
+    });
+    Obj.update(this._tree, () => {
+      node.children.push(...rest);
+    });
+  }
+};
+
+export {
+  Tree,
+  treeTypeToTreeNode
+};
+//# sourceMappingURL=chunk-7XUDLV6E.mjs.map

package/dist/lib/neutral/chunk-7XUDLV6E.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/components/Tree/types/types.ts", "../../../src/components/Tree/types/tree.ts"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Key } from '@dxos/echo';\n\nimport { type TreeType } from './tree';\n\n/**\n * In-memory tree shape used by the d3 layouts.\n * `data` carries through to layout callbacks (e.g. hover/inspect) — typically an ECHO object on leaves.\n */\nexport type TreeNode<TData = unknown> = {\n  id: string;\n  label?: string;\n  data?: TData;\n  children?: TreeNode<TData>[];\n};\n\n/**\n * Convert an ECHO `TreeType` (id-keyed node map) into a nested `TreeNode` hierarchy.\n * Returns `undefined` if the root id is missing — the tree is then incomplete and shouldn't render.\n */\nexport const treeTypeToTreeNode = (\n  tree: TreeType,\n  rootId: Key.EntityId = tree.root,\n  visited: Set<string> = new Set(),\n): TreeNode | undefined => {\n  const node = tree.nodes[rootId];\n  if (!node) {\n    return undefined;\n  }\n  if (visited.has(rootId)) {\n    return { id: rootId, label: labelOf(node), data: node.data };\n  }\n  visited.add(rootId);\n\n  return {\n    id: rootId,\n    label: labelOf(node),\n    data: node.data,\n    children: node.children\n      .map((childId) => treeTypeToTreeNode(tree, childId, visited))\n      .filter((c): c is TreeNode => Boolean(c)),\n  };\n};\n\nconst labelOf = (node: { data: Record<string, any> }): string | undefined => {\n  return typeof node.data?.text === 'string' ? node.data.text : undefined;\n};\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport * as Schema from 'effect/Schema';\n\nimport { DXN, Key, Obj, Ref, Type } from '@dxos/echo';\nimport { TestSchema } from '@dxos/echo/testing';\nimport { invariant } from '@dxos/invariant';\n\n// TODO(burdon): Reconcile with @dxos/graph (i.e., common types).\n\nexport const TreeNodeType = Schema.Struct({\n  id: Key.EntityId,\n  children: Schema.mutable(Schema.Array(Key.EntityId)),\n  data: Schema.mutable(Schema.Record({ key: Schema.String, value: Schema.Any })),\n  ref: Schema.optional(Ref.Ref(TestSchema.Expando)),\n}).pipe(Schema.mutable);\n\nexport type TreeNodeType = Schema.Schema.Type<typeof TreeNodeType>;\n\nexport const TreeType = Schema.Struct({\n  root: Key.EntityId,\n  nodes: Schema.mutable(Schema.Record({ key: Key.EntityId, value: TreeNodeType })),\n}).pipe(Type.makeObject(DXN.make('org.dxos.type.tree', '0.1.0')));\n\nexport type TreeType = Type.InstanceType<typeof TreeType>;\n\n/**\n * Wrapper object for tree.\n */\nexport class Tree {\n  static create = (): TreeType => {\n    const id = Key.EntityId.random();\n    return Obj.make(TreeType, {\n      root: id,\n      nodes: {\n        [id]: {\n          id,\n          children: [],\n          data: { text: '' }, // TODO(burdon): Generic.\n        },\n      },\n    });\n  };\n\n  private _tree: TreeType;\n\n  constructor(tree?: TreeType) {\n    this._tree = tree ?? Tree.create();\n  }\n\n  get tree() {\n    return this._tree;\n  }\n\n  // TODO(burdon): Make reactive.\n  get size() {\n    return Object.keys(this._tree.nodes).length;\n  }\n\n  get root() {\n    return this.getNode(this._tree.root);\n  }\n\n  //\n  // Traversal\n  //\n\n  /**\n   * Recursively traverse the tree until the callback returns a value.\n   */\n  tranverse<T>(\n    callback: (node: TreeNodeType, depth: number) => T | void,\n    root: Key.EntityId = this._tree.root,\n    depth = 0,\n  ): T | void {\n    const node = this._tree.nodes[root];\n    const result = callback(node, depth);\n    if (result !== undefined) {\n      return result;\n    }\n\n    for (const childId of node.children) {\n      const result = this.tranverse(callback, childId, depth + 1);\n      if (result !== undefined) {\n        return result;\n      }\n    }\n  }\n\n  getNode(id: Key.EntityId): TreeNodeType {\n    const node = this._tree.nodes[id];\n    invariant(node);\n    return node;\n  }\n\n  /**\n   * Get the children of a node.\n   */\n  getChildNodes(node: TreeNodeType): Array<TreeNodeType> {\n    return node.children.map((id) => this.getNode(id));\n  }\n\n  /**\n   * Get the parent of a node.\n   */\n  getParent(node: TreeNodeType): TreeNodeType | null {\n    const parent = this.tranverse((n) => {\n      if (n.children.includes(node.id)) {\n        return n;\n      }\n    });\n\n    return parent ?? null;\n  }\n\n  /**\n   * Get the next node in the tree.\n   */\n  getNext(node: TreeNodeType, hierarchical = true): TreeNodeType | undefined {\n    if (hierarchical && node.children.length) {\n      // First child.\n      return this.getChildNodes(node)[0];\n    } else {\n      const parent = this.getParent(node);\n      if (parent) {\n        const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);\n        if (idx < parent.children.length - 1) {\n          // Next sibling.\n          return this.getNode(parent.children[idx + 1]);\n        } else {\n          // Get parent's next sibling.\n          return this.getNext(parent, false);\n        }\n      }\n    }\n  }\n\n  /**\n   * Get the previous node in the tree.\n   */\n  getPrevious(node: TreeNodeType, hierarchical = true): TreeNodeType | undefined {\n    const parent = this.getParent(node)!;\n    const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);\n    if (idx === 0) {\n      if (hierarchical) {\n        return parent;\n      }\n    } else {\n      const previous = this.getNode(parent.children[idx - 1]);\n      if (hierarchical && previous.children.length) {\n        return this.getLastDescendent(previous);\n      }\n\n      return previous;\n    }\n  }\n\n  /**\n   * Get the last descendent of a node.\n   */\n  getLastDescendent(node: TreeNodeType): TreeNodeType | undefined {\n    const children = this.getChildNodes(node);\n    const last = children.length ? children[children.length - 1] : undefined;\n    if (last) {\n      return this.getLastDescendent(last);\n    }\n\n    return node;\n  }\n\n  //\n  // Mutations\n  //\n\n  /**\n   * Clear tree.\n   */\n  clear(): void {\n    const root = this._tree.nodes[this._tree.root];\n    root.children.length = 0;\n    Obj.update(this._tree, (obj) => {\n      obj.nodes = {\n        [root.id]: root,\n      };\n    });\n  }\n\n  /**\n   * Add node.\n   */\n  addNode(parent: TreeNodeType, node?: TreeNodeType, index?: number): TreeNodeType {\n    if (!node) {\n      const id = Key.EntityId.random();\n      node = { id, children: [], data: { text: '' } }; // TODO(burdon): Generic.\n    }\n\n    const nodeToAdd = node;\n    Obj.update(this._tree, (obj) => {\n      obj.nodes[nodeToAdd.id] = nodeToAdd;\n      parent.children.splice(index ?? parent.children.length, 0, nodeToAdd.id);\n    });\n    return node;\n  }\n\n  /**\n   * Delete node.\n   */\n  deleteNode(parent: TreeNodeType, id: Key.EntityId): TreeNodeType | undefined {\n    const node = this._tree.nodes[id];\n    if (!node) {\n      return undefined;\n    }\n\n    Obj.update(this._tree, (obj) => {\n      delete obj.nodes[node.id];\n    });\n    const idx = parent.children.findIndex((child) => child === id);\n    if (idx !== -1) {\n      Obj.update(this._tree, () => {\n        parent.children.splice(idx, 1);\n      });\n    }\n\n    return node;\n  }\n\n  /**\n   * Move child node.\n   */\n  moveNode(node: TreeNodeType, from: number, to: number): TreeNodeType | null {\n    invariant(from >= 0 && from < node.children.length);\n    invariant(to >= 0 && to < node.children.length);\n    if (from === to) {\n      return null;\n    }\n\n    const child = node.children[from];\n    Obj.update(this._tree, () => {\n      node.children.splice(from, 1);\n      node.children.splice(to, 0, child);\n    });\n    return this.getNode(child);\n  }\n\n  /**\n   * Indent node.\n   */\n  indentNode(node: TreeNodeType): void {\n    const parent = this.getParent(node);\n    if (!parent) {\n      return;\n    }\n\n    const idx = parent.children.findIndex((child) => child === node.id);\n    if (idx < 1 || idx >= parent.children.length) {\n      return;\n    }\n\n    const previous = this.getNode(parent.children[idx - 1]);\n    Obj.update(this._tree, () => {\n      parent.children.splice(idx, 1);\n      previous.children.push(node.id);\n    });\n  }\n\n  /**\n   * Unindent node.\n   */\n  unindentNode(node: TreeNodeType): void {\n    const parent = this.getParent(node);\n    if (!parent) {\n      return;\n    }\n\n    const ancestor = this.getParent(parent);\n    if (!ancestor) {\n      return;\n    }\n\n    // Remove node from parent and get following siblings.\n    const nodeIdx = parent.children.findIndex((id) => id === node.id);\n    let rest: Key.EntityId[] = [];\n    Obj.update(this._tree, () => {\n      const removed = parent.children.splice(nodeIdx, parent.children.length - nodeIdx);\n      rest = removed.slice(1); // Skip the node itself.\n    });\n\n    // Add to ancestor.\n    const parentIdx = this.getChildNodes(ancestor).findIndex((n) => n.id === parent.id);\n    Obj.update(this._tree, () => {\n      ancestor.children.splice(parentIdx + 1, 0, node.id);\n    });\n\n    // Transplant following siblings to current node.\n    Obj.update(this._tree, () => {\n      node.children.push(...rest);\n    });\n  }\n}\n"],
+  "mappings": ";AAuBO,IAAMA,qBAAqB,CAChCC,MACAC,SAAuBD,KAAKE,MAC5BC,UAAuB,oBAAIC,IAAAA,MAAK;AAEhC,QAAMC,OAAOL,KAAKM,MAAML,MAAAA;AACxB,MAAI,CAACI,MAAM;AACT,WAAOE;EACT;AACA,MAAIJ,QAAQK,IAAIP,MAAAA,GAAS;AACvB,WAAO;MAAEQ,IAAIR;MAAQS,OAAOC,QAAQN,IAAAA;MAAOO,MAAMP,KAAKO;IAAK;EAC7D;AACAT,UAAQU,IAAIZ,MAAAA;AAEZ,SAAO;IACLQ,IAAIR;IACJS,OAAOC,QAAQN,IAAAA;IACfO,MAAMP,KAAKO;IACXE,UAAUT,KAAKS,SACZC,IAAI,CAACC,YAAYjB,mBAAmBC,MAAMgB,SAASb,OAAAA,CAAAA,EACnDc,OAAO,CAACC,MAAqBC,QAAQD,CAAAA,CAAAA;EAC1C;AACF;AAEA,IAAMP,UAAU,CAACN,SAAAA;AACf,SAAO,OAAOA,KAAKO,MAAMQ,SAAS,WAAWf,KAAKO,KAAKQ,OAAOb;AAChE;;;AC7CA,YAAYc,YAAY;AAExB,SAASC,KAAKC,KAAKC,KAAKC,KAAKC,YAAY;AACzC,SAASC,kBAAkB;AAC3B,SAASC,iBAAiB;AAE1B,IAAA,eAAA;AAIEC,IAAAA,eAAyBR,cAAaE;EACtCO,IAAAA,IAAMT;YAA2CU,eAAM,aAAA,IAAA,QAAA,CAAA;QAASV,eAAU,cAAA;IAAC,KAAA;IAC3EW,OAAYC;EACXC,CAAAA,CAAAA;EAIH,KAAaC,gBAAWd,IAAAA,IAAOe,WAAO,OAAA,CAAA;QAC1BC,cAAQ;AAClBC,IAAOjB,WAAeA,cAAOkB;QAASC,IAAKjB;SAAqBkB,eAAAA,cAAAA;IAAa,KAAA,IAAA;IACvEf,OAAKgB;EAIb,CAAA,CAAA;;AAKI,IAAMC,OAAN,MAAMA,MAAKpB;SACX,SAAWqB,MAAKT;UACdU,KAAMF,IAAAA,SAAAA,OAAAA;WACNL,IAAO,KAAA,UAAA;YACJK;;cAECd;UACAC;oBAAc,CAAA;UAAG,MAAA;YACnB,MAAA;UACF;QACF;MACA;IAEMgB,CAAAA;EAER;;EAEA,YAAA,MAAA;AAEIC,SAAAA,QAAO,QAAA,MAAA,OAAA;;EAEX,IAAA,OAAA;AAEA,WAAA,KAAA;EACA;;EAEA,IAAA,OAAA;AAEIF,WAAO,OAAA,KAAA,KAAA,MAAA,KAAA,EAAA;;EAEX,IAAA,OAAA;AAEE,WAAA,KAAA,QAAA,KAAA,MAAA,IAAA;EACF;;;;;;;YAYQG,UAASC,OAASC,KAAMC,MAAAA,MAAAA,QAAAA,GAAAA;AAC9B,UAAIH,OAAAA,KAAWI,MAAAA,MAAW,IAAA;UACxB,SAAOJ,SAAAA,MAAAA,KAAAA;AACT,QAAA,WAAA,QAAA;AAEA,aAAWK;;eAELL,WAAWI,KAAAA,UAAW;YACxBJ,UAAOA,KAAAA,UAAAA,UAAAA,SAAAA,QAAAA,CAAAA;AACT,UAAAA,YAAA,QAAA;AACF,eAAAA;MACF;IAEAM;;UAEE1B,IAAAA;AACA,UAAA,OAAOsB,KAAAA,MAAAA,MAAAA,EAAAA;AACT,cAAA,MAAA,QAAA,EAAA,YAAA,YAAA,GAAA,cAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,QAAA,EAAA,EAAA,CAAA;AAEA,WAAA;;;;;EAKA,cAAA,MAAA;AAEA,WAAA,KAAA,SAAA,IAAA,CAAA,OAAA,KAAA,QAAA,EAAA,CAAA;;;;;YAKQK,MAAE1B;mBACG0B,KAAAA,UAAAA,CAAAA,MAAAA;AACT,UAAA,EAAA,SAAA,SAAA,KAAA,EAAA,GAAA;AACF,eAAA;MAEA;IACF,CAAA;AAEA,WAAA,UAAA;;;;;UAKI,MAAA,eAAe,MAAA;QACf,gBAAYC,KAAAA,SAAcN,QAAQ;AAElC,aAAMO,KAAAA,cAAcC,IAAUR,EAAAA,CAAAA;WAC9B;YACE,SAAMS,KAAU,UAACH,IAAa;UAC9B,QAAIG;cACF,MAAA,KAAA,cAAgB,MAAA,EAAA,UAAA,CAAA,EAAA,GAAA,MAAA,OAAA,KAAA,EAAA;YAChB,MAAA,OAAYL,SAAQG,SAAO5B,GAAAA;AAE3B,iBAAA,KAAA,QAAA,OAAA,SAA6B,MAAA,CAAA,CAAA;eAC7B;AAEJ,iBAAA,KAAA,QAAA,QAAA,KAAA;QACF;MACF;IAEA;;;;;cAKQ8B,MAAU,eAAeF,MAAAA;AAC/B,UAAIE,SAAW,KAAA,UAAA,IAAA;UACb,MAAIC,KAAAA,cAAc,MAAA,EAAA,UAAA,CAAA,EAAA,GAAA,MAAA,OAAA,KAAA,EAAA;gBAChB,GAAOH;AACT,UAAA,cAAA;AACK,eAAA;MACL;WACA;YACE,WAAYI,KAAAA,QAAAA,OAAkBC,SAAAA,MAAAA,CAAAA,CAAAA;AAChC,UAAA,gBAAA,SAAA,SAAA,QAAA;AAEA,eAAOA,KAAAA,kBAAAA,QAAAA;MACT;AACF,aAAA;IAEA;;;;;oBAKejC,MAASkC;AACtB,UAAIC,WAAM,KAAA,cAAA,IAAA;UACR,OAAO,SAAKH,SAAAA,SAAkBG,SAAAA,SAAAA,CAAAA,IAAAA;AAChC,QAAA,MAAA;AAEA,aAAOd,KAAAA,kBAAAA,IAAAA;IACT;AAEE,WAAA;EACF;;;;;;;UAQOrB;AACLL,UAAIyC,OAAO,KAAKnB,MAAQoB,MAAAA,KAAAA,MAAAA,IAAAA;SACtBA,SAAS,SAAG;eACTrB,KAAO,OAAGA,CAAAA,QAAAA;AACb,UAAA,QAAA;QACF,CAAA,KAAA,EAAA,GAAA;MACF;IAEA,CAAA;;;;;UAKI,QAAMF,MAASN,OAAQ;QACvBa,CAAAA,MAAO;YAAEP,KAAAA,IAAAA,SAAAA,OAAAA;aAAId;QAAcC;kBAAc,CAAA;QAAG,MAAA;UAAK,MAAA;QACnD;MAEA;IACAN;UACE0C,YAAUC;QACVV,OAAO5B,KAAAA,OAASuC,CAAAA,QAAOC;AACzB,UAAA,MAAA,UAAA,EAAA,IAAA;AACA,aAAOnB,SAAAA,OAAAA,SAAAA,OAAAA,SAAAA,QAAAA,GAAAA,UAAAA,EAAAA;IACT,CAAA;AAEA,WAAA;;;;;aAKOA,QAAM,IAAA;UACT,OAAOE,KAAAA,MAAAA,MAAAA,EAAAA;AACT,QAAA,CAAA,MAAA;AAEIa,aAAO;;AAEX,QAAA,OAAA,KAAA,OAAA,CAAA,QAAA;AACA,aAAMN,IAAMF,MAAO5B,KAAAA,EAASyC;IAC5B,CAAA;UACE9C,MAAIyC,OAAW,SAAQ,UAAA,CAAA,UAAA,UAAA,EAAA;gBACrBR,IAAO5B;AACT,UAAA,OAAA,KAAA,OAAA,MAAA;AACF,eAAA,SAAA,OAAA,KAAA,CAAA;MAEA,CAAA;IACF;AAEA,WAAA;;;;;WAKED,MAAU2C,MAAM,IAAKA;AACrB,cAAIC,QAAa,KAAA,OAAA,KAAA,SAAA,QAAA,QAAA,EAAA,YAAA,YAAA,GAAA,cAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,4CAAA,EAAA,EAAA,CAAA;cACf,MAAO,KAAA,KAAA,KAAA,SAAA,QAAA,QAAA,EAAA,YAAA,YAAA,GAAA,cAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,wCAAA,EAAA,EAAA,CAAA;AACT,QAAA,SAAA,IAAA;AAEA,aAAMC;IACNjD;UACE0B,QAAKrB,KAASuC,SAAOI,IAAM;QAC3BtB,OAAKrB,KAAAA,OAASuC,MAAOG;AACvB,WAAA,SAAA,OAAA,MAAA,CAAA;AACA,WAAO,SAAKjB,OAAQmB,IAAAA,GAAAA,KAAAA;IACtB,CAAA;AAEA,WAAA,KAAA,QAAA,KAAA;;;;;aAKOhB,MAAQ;UACX,SAAA,KAAA,UAAA,IAAA;AACF,QAAA,CAAA,QAAA;AAEA;IACA;UACE,MAAA,OAAA,SAAA,UAAA,CAAA,UAAA,UAAA,KAAA,EAAA;AACF,QAAA,MAAA,KAAA,OAAA,OAAA,SAAA,QAAA;AAEA;IACAjC;UACEiC,WAAO5B,KAASuC,QAAOT,OAAK,SAAA,MAAA,CAAA,CAAA;QAC5BG,OAAAA,KAASjC,OAAS6C,MAAKxB;AACzB,aAAA,SAAA,OAAA,KAAA,CAAA;AACF,eAAA,SAAA,KAAA,KAAA,EAAA;IAEA,CAAA;;;;;eAKOO,MAAQ;UACX,SAAA,KAAA,UAAA,IAAA;AACF,QAAA,CAAA,QAAA;AAEA;IACA;UACE,WAAA,KAAA,UAAA,MAAA;AACF,QAAA,CAAA,UAAA;AAEA;IACA;AAEAjC,UAAIyC,UAAYnB,OAAO,SAAA,UAAA,CAAA,OAAA,OAAA,KAAA,EAAA;QACrB,OAAM6B,CAAAA;QACNC,OAAOD,KAAAA,OAAQE,MAAM;AACvB,YAAA,UAAA,OAAA,SAAA,OAAA,SAAA,OAAA,SAAA,SAAA,OAAA;AAEA,aAAA,QAAmB,MAAA,CAAA;IACnB,CAAA;UAEEC,YAASjD,KAASuC,cAAOW,QAAe,EAAG7B,UAAO,CAAA,MAAA,EAAA,OAAA,OAAA,EAAA;AACpD,QAAA,OAAA,KAAA,OAAA,MAAA;AAEA,eAAA,SAAA,OAAA,YAAA,GAAA,GAAA,KAAiD,EAAA;IACjD1B,CAAAA;AAEA,QAAA,OAAA,KAAA,OAAA,MAAA;AACF,WAAA,SAAA,KAAA,GAAA,IAAA;IACF,CAAA;;;",
+  "names": ["treeTypeToTreeNode", "tree", "rootId", "root", "visited", "Set", "node", "nodes", "undefined", "has", "id", "label", "labelOf", "data", "add", "children", "map", "childId", "filter", "c", "Boolean", "text", "Schema", "DXN", "Key", "Obj", "Ref", "Type", "TestSchema", "invariant", "children", "data", "String", "ref", "optional", "pipe", "TreeType", "Struct", "EntityId", "nodes", "Record", "key", "TreeNodeType", "makeObject", "id", "make", "root", "_tree", "tree", "result", "callback", "node", "depth", "undefined", "childId", "getNode", "n", "getChildNodes", "parent", "getParent", "idx", "hierarchical", "getLastDescendent", "previous", "length", "last", "update", "obj", "nodeToAdd", "splice", "index", "findIndex", "to", "from", "child", "push", "removed", "rest", "slice", "ancestor", "parentIdx"]
+}

package/dist/lib/neutral/chunk-HI324IB4.mjs

@@ -0,0 +1,69 @@
+import {
+  __export
+} from "./chunk-J5LGTIGS.mjs";
+
+// src/types/ExplorerAction.ts
+var ExplorerAction_exports = {};
+__export(ExplorerAction_exports, {
+  GraphProps: () => GraphProps
+});
+import * as Schema from "effect/Schema";
+import { TypeInputOptionsAnnotation } from "@dxos/plugin-space";
+var GraphProps = Schema.Struct({
+  name: Schema.optional(Schema.String),
+  // TODO(wittjosiah): This should be a query input instead.
+  typename: Schema.String.pipe(Schema.annotations({
+    title: "Select type"
+  }), TypeInputOptionsAnnotation.set({
+    location: [
+      "database",
+      "runtime"
+    ],
+    kind: [
+      "user"
+    ]
+  }), Schema.optional)
+});
+
+// src/types/Graph.ts
+var Graph_exports = {};
+__export(Graph_exports, {
+  Graph: () => Graph,
+  make: () => make
+});
+import * as Schema2 from "effect/Schema";
+import { DXN, Annotation, Filter, Obj, Query, QueryAST, Ref, Type, View } from "@dxos/echo";
+import { FormInputAnnotation, LabelAnnotation } from "@dxos/echo/internal";
+import { ViewAnnotation } from "@dxos/schema";
+var GraphSchema = Schema2.Struct({
+  name: Schema2.optional(Schema2.String),
+  view: Ref.Ref(View.View).pipe(FormInputAnnotation.set(false)),
+  query: Schema2.Struct({
+    raw: Schema2.optional(Schema2.String),
+    ast: QueryAST.Query
+  }).pipe(FormInputAnnotation.set(false))
+}).pipe(LabelAnnotation.set([
+  "name"
+]), ViewAnnotation.set([
+  "view"
+]), Annotation.IconAnnotation.set({
+  icon: "ph--graph--regular",
+  hue: "green"
+}), Type.makeObject(DXN.make("org.dxos.type.graph", "0.1.0")));
+var Graph = GraphSchema;
+var make = ({ name, query = {
+  raw: "",
+  ast: Query.select(Filter.nothing()).ast
+}, view }) => {
+  return Obj.make(Graph, {
+    name,
+    view: Ref.make(view),
+    query
+  });
+};
+
+export {
+  ExplorerAction_exports,
+  Graph_exports
+};
+//# sourceMappingURL=chunk-HI324IB4.mjs.map

package/dist/lib/neutral/chunk-HI324IB4.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/types/ExplorerAction.ts", "../../../src/types/Graph.ts"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport * as Schema from 'effect/Schema';\n\nimport { TypeInputOptionsAnnotation } from '@dxos/plugin-space';\n\nexport const GraphProps = Schema.Struct({\n  name: Schema.optional(Schema.String),\n  // TODO(wittjosiah): This should be a query input instead.\n  typename: Schema.String.pipe(\n    Schema.annotations({ title: 'Select type' }),\n    TypeInputOptionsAnnotation.set({\n      location: ['database', 'runtime'],\n      kind: ['user'],\n    }),\n    Schema.optional,\n  ),\n});\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport * as Schema from 'effect/Schema';\n\nimport { DXN, Annotation, Filter, Obj, Query, QueryAST, Ref, Type, View } from '@dxos/echo';\nimport { FormInputAnnotation, LabelAnnotation } from '@dxos/echo/internal';\nimport { ViewAnnotation } from '@dxos/schema';\n\nconst GraphSchema = Schema.Struct({\n  name: Schema.optional(Schema.String),\n  view: Ref.Ref(View.View).pipe(FormInputAnnotation.set(false)),\n  query: Schema.Struct({\n    raw: Schema.optional(Schema.String),\n    ast: QueryAST.Query,\n  }).pipe(FormInputAnnotation.set(false)),\n}).pipe(\n  LabelAnnotation.set(['name']),\n  ViewAnnotation.set(['view']),\n  Annotation.IconAnnotation.set({ icon: 'ph--graph--regular', hue: 'green' }),\n  Type.makeObject(DXN.make('org.dxos.type.graph', '0.1.0')),\n);\n// TODO(wittjosiah): Try to clean up this type inference.\nexport interface Graph extends Type.InstanceType<typeof GraphSchema> {}\nexport const Graph: Type.Obj<Graph> = GraphSchema as any;\n\ntype MakeProps = Omit<Partial<Obj.MakeProps<typeof Graph>>, 'view'> & {\n  view: View.View;\n};\n\n/**\n * Make a graph as a view of a data set.\n */\nexport const make = ({\n  name,\n  query = { raw: '', ast: Query.select(Filter.nothing()).ast },\n  view,\n}: MakeProps): Graph => {\n  return Obj.make(Graph, { name, view: Ref.make(view), query });\n};\n"],
+  "mappings": ";;;;;AAAA;;;;AAIA,YAAYA,YAAY;AAExB,SAASC,kCAAkC;AAEpC,IAAMC,aAAoBC,cAAO;EACtCC,MAAaC,gBAAgBC,aAAM;;EAEnCC,UAAiBD,cAAOE,KACfC,mBAAY;IAAEC,OAAO;EAAc,CAAA,GAC1CT,2BAA2BU,IAAI;IAC7BC,UAAU;MAAC;MAAY;;IACvBC,MAAM;MAAC;;EACT,CAAA,GACOR,eAAQ;AAEnB,CAAA;;;ACnBA;;;;;AAIA,YAAYS,aAAY;AAExB,SAASC,KAAKC,YAAYC,QAAQC,KAAKC,OAAOC,UAAUC,KAAKC,MAAMC,YAAY;AAC/E,SAASC,qBAAqBC,uBAAuB;AACrD,SAASC,sBAAsB;AAE/B,IAAMC,cAAqBC,eAAO;EAChCC,MAAaC,iBAAgBC,cAAM;EACnCC,MAAMX,IAAIA,IAAIE,KAAKA,IAAI,EAAEU,KAAKT,oBAAoBU,IAAI,KAAA,CAAA;EACtDC,OAAcP,eAAO;IACnBQ,KAAYN,iBAAgBC,cAAM;IAClCM,KAAKjB,SAASD;EAChB,CAAA,EAAGc,KAAKT,oBAAoBU,IAAI,KAAA,CAAA;AAClC,CAAA,EAAGD,KACDR,gBAAgBS,IAAI;EAAC;CAAO,GAC5BR,eAAeQ,IAAI;EAAC;CAAO,GAC3BlB,WAAWsB,eAAeJ,IAAI;EAAEK,MAAM;EAAsBC,KAAK;AAAQ,CAAA,GACzElB,KAAKmB,WAAW1B,IAAI2B,KAAK,uBAAuB,OAAA,CAAA,CAAA;AAI3C,IAAMC,QAAyBhB;AAS/B,IAAMe,OAAO,CAAC,EACnBb,MACAM,QAAQ;EAAEC,KAAK;EAAIC,KAAKlB,MAAMyB,OAAO3B,OAAO4B,QAAO,CAAA,EAAIR;AAAI,GAC3DL,KAAI,MACM;AACV,SAAOd,IAAIwB,KAAKC,OAAO;IAAEd;IAAMG,MAAMX,IAAIqB,KAAKV,IAAAA;IAAOG;EAAM,CAAA;AAC7D;",
+  "names": ["Schema", "TypeInputOptionsAnnotation", "GraphProps", "Struct", "name", "optional", "String", "typename", "pipe", "annotations", "title", "set", "location", "kind", "Schema", "DXN", "Annotation", "Filter", "Obj", "Query", "QueryAST", "Ref", "Type", "View", "FormInputAnnotation", "LabelAnnotation", "ViewAnnotation", "GraphSchema", "Struct", "name", "optional", "String", "view", "pipe", "set", "query", "raw", "ast", "IconAnnotation", "icon", "hue", "makeObject", "make", "Graph", "select", "nothing"]
+}

package/dist/lib/neutral/chunk-IKHJV3Q4.mjs

@@ -0,0 +1,20 @@
+// src/util/node-color.ts
+import { Obj } from "@dxos/echo";
+import { getHashHue } from "@dxos/ui-theme";
+var getNodeFillForTypename = (typename) => {
+  return `var(--color-${getHashHue(typename)}-400)`;
+};
+var getNodeFillForObject = (object) => {
+  return getNodeFillForTypename(object && Obj.getTypename(object));
+};
+
+// src/util/plot.ts
+var createAdapter = (prop, accessor) => accessor ? {
+  transform: (values) => values.map((value) => accessor(value)[prop])
+} : prop;
+
+export {
+  getNodeFillForObject,
+  createAdapter
+};
+//# sourceMappingURL=chunk-IKHJV3Q4.mjs.map

package/dist/lib/neutral/chunk-IKHJV3Q4.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/util/node-color.ts", "../../../src/util/plot.ts"],
+  "sourcesContent": ["//\n// Copyright 2026 DXOS.org\n//\n\nimport { Obj } from '@dxos/echo';\nimport { getHashHue } from '@dxos/ui-theme';\n\n/**\n * Returns the SVG `fill` value for a node, derived from its typename via the\n * same hue-hash used by the force-directed renderer. Resolves to a Tailwind\n * color token CSS variable so the value reads consistently across themes.\n *\n * Used by every variant of `ExplorerArticle` so nodes are colored consistently\n * regardless of which layout is rendering them.\n */\nexport const getNodeFillForTypename = (typename: string | undefined): string => {\n  return `var(--color-${getHashHue(typename)}-400)`;\n};\n\n/** Convenience: derive the fill from an ECHO object's typename. */\nexport const getNodeFillForObject = (object: Obj.Unknown | undefined): string => {\n  return getNodeFillForTypename(object && Obj.getTypename(object));\n};\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport type { ChannelValueSpec } from '@observablehq/plot';\n\nexport type Accessor<T> = (object: any) => T;\n\nexport type Point = {\n  x: number;\n  y: number;\n};\n\nexport type GeoLocation = {\n  lat: number;\n  lng: number;\n};\n\nexport const createAdapter = <T extends Record<string, any>>(\n  prop: string,\n  accessor: Accessor<T> | undefined,\n): ChannelValueSpec =>\n  accessor\n    ? {\n        transform: (values) => values.map((value) => accessor(value)[prop]),\n      }\n    : prop;\n"],
+  "mappings": ";AAIA,SAASA,WAAW;AACpB,SAASC,kBAAkB;AAUpB,IAAMC,yBAAyB,CAACC,aAAAA;AACrC,SAAO,eAAeF,WAAWE,QAAAA,CAAAA;AACnC;AAGO,IAAMC,uBAAuB,CAACC,WAAAA;AACnC,SAAOH,uBAAuBG,UAAUL,IAAIM,YAAYD,MAAAA,CAAAA;AAC1D;;;ACJO,IAAME,gBAAgB,CAC3BC,MACAC,aAEAA,WACI;EACEC,WAAW,CAACC,WAAWA,OAAOC,IAAI,CAACC,UAAUJ,SAASI,KAAAA,EAAOL,IAAAA,CAAK;AACpE,IACAA;",
+  "names": ["Obj", "getHashHue", "getNodeFillForTypename", "typename", "getNodeFillForObject", "object", "getTypename", "createAdapter", "prop", "accessor", "transform", "values", "map", "value"]
+}

package/dist/lib/neutral/chunk-J5LGTIGS.mjs

@@ -0,0 +1,10 @@
+var __defProp = Object.defineProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+
+export {
+  __export
+};
+//# sourceMappingURL=chunk-J5LGTIGS.mjs.map