@dxos/app-graph 0.8.4-main.74a063c4e0 → 0.8.4-main.765dc60934

package/LICENSE

@@ -1,8 +1,105 @@
-MIT License 
-Copyright (c) 2022 DXOS
+# Functional Source License, Version 1.1, ALv2 Future License
 
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+## Abbreviation
 
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+FSL-1.1-Apache-2.0
 
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+## Notice
+
+Copyright 2026 DXOS
+
+## Terms and Conditions
+
+### Licensor ("We")
+
+The party offering the Software under these Terms and Conditions.
+
+### The Software
+
+The "Software" is each version of the software that we make available under
+these Terms and Conditions, as indicated by our inclusion of these Terms and
+Conditions with the Software.
+
+### License Grant
+
+Subject to your compliance with this License Grant and the Patents,
+Redistribution and Trademark clauses below, we hereby grant you the right to
+use, copy, modify, create derivative works, publicly perform, publicly display
+and redistribute the Software for any Permitted Purpose identified below.
+
+### Permitted Purpose
+
+A Permitted Purpose is any purpose other than a Competing Use. A Competing Use
+means making the Software available to others in a commercial product or
+service that:
+
+1. substitutes for the Software;
+
+2. substitutes for any other product or service we offer using the Software
+   that exists as of the date we make the Software available; or
+
+3. offers the same or substantially similar functionality as the Software.
+
+Permitted Purposes specifically include using the Software:
+
+1. for your internal use and access;
+
+2. for non-commercial education;
+
+3. for non-commercial research; and
+
+4. in connection with professional services that you provide to a licensee
+   using the Software in accordance with these Terms and Conditions.
+
+### Patents
+
+To the extent your use for a Permitted Purpose would necessarily infringe our
+patents, the license grant above includes a license under our patents. If you
+make a claim against any party that the Software infringes or contributes to
+the infringement of any patent, then your patent license to the Software ends
+immediately.
+
+### Redistribution
+
+The Terms and Conditions apply to all copies, modifications and derivatives of
+the Software.
+
+If you redistribute any copies, modifications or derivatives of the Software,
+you must include a copy of or a link to these Terms and Conditions and not
+remove any copyright notices provided in or with the Software.
+
+### Disclaimer
+
+THE SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTIES OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING WITHOUT LIMITATION WARRANTIES OF FITNESS FOR A PARTICULAR
+PURPOSE, MERCHANTABILITY, TITLE OR NON-INFRINGEMENT.
+
+IN NO EVENT WILL WE HAVE ANY LIABILITY TO YOU ARISING OUT OF OR RELATED TO THE
+SOFTWARE, INCLUDING INDIRECT, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES,
+EVEN IF WE HAVE BEEN INFORMED OF THEIR POSSIBILITY IN ADVANCE.
+
+### Trademarks
+
+Except for displaying the License Details and identifying us as the origin of
+the Software, you have no right under these Terms and Conditions to use our
+trademarks, trade names, service marks or product names.
+
+## Grant of Future License
+
+We hereby irrevocably grant you an additional license to use the Software under
+the Apache License, Version 2.0 that is effective on the second anniversary of
+the date we make the Software available. On or after that date, you may use the
+Software under the Apache License, Version 2.0, in which case the following
+will apply:
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this file except in compliance with the License.
+
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software distributed
+under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+CONDITIONS OF ANY KIND, either express or implied. See the License for the
+specific language governing permissions and limitations under the License.

package/README.md

@@ -10,4 +10,4 @@
 
 Your ideas, issues, and code are most welcome. Please take a look at our [community code of conduct](https://github.com/dxos/dxos/blob/main/CODE_OF_CONDUCT.md), the [issue guide](https://github.com/dxos/dxos/blob/main/CONTRIBUTING.md#submitting-issues), and the [PR contribution guide](https://github.com/dxos/dxos/blob/main/CONTRIBUTING.md#submitting-prs).
 
-License: [MIT](./LICENSE) Copyright 2023 © DXOS
+License: [FSL-1.1-Apache-2.0](./LICENSE) Copyright 2023 © DXOS

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

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": [],
+  "sourcesContent": [],
+  "mappings": "",
+  "names": []
+}

package/dist/lib/{browser/chunk-AKBGYELG.mjs → neutral/chunk-WJJ5KEOH.mjs}

@@ -1,8 +1,6 @@
-var __defProp = Object.defineProperty;
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
+import {
+  __export
+} from "./chunk-J5LGTIGS.mjs";
 
 // src/node.ts
 var node_exports = {};
@@ -61,8 +59,12 @@ var secondaryKey = (...parts) => parts.join(SECONDARY);
 var secondaryParts = (key) => key.split(SECONDARY);
 var normalizeRelation = (relation2) => relation2 == null ? childRelation() : typeof relation2 === "string" ? relation(relation2) : relation2;
 var shallowEqual = (a, b) => {
-  if (a === b) return true;
-  if (a == null || b == null || typeof a !== "object" || typeof b !== "object") return false;
+  if (a === b) {
+    return true;
+  }
+  if (a == null || b == null || typeof a !== "object" || typeof b !== "object") {
+    return false;
+  }
   const keysA = Object.keys(a);
   const keysB = Object.keys(b);
   if (keysA.length !== keysB.length) {
@@ -76,7 +78,7 @@ var nodeArgsUnchanged = (prev, next) => {
   }
   return prev.every((prevNode, idx) => {
     const nextNode = next[idx];
-    return prevNode.id === nextNode.id && prevNode.type === nextNode.type && shallowEqual(prevNode.data, nextNode.data) && shallowEqual(prevNode.properties, nextNode.properties);
+    return prevNode.id === nextNode.id && prevNode.type === nextNode.type && shallowEqual(prevNode.data, nextNode.data) && shallowEqual(prevNode.properties, nextNode.properties) && nodeArgsUnchanged(prevNode.nodes ?? [], nextNode.nodes ?? []);
   });
 };
 var qualifyId = (parentId, ...segmentIds) => [
@@ -84,15 +86,7 @@ var qualifyId = (parentId, ...segmentIds) => [
   ...segmentIds
 ].join(PATH);
 var validateSegmentId = (id) => {
-  invariant(!id.includes(PATH), `Node segment ID must not contain '${PATH}': ${id}`, {
-    F: __dxlog_file,
-    L: 78,
-    S: void 0,
-    A: [
-      "!id.includes(PATH)",
-      "`Node segment ID must not contain '${PATH}': ${id}`"
-    ]
-  });
+  invariant(!id.includes(PATH), `Node segment ID must not contain '${PATH}': ${id}`, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 56, S: void 0, A: ["!id.includes(PATH)", "`Node segment ID must not contain '${PATH}': ${id}`"] });
 };
 var getParentId = (qualifiedId) => {
   const lastSlash = qualifiedId.lastIndexOf(PATH);
@@ -147,15 +141,7 @@ var __dxlog_file2 = "/__w/dxos/dxos/packages/sdk/app-graph/src/graph.ts";
 var graphSymbol = /* @__PURE__ */ Symbol("graph");
 var getGraph = (node) => {
   const graph = node[graphSymbol];
-  invariant2(graph, "Node is not associated with a graph.", {
-    F: __dxlog_file2,
-    L: 33,
-    S: void 0,
-    A: [
-      "graph",
-      "'Node is not associated with a graph.'"
-    ]
-  });
+  invariant2(graph, "Node is not associated with a graph.", { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 21, S: void 0, A: ["graph", "'Node is not associated with a graph.'"] });
   return graph;
 };
 var GraphTypeId = /* @__PURE__ */ Symbol.for("@dxos/app-graph/Graph");
@@ -194,15 +180,7 @@ var GraphImpl = class {
   _nodeOrThrow = Atom.family((id) => {
     return Atom.make((get2) => {
       const node = get2(this._node(id));
-      invariant2(Option.isSome(node), `Node not available: ${id}`, {
-        F: __dxlog_file2,
-        L: 172,
-        S: this,
-        A: [
-          "Option.isSome(node)",
-          "`Node not available: ${id}`"
-        ]
-      });
+      invariant2(Option.isSome(node), `Node not available: ${id}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 67, S: this, A: ["Option.isSome(node)", "`Node not available: ${id}`"] });
       return node.value;
     });
   });
@@ -214,7 +192,8 @@ var GraphImpl = class {
   // TODO(wittjosiah): Atom feature request, support for something akin to `ComplexMap` to allow for complex arguments.
   _connections = Atom.family((key) => {
     return Atom.make((get2) => {
-      if (!key || primaryParts(key).length < 2) {
+      const parts = key ? primaryParts(key) : [];
+      if (parts.length < 2 || !parts[0]) {
         return [];
       }
       const { id, relation: relation2 } = relationFromConnectionKey(key);
@@ -372,15 +351,7 @@ function getConnections(graphOrId, idOrRelation, relation2) {
   } else {
     const graph = graphOrId;
     const id = idOrRelation;
-    invariant2(relation2 !== void 0, "Relation is required.", {
-      F: __dxlog_file2,
-      L: 446,
-      S: this,
-      A: [
-        "relation !== undefined",
-        "'Relation is required.'"
-      ]
-    });
+    invariant2(relation2 !== void 0, "Relation is required.", { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 272, S: this, A: ["relation !== undefined", "'Relation is required.'"] });
     const rel = relation2;
     return getConnectionsImpl(graph, id, rel);
   }
@@ -517,12 +488,7 @@ var initializeImpl = async (graph, id) => {
   log("initialize", {
     id,
     initialized
-  }, {
-    F: __dxlog_file2,
-    L: 668,
-    S: void 0,
-    C: (f, a) => f(...a)
-  });
+  }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 431, S: void 0 });
   if (!initialized) {
     Record.set(internal._initialized, id, true);
     await internal._onInitialize?.(id);
@@ -548,24 +514,14 @@ var expandImpl = (graph, id, relation2) => {
     log("expand", {
       key,
       deferred: true
-    }, {
-      F: __dxlog_file2,
-      L: 714,
-      S: void 0,
-      C: (f, a) => f(...a)
-    });
+    }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 463, S: void 0 });
     return graph;
   }
   const expanded = Record.get(internal._expanded, key).pipe(Option.getOrElse(() => false));
   log("expand", {
     key,
     expanded
-  }, {
-    F: __dxlog_file2,
-    L: 719,
-    S: void 0,
-    C: (f, a) => f(...a)
-  });
+  }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 470, S: void 0 });
   if (!expanded) {
     Record.set(internal._expanded, key, true);
     internal._onExpand?.(id, normalizedRelation);
@@ -580,15 +536,7 @@ function expand(graphOrId, idOrRelation, relation2) {
   } else {
     const graph = graphOrId;
     const id = idOrRelation;
-    invariant2(relation2 !== void 0, "Relation is required.", {
-      F: __dxlog_file2,
-      L: 755,
-      S: this,
-      A: [
-        "relation !== undefined",
-        "'Relation is required.'"
-      ]
-    });
+    invariant2(relation2 !== void 0, "Relation is required.", { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 490, S: this, A: ["relation !== undefined", "'Relation is required.'"] });
     const rel = relation2;
     return expandImpl(graph, id, rel);
   }
@@ -657,24 +605,14 @@ var addNodeImpl = (graph, nodeArg) => {
         typeChanged,
         dataChanged,
         propertiesChanged
-      }, {
-        F: __dxlog_file2,
-        L: 877,
-        S: void 0,
-        C: (f, a) => f(...a)
-      });
+      }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 565, S: void 0 });
       if (typeChanged || dataChanged || propertiesChanged) {
         log("updating node", {
           id,
           type,
           data,
           properties
-        }, {
-          F: __dxlog_file2,
-          L: 884,
-          S: void 0,
-          C: (f, a) => f(...a)
-        });
+        }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 572, S: void 0 });
         const newNode = Option.some({
           ...existing,
           ...rest,
@@ -698,12 +636,7 @@ var addNodeImpl = (graph, nodeArg) => {
         type,
         data,
         properties
-      }, {
-        F: __dxlog_file2,
-        L: 897,
-        S: void 0,
-        C: (f, a) => f(...a)
-      });
+      }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 596, S: void 0 });
       const newNode = internal._constructNode({
         id,
         type,
@@ -844,12 +777,7 @@ var addEdgeImpl = (graph, edgeArg) => {
       source: edgeArg.source,
       target: edgeArg.target,
       relation: relationId
-    }, {
-      F: __dxlog_file2,
-      L: 1080,
-      S: void 0,
-      C: (f, a) => f(...a)
-    });
+    }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 758, S: void 0 });
     internal._registry.set(sourceAtom, {
       ...source,
       [relationId]: [
@@ -866,12 +794,7 @@ var addEdgeImpl = (graph, edgeArg) => {
       source: edgeArg.source,
       target: edgeArg.target,
       relation: inverseId
-    }, {
-      F: __dxlog_file2,
-      L: 1088,
-      S: void 0,
-      C: (f, a) => f(...a)
-    });
+    }, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 775, S: void 0 });
     internal._registry.set(targetAtom, {
       ...target,
       [inverseId]: [
@@ -971,39 +894,15 @@ var relationKey = (relation2) => {
 };
 var relationFromKey = (encoded) => {
   const parts = secondaryParts(encoded);
-  invariant2(parts.length === 2 && parts[0].length > 0 && parts[1].length > 0, `Invalid relation key: ${encoded}`, {
-    F: __dxlog_file2,
-    L: 1233,
-    S: void 0,
-    A: [
-      "parts.length === 2 && parts[0].length > 0 && parts[1].length > 0",
-      "`Invalid relation key: ${encoded}`"
-    ]
-  });
+  invariant2(parts.length === 2 && parts[0].length > 0 && parts[1].length > 0, `Invalid relation key: ${encoded}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 894, S: void 0, A: ["parts.length === 2 && parts[0].length > 0 && parts[1].length > 0", "`Invalid relation key: ${encoded}`"] });
   const [kind, directionRaw] = parts;
-  invariant2(directionRaw === "outbound" || directionRaw === "inbound", `Invalid relation direction: ${directionRaw}`, {
-    F: __dxlog_file2,
-    L: 1235,
-    S: void 0,
-    A: [
-      "directionRaw === 'outbound' || directionRaw === 'inbound'",
-      "`Invalid relation direction: ${directionRaw}`"
-    ]
-  });
+  invariant2(directionRaw === "outbound" || directionRaw === "inbound", `Invalid relation direction: ${directionRaw}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 896, S: void 0, A: ["directionRaw === 'outbound' || directionRaw === 'inbound'", "`Invalid relation direction: ${directionRaw}`"] });
   return relation(kind, directionRaw);
 };
 var connectionKey = (id, relation2) => primaryKey(id, relationKey(relation2));
 var relationFromConnectionKey = (key) => {
   const [id, encodedRelation] = primaryParts(key);
-  invariant2(id && encodedRelation, `Invalid connection key: ${key}`, {
-    F: __dxlog_file2,
-    L: 1243,
-    S: void 0,
-    A: [
-      "id && encodedRelation",
-      "`Invalid connection key: ${key}`"
-    ]
-  });
+  invariant2(id && encodedRelation, `Invalid connection key: ${key}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 902, S: void 0, A: ["id && encodedRelation", "`Invalid connection key: ${key}`"] });
   return {
     id,
     relation: relationFromKey(encodedRelation)
@@ -1085,9 +984,9 @@ import * as Function2 from "effect/Function";
 import * as Option3 from "effect/Option";
 import * as Pipeable2 from "effect/Pipeable";
 import * as Record2 from "effect/Record";
-import { scheduleTask, yieldOrContinue } from "main-thread-scheduling";
 import { log as log2 } from "@dxos/log";
 import { byPosition, getDebugName, isNonNullable as isNonNullable2 } from "@dxos/util";
+import { scheduleTask, yieldOrContinue } from "#scheduler";
 var __dxlog_file3 = "/__w/dxos/dxos/packages/sdk/app-graph/src/graph-builder.ts";
 var GraphBuilderTypeId = /* @__PURE__ */ Symbol.for("@dxos/app-graph/GraphBuilder");
 var GraphBuilderImpl = class {
@@ -1102,6 +1001,8 @@ var GraphBuilderImpl = class {
   _dirtyConnectors = /* @__PURE__ */ new Map();
   /** Last-flushed node IDs per connector key, used for edge removal on update. */
   _connectorPrevious = /* @__PURE__ */ new Map();
+  /** All inline-descendant IDs per connector key, used to remove stale inline nodes on update. */
+  _connectorPreviousInlineIds = /* @__PURE__ */ new Map();
   /** Last-flushed node args per connector key, used for change detection. */
   _connectorPreviousArgs = /* @__PURE__ */ new Map();
   /** Whether a dirty-flush task is already scheduled. */
@@ -1140,6 +1041,11 @@ var GraphBuilderImpl = class {
     const removed = previous.filter((pid) => !ids.includes(pid));
     this._connectorPrevious.set(key, ids);
     this._connectorPreviousArgs.set(key, nodes);
+    const currentInlineIds = collectAllInlineIds(nodes);
+    const previousInlineIds = this._connectorPreviousInlineIds.get(key) ?? [];
+    const staleInlineIds = previousInlineIds.filter((pid) => !currentInlineIds.includes(pid));
+    this._connectorPreviousInlineIds.set(key, currentInlineIds);
+    removeNodes(this._graph, staleInlineIds, true);
     removeEdges(this._graph, removed.map((target) => ({
       source: id,
       target,
@@ -1206,12 +1112,7 @@ var GraphBuilderImpl = class {
       id,
       relation: relation2,
       registry: getDebugName(this._registry)
-    }, {
-      F: __dxlog_file3,
-      L: 269,
-      S: this,
-      C: (f, a) => f(...a)
-    });
+    }, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 136, S: this });
     this._expandRelation(id, relation2);
     if (relation2.kind === "child" && relation2.direction === "outbound") {
       expand(this._graph, id, "action");
@@ -1234,12 +1135,7 @@ var GraphBuilderImpl = class {
         id,
         relation: relation2,
         ids
-      }, {
-        F: __dxlog_file3,
-        L: 296,
-        S: this,
-        C: (f, a) => f(...a)
-      });
+      }, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 160, S: this });
       this._dirtyConnectors.set(key, {
         nodes,
         previous
@@ -1253,12 +1149,7 @@ var GraphBuilderImpl = class {
   async _onInitialize(id) {
     log2("onInitialize", {
       id
-    }, {
-      F: __dxlog_file3,
-      L: 307,
-      S: this,
-      C: (f, a) => f(...a)
-    });
+    }, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 176, S: this });
     const resolver = this._resolvers(id);
     const cancel = this._registry.subscribe(resolver, (node) => {
       const trigger = this._initialized[id];
@@ -1441,12 +1332,7 @@ var createExtensionRaw = (extension) => {
             id: getId("connector"),
             node,
             error
-          }, {
-            F: __dxlog_file3,
-            L: 609,
-            S: void 0,
-            C: (f, a) => f(...a)
-          });
+          }, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 383, S: void 0 });
           return [];
         }
       }).pipe(Atom2.withLabel(`graph-builder:connector:${id}`)))
@@ -1467,12 +1353,7 @@ var createExtensionRaw = (extension) => {
             id: getId("actionGroups"),
             node,
             error
-          }, {
-            F: __dxlog_file3,
-            L: 630,
-            S: void 0,
-            C: (f, a) => f(...a)
-          });
+          }, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 404, S: void 0 });
           return [];
         }
       }).pipe(Atom2.withLabel(`graph-builder:connector:actionGroups:${id}`)))
@@ -1492,12 +1373,7 @@ var createExtensionRaw = (extension) => {
             id: getId("actions"),
             node,
             error
-          }, {
-            F: __dxlog_file3,
-            L: 647,
-            S: void 0,
-            C: (f, a) => f(...a)
-          });
+          }, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 424, S: void 0 });
           return [];
         }
       }).pipe(Atom2.withLabel(`graph-builder:connector:actions:${id}`)))
@@ -1509,12 +1385,7 @@ var runEffectSyncWithFallback = (effect, context2, extensionId, fallback) => {
     log2.warn("Extension failed", {
       extension: extensionId,
       error
-    }, {
-      F: __dxlog_file3,
-      L: 690,
-      S: void 0,
-      C: (f, a) => f(...a)
-    });
+    }, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 441, S: void 0 });
     return Effect.succeed(fallback);
   })));
 };
@@ -1562,6 +1433,10 @@ var qualifyNodeArgs = (parentId) => (nodes) => nodes.map((node) => {
     nodes: node.nodes ? qualifyNodeArgs(qualified)(node.nodes) : void 0
   };
 });
+var collectAllInlineIds = (nodes) => nodes.flatMap((node) => node.nodes ? [
+  ...node.nodes.map((child) => child.id),
+  ...collectAllInlineIds(node.nodes)
+] : []);
 var connectorKey = (id, relation2) => primaryKey(id, relationKey(relation2));
 var relationFromConnectorKey = (key) => {
   const [id, encodedRelation] = primaryParts(key);
@@ -1586,7 +1461,6 @@ var flattenExtensions = (extension, acc = []) => {
 };
 
 export {
-  __export,
   node_exports,
   qualifyId,
   getParentId,
@@ -1600,4 +1474,4 @@ export {
   flush,
   graph_builder_exports
 };
-//# sourceMappingURL=chunk-AKBGYELG.mjs.map
+//# sourceMappingURL=chunk-WJJ5KEOH.mjs.map