@dxos/util 0.9.1-main.c7dcc2e112 → 0.10.0

package/dist/lib/browser/index.mjs

@@ -1,4 +1,9 @@
 import "@dxos/node-std/globals";
+var __defProp = Object.defineProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
 
 // src/array-to-hex.ts
 var byteToHex = [];
@@ -84,7 +89,7 @@ var intersectBy = (arrays, selector) => {
       ...arrays[0]
     ];
   }
-  const [first, ...rest] = arrays;
+  const [first2, ...rest] = arrays;
   const lookups = rest.map((array) => {
     const map = /* @__PURE__ */ new Map();
     for (const item of array) {
@@ -92,7 +97,7 @@ var intersectBy = (arrays, selector) => {
     }
     return map;
   });
-  return first.filter((item) => {
+  return first2.filter((item) => {
     const key = selector(item);
     return lookups.every((lookup) => lookup.has(key));
   });
@@ -149,11 +154,11 @@ var BitField = class _BitField {
     }
     return result;
   }
-  static and(first, second) {
-    invariant(first.length === second.length, "Bitfields must be of the same length");
-    const result = new Uint8Array(first.length);
-    for (let i = 0; i < first.length; i++) {
-      result[i] = first[i] & second[i];
+  static and(first2, second) {
+    invariant(first2.length === second.length, "Bitfields must be of the same length");
+    const result = new Uint8Array(first2.length);
+    for (let i = 0; i < first2.length; i++) {
+      result[i] = first2[i] & second[i];
     }
     return result;
   }
@@ -1507,17 +1512,22 @@ var getHostPlatform = () => {
   }
 };
 
-// src/position.ts
-var byPosition = ({ position: a }, { position: b }) => {
-  if (a === b) {
-    return 0;
-  } else if (a === "first" || b === "last") {
-    return -1;
-  } else if (b === "first" || a === "last") {
-    return 1;
-  } else {
+// src/Position.ts
+var Position_exports = {};
+__export(Position_exports, {
+  compare: () => compare,
+  first: () => first,
+  last: () => last
+});
+var first = -Infinity;
+var last = Infinity;
+var compare = ({ position: a }, { position: b }) => {
+  const aVal = a ?? 0;
+  const bVal = b ?? 0;
+  if (aVal === bVal) {
     return 0;
   }
+  return aVal < bVal ? -1 : 1;
 };
 
 // src/random.ts
@@ -2227,11 +2237,11 @@ var stringifyTree = (node, ancestors = [], rows = []) => {
     const name = (node2) => truncateKey(node2.id, keyLen);
     const parts = [];
     ancestors.forEach(([node2, i], j) => {
-      const first = ancestors.slice(j).every(([_, i2]) => i2 === 0);
-      parts.push(j === 0 ? first ? "\u251C" : " " : "");
-      parts.push(first ? `\u2500(${name(node2)})\u2500` : "".padEnd(keyLen + 4));
+      const first2 = ancestors.slice(j).every(([_, i2]) => i2 === 0);
+      parts.push(j === 0 ? first2 ? "\u251C" : " " : "");
+      parts.push(first2 ? `\u2500(${name(node2)})\u2500` : "".padEnd(keyLen + 4));
       if (node2.children) {
-        if (first) {
+        if (first2) {
           parts.push(node2.children.length > 1 ? "\u252C" : "\u2500");
         } else {
           const childFirst = ancestors.slice(j + 1).every(([_, i2]) => i2 === 0);
@@ -2545,6 +2555,7 @@ export {
   ComplexSet,
   HumanHasher,
   MapEntry,
+  Position_exports as Position,
   SKIP,
   SlidingWindowSummary,
   Tracer,
@@ -2559,7 +2570,6 @@ export {
   arraysEqual,
   assumeType,
   bufferToArray,
-  byPosition,
   capitalize,
   chunkArray,
   clamp,