@dxos/plugin-explorer 0.10.0 → 0.11.1

package/dist/lib/containers.mjs

@@ -0,0 +1,8 @@
+import { lazy } from "react";
+//#region src/containers/index.ts
+var ExplorerArticle = lazy(() => import("./chunk-ExplorerArticle.mjs"));
+var NeighborhoodCompanion = lazy(() => import("./chunk-NeighborhoodCompanion.mjs"));
+//#endregion
+export { ExplorerArticle, NeighborhoodCompanion };
+
+//# sourceMappingURL=containers.mjs.map

package/dist/lib/containers.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"containers.mjs","names":[],"sources":["../../src/containers/index.ts"],"sourcesContent":["//\n// Copyright 2023 DXOS.org\n//\n\nimport { type ComponentType, lazy } from 'react';\n\nexport const ExplorerArticle: ComponentType<any> = lazy(() => import('./ExplorerArticle'));\nexport const NeighborhoodCompanion: ComponentType<any> = lazy(() => import('./NeighborhoodCompanion'));\n"],"mappings":";;AAMA,IAAa,kBAAsC,WAAW,OAAO,8BAAoB;AACzF,IAAa,wBAA4C,WAAW,OAAO,oCAA0B"}

package/dist/lib/hooks.mjs

@@ -0,0 +1,101 @@
+import { Capabilities } from "@dxos/app-framework";
+import { Obj } from "@dxos/echo";
+import { SpaceGraphModel } from "@dxos/schema";
+import { useEffect, useState } from "react";
+import { useCapability } from "@dxos/app-framework/ui";
+//#region src/hooks/useGraphModel.ts
+var useGraphModel = (db, filter, options, items) => {
+	const registry = useCapability(Capabilities.AtomRegistry);
+	const [model, setModel] = useState(void 0);
+	useEffect(() => {
+		if (!db) {
+			setModel(void 0);
+			return;
+		}
+		const newModel = new SpaceGraphModel(registry);
+		newModel.open(db);
+		setModel(newModel);
+		return () => {
+			setModel(void 0);
+			newModel.close();
+		};
+	}, [db, registry]);
+	useEffect(() => {
+		model?.setFilter(filter).setOptions(options);
+	}, [
+		model,
+		filter,
+		options
+	]);
+	useEffect(() => {
+		model?.setItems(items);
+	}, [model, items]);
+	return model;
+};
+//#endregion
+//#region src/hooks/useNeighborhoodModel.ts
+/** Default traversal depth (hops) for the neighborhood graph. */
+var DEFAULT_NEIGHBORHOOD_DEPTH = 2;
+/**
+* Builds an ego graph around `object`: the n-hop neighbourhood reached by following refs and
+* relations from the active node. The full space graph is materialised (reactively) and then
+* narrowed to the nodes within `depth` hops, keeping only edges whose endpoints both survive.
+*
+* NOTE: Derives the subgraph from the whole-space model — the same cost the main explorer pays.
+* A direct ECHO traversal that loads only the reachable objects is a future optimisation.
+*/
+var useNeighborhoodModel = (object, depth = 2) => {
+	const fullModel = useGraphModel(object ? Obj.getDatabase(object) : void 0);
+	const [model, setModel] = useState(void 0);
+	useEffect(() => {
+		if (!fullModel || !object) {
+			setModel(void 0);
+			return;
+		}
+		const recompute = () => setModel(buildNeighborhood(fullModel, object.id, depth));
+		recompute();
+		return fullModel.subscribe(recompute);
+	}, [
+		fullModel,
+		object?.id,
+		depth
+	]);
+	return model;
+};
+/**
+* Narrow the full graph to the BFS neighbourhood of `rootId` within `depth` hops (edges treated as
+* undirected so the neighbourhood reads as graph distance regardless of ref/relation direction).
+*/
+var buildNeighborhood = (fullModel, rootId, depth) => {
+	const { nodes, edges } = fullModel.graph;
+	const adjacency = /* @__PURE__ */ new Map();
+	const link = (from, to) => {
+		const list = adjacency.get(from) ?? [];
+		list.push(to);
+		adjacency.set(from, list);
+	};
+	for (const edge of edges) {
+		link(edge.source, edge.target);
+		link(edge.target, edge.source);
+	}
+	const included = /* @__PURE__ */ new Set([rootId]);
+	let frontier = [rootId];
+	for (let hop = 0; hop < depth && frontier.length; hop++) {
+		const next = [];
+		for (const id of frontier) for (const neighbour of adjacency.get(id) ?? []) if (!included.has(neighbour)) {
+			included.add(neighbour);
+			next.push(neighbour);
+		}
+		frontier = next;
+	}
+	const subNodes = nodes.filter((node) => included.has(node.id));
+	const subEdges = edges.filter((edge) => included.has(edge.source) && included.has(edge.target));
+	return fullModel.copy({
+		nodes: subNodes,
+		edges: subEdges
+	});
+};
+//#endregion
+export { DEFAULT_NEIGHBORHOOD_DEPTH, useGraphModel, useNeighborhoodModel };
+
+//# sourceMappingURL=hooks.mjs.map

package/dist/lib/hooks.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"hooks.mjs","names":[],"sources":["../../src/hooks/useGraphModel.ts","../../src/hooks/useNeighborhoodModel.ts"],"sourcesContent":["//\n// Copyright 2023 DXOS.org\n//\n\nimport { useEffect, useState } from 'react';\n\nimport { Capabilities } from '@dxos/app-framework';\nimport { useCapability } from '@dxos/app-framework/ui';\nimport { type Database, type Entity, type Filter } from '@dxos/echo';\nimport { SpaceGraphModel, type SpaceGraphModelOptions } from '@dxos/schema';\n\n// TODO(burdon): Factor out.\nexport const useGraphModel = (\n  db: Database.Database | undefined,\n  filter?: Filter.Any | undefined,\n  options?: SpaceGraphModelOptions,\n  items?: readonly Entity.Unknown[],\n): SpaceGraphModel | undefined => {\n  const registry = useCapability(Capabilities.AtomRegistry);\n  const [model, setModel] = useState<SpaceGraphModel | undefined>(undefined);\n\n  useEffect(() => {\n    if (!db) {\n      setModel(undefined);\n      return;\n    }\n\n    const newModel = new SpaceGraphModel(registry);\n    void newModel.open(db);\n    setModel(newModel);\n\n    return () => {\n      setModel(undefined);\n      void newModel.close();\n    };\n  }, [db, registry]);\n\n  useEffect(() => {\n    model?.setFilter(filter).setOptions(options);\n  }, [model, filter, options]);\n\n  useEffect(() => {\n    model?.setItems(items);\n  }, [model, items]);\n\n  return model;\n};\n","//\n// Copyright 2026 DXOS.org\n//\n\nimport { useEffect, useState } from 'react';\n\nimport { Obj } from '@dxos/echo';\nimport { type SpaceGraphEdge, type SpaceGraphModel, type SpaceGraphNode } from '@dxos/schema';\n\nimport { useGraphModel } from './useGraphModel';\n\n/** Default traversal depth (hops) for the neighborhood graph. */\nexport const DEFAULT_NEIGHBORHOOD_DEPTH = 2;\n\n/**\n * Builds an ego graph around `object`: the n-hop neighbourhood reached by following refs and\n * relations from the active node. The full space graph is materialised (reactively) and then\n * narrowed to the nodes within `depth` hops, keeping only edges whose endpoints both survive.\n *\n * NOTE: Derives the subgraph from the whole-space model — the same cost the main explorer pays.\n * A direct ECHO traversal that loads only the reachable objects is a future optimisation.\n */\nexport const useNeighborhoodModel = (\n  object: Obj.Unknown | undefined,\n  depth = DEFAULT_NEIGHBORHOOD_DEPTH,\n): SpaceGraphModel | undefined => {\n  const db = object ? Obj.getDatabase(object) : undefined;\n  const fullModel = useGraphModel(db);\n  const [model, setModel] = useState<SpaceGraphModel | undefined>(undefined);\n\n  useEffect(() => {\n    if (!fullModel || !object) {\n      setModel(undefined);\n      return;\n    }\n\n    const recompute = () => setModel(buildNeighborhood(fullModel, object.id, depth));\n    recompute();\n    return fullModel.subscribe(recompute);\n  }, [fullModel, object?.id, depth]);\n\n  return model;\n};\n\n/**\n * Narrow the full graph to the BFS neighbourhood of `rootId` within `depth` hops (edges treated as\n * undirected so the neighbourhood reads as graph distance regardless of ref/relation direction).\n */\nconst buildNeighborhood = (fullModel: SpaceGraphModel, rootId: string, depth: number): SpaceGraphModel => {\n  const { nodes, edges } = fullModel.graph;\n\n  const adjacency = new Map<string, string[]>();\n  const link = (from: string, to: string) => {\n    const list = adjacency.get(from) ?? [];\n    list.push(to);\n    adjacency.set(from, list);\n  };\n  for (const edge of edges) {\n    link(edge.source, edge.target);\n    link(edge.target, edge.source);\n  }\n\n  const included = new Set<string>([rootId]);\n  let frontier = [rootId];\n  for (let hop = 0; hop < depth && frontier.length; hop++) {\n    const next: string[] = [];\n    for (const id of frontier) {\n      for (const neighbour of adjacency.get(id) ?? []) {\n        if (!included.has(neighbour)) {\n          included.add(neighbour);\n          next.push(neighbour);\n        }\n      }\n    }\n    frontier = next;\n  }\n\n  const subNodes = nodes.filter((node: SpaceGraphNode) => included.has(node.id));\n  const subEdges = edges.filter((edge: SpaceGraphEdge) => included.has(edge.source) && included.has(edge.target));\n  return fullModel.copy({ nodes: subNodes, edges: subEdges });\n};\n"],"mappings":";;;;;;AAYA,IAAa,iBACX,IACA,QACA,SACA,UACgC;CAChC,MAAM,WAAW,cAAc,aAAa,YAAY;CACxD,MAAM,CAAC,OAAO,YAAY,SAAsC,KAAA,CAAS;CAEzE,gBAAgB;EACd,IAAI,CAAC,IAAI;GACP,SAAS,KAAA,CAAS;GAClB;EACF;EAEA,MAAM,WAAW,IAAI,gBAAgB,QAAQ;EAC7C,SAAc,KAAK,EAAE;EACrB,SAAS,QAAQ;EAEjB,aAAa;GACX,SAAS,KAAA,CAAS;GAClB,SAAc,MAAM;EACtB;CACF,GAAG,CAAC,IAAI,QAAQ,CAAC;CAEjB,gBAAgB;EACd,OAAO,UAAU,MAAM,CAAC,CAAC,WAAW,OAAO;CAC7C,GAAG;EAAC;EAAO;EAAQ;CAAO,CAAC;CAE3B,gBAAgB;EACd,OAAO,SAAS,KAAK;CACvB,GAAG,CAAC,OAAO,KAAK,CAAC;CAEjB,OAAO;AACT;;;;AClCA,IAAa,6BAA6B;;;;;;;;;AAU1C,IAAa,wBACX,QACA,QAAA,MACgC;CAEhC,MAAM,YAAY,cADP,SAAS,IAAI,YAAY,MAAM,IAAI,KAAA,CACZ;CAClC,MAAM,CAAC,OAAO,YAAY,SAAsC,KAAA,CAAS;CAEzE,gBAAgB;EACd,IAAI,CAAC,aAAa,CAAC,QAAQ;GACzB,SAAS,KAAA,CAAS;GAClB;EACF;EAEA,MAAM,kBAAkB,SAAS,kBAAkB,WAAW,OAAO,IAAI,KAAK,CAAC;EAC/E,UAAU;EACV,OAAO,UAAU,UAAU,SAAS;CACtC,GAAG;EAAC;EAAW,QAAQ;EAAI;CAAK,CAAC;CAEjC,OAAO;AACT;;;;;AAMA,IAAM,qBAAqB,WAA4B,QAAgB,UAAmC;CACxG,MAAM,EAAE,OAAO,UAAU,UAAU;CAEnC,MAAM,4BAAY,IAAI,IAAsB;CAC5C,MAAM,QAAQ,MAAc,OAAe;EACzC,MAAM,OAAO,UAAU,IAAI,IAAI,KAAK,CAAC;EACrC,KAAK,KAAK,EAAE;EACZ,UAAU,IAAI,MAAM,IAAI;CAC1B;CACA,KAAK,MAAM,QAAQ,OAAO;EACxB,KAAK,KAAK,QAAQ,KAAK,MAAM;EAC7B,KAAK,KAAK,QAAQ,KAAK,MAAM;CAC/B;CAEA,MAAM,2BAAW,IAAI,IAAY,CAAC,MAAM,CAAC;CACzC,IAAI,WAAW,CAAC,MAAM;CACtB,KAAK,IAAI,MAAM,GAAG,MAAM,SAAS,SAAS,QAAQ,OAAO;EACvD,MAAM,OAAiB,CAAC;EACxB,KAAK,MAAM,MAAM,UACf,KAAK,MAAM,aAAa,UAAU,IAAI,EAAE,KAAK,CAAC,GAC5C,IAAI,CAAC,SAAS,IAAI,SAAS,GAAG;GAC5B,SAAS,IAAI,SAAS;GACtB,KAAK,KAAK,SAAS;EACrB;EAGJ,WAAW;CACb;CAEA,MAAM,WAAW,MAAM,QAAQ,SAAyB,SAAS,IAAI,KAAK,EAAE,CAAC;CAC7E,MAAM,WAAW,MAAM,QAAQ,SAAyB,SAAS,IAAI,KAAK,MAAM,KAAK,SAAS,IAAI,KAAK,MAAM,CAAC;CAC9G,OAAO,UAAU,KAAK;EAAE,OAAO;EAAU,OAAO;CAAS,CAAC;AAC5D"}

package/dist/lib/index.mjs

@@ -0,0 +1,3 @@
+import { n as ExplorerAction_exports, t as Graph_exports } from "./chunk-types.mjs";
+import { t as meta } from "./chunk-meta.mjs";
+export { ExplorerAction_exports as ExplorerAction, Graph_exports as Graph, meta };

package/dist/lib/meta.mjs

@@ -0,0 +1,2 @@
+import { t as meta } from "./chunk-meta.mjs";
+export { meta };

package/dist/lib/plugin.mjs

@@ -0,0 +1,8 @@
+import { t as meta } from "./chunk-meta.mjs";
+import { Plugin } from "@dxos/app-framework";
+//#region src/plugin.ts
+var ExplorerPlugin = Plugin.lazy(meta, () => import("#plugin"));
+//#endregion
+export { ExplorerPlugin };
+
+//# sourceMappingURL=plugin.mjs.map

package/dist/lib/plugin.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"plugin.mjs","names":[],"sources":["../../src/plugin.ts"],"sourcesContent":["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Plugin } from '@dxos/app-framework';\n\nimport { meta } from './meta';\n\nexport const ExplorerPlugin = Plugin.lazy(meta, () => import('#plugin'));\n"],"mappings":";;;AAQA,IAAa,iBAAiB,OAAO,KAAK,YAAY,OAAO,UAAU"}

package/dist/lib/testing.mjs

@@ -0,0 +1,118 @@
+import { t as ExplorerPlugin } from "./chunk-ExplorerPlugin.mjs";
+import { t as Tree } from "./chunk-types2.mjs";
+import { range } from "@dxos/util";
+import { Key, Obj, Query, Relation } from "@dxos/echo";
+import { createObjectFactory, createRelationFactory } from "@dxos/schema/testing";
+import { HasConnection, Organization, Person } from "@dxos/types";
+//#region src/testing/generator.ts
+var random = (min, max) => Math.floor(Math.random() * (max - min + 1)) + min;
+/**
+* Create hierarchical tree.
+*/
+var createTree = (spec = [], createText) => {
+	const tree = new Tree();
+	Obj.update(tree.tree, () => {
+		tree.root.data = { text: "root" };
+	});
+	const createNodes = (parent, spec = 0) => {
+		return range(Array.isArray(spec) ? random(spec[0], spec[1]) : spec, (i) => ({
+			id: Key.EntityId.random(),
+			children: [],
+			data: { text: createText?.() ?? [parent.data.text, i + 1].join(".") }
+		}));
+	};
+	const createChildNodes = (parent, [count = 0, ...rest]) => {
+		const nodes = createNodes(parent, count);
+		nodes.forEach((n) => tree.addNode(parent, n));
+		if (rest.length) for (const node of nodes) createChildNodes(node, rest);
+		return parent;
+	};
+	createChildNodes(tree.root, spec);
+	return tree;
+};
+//#endregion
+//#region src/testing/relations.ts
+var SECTORS = [
+	"Technology",
+	"Finance",
+	"Research",
+	"Media"
+];
+var CONNECTION_KINDS = [
+	"partner",
+	"investor",
+	"vendor",
+	"customer"
+];
+/**
+* Populate a space with Organizations, People, and HasConnection relations between organizations.
+* Uses `createObjectFactory` to generate Org/Person properties from their `GeneratorAnnotation`s,
+* then `createRelationFactory` to wire HasConnection relations (Org→Org) between them, spreading
+* the connections across the available kinds.
+*/
+var generateConnectedOrgs = async (space, generator, { organizationCount = 12, personCount = 24, connectionCount = 18 } = {}) => {
+	const specs = [{
+		type: Organization.Organization,
+		count: organizationCount
+	}, {
+		type: Person.Person,
+		count: personCount
+	}];
+	await createObjectFactory(space.db, generator)(specs);
+	const relationSpecs = CONNECTION_KINDS.map((kind, index) => ({
+		type: HasConnection.HasConnection,
+		count: Math.floor(connectionCount / CONNECTION_KINDS.length) + (index < connectionCount % CONNECTION_KINDS.length ? 1 : 0),
+		data: { kind }
+	}));
+	const connections = await createRelationFactory(space.db, generator)(relationSpecs);
+	return {
+		organizations: await space.db.query(Query.type(Organization.Organization)).run(),
+		people: await space.db.query(Query.type(Person.Person)).run(),
+		connections
+	};
+};
+/**
+* Build a TreeNode hierarchy: Root → Sector → Organization (leaf).
+* Organizations are deterministically bucketed into `SECTORS` so the demo has visible groups.
+*/
+var buildOrgHierarchy = (organizations, sectors = SECTORS) => {
+	const activeSectors = sectors.length > 0 ? sectors : ["Uncategorized"];
+	const buckets = /* @__PURE__ */ new Map();
+	for (const sector of activeSectors) buckets.set(sector, []);
+	for (let i = 0; i < organizations.length; i++) {
+		const org = organizations[i];
+		const sector = activeSectors[i % activeSectors.length];
+		buckets.get(sector).push({
+			id: org.id,
+			label: org.name ?? org.id.slice(0, 6)
+		});
+	}
+	return {
+		id: "root",
+		label: "Organizations",
+		children: activeSectors.map((sector) => ({
+			id: `sector:${sector}`,
+			label: sector,
+			children: buckets.get(sector) ?? []
+		}))
+	};
+};
+/**
+* Convert HasConnection relations into bundle edges between organization ids.
+*/
+var connectionsToEdges = (connections) => {
+	return connections.map((relation) => {
+		const source = Relation.getSource(relation);
+		const target = Relation.getTarget(relation);
+		if (!source?.id || !target?.id) return;
+		return {
+			source: source.id,
+			target: target.id,
+			kind: relation.kind
+		};
+	}).filter((e) => Boolean(e));
+};
+//#endregion
+export { ExplorerPlugin, buildOrgHierarchy, connectionsToEdges, createTree, generateConnectedOrgs };
+
+//# sourceMappingURL=testing.mjs.map

package/dist/lib/testing.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"testing.mjs","names":[],"sources":["../../src/testing/generator.ts","../../src/testing/relations.ts"],"sourcesContent":["//\n// Copyright 2025 DXOS.org\n//\n\nimport { Key, Obj } from '@dxos/echo';\nimport { range } from '@dxos/util';\n\nimport { Tree, type TreeNodeType } from '../components/Tree/types';\n\ntype NumberOrNumberArray = number | number[];\n\nconst random = (min: number, max: number) => Math.floor(Math.random() * (max - min + 1)) + min;\n\n/**\n * Create hierarchical tree.\n */\nexport const createTree = (spec: NumberOrNumberArray[] = [], createText?: () => string): Tree => {\n  const tree = new Tree();\n  Obj.update(tree.tree, () => {\n    tree.root.data = { text: 'root' };\n  });\n\n  const createNodes = (parent: TreeNodeType, spec: NumberOrNumberArray = 0): TreeNodeType[] => {\n    const count = Array.isArray(spec) ? random(spec[0], spec[1]) : spec;\n    return range(count, (i) => ({\n      id: Key.EntityId.random(),\n      children: [],\n      data: {\n        text: createText?.() ?? [parent.data.text, i + 1].join('.'),\n      },\n    }));\n  };\n\n  const createChildNodes = (parent: TreeNodeType, [count = 0, ...rest]: NumberOrNumberArray[]): TreeNodeType => {\n    const nodes = createNodes(parent, count);\n    nodes.forEach((n) => tree.addNode(parent, n));\n    if (rest.length) {\n      for (const node of nodes) {\n        createChildNodes(node, rest);\n      }\n    }\n\n    return parent;\n  };\n\n  createChildNodes(tree.root, spec);\n  return tree;\n};\n","//\n// Copyright 2026 DXOS.org\n//\n\nimport { type Space } from '@dxos/client/echo';\nimport { Obj, Query, Relation } from '@dxos/echo';\nimport { type BundleEdge, type TreeNode } from '@dxos/react-ui-graph';\nimport {\n  type RelationSpec,\n  type TypeSpec,\n  type ValueGenerator,\n  createObjectFactory,\n  createRelationFactory,\n} from '@dxos/schema/testing';\nimport { HasConnection, Organization, Person } from '@dxos/types';\n\nconst SECTORS = ['Technology', 'Finance', 'Research', 'Media'];\nconst CONNECTION_KINDS = ['partner', 'investor', 'vendor', 'customer'];\n\nexport type ConnectedOrgsResult = {\n  organizations: Obj.Any[];\n  people: Obj.Any[];\n  connections: Obj.Any[];\n};\n\nexport type ConnectedOrgsOptions = {\n  organizationCount?: number;\n  personCount?: number;\n  connectionCount?: number;\n};\n\n/**\n * Populate a space with Organizations, People, and HasConnection relations between organizations.\n * Uses `createObjectFactory` to generate Org/Person properties from their `GeneratorAnnotation`s,\n * then `createRelationFactory` to wire HasConnection relations (Org→Org) between them, spreading\n * the connections across the available kinds.\n */\nexport const generateConnectedOrgs = async (\n  space: Space,\n  generator: ValueGenerator,\n  { organizationCount = 12, personCount = 24, connectionCount = 18 }: ConnectedOrgsOptions = {},\n): Promise<ConnectedOrgsResult> => {\n  const specs: TypeSpec[] = [\n    { type: Organization.Organization, count: organizationCount },\n    // Person has a Ref to Organization — generator fills it from objects already in db.\n    { type: Person.Person, count: personCount },\n  ];\n\n  await createObjectFactory(space.db, generator)(specs);\n\n  // Distribute the requested connections evenly across the connection kinds.\n  const relationSpecs: RelationSpec[] = CONNECTION_KINDS.map((kind, index) => ({\n    type: HasConnection.HasConnection,\n    count:\n      Math.floor(connectionCount / CONNECTION_KINDS.length) +\n      (index < connectionCount % CONNECTION_KINDS.length ? 1 : 0),\n    data: { kind },\n  }));\n  const connections = await createRelationFactory(space.db, generator)(relationSpecs);\n\n  const organizations = await space.db.query(Query.type(Organization.Organization)).run();\n  const people = await space.db.query(Query.type(Person.Person)).run();\n  return { organizations, people, connections };\n};\n\n/**\n * Build a TreeNode hierarchy: Root → Sector → Organization (leaf).\n * Organizations are deterministically bucketed into `SECTORS` so the demo has visible groups.\n */\nexport const buildOrgHierarchy = (organizations: Obj.Any[], sectors: readonly string[] = SECTORS): TreeNode => {\n  // Avoid modulo-by-zero / missing-bucket crashes when the caller passes an empty sectors list.\n  const activeSectors = sectors.length > 0 ? sectors : ['Uncategorized'];\n  const buckets = new Map<string, TreeNode[]>();\n  for (const sector of activeSectors) {\n    buckets.set(sector, []);\n  }\n  for (let i = 0; i < organizations.length; i++) {\n    const org = organizations[i] as any;\n    const sector = activeSectors[i % activeSectors.length];\n    buckets.get(sector)!.push({\n      id: org.id,\n      label: org.name ?? org.id.slice(0, 6),\n    });\n  }\n\n  return {\n    id: 'root',\n    label: 'Organizations',\n    children: activeSectors.map((sector) => ({\n      id: `sector:${sector}`,\n      label: sector,\n      children: buckets.get(sector) ?? [],\n    })),\n  };\n};\n\n/**\n * Convert HasConnection relations into bundle edges between organization ids.\n */\nexport const connectionsToEdges = (connections: Obj.Any[]): BundleEdge[] => {\n  return connections\n    .map((relation): BundleEdge | undefined => {\n      const source = Relation.getSource(relation as any) as any;\n      const target = Relation.getTarget(relation as any) as any;\n      if (!source?.id || !target?.id) {\n        return undefined;\n      }\n      return {\n        source: source.id,\n        target: target.id,\n        kind: (relation as any).kind,\n      };\n    })\n    .filter((e): e is BundleEdge => Boolean(e));\n};\n"],"mappings":";;;;;;;AAWA,IAAM,UAAU,KAAa,QAAgB,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,MAAM,EAAE,IAAI;;;;AAK3F,IAAa,cAAc,OAA8B,CAAC,GAAG,eAAoC;CAC/F,MAAM,OAAO,IAAI,KAAK;CACtB,IAAI,OAAO,KAAK,YAAY;EAC1B,KAAK,KAAK,OAAO,EAAE,MAAM,OAAO;CAClC,CAAC;CAED,MAAM,eAAe,QAAsB,OAA4B,MAAsB;EAE3F,OAAO,MADO,MAAM,QAAQ,IAAI,IAAI,OAAO,KAAK,IAAI,KAAK,EAAE,IAAI,OAC1C,OAAO;GAC1B,IAAI,IAAI,SAAS,OAAO;GACxB,UAAU,CAAC;GACX,MAAM,EACJ,MAAM,aAAa,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAC5D;EACF,EAAE;CACJ;CAEA,MAAM,oBAAoB,QAAsB,CAAC,QAAQ,GAAG,GAAG,UAA+C;EAC5G,MAAM,QAAQ,YAAY,QAAQ,KAAK;EACvC,MAAM,SAAS,MAAM,KAAK,QAAQ,QAAQ,CAAC,CAAC;EAC5C,IAAI,KAAK,QACP,KAAK,MAAM,QAAQ,OACjB,iBAAiB,MAAM,IAAI;EAI/B,OAAO;CACT;CAEA,iBAAiB,KAAK,MAAM,IAAI;CAChC,OAAO;AACT;;;AC/BA,IAAM,UAAU;CAAC;CAAc;CAAW;CAAY;AAAO;AAC7D,IAAM,mBAAmB;CAAC;CAAW;CAAY;CAAU;AAAU;;;;;;;AAoBrE,IAAa,wBAAwB,OACnC,OACA,WACA,EAAE,oBAAoB,IAAI,cAAc,IAAI,kBAAkB,OAA6B,CAAC,MAC3D;CACjC,MAAM,QAAoB,CACxB;EAAE,MAAM,aAAa;EAAc,OAAO;CAAkB,GAE5D;EAAE,MAAM,OAAO;EAAQ,OAAO;CAAY,CAC5C;CAEA,MAAM,oBAAoB,MAAM,IAAI,SAAS,CAAC,CAAC,KAAK;CAGpD,MAAM,gBAAgC,iBAAiB,KAAK,MAAM,WAAW;EAC3E,MAAM,cAAc;EACpB,OACE,KAAK,MAAM,kBAAkB,iBAAiB,MAAM,KACnD,QAAQ,kBAAkB,iBAAiB,SAAS,IAAI;EAC3D,MAAM,EAAE,KAAK;CACf,EAAE;CACF,MAAM,cAAc,MAAM,sBAAsB,MAAM,IAAI,SAAS,CAAC,CAAC,aAAa;CAIlF,OAAO;EAAE,eAAA,MAFmB,MAAM,GAAG,MAAM,MAAM,KAAK,aAAa,YAAY,CAAC,CAAC,CAAC,IAAI;EAE9D,QAAA,MADH,MAAM,GAAG,MAAM,MAAM,KAAK,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI;EACnC;CAAY;AAC9C;;;;;AAMA,IAAa,qBAAqB,eAA0B,UAA6B,YAAsB;CAE7G,MAAM,gBAAgB,QAAQ,SAAS,IAAI,UAAU,CAAC,eAAe;CACrE,MAAM,0BAAU,IAAI,IAAwB;CAC5C,KAAK,MAAM,UAAU,eACnB,QAAQ,IAAI,QAAQ,CAAC,CAAC;CAExB,KAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;EAC7C,MAAM,MAAM,cAAc;EAC1B,MAAM,SAAS,cAAc,IAAI,cAAc;EAC/C,QAAQ,IAAI,MAAM,CAAC,CAAE,KAAK;GACxB,IAAI,IAAI;GACR,OAAO,IAAI,QAAQ,IAAI,GAAG,MAAM,GAAG,CAAC;EACtC,CAAC;CACH;CAEA,OAAO;EACL,IAAI;EACJ,OAAO;EACP,UAAU,cAAc,KAAK,YAAY;GACvC,IAAI,UAAU;GACd,OAAO;GACP,UAAU,QAAQ,IAAI,MAAM,KAAK,CAAC;EACpC,EAAE;CACJ;AACF;;;;AAKA,IAAa,sBAAsB,gBAAyC;CAC1E,OAAO,YACJ,KAAK,aAAqC;EACzC,MAAM,SAAS,SAAS,UAAU,QAAe;EACjD,MAAM,SAAS,SAAS,UAAU,QAAe;EACjD,IAAI,CAAC,QAAQ,MAAM,CAAC,QAAQ,IAC1B;EAEF,OAAO;GACL,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf,MAAO,SAAiB;EAC1B;CACF,CAAC,CAAA,CACA,QAAQ,MAAuB,QAAQ,CAAC,CAAC;AAC9C"}

package/dist/lib/translations.mjs

@@ -0,0 +1,29 @@
+import { Type } from "@dxos/echo";
+import { meta } from "#meta";
+import { Graph } from "#types";
+import { translations as translations$1 } from "@dxos/react-ui-components/translations";
+//#region src/translations.ts
+var translations = [{ "en-US": {
+	[Type.getTypename(Graph.Graph)]: {
+		"typename.label": "Explorer",
+		"typename.label_zero": "Explorers",
+		"typename.label_one": "Explorer",
+		"typename.label_other": "Explorers",
+		"object-name.placeholder": "New explorer",
+		"add-object.label": "Add explorer",
+		"rename-object.label": "Rename explorer",
+		"delete-object.label": "Delete explorer",
+		"object-deleted.label": "Explorer deleted"
+	},
+	[meta.profile.key]: {
+		"plugin.name": "Explorer",
+		"object-title.label": "Title",
+		"neighborhood-companion.label": "Graph",
+		"depth.label_one": "{{count}} hop",
+		"depth.label_other": "{{count}} hops"
+	}
+} }, ...translations$1];
+//#endregion
+export { translations };
+
+//# sourceMappingURL=translations.mjs.map

package/dist/lib/translations.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"translations.mjs","names":[],"sources":["../../src/translations.ts"],"sourcesContent":["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Type } from '@dxos/echo';\nimport { type Resource } from '@dxos/react-ui';\nimport { translations as componentsTranslations } from '@dxos/react-ui-components/translations';\n\nimport { meta } from '#meta';\nimport { Graph } from '#types';\n\nexport const translations = [\n  {\n    'en-US': {\n      [Type.getTypename(Graph.Graph)]: {\n        'typename.label': 'Explorer',\n        'typename.label_zero': 'Explorers',\n        'typename.label_one': 'Explorer',\n        'typename.label_other': 'Explorers',\n        'object-name.placeholder': 'New explorer',\n        'add-object.label': 'Add explorer',\n        'rename-object.label': 'Rename explorer',\n        'delete-object.label': 'Delete explorer',\n        'object-deleted.label': 'Explorer deleted',\n      },\n      [meta.profile.key]: {\n        'plugin.name': 'Explorer',\n        'object-title.label': 'Title',\n        'neighborhood-companion.label': 'Graph',\n        'depth.label_one': '{{count}} hop',\n        'depth.label_other': '{{count}} hops',\n      },\n    },\n  },\n  ...componentsTranslations,\n] as const satisfies Resource[];\n"],"mappings":";;;;;AAWA,IAAa,eAAe,CAC1B,EACE,SAAS;EACN,KAAK,YAAY,MAAM,KAAK,IAAI;EAC/B,kBAAkB;EAClB,uBAAuB;EACvB,sBAAsB;EACtB,wBAAwB;EACxB,2BAA2B;EAC3B,oBAAoB;EACpB,uBAAuB;EACvB,uBAAuB;EACvB,wBAAwB;CAC1B;EACC,KAAK,QAAQ,MAAM;EAClB,eAAe;EACf,sBAAsB;EACtB,gCAAgC;EAChC,mBAAmB;EACnB,qBAAqB;CACvB;AACF,EACF,GACA,GAAG,cACL"}

package/dist/lib/types.mjs

@@ -0,0 +1,2 @@
+import { n as ExplorerAction_exports, t as Graph_exports } from "./chunk-types.mjs";
+export { ExplorerAction_exports as ExplorerAction, Graph_exports as Graph };

package/dist/types/src/capabilities/app-graph-builder.d.ts

@@ -4,6 +4,6 @@ import { Capability } from '@dxos/app-framework';
  * Offers a "Neighborhood" companion on any ECHO object. The matched node is passed through as the
  * companion's `companionTo` (the active node), which the surface renders as an ego-centric graph.
  */
-declare const _default: (props: void) => Effect.Effect<Capability.Any, never, never>;
+declare const _default: (props: void) => Effect.Effect<Capability.Any, never, import("effect/Scope").Scope>;
 export default _default;
 //# sourceMappingURL=app-graph-builder.d.ts.map

package/dist/types/src/capabilities/app-graph-builder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"app-graph-builder.d.ts","sourceRoot":"","sources":["../../../../src/capabilities/app-graph-builder.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAExC,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAQjD;;;GAGG"}
+{"version":3,"file":"app-graph-builder.d.ts","sourceRoot":"","sources":["../../../../src/capabilities/app-graph-builder.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAExC,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAOjD;;;GAGG"}

package/dist/types/src/capabilities/create-object.d.ts

@@ -1,5 +1,5 @@
 import * as Effect from 'effect/Effect';
 import { Capability } from '@dxos/app-framework';
-declare const _default: (props: void) => Effect.Effect<Capability.Any, never, never>;
+declare const _default: (props: void) => Effect.Effect<Capability.Any, never, import("effect/Scope").Scope>;
 export default _default;
 //# sourceMappingURL=create-object.d.ts.map

package/dist/types/src/capabilities/react-surface.d.ts

@@ -1,5 +1,5 @@
 import * as Effect from 'effect/Effect';
 import { Capability } from '@dxos/app-framework';
-declare const _default: (props: void) => Effect.Effect<Capability.Any, never, never>;
+declare const _default: (props: void) => Effect.Effect<Capability.Any, never, import("effect/Scope").Scope>;
 export default _default;
 //# sourceMappingURL=react-surface.d.ts.map

package/dist/types/src/capabilities/react-surface.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"react-surface.d.ts","sourceRoot":"","sources":["../../../../src/capabilities/react-surface.tsx"],"names":[],"mappings":"AAIA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAGxC,OAAO,EAAgB,UAAU,EAAE,MAAM,qBAAqB,CAAC"}
+{"version":3,"file":"react-surface.d.ts","sourceRoot":"","sources":["../../../../src/capabilities/react-surface.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAExC,OAAO,EAAgB,UAAU,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/types/src/components/Graph/CanvasForceGraph.d.ts

@@ -9,5 +9,5 @@ export type CanvasForceGraphProps = {
  */
 export declare const CanvasForceGraph: React.ForwardRefExoticComponent<Omit<CanvasForceGraphProps, "className"> & {
     classNames?: import("@dxos/ui-types").ClassNameValue;
-} & Pick<React.HTMLAttributes<Element>, "children" | "className" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
+} & Pick<React.HTMLAttributes<Element>, "children" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
 //# sourceMappingURL=CanvasForceGraph.d.ts.map

package/dist/types/src/components/Graph/CanvasForceGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CanvasForceGraph.d.ts","sourceRoot":"","sources":["../../../../../src/components/Graph/CanvasForceGraph.tsx"],"names":[],"mappings":"AAMA,OAAO,KAQN,MAAM,OAAO,CAAC;AAIf,OAAO,EAAE,KAAK,eAAe,EAAE,MAAM,cAAc,CAAC;AAIpD,MAAM,MAAM,qBAAqB,GAAG;IAClC,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,gBAAgB;;2HAqF5B,CAAC"}
+{"version":3,"file":"CanvasForceGraph.d.ts","sourceRoot":"","sources":["../../../../../src/components/Graph/CanvasForceGraph.tsx"],"names":[],"mappings":"AAMA,OAAO,KAQN,MAAM,OAAO,CAAC;AAIf,OAAO,EAAE,KAAK,eAAe,EAAE,MAAM,cAAc,CAAC;AAIpD,MAAM,MAAM,qBAAqB,GAAG;IAClC,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,gBAAgB;;6GAqF5B,CAAC"}

package/dist/types/src/components/Graph/CanvasForceGraph.stories.d.ts

@@ -4,7 +4,7 @@ declare const meta: {
     title: string;
     component: React.ForwardRefExoticComponent<Omit<import("./CanvasForceGraph").CanvasForceGraphProps, "className"> & {
         classNames?: import("@dxos/ui-types").ClassNameValue;
-    } & Pick<React.HTMLAttributes<Element>, "children" | "className" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
+    } & Pick<React.HTMLAttributes<Element>, "children" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
     render: () => React.JSX.Element;
     decorators: import("@storybook/react").Decorator[];
     parameters: {

package/dist/types/src/components/Graph/ForceGraph.d.ts

@@ -11,5 +11,5 @@ export type ForceGraphProps = {
 } & Pick<GraphProps, 'drag'>;
 export declare const ForceGraph: React.ForwardRefExoticComponent<Omit<ForceGraphProps, "className"> & {
     classNames?: import("@dxos/ui-types").ClassNameValue;
-} & Pick<React.HTMLAttributes<Element>, "children" | "className" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
+} & Pick<React.HTMLAttributes<Element>, "children" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
 //# sourceMappingURL=ForceGraph.d.ts.map

package/dist/types/src/components/Graph/ForceGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ForceGraph.d.ts","sourceRoot":"","sources":["../../../../../src/components/Graph/ForceGraph.tsx"],"names":[],"mappings":"AAKA,OAAO,KAA4D,MAAM,OAAO,CAAC;AAGjF,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE7C,OAAO,EAIL,KAAK,UAAU,EAGhB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,KAAK,cAAc,EAAE,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,MAAM,cAAc,CAAC;AAE9F,OAAO,uCAAuC,CAAC;AAI/C,MAAM,MAAM,eAAe,GAAG;IAC5B,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,SAAS,CAAC,EAAE,UAAU,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC;CACrE,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AAE7B,eAAO,MAAM,UAAU;;2HAgFtB,CAAC"}
+{"version":3,"file":"ForceGraph.d.ts","sourceRoot":"","sources":["../../../../../src/components/Graph/ForceGraph.tsx"],"names":[],"mappings":"AAKA,OAAO,KAA4D,MAAM,OAAO,CAAC;AAGjF,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE7C,OAAO,EAIL,KAAK,UAAU,EAGhB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,KAAK,cAAc,EAAE,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,MAAM,cAAc,CAAC;AAE9F,OAAO,uCAAuC,CAAC;AAI/C,MAAM,MAAM,eAAe,GAAG;IAC5B,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,SAAS,CAAC,EAAE,UAAU,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC;CACrE,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AAE7B,eAAO,MAAM,UAAU;;6GAgFtB,CAAC"}

package/dist/types/src/components/Graph/ForceGraph.stories.d.ts

@@ -4,7 +4,7 @@ declare const meta: {
     title: string;
     component: React.ForwardRefExoticComponent<Omit<import("./ForceGraph").ForceGraphProps, "className"> & {
         classNames?: import("@dxos/ui-types").ClassNameValue;
-    } & Pick<React.HTMLAttributes<Element>, "children" | "className" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
+    } & Pick<React.HTMLAttributes<Element>, "children" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
     render: () => React.JSX.Element;
     decorators: import("@storybook/react").Decorator[];
     parameters: {

package/dist/types/src/components/Visualization/Visualization.d.ts

@@ -29,7 +29,7 @@ export declare const Visualization: {
         asChild?: boolean;
     }, "className"> & {
         classNames?: import("@dxos/ui-types").ClassNameValue;
-    } & Pick<React.HTMLAttributes<Element>, "children" | "className" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
+    } & Pick<React.HTMLAttributes<Element>, "children" | "role" | "style"> & React.RefAttributes<HTMLDivElement>>;
     Graph: {
         ({ debug, onNodeHover }: VisualizationGraphProps): React.JSX.Element;
         displayName: string;

package/dist/types/src/containers/ExplorerArticle/ExplorerArticle.d.ts

@@ -4,5 +4,8 @@ import { type View } from '@dxos/echo';
 import '@dxos/react-ui-graph/styles/graph.css';
 export type { ExplorerArticleVariant } from '#components';
 export type ExplorerArticleProps = AppSurface.ObjectArticleProps<View.View>;
-export declare const ExplorerArticle: ({ role, subject, variant }: ExplorerArticleProps) => React.JSX.Element | null;
+export declare function ExplorerArticle({ role, subject, variant }: ExplorerArticleProps): React.JSX.Element | null;
+export declare namespace ExplorerArticle {
+    var displayName: string;
+}
 //# sourceMappingURL=ExplorerArticle.d.ts.map

package/dist/types/src/containers/ExplorerArticle/ExplorerArticle.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ExplorerArticle.d.ts","sourceRoot":"","sources":["../../../../../src/containers/ExplorerArticle/ExplorerArticle.tsx"],"names":[],"mappings":"AAIA,OAAO,KAAoD,MAAM,OAAO,CAAC;AAEzE,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EAAoB,KAAK,IAAI,EAAE,MAAM,YAAY,CAAC;AAMzD,OAAO,uCAAuC,CAAC;AAK/C,YAAY,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAE1D,MAAM,MAAM,oBAAoB,GAAG,UAAU,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAE5E,eAAO,MAAM,eAAe,+BAAgC,oBAAoB,6BAgG/E,CAAC"}
+{"version":3,"file":"ExplorerArticle.d.ts","sourceRoot":"","sources":["../../../../../src/containers/ExplorerArticle/ExplorerArticle.tsx"],"names":[],"mappings":"AAIA,OAAO,KAAoD,MAAM,OAAO,CAAC;AAEzE,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EAAoB,KAAK,IAAI,EAAE,MAAM,YAAY,CAAC;AAMzD,OAAO,uCAAuC,CAAC;AAK/C,YAAY,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAE1D,MAAM,MAAM,oBAAoB,GAAG,UAAU,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wCAE5C,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,oBAAoB"}

package/dist/types/src/containers/ExplorerArticle/ExplorerArticle.stories.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ExplorerArticle.stories.d.ts","sourceRoot":"","sources":["../../../../../src/containers/ExplorerArticle/ExplorerArticle.stories.tsx"],"names":[],"mappings":"AAIA,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAiBjE,OAAO,EAAmB,KAAK,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAMjF,KAAK,SAAS,GAAG;IAAE,OAAO,EAAE,sBAAsB,CAAA;CAAE,CAAC;AAYrD,QAAA,MAAM,IAAI,EAAE,IAAI,CAAC,SAAS,CAwEzB,CAAC;eAEa,IAAI;AAEnB,KAAK,KAAK,GAAG,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC;AAEnC,eAAO,MAAM,KAAK,EAAE,KAInB,CAAC;AAEF,eAAO,MAAM,OAAO,EAAE,KAIrB,CAAC;AAEF,eAAO,MAAM,MAAM,EAAE,KAIpB,CAAC;AAEF,eAAO,MAAM,MAAM,EAAE,KAIpB,CAAC;AAEF,eAAO,MAAM,OAAO,EAAE,KAIrB,CAAC;AAEF,eAAO,MAAM,KAAK,EAAE,KAInB,CAAC"}
+{"version":3,"file":"ExplorerArticle.stories.d.ts","sourceRoot":"","sources":["../../../../../src/containers/ExplorerArticle/ExplorerArticle.stories.tsx"],"names":[],"mappings":"AAIA,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAkBjE,OAAO,EAAmB,KAAK,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAMjF,KAAK,SAAS,GAAG;IAAE,OAAO,EAAE,sBAAsB,CAAA;CAAE,CAAC;AAYrD,QAAA,MAAM,IAAI,EAAE,IAAI,CAAC,SAAS,CAwEzB,CAAC;eAEa,IAAI;AAEnB,KAAK,KAAK,GAAG,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC;AAEnC,eAAO,MAAM,KAAK,EAAE,KAInB,CAAC;AAEF,eAAO,MAAM,OAAO,EAAE,KAIrB,CAAC;AAEF,eAAO,MAAM,MAAM,EAAE,KAIpB,CAAC;AAEF,eAAO,MAAM,MAAM,EAAE,KAIpB,CAAC;AAEF,eAAO,MAAM,OAAO,EAAE,KAIrB,CAAC;AAEF,eAAO,MAAM,KAAK,EAAE,KAInB,CAAC"}

package/dist/types/src/containers/NeighborhoodCompanion/NeighborhoodCompanion.d.ts

@@ -6,9 +6,8 @@ export type NeighborhoodCompanionProps = {
     /** The active node whose neighbourhood is rendered (passed as the companion subject). */
     subject: Obj.Any;
 };
-/**
- * Companion that renders the n-hop neighbourhood of the active node as an ego-centric radial graph,
- * with the active node at the centre. Depth (number of hops traversed) is adjustable in the toolbar.
- */
-export declare const NeighborhoodCompanion: ({ role, subject }: NeighborhoodCompanionProps) => React.JSX.Element | null;
+export declare function NeighborhoodCompanion({ role, subject }: NeighborhoodCompanionProps): React.JSX.Element | null;
+export declare namespace NeighborhoodCompanion {
+    var displayName: string;
+}
 //# sourceMappingURL=NeighborhoodCompanion.d.ts.map

package/dist/types/src/containers/NeighborhoodCompanion/NeighborhoodCompanion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"NeighborhoodCompanion.d.ts","sourceRoot":"","sources":["../../../../../src/containers/NeighborhoodCompanion/NeighborhoodCompanion.tsx"],"names":[],"mappings":"AAIA,OAAO,KAAgC,MAAM,OAAO,CAAC;AAErD,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAGjC,OAAO,uCAAuC,CAAC;AAS/C,MAAM,MAAM,0BAA0B,GAAG;IACvC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,yFAAyF;IACzF,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC;CAClB,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,qBAAqB,sBAAmC,0BAA0B,6BAyE9F,CAAC"}
+{"version":3,"file":"NeighborhoodCompanion.d.ts","sourceRoot":"","sources":["../../../../../src/containers/NeighborhoodCompanion/NeighborhoodCompanion.tsx"],"names":[],"mappings":"AAIA,OAAO,KAAgC,MAAM,OAAO,CAAC;AAErD,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAGjC,OAAO,uCAAuC,CAAC;AAS/C,MAAM,MAAM,0BAA0B,GAAG;IACvC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,yFAAyF;IACzF,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC;CAClB,CAAC;8CAMoC,EAAE,IAAgB,EAAE,OAAO,EAAE,EAAE,0BAA0B"}

package/dist/types/src/types/Graph.d.ts

@@ -4,7 +4,7 @@ declare const Graph_base: Type.ObjClass<Graph, {
     readonly view?: import("@dxos/echo/internal").Ref<View.View & import("@dxos/echo/Entity").OfKind<import("@dxos/echo/internal").EntityKind.Object> & Obj.Unknown> | undefined;
     readonly query: {
         readonly raw?: string | undefined;
-        readonly ast: QueryAST.QueryFilterClause | QueryAST.QueryFromClause | QueryAST.QueryHierarchyTraversalClause | QueryAST.QueryIncomingReferencesClause | QueryAST.QueryLimitClause | QueryAST.QueryOptionsClause | QueryAST.QueryOrderClause | QueryAST.QueryReferenceTraversalClause | QueryAST.QueryRelationClause | QueryAST.QueryRelationTraversalClause | QueryAST.QuerySelectClause | QueryAST.QuerySetDifferenceClause | QueryAST.QueryUnionClause;
+        readonly ast: QueryAST.QueryAggregateClause | QueryAST.QueryFilterClause | QueryAST.QueryFromClause | QueryAST.QueryHierarchyTraversalClause | QueryAST.QueryIncomingReferencesClause | QueryAST.QueryLimitClause | QueryAST.QueryOptionsClause | QueryAST.QueryOrderClause | QueryAST.QueryReferenceTraversalClause | QueryAST.QueryRelationClause | QueryAST.QueryRelationTraversalClause | QueryAST.QuerySelectClause | QueryAST.QuerySetDifferenceClause | QueryAST.QuerySkipClause | QueryAST.QueryUnionClause;
     };
 }, {}>;
 export declare class Graph extends Graph_base {