@wordpress/interactivity-router 2.32.0 → 2.32.1-next.b8c8708f3.0

package/build/assets/dynamic-importmap/resolver.js

@@ -1,29 +1,29 @@
-/* wp:polyfill */
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var resolver_exports = {};
+__export(resolver_exports, {
+  addImportMap: () => addImportMap,
+  resolve: () => resolve
 });
-exports.addImportMap = addImportMap;
-exports.resolve = resolve;
-/**
- * This code is derived from the following projects:
- *
- * 1. dynamic-importmap (https://github.com/keller-mark/dynamic-importmap)
- * 2. es-module-shims (https://github.com/guybedford/es-module-shims)
- *
- * The original implementation was created by Guy Bedford in es-module-shims,
- * then adapted by Mark Keller in dynamic-importmap, and further modified
- * for use in this project.
- *
- * Both projects are licensed under the MIT license.
- *
- * MIT License: https://opensource.org/licenses/MIT
- */
-
+module.exports = __toCommonJS(resolver_exports);
 const backslashRegEx = /\\/g;
 function isURL(url) {
-  if (url.indexOf(':') === -1) {
+  if (url.indexOf(":") === -1) {
     return false;
   }
   try {
@@ -34,89 +34,73 @@ function isURL(url) {
   }
 }
 function resolveIfNotPlainOrUrl(relUrl, parentUrl) {
-  const hIdx = parentUrl.indexOf('#'),
-    qIdx = parentUrl.indexOf('?');
+  const hIdx = parentUrl.indexOf("#"), qIdx = parentUrl.indexOf("?");
   if (hIdx + qIdx > -2) {
-    parentUrl = parentUrl.slice(0,
-    // eslint-disable-next-line no-nested-ternary
-    hIdx === -1 ? qIdx : qIdx === -1 || qIdx > hIdx ? hIdx : qIdx);
-  }
-  if (relUrl.indexOf('\\') !== -1) {
-    relUrl = relUrl.replace(backslashRegEx, '/');
+    parentUrl = parentUrl.slice(
+      0,
+      // eslint-disable-next-line no-nested-ternary
+      hIdx === -1 ? qIdx : qIdx === -1 || qIdx > hIdx ? hIdx : qIdx
+    );
   }
-  // protocol-relative
-  if (relUrl[0] === '/' && relUrl[1] === '/') {
-    return parentUrl.slice(0, parentUrl.indexOf(':') + 1) + relUrl;
+  if (relUrl.indexOf("\\") !== -1) {
+    relUrl = relUrl.replace(backslashRegEx, "/");
   }
-  // relative-url
-  else if (relUrl[0] === '.' && (relUrl[1] === '/' || relUrl[1] === '.' && (relUrl[2] === '/' || relUrl.length === 2 && (relUrl += '/')) || relUrl.length === 1 && (relUrl += '/')) || relUrl[0] === '/') {
-    const parentProtocol = parentUrl.slice(0, parentUrl.indexOf(':') + 1);
-    // Disabled, but these cases will give inconsistent results for deep backtracking
-    //if (parentUrl[parentProtocol.length] !== '/')
-    //  throw new Error('Cannot resolve');
-    // read pathname from parent URL
-    // pathname taken to be part after leading "/"
+  if (relUrl[0] === "/" && relUrl[1] === "/") {
+    return parentUrl.slice(0, parentUrl.indexOf(":") + 1) + relUrl;
+  } else if (relUrl[0] === "." && (relUrl[1] === "/" || relUrl[1] === "." && (relUrl[2] === "/" || relUrl.length === 2 && (relUrl += "/")) || relUrl.length === 1 && (relUrl += "/")) || relUrl[0] === "/") {
+    const parentProtocol = parentUrl.slice(
+      0,
+      parentUrl.indexOf(":") + 1
+    );
     let pathname;
-    if (parentUrl[parentProtocol.length + 1] === '/') {
-      // resolving to a :// so we need to read out the auth and host
-      if (parentProtocol !== 'file:') {
+    if (parentUrl[parentProtocol.length + 1] === "/") {
+      if (parentProtocol !== "file:") {
         pathname = parentUrl.slice(parentProtocol.length + 2);
-        pathname = pathname.slice(pathname.indexOf('/') + 1);
+        pathname = pathname.slice(pathname.indexOf("/") + 1);
       } else {
         pathname = parentUrl.slice(8);
       }
     } else {
-      // resolving to :/ so pathname is the /... part
-      pathname = parentUrl.slice(parentProtocol.length + (parentUrl[parentProtocol.length] === '/'));
+      pathname = parentUrl.slice(
+        parentProtocol.length + (parentUrl[parentProtocol.length] === "/")
+      );
     }
-    if (relUrl[0] === '/') {
+    if (relUrl[0] === "/") {
       return parentUrl.slice(0, parentUrl.length - pathname.length - 1) + relUrl;
     }
-
-    // join together and split for removal of .. and . segments
-    // looping the string instead of anything fancy for perf reasons
-    // '../../../../../z' resolved to 'x/y' is just 'z'
-    const segmented = pathname.slice(0, pathname.lastIndexOf('/') + 1) + relUrl;
+    const segmented = pathname.slice(0, pathname.lastIndexOf("/") + 1) + relUrl;
     const output = [];
     let segmentIndex = -1;
     for (let i = 0; i < segmented.length; i++) {
-      // busy reading a segment - only terminate on '/'
       if (segmentIndex !== -1) {
-        if (segmented[i] === '/') {
+        if (segmented[i] === "/") {
           output.push(segmented.slice(segmentIndex, i + 1));
           segmentIndex = -1;
         }
         continue;
-      }
-      // new segment - check if it is relative
-      else if (segmented[i] === '.') {
-        // ../ segment
-        if (segmented[i + 1] === '.' && (segmented[i + 2] === '/' || i + 2 === segmented.length)) {
+      } else if (segmented[i] === ".") {
+        if (segmented[i + 1] === "." && (segmented[i + 2] === "/" || i + 2 === segmented.length)) {
           output.pop();
           i += 2;
           continue;
-        }
-        // ./ segment
-        else if (segmented[i + 1] === '/' || i + 1 === segmented.length) {
+        } else if (segmented[i + 1] === "/" || i + 1 === segmented.length) {
           i += 1;
           continue;
         }
       }
-      // it is the start of a new segment
-      while (segmented[i] === '/') {
+      while (segmented[i] === "/") {
         i++;
       }
       segmentIndex = i;
     }
-    // finish reading out the last segment
     if (segmentIndex !== -1) {
       output.push(segmented.slice(segmentIndex));
     }
-    return parentUrl.slice(0, parentUrl.length - pathname.length) + output.join('');
+    return parentUrl.slice(0, parentUrl.length - pathname.length) + output.join("");
   }
 }
 function resolveUrl(relUrl, parentUrl) {
-  return resolveIfNotPlainOrUrl(relUrl, parentUrl) || (isURL(relUrl) ? relUrl : resolveIfNotPlainOrUrl('./' + relUrl, parentUrl));
+  return resolveIfNotPlainOrUrl(relUrl, parentUrl) || (isURL(relUrl) ? relUrl : resolveIfNotPlainOrUrl("./" + relUrl, parentUrl));
 }
 function getMatch(path, matchObj) {
   if (matchObj[path]) {
@@ -128,7 +112,7 @@ function getMatch(path, matchObj) {
     if (segment in matchObj) {
       return segment;
     }
-  } while ((sepIndex = path.lastIndexOf('/', sepIndex - 1)) !== -1);
+  } while ((sepIndex = path.lastIndexOf("/", sepIndex - 1)) !== -1);
 }
 function applyPackages(id, packages) {
   const pkgName = getMatch(id, packages);
@@ -140,81 +124,84 @@ function applyPackages(id, packages) {
     return pkg + id.slice(pkgName.length);
   }
 }
-function resolveImportMap(importMap, resolvedOrPlain, parentUrl) {
-  let scopeUrl = parentUrl && getMatch(parentUrl, importMap.scopes);
+function resolveImportMap(importMap2, resolvedOrPlain, parentUrl) {
+  let scopeUrl = parentUrl && getMatch(parentUrl, importMap2.scopes);
   while (scopeUrl) {
-    const packageResolution = applyPackages(resolvedOrPlain, importMap.scopes[scopeUrl]);
+    const packageResolution = applyPackages(
+      resolvedOrPlain,
+      importMap2.scopes[scopeUrl]
+    );
     if (packageResolution) {
       return packageResolution;
     }
-    scopeUrl = getMatch(scopeUrl.slice(0, scopeUrl.lastIndexOf('/')), importMap.scopes);
+    scopeUrl = getMatch(
+      scopeUrl.slice(0, scopeUrl.lastIndexOf("/")),
+      importMap2.scopes
+    );
   }
-  return applyPackages(resolvedOrPlain, importMap.imports) || resolvedOrPlain.indexOf(':') !== -1 && resolvedOrPlain;
+  return applyPackages(resolvedOrPlain, importMap2.imports) || resolvedOrPlain.indexOf(":") !== -1 && resolvedOrPlain;
 }
-function resolveAndComposePackages(packages, outPackages, baseUrl, parentMap) {
+function resolveAndComposePackages(packages, outPackages, baseUrl2, parentMap) {
   for (const p in packages) {
-    const resolvedLhs = resolveIfNotPlainOrUrl(p, baseUrl) || p;
+    const resolvedLhs = resolveIfNotPlainOrUrl(p, baseUrl2) || p;
     const target = packages[p];
-    if (typeof target !== 'string') {
+    if (typeof target !== "string") {
       continue;
     }
-    const mapped = resolveImportMap(parentMap, resolveIfNotPlainOrUrl(target, baseUrl) || target, baseUrl);
+    const mapped = resolveImportMap(
+      parentMap,
+      resolveIfNotPlainOrUrl(target, baseUrl2) || target,
+      baseUrl2
+    );
     if (mapped) {
       outPackages[resolvedLhs] = mapped;
       continue;
     }
-    // console.warn(
-    // 	`Mapping "${ p }" -> "${ packages[ p ] }" does not resolve`
-    // );
   }
 }
-function resolveAndComposeImportMap(json, baseUrl, parentMap) {
+function resolveAndComposeImportMap(json, baseUrl2, parentMap) {
   const outMap = {
     imports: Object.assign({}, parentMap.imports),
     scopes: Object.assign({}, parentMap.scopes)
   };
   if (json.imports) {
-    resolveAndComposePackages(json.imports, outMap.imports, baseUrl, parentMap);
+    resolveAndComposePackages(
+      json.imports,
+      outMap.imports,
+      baseUrl2,
+      parentMap
+    );
   }
   if (json.scopes) {
     for (const s in json.scopes) {
-      const resolvedScope = resolveUrl(s, baseUrl);
-      resolveAndComposePackages(json.scopes[s], outMap.scopes[resolvedScope] || (outMap.scopes[resolvedScope] = {}), baseUrl, parentMap);
+      const resolvedScope = resolveUrl(s, baseUrl2);
+      resolveAndComposePackages(
+        json.scopes[s],
+        outMap.scopes[resolvedScope] || (outMap.scopes[resolvedScope] = {}),
+        baseUrl2,
+        parentMap
+      );
     }
   }
   return outMap;
 }
-let importMap = {
-  imports: {},
-  scopes: {}
-};
-
-// TODO: check if this baseURI should change per document, and so
-// it need to be passed as a parameter to methods like `resolve`.
+let importMap = { imports: {}, scopes: {} };
 const baseUrl = document.baseURI;
 const pageBaseUrl = baseUrl;
-
-/**
- * Extends the internal dynamic import map with the passed one.
- *
- * @param importMapIn         Import map.
- * @param importMapIn.imports Imports declaration.
- * @param importMapIn.scopes  Scopes declaration.
- */
 function addImportMap(importMapIn) {
-  importMap = resolveAndComposeImportMap(importMapIn, pageBaseUrl, importMap);
+  importMap = resolveAndComposeImportMap(
+    importMapIn,
+    pageBaseUrl,
+    importMap
+  );
 }
-
-/**
- * Resolves the URL of the passed module ID against the current internal
- * dynamic import map.
- *
- * @param id        Module ID.
- * @param parentUrl Parent URL, in case the module ID is relative.
- * @return Resolved module URL.
- */
 function resolve(id, parentUrl) {
   const urlResolved = resolveIfNotPlainOrUrl(id, parentUrl);
   return resolveImportMap(importMap, urlResolved || id, parentUrl) || id;
 }
-//# sourceMappingURL=resolver.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  addImportMap,
+  resolve
+});
+//# sourceMappingURL=resolver.js.map

package/build/assets/dynamic-importmap/resolver.js.map

@@ -1 +1,7 @@
-{"version":3,"names":["backslashRegEx","isURL","url","indexOf","URL","_","resolveIfNotPlainOrUrl","relUrl","parentUrl","hIdx","qIdx","slice","replace","length","parentProtocol","pathname","segmented","lastIndexOf","output","segmentIndex","i","push","pop","join","resolveUrl","getMatch","path","matchObj","sepIndex","segment","applyPackages","id","packages","pkgName","pkg","resolveImportMap","importMap","resolvedOrPlain","scopeUrl","scopes","packageResolution","imports","resolveAndComposePackages","outPackages","baseUrl","parentMap","p","resolvedLhs","target","mapped","resolveAndComposeImportMap","json","outMap","Object","assign","s","resolvedScope","document","baseURI","pageBaseUrl","addImportMap","importMapIn","resolve","urlResolved"],"sources":["@wordpress/interactivity-router/src/assets/dynamic-importmap/resolver.ts"],"sourcesContent":["/**\n * This code is derived from the following projects:\n *\n * 1. dynamic-importmap (https://github.com/keller-mark/dynamic-importmap)\n * 2. es-module-shims (https://github.com/guybedford/es-module-shims)\n *\n * The original implementation was created by Guy Bedford in es-module-shims,\n * then adapted by Mark Keller in dynamic-importmap, and further modified\n * for use in this project.\n *\n * Both projects are licensed under the MIT license.\n *\n * MIT License: https://opensource.org/licenses/MIT\n */\n\nconst backslashRegEx = /\\\\/g;\n\nfunction isURL( url: string ) {\n\tif ( url.indexOf( ':' ) === -1 ) {\n\t\treturn false;\n\t}\n\ttry {\n\t\tnew URL( url );\n\t\treturn true;\n\t} catch ( _ ) {\n\t\treturn false;\n\t}\n}\n\nfunction resolveIfNotPlainOrUrl( relUrl, parentUrl ) {\n\tconst hIdx = parentUrl.indexOf( '#' ),\n\t\tqIdx = parentUrl.indexOf( '?' );\n\tif ( hIdx + qIdx > -2 ) {\n\t\tparentUrl = parentUrl.slice(\n\t\t\t0,\n\t\t\t// eslint-disable-next-line no-nested-ternary\n\t\t\thIdx === -1 ? qIdx : qIdx === -1 || qIdx > hIdx ? hIdx : qIdx\n\t\t);\n\t}\n\tif ( relUrl.indexOf( '\\\\' ) !== -1 ) {\n\t\trelUrl = relUrl.replace( backslashRegEx, '/' );\n\t}\n\t// protocol-relative\n\tif ( relUrl[ 0 ] === '/' && relUrl[ 1 ] === '/' ) {\n\t\treturn parentUrl.slice( 0, parentUrl.indexOf( ':' ) + 1 ) + relUrl;\n\t}\n\t// relative-url\n\telse if (\n\t\t( relUrl[ 0 ] === '.' &&\n\t\t\t( relUrl[ 1 ] === '/' ||\n\t\t\t\t( relUrl[ 1 ] === '.' &&\n\t\t\t\t\t( relUrl[ 2 ] === '/' ||\n\t\t\t\t\t\t( relUrl.length === 2 && ( relUrl += '/' ) ) ) ) ||\n\t\t\t\t( relUrl.length === 1 && ( relUrl += '/' ) ) ) ) ||\n\t\trelUrl[ 0 ] === '/'\n\t) {\n\t\tconst parentProtocol = parentUrl.slice(\n\t\t\t0,\n\t\t\tparentUrl.indexOf( ':' ) + 1\n\t\t);\n\t\t// Disabled, but these cases will give inconsistent results for deep backtracking\n\t\t//if (parentUrl[parentProtocol.length] !== '/')\n\t\t//  throw new Error('Cannot resolve');\n\t\t// read pathname from parent URL\n\t\t// pathname taken to be part after leading \"/\"\n\t\tlet pathname;\n\t\tif ( parentUrl[ parentProtocol.length + 1 ] === '/' ) {\n\t\t\t// resolving to a :// so we need to read out the auth and host\n\t\t\tif ( parentProtocol !== 'file:' ) {\n\t\t\t\tpathname = parentUrl.slice( parentProtocol.length + 2 );\n\t\t\t\tpathname = pathname.slice( pathname.indexOf( '/' ) + 1 );\n\t\t\t} else {\n\t\t\t\tpathname = parentUrl.slice( 8 );\n\t\t\t}\n\t\t} else {\n\t\t\t// resolving to :/ so pathname is the /... part\n\t\t\tpathname = parentUrl.slice(\n\t\t\t\tparentProtocol.length +\n\t\t\t\t\t( parentUrl[ parentProtocol.length ] === '/' )\n\t\t\t);\n\t\t}\n\n\t\tif ( relUrl[ 0 ] === '/' ) {\n\t\t\treturn (\n\t\t\t\tparentUrl.slice( 0, parentUrl.length - pathname.length - 1 ) +\n\t\t\t\trelUrl\n\t\t\t);\n\t\t}\n\n\t\t// join together and split for removal of .. and . segments\n\t\t// looping the string instead of anything fancy for perf reasons\n\t\t// '../../../../../z' resolved to 'x/y' is just 'z'\n\t\tconst segmented =\n\t\t\tpathname.slice( 0, pathname.lastIndexOf( '/' ) + 1 ) + relUrl;\n\n\t\tconst output = [];\n\t\tlet segmentIndex = -1;\n\t\tfor ( let i = 0; i < segmented.length; i++ ) {\n\t\t\t// busy reading a segment - only terminate on '/'\n\t\t\tif ( segmentIndex !== -1 ) {\n\t\t\t\tif ( segmented[ i ] === '/' ) {\n\t\t\t\t\toutput.push( segmented.slice( segmentIndex, i + 1 ) );\n\t\t\t\t\tsegmentIndex = -1;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// new segment - check if it is relative\n\t\t\telse if ( segmented[ i ] === '.' ) {\n\t\t\t\t// ../ segment\n\t\t\t\tif (\n\t\t\t\t\tsegmented[ i + 1 ] === '.' &&\n\t\t\t\t\t( segmented[ i + 2 ] === '/' || i + 2 === segmented.length )\n\t\t\t\t) {\n\t\t\t\t\toutput.pop();\n\t\t\t\t\ti += 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t// ./ segment\n\t\t\t\telse if (\n\t\t\t\t\tsegmented[ i + 1 ] === '/' ||\n\t\t\t\t\ti + 1 === segmented.length\n\t\t\t\t) {\n\t\t\t\t\ti += 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// it is the start of a new segment\n\t\t\twhile ( segmented[ i ] === '/' ) {\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tsegmentIndex = i;\n\t\t}\n\t\t// finish reading out the last segment\n\t\tif ( segmentIndex !== -1 ) {\n\t\t\toutput.push( segmented.slice( segmentIndex ) );\n\t\t}\n\t\treturn (\n\t\t\tparentUrl.slice( 0, parentUrl.length - pathname.length ) +\n\t\t\toutput.join( '' )\n\t\t);\n\t}\n}\n\nfunction resolveUrl( relUrl, parentUrl ) {\n\treturn (\n\t\tresolveIfNotPlainOrUrl( relUrl, parentUrl ) ||\n\t\t( isURL( relUrl )\n\t\t\t? relUrl\n\t\t\t: resolveIfNotPlainOrUrl( './' + relUrl, parentUrl ) )\n\t);\n}\n\nfunction getMatch( path, matchObj ) {\n\tif ( matchObj[ path ] ) {\n\t\treturn path;\n\t}\n\tlet sepIndex = path.length;\n\tdo {\n\t\tconst segment = path.slice( 0, sepIndex + 1 );\n\t\tif ( segment in matchObj ) {\n\t\t\treturn segment;\n\t\t}\n\t} while ( ( sepIndex = path.lastIndexOf( '/', sepIndex - 1 ) ) !== -1 );\n}\n\nfunction applyPackages( id, packages ) {\n\tconst pkgName = getMatch( id, packages );\n\tif ( pkgName ) {\n\t\tconst pkg = packages[ pkgName ];\n\t\tif ( pkg === null ) {\n\t\t\treturn;\n\t\t}\n\t\treturn pkg + id.slice( pkgName.length );\n\t}\n}\n\nfunction resolveImportMap( importMap, resolvedOrPlain, parentUrl ) {\n\tlet scopeUrl = parentUrl && getMatch( parentUrl, importMap.scopes );\n\twhile ( scopeUrl ) {\n\t\tconst packageResolution = applyPackages(\n\t\t\tresolvedOrPlain,\n\t\t\timportMap.scopes[ scopeUrl ]\n\t\t);\n\t\tif ( packageResolution ) {\n\t\t\treturn packageResolution;\n\t\t}\n\t\tscopeUrl = getMatch(\n\t\t\tscopeUrl.slice( 0, scopeUrl.lastIndexOf( '/' ) ),\n\t\t\timportMap.scopes\n\t\t);\n\t}\n\treturn (\n\t\tapplyPackages( resolvedOrPlain, importMap.imports ) ||\n\t\t( resolvedOrPlain.indexOf( ':' ) !== -1 && resolvedOrPlain )\n\t);\n}\n\nfunction resolveAndComposePackages(\n\tpackages,\n\toutPackages,\n\tbaseUrl,\n\tparentMap\n) {\n\tfor ( const p in packages ) {\n\t\tconst resolvedLhs = resolveIfNotPlainOrUrl( p, baseUrl ) || p;\n\t\tconst target = packages[ p ];\n\t\tif ( typeof target !== 'string' ) {\n\t\t\tcontinue;\n\t\t}\n\t\tconst mapped = resolveImportMap(\n\t\t\tparentMap,\n\t\t\tresolveIfNotPlainOrUrl( target, baseUrl ) || target,\n\t\t\tbaseUrl\n\t\t);\n\t\tif ( mapped ) {\n\t\t\toutPackages[ resolvedLhs ] = mapped;\n\t\t\tcontinue;\n\t\t}\n\t\t// console.warn(\n\t\t// \t`Mapping \"${ p }\" -> \"${ packages[ p ] }\" does not resolve`\n\t\t// );\n\t}\n}\n\nfunction resolveAndComposeImportMap( json, baseUrl, parentMap ) {\n\tconst outMap = {\n\t\timports: Object.assign( {}, parentMap.imports ),\n\t\tscopes: Object.assign( {}, parentMap.scopes ),\n\t};\n\n\tif ( json.imports ) {\n\t\tresolveAndComposePackages(\n\t\t\tjson.imports,\n\t\t\toutMap.imports,\n\t\t\tbaseUrl,\n\t\t\tparentMap\n\t\t);\n\t}\n\n\tif ( json.scopes ) {\n\t\tfor ( const s in json.scopes ) {\n\t\t\tconst resolvedScope = resolveUrl( s, baseUrl );\n\t\t\tresolveAndComposePackages(\n\t\t\t\tjson.scopes[ s ],\n\t\t\t\toutMap.scopes[ resolvedScope ] ||\n\t\t\t\t\t( outMap.scopes[ resolvedScope ] = {} ),\n\t\t\t\tbaseUrl,\n\t\t\t\tparentMap\n\t\t\t);\n\t\t}\n\t}\n\n\treturn outMap;\n}\n\nlet importMap = { imports: {}, scopes: {} };\n\n// TODO: check if this baseURI should change per document, and so\n// it need to be passed as a parameter to methods like `resolve`.\nconst baseUrl = document.baseURI;\nconst pageBaseUrl = baseUrl;\n\n/**\n * Extends the internal dynamic import map with the passed one.\n *\n * @param importMapIn         Import map.\n * @param importMapIn.imports Imports declaration.\n * @param importMapIn.scopes  Scopes declaration.\n */\nexport function addImportMap( importMapIn: {\n\timports?: Record< string, string >;\n\tscopes?: Record< string, any >;\n} ) {\n\timportMap = resolveAndComposeImportMap(\n\t\timportMapIn,\n\t\tpageBaseUrl,\n\t\timportMap\n\t);\n}\n\n/**\n * Resolves the URL of the passed module ID against the current internal\n * dynamic import map.\n *\n * @param id        Module ID.\n * @param parentUrl Parent URL, in case the module ID is relative.\n * @return Resolved module URL.\n */\nexport function resolve( id: string, parentUrl: string ): string {\n\tconst urlResolved = resolveIfNotPlainOrUrl( id, parentUrl );\n\treturn resolveImportMap( importMap, urlResolved || id, parentUrl ) || id;\n}\n"],"mappings":";;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAMA,cAAc,GAAG,KAAK;AAE5B,SAASC,KAAKA,CAAEC,GAAW,EAAG;EAC7B,IAAKA,GAAG,CAACC,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC,CAAC,EAAG;IAChC,OAAO,KAAK;EACb;EACA,IAAI;IACH,IAAIC,GAAG,CAAEF,GAAI,CAAC;IACd,OAAO,IAAI;EACZ,CAAC,CAAC,OAAQG,CAAC,EAAG;IACb,OAAO,KAAK;EACb;AACD;AAEA,SAASC,sBAAsBA,CAAEC,MAAM,EAAEC,SAAS,EAAG;EACpD,MAAMC,IAAI,GAAGD,SAAS,CAACL,OAAO,CAAE,GAAI,CAAC;IACpCO,IAAI,GAAGF,SAAS,CAACL,OAAO,CAAE,GAAI,CAAC;EAChC,IAAKM,IAAI,GAAGC,IAAI,GAAG,CAAC,CAAC,EAAG;IACvBF,SAAS,GAAGA,SAAS,CAACG,KAAK,CAC1B,CAAC;IACD;IACAF,IAAI,KAAK,CAAC,CAAC,GAAGC,IAAI,GAAGA,IAAI,KAAK,CAAC,CAAC,IAAIA,IAAI,GAAGD,IAAI,GAAGA,IAAI,GAAGC,IAC1D,CAAC;EACF;EACA,IAAKH,MAAM,CAACJ,OAAO,CAAE,IAAK,CAAC,KAAK,CAAC,CAAC,EAAG;IACpCI,MAAM,GAAGA,MAAM,CAACK,OAAO,CAAEZ,cAAc,EAAE,GAAI,CAAC;EAC/C;EACA;EACA,IAAKO,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,IAAIA,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,EAAG;IACjD,OAAOC,SAAS,CAACG,KAAK,CAAE,CAAC,EAAEH,SAAS,CAACL,OAAO,CAAE,GAAI,CAAC,GAAG,CAAE,CAAC,GAAGI,MAAM;EACnE;EACA;EAAA,KACK,IACFA,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,KAClBA,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,IAClBA,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,KAClBA,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,IAClBA,MAAM,CAACM,MAAM,KAAK,CAAC,KAAMN,MAAM,IAAI,GAAG,CAAI,CAAI,IAChDA,MAAM,CAACM,MAAM,KAAK,CAAC,KAAMN,MAAM,IAAI,GAAG,CAAI,CAAE,IAChDA,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,EAClB;IACD,MAAMO,cAAc,GAAGN,SAAS,CAACG,KAAK,CACrC,CAAC,EACDH,SAAS,CAACL,OAAO,CAAE,GAAI,CAAC,GAAG,CAC5B,CAAC;IACD;IACA;IACA;IACA;IACA;IACA,IAAIY,QAAQ;IACZ,IAAKP,SAAS,CAAEM,cAAc,CAACD,MAAM,GAAG,CAAC,CAAE,KAAK,GAAG,EAAG;MACrD;MACA,IAAKC,cAAc,KAAK,OAAO,EAAG;QACjCC,QAAQ,GAAGP,SAAS,CAACG,KAAK,CAAEG,cAAc,CAACD,MAAM,GAAG,CAAE,CAAC;QACvDE,QAAQ,GAAGA,QAAQ,CAACJ,KAAK,CAAEI,QAAQ,CAACZ,OAAO,CAAE,GAAI,CAAC,GAAG,CAAE,CAAC;MACzD,CAAC,MAAM;QACNY,QAAQ,GAAGP,SAAS,CAACG,KAAK,CAAE,CAAE,CAAC;MAChC;IACD,CAAC,MAAM;MACN;MACAI,QAAQ,GAAGP,SAAS,CAACG,KAAK,CACzBG,cAAc,CAACD,MAAM,IAClBL,SAAS,CAAEM,cAAc,CAACD,MAAM,CAAE,KAAK,GAAG,CAC9C,CAAC;IACF;IAEA,IAAKN,MAAM,CAAE,CAAC,CAAE,KAAK,GAAG,EAAG;MAC1B,OACCC,SAAS,CAACG,KAAK,CAAE,CAAC,EAAEH,SAAS,CAACK,MAAM,GAAGE,QAAQ,CAACF,MAAM,GAAG,CAAE,CAAC,GAC5DN,MAAM;IAER;;IAEA;IACA;IACA;IACA,MAAMS,SAAS,GACdD,QAAQ,CAACJ,KAAK,CAAE,CAAC,EAAEI,QAAQ,CAACE,WAAW,CAAE,GAAI,CAAC,GAAG,CAAE,CAAC,GAAGV,MAAM;IAE9D,MAAMW,MAAM,GAAG,EAAE;IACjB,IAAIC,YAAY,GAAG,CAAC,CAAC;IACrB,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGJ,SAAS,CAACH,MAAM,EAAEO,CAAC,EAAE,EAAG;MAC5C;MACA,IAAKD,YAAY,KAAK,CAAC,CAAC,EAAG;QAC1B,IAAKH,SAAS,CAAEI,CAAC,CAAE,KAAK,GAAG,EAAG;UAC7BF,MAAM,CAACG,IAAI,CAAEL,SAAS,CAACL,KAAK,CAAEQ,YAAY,EAAEC,CAAC,GAAG,CAAE,CAAE,CAAC;UACrDD,YAAY,GAAG,CAAC,CAAC;QAClB;QACA;MACD;MACA;MAAA,KACK,IAAKH,SAAS,CAAEI,CAAC,CAAE,KAAK,GAAG,EAAG;QAClC;QACA,IACCJ,SAAS,CAAEI,CAAC,GAAG,CAAC,CAAE,KAAK,GAAG,KACxBJ,SAAS,CAAEI,CAAC,GAAG,CAAC,CAAE,KAAK,GAAG,IAAIA,CAAC,GAAG,CAAC,KAAKJ,SAAS,CAACH,MAAM,CAAE,EAC3D;UACDK,MAAM,CAACI,GAAG,CAAC,CAAC;UACZF,CAAC,IAAI,CAAC;UACN;QACD;QACA;QAAA,KACK,IACJJ,SAAS,CAAEI,CAAC,GAAG,CAAC,CAAE,KAAK,GAAG,IAC1BA,CAAC,GAAG,CAAC,KAAKJ,SAAS,CAACH,MAAM,EACzB;UACDO,CAAC,IAAI,CAAC;UACN;QACD;MACD;MACA;MACA,OAAQJ,SAAS,CAAEI,CAAC,CAAE,KAAK,GAAG,EAAG;QAChCA,CAAC,EAAE;MACJ;MACAD,YAAY,GAAGC,CAAC;IACjB;IACA;IACA,IAAKD,YAAY,KAAK,CAAC,CAAC,EAAG;MAC1BD,MAAM,CAACG,IAAI,CAAEL,SAAS,CAACL,KAAK,CAAEQ,YAAa,CAAE,CAAC;IAC/C;IACA,OACCX,SAAS,CAACG,KAAK,CAAE,CAAC,EAAEH,SAAS,CAACK,MAAM,GAAGE,QAAQ,CAACF,MAAO,CAAC,GACxDK,MAAM,CAACK,IAAI,CAAE,EAAG,CAAC;EAEnB;AACD;AAEA,SAASC,UAAUA,CAAEjB,MAAM,EAAEC,SAAS,EAAG;EACxC,OACCF,sBAAsB,CAAEC,MAAM,EAAEC,SAAU,CAAC,KACzCP,KAAK,CAAEM,MAAO,CAAC,GACdA,MAAM,GACND,sBAAsB,CAAE,IAAI,GAAGC,MAAM,EAAEC,SAAU,CAAC,CAAE;AAEzD;AAEA,SAASiB,QAAQA,CAAEC,IAAI,EAAEC,QAAQ,EAAG;EACnC,IAAKA,QAAQ,CAAED,IAAI,CAAE,EAAG;IACvB,OAAOA,IAAI;EACZ;EACA,IAAIE,QAAQ,GAAGF,IAAI,CAACb,MAAM;EAC1B,GAAG;IACF,MAAMgB,OAAO,GAAGH,IAAI,CAACf,KAAK,CAAE,CAAC,EAAEiB,QAAQ,GAAG,CAAE,CAAC;IAC7C,IAAKC,OAAO,IAAIF,QAAQ,EAAG;MAC1B,OAAOE,OAAO;IACf;EACD,CAAC,QAAS,CAAED,QAAQ,GAAGF,IAAI,CAACT,WAAW,CAAE,GAAG,EAAEW,QAAQ,GAAG,CAAE,CAAC,MAAO,CAAC,CAAC;AACtE;AAEA,SAASE,aAAaA,CAAEC,EAAE,EAAEC,QAAQ,EAAG;EACtC,MAAMC,OAAO,GAAGR,QAAQ,CAAEM,EAAE,EAAEC,QAAS,CAAC;EACxC,IAAKC,OAAO,EAAG;IACd,MAAMC,GAAG,GAAGF,QAAQ,CAAEC,OAAO,CAAE;IAC/B,IAAKC,GAAG,KAAK,IAAI,EAAG;MACnB;IACD;IACA,OAAOA,GAAG,GAAGH,EAAE,CAACpB,KAAK,CAAEsB,OAAO,CAACpB,MAAO,CAAC;EACxC;AACD;AAEA,SAASsB,gBAAgBA,CAAEC,SAAS,EAAEC,eAAe,EAAE7B,SAAS,EAAG;EAClE,IAAI8B,QAAQ,GAAG9B,SAAS,IAAIiB,QAAQ,CAAEjB,SAAS,EAAE4B,SAAS,CAACG,MAAO,CAAC;EACnE,OAAQD,QAAQ,EAAG;IAClB,MAAME,iBAAiB,GAAGV,aAAa,CACtCO,eAAe,EACfD,SAAS,CAACG,MAAM,CAAED,QAAQ,CAC3B,CAAC;IACD,IAAKE,iBAAiB,EAAG;MACxB,OAAOA,iBAAiB;IACzB;IACAF,QAAQ,GAAGb,QAAQ,CAClBa,QAAQ,CAAC3B,KAAK,CAAE,CAAC,EAAE2B,QAAQ,CAACrB,WAAW,CAAE,GAAI,CAAE,CAAC,EAChDmB,SAAS,CAACG,MACX,CAAC;EACF;EACA,OACCT,aAAa,CAAEO,eAAe,EAAED,SAAS,CAACK,OAAQ,CAAC,IACjDJ,eAAe,CAAClC,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC,CAAC,IAAIkC,eAAiB;AAE9D;AAEA,SAASK,yBAAyBA,CACjCV,QAAQ,EACRW,WAAW,EACXC,OAAO,EACPC,SAAS,EACR;EACD,KAAM,MAAMC,CAAC,IAAId,QAAQ,EAAG;IAC3B,MAAMe,WAAW,GAAGzC,sBAAsB,CAAEwC,CAAC,EAAEF,OAAQ,CAAC,IAAIE,CAAC;IAC7D,MAAME,MAAM,GAAGhB,QAAQ,CAAEc,CAAC,CAAE;IAC5B,IAAK,OAAOE,MAAM,KAAK,QAAQ,EAAG;MACjC;IACD;IACA,MAAMC,MAAM,GAAGd,gBAAgB,CAC9BU,SAAS,EACTvC,sBAAsB,CAAE0C,MAAM,EAAEJ,OAAQ,CAAC,IAAII,MAAM,EACnDJ,OACD,CAAC;IACD,IAAKK,MAAM,EAAG;MACbN,WAAW,CAAEI,WAAW,CAAE,GAAGE,MAAM;MACnC;IACD;IACA;IACA;IACA;EACD;AACD;AAEA,SAASC,0BAA0BA,CAAEC,IAAI,EAAEP,OAAO,EAAEC,SAAS,EAAG;EAC/D,MAAMO,MAAM,GAAG;IACdX,OAAO,EAAEY,MAAM,CAACC,MAAM,CAAE,CAAC,CAAC,EAAET,SAAS,CAACJ,OAAQ,CAAC;IAC/CF,MAAM,EAAEc,MAAM,CAACC,MAAM,CAAE,CAAC,CAAC,EAAET,SAAS,CAACN,MAAO;EAC7C,CAAC;EAED,IAAKY,IAAI,CAACV,OAAO,EAAG;IACnBC,yBAAyB,CACxBS,IAAI,CAACV,OAAO,EACZW,MAAM,CAACX,OAAO,EACdG,OAAO,EACPC,SACD,CAAC;EACF;EAEA,IAAKM,IAAI,CAACZ,MAAM,EAAG;IAClB,KAAM,MAAMgB,CAAC,IAAIJ,IAAI,CAACZ,MAAM,EAAG;MAC9B,MAAMiB,aAAa,GAAGhC,UAAU,CAAE+B,CAAC,EAAEX,OAAQ,CAAC;MAC9CF,yBAAyB,CACxBS,IAAI,CAACZ,MAAM,CAAEgB,CAAC,CAAE,EAChBH,MAAM,CAACb,MAAM,CAAEiB,aAAa,CAAE,KAC3BJ,MAAM,CAACb,MAAM,CAAEiB,aAAa,CAAE,GAAG,CAAC,CAAC,CAAE,EACxCZ,OAAO,EACPC,SACD,CAAC;IACF;EACD;EAEA,OAAOO,MAAM;AACd;AAEA,IAAIhB,SAAS,GAAG;EAAEK,OAAO,EAAE,CAAC,CAAC;EAAEF,MAAM,EAAE,CAAC;AAAE,CAAC;;AAE3C;AACA;AACA,MAAMK,OAAO,GAAGa,QAAQ,CAACC,OAAO;AAChC,MAAMC,WAAW,GAAGf,OAAO;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASgB,YAAYA,CAAEC,WAG7B,EAAG;EACHzB,SAAS,GAAGc,0BAA0B,CACrCW,WAAW,EACXF,WAAW,EACXvB,SACD,CAAC;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS0B,OAAOA,CAAE/B,EAAU,EAAEvB,SAAiB,EAAW;EAChE,MAAMuD,WAAW,GAAGzD,sBAAsB,CAAEyB,EAAE,EAAEvB,SAAU,CAAC;EAC3D,OAAO2B,gBAAgB,CAAEC,SAAS,EAAE2B,WAAW,IAAIhC,EAAE,EAAEvB,SAAU,CAAC,IAAIuB,EAAE;AACzE","ignoreList":[]}
+{
+  "version": 3,
+  "sources": ["../../../src/assets/dynamic-importmap/resolver.ts"],
+  "sourcesContent": ["/**\n * This code is derived from the following projects:\n *\n * 1. dynamic-importmap (https://github.com/keller-mark/dynamic-importmap)\n * 2. es-module-shims (https://github.com/guybedford/es-module-shims)\n *\n * The original implementation was created by Guy Bedford in es-module-shims,\n * then adapted by Mark Keller in dynamic-importmap, and further modified\n * for use in this project.\n *\n * Both projects are licensed under the MIT license.\n *\n * MIT License: https://opensource.org/licenses/MIT\n */\n\nconst backslashRegEx = /\\\\/g;\n\nfunction isURL( url: string ) {\n\tif ( url.indexOf( ':' ) === -1 ) {\n\t\treturn false;\n\t}\n\ttry {\n\t\tnew URL( url );\n\t\treturn true;\n\t} catch ( _ ) {\n\t\treturn false;\n\t}\n}\n\nfunction resolveIfNotPlainOrUrl( relUrl, parentUrl ) {\n\tconst hIdx = parentUrl.indexOf( '#' ),\n\t\tqIdx = parentUrl.indexOf( '?' );\n\tif ( hIdx + qIdx > -2 ) {\n\t\tparentUrl = parentUrl.slice(\n\t\t\t0,\n\t\t\t// eslint-disable-next-line no-nested-ternary\n\t\t\thIdx === -1 ? qIdx : qIdx === -1 || qIdx > hIdx ? hIdx : qIdx\n\t\t);\n\t}\n\tif ( relUrl.indexOf( '\\\\' ) !== -1 ) {\n\t\trelUrl = relUrl.replace( backslashRegEx, '/' );\n\t}\n\t// protocol-relative\n\tif ( relUrl[ 0 ] === '/' && relUrl[ 1 ] === '/' ) {\n\t\treturn parentUrl.slice( 0, parentUrl.indexOf( ':' ) + 1 ) + relUrl;\n\t}\n\t// relative-url\n\telse if (\n\t\t( relUrl[ 0 ] === '.' &&\n\t\t\t( relUrl[ 1 ] === '/' ||\n\t\t\t\t( relUrl[ 1 ] === '.' &&\n\t\t\t\t\t( relUrl[ 2 ] === '/' ||\n\t\t\t\t\t\t( relUrl.length === 2 && ( relUrl += '/' ) ) ) ) ||\n\t\t\t\t( relUrl.length === 1 && ( relUrl += '/' ) ) ) ) ||\n\t\trelUrl[ 0 ] === '/'\n\t) {\n\t\tconst parentProtocol = parentUrl.slice(\n\t\t\t0,\n\t\t\tparentUrl.indexOf( ':' ) + 1\n\t\t);\n\t\t// Disabled, but these cases will give inconsistent results for deep backtracking\n\t\t//if (parentUrl[parentProtocol.length] !== '/')\n\t\t//  throw new Error('Cannot resolve');\n\t\t// read pathname from parent URL\n\t\t// pathname taken to be part after leading \"/\"\n\t\tlet pathname;\n\t\tif ( parentUrl[ parentProtocol.length + 1 ] === '/' ) {\n\t\t\t// resolving to a :// so we need to read out the auth and host\n\t\t\tif ( parentProtocol !== 'file:' ) {\n\t\t\t\tpathname = parentUrl.slice( parentProtocol.length + 2 );\n\t\t\t\tpathname = pathname.slice( pathname.indexOf( '/' ) + 1 );\n\t\t\t} else {\n\t\t\t\tpathname = parentUrl.slice( 8 );\n\t\t\t}\n\t\t} else {\n\t\t\t// resolving to :/ so pathname is the /... part\n\t\t\tpathname = parentUrl.slice(\n\t\t\t\tparentProtocol.length +\n\t\t\t\t\t( parentUrl[ parentProtocol.length ] === '/' )\n\t\t\t);\n\t\t}\n\n\t\tif ( relUrl[ 0 ] === '/' ) {\n\t\t\treturn (\n\t\t\t\tparentUrl.slice( 0, parentUrl.length - pathname.length - 1 ) +\n\t\t\t\trelUrl\n\t\t\t);\n\t\t}\n\n\t\t// join together and split for removal of .. and . segments\n\t\t// looping the string instead of anything fancy for perf reasons\n\t\t// '../../../../../z' resolved to 'x/y' is just 'z'\n\t\tconst segmented =\n\t\t\tpathname.slice( 0, pathname.lastIndexOf( '/' ) + 1 ) + relUrl;\n\n\t\tconst output = [];\n\t\tlet segmentIndex = -1;\n\t\tfor ( let i = 0; i < segmented.length; i++ ) {\n\t\t\t// busy reading a segment - only terminate on '/'\n\t\t\tif ( segmentIndex !== -1 ) {\n\t\t\t\tif ( segmented[ i ] === '/' ) {\n\t\t\t\t\toutput.push( segmented.slice( segmentIndex, i + 1 ) );\n\t\t\t\t\tsegmentIndex = -1;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// new segment - check if it is relative\n\t\t\telse if ( segmented[ i ] === '.' ) {\n\t\t\t\t// ../ segment\n\t\t\t\tif (\n\t\t\t\t\tsegmented[ i + 1 ] === '.' &&\n\t\t\t\t\t( segmented[ i + 2 ] === '/' || i + 2 === segmented.length )\n\t\t\t\t) {\n\t\t\t\t\toutput.pop();\n\t\t\t\t\ti += 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t// ./ segment\n\t\t\t\telse if (\n\t\t\t\t\tsegmented[ i + 1 ] === '/' ||\n\t\t\t\t\ti + 1 === segmented.length\n\t\t\t\t) {\n\t\t\t\t\ti += 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// it is the start of a new segment\n\t\t\twhile ( segmented[ i ] === '/' ) {\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tsegmentIndex = i;\n\t\t}\n\t\t// finish reading out the last segment\n\t\tif ( segmentIndex !== -1 ) {\n\t\t\toutput.push( segmented.slice( segmentIndex ) );\n\t\t}\n\t\treturn (\n\t\t\tparentUrl.slice( 0, parentUrl.length - pathname.length ) +\n\t\t\toutput.join( '' )\n\t\t);\n\t}\n}\n\nfunction resolveUrl( relUrl, parentUrl ) {\n\treturn (\n\t\tresolveIfNotPlainOrUrl( relUrl, parentUrl ) ||\n\t\t( isURL( relUrl )\n\t\t\t? relUrl\n\t\t\t: resolveIfNotPlainOrUrl( './' + relUrl, parentUrl ) )\n\t);\n}\n\nfunction getMatch( path, matchObj ) {\n\tif ( matchObj[ path ] ) {\n\t\treturn path;\n\t}\n\tlet sepIndex = path.length;\n\tdo {\n\t\tconst segment = path.slice( 0, sepIndex + 1 );\n\t\tif ( segment in matchObj ) {\n\t\t\treturn segment;\n\t\t}\n\t} while ( ( sepIndex = path.lastIndexOf( '/', sepIndex - 1 ) ) !== -1 );\n}\n\nfunction applyPackages( id, packages ) {\n\tconst pkgName = getMatch( id, packages );\n\tif ( pkgName ) {\n\t\tconst pkg = packages[ pkgName ];\n\t\tif ( pkg === null ) {\n\t\t\treturn;\n\t\t}\n\t\treturn pkg + id.slice( pkgName.length );\n\t}\n}\n\nfunction resolveImportMap( importMap, resolvedOrPlain, parentUrl ) {\n\tlet scopeUrl = parentUrl && getMatch( parentUrl, importMap.scopes );\n\twhile ( scopeUrl ) {\n\t\tconst packageResolution = applyPackages(\n\t\t\tresolvedOrPlain,\n\t\t\timportMap.scopes[ scopeUrl ]\n\t\t);\n\t\tif ( packageResolution ) {\n\t\t\treturn packageResolution;\n\t\t}\n\t\tscopeUrl = getMatch(\n\t\t\tscopeUrl.slice( 0, scopeUrl.lastIndexOf( '/' ) ),\n\t\t\timportMap.scopes\n\t\t);\n\t}\n\treturn (\n\t\tapplyPackages( resolvedOrPlain, importMap.imports ) ||\n\t\t( resolvedOrPlain.indexOf( ':' ) !== -1 && resolvedOrPlain )\n\t);\n}\n\nfunction resolveAndComposePackages(\n\tpackages,\n\toutPackages,\n\tbaseUrl,\n\tparentMap\n) {\n\tfor ( const p in packages ) {\n\t\tconst resolvedLhs = resolveIfNotPlainOrUrl( p, baseUrl ) || p;\n\t\tconst target = packages[ p ];\n\t\tif ( typeof target !== 'string' ) {\n\t\t\tcontinue;\n\t\t}\n\t\tconst mapped = resolveImportMap(\n\t\t\tparentMap,\n\t\t\tresolveIfNotPlainOrUrl( target, baseUrl ) || target,\n\t\t\tbaseUrl\n\t\t);\n\t\tif ( mapped ) {\n\t\t\toutPackages[ resolvedLhs ] = mapped;\n\t\t\tcontinue;\n\t\t}\n\t\t// console.warn(\n\t\t// \t`Mapping \"${ p }\" -> \"${ packages[ p ] }\" does not resolve`\n\t\t// );\n\t}\n}\n\nfunction resolveAndComposeImportMap( json, baseUrl, parentMap ) {\n\tconst outMap = {\n\t\timports: Object.assign( {}, parentMap.imports ),\n\t\tscopes: Object.assign( {}, parentMap.scopes ),\n\t};\n\n\tif ( json.imports ) {\n\t\tresolveAndComposePackages(\n\t\t\tjson.imports,\n\t\t\toutMap.imports,\n\t\t\tbaseUrl,\n\t\t\tparentMap\n\t\t);\n\t}\n\n\tif ( json.scopes ) {\n\t\tfor ( const s in json.scopes ) {\n\t\t\tconst resolvedScope = resolveUrl( s, baseUrl );\n\t\t\tresolveAndComposePackages(\n\t\t\t\tjson.scopes[ s ],\n\t\t\t\toutMap.scopes[ resolvedScope ] ||\n\t\t\t\t\t( outMap.scopes[ resolvedScope ] = {} ),\n\t\t\t\tbaseUrl,\n\t\t\t\tparentMap\n\t\t\t);\n\t\t}\n\t}\n\n\treturn outMap;\n}\n\nlet importMap = { imports: {}, scopes: {} };\n\n// TODO: check if this baseURI should change per document, and so\n// it need to be passed as a parameter to methods like `resolve`.\nconst baseUrl = document.baseURI;\nconst pageBaseUrl = baseUrl;\n\n/**\n * Extends the internal dynamic import map with the passed one.\n *\n * @param importMapIn         Import map.\n * @param importMapIn.imports Imports declaration.\n * @param importMapIn.scopes  Scopes declaration.\n */\nexport function addImportMap( importMapIn: {\n\timports?: Record< string, string >;\n\tscopes?: Record< string, any >;\n} ) {\n\timportMap = resolveAndComposeImportMap(\n\t\timportMapIn,\n\t\tpageBaseUrl,\n\t\timportMap\n\t);\n}\n\n/**\n * Resolves the URL of the passed module ID against the current internal\n * dynamic import map.\n *\n * @param id        Module ID.\n * @param parentUrl Parent URL, in case the module ID is relative.\n * @return Resolved module URL.\n */\nexport function resolve( id: string, parentUrl: string ): string {\n\tconst urlResolved = resolveIfNotPlainOrUrl( id, parentUrl );\n\treturn resolveImportMap( importMap, urlResolved || id, parentUrl ) || id;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAeA,MAAM,iBAAiB;AAEvB,SAAS,MAAO,KAAc;AAC7B,MAAK,IAAI,QAAS,GAAI,MAAM,IAAK;AAChC,WAAO;AAAA,EACR;AACA,MAAI;AACH,QAAI,IAAK,GAAI;AACb,WAAO;AAAA,EACR,SAAU,GAAI;AACb,WAAO;AAAA,EACR;AACD;AAEA,SAAS,uBAAwB,QAAQ,WAAY;AACpD,QAAM,OAAO,UAAU,QAAS,GAAI,GACnC,OAAO,UAAU,QAAS,GAAI;AAC/B,MAAK,OAAO,OAAO,IAAK;AACvB,gBAAY,UAAU;AAAA,MACrB;AAAA;AAAA,MAEA,SAAS,KAAK,OAAO,SAAS,MAAM,OAAO,OAAO,OAAO;AAAA,IAC1D;AAAA,EACD;AACA,MAAK,OAAO,QAAS,IAAK,MAAM,IAAK;AACpC,aAAS,OAAO,QAAS,gBAAgB,GAAI;AAAA,EAC9C;AAEA,MAAK,OAAQ,CAAE,MAAM,OAAO,OAAQ,CAAE,MAAM,KAAM;AACjD,WAAO,UAAU,MAAO,GAAG,UAAU,QAAS,GAAI,IAAI,CAAE,IAAI;AAAA,EAC7D,WAGG,OAAQ,CAAE,MAAM,QACf,OAAQ,CAAE,MAAM,OACf,OAAQ,CAAE,MAAM,QACf,OAAQ,CAAE,MAAM,OACf,OAAO,WAAW,MAAO,UAAU,SACrC,OAAO,WAAW,MAAO,UAAU,SACvC,OAAQ,CAAE,MAAM,KACf;AACD,UAAM,iBAAiB,UAAU;AAAA,MAChC;AAAA,MACA,UAAU,QAAS,GAAI,IAAI;AAAA,IAC5B;AAMA,QAAI;AACJ,QAAK,UAAW,eAAe,SAAS,CAAE,MAAM,KAAM;AAErD,UAAK,mBAAmB,SAAU;AACjC,mBAAW,UAAU,MAAO,eAAe,SAAS,CAAE;AACtD,mBAAW,SAAS,MAAO,SAAS,QAAS,GAAI,IAAI,CAAE;AAAA,MACxD,OAAO;AACN,mBAAW,UAAU,MAAO,CAAE;AAAA,MAC/B;AAAA,IACD,OAAO;AAEN,iBAAW,UAAU;AAAA,QACpB,eAAe,UACZ,UAAW,eAAe,MAAO,MAAM;AAAA,MAC3C;AAAA,IACD;AAEA,QAAK,OAAQ,CAAE,MAAM,KAAM;AAC1B,aACC,UAAU,MAAO,GAAG,UAAU,SAAS,SAAS,SAAS,CAAE,IAC3D;AAAA,IAEF;AAKA,UAAM,YACL,SAAS,MAAO,GAAG,SAAS,YAAa,GAAI,IAAI,CAAE,IAAI;AAExD,UAAM,SAAS,CAAC;AAChB,QAAI,eAAe;AACnB,aAAU,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAM;AAE5C,UAAK,iBAAiB,IAAK;AAC1B,YAAK,UAAW,CAAE,MAAM,KAAM;AAC7B,iBAAO,KAAM,UAAU,MAAO,cAAc,IAAI,CAAE,CAAE;AACpD,yBAAe;AAAA,QAChB;AACA;AAAA,MACD,WAEU,UAAW,CAAE,MAAM,KAAM;AAElC,YACC,UAAW,IAAI,CAAE,MAAM,QACrB,UAAW,IAAI,CAAE,MAAM,OAAO,IAAI,MAAM,UAAU,SACnD;AACD,iBAAO,IAAI;AACX,eAAK;AACL;AAAA,QACD,WAGC,UAAW,IAAI,CAAE,MAAM,OACvB,IAAI,MAAM,UAAU,QACnB;AACD,eAAK;AACL;AAAA,QACD;AAAA,MACD;AAEA,aAAQ,UAAW,CAAE,MAAM,KAAM;AAChC;AAAA,MACD;AACA,qBAAe;AAAA,IAChB;AAEA,QAAK,iBAAiB,IAAK;AAC1B,aAAO,KAAM,UAAU,MAAO,YAAa,CAAE;AAAA,IAC9C;AACA,WACC,UAAU,MAAO,GAAG,UAAU,SAAS,SAAS,MAAO,IACvD,OAAO,KAAM,EAAG;AAAA,EAElB;AACD;AAEA,SAAS,WAAY,QAAQ,WAAY;AACxC,SACC,uBAAwB,QAAQ,SAAU,MACxC,MAAO,MAAO,IACb,SACA,uBAAwB,OAAO,QAAQ,SAAU;AAEtD;AAEA,SAAS,SAAU,MAAM,UAAW;AACnC,MAAK,SAAU,IAAK,GAAI;AACvB,WAAO;AAAA,EACR;AACA,MAAI,WAAW,KAAK;AACpB,KAAG;AACF,UAAM,UAAU,KAAK,MAAO,GAAG,WAAW,CAAE;AAC5C,QAAK,WAAW,UAAW;AAC1B,aAAO;AAAA,IACR;AAAA,EACD,UAAY,WAAW,KAAK,YAAa,KAAK,WAAW,CAAE,OAAQ;AACpE;AAEA,SAAS,cAAe,IAAI,UAAW;AACtC,QAAM,UAAU,SAAU,IAAI,QAAS;AACvC,MAAK,SAAU;AACd,UAAM,MAAM,SAAU,OAAQ;AAC9B,QAAK,QAAQ,MAAO;AACnB;AAAA,IACD;AACA,WAAO,MAAM,GAAG,MAAO,QAAQ,MAAO;AAAA,EACvC;AACD;AAEA,SAAS,iBAAkBA,YAAW,iBAAiB,WAAY;AAClE,MAAI,WAAW,aAAa,SAAU,WAAWA,WAAU,MAAO;AAClE,SAAQ,UAAW;AAClB,UAAM,oBAAoB;AAAA,MACzB;AAAA,MACAA,WAAU,OAAQ,QAAS;AAAA,IAC5B;AACA,QAAK,mBAAoB;AACxB,aAAO;AAAA,IACR;AACA,eAAW;AAAA,MACV,SAAS,MAAO,GAAG,SAAS,YAAa,GAAI,CAAE;AAAA,MAC/CA,WAAU;AAAA,IACX;AAAA,EACD;AACA,SACC,cAAe,iBAAiBA,WAAU,OAAQ,KAChD,gBAAgB,QAAS,GAAI,MAAM,MAAM;AAE7C;AAEA,SAAS,0BACR,UACA,aACAC,UACA,WACC;AACD,aAAY,KAAK,UAAW;AAC3B,UAAM,cAAc,uBAAwB,GAAGA,QAAQ,KAAK;AAC5D,UAAM,SAAS,SAAU,CAAE;AAC3B,QAAK,OAAO,WAAW,UAAW;AACjC;AAAA,IACD;AACA,UAAM,SAAS;AAAA,MACd;AAAA,MACA,uBAAwB,QAAQA,QAAQ,KAAK;AAAA,MAC7CA;AAAA,IACD;AACA,QAAK,QAAS;AACb,kBAAa,WAAY,IAAI;AAC7B;AAAA,IACD;AAAA,EAID;AACD;AAEA,SAAS,2BAA4B,MAAMA,UAAS,WAAY;AAC/D,QAAM,SAAS;AAAA,IACd,SAAS,OAAO,OAAQ,CAAC,GAAG,UAAU,OAAQ;AAAA,IAC9C,QAAQ,OAAO,OAAQ,CAAC,GAAG,UAAU,MAAO;AAAA,EAC7C;AAEA,MAAK,KAAK,SAAU;AACnB;AAAA,MACC,KAAK;AAAA,MACL,OAAO;AAAA,MACPA;AAAA,MACA;AAAA,IACD;AAAA,EACD;AAEA,MAAK,KAAK,QAAS;AAClB,eAAY,KAAK,KAAK,QAAS;AAC9B,YAAM,gBAAgB,WAAY,GAAGA,QAAQ;AAC7C;AAAA,QACC,KAAK,OAAQ,CAAE;AAAA,QACf,OAAO,OAAQ,aAAc,MAC1B,OAAO,OAAQ,aAAc,IAAI,CAAC;AAAA,QACrCA;AAAA,QACA;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AACR;AAEA,IAAI,YAAY,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC,EAAE;AAI1C,MAAM,UAAU,SAAS;AACzB,MAAM,cAAc;AASb,SAAS,aAAc,aAG1B;AACH,cAAY;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AAUO,SAAS,QAAS,IAAY,WAA4B;AAChE,QAAM,cAAc,uBAAwB,IAAI,SAAU;AAC1D,SAAO,iBAAkB,WAAW,eAAe,IAAI,SAAU,KAAK;AACvE;",
+  "names": ["importMap", "baseUrl"]
+}

package/build/assets/script-modules.js

@@ -1,64 +1,52 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var script_modules_exports = {};
+__export(script_modules_exports, {
+  importScriptModules: () => importScriptModules,
+  markScriptModuleAsResolved: () => markScriptModuleAsResolved,
+  preloadScriptModules: () => preloadScriptModules
 });
-exports.preloadScriptModules = exports.markScriptModuleAsResolved = exports.importScriptModules = void 0;
-var _dynamicImportmap = require("./dynamic-importmap");
-/**
- * Internal dependencies
- */
-
-/**
- * IDs of modules that should be resolved by the browser rather than
- * processed internally.
- */
-const resolvedScriptModules = new Set();
-
-/**
- * Marks the specified module as natively resolved.
- * @param url Script module URL.
- */
-const markScriptModuleAsResolved = url => {
+module.exports = __toCommonJS(script_modules_exports);
+var import_dynamic_importmap = require("./dynamic-importmap");
+const resolvedScriptModules = /* @__PURE__ */ new Set();
+const markScriptModuleAsResolved = (url) => {
   resolvedScriptModules.add(url);
 };
-
-/**
- * Resolves and fetches modules present in the passed document, using the
- * document's import map to resolve them.
- *
- * @param doc Document containing the modules to preload.
- * @return Array of promises that resolve to a `ScriptModuleLoad` instance.
- */
-exports.markScriptModuleAsResolved = markScriptModuleAsResolved;
-const preloadScriptModules = doc => {
-  // Extract the import map from the document.
-  const importMapElement = doc.querySelector('script#wp-importmap[type=importmap]');
-  const importMap = importMapElement ? JSON.parse(importMapElement.text) : {
-    imports: {},
-    scopes: {}
-  };
-
-  // Remove imports also in the initial page's import map.
-  // Those should be handled natively.
-  for (const key in _dynamicImportmap.initialImportMap.imports) {
+const preloadScriptModules = (doc) => {
+  const importMapElement = doc.querySelector(
+    "script#wp-importmap[type=importmap]"
+  );
+  const importMap = importMapElement ? JSON.parse(importMapElement.text) : { imports: {}, scopes: {} };
+  for (const key in import_dynamic_importmap.initialImportMap.imports) {
     delete importMap.imports[key];
   }
-
-  // Get the URL of all modules contained in the document.
-  const moduleUrls = [...doc.querySelectorAll('script[type=module][src]')].map(s => s.src);
-
-  // Resolve and fetch those not resolved natively.
-  return moduleUrls.filter(url => !resolvedScriptModules.has(url)).map(url => (0, _dynamicImportmap.preloadWithMap)(url, importMap));
+  const moduleUrls = [
+    ...doc.querySelectorAll(
+      "script[type=module][src]"
+    )
+  ].map((s) => s.src);
+  return moduleUrls.filter((url) => !resolvedScriptModules.has(url)).map((url) => (0, import_dynamic_importmap.preloadWithMap)(url, importMap));
 };
-
-/**
- * Imports modules respresented by the passed `ScriptModuleLoad` instances.
- *
- * @param modules Array of `MoudleLoad` instances.
- * @return Promise that resolves once all modules are imported.
- */
-exports.preloadScriptModules = preloadScriptModules;
-const importScriptModules = modules => Promise.all(modules.map(m => (0, _dynamicImportmap.importPreloadedModule)(m)));
-exports.importScriptModules = importScriptModules;
-//# sourceMappingURL=script-modules.js.map
+const importScriptModules = (modules) => Promise.all(modules.map((m) => (0, import_dynamic_importmap.importPreloadedModule)(m)));
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  importScriptModules,
+  markScriptModuleAsResolved,
+  preloadScriptModules
+});
+//# sourceMappingURL=script-modules.js.map

package/build/assets/script-modules.js.map

@@ -1 +1,7 @@
-{"version":3,"names":["_dynamicImportmap","require","resolvedScriptModules","Set","markScriptModuleAsResolved","url","add","exports","preloadScriptModules","doc","importMapElement","querySelector","importMap","JSON","parse","text","imports","scopes","key","initialImportMap","moduleUrls","querySelectorAll","map","s","src","filter","has","preloadWithMap","importScriptModules","modules","Promise","all","m","importPreloadedModule"],"sources":["@wordpress/interactivity-router/src/assets/script-modules.ts"],"sourcesContent":["/**\n * Internal dependencies\n */\nimport {\n\tinitialImportMap,\n\timportPreloadedModule,\n\tpreloadWithMap,\n\ttype ModuleLoad,\n} from './dynamic-importmap';\n\n/**\n * IDs of modules that should be resolved by the browser rather than\n * processed internally.\n */\nconst resolvedScriptModules = new Set< string >();\n\n/**\n * Marks the specified module as natively resolved.\n * @param url Script module URL.\n */\nexport const markScriptModuleAsResolved = ( url: string ) => {\n\tresolvedScriptModules.add( url );\n};\n\n/**\n * Resolves and fetches modules present in the passed document, using the\n * document's import map to resolve them.\n *\n * @param doc Document containing the modules to preload.\n * @return Array of promises that resolve to a `ScriptModuleLoad` instance.\n */\nexport const preloadScriptModules = ( doc: Document ) => {\n\t// Extract the import map from the document.\n\tconst importMapElement = doc.querySelector< HTMLScriptElement >(\n\t\t'script#wp-importmap[type=importmap]'\n\t);\n\tconst importMap = importMapElement\n\t\t? JSON.parse( importMapElement.text )\n\t\t: { imports: {}, scopes: {} };\n\n\t// Remove imports also in the initial page's import map.\n\t// Those should be handled natively.\n\tfor ( const key in initialImportMap.imports ) {\n\t\tdelete importMap.imports[ key ];\n\t}\n\n\t// Get the URL of all modules contained in the document.\n\tconst moduleUrls = [\n\t\t...doc.querySelectorAll< HTMLScriptElement >(\n\t\t\t'script[type=module][src]'\n\t\t),\n\t].map( ( s ) => s.src );\n\n\t// Resolve and fetch those not resolved natively.\n\treturn moduleUrls\n\t\t.filter( ( url ) => ! resolvedScriptModules.has( url ) )\n\t\t.map( ( url ) => preloadWithMap( url, importMap ) );\n};\n\n/**\n * Imports modules respresented by the passed `ScriptModuleLoad` instances.\n *\n * @param modules Array of `MoudleLoad` instances.\n * @return Promise that resolves once all modules are imported.\n */\nexport const importScriptModules = ( modules: ScriptModuleLoad[] ) =>\n\tPromise.all( modules.map( ( m ) => importPreloadedModule( m ) ) );\n\nexport type ScriptModuleLoad = ModuleLoad;\n"],"mappings":";;;;;;AAGA,IAAAA,iBAAA,GAAAC,OAAA;AAHA;AACA;AACA;;AAQA;AACA;AACA;AACA;AACA,MAAMC,qBAAqB,GAAG,IAAIC,GAAG,CAAW,CAAC;;AAEjD;AACA;AACA;AACA;AACO,MAAMC,0BAA0B,GAAKC,GAAW,IAAM;EAC5DH,qBAAqB,CAACI,GAAG,CAAED,GAAI,CAAC;AACjC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AANAE,OAAA,CAAAH,0BAAA,GAAAA,0BAAA;AAOO,MAAMI,oBAAoB,GAAKC,GAAa,IAAM;EACxD;EACA,MAAMC,gBAAgB,GAAGD,GAAG,CAACE,aAAa,CACzC,qCACD,CAAC;EACD,MAAMC,SAAS,GAAGF,gBAAgB,GAC/BG,IAAI,CAACC,KAAK,CAAEJ,gBAAgB,CAACK,IAAK,CAAC,GACnC;IAAEC,OAAO,EAAE,CAAC,CAAC;IAAEC,MAAM,EAAE,CAAC;EAAE,CAAC;;EAE9B;EACA;EACA,KAAM,MAAMC,GAAG,IAAIC,kCAAgB,CAACH,OAAO,EAAG;IAC7C,OAAOJ,SAAS,CAACI,OAAO,CAAEE,GAAG,CAAE;EAChC;;EAEA;EACA,MAAME,UAAU,GAAG,CAClB,GAAGX,GAAG,CAACY,gBAAgB,CACtB,0BACD,CAAC,CACD,CAACC,GAAG,CAAIC,CAAC,IAAMA,CAAC,CAACC,GAAI,CAAC;;EAEvB;EACA,OAAOJ,UAAU,CACfK,MAAM,CAAIpB,GAAG,IAAM,CAAEH,qBAAqB,CAACwB,GAAG,CAAErB,GAAI,CAAE,CAAC,CACvDiB,GAAG,CAAIjB,GAAG,IAAM,IAAAsB,gCAAc,EAAEtB,GAAG,EAAEO,SAAU,CAAE,CAAC;AACrD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AALAL,OAAA,CAAAC,oBAAA,GAAAA,oBAAA;AAMO,MAAMoB,mBAAmB,GAAKC,OAA2B,IAC/DC,OAAO,CAACC,GAAG,CAAEF,OAAO,CAACP,GAAG,CAAIU,CAAC,IAAM,IAAAC,uCAAqB,EAAED,CAAE,CAAE,CAAE,CAAC;AAACzB,OAAA,CAAAqB,mBAAA,GAAAA,mBAAA","ignoreList":[]}
+{
+  "version": 3,
+  "sources": ["../../src/assets/script-modules.ts"],
+  "sourcesContent": ["/**\n * Internal dependencies\n */\nimport {\n\tinitialImportMap,\n\timportPreloadedModule,\n\tpreloadWithMap,\n\ttype ModuleLoad,\n} from './dynamic-importmap';\n\n/**\n * IDs of modules that should be resolved by the browser rather than\n * processed internally.\n */\nconst resolvedScriptModules = new Set< string >();\n\n/**\n * Marks the specified module as natively resolved.\n * @param url Script module URL.\n */\nexport const markScriptModuleAsResolved = ( url: string ) => {\n\tresolvedScriptModules.add( url );\n};\n\n/**\n * Resolves and fetches modules present in the passed document, using the\n * document's import map to resolve them.\n *\n * @param doc Document containing the modules to preload.\n * @return Array of promises that resolve to a `ScriptModuleLoad` instance.\n */\nexport const preloadScriptModules = ( doc: Document ) => {\n\t// Extract the import map from the document.\n\tconst importMapElement = doc.querySelector< HTMLScriptElement >(\n\t\t'script#wp-importmap[type=importmap]'\n\t);\n\tconst importMap = importMapElement\n\t\t? JSON.parse( importMapElement.text )\n\t\t: { imports: {}, scopes: {} };\n\n\t// Remove imports also in the initial page's import map.\n\t// Those should be handled natively.\n\tfor ( const key in initialImportMap.imports ) {\n\t\tdelete importMap.imports[ key ];\n\t}\n\n\t// Get the URL of all modules contained in the document.\n\tconst moduleUrls = [\n\t\t...doc.querySelectorAll< HTMLScriptElement >(\n\t\t\t'script[type=module][src]'\n\t\t),\n\t].map( ( s ) => s.src );\n\n\t// Resolve and fetch those not resolved natively.\n\treturn moduleUrls\n\t\t.filter( ( url ) => ! resolvedScriptModules.has( url ) )\n\t\t.map( ( url ) => preloadWithMap( url, importMap ) );\n};\n\n/**\n * Imports modules respresented by the passed `ScriptModuleLoad` instances.\n *\n * @param modules Array of `MoudleLoad` instances.\n * @return Promise that resolves once all modules are imported.\n */\nexport const importScriptModules = ( modules: ScriptModuleLoad[] ) =>\n\tPromise.all( modules.map( ( m ) => importPreloadedModule( m ) ) );\n\nexport type ScriptModuleLoad = ModuleLoad;\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,+BAKO;AAMP,MAAM,wBAAwB,oBAAI,IAAc;AAMzC,MAAM,6BAA6B,CAAE,QAAiB;AAC5D,wBAAsB,IAAK,GAAI;AAChC;AASO,MAAM,uBAAuB,CAAE,QAAmB;AAExD,QAAM,mBAAmB,IAAI;AAAA,IAC5B;AAAA,EACD;AACA,QAAM,YAAY,mBACf,KAAK,MAAO,iBAAiB,IAAK,IAClC,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC,EAAE;AAI7B,aAAY,OAAO,0CAAiB,SAAU;AAC7C,WAAO,UAAU,QAAS,GAAI;AAAA,EAC/B;AAGA,QAAM,aAAa;AAAA,IAClB,GAAG,IAAI;AAAA,MACN;AAAA,IACD;AAAA,EACD,EAAE,IAAK,CAAE,MAAO,EAAE,GAAI;AAGtB,SAAO,WACL,OAAQ,CAAE,QAAS,CAAE,sBAAsB,IAAK,GAAI,CAAE,EACtD,IAAK,CAAE,YAAS,yCAAgB,KAAK,SAAU,CAAE;AACpD;AAQO,MAAM,sBAAsB,CAAE,YACpC,QAAQ,IAAK,QAAQ,IAAK,CAAE,UAAO,gDAAuB,CAAE,CAAE,CAAE;",
+  "names": []
+}

package/build/assets/scs.js

@@ -1,56 +1,43 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var scs_exports = {};
+__export(scs_exports, {
+  shortestCommonSupersequence: () => shortestCommonSupersequence
 });
-exports.shortestCommonSupersequence = shortestCommonSupersequence;
-/**
- * Calculates the Shortest Common Supersequence (SCS) of two sequences.
- *
- * A supersequence is a sequence that contains both input sequences as subsequences.
- * The shortest common supersequence is the shortest possible such sequence.
- *
- * This implementation uses dynamic programming with a time complexity of O(mn)
- * and space complexity of O(mn), where m and n are the lengths of sequences X and Y.
- *
- * @example
- * ```ts
- * const seq1 = [1, 3, 5];
- * const seq2 = [2, 3, 4];
- * const scs = shortestCommonSupersequence(seq1, seq2); // [1, 2, 3, 4, 5]
- * ```
- *
- * @param X       The first sequence.
- * @param Y       The second sequence.
- * @param isEqual Optional equality function to compare elements.
- *                Defaults to strict equality (===).
- * @return The shortest common supersequence of X and Y.
- */
+module.exports = __toCommonJS(scs_exports);
 function shortestCommonSupersequence(X, Y, isEqual = (a, b) => a === b) {
   const m = X.length;
   const n = Y.length;
-
-  // Create a 2D dp table where dp[i][j] is the SCS for X[0..i-1] and Y[0..j-1].
-  const dp = Array.from({
-    length: m + 1
-  }, () => Array(n + 1).fill(null));
-
-  // Base cases: one of the sequences is empty.
+  const dp = Array.from(
+    { length: m + 1 },
+    () => Array(n + 1).fill(null)
+  );
   for (let i = 0; i <= m; i++) {
     dp[i][0] = X.slice(0, i);
   }
   for (let j = 0; j <= n; j++) {
     dp[0][j] = Y.slice(0, j);
   }
-
-  // Fill in the dp table.
   for (let i = 1; i <= m; i++) {
     for (let j = 1; j <= n; j++) {
       if (isEqual(X[i - 1], Y[j - 1])) {
-        // When X[i-1] equals Y[j-1], use the reference from X.
         dp[i][j] = dp[i - 1][j - 1].concat(X[i - 1]);
       } else {
-        // Choose the shorter option between appending X[i-1] or Y[j-1].
         const option1 = dp[i - 1][j].concat(X[i - 1]);
         const option2 = dp[i][j - 1].concat(Y[j - 1]);
         dp[i][j] = option1.length <= option2.length ? option1 : option2;
@@ -59,4 +46,8 @@ function shortestCommonSupersequence(X, Y, isEqual = (a, b) => a === b) {
   }
   return dp[m][n];
 }
-//# sourceMappingURL=scs.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  shortestCommonSupersequence
+});
+//# sourceMappingURL=scs.js.map

package/build/assets/scs.js.map

@@ -1 +1,7 @@
-{"version":3,"names":["shortestCommonSupersequence","X","Y","isEqual","a","b","m","length","n","dp","Array","from","fill","i","slice","j","concat","option1","option2"],"sources":["@wordpress/interactivity-router/src/assets/scs.ts"],"sourcesContent":["/**\n * Calculates the Shortest Common Supersequence (SCS) of two sequences.\n *\n * A supersequence is a sequence that contains both input sequences as subsequences.\n * The shortest common supersequence is the shortest possible such sequence.\n *\n * This implementation uses dynamic programming with a time complexity of O(mn)\n * and space complexity of O(mn), where m and n are the lengths of sequences X and Y.\n *\n * @example\n * ```ts\n * const seq1 = [1, 3, 5];\n * const seq2 = [2, 3, 4];\n * const scs = shortestCommonSupersequence(seq1, seq2); // [1, 2, 3, 4, 5]\n * ```\n *\n * @param X       The first sequence.\n * @param Y       The second sequence.\n * @param isEqual Optional equality function to compare elements.\n *                Defaults to strict equality (===).\n * @return The shortest common supersequence of X and Y.\n */\nexport function shortestCommonSupersequence< E = unknown >(\n\tX: E[],\n\tY: E[],\n\tisEqual = ( a: E, b: E ) => a === b\n) {\n\tconst m = X.length;\n\tconst n = Y.length;\n\n\t// Create a 2D dp table where dp[i][j] is the SCS for X[0..i-1] and Y[0..j-1].\n\tconst dp: E[][][] = Array.from( { length: m + 1 }, () =>\n\t\tArray( n + 1 ).fill( null )\n\t);\n\n\t// Base cases: one of the sequences is empty.\n\tfor ( let i = 0; i <= m; i++ ) {\n\t\tdp[ i ][ 0 ] = X.slice( 0, i );\n\t}\n\tfor ( let j = 0; j <= n; j++ ) {\n\t\tdp[ 0 ][ j ] = Y.slice( 0, j );\n\t}\n\n\t// Fill in the dp table.\n\tfor ( let i = 1; i <= m; i++ ) {\n\t\tfor ( let j = 1; j <= n; j++ ) {\n\t\t\tif ( isEqual( X[ i - 1 ], Y[ j - 1 ] ) ) {\n\t\t\t\t// When X[i-1] equals Y[j-1], use the reference from X.\n\t\t\t\tdp[ i ][ j ] = dp[ i - 1 ][ j - 1 ].concat( X[ i - 1 ] );\n\t\t\t} else {\n\t\t\t\t// Choose the shorter option between appending X[i-1] or Y[j-1].\n\t\t\t\tconst option1 = dp[ i - 1 ][ j ].concat( X[ i - 1 ] );\n\t\t\t\tconst option2 = dp[ i ][ j - 1 ].concat( Y[ j - 1 ] );\n\t\t\t\tdp[ i ][ j ] =\n\t\t\t\t\toption1.length <= option2.length ? option1 : option2;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[ m ][ n ];\n}\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,2BAA2BA,CAC1CC,CAAM,EACNC,CAAM,EACNC,OAAO,GAAGA,CAAEC,CAAI,EAAEC,CAAI,KAAMD,CAAC,KAAKC,CAAC,EAClC;EACD,MAAMC,CAAC,GAAGL,CAAC,CAACM,MAAM;EAClB,MAAMC,CAAC,GAAGN,CAAC,CAACK,MAAM;;EAElB;EACA,MAAME,EAAW,GAAGC,KAAK,CAACC,IAAI,CAAE;IAAEJ,MAAM,EAAED,CAAC,GAAG;EAAE,CAAC,EAAE,MAClDI,KAAK,CAAEF,CAAC,GAAG,CAAE,CAAC,CAACI,IAAI,CAAE,IAAK,CAC3B,CAAC;;EAED;EACA,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIP,CAAC,EAAEO,CAAC,EAAE,EAAG;IAC9BJ,EAAE,CAAEI,CAAC,CAAE,CAAE,CAAC,CAAE,GAAGZ,CAAC,CAACa,KAAK,CAAE,CAAC,EAAED,CAAE,CAAC;EAC/B;EACA,KAAM,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIP,CAAC,EAAEO,CAAC,EAAE,EAAG;IAC9BN,EAAE,CAAE,CAAC,CAAE,CAAEM,CAAC,CAAE,GAAGb,CAAC,CAACY,KAAK,CAAE,CAAC,EAAEC,CAAE,CAAC;EAC/B;;EAEA;EACA,KAAM,IAAIF,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIP,CAAC,EAAEO,CAAC,EAAE,EAAG;IAC9B,KAAM,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIP,CAAC,EAAEO,CAAC,EAAE,EAAG;MAC9B,IAAKZ,OAAO,CAAEF,CAAC,CAAEY,CAAC,GAAG,CAAC,CAAE,EAAEX,CAAC,CAAEa,CAAC,GAAG,CAAC,CAAG,CAAC,EAAG;QACxC;QACAN,EAAE,CAAEI,CAAC,CAAE,CAAEE,CAAC,CAAE,GAAGN,EAAE,CAAEI,CAAC,GAAG,CAAC,CAAE,CAAEE,CAAC,GAAG,CAAC,CAAE,CAACC,MAAM,CAAEf,CAAC,CAAEY,CAAC,GAAG,CAAC,CAAG,CAAC;MACzD,CAAC,MAAM;QACN;QACA,MAAMI,OAAO,GAAGR,EAAE,CAAEI,CAAC,GAAG,CAAC,CAAE,CAAEE,CAAC,CAAE,CAACC,MAAM,CAAEf,CAAC,CAAEY,CAAC,GAAG,CAAC,CAAG,CAAC;QACrD,MAAMK,OAAO,GAAGT,EAAE,CAAEI,CAAC,CAAE,CAAEE,CAAC,GAAG,CAAC,CAAE,CAACC,MAAM,CAAEd,CAAC,CAAEa,CAAC,GAAG,CAAC,CAAG,CAAC;QACrDN,EAAE,CAAEI,CAAC,CAAE,CAAEE,CAAC,CAAE,GACXE,OAAO,CAACV,MAAM,IAAIW,OAAO,CAACX,MAAM,GAAGU,OAAO,GAAGC,OAAO;MACtD;IACD;EACD;EAEA,OAAOT,EAAE,CAAEH,CAAC,CAAE,CAAEE,CAAC,CAAE;AACpB","ignoreList":[]}
+{
+  "version": 3,
+  "sources": ["../../src/assets/scs.ts"],
+  "sourcesContent": ["/**\n * Calculates the Shortest Common Supersequence (SCS) of two sequences.\n *\n * A supersequence is a sequence that contains both input sequences as subsequences.\n * The shortest common supersequence is the shortest possible such sequence.\n *\n * This implementation uses dynamic programming with a time complexity of O(mn)\n * and space complexity of O(mn), where m and n are the lengths of sequences X and Y.\n *\n * @example\n * ```ts\n * const seq1 = [1, 3, 5];\n * const seq2 = [2, 3, 4];\n * const scs = shortestCommonSupersequence(seq1, seq2); // [1, 2, 3, 4, 5]\n * ```\n *\n * @param X       The first sequence.\n * @param Y       The second sequence.\n * @param isEqual Optional equality function to compare elements.\n *                Defaults to strict equality (===).\n * @return The shortest common supersequence of X and Y.\n */\nexport function shortestCommonSupersequence< E = unknown >(\n\tX: E[],\n\tY: E[],\n\tisEqual = ( a: E, b: E ) => a === b\n) {\n\tconst m = X.length;\n\tconst n = Y.length;\n\n\t// Create a 2D dp table where dp[i][j] is the SCS for X[0..i-1] and Y[0..j-1].\n\tconst dp: E[][][] = Array.from( { length: m + 1 }, () =>\n\t\tArray( n + 1 ).fill( null )\n\t);\n\n\t// Base cases: one of the sequences is empty.\n\tfor ( let i = 0; i <= m; i++ ) {\n\t\tdp[ i ][ 0 ] = X.slice( 0, i );\n\t}\n\tfor ( let j = 0; j <= n; j++ ) {\n\t\tdp[ 0 ][ j ] = Y.slice( 0, j );\n\t}\n\n\t// Fill in the dp table.\n\tfor ( let i = 1; i <= m; i++ ) {\n\t\tfor ( let j = 1; j <= n; j++ ) {\n\t\t\tif ( isEqual( X[ i - 1 ], Y[ j - 1 ] ) ) {\n\t\t\t\t// When X[i-1] equals Y[j-1], use the reference from X.\n\t\t\t\tdp[ i ][ j ] = dp[ i - 1 ][ j - 1 ].concat( X[ i - 1 ] );\n\t\t\t} else {\n\t\t\t\t// Choose the shorter option between appending X[i-1] or Y[j-1].\n\t\t\t\tconst option1 = dp[ i - 1 ][ j ].concat( X[ i - 1 ] );\n\t\t\t\tconst option2 = dp[ i ][ j - 1 ].concat( Y[ j - 1 ] );\n\t\t\t\tdp[ i ][ j ] =\n\t\t\t\t\toption1.length <= option2.length ? option1 : option2;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[ m ][ n ];\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAsBO,SAAS,4BACf,GACA,GACA,UAAU,CAAE,GAAM,MAAU,MAAM,GACjC;AACD,QAAM,IAAI,EAAE;AACZ,QAAM,IAAI,EAAE;AAGZ,QAAM,KAAc,MAAM;AAAA,IAAM,EAAE,QAAQ,IAAI,EAAE;AAAA,IAAG,MAClD,MAAO,IAAI,CAAE,EAAE,KAAM,IAAK;AAAA,EAC3B;AAGA,WAAU,IAAI,GAAG,KAAK,GAAG,KAAM;AAC9B,OAAI,CAAE,EAAG,CAAE,IAAI,EAAE,MAAO,GAAG,CAAE;AAAA,EAC9B;AACA,WAAU,IAAI,GAAG,KAAK,GAAG,KAAM;AAC9B,OAAI,CAAE,EAAG,CAAE,IAAI,EAAE,MAAO,GAAG,CAAE;AAAA,EAC9B;AAGA,WAAU,IAAI,GAAG,KAAK,GAAG,KAAM;AAC9B,aAAU,IAAI,GAAG,KAAK,GAAG,KAAM;AAC9B,UAAK,QAAS,EAAG,IAAI,CAAE,GAAG,EAAG,IAAI,CAAE,CAAE,GAAI;AAExC,WAAI,CAAE,EAAG,CAAE,IAAI,GAAI,IAAI,CAAE,EAAG,IAAI,CAAE,EAAE,OAAQ,EAAG,IAAI,CAAE,CAAE;AAAA,MACxD,OAAO;AAEN,cAAM,UAAU,GAAI,IAAI,CAAE,EAAG,CAAE,EAAE,OAAQ,EAAG,IAAI,CAAE,CAAE;AACpD,cAAM,UAAU,GAAI,CAAE,EAAG,IAAI,CAAE,EAAE,OAAQ,EAAG,IAAI,CAAE,CAAE;AACpD,WAAI,CAAE,EAAG,CAAE,IACV,QAAQ,UAAU,QAAQ,SAAS,UAAU;AAAA,MAC/C;AAAA,IACD;AAAA,EACD;AAEA,SAAO,GAAI,CAAE,EAAG,CAAE;AACnB;",
+  "names": []
+}