@endo/compartment-mapper 2.0.0 → 2.1.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@endo/compartment-mapper",
-  "version": "2.0.0",
+  "version": "2.1.0",
   "description": "The compartment mapper assembles Node applications in a sandbox",
   "keywords": [
     "node",
@@ -49,31 +49,41 @@
   },
   "scripts": {
     "build": "exit 0",
-    "prepack": "tsc --build tsconfig.build.json",
-    "postpack": "git clean -fX \"*.d.ts*\" \"*.d.cts*\" \"*.d.mts*\" \"*.tsbuildinfo\"",
+    "prepack": "git clean -fX -e node_modules/ && tsc --build tsconfig.build.json",
+    "postpack": "git clean -fX -e node_modules/",
     "cover": "c8 ava --config test/_ava-ses.config.js",
     "lint": "yarn lint:types && yarn lint:eslint",
     "lint-fix": "eslint --fix .",
     "lint:eslint": "eslint .",
     "lint:types": "tsc",
     "prettier-fixtures": "prettier --write --with-node-modules './test/fixtures-*/**/*.*js'",
-    "test": "ava"
+    "test": "ses-ava"
   },
   "dependencies": {
     "@endo/cjs-module-analyzer": "^1.0.11",
-    "@endo/module-source": "^1.4.0",
+    "@endo/module-source": "^1.4.1",
     "@endo/path-compare": "^1.1.0",
     "@endo/trampoline": "^1.0.5",
     "@endo/zip": "^1.1.0",
-    "ses": "^1.15.0"
+    "ses": "^2.0.0"
   },
   "devDependencies": {
     "@endo/env-options": "^1.1.11",
+    "@endo/evasive-transform": "^2.1.0",
+    "@endo/eventual-send": "^1.5.0",
     "@endo/init": "^1.1.13",
+    "@endo/ses-ava": "^1.4.1",
     "ava": "catalog:dev",
+    "babel-eslint": "^10.1.0",
     "c8": "catalog:dev",
     "eslint": "catalog:dev",
-    "typescript": "~5.9.2"
+    "eslint-config-airbnb-base": "^15.0.0",
+    "eslint-config-prettier": "^9.1.0",
+    "eslint-plugin-eslint-comments": "^3.2.0",
+    "eslint-plugin-import": "^2.31.0",
+    "prettier": "^3.5.3",
+    "ses": "workspace:^",
+    "typescript": "catalog:dev"
   },
   "files": [
     "./*.d.ts",
@@ -108,12 +118,16 @@
   },
   "ava": {
     "files": [
-      "test/**/*.test.*"
+      "test/**/*.test.*",
+      "!test/**/*.node-condition.test.*"
     ],
     "timeout": "2m"
   },
+  "sesAvaConfigs": {
+    "node-condition": "test/_ava-node-condition.config.js"
+  },
   "typeCoverage": {
     "atLeast": 86.14
   },
-  "gitHead": "f91329e8616a19f131d009356a5f11ef11c839cc"
+  "gitHead": "e74ed050e9d1122d692b00ee14971299c6afbf30"
 }

package/src/archive-lite.js

@@ -255,7 +255,7 @@ const digestFromMap = async (powers, compartmentMap, options = {}) => {
 
   const archiveCompartmentMapText = JSON.stringify(
     archiveCompartmentMap,
-    null,
+    (key, value) => (key.startsWith('_') ? undefined : value),
     2,
   );
   const archiveCompartmentMapBytes = textEncoder.encode(
@@ -274,7 +274,7 @@ const digestFromMap = async (powers, compartmentMap, options = {}) => {
   return {
     compartmentMapBytes: archiveCompartmentMapBytes,
     sources: archiveSources,
-    sha512: archiveSha512,
+    ...(archiveSha512 !== undefined && { sha512: archiveSha512 }),
   };
 };
 
@@ -300,7 +300,7 @@ export const makeAndHashArchiveFromMap = async (
   await addSourcesToArchive(archive, sources);
   const bytes = await archive.snapshot();
 
-  return { bytes, sha512 };
+  return { bytes, ...(sha512 !== undefined && { sha512 }) };
 };
 
 /**

package/src/capture-lite.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"capture-lite.d.ts","sourceRoot":"","sources":["capture-lite.js"],"names":[],"mappings":"AAmQO,2CALI,MAAM,GAAG,UAAU,kBACnB,+BAA+B,YAC/B,kBAAkB,GAChB,OAAO,CAAC,aAAa,CAAC,CAsFlC;4BA1SS,YAAY;gCAAZ,YAAY;qDAAZ,YAAY;wCAAZ,YAAY;mCAAZ,YAAY"}
+{"version":3,"file":"capture-lite.d.ts","sourceRoot":"","sources":["capture-lite.js"],"names":[],"mappings":"AA2RO,2CALI,MAAM,GAAG,UAAU,kBACnB,+BAA+B,YAC/B,kBAAkB,GAChB,OAAO,CAAC,aAAa,CAAC,CAwFlC;4BApUS,YAAY;gCAAZ,YAAY;qDAAZ,YAAY;wCAAZ,YAAY;mCAAZ,YAAY"}

package/src/capture-lite.js

@@ -112,7 +112,12 @@ const captureCompartmentMap = (
 const makePreloader = (
   compartmentMap,
   sources,
-  { log = noop, policy, _preload: preload = [] } = {},
+  {
+    log = noop,
+    policy,
+    _preload: preload = [],
+    _redundantPreloadHook: redundantPreloadHook = undefined,
+  } = {},
 ) => {
   const {
     entry: { module: entryModuleSpecifier },
@@ -173,10 +178,29 @@ const makePreloader = (
 
         const compartmentSources = sources[compartmentName];
 
-        if (keys(compartmentSources).length) {
+        // The default preload entry is the entry module as defined by the
+        // package itself. This corresponds to the `ModuleConfiguration` of `.`
+        // in the `CompartmentDescriptor`'s `modules` object. Since the key in
+        // `compartmentSources` is presumably a resolved relative path, we don't
+        // actually know which key to look for! Thus, we are assuming that the
+        // `Compartment`'s entry module has been loaded if _any_ sources are
+        // present.
+        const entryIsLoaded =
+          entry === DEFAULT_PRELOAD_ENTRY
+            ? keys(compartmentSources).length > 0
+            : entry in compartmentSources;
+
+        if (entryIsLoaded) {
           log(
-            `Refusing to preload Compartment ${q(canonicalName)}; already loaded`,
+            `Refusing to preload Compartment ${q(canonicalName)} entry ${q(entry)}; already loaded`,
           );
+          if (redundantPreloadHook) {
+            redundantPreloadHook({
+              canonicalName,
+              entry,
+              log,
+            });
+          }
         } else {
           const compartment = compartments[compartmentName];
           if (!compartment) {
@@ -274,6 +298,7 @@ export const captureFromMap = async (
     Compartment: CompartmentOption = DefaultCompartment,
     log = noop,
     _preload: preload = [],
+    _redundantPreloadHook: redundantPreloadHook = undefined,
     packageConnectionsHook,
     moduleSourceHook,
   } = options;
@@ -295,6 +320,7 @@ export const captureFromMap = async (
     log,
     policy,
     _preload: preload,
+    _redundantPreloadHook: redundantPreloadHook,
   });
 
   const consolidatedExitModuleImportHook = exitModuleImportHookMaker({

package/src/compartment-map.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compartment-map.d.ts","sourceRoot":"","sources":["compartment-map.js"],"names":[],"mappings":"AAyCA,+CAA+C;AAE/C,4BAFW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAE2B;AA40B/D,gEAJI,OAAO,QACP,MAAM,GACJ,QAAQ,qBAAqB,IAAI,4BAA4B,CASzE;AAQM,0EAJI,OAAO,QACP,MAAM,GACJ,QAAQ,mBAAmB,IAAI,MAAM,CAAC,MAAM,EAAE,6BAA6B,CAAC,CAUxF;AAQM,oEAJI,OAAO,QACP,MAAM,GACJ,QAAQ,qBAAqB,IAAI,gCAAgC,CAS7E;AAOM,mEAJI,OAAO,QACP,MAAM,GACJ,QAAQ,qBAAqB,IAAI,+BAA+B,CAS5E;qBApca,CAAC,aACF,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI;kDA1c1B,YAAY;mDAAZ,YAAY;sDAAZ,YAAY;qDAAZ,YAAY"}
+{"version":3,"file":"compartment-map.d.ts","sourceRoot":"","sources":["compartment-map.js"],"names":[],"mappings":"AAyCA,+CAA+C;AAE/C,4BAFW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAE2B;AA60B/D,gEAJI,OAAO,QACP,MAAM,GACJ,QAAQ,qBAAqB,IAAI,4BAA4B,CASzE;AAQM,0EAJI,OAAO,QACP,MAAM,GACJ,QAAQ,mBAAmB,IAAI,MAAM,CAAC,MAAM,EAAE,6BAA6B,CAAC,CAUxF;AAQM,oEAJI,OAAO,QACP,MAAM,GACJ,QAAQ,qBAAqB,IAAI,gCAAgC,CAS7E;AAOM,mEAJI,OAAO,QACP,MAAM,GACJ,QAAQ,qBAAqB,IAAI,+BAA+B,CAS5E;qBApca,CAAC,aACF,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI;kDA3c1B,YAAY;mDAAZ,YAAY;sDAAZ,YAAY;qDAAZ,YAAY"}

package/src/compartment-map.js

@@ -177,12 +177,13 @@ const assertConditions = (conditions, url) => {
  */
 const getModuleConfigurationSpecificProperties = allegedModule => {
   const {
-    __createdBy: _createdBy,
     retained: _retained,
     deferredError: _deferredError,
     ...other
   } = allegedModule;
-  return other;
+  return /** @type {Omit<T, keyof BaseModuleConfiguration>} */ (
+    Object.fromEntries(entries(other).filter(([key]) => !key.startsWith('_')))
+  );
 };
 
 /**

package/src/digest.js

@@ -178,7 +178,7 @@ const translateCompartmentMap = (
             modules[name] = {
               location,
               parser,
-              sha512,
+              ...(sha512 !== undefined && { sha512 }),
               __createdBy: 'digest',
             };
           } else if (isExitModuleSource(source)) {

package/src/generic-graph.d.ts

@@ -1,11 +1,10 @@
 /**
- * @template [T=string] The type of nodes in the graph
+ * A generic graph implementation.
  *
- * A generic graph implementation with edge weights.
- *
- * Edge weights are assumed to be non-negative numbers (including `Infinity`)
+ * @template {GenericGraphNode} [T=string] The type of nodes in the graph. If
+ * `T` is not a string, relative paths will be compared by coercion to strings.
  */
-export class GenericGraph<T = string> {
+export class GenericGraph<T extends GenericGraphNode = string> {
     /**
      * Returns a shallow copy of the `Set` of nodes in the graph.
      */
@@ -31,23 +30,6 @@ export class GenericGraph<T = string> {
      * @returns {Set<T>|undefined}
      */
     adjacent(node: T): Set<T> | undefined;
-    /**
-     * Sets the weight of the given edge between `source` and `target`.
-     *
-     * @param {T} source Source node
-     * @param {T} target Target node
-     * @param {number} weight New edge weight
-     * @returns {this}
-     */
-    setEdgeWeight(source: T, target: T, weight: number): this;
-    /**
-     * Gets the weight of the given edge between `source` and `target`.
-     *
-     * @param {T} source Source node
-     * @param {T} target Target node
-     * @returns {number} Edge weight from source to target
-     */
-    getEdgeWeight(source: T, target: T): number;
     /**
      * Adds an edge from the `source` node to `target` node.
      *
@@ -58,10 +40,9 @@ export class GenericGraph<T = string> {
      *
      * @param {T} source Source node
      * @param {T} target Target node
-     * @param {number} weight Edge weight from source to target
      * @returns {this} This graph instance
      */
-    addEdge(source: T, target: T, weight: number): this;
+    addEdge(source: T, target: T): this;
     /**
      * Removes the edge from the `source` node to `target` node.
      * Does not remove the nodes themselves.
@@ -80,5 +61,6 @@ export class GenericGraph<T = string> {
     hasEdge(source: T, target: T): boolean;
     #private;
 }
-export function makeShortestPath<T = string>(graph: GenericGraph<T>): (source: NoInfer<T>, target: NoInfer<T>) => [T, T, ...T[]];
+export function makeShortestPath<T extends GenericGraphNode = string>(graph: GenericGraph<T>): (source: NoInfer<T>, target: NoInfer<T>) => [T, T, ...T[]];
+import type { GenericGraphNode } from './types/generic-graph.js';
 //# sourceMappingURL=generic-graph.d.ts.map

package/src/generic-graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generic-graph.d.ts","sourceRoot":"","sources":["generic-graph.js"],"names":[],"mappings":"AAyHA;;;;;;GAMG;AACH,0BANc,CAAC;IA+Bb;;OAEG;IACH,oBAEC;IAED;;;;;;OAMG;IACH,cAHW,CAAC,GACC,IAAI,CAUhB;IAED;;;;;OAKG;IACH,iBAHW,CAAC,GACC,IAAI,CAShB;IAED;;;;OAIG;IACH,eAHW,CAAC,GACC,GAAG,CAAC,CAAC,CAAC,GAAC,SAAS,CAI5B;IAED;;;;;;;OAOG;IACH,sBALW,CAAC,UACD,CAAC,UACD,MAAM,GACJ,IAAI,CAWhB;IAED;;;;;;OAMG;IACH,sBAJW,CAAC,UACD,CAAC,GACC,MAAM,CAUlB;IAED;;;;;;;;;;;;OAYG;IACH,gBALW,CAAC,UACD,CAAC,UACD,MAAM,GACJ,IAAI,CAWhB;IAED;;;;;;;OAOG;IACH,mBAJW,CAAC,UACD,CAAC,GACC,IAAI,CAKhB;IAED;;;;;OAKG;IACH,gBAJW,CAAC,UACD,CAAC,GACC,OAAO,CAInB;;CACF;AA6DM,iCAHO,CAAC,kBACJ,YAAY,CAAC,CAAC,CAAC,YAIb,OAAO,CAAC,CAAC,CAAC,UACV,OAAO,CAAC,CAAC,CAAC,KACR,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAO5B"}
+{"version":3,"file":"generic-graph.d.ts","sourceRoot":"","sources":["generic-graph.js"],"names":[],"mappings":"AAsIA;;;;;GAKG;AACH,0BAHiC,CAAC,SAArB,gBAAkB;IAsB7B;;OAEG;IACH,oBAEC;IAED;;;;;;OAMG;IACH,cAHW,CAAC,GACC,IAAI,CAUhB;IAED;;;;;OAKG;IACH,iBAHW,CAAC,GACC,IAAI,CAShB;IAED;;;;OAIG;IACH,eAHW,CAAC,GACC,GAAG,CAAC,CAAC,CAAC,GAAC,SAAS,CAI5B;IAED;;;;;;;;;;;OAWG;IACH,gBAJW,CAAC,UACD,CAAC,GACC,IAAI,CAUhB;IAED;;;;;;;OAOG;IACH,mBAJW,CAAC,UACD,CAAC,GACC,IAAI,CAKhB;IAED;;;;;OAKG;IACH,gBAJW,CAAC,UACD,CAAC,GACC,OAAO,CAInB;;CACF;AAwDM,iCAH0B,CAAC,SAArB,gBAAkB,kBACpB,YAAY,CAAC,CAAC,CAAC,YAOb,OAAO,CAAC,CAAC,CAAC,UACV,OAAO,CAAC,CAAC,CAAC,KACR,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAW5B;sCAvToD,0BAA0B"}

package/src/generic-graph.js

@@ -9,31 +9,49 @@
  * @module
  */
 
+import { pathCompare } from '@endo/path-compare';
+
 /**
- * @import {TraversalContext} from './types/generic-graph.js';
+ * @import {GenericGraphNode, TraversalContext} from './types/generic-graph.js';
  */
 
 const { quote: q } = assert;
 
+/**
+ * Returns `true` if the cost of path `a` is less than the cost of path `b`.
+ *
+ * @template {GenericGraphNode} [T=string]
+ * @param {T[]} [pathA]
+ * @param {T[]} [pathB]
+ * @returns {boolean}
+ */
+const isLowerCost = (pathA, pathB) =>
+  pathCompare(pathA?.map(String), pathB?.map(String)) < 0;
+
 /**
  * Remove the node with the minimum weight from the priority queue.
  *
  * Performs linear search.
- * @template [T=string]
+ *
+ * @template {GenericGraphNode} [T=string]
  * @param {TraversalContext<T>} tracks
  * @returns {T|undefined}
  */
-const extractMin = ({ distances, queue }) => {
-  let min = Infinity;
+const extractMin = ({ paths, queue }) => {
+  /** @type {T[]|undefined} */
+  let minPath;
 
   /** @type {T|undefined} */
   let minNode;
 
   queue.forEach(node => {
-    const nodeWeight = distances.get(node) ?? Infinity;
+    const path = paths.get(node);
+    if (!path) {
+      return;
+    }
 
-    if (nodeWeight < min) {
-      min = nodeWeight;
+    if (!minPath || isLowerCost(path, minPath)) {
+      minPath = path;
       minNode = node;
     }
   });
@@ -48,32 +66,23 @@ const extractMin = ({ distances, queue }) => {
 };
 
 /**
- * Update context with the new distance to the target node if the distance
- * through the source node is shorter than the current distance.
+ * Update context to include the current lowest-cost path to a target node
+ * reachable by a single edge from a source node.
  *
- * @template [T=string]
- * @param {GenericGraph<T>} graph
- * @param {TraversalContext<NoInfer<T>>} context
+ * @template {GenericGraphNode} [T=string]
+ * @param {TraversalContext<T>} context
  * @param {NoInfer<T>} source
  * @param {NoInfer<T>} target
  */
-const relax = (graph, { distances, predecessors }, source, target) => {
-  const number = graph.getEdgeWeight(source, target);
-
-  const distanceSource = distances.get(source);
-  const distanceTarget = distances.get(target);
+const relax = ({ paths, predecessors }, source, target) => {
+  const pathSource = paths.get(source);
+  assert(pathSource, `Missing path to source ${q(source)}`);
 
-  assert(
-    distanceSource !== undefined,
-    `Missing distance for source ${q(source)}`,
-  );
-  assert(
-    distanceTarget !== undefined,
-    `Missing distance for target ${q(target)} target`,
-  );
+  const pathTarget = paths.get(target);
+  const newPath = [...pathSource, target];
 
-  if (distanceTarget > distanceSource + number) {
-    distances.set(target, distanceSource + number);
+  if (!pathTarget || isLowerCost(newPath, pathTarget)) {
+    paths.set(target, newPath);
     predecessors.set(target, source);
   }
 };
@@ -82,7 +91,7 @@ const relax = (graph, { distances, predecessors }, source, target) => {
  * Assembles the shortest path by traversing the
  * predecessor subgraph from destination to source.
  *
- * @template [T=string]
+ * @template {GenericGraphNode} [T=string]
  * @param {TraversalContext<NoInfer<T>>} context Traversal context object
  * @param {NoInfer<T>} source Source node
  * @param {NoInfer<T>} target Destination node
@@ -107,7 +116,11 @@ const getPath = ({ predecessors }, source, target) => {
     node = currentNode;
   }
 
-  assert.equal(node, source, `No path found from ${q(source)} to ${q(target)}`);
+  assert.equal(
+    node,
+    source,
+    `No path found from ${q(String(source))} to ${q(String(target))}`,
+  );
 
   nodeList.push(node);
 
@@ -120,11 +133,10 @@ const getPath = ({ predecessors }, source, target) => {
 };
 
 /**
- * @template [T=string] The type of nodes in the graph
- *
- * A generic graph implementation with edge weights.
+ * A generic graph implementation.
  *
- * Edge weights are assumed to be non-negative numbers (including `Infinity`)
+ * @template {GenericGraphNode} [T=string] The type of nodes in the graph. If
+ * `T` is not a string, relative paths will be compared by coercion to strings.
  */
 export class GenericGraph {
   /**
@@ -137,16 +149,10 @@ export class GenericGraph {
    */
   #edges;
 
-  /**
-   * @type {Map<T, Map<T, number>>}
-   */
-  #edgeWeights;
-
   /**
    * Initializes internal data structures.
    */
   constructor() {
-    this.#edgeWeights = new Map();
     this.#edges = new Map();
     this.#nodes = new Set();
   }
@@ -199,42 +205,6 @@ export class GenericGraph {
     return this.#edges.get(node);
   }
 
-  /**
-   * Sets the weight of the given edge between `source` and `target`.
-   *
-   * @param {T} source Source node
-   * @param {T} target Target node
-   * @param {number} weight New edge weight
-   * @returns {this}
-   */
-  setEdgeWeight(source, target, weight) {
-    if (!this.#edgeWeights.has(source)) {
-      this.#edgeWeights.set(source, new Map());
-    }
-    const weights = /** @type {Map<T, number>} */ (
-      this.#edgeWeights.get(source)
-    );
-    weights.set(target, weight);
-    return this;
-  }
-
-  /**
-   * Gets the weight of the given edge between `source` and `target`.
-   *
-   * @param {T} source Source node
-   * @param {T} target Target node
-   * @returns {number} Edge weight from source to target
-   */
-  getEdgeWeight(source, target) {
-    const weight = this.#edgeWeights.get(source)?.get(target);
-    if (weight === undefined) {
-      throw new ReferenceError(
-        `Edge weight from ${q(source)} to ${q(target)} is not set`,
-      );
-    }
-    return weight;
-  }
-
   /**
    * Adds an edge from the `source` node to `target` node.
    *
@@ -245,17 +215,15 @@ export class GenericGraph {
    *
    * @param {T} source Source node
    * @param {T} target Target node
-   * @param {number} weight Edge weight from source to target
    * @returns {this} This graph instance
    */
-  addEdge(source, target, weight) {
+  addEdge(source, target) {
     this.addNode(source);
     this.addNode(target);
     const adjacentNodes = this.adjacent(source);
     assert(adjacentNodes, `Source ${q(source)} should have adjacent nodes`);
 
     adjacentNodes.add(target);
-    this.setEdgeWeight(source, target, weight);
     return this;
   }
 
@@ -284,42 +252,32 @@ export class GenericGraph {
 }
 
 /**
- * Dijkstra's algorithm for shortest paths in a graph.
- * @template [T=string] The type of nodes in the graph
+ * Dijkstra's single-source shortest path algorithm.
+ *
+ * Computes shortest paths from `source` to **all** reachable nodes.
+ *
+ * @template {GenericGraphNode} [T=string] The type of nodes in the graph
  * @param {GenericGraph<T>} graph
  * @param {T} source
- * @param {T} target
  * @returns {TraversalContext<T>}
  */
-const dijkstra = (graph, source, target) => {
+const dijkstra = (graph, source) => {
   const { nodes } = graph;
   /** @type {TraversalContext<T>} */
   const context = {
-    distances: new Map(),
+    paths: new Map(),
     predecessors: new Map(),
-    queue: new Set(),
+    queue: nodes,
   };
-  const { queue, distances } = context;
-
-  for (const node of nodes) {
-    distances.set(node, Infinity);
-  }
-
-  assert(
-    distances.get(source) === Infinity,
-    `Source ${q(source)} is not in the graph`,
-  );
-  assert(
-    distances.get(target) === Infinity,
-    `Target ${q(target)} is not in the graph`,
-  );
-
-  distances.set(source, 0);
+  const { queue, paths } = context;
 
   for (const node of nodes) {
     queue.add(node);
   }
 
+  assert(queue.has(source), `Source ${q(source)} is not in the graph`);
+  paths.set(source, []);
+
   while (queue.size !== 0) {
     const node = extractMin(context);
     if (node === undefined) {
@@ -328,7 +286,7 @@ const dijkstra = (graph, source, target) => {
     const adjacent = graph.adjacent(node);
     if (adjacent) {
       for (const edge of adjacent) {
-        relax(graph, context, node, edge);
+        relax(context, node, edge);
       }
     }
   }
@@ -336,20 +294,32 @@ const dijkstra = (graph, source, target) => {
 };
 
 /**
- * Returns a function which uses Dijkstra's shortest path algorithm to compute
- * the shortest path from `source` to `destination` in the given `graph`.
+ * Returns a function which computes the shortest path from `source` to
+ * `target` in the given `graph`.
  *
- * @template [T=string]
+ * Dijkstra's algorithm is a _single-source_ shortest path algorithm: one run
+ * produces shortest paths to every reachable node. The returned function
+ * caches the traversal context by source, so the first call for a given source
+ * pays O(V²) and every subsequent call with the same source is O(path length).
+ *
+ * @template {GenericGraphNode} [T=string]
  * @param {GenericGraph<T>} graph Graph to use
  */
 export const makeShortestPath = graph => {
+  /** @type {Map<T, TraversalContext<T>>} */
+  const contextCache = new Map();
+
   /**
    * @param {NoInfer<T>} source Source node
    * @param {NoInfer<T>} target Target node
    * @returns {[T, T, ...T[]]} Nodes from `source` to `target` inclusive (minimum of two nodes)
    */
   const shortestPath = (source, target) => {
-    const context = dijkstra(graph, source, target);
+    let context = contextCache.get(source);
+    if (!context) {
+      context = dijkstra(graph, source);
+      contextCache.set(source, context);
+    }
     return getPath(context, source, target);
   };
   return shortestPath;

package/src/import-hook.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"import-hook.d.ts","sourceRoot":"","sources":["import-hook.js"],"names":[],"mappings":"AAouBA;;;;;;;GAOG;AACH,mDALW,aAAa,gBACb,aAAa,kKACb,6BAA6B,GAC3B,kBAAkB,CAqM9B;AA9tBM,oGALJ;IAAqC,OAAO;IACN,oBAAoB;IACnC,oBAAoB,EAAnC,MAAM;CACd,GAAU,oBAAoB,GAAC,SAAS,CA8B1C;AA0UM,gDALI,MAAM,GAAC,UAAU,gBACjB,aAAa,wMACb,0BAA0B,GACxB,eAAe,CA6K3B;mCAtrBS,YAAY;mCAAZ,YAAY;mDAAZ,YAAY;wCAAZ,YAAY;0CAAZ,YAAY;4BAAZ,YAAY;gCAAZ,YAAY;gDAAZ,YAAY;qCAAZ,YAAY"}
+{"version":3,"file":"import-hook.d.ts","sourceRoot":"","sources":["import-hook.js"],"names":[],"mappings":"AAquBA;;;;;;;GAOG;AACH,mDALW,aAAa,gBACb,aAAa,kKACb,6BAA6B,GAC3B,kBAAkB,CAqM9B;AA9tBM,oGALJ;IAAqC,OAAO;IACN,oBAAoB;IACnC,oBAAoB,EAAnC,MAAM;CACd,GAAU,oBAAoB,GAAC,SAAS,CA8B1C;AA0UM,gDALI,MAAM,GAAC,UAAU,gBACjB,aAAa,wMACb,0BAA0B,GACxB,eAAe,CA6K3B;mCAtrBS,YAAY;mCAAZ,YAAY;mDAAZ,YAAY;wCAAZ,YAAY;0CAAZ,YAAY;4BAAZ,YAAY;gCAAZ,YAAY;gDAAZ,YAAY;qCAAZ,YAAY"}

package/src/import-hook.js

@@ -41,7 +41,8 @@
  *   CompartmentModuleConfiguration,
  *   LogOptions,
  *   CanonicalName,
- *   LocalModuleSource
+ *   LocalModuleSource,
+ *   ModuleSourceHook,
  * } from './types.js'
  */
 
@@ -262,7 +263,7 @@ const nominateCandidates = (moduleSpecifier, searchSuffixes) => {
  *
  * Preprocesses the fields for the hook.
  *
- * @param {import('./types.js').ModuleSourceHook | undefined} moduleSourceHook Hook function
+ * @param {ModuleSourceHook | undefined} moduleSourceHook Hook function
  * @param {LocalModuleSource} moduleSource Original `LocalModuleSource` object
  * @param {CanonicalName} canonicalName Canonical name of the compartment/package
  * @param {LogOptions} options Options
@@ -485,7 +486,7 @@ function* chooseModuleDescriptor(
         parser,
         bytes: transformedBytes,
         record: concreteRecord,
-        sha512,
+        ...(sha512 !== undefined && { sha512 }),
       };
 
       packageSources[candidateSpecifier] = localModuleSource;

package/src/infer-exports.d.ts

@@ -1,7 +1,9 @@
-export function inferExportsEntries({ main, module, exports }: PackageDescriptor, conditions: Set<string>, types: LanguageForExtension): Generator<string[], void, any>;
+export function inferExportsEntries({ main, module, exports }: PackageDescriptor, conditions: Set<string>, types: LanguageForExtension): Generator<string[] | [string, string | null], void, any>;
 export function inferExports(descriptor: PackageDescriptor, conditions: Set<string>, types: LanguageForExtension): Record<string, string>;
-export function inferExportsAndAliases(descriptor: PackageDescriptor, externalAliases: Node["externalAliases"], internalAliases: Node["internalAliases"], conditions: Set<string>, types: Record<string, string>): void;
+export function inferExportsAliasesAndPatterns(descriptor: PackageDescriptor, externalAliases: Node["externalAliases"], internalAliases: Node["internalAliases"], patterns: PatternDescriptor[], conditions: Set<string>, types: Record<string, string>, log: LogFn): void;
 import type { PackageDescriptor } from './types.js';
 import type { LanguageForExtension } from './types.js';
 import type { Node } from './types/node-modules.js';
+import type { PatternDescriptor } from './types/pattern-replacement.js';
+import type { LogFn } from './types/external.js';
 //# sourceMappingURL=infer-exports.d.ts.map

package/src/infer-exports.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"infer-exports.d.ts","sourceRoot":"","sources":["infer-exports.js"],"names":[],"mappings":"AAsIO,+DAPI,iBAAiB,cACjB,GAAG,CAAC,MAAM,CAAC,SAEX,oBAAoB,kCA2B9B;AAkBM,yCAPI,iBAAiB,cACjB,GAAG,CAAC,MAAM,CAAC,SAEX,oBAAoB,GAElB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAG8B;AAU1D,mDANI,iBAAiB,mBACjB,IAAI,CAAC,iBAAiB,CAAC,mBACvB,IAAI,CAAC,iBAAiB,CAAC,cACvB,GAAG,CAAC,MAAM,CAAC,SACX,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,QA6ChC;uCA1NyD,YAAY;0CAAZ,YAAY;0BAC/C,yBAAyB"}
+{"version":3,"file":"infer-exports.d.ts","sourceRoot":"","sources":["infer-exports.js"],"names":[],"mappings":"AAyLO,+DAPI,iBAAiB,cACjB,GAAG,CAAC,MAAM,CAAC,SAEX,oBAAoB,4DA2B9B;AAkBM,yCAPI,iBAAiB,cACjB,GAAG,CAAC,MAAM,CAAC,SAEX,oBAAoB,GAElB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAG8B;AAyD1D,2DARI,iBAAiB,mBACjB,IAAI,CAAC,iBAAiB,CAAC,mBACvB,IAAI,CAAC,iBAAiB,CAAC,YACvB,iBAAiB,EAAE,cACnB,GAAG,CAAC,MAAM,CAAC,SACX,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,OACtB,KAAK,QAsFf;uCArWyD,YAAY;0CAAZ,YAAY;0BAE7B,yBAAyB;uCAC9B,gCAAgC;2BAF5C,qBAAqB"}