@dxos/plugin-explorer 0.9.0 → 0.9.1-staging.ee54ba693a

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/components/Tree/types/tree.ts", "../../../src/components/Tree/types/types.ts"],
+  "sourcesContent": ["//\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 class TreeType extends Type.makeObject<TreeType>(DXN.make('org.dxos.type.tree', '0.1.0'))(\n  Schema.Struct({\n    root: Key.EntityId,\n    nodes: Schema.mutable(Schema.Record({ key: Key.EntityId, value: TreeNodeType })),\n  }),\n) {}\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", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Key } from '@dxos/echo';\nimport { type TreeNode } from '@dxos/react-ui-graph';\n\nimport { type TreeType } from './tree';\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"],
+  "mappings": ";AAIA,YAAYA,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,gBAAAA,IAAAA,IAAiBT,WAAKU,OAAyBC,CAAAA;QAE9CC,cAAQ;AAClBC,IAAOlB,WAAPkB,cAAsBlB,KAAOmB,WAAO,IAAA,KAAA,sBAAA,OAAA,CAAA,EAAA,cAAA;QAAEC,IAAKlB;SAAqBmB,eAAAA,cAAAA;IAAa,KAAA,IAAA;IAC/E,OAAA;EACC,CAAA,CAAA;AAEH,CAAA,CAAA,EAAA;;AAKI,IAAMC,OAAN,MAAMA,MAAKpB;SACX,SAAWc,MAAKF;UACdS,KAAMD,IAAAA,SAAAA,OAAAA;WACNJ,IAAO,KAAA,UAAA;YACJI;;cAECd;UACAC;oBAAc,CAAA;UAAG,MAAA;YACnB,MAAA;UACF;QACF;MACA;IAEMe,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;;UAEEzB,IAAAA;AACA,UAAA,OAAOqB,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,MAAEzB;mBACGyB,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,SAAO3B,GAAAA;AAE3B,iBAAA,KAAA,QAAA,OAAA,SAA6B,MAAA,CAAA,CAAA;eAC7B;AAEJ,iBAAA,KAAA,QAAA,QAAA,KAAA;QACF;MACF;IAEA;;;;;cAKQ6B,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;;;;;oBAKehC,MAASiC;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;;;;;;;UAQOpB;AACLL,UAAIwC,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,QAAMD,MAASL,OAAQ;QACvBW,CAAAA,MAAO;YAAEN,KAAAA,IAAAA,SAAAA,OAAAA;aAAId;QAAcC;kBAAc,CAAA;QAAG,MAAA;UAAK,MAAA;QACnD;MAEA;IACAN;UACEyC,YAAUC;QACVV,OAAO3B,KAAAA,OAASsC,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,MAAO3B,KAAAA,EAASwC;IAC5B,CAAA;UACE7C,MAAIwC,OAAW,SAAQ,UAAA,CAAA,UAAA,UAAA,EAAA;gBACrBR,IAAO3B;AACT,UAAA,OAAA,KAAA,OAAA,MAAA;AACF,eAAA,SAAA,OAAA,KAAA,CAAA;MAEA,CAAA;IACF;AAEA,WAAA;;;;;WAKED,MAAU0C,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;IACNhD;UACEyB,QAAKpB,KAASsC,SAAOI,IAAM;QAC3BtB,OAAKpB,KAAAA,OAASsC,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;IACAhC;UACEgC,WAAO3B,KAASsC,QAAOT,OAAK,SAAA,MAAA,CAAA,CAAA;QAC5BG,OAAAA,KAAShC,OAAS4C,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;AAEAhC,UAAIwC,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,YAAShD,KAASsC,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;IACjDzB,CAAAA;AAEA,QAAA,OAAA,KAAA,OAAA,MAAA;AACF,WAAA,SAAA,KAAA,GAAA,IAAA;IACF,CAAA;;;;;AC/RO,IAAMuD,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;",
+  "names": ["Schema", "DXN", "Key", "Obj", "Ref", "Type", "TestSchema", "invariant", "children", "data", "String", "ref", "optional", "pipe", "TreeType", "makeObject", "make", "EntityId", "nodes", "Record", "key", "TreeNodeType", "id", "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", "treeTypeToTreeNode", "tree", "rootId", "root", "visited", "Set", "node", "nodes", "undefined", "has", "id", "label", "labelOf", "data", "add", "children", "map", "childId", "filter", "c", "Boolean", "text"]
+}

package/dist/lib/neutral/{chunk-YBCHBVCJ.mjs → chunk-TTFPTHAQ.mjs}

@@ -32,12 +32,12 @@ __export(Graph_exports, {
   make: () => make
 });
 import * as Schema2 from "effect/Schema";
-import { DXN, Annotation, Filter, Obj, Query, QueryAST, Ref, Type, View } from "@dxos/echo";
+import { Annotation, DXN, Filter, Obj, Query, QueryAST, Ref, Type, View } from "@dxos/echo";
 import { FormInputAnnotation, LabelAnnotation } from "@dxos/echo/Annotation";
 import { ViewAnnotation } from "@dxos/schema";
-var GraphSchema = Schema2.Struct({
+var Graph = class extends Type.makeObject(DXN.make("org.dxos.type.graph", "0.1.0"))(Schema2.Struct({
   name: Schema2.optional(Schema2.String),
-  view: Ref.Ref(View.View).pipe(FormInputAnnotation.set(false)),
+  view: Ref.Ref(View.View).pipe(FormInputAnnotation.set(false), Schema2.optional),
   query: Schema2.Struct({
     raw: Schema2.optional(Schema2.String),
     ast: QueryAST.Query
@@ -49,15 +49,15 @@ var GraphSchema = Schema2.Struct({
 ]), 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 }) => {
+}, view } = {}) => {
   return Obj.make(Graph, {
     name,
-    view: Ref.make(view),
+    view: view && Ref.make(view),
     query
   });
 };
@@ -66,4 +66,4 @@ export {
   ExplorerAction_exports,
   Graph_exports
 };
-//# sourceMappingURL=chunk-YBCHBVCJ.mjs.map
+//# sourceMappingURL=chunk-TTFPTHAQ.mjs.map

package/dist/lib/neutral/chunk-TTFPTHAQ.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 { Annotation, DXN, Filter, Obj, Query, QueryAST, Ref, Type, View } from '@dxos/echo';\nimport { FormInputAnnotation, LabelAnnotation } from '@dxos/echo/Annotation';\nimport { ViewAnnotation } from '@dxos/schema';\n\nexport class Graph extends Type.makeObject<Graph>(DXN.make('org.dxos.type.graph', '0.1.0'))(\n  Schema.Struct({\n    name: Schema.optional(Schema.String),\n    view: Ref.Ref(View.View).pipe(FormInputAnnotation.set(false), Schema.optional),\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  ),\n) {}\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: 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,YAAYC,KAAKC,QAAQC,KAAKC,OAAOC,UAAUC,KAAKC,MAAMC,YAAY;AAC/E,SAASC,qBAAqBC,uBAAuB;AACrD,SAASC,sBAAsB;AAExB,IAAMC,QAAN,cAAoBL,KAAKM,WAAkBZ,IAAIa,KAAK,uBAAuB,OAAA,CAAA,EACzEC,eAAO;EACZC,MAAaC,iBAAgBC,cAAM;EACnCC,MAAMb,IAAIA,IAAIE,KAAKA,IAAI,EAAEY,KAAKX,oBAAoBY,IAAI,KAAA,GAAeJ,gBAAQ;EAC7EK,OAAcP,eAAO;IACnBQ,KAAYN,iBAAgBC,cAAM;IAClCM,KAAKnB,SAASD;EAChB,CAAA,EAAGgB,KAAKX,oBAAoBY,IAAI,KAAA,CAAA;AAClC,CAAA,EAAGD,KACDV,gBAAgBW,IAAI;EAAC;CAAO,GAC5BV,eAAeU,IAAI;EAAC;CAAO,GAC3BrB,WAAWyB,eAAeJ,IAAI;EAAEK,MAAM;EAAsBC,KAAK;AAAQ,CAAA,CAAA,CAAA,EAAA;AAE1E;AASI,IAAMb,OAAO,CAAC,EACnBE,MACAM,QAAQ;EAAEC,KAAK;EAAIC,KAAKpB,MAAMwB,OAAO1B,OAAO2B,QAAO,CAAA,EAAIL;AAAI,GAC3DL,KAAI,IACS,CAAC,MAAC;AACf,SAAOhB,IAAIW,KAAKF,OAAO;IAAEI;IAAMG,MAAMA,QAAQb,IAAIQ,KAAKK,IAAAA;IAAOG;EAAM,CAAA;AACrE;",
+  "names": ["Schema", "TypeInputOptionsAnnotation", "GraphProps", "Struct", "name", "optional", "String", "typename", "pipe", "annotations", "title", "set", "location", "kind", "Schema", "Annotation", "DXN", "Filter", "Obj", "Query", "QueryAST", "Ref", "Type", "View", "FormInputAnnotation", "LabelAnnotation", "ViewAnnotation", "Graph", "makeObject", "make", "Struct", "name", "optional", "String", "view", "pipe", "set", "query", "raw", "ast", "IconAnnotation", "icon", "hue", "select", "nothing"]
+}