superbee 0.2.1-pre.1 → 0.2.1-pre.2

package/dist/publication.mjs

@@ -30821,7 +30821,7 @@ var require_jsx_runtime = __commonJS({
 });
 
 // ../publication/src/capture.ts
-import { createHash as createHash4 } from "node:crypto";
+import { createHash as createHash3 } from "node:crypto";
 import { lstat, readdir, realpath, stat } from "node:fs/promises";
 import path5 from "node:path";
 
@@ -32083,8 +32083,161 @@ var nodeFilesystemIdentityPort = Object.freeze({
   }
 });
 
-// ../core/src/versioning.ts
-import { createHash as createHash3 } from "node:crypto";
+// ../core/src/sha256.ts
+var K = new Uint32Array([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]);
+var INITIAL_STATE = new Uint32Array([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
+var encoder = new TextEncoder();
+function rotr(value, bits) {
+  return value >>> bits | value << 32 - bits;
+}
+function compress(h, w, view, offset) {
+  for (let i = 0; i < 16; i++) {
+    w[i] = view.getUint32(offset + i * 4);
+  }
+  for (let i = 16; i < 64; i++) {
+    const w15 = w[i - 15];
+    const w2 = w[i - 2];
+    const s0 = rotr(w15, 7) ^ rotr(w15, 18) ^ w15 >>> 3;
+    const s1 = rotr(w2, 17) ^ rotr(w2, 19) ^ w2 >>> 10;
+    w[i] = w[i - 16] + s0 + w[i - 7] + s1 >>> 0;
+  }
+  let a = h[0];
+  let b = h[1];
+  let c = h[2];
+  let d = h[3];
+  let e = h[4];
+  let f = h[5];
+  let g = h[6];
+  let hh = h[7];
+  for (let i = 0; i < 64; i++) {
+    const S1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);
+    const ch = e & f ^ ~e & g;
+    const t1 = hh + S1 + ch + K[i] + w[i] >>> 0;
+    const S0 = rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22);
+    const maj = a & b ^ a & c ^ b & c;
+    const t2 = S0 + maj >>> 0;
+    hh = g;
+    g = f;
+    f = e;
+    e = d + t1 >>> 0;
+    d = c;
+    c = b;
+    b = a;
+    a = t1 + t2 >>> 0;
+  }
+  h[0] = h[0] + a >>> 0;
+  h[1] = h[1] + b >>> 0;
+  h[2] = h[2] + c >>> 0;
+  h[3] = h[3] + d >>> 0;
+  h[4] = h[4] + e >>> 0;
+  h[5] = h[5] + f >>> 0;
+  h[6] = h[6] + g >>> 0;
+  h[7] = h[7] + hh >>> 0;
+}
+function sha256HexOfBytes(bytes) {
+  const h = new Uint32Array(INITIAL_STATE);
+  const w = new Uint32Array(64);
+  const length = bytes.byteLength;
+  const view = new DataView(bytes.buffer, bytes.byteOffset, length);
+  const fullBlocks = length >>> 6;
+  for (let block = 0; block < fullBlocks; block++) {
+    compress(h, w, view, block * 64);
+  }
+  const remaining = length - fullBlocks * 64;
+  const tail = new Uint8Array(remaining + 1 + 8 > 64 ? 128 : 64);
+  tail.set(bytes.subarray(fullBlocks * 64));
+  tail[remaining] = 128;
+  const tailView = new DataView(tail.buffer);
+  const bitLengthHigh = Math.floor(length / 536870912);
+  const bitLengthLow = length << 3 >>> 0;
+  tailView.setUint32(tail.length - 8, bitLengthHigh);
+  tailView.setUint32(tail.length - 4, bitLengthLow);
+  for (let offset = 0; offset < tail.length; offset += 64) {
+    compress(h, w, tailView, offset);
+  }
+  let hex = "";
+  for (let i = 0; i < 8; i++) {
+    hex += h[i].toString(16).padStart(8, "0");
+  }
+  return hex;
+}
+function sha256HexOfUtf8(input) {
+  return sha256HexOfBytes(encoder.encode(input));
+}
 
 // ../core/src/version-transport.ts
 var VersionConflict = class extends Error {
@@ -32104,16 +32257,17 @@ var VersionConflict = class extends Error {
 
 // ../core/src/versioning.ts
 function sha256Hex(input) {
-  return createHash3("sha256").update(input, "utf8").digest("hex");
+  return sha256HexOfUtf8(input);
 }
 function versionOfBytes(raw) {
   return `sha256:${sha256Hex(raw)}`;
 }
 function blobVersion(bytes) {
-  return `sha256:${createHash3("sha256").update(bytes).digest("hex")}`;
+  return `sha256:${sha256HexOfBytes(bytes)}`;
 }
 function defaultActor() {
-  return process.env.USER?.trim() || process.env.USERNAME?.trim() || process.env.LOGNAME?.trim() || "local";
+  const env = typeof process !== "undefined" ? process.env : void 0;
+  return env?.USER?.trim() || env?.USERNAME?.trim() || env?.LOGNAME?.trim() || "local";
 }
 
 // ../core/src/backend.ts
@@ -32390,9 +32544,19 @@ async function listFilesystemReservedObjects(backend) {
   }).sort((a, b) => reservedPath(a.dir, a.name).localeCompare(reservedPath(b.dir, b.name)));
 }
 
-// ../core/src/bundle.ts
+// ../core/src/bundle-ops.ts
+var defaultBackendFactory;
+function setDefaultBackendFactory(factory) {
+  defaultBackendFactory = factory;
+}
 function backendFor(bundle) {
-  return bundle.backend ?? new FilesystemBackend(bundle.root);
+  if (bundle.backend) return bundle.backend;
+  if (defaultBackendFactory === void 0) {
+    throw new InvalidInputError(
+      `Bundle '${bundle.root}' has no backend and this runtime installs no default: pass bundle.backend explicitly or register one with setDefaultBackendFactory.`
+    );
+  }
+  return defaultBackendFactory(bundle.root);
 }
 async function readBundleOkfVersion2(bundle) {
   return readBundleOkfVersion(backendFor(bundle));
@@ -32410,6 +32574,9 @@ async function queryEdges2(bundle, filter = {}) {
   return queryEdges(backendFor(bundle), filter);
 }
 
+// ../core/src/bundle.ts
+setDefaultBackendFactory((root) => new FilesystemBackend(root));
+
 // ../core/src/kinds.ts
 var CONVENTIONS_PREFIX = "conventions/";
 var CONVENTION_TYPE = "Convention";
@@ -35282,8 +35449,8 @@ function decodeNamedCharacterReference(value) {
 }
 
 // ../../node_modules/micromark-util-chunked/index.js
-function splice(list2, start, remove, items) {
-  const end = list2.length;
+function splice(list3, start, remove, items) {
+  const end = list3.length;
   let chunkStart = 0;
   let parameters;
   if (start < 0) {
@@ -35295,22 +35462,22 @@ function splice(list2, start, remove, items) {
   if (items.length < 1e4) {
     parameters = Array.from(items);
     parameters.unshift(start, remove);
-    list2.splice(...parameters);
+    list3.splice(...parameters);
   } else {
-    if (remove) list2.splice(start, remove);
+    if (remove) list3.splice(start, remove);
     while (chunkStart < items.length) {
       parameters = items.slice(chunkStart, chunkStart + 1e4);
       parameters.unshift(start, 0);
-      list2.splice(...parameters);
+      list3.splice(...parameters);
       chunkStart += 1e4;
       start += 1e4;
     }
   }
 }
-function push(list2, items) {
-  if (list2.length > 0) {
-    splice(list2, list2.length, 0, items);
-    return list2;
+function push(list3, items) {
+  if (list3.length > 0) {
+    splice(list3, list3.length, 0, items);
+    return list3;
   }
   return items;
 }
@@ -35345,12 +35512,12 @@ function syntaxExtension(all2, extension2) {
     }
   }
 }
-function constructs(existing, list2) {
+function constructs(existing, list3) {
   let index2 = -1;
   const before = [];
-  while (++index2 < list2.length) {
+  while (++index2 < list3.length) {
     ;
-    (list2[index2].add === "after" ? existing : before).push(list2[index2]);
+    (list3[index2].add === "after" ? existing : before).push(list3[index2]);
   }
   splice(existing, 0, 0, before);
 }
@@ -36627,13 +36794,13 @@ var SpliceBuffer = class {
     }
   }
 };
-function chunkedPush(list2, right) {
+function chunkedPush(list3, right) {
   let chunkStart = 0;
   if (right.length < 1e4) {
-    list2.push(...right);
+    list3.push(...right);
   } else {
     while (chunkStart < right.length) {
-      list2.push(...right.slice(chunkStart, chunkStart + 1e4));
+      list3.push(...right.slice(chunkStart, chunkStart + 1e4));
       chunkStart += 1e4;
     }
   }
@@ -38381,7 +38548,7 @@ function tokenizeThematicBreak(effects, ok4, nok) {
 }
 
 // ../../node_modules/micromark-core-commonmark/lib/list.js
-var list = {
+var list2 = {
   continuation: {
     tokenize: tokenizeListContinuation
   },
@@ -38487,7 +38654,7 @@ function tokenizeListContinuation(effects, ok4, nok) {
   function notInCurrentItem(code2) {
     self.containerState._closeFlow = true;
     self.interrupt = void 0;
-    return factorySpace(effects, effects.attempt(list, ok4, nok), "linePrefix", self.parser.constructs.disable.null.includes("codeIndented") ? void 0 : 4)(code2);
+    return factorySpace(effects, effects.attempt(list2, ok4, nok), "linePrefix", self.parser.constructs.disable.null.includes("codeIndented") ? void 0 : 4)(code2);
   }
 }
 function tokenizeIndent(effects, ok4, nok) {
@@ -38680,11 +38847,11 @@ function initializeFactory(field) {
       if (code2 === null) {
         return true;
       }
-      const list2 = constructs2[code2];
+      const list3 = constructs2[code2];
       let index2 = -1;
-      if (list2) {
-        while (++index2 < list2.length) {
-          const item = list2[index2];
+      if (list3) {
+        while (++index2 < list3.length) {
+          const item = list3[index2];
           if (!item.previous || item.previous.call(self, self.previous)) {
             return true;
           }
@@ -38793,19 +38960,19 @@ __export(constructs_exports, {
   text: () => text2
 });
 var document2 = {
-  [42]: list,
-  [43]: list,
-  [45]: list,
-  [48]: list,
-  [49]: list,
-  [50]: list,
-  [51]: list,
-  [52]: list,
-  [53]: list,
-  [54]: list,
-  [55]: list,
-  [56]: list,
-  [57]: list,
+  [42]: list2,
+  [43]: list2,
+  [45]: list2,
+  [48]: list2,
+  [49]: list2,
+  [50]: list2,
+  [51]: list2,
+  [52]: list2,
+  [53]: list2,
+  [54]: list2,
+  [55]: list2,
+  [56]: list2,
+  [57]: list2,
   [62]: blockQuote
 };
 var contentInitial = {
@@ -39021,22 +39188,22 @@ function createTokenizer(parser, initialize, from) {
         function start(code2) {
           const left = code2 !== null && map[code2];
           const all2 = code2 !== null && map.null;
-          const list2 = [
+          const list3 = [
             // To do: add more extension tests.
             /* c8 ignore next 2 */
             ...Array.isArray(left) ? left : left ? [left] : [],
             ...Array.isArray(all2) ? all2 : all2 ? [all2] : []
           ];
-          return handleListOfConstructs(list2)(code2);
+          return handleListOfConstructs(list3)(code2);
         }
       }
-      function handleListOfConstructs(list2) {
-        listOfConstructs = list2;
+      function handleListOfConstructs(list3) {
+        listOfConstructs = list3;
         constructIndex = 0;
-        if (list2.length === 0) {
+        if (list3.length === 0) {
           return bogusState;
         }
-        return handleConstruct(list2[constructIndex]);
+        return handleConstruct(list3[constructIndex]);
       }
       function handleConstruct(construct) {
         return start;
@@ -39378,8 +39545,8 @@ function compiler(options) {
       link: opener(link),
       listItem: opener(listItem),
       listItemValue: onenterlistitemvalue,
-      listOrdered: opener(list2, onenterlistordered),
-      listUnordered: opener(list2),
+      listOrdered: opener(list3, onenterlistordered),
+      listUnordered: opener(list3),
       paragraph: opener(paragraph),
       reference: onenterreference,
       referenceString: buffer,
@@ -39935,7 +40102,7 @@ function compiler(options) {
       children: []
     };
   }
-  function list2(token) {
+  function list3(token) {
     return {
       type: "list",
       ordered: token.type === "listOrdered",
@@ -41539,10 +41706,10 @@ function toResult(value) {
 }
 
 // ../../node_modules/mdast-util-find-and-replace/lib/index.js
-function findAndReplace(tree, list2, options) {
+function findAndReplace(tree, list3, options) {
   const settings = options || {};
   const ignored = convert(settings.ignore || []);
-  const pairs = toPairs(list2);
+  const pairs = toPairs(list3);
   let pairIndex = -1;
   while (++pairIndex < pairs.length) {
     visitParents(tree, "text", visitor);
@@ -41626,10 +41793,10 @@ function toPairs(tupleOrList) {
   if (!Array.isArray(tupleOrList)) {
     throw new TypeError("Expected find and replace tuple or list of tuples");
   }
-  const list2 = !tupleOrList[0] || Array.isArray(tupleOrList[0]) ? tupleOrList : [tupleOrList];
+  const list3 = !tupleOrList[0] || Array.isArray(tupleOrList[0]) ? tupleOrList : [tupleOrList];
   let index2 = -1;
-  while (++index2 < list2.length) {
-    const tuple = list2[index2];
+  while (++index2 < list3.length) {
+    const tuple = list3[index2];
     result.push([toExpression(tuple[0]), toFunction(tuple[1])]);
   }
   return result;
@@ -42825,7 +42992,7 @@ async function validatePublicationTree(root, relative = "") {
   }
 }
 function sha256(bytes) {
-  return `sha256:${createHash4("sha256").update(bytes).digest("hex")}`;
+  return `sha256:${createHash3("sha256").update(bytes).digest("hex")}`;
 }
 function utf8(value) {
   return new TextEncoder().encode(value);
@@ -43195,7 +43362,7 @@ async function capturePublicationSnapshot(options) {
 }
 
 // ../publication/src/bridge.ts
-import { createHash as createHash5 } from "node:crypto";
+import { createHash as createHash4 } from "node:crypto";
 
 // ../publication/src/snapshot-backend.ts
 function absent(id) {
@@ -43297,7 +43464,7 @@ var PublicationSnapshotBackend = class {
 // ../publication/src/bridge.ts
 var STATIC_LAUNCH_ID = "publication-snapshot";
 function digest(bytes) {
-  return `sha256:${createHash5("sha256").update(bytes).digest("hex")}`;
+  return `sha256:${createHash4("sha256").update(bytes).digest("hex")}`;
 }
 function createPublicationBridge(options) {
   if (options.protocol !== PUBLICATION_BRIDGE_V0) {