@dxos/util 0.8.4-staging.ac66bdf99f → 0.9.0

package/LICENSE

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

package/dist/lib/browser/index.mjs

@@ -119,7 +119,6 @@ var createBinder = (obj) => ({
 
 // src/bitfield.ts
 import { invariant } from "@dxos/invariant";
-var __dxlog_file = "/__w/dxos/dxos/packages/common/util/src/bitfield.ts";
 var BitField = class _BitField {
   static get(data, idx) {
     const bit = data[idx >> 3] >> 7 - idx % 8 & 1;
@@ -151,15 +150,7 @@ var BitField = class _BitField {
     return result;
   }
   static and(first, second) {
-    invariant(first.length === second.length, "Bitfields must be of the same length", {
-      F: __dxlog_file,
-      L: 52,
-      S: this,
-      A: [
-        "first.length === second.length",
-        "'Bitfields must be of the same length'"
-      ]
-    });
+    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];
@@ -256,34 +247,17 @@ var CallbackCollection = class {
 
 // src/callback.ts
 import { invariant as invariant2 } from "@dxos/invariant";
-var __dxlog_file2 = "/__w/dxos/dxos/packages/common/util/src/callback.ts";
 var Callback = class {
   _callback;
   call(...args) {
-    invariant2(this._callback, "Callback not set", {
-      F: __dxlog_file2,
-      L: 20,
-      S: this,
-      A: [
-        "this._callback",
-        "'Callback not set'"
-      ]
-    });
+    invariant2(this._callback, "Callback not set");
     return this._callback(...args);
   }
   callIfSet(...args) {
     return this._callback?.(...args);
   }
   set(callback) {
-    invariant2(!this._callback, "Callback already set", {
-      F: __dxlog_file2,
-      L: 29,
-      S: this,
-      A: [
-        "!this._callback",
-        "'Callback already set'"
-      ]
-    });
+    invariant2(!this._callback, "Callback already set");
     this._callback = callback;
   }
   isSet() {
@@ -351,21 +325,12 @@ var chunkArray = (array, size) => {
 
 // src/circular-buffer.ts
 import { invariant as invariant3 } from "@dxos/invariant";
-var __dxlog_file3 = "/__w/dxos/dxos/packages/common/util/src/circular-buffer.ts";
 var CircularBuffer = class {
   _buffer;
   _nextIndex = 0;
   _elementCount = 0;
   constructor(size) {
-    invariant3(size >= 1, void 0, {
-      F: __dxlog_file3,
-      L: 13,
-      S: this,
-      A: [
-        "size >= 1",
-        ""
-      ]
-    });
+    invariant3(size >= 1);
     this._buffer = new Array(size);
   }
   push(element) {
@@ -651,17 +616,8 @@ var splitCompositeKey = (key) => key.split(SEPARATOR);
 
 // src/deep.ts
 import { invariant as invariant4 } from "@dxos/invariant";
-var __dxlog_file4 = "/__w/dxos/dxos/packages/common/util/src/deep.ts";
 var setDeep = (obj, path, value) => {
-  invariant4(path.length > 0, void 0, {
-    F: __dxlog_file4,
-    L: 12,
-    S: void 0,
-    A: [
-      "path.length > 0",
-      ""
-    ]
-  });
+  invariant4(path.length > 0);
   let parent = obj;
   for (const key of path.slice(0, -1)) {
     if (parent[key] === void 0) {
@@ -754,7 +710,9 @@ var formatErrorWithCauses = (error) => {
   while (current) {
     const prefix = level === 0 ? "" : `Caused by: `;
     lines.push(prefix + (current.stack ?? String(current)));
-    if (!(current.cause instanceof Error)) break;
+    if (!(current.cause instanceof Error)) {
+      break;
+    }
     current = current.cause;
     level += 1;
   }
@@ -1102,6 +1060,19 @@ var humanize = (value) => {
   return hasher.humanize(value);
 };
 
+// src/id.ts
+var PART = /^[a-zA-Z][a-zA-Z0-9]{0,62}$/;
+var ID = /^[a-zA-Z]([a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(\.[a-zA-Z0-9]([a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)+(\.[a-zA-Z]([a-zA-Z0-9]{0,62})?)$/;
+function id(strings, ...values) {
+  const raw = strings.reduce((out, str, i) => out + str + (i < values.length ? String(values[i]) : ""), "");
+  if (!ID.test(raw)) {
+    throw new Error(`Invalid id (expected AT Protocol NSID): ${JSON.stringify(raw)}`);
+  }
+  return raw;
+}
+var isWellFormedId = (value) => ID.test(value);
+var isWellFormedIdPart = (value) => PART.test(value);
+
 // src/map.ts
 var defaultMap = (map, key, def) => {
   let value = map.get(key);
@@ -1121,12 +1092,12 @@ var getPrototypeSpecificInstanceId = (instance) => {
     nextId: 0,
     instanceIds: /* @__PURE__ */ new WeakMap()
   }));
-  let id = instanceCtx.instanceIds.get(instance);
-  if (id === void 0) {
-    id = instanceCtx.nextId++;
-    instanceCtx.instanceIds.set(instance, id);
+  let id2 = instanceCtx.instanceIds.get(instance);
+  if (id2 === void 0) {
+    id2 = instanceCtx.nextId++;
+    instanceCtx.instanceIds.set(instance, id2);
   }
-  return id;
+  return id2;
 };
 var getDebugName = (instance) => {
   if (instance == null) {
@@ -1193,6 +1164,26 @@ var bufferToArray = (buffer) => {
 };
 var stringToArray = (string) => bufferToArray(Buffer.from(string, "hex"));
 var arrayToString = (array) => arrayToBuffer(array).toString("hex");
+var toUnpaddedBase64 = (bytes) => arrayToBuffer(bytes).toString("base64").replace(/=+$/, "");
+var encodeUint8ArrayToJson = (bytes) => ({
+  "/": {
+    bytes: toUnpaddedBase64(bytes)
+  }
+});
+var isEncodedUint8Array = (value) => {
+  if (typeof value !== "object" || value === null || Array.isArray(value)) {
+    return false;
+  }
+  if (Object.keys(value).length !== 1) {
+    return false;
+  }
+  const inner = value["/"];
+  if (typeof inner !== "object" || inner === null || Array.isArray(inner)) {
+    return false;
+  }
+  return Object.keys(inner).length === 1 && typeof inner.bytes === "string";
+};
+var decodeUint8ArrayFromJson = (encoded) => bufferToArray(Buffer.from(encoded["/"].bytes, "base64"));
 
 // src/json.ts
 var MAX_DEPTH = 5;
@@ -1322,6 +1313,8 @@ var DeepMapper = class {
         res[i] = this._map(value[i], i);
       }
       return res;
+    } else if (ArrayBuffer.isView(value)) {
+      return value;
     } else if (value !== null && typeof value === "object") {
       const res = {};
       this._cyclic.set(value, res);
@@ -1363,6 +1356,8 @@ var DeepMapperAsync = class {
         res[i] = await this._map(value[i], i);
       }
       return res;
+    } else if (ArrayBuffer.isView(value)) {
+      return value;
     } else if (value !== null && typeof value === "object") {
       const res = {};
       this._cyclic.set(value, res);
@@ -1407,27 +1402,27 @@ var orderKeys = (obj, order) => {
 
 // src/order.ts
 var inferObjectOrder = (objectMap, order = []) => {
-  const orderedObjects = order.reduce((acc, id) => {
-    if (id in objectMap) {
-      acc.objects.push(objectMap[id]);
-      acc.ids.add(id);
+  const orderedObjects = order.reduce((acc, id2) => {
+    if (id2 in objectMap) {
+      acc.objects.push(objectMap[id2]);
+      acc.ids.add(id2);
     }
     return acc;
   }, {
     objects: [],
     ids: /* @__PURE__ */ new Set()
   });
-  const { objects } = Object.keys(objectMap).reduce((acc, id) => {
-    if (!acc.ids.has(id)) {
-      acc.objects.push(objectMap[id]);
+  const { objects } = Object.keys(objectMap).reduce((acc, id2) => {
+    if (!acc.ids.has(id2)) {
+      acc.objects.push(objectMap[id2]);
     }
     return acc;
   }, orderedObjects);
   return objects;
 };
 var inferRecordOrder = (objectMap, order = []) => {
-  return Object.assign(order.filter((id) => id in objectMap).reduce((acc, id) => {
-    acc[id] = null;
+  return Object.assign(order.filter((id2) => id2 in objectMap).reduce((acc, id2) => {
+    acc[id2] = null;
     return acc;
   }, {}), objectMap);
 };
@@ -1513,12 +1508,12 @@ var getHostPlatform = () => {
 };
 
 // src/position.ts
-var byPosition = ({ position: a = "static" }, { position: b = "static" }) => {
+var byPosition = ({ position: a }, { position: b }) => {
   if (a === b) {
     return 0;
-  } else if (a === "hoist" || b === "fallback") {
+  } else if (a === "first" || b === "last") {
     return -1;
-  } else if (b === "hoist" || a === "fallback") {
+  } else if (b === "first" || a === "last") {
     return 1;
   } else {
     return 0;
@@ -1864,7 +1859,6 @@ var defaultFilter = createReplacer();
 
 // src/sliding-window-summary.ts
 import { invariant as invariant5 } from "@dxos/invariant";
-var __dxlog_file5 = "/__w/dxos/dxos/packages/common/util/src/sliding-window-summary.ts";
 var SlidingWindowSummary = class {
   _buffer;
   _sum = 0;
@@ -1872,15 +1866,7 @@ var SlidingWindowSummary = class {
   constructor(options) {
     this._buffer = new CircularBuffer(options.dataPoints);
     if (options.precision != null) {
-      invariant5(options.precision >= 0, void 0, {
-        F: __dxlog_file5,
-        L: 26,
-        S: this,
-        A: [
-          "options.precision >= 0",
-          ""
-        ]
-      });
+      invariant5(options.precision >= 0);
       this._precision = Math.pow(10, options.precision);
     }
   }
@@ -1949,6 +1935,10 @@ var capitalize = (str) => {
   }
   return str.charAt(0).toUpperCase() + str.slice(1);
 };
+function inline(strings, ...values) {
+  const raw = strings.reduce((out, str, i) => out + str + (i < values.length ? String(values[i]) : ""), "");
+  return raw.replace(/\s+/g, " ").trim();
+}
 function trim(strings, ...values) {
   const raw = strings.reduce((out, str, i) => {
     out += str;
@@ -1961,8 +1951,12 @@ function trim(strings, ...values) {
     return out;
   }, "");
   const lines = raw.split("\n");
-  while (lines.length && !lines[0].trim()) lines.shift();
-  while (lines.length && !lines[lines.length - 1].trim()) lines.pop();
+  while (lines.length && !lines[0].trim()) {
+    lines.shift();
+  }
+  while (lines.length && !lines[lines.length - 1].trim()) {
+    lines.pop();
+  }
   const minIndent = Math.min(...lines.filter((l) => l.trim()).map((l) => l.match(/^[ \t]*/)?.[0].length ?? 0));
   return lines.map((l) => l.slice(minIndent)).join("\n");
 }
@@ -2165,8 +2159,8 @@ var Tracer = class {
   keys() {
     return Array.from(this._events.keys());
   }
-  get(id, filter) {
-    const events = this._events.get(id);
+  get(id2, filter) {
+    const events = this._events.get(id2);
     if (filter) {
       return events?.filter((event) => Object.entries(filter).every(([key, value]) => event?.value[key] === value));
     }
@@ -2183,11 +2177,11 @@ var Tracer = class {
     this._recording = false;
     return this;
   }
-  emit(id, value) {
-    this._post(this._createEvent(id, value));
+  emit(id2, value) {
+    this._post(this._createEvent(id2, value));
   }
-  mark(id, value) {
-    const event = this._createEvent(id, value);
+  mark(id2, value) {
+    const event = this._createEvent(id2, value);
     const start = performance.now();
     return {
       start,
@@ -2197,9 +2191,9 @@ var Tracer = class {
       }
     };
   }
-  _createEvent(id, value) {
+  _createEvent(id2, value) {
     const event = {
-      id,
+      id: id2,
       timestamp: Date.now()
     };
     if (value !== void 0) {
@@ -2297,11 +2291,15 @@ function arraySwap(array, from, to) {
 var createFormat = (unit) => {
   return (n, precision = unit.precision ?? 0) => {
     const value = n / unit.quotient;
+    const formattedValue = value.toLocaleString("en-US", {
+      minimumFractionDigits: precision,
+      maximumFractionDigits: precision
+    });
     return {
       unit,
       value,
-      formattedValue: value.toFixed(precision),
-      toString: () => `${value.toFixed(precision)}${unit.symbol}`
+      formattedValue,
+      toString: () => `${formattedValue}${unit.symbol}`
     };
   };
 };
@@ -2358,6 +2356,7 @@ var Unit = {
     symbol: "ms",
     quotient: 1
   }),
+  // TODO(burdon): Inconsistent formattedValue.
   Duration: (n) => {
     const hours = Math.floor(n / MS_HOURS);
     const minutes = Math.floor(n % MS_HOURS / MS_MINUTES);
@@ -2375,7 +2374,7 @@ var Unit = {
     }
     if (minutes) {
       const seconds2 = (n - MS_MINUTES * minutes) / MS_SECONDS;
-      const formattedValue = seconds2 ? `${minutes}m ${seconds2}s` : `${minutes}m`;
+      const formattedValue = seconds2 ? `${minutes}m ${Math.round(seconds2)}s` : `${minutes}m`;
       return {
         unit: {
           symbol: "m",
@@ -2583,6 +2582,7 @@ export {
   createSetDispatch,
   createUrl,
   decamelize,
+  decodeUint8ArrayFromJson,
   deepMapValues,
   deepMapValuesAsync,
   defaultFilter,
@@ -2593,6 +2593,7 @@ export {
   diff,
   distinctBy,
   doAsync,
+  encodeUint8ArrayToJson,
   entries,
   entry,
   exponentialBackoffInterval,
@@ -2610,20 +2611,25 @@ export {
   hexToHue,
   humanize,
   hyphenize,
+  id,
   idEmoji,
   idHue,
   inferObjectOrder,
   inferRecordOrder,
+  inline,
   intersectBy,
   intersection,
   iosCheck,
   isBun,
+  isEncodedUint8Array,
   isMobile,
   isMobileOrTablet,
   isNode,
   isNonNullable,
   isTauri,
   isTruthy,
+  isWellFormedId,
+  isWellFormedIdPart,
   joinTables,
   jsonKeyReplacer,
   jsonReplacer,