@dxos/util 0.8.4-main.8360d9e660 → 0.8.4-main.8baae0fced

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@dxos/util",
-  "version": "0.8.4-main.8360d9e660",
+  "version": "0.8.4-main.8baae0fced",
   "description": "Temporary bucket for misc functions, which should graduate into separate packages.",
   "homepage": "https://dxos.org",
   "bugs": "https://github.com/dxos/dxos/issues",
@@ -8,7 +8,7 @@
     "type": "git",
     "url": "https://github.com/dxos/dxos"
   },
-  "license": "MIT",
+  "license": "FSL-1.1-Apache-2.0",
   "author": "DXOS.org",
   "sideEffects": false,
   "type": "module",
@@ -23,22 +23,19 @@
     }
   },
   "types": "dist/types/src/index.d.ts",
-  "typesVersions": {
-    "*": {}
-  },
   "files": [
     "dist",
     "src"
   ],
   "dependencies": {
     "@hazae41/symbol-dispose-polyfill": "^1.0.2",
-    "@dxos/invariant": "0.8.4-main.8360d9e660",
-    "@dxos/node-std": "0.8.4-main.8360d9e660",
-    "@dxos/keys": "0.8.4-main.8360d9e660",
-    "@dxos/debug": "0.8.4-main.8360d9e660"
+    "@dxos/invariant": "0.8.4-main.8baae0fced",
+    "@dxos/debug": "0.8.4-main.8baae0fced",
+    "@dxos/keys": "0.8.4-main.8baae0fced",
+    "@dxos/node-std": "0.8.4-main.8baae0fced"
   },
   "devDependencies": {
-    "@dxos/crypto": "0.8.4-main.8360d9e660"
+    "@dxos/crypto": "0.8.4-main.8baae0fced"
   },
   "publishConfig": {
     "access": "public"

package/src/browser-storage.ts

@@ -0,0 +1,60 @@
+//
+// Copyright 2025 DXOS.org
+//
+
+/** Delete all IndexedDB databases for this origin. */
+export const clearIndexedDB = async (): Promise<void> => {
+  const dbs = await indexedDB.databases();
+  const results = await Promise.allSettled(
+    dbs
+      .filter((db) => db.name != null)
+      .map(
+        (db) =>
+          new Promise<void>((resolve, reject) => {
+            const request = indexedDB.deleteDatabase(db.name!);
+            request.onsuccess = () => resolve();
+            request.onerror = () => reject(request.error);
+            request.onblocked = () => reject(new Error(`IndexedDB deletion blocked: ${db.name}`));
+          }),
+      ),
+  );
+  const failures = results.filter((r): r is PromiseRejectedResult => r.status === 'rejected');
+  if (failures.length > 0) {
+    throw new AggregateError(
+      failures.map((r) => r.reason),
+      'Failed to delete some IndexedDB databases',
+    );
+  }
+};
+
+/** Remove all entries from the Origin Private File System. */
+export const clearOPFS = async (): Promise<void> => {
+  const root = await navigator.storage.getDirectory();
+  const errors: unknown[] = [];
+  for await (const [name] of root.entries()) {
+    try {
+      await root.removeEntry(name, { recursive: true });
+    } catch (err) {
+      errors.push(err);
+    }
+  }
+  if (errors.length > 0) {
+    throw new AggregateError(errors, 'Failed to remove some OPFS entries');
+  }
+};
+
+/** Unregister all service workers for this origin. */
+export const clearServiceWorkers = async (): Promise<void> => {
+  const regs = await navigator.serviceWorker.getRegistrations();
+  for (const reg of regs) {
+    await reg.unregister();
+  }
+};
+
+/** Delete all HTTP caches for this origin. */
+export const clearCaches = async (): Promise<void> => {
+  const keys = await caches.keys();
+  for (const key of keys) {
+    await caches.delete(key);
+  }
+};

package/src/complex.ts

@@ -214,6 +214,38 @@ export class ComplexMap<K, V> implements Map<K, V> {
     return this;
   }
 
+  /**
+   * Returns the value for the given key if present, otherwise inserts and returns the default value.
+   * @param key - The key to look up or insert.
+   * @param defaultValue - The value to insert if the key is not present.
+   * @returns The existing or newly inserted value.
+   */
+  getOrInsert(key: K, defaultValue: V): V {
+    const primitive = this._keyProjection(key);
+    if (this._values.has(primitive)) {
+      return this._values.get(primitive)!;
+    }
+    this.set(key, defaultValue);
+    return defaultValue;
+  }
+
+  /**
+   * Returns the value for the given key if present, otherwise computes, inserts, and returns a new value.
+   * The callback is only invoked when the key is missing.
+   * @param key - The key to look up or insert.
+   * @param callbackfn - Function to compute the value if the key is not present.
+   * @returns The existing or newly computed value.
+   */
+  getOrInsertComputed(key: K, callbackfn: (key: K) => V): V {
+    const primitive = this._keyProjection(key);
+    if (this._values.has(primitive)) {
+      return this._values.get(primitive)!;
+    }
+    const value = callbackfn(key);
+    this.set(key, value);
+    return value;
+  }
+
   get size(): number {
     return this._keys.size;
   }

package/src/composite-key.test.ts

@@ -0,0 +1,31 @@
+//
+// Copyright 2026 DXOS.org
+//
+
+import { describe, test } from 'vitest';
+
+import { compositeKey, splitCompositeKey } from './composite-key';
+
+describe('compositeKey', () => {
+  test('joins parts with colon', ({ expect }) => {
+    expect(compositeKey('a', 'b', 'c')).to.eq('a:b:c');
+  });
+
+  test('single part returns as-is', ({ expect }) => {
+    expect(compositeKey('only')).to.eq('only');
+  });
+
+  test('handles empty strings in parts', ({ expect }) => {
+    expect(compositeKey('', 'b')).to.eq(':b');
+  });
+});
+
+describe('splitCompositeKey', () => {
+  test('splits on colon', ({ expect }) => {
+    expect(splitCompositeKey('a:b:c')).to.deep.eq(['a', 'b', 'c']);
+  });
+
+  test('single part returns array of one', ({ expect }) => {
+    expect(splitCompositeKey('only')).to.deep.eq(['only']);
+  });
+});

package/src/composite-key.ts

@@ -0,0 +1,16 @@
+//
+// Copyright 2026 DXOS.org
+//
+
+const SEPARATOR = ':';
+
+/**
+ * Build a composite key from string parts joined by a colon separator.
+ * Parts must not contain the separator character.
+ */
+export const compositeKey = (...parts: string[]): string => parts.join(SEPARATOR);
+
+/**
+ * Split a composite key back into its parts.
+ */
+export const splitCompositeKey = (key: string): string[] => key.split(SEPARATOR);

package/src/di-key.ts

@@ -47,7 +47,7 @@ export type DiKey<T> =
     }
   | SymbolDiKey<T>;
 
-export const DiKey = new (class DiKeyConstructor {
+class DiKeyConstructor {
   /**
    * Needed to ensure referential equality of combined keys.
    *
@@ -57,7 +57,7 @@ export const DiKey = new (class DiKeyConstructor {
    */
   // TODO(dmaretskyi): Disable private members lowering for dev env.
   // TODO(dmaretskyi): Could be a weak map after a NodeJS upgrade.
-  #combinedRegistry = new WeakMap();
+  private _combinedRegistry = new WeakMap();
 
   define<T>(name: string): DiKey<T> {
     return new SymbolDiKey(name);
@@ -88,24 +88,26 @@ export const DiKey = new (class DiKeyConstructor {
    * Maintains referential equality: `DiKey.combine(A, B) === DiKey.combine(A, B)`
    */
   combine(...ids: DiKey<any>[]) {
-    const map = this.#lookupCombined(this.#combinedRegistry, ids);
-    return defaultMap(this.#combinedRegistry, map, () => this.#combinedDescription(ids));
+    const map = this._lookupCombined(this._combinedRegistry, ids);
+    return defaultMap(this._combinedRegistry, map, () => this._combinedDescription(ids));
   }
 
   getSingletonFactory<T>(id: DiKey<T>): SingletonFactory<T> | undefined {
     return (id as any)[symbolSingleton];
   }
 
-  #lookupCombined(map: WeakMap<any, any>, [first, ...rest]: DiKey<any>[]): WeakMap<any, any> {
+  private _lookupCombined(map: WeakMap<any, any>, [first, ...rest]: DiKey<any>[]): WeakMap<any, any> {
     const value = defaultMap(map, first, () => new Map());
     if (rest.length > 0) {
-      return this.#lookupCombined(value, rest);
+      return this._lookupCombined(value, rest);
     } else {
       return value;
     }
   }
 
-  #combinedDescription([first, ...rest]: DiKey<any>[]) {
+  private _combinedDescription([first, ...rest]: DiKey<any>[]) {
     return `${this.stringify(first)}<${rest.map(this.stringify).join(', ')}>`;
   }
-})();
+}
+
+export const DiKey = new DiKeyConstructor();

package/src/error-format.ts

@@ -13,7 +13,9 @@ export const formatErrorWithCauses = (error: Error): string => {
   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;
   }

package/src/id.test.ts

@@ -0,0 +1,109 @@
+//
+// Copyright 2026 DXOS.org
+//
+
+import { describe, test } from 'vitest';
+
+import { id, isWellFormedId, isWellFormedIdPart } from './id';
+
+describe('id', () => {
+  test('accepts a three-part id', ({ expect }) => {
+    expect(id`com.example.foo`).toBe('com.example.foo');
+  });
+
+  test('accepts a four-part id', ({ expect }) => {
+    expect(id`org.dxos.plugin.deck`).toBe('org.dxos.plugin.deck');
+  });
+
+  test('accepts hyphens in authority segments', ({ expect }) => {
+    expect(id`my-org.example.foo`).toBe('my-org.example.foo');
+  });
+
+  test('accepts mixed-case name segment', ({ expect }) => {
+    expect(id`org.dxos.plugin.deckPlugin`).toBe('org.dxos.plugin.deckPlugin');
+  });
+
+  test('accepts alphanumeric characters in authority segments', ({ expect }) => {
+    expect(id`foo123.bar456.qux`).toBe('foo123.bar456.qux');
+  });
+
+  test('interpolates values', ({ expect }) => {
+    const namespace = 'org.dxos';
+    const name = 'plugin';
+    expect(id`${namespace}.${name}.deck`).toBe('org.dxos.plugin.deck');
+  });
+
+  test('throws on empty string', ({ expect }) => {
+    expect(() => id``).toThrow(/Invalid id/);
+  });
+
+  test('throws for fewer than three parts', ({ expect }) => {
+    expect(() => id`foo`).toThrow(/Invalid id/);
+    expect(() => id`foo.bar`).toThrow(/Invalid id/);
+  });
+
+  test('throws when first character is a digit', ({ expect }) => {
+    expect(() => id`1foo.bar.baz`).toThrow(/Invalid id/);
+  });
+
+  test('throws on leading or trailing dot', ({ expect }) => {
+    expect(() => id`.foo.bar.baz`).toThrow(/Invalid id/);
+    expect(() => id`foo.bar.baz.`).toThrow(/Invalid id/);
+  });
+
+  test('throws on consecutive dots', ({ expect }) => {
+    expect(() => id`foo..bar`).toThrow(/Invalid id/);
+  });
+
+  test('throws on hyphens in the name segment', ({ expect }) => {
+    expect(() => id`org.example.foo-bar`).toThrow(/Invalid id/);
+  });
+
+  test('throws on disallowed characters', ({ expect }) => {
+    expect(() => id`foo_bar.baz.qux`).toThrow(/Invalid id/);
+    expect(() => id`foo bar.baz.qux`).toThrow(/Invalid id/);
+  });
+
+  test('throws when an interpolated value produces an invalid name segment', ({ expect }) => {
+    const bad = '1bad';
+    expect(() => id`org.dxos.${bad}`).toThrow(/Invalid id/);
+  });
+});
+
+describe('isWellFormedId', () => {
+  test('matches valid ids', ({ expect }) => {
+    expect(isWellFormedId('com.example.foo')).toBe(true);
+    expect(isWellFormedId('org.dxos.plugin.deck')).toBe(true);
+    expect(isWellFormedId('a1.b2.c3')).toBe(true);
+    expect(isWellFormedId('my-org.example.foo')).toBe(true);
+  });
+
+  test('rejects ids with fewer than three parts', ({ expect }) => {
+    expect(isWellFormedId('foo')).toBe(false);
+    expect(isWellFormedId('foo.bar')).toBe(false);
+  });
+
+  test('rejects invalid ids', ({ expect }) => {
+    expect(isWellFormedId('')).toBe(false);
+    expect(isWellFormedId('1foo.bar.baz')).toBe(false);
+    expect(isWellFormedId('foo.bar.')).toBe(false);
+    expect(isWellFormedId('.foo.bar')).toBe(false);
+    expect(isWellFormedId('foo..bar.baz')).toBe(false);
+    expect(isWellFormedId('org.example.foo-bar')).toBe(false);
+  });
+});
+
+describe('isWellFormedIdPart', () => {
+  test('matches valid name segments', ({ expect }) => {
+    expect(isWellFormedIdPart('foo')).toBe(true);
+    expect(isWellFormedIdPart('Foo')).toBe(true);
+    expect(isWellFormedIdPart('fooBar123')).toBe(true);
+  });
+
+  test('rejects invalid name segments', ({ expect }) => {
+    expect(isWellFormedIdPart('foo.bar')).toBe(false);
+    expect(isWellFormedIdPart('foo-bar')).toBe(false);
+    expect(isWellFormedIdPart('1foo')).toBe(false);
+    expect(isWellFormedIdPart('')).toBe(false);
+  });
+});

package/src/id.ts

@@ -0,0 +1,48 @@
+//
+// Copyright 2026 DXOS.org
+//
+
+// Name segment: starts with alpha, alphanumeric only (no hyphens), max 63 chars.
+const PART = /^[a-zA-Z][a-zA-Z0-9]{0,62}$/;
+
+// Reference: https://atproto.com/specs/nsid
+const 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})?)$/;
+
+/**
+ * Branded string type for well-formed ids.
+ */
+export type Id = string & { readonly __id: unique symbol };
+
+/**
+ * Tagged template literal that constructs a well-formed, dot-delimited id string.
+ * Throws if the resulting string is not well-formed.
+ *
+ * Follows the AT Protocol NSID convention (https://atproto.com/specs/nsid)
+ * Full NSID: authority segments (hyphens allowed) + dot + name segment (no hyphens).
+ * - Authority segments: at most 253 characters (including periods), and must contain at least two segments.
+ * - Name segment: starts with alpha, alphanumeric only (no hyphens), max 63 chars.
+ *
+ * @example
+ *   id`org.dxos.plugin.deck` // 'org.dxos.plugin.deck'
+ *   id`${ns}.${plugin}.deck` // joins interpolated values
+ */
+export function id(strings: TemplateStringsArray, ...values: unknown[]): Id {
+  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 as Id;
+}
+
+/**
+ * Returns true if the given string is a well-formed NSID.
+ */
+export const isWellFormedId = (value: string): boolean => ID.test(value);
+
+/**
+ * Returns true if the given string is a well-formed NSID name segment:
+ * `/^[a-zA-Z][a-zA-Z0-9]{0,62}$/` (starts with alpha, alphanumeric only, no dots or hyphens).
+ */
+export const isWellFormedIdPart = (value: string): boolean => PART.test(value);

package/src/index.ts

@@ -7,6 +7,7 @@ export * from './array';
 export * from './assume';
 export * from './binder';
 export * from './bitfield';
+export * from './browser-storage';
 export * from './callback-collection';
 export * from './callback';
 export * from './case';
@@ -14,13 +15,16 @@ export * from './chunk-array';
 export * from './circular-buffer';
 export * from './clear-undefined';
 export * from './complex';
+export * from './composite-key';
 export * from './deep';
 export * from './defer-function';
 export * from './defer';
 export * from './entry';
+export * from './error-format';
 export * from './filename';
 export * from './for-each-async';
 export * from './human-hash';
+export * from './id';
 export * from './instance-id';
 export * from './interval';
 export * from './join-tables';
@@ -38,6 +42,7 @@ export * from './random';
 export * from './range';
 export * from './reducers';
 export * from './remove-undefined-keys';
+export * from './retry';
 export * from './safe-await';
 export * from './safe-instanceof';
 export * from './safe-parse';
@@ -55,5 +60,3 @@ export * from './uint8array';
 export * from './unit';
 export * from './url';
 export * from './weak';
-export * from './error-format';
-export * from './retry';

package/src/map-values.ts

@@ -52,6 +52,9 @@ class DeepMapper {
         res[i] = this._map(value[i], i);
       }
       return res;
+    } else if (ArrayBuffer.isView(value)) {
+      // Typed arrays (Uint8Array, etc.) are opaque leaf values, not POJOs to recurse into.
+      return value;
     } else if (value !== null && typeof value === 'object') {
       const res: any = {};
       this._cyclic.set(value, res);
@@ -112,6 +115,9 @@ class DeepMapperAsync {
         res[i] = await this._map(value[i], i);
       }
       return res;
+    } else if (ArrayBuffer.isView(value)) {
+      // Typed arrays (Uint8Array, etc.) are opaque leaf values, not POJOs to recurse into.
+      return value;
     } else if (value !== null && typeof value === 'object') {
       const res: any = {};
       this._cyclic.set(value, res);

package/src/position.test.ts

@@ -2,7 +2,7 @@
 // Copyright 2025 DXOS.org
 //
 
-import { describe, expect, it } from 'vitest';
+import { describe, test } from 'vitest';
 
 import { type Position, byPosition } from './position';
 
@@ -12,14 +12,14 @@ type TestItem = {
 };
 
 describe('byPosition', () => {
-  it('should keep items with same position in their original order', () => {
+  test('should keep items with same position in their original order', ({ expect }) => {
     const items: TestItem[] = [
-      { id: 1, position: 'static' },
-      { id: 2, position: 'static' },
-      { id: 3, position: 'hoist' },
-      { id: 4, position: 'hoist' },
-      { id: 5, position: 'fallback' },
-      { id: 6, position: 'fallback' },
+      { id: 1 },
+      { id: 2 },
+      { id: 3, position: 'first' },
+      { id: 4, position: 'first' },
+      { id: 5, position: 'last' },
+      { id: 6, position: 'last' },
     ];
 
     const sorted = [...items].sort(byPosition);
@@ -30,69 +30,63 @@ describe('byPosition', () => {
     expect(sorted.findIndex((item) => item.id === 5)).toBeLessThan(sorted.findIndex((item) => item.id === 6));
   });
 
-  it('should place "hoist" items before "static" items', () => {
-    const items: TestItem[] = [
-      { id: 1, position: 'static' },
-      { id: 2, position: 'hoist' },
-    ];
+  test('should place "first" items before items in natural order', ({ expect }) => {
+    const items: TestItem[] = [{ id: 1 }, { id: 2, position: 'first' }];
 
     const sorted = [...items].sort(byPosition);
-    expect(sorted[0].position).toBe('hoist');
-    expect(sorted[1].position).toBe('static');
+    expect(sorted[0].position).toBe('first');
+    expect(sorted[1].position).toBeUndefined();
   });
 
-  it('should place "fallback" items after "static" items', () => {
-    const items: TestItem[] = [
-      { id: 1, position: 'fallback' },
-      { id: 2, position: 'static' },
-    ];
+  test('should place "last" items after items in natural order', ({ expect }) => {
+    const items: TestItem[] = [{ id: 1, position: 'last' }, { id: 2 }];
 
     const sorted = [...items].sort(byPosition);
-    expect(sorted[0].position).toBe('static');
-    expect(sorted[1].position).toBe('fallback');
+    expect(sorted[0].position).toBeUndefined();
+    expect(sorted[1].position).toBe('last');
   });
 
-  it('should treat items without position as "static"', () => {
-    const items: TestItem[] = [{ id: 1 }, { id: 2, position: 'hoist' }, { id: 3, position: 'fallback' }];
+  test('should treat items without position as natural order', ({ expect }) => {
+    const items: TestItem[] = [{ id: 1 }, { id: 2, position: 'first' }, { id: 3, position: 'last' }];
 
     const sorted = [...items].sort(byPosition);
-    expect(sorted[0].position).toBe('hoist');
+    expect(sorted[0].position).toBe('first');
     expect(sorted[1].position).toBeUndefined();
-    expect(sorted[2].position).toBe('fallback');
+    expect(sorted[2].position).toBe('last');
   });
 
-  it('should correctly sort mixed positions', () => {
+  test('should correctly sort mixed positions', ({ expect }) => {
     const items: TestItem[] = [
-      { id: 1, position: 'fallback' },
-      { id: 2, position: 'static' },
-      { id: 3, position: 'hoist' },
-      { id: 4 }, // implicit static
-      { id: 5, position: 'hoist' },
-      { id: 6, position: 'fallback' },
+      { id: 1, position: 'last' },
+      { id: 2 },
+      { id: 3, position: 'first' },
+      { id: 4 },
+      { id: 5, position: 'first' },
+      { id: 6, position: 'last' },
     ];
 
     const sorted = [...items].sort(byPosition);
 
-    // All hoisted items should come first
-    expect(sorted[0].position).toBe('hoist');
-    expect(sorted[1].position).toBe('hoist');
+    // All "first" items should come first
+    expect(sorted[0].position).toBe('first');
+    expect(sorted[1].position).toBe('first');
 
-    // Static items (including undefined) should be in the middle
-    expect(sorted[2].position).toBe('static');
+    // Natural-order items (undefined) should be in the middle
+    expect(sorted[2].position).toBeUndefined();
     expect(sorted[3].position).toBeUndefined();
 
-    // Fallback items should be last
-    expect(sorted[4].position).toBe('fallback');
-    expect(sorted[5].position).toBe('fallback');
+    // "last" items should be at the end
+    expect(sorted[4].position).toBe('last');
+    expect(sorted[5].position).toBe('last');
   });
 
-  it('should handle empty arrays', () => {
+  test('should handle empty arrays', ({ expect }) => {
     const items: TestItem[] = [];
     expect(() => [...items].sort(byPosition)).not.toThrow();
   });
 
-  it('should handle single item arrays', () => {
-    const items: TestItem[] = [{ id: 1, position: 'static' }];
+  test('should handle single item arrays', ({ expect }) => {
+    const items: TestItem[] = [{ id: 1 }];
     expect(() => [...items].sort(byPosition)).not.toThrow();
   });
 });

package/src/position.ts

@@ -6,25 +6,21 @@
 
 /**
  * Determines priority order:
- * - `static` - Remain in natural order.
- * - `hoist` - Placed before `static`.
- * - `fallback` - Placed after `static`.
+ * - `undefined` - Remain in natural order.
+ * - `first` - Placed before items in natural order.
+ * - `last` - Placed after items in natural order.
  */
-// TODO(wittjosiah): Change to 'static' | 'start' | 'end'.
-export type Position = 'static' | 'hoist' | 'fallback';
+export type Position = 'first' | 'last';
 
 /**
  * Sorting function for sorting by position.
  */
-export const byPosition = <T extends { position?: Position }>(
-  { position: a = 'static' }: T,
-  { position: b = 'static' }: T,
-) => {
+export const byPosition = <T extends { position?: Position }>({ position: a }: T, { position: b }: T) => {
   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;

package/src/string.ts

@@ -32,8 +32,12 @@ export function trim(strings: TemplateStringsArray, ...values: any[]) {
   // Split into lines and trim leading/trailing blank lines.
   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();
+  }
 
   // Find smallest indent across all non-blank lines.
   const minIndent = Math.min(...lines.filter((l) => l.trim()).map((l) => l.match(/^[ \t]*/)?.[0].length ?? 0));