@tldraw/utils 5.2.0-next.79b13319d317 → 5.2.0-next.7b677d60c152

package/README.md

@@ -4,6 +4,10 @@ Utility functions used by tldraw.
 
 ## Documentation
 
+Documentation for the most recent release can be found on [tldraw.dev/docs](https://tldraw.dev/docs), including [reference docs](https://tldraw.dev/reference/editor/Editor). Our release notes can be found [here](https://tldraw.dev/releases).
+
+For more agent-friendly docs, see our [LLMs.txt](https://tldraw.dev/llms.txt).
+
 A `DOCS.md` file is included alongside this README in the published package, with detailed API documentation and usage examples.
 
 ## Contribution

package/dist-cjs/index.js

@@ -171,7 +171,7 @@ var import_version2 = require("./lib/version");
 var import_warn = require("./lib/warn");
 (0, import_version.registerTldrawLibraryVersion)(
   "@tldraw/utils",
-  "5.2.0-next.79b13319d317",
+  "5.2.0-next.7b677d60c152",
   "cjs"
 );
 //# sourceMappingURL=index.js.map

package/dist-cjs/lib/fractionalIndexing.js

@@ -0,0 +1,227 @@
+"use strict";
+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 fractionalIndexing_exports = {};
+__export(fractionalIndexing_exports, {
+  generateNJitteredKeysBetween: () => generateNJitteredKeysBetween,
+  generateNKeysBetween: () => generateNKeysBetween,
+  validateOrderKey: () => validateOrderKey
+});
+module.exports = __toCommonJS(fractionalIndexing_exports);
+const DIGITS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+const ZERO = DIGITS[0];
+const LARGEST_DIGIT = DIGITS[DIGITS.length - 1];
+const SMALLEST_INTEGER = "A" + ZERO.repeat(26);
+const JITTER_BITS = 16;
+function getIntegerLength(head) {
+  if (head >= "a" && head <= "z") {
+    return head.charCodeAt(0) - "a".charCodeAt(0) + 2;
+  } else if (head >= "A" && head <= "Z") {
+    return "Z".charCodeAt(0) - head.charCodeAt(0) + 2;
+  }
+  throw new Error("invalid order key head: " + head);
+}
+function getIntegerPart(key) {
+  const integerPartLength = getIntegerLength(key[0]);
+  if (integerPartLength > key.length) {
+    throw new Error("invalid order key: " + key);
+  }
+  return key.slice(0, integerPartLength);
+}
+function digitIndex(char) {
+  const code = char.charCodeAt(0);
+  if (code <= 57) return code - 48;
+  if (code <= 90) return code - 55;
+  return code - 61;
+}
+function validateOrderKey(key) {
+  if (key === SMALLEST_INTEGER) {
+    throw new Error("invalid order key: " + key);
+  }
+  const i = getIntegerPart(key);
+  if (key.length > i.length && key[key.length - 1] === ZERO) {
+    throw new Error("invalid order key: " + key);
+  }
+}
+function midpoint(a, b) {
+  if (b != null && a >= b) {
+    throw new Error(a + " >= " + b);
+  }
+  if (a.slice(-1) === ZERO || b && b.slice(-1) === ZERO) {
+    throw new Error("trailing zero");
+  }
+  if (b) {
+    let n = 0;
+    while ((a[n] || ZERO) === b[n]) {
+      n++;
+    }
+    if (n > 0) {
+      return b.slice(0, n) + midpoint(a.slice(n), b.slice(n));
+    }
+  }
+  const digitA = a ? digitIndex(a[0]) : 0;
+  const digitB = b != null ? digitIndex(b[0]) : DIGITS.length;
+  if (digitB - digitA > 1) {
+    const midDigit = Math.round(0.5 * (digitA + digitB));
+    return DIGITS[midDigit];
+  }
+  if (b && b.length > 1) {
+    return b.slice(0, 1);
+  }
+  return DIGITS[digitA] + midpoint(a.slice(1), null);
+}
+function incrementInteger(x) {
+  const [head, ...digs] = x.split("");
+  let carry = true;
+  for (let i = digs.length - 1; carry && i >= 0; i--) {
+    const d = digitIndex(digs[i]) + 1;
+    if (d === DIGITS.length) {
+      digs[i] = ZERO;
+    } else {
+      digs[i] = DIGITS[d];
+      carry = false;
+    }
+  }
+  if (carry) {
+    if (head === "Z") return "a" + ZERO;
+    if (head === "z") return null;
+    const h = String.fromCharCode(head.charCodeAt(0) + 1);
+    if (h > "a") {
+      digs.push(ZERO);
+    } else {
+      digs.pop();
+    }
+    return h + digs.join("");
+  }
+  return head + digs.join("");
+}
+function decrementInteger(x) {
+  const [head, ...digs] = x.split("");
+  let borrow = true;
+  for (let i = digs.length - 1; borrow && i >= 0; i--) {
+    const d = digitIndex(digs[i]) - 1;
+    if (d === -1) {
+      digs[i] = LARGEST_DIGIT;
+    } else {
+      digs[i] = DIGITS[d];
+      borrow = false;
+    }
+  }
+  if (borrow) {
+    if (head === "a") return "Z" + LARGEST_DIGIT;
+    if (head === "A") return null;
+    const h = String.fromCharCode(head.charCodeAt(0) - 1);
+    if (h < "Z") {
+      digs.push(LARGEST_DIGIT);
+    } else {
+      digs.pop();
+    }
+    return h + digs.join("");
+  }
+  return head + digs.join("");
+}
+function keyBetweenUnchecked(a, b) {
+  if (a != null && b != null && a >= b) {
+    throw new Error(a + " >= " + b);
+  }
+  if (a == null) {
+    if (b == null) return "a" + ZERO;
+    const ib2 = getIntegerPart(b);
+    const fb2 = b.slice(ib2.length);
+    if (ib2 === SMALLEST_INTEGER) {
+      return ib2 + midpoint("", fb2);
+    }
+    if (ib2 < b) return ib2;
+    const res = decrementInteger(ib2);
+    if (res == null) throw new Error("cannot decrement any more");
+    return res;
+  }
+  if (b == null) {
+    const ia2 = getIntegerPart(a);
+    const fa2 = a.slice(ia2.length);
+    const i2 = incrementInteger(ia2);
+    return i2 == null ? ia2 + midpoint(fa2, null) : i2;
+  }
+  const ia = getIntegerPart(a);
+  const fa = a.slice(ia.length);
+  const ib = getIntegerPart(b);
+  const fb = b.slice(ib.length);
+  if (ia === ib) {
+    return ia + midpoint(fa, fb);
+  }
+  const i = incrementInteger(ia);
+  if (i == null) throw new Error("cannot increment any more");
+  if (i < b) return i;
+  return ia + midpoint(fa, null);
+}
+function nKeysBetweenUnchecked(a, b, n) {
+  if (n === 0) return [];
+  if (n === 1) return [keyBetweenUnchecked(a, b)];
+  if (b == null) {
+    let c2 = keyBetweenUnchecked(a, b);
+    const result = [c2];
+    for (let i = 0; i < n - 1; i++) {
+      c2 = keyBetweenUnchecked(c2, b);
+      result.push(c2);
+    }
+    return result;
+  }
+  if (a == null) {
+    let c2 = keyBetweenUnchecked(a, b);
+    const result = [c2];
+    for (let i = 0; i < n - 1; i++) {
+      c2 = keyBetweenUnchecked(a, c2);
+      result.push(c2);
+    }
+    result.reverse();
+    return result;
+  }
+  const mid = Math.floor(n / 2);
+  const c = keyBetweenUnchecked(a, b);
+  return [...nKeysBetweenUnchecked(a, c, mid), c, ...nKeysBetweenUnchecked(c, b, n - mid - 1)];
+}
+function jitterBetween(low, high) {
+  let mid = keyBetweenUnchecked(low, high);
+  for (let i = 0; i < JITTER_BITS; i++) {
+    if (Math.random() < 0.5) {
+      low = mid;
+    } else {
+      high = mid;
+    }
+    mid = keyBetweenUnchecked(low, high);
+  }
+  return mid;
+}
+function generateNJitteredKeysBetween(a, b, n) {
+  if (n === 0) return [];
+  if (a != null) validateOrderKey(a);
+  if (b != null) validateOrderKey(b);
+  const keys = nKeysBetweenUnchecked(a, b, n + 1);
+  const result = new Array(n);
+  for (let i = 0; i < n; i++) {
+    result[i] = jitterBetween(keys[i], keys[i + 1]);
+  }
+  return result;
+}
+function generateNKeysBetween(a, b, n) {
+  if (n === 0) return [];
+  if (a != null) validateOrderKey(a);
+  if (b != null) validateOrderKey(b);
+  return nKeysBetweenUnchecked(a, b, n);
+}
+//# sourceMappingURL=fractionalIndexing.js.map

package/dist-cjs/lib/fractionalIndexing.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/lib/fractionalIndexing.ts"],
+  "sourcesContent": ["// Fractional indexing, specialized to tldraw's needs.\n//\n// This is a vendored and trimmed version of the `fractional-indexing` (by\n// arv@rocicorp.dev) and `jittered-fractional-indexing` (by\n// github@nathanhleung.com) packages, both released under CC0-1.0 (public\n// domain). See https://observablehq.com/@dgreensp/implementing-fractional-indexing\n// for the original algorithm.\n//\n// We only ever use the default base-62 alphabet, so the `digits` parameter has\n// been specialized away. This lets us hoist the per-call allocations that the\n// upstream `validateOrderKey` made (notably `digits[0].repeat(26)`) into module\n// constants, and skip redundant re-validation inside the jitter loop, which are\n// both on hot paths (every index generation and every IndexKey validation).\n\n// Digits must be in ascending character-code order.\nconst DIGITS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'\nconst ZERO = DIGITS[0] // '0'\nconst LARGEST_DIGIT = DIGITS[DIGITS.length - 1] // 'z'\n// The reserved \"smallest integer\" key, which has no valid predecessor.\nconst SMALLEST_INTEGER = 'A' + ZERO.repeat(26)\n// Number of random bisections used to spread concurrently-generated keys apart,\n// reducing the chance of collisions when multiple clients insert into the same\n// gap at once. Each bit costs one extra key generation and ~0.17 characters of\n// key length, so this trades collision resistance against compute and key size.\n// 16 keeps collisions below ~0.1% even for ~10 simultaneous same-position\n// inserts, which is ample headroom for real multiplayer use.\nconst JITTER_BITS = 16\n\nfunction getIntegerLength(head: string): number {\n\tif (head >= 'a' && head <= 'z') {\n\t\treturn head.charCodeAt(0) - 'a'.charCodeAt(0) + 2\n\t} else if (head >= 'A' && head <= 'Z') {\n\t\treturn 'Z'.charCodeAt(0) - head.charCodeAt(0) + 2\n\t}\n\tthrow new Error('invalid order key head: ' + head)\n}\n\nfunction getIntegerPart(key: string): string {\n\tconst integerPartLength = getIntegerLength(key[0])\n\tif (integerPartLength > key.length) {\n\t\tthrow new Error('invalid order key: ' + key)\n\t}\n\treturn key.slice(0, integerPartLength)\n}\n\n// Map a base-62 digit to its value. Faster than DIGITS.indexOf() (which scans\n// the alphabet) on the hot key-generation path. DIGITS is in char-code order:\n// '0'-'9' -> 0-9, 'A'-'Z' -> 10-35, 'a'-'z' -> 36-61.\nfunction digitIndex(char: string): number {\n\tconst code = char.charCodeAt(0)\n\tif (code <= 57) return code - 48\n\tif (code <= 90) return code - 55\n\treturn code - 61\n}\n\n/**\n * Throws if `key` is not a canonical order key. Allocation-free in the common\n * case: no `repeat`/`slice` per call.\n */\nexport function validateOrderKey(key: string): void {\n\tif (key === SMALLEST_INTEGER) {\n\t\tthrow new Error('invalid order key: ' + key)\n\t}\n\t// getIntegerPart throws if the first character is bad or the key is too short.\n\tconst i = getIntegerPart(key)\n\t// The fractional part (everything after the integer part) must not end in the\n\t// smallest digit, as a trailing zero is a non-canonical representation.\n\tif (key.length > i.length && key[key.length - 1] === ZERO) {\n\t\tthrow new Error('invalid order key: ' + key)\n\t}\n}\n\n// `a` may be empty string, `b` is null or non-empty string.\n// `a < b` lexicographically if `b` is non-null. No trailing zeros allowed.\nfunction midpoint(a: string, b: string | null): string {\n\tif (b != null && a >= b) {\n\t\tthrow new Error(a + ' >= ' + b)\n\t}\n\tif (a.slice(-1) === ZERO || (b && b.slice(-1) === ZERO)) {\n\t\tthrow new Error('trailing zero')\n\t}\n\tif (b) {\n\t\t// Remove the longest common prefix, padding `a` with zeros as we go. We\n\t\t// don't need to pad `b`, because it can't end before `a` while traversing\n\t\t// the common prefix.\n\t\tlet n = 0\n\t\twhile ((a[n] || ZERO) === b[n]) {\n\t\t\tn++\n\t\t}\n\t\tif (n > 0) {\n\t\t\treturn b.slice(0, n) + midpoint(a.slice(n), b.slice(n))\n\t\t}\n\t}\n\t// First digits (or lack of digit) are different.\n\tconst digitA = a ? digitIndex(a[0]) : 0\n\tconst digitB = b != null ? digitIndex(b[0]) : DIGITS.length\n\tif (digitB - digitA > 1) {\n\t\tconst midDigit = Math.round(0.5 * (digitA + digitB))\n\t\treturn DIGITS[midDigit]\n\t}\n\t// First digits are consecutive.\n\tif (b && b.length > 1) {\n\t\treturn b.slice(0, 1)\n\t}\n\t// `b` is null or has length 1 (a single digit). The first digit of `a` is the\n\t// previous digit to `b`, or the largest digit if `b` is null.\n\treturn DIGITS[digitA] + midpoint(a.slice(1), null)\n}\n\n// May return null, as there is a largest integer.\nfunction incrementInteger(x: string): string | null {\n\tconst [head, ...digs] = x.split('')\n\tlet carry = true\n\tfor (let i = digs.length - 1; carry && i >= 0; i--) {\n\t\tconst d = digitIndex(digs[i]) + 1\n\t\tif (d === DIGITS.length) {\n\t\t\tdigs[i] = ZERO\n\t\t} else {\n\t\t\tdigs[i] = DIGITS[d]\n\t\t\tcarry = false\n\t\t}\n\t}\n\tif (carry) {\n\t\tif (head === 'Z') return 'a' + ZERO\n\t\tif (head === 'z') return null\n\t\tconst h = String.fromCharCode(head.charCodeAt(0) + 1)\n\t\tif (h > 'a') {\n\t\t\tdigs.push(ZERO)\n\t\t} else {\n\t\t\tdigs.pop()\n\t\t}\n\t\treturn h + digs.join('')\n\t}\n\treturn head + digs.join('')\n}\n\n// May return null, as there is a smallest integer.\nfunction decrementInteger(x: string): string | null {\n\tconst [head, ...digs] = x.split('')\n\tlet borrow = true\n\tfor (let i = digs.length - 1; borrow && i >= 0; i--) {\n\t\tconst d = digitIndex(digs[i]) - 1\n\t\tif (d === -1) {\n\t\t\tdigs[i] = LARGEST_DIGIT\n\t\t} else {\n\t\t\tdigs[i] = DIGITS[d]\n\t\t\tborrow = false\n\t\t}\n\t}\n\tif (borrow) {\n\t\tif (head === 'a') return 'Z' + LARGEST_DIGIT\n\t\tif (head === 'A') return null\n\t\tconst h = String.fromCharCode(head.charCodeAt(0) - 1)\n\t\tif (h < 'Z') {\n\t\t\tdigs.push(LARGEST_DIGIT)\n\t\t} else {\n\t\t\tdigs.pop()\n\t\t}\n\t\treturn h + digs.join('')\n\t}\n\treturn head + digs.join('')\n}\n\n// Generate a key strictly between `a` and `b`, without validating the inputs.\n// `a`/`b` are order keys or null (START/END). `a < b` if both are non-null.\nfunction keyBetweenUnchecked(a: string | null, b: string | null): string {\n\tif (a != null && b != null && a >= b) {\n\t\tthrow new Error(a + ' >= ' + b)\n\t}\n\tif (a == null) {\n\t\tif (b == null) return 'a' + ZERO\n\t\tconst ib = getIntegerPart(b)\n\t\tconst fb = b.slice(ib.length)\n\t\tif (ib === SMALLEST_INTEGER) {\n\t\t\treturn ib + midpoint('', fb)\n\t\t}\n\t\tif (ib < b) return ib\n\t\tconst res = decrementInteger(ib)\n\t\tif (res == null) throw new Error('cannot decrement any more')\n\t\treturn res\n\t}\n\tif (b == null) {\n\t\tconst ia = getIntegerPart(a)\n\t\tconst fa = a.slice(ia.length)\n\t\tconst i = incrementInteger(ia)\n\t\treturn i == null ? ia + midpoint(fa, null) : i\n\t}\n\tconst ia = getIntegerPart(a)\n\tconst fa = a.slice(ia.length)\n\tconst ib = getIntegerPart(b)\n\tconst fb = b.slice(ib.length)\n\tif (ia === ib) {\n\t\treturn ia + midpoint(fa, fb)\n\t}\n\tconst i = incrementInteger(ia)\n\tif (i == null) throw new Error('cannot increment any more')\n\tif (i < b) return i\n\treturn ia + midpoint(fa, null)\n}\n\n// Generate `n` keys between `a` and `b`, without validating the inputs.\n// Intermediate keys are valid by construction, so they're never re-validated.\nfunction nKeysBetweenUnchecked(a: string | null, b: string | null, n: number): string[] {\n\tif (n === 0) return []\n\tif (n === 1) return [keyBetweenUnchecked(a, b)]\n\tif (b == null) {\n\t\tlet c = keyBetweenUnchecked(a, b)\n\t\tconst result = [c]\n\t\tfor (let i = 0; i < n - 1; i++) {\n\t\t\tc = keyBetweenUnchecked(c, b)\n\t\t\tresult.push(c)\n\t\t}\n\t\treturn result\n\t}\n\tif (a == null) {\n\t\tlet c = keyBetweenUnchecked(a, b)\n\t\tconst result = [c]\n\t\tfor (let i = 0; i < n - 1; i++) {\n\t\t\tc = keyBetweenUnchecked(a, c)\n\t\t\tresult.push(c)\n\t\t}\n\t\tresult.reverse()\n\t\treturn result\n\t}\n\tconst mid = Math.floor(n / 2)\n\tconst c = keyBetweenUnchecked(a, b)\n\treturn [...nKeysBetweenUnchecked(a, c, mid), c, ...nKeysBetweenUnchecked(c, b, n - mid - 1)]\n}\n\n// Bisect `[low, high]` JITTER_BITS times, following a random walk, so that keys\n// generated concurrently land in different sub-ranges. `low`/`high` must already\n// be valid (or null); the intermediate midpoints are valid by construction.\nfunction jitterBetween(low: string | null, high: string | null): string {\n\tlet mid = keyBetweenUnchecked(low, high)\n\tfor (let i = 0; i < JITTER_BITS; i++) {\n\t\tif (Math.random() < 0.5) {\n\t\t\tlow = mid\n\t\t} else {\n\t\t\thigh = mid\n\t\t}\n\t\tmid = keyBetweenUnchecked(low, high)\n\t}\n\treturn mid\n}\n\n/**\n * Generate `n` jittered keys evenly spaced between `a` and `b`. Inputs are\n * validated once; everything downstream is generated, hence trusted.\n */\nexport function generateNJitteredKeysBetween(\n\ta: string | null,\n\tb: string | null,\n\tn: number\n): string[] {\n\tif (n === 0) return []\n\tif (a != null) validateOrderKey(a)\n\tif (b != null) validateOrderKey(b)\n\tconst keys = nKeysBetweenUnchecked(a, b, n + 1)\n\tconst result = new Array<string>(n)\n\tfor (let i = 0; i < n; i++) {\n\t\tresult[i] = jitterBetween(keys[i], keys[i + 1])\n\t}\n\treturn result\n}\n\n/**\n * Generate `n` keys evenly spaced between `a` and `b`, without jitter. Used in\n * tests for deterministic output.\n */\nexport function generateNKeysBetween(a: string | null, b: string | null, n: number): string[] {\n\tif (n === 0) return []\n\tif (a != null) validateOrderKey(a)\n\tif (b != null) validateOrderKey(b)\n\treturn nKeysBetweenUnchecked(a, b, n)\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAeA,MAAM,SAAS;AACf,MAAM,OAAO,OAAO,CAAC;AACrB,MAAM,gBAAgB,OAAO,OAAO,SAAS,CAAC;AAE9C,MAAM,mBAAmB,MAAM,KAAK,OAAO,EAAE;AAO7C,MAAM,cAAc;AAEpB,SAAS,iBAAiB,MAAsB;AAC/C,MAAI,QAAQ,OAAO,QAAQ,KAAK;AAC/B,WAAO,KAAK,WAAW,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI;AAAA,EACjD,WAAW,QAAQ,OAAO,QAAQ,KAAK;AACtC,WAAO,IAAI,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI;AAAA,EACjD;AACA,QAAM,IAAI,MAAM,6BAA6B,IAAI;AAClD;AAEA,SAAS,eAAe,KAAqB;AAC5C,QAAM,oBAAoB,iBAAiB,IAAI,CAAC,CAAC;AACjD,MAAI,oBAAoB,IAAI,QAAQ;AACnC,UAAM,IAAI,MAAM,wBAAwB,GAAG;AAAA,EAC5C;AACA,SAAO,IAAI,MAAM,GAAG,iBAAiB;AACtC;AAKA,SAAS,WAAW,MAAsB;AACzC,QAAM,OAAO,KAAK,WAAW,CAAC;AAC9B,MAAI,QAAQ,GAAI,QAAO,OAAO;AAC9B,MAAI,QAAQ,GAAI,QAAO,OAAO;AAC9B,SAAO,OAAO;AACf;AAMO,SAAS,iBAAiB,KAAmB;AACnD,MAAI,QAAQ,kBAAkB;AAC7B,UAAM,IAAI,MAAM,wBAAwB,GAAG;AAAA,EAC5C;AAEA,QAAM,IAAI,eAAe,GAAG;AAG5B,MAAI,IAAI,SAAS,EAAE,UAAU,IAAI,IAAI,SAAS,CAAC,MAAM,MAAM;AAC1D,UAAM,IAAI,MAAM,wBAAwB,GAAG;AAAA,EAC5C;AACD;AAIA,SAAS,SAAS,GAAW,GAA0B;AACtD,MAAI,KAAK,QAAQ,KAAK,GAAG;AACxB,UAAM,IAAI,MAAM,IAAI,SAAS,CAAC;AAAA,EAC/B;AACA,MAAI,EAAE,MAAM,EAAE,MAAM,QAAS,KAAK,EAAE,MAAM,EAAE,MAAM,MAAO;AACxD,UAAM,IAAI,MAAM,eAAe;AAAA,EAChC;AACA,MAAI,GAAG;AAIN,QAAI,IAAI;AACR,YAAQ,EAAE,CAAC,KAAK,UAAU,EAAE,CAAC,GAAG;AAC/B;AAAA,IACD;AACA,QAAI,IAAI,GAAG;AACV,aAAO,EAAE,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;AAAA,IACvD;AAAA,EACD;AAEA,QAAM,SAAS,IAAI,WAAW,EAAE,CAAC,CAAC,IAAI;AACtC,QAAM,SAAS,KAAK,OAAO,WAAW,EAAE,CAAC,CAAC,IAAI,OAAO;AACrD,MAAI,SAAS,SAAS,GAAG;AACxB,UAAM,WAAW,KAAK,MAAM,OAAO,SAAS,OAAO;AACnD,WAAO,OAAO,QAAQ;AAAA,EACvB;AAEA,MAAI,KAAK,EAAE,SAAS,GAAG;AACtB,WAAO,EAAE,MAAM,GAAG,CAAC;AAAA,EACpB;AAGA,SAAO,OAAO,MAAM,IAAI,SAAS,EAAE,MAAM,CAAC,GAAG,IAAI;AAClD;AAGA,SAAS,iBAAiB,GAA0B;AACnD,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI,EAAE,MAAM,EAAE;AAClC,MAAI,QAAQ;AACZ,WAAS,IAAI,KAAK,SAAS,GAAG,SAAS,KAAK,GAAG,KAAK;AACnD,UAAM,IAAI,WAAW,KAAK,CAAC,CAAC,IAAI;AAChC,QAAI,MAAM,OAAO,QAAQ;AACxB,WAAK,CAAC,IAAI;AAAA,IACX,OAAO;AACN,WAAK,CAAC,IAAI,OAAO,CAAC;AAClB,cAAQ;AAAA,IACT;AAAA,EACD;AACA,MAAI,OAAO;AACV,QAAI,SAAS,IAAK,QAAO,MAAM;AAC/B,QAAI,SAAS,IAAK,QAAO;AACzB,UAAM,IAAI,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;AACpD,QAAI,IAAI,KAAK;AACZ,WAAK,KAAK,IAAI;AAAA,IACf,OAAO;AACN,WAAK,IAAI;AAAA,IACV;AACA,WAAO,IAAI,KAAK,KAAK,EAAE;AAAA,EACxB;AACA,SAAO,OAAO,KAAK,KAAK,EAAE;AAC3B;AAGA,SAAS,iBAAiB,GAA0B;AACnD,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI,EAAE,MAAM,EAAE;AAClC,MAAI,SAAS;AACb,WAAS,IAAI,KAAK,SAAS,GAAG,UAAU,KAAK,GAAG,KAAK;AACpD,UAAM,IAAI,WAAW,KAAK,CAAC,CAAC,IAAI;AAChC,QAAI,MAAM,IAAI;AACb,WAAK,CAAC,IAAI;AAAA,IACX,OAAO;AACN,WAAK,CAAC,IAAI,OAAO,CAAC;AAClB,eAAS;AAAA,IACV;AAAA,EACD;AACA,MAAI,QAAQ;AACX,QAAI,SAAS,IAAK,QAAO,MAAM;AAC/B,QAAI,SAAS,IAAK,QAAO;AACzB,UAAM,IAAI,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;AACpD,QAAI,IAAI,KAAK;AACZ,WAAK,KAAK,aAAa;AAAA,IACxB,OAAO;AACN,WAAK,IAAI;AAAA,IACV;AACA,WAAO,IAAI,KAAK,KAAK,EAAE;AAAA,EACxB;AACA,SAAO,OAAO,KAAK,KAAK,EAAE;AAC3B;AAIA,SAAS,oBAAoB,GAAkB,GAA0B;AACxE,MAAI,KAAK,QAAQ,KAAK,QAAQ,KAAK,GAAG;AACrC,UAAM,IAAI,MAAM,IAAI,SAAS,CAAC;AAAA,EAC/B;AACA,MAAI,KAAK,MAAM;AACd,QAAI,KAAK,KAAM,QAAO,MAAM;AAC5B,UAAMA,MAAK,eAAe,CAAC;AAC3B,UAAMC,MAAK,EAAE,MAAMD,IAAG,MAAM;AAC5B,QAAIA,QAAO,kBAAkB;AAC5B,aAAOA,MAAK,SAAS,IAAIC,GAAE;AAAA,IAC5B;AACA,QAAID,MAAK,EAAG,QAAOA;AACnB,UAAM,MAAM,iBAAiBA,GAAE;AAC/B,QAAI,OAAO,KAAM,OAAM,IAAI,MAAM,2BAA2B;AAC5D,WAAO;AAAA,EACR;AACA,MAAI,KAAK,MAAM;AACd,UAAME,MAAK,eAAe,CAAC;AAC3B,UAAMC,MAAK,EAAE,MAAMD,IAAG,MAAM;AAC5B,UAAME,KAAI,iBAAiBF,GAAE;AAC7B,WAAOE,MAAK,OAAOF,MAAK,SAASC,KAAI,IAAI,IAAIC;AAAA,EAC9C;AACA,QAAM,KAAK,eAAe,CAAC;AAC3B,QAAM,KAAK,EAAE,MAAM,GAAG,MAAM;AAC5B,QAAM,KAAK,eAAe,CAAC;AAC3B,QAAM,KAAK,EAAE,MAAM,GAAG,MAAM;AAC5B,MAAI,OAAO,IAAI;AACd,WAAO,KAAK,SAAS,IAAI,EAAE;AAAA,EAC5B;AACA,QAAM,IAAI,iBAAiB,EAAE;AAC7B,MAAI,KAAK,KAAM,OAAM,IAAI,MAAM,2BAA2B;AAC1D,MAAI,IAAI,EAAG,QAAO;AAClB,SAAO,KAAK,SAAS,IAAI,IAAI;AAC9B;AAIA,SAAS,sBAAsB,GAAkB,GAAkB,GAAqB;AACvF,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,MAAM,EAAG,QAAO,CAAC,oBAAoB,GAAG,CAAC,CAAC;AAC9C,MAAI,KAAK,MAAM;AACd,QAAIC,KAAI,oBAAoB,GAAG,CAAC;AAChC,UAAM,SAAS,CAACA,EAAC;AACjB,aAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC/B,MAAAA,KAAI,oBAAoBA,IAAG,CAAC;AAC5B,aAAO,KAAKA,EAAC;AAAA,IACd;AACA,WAAO;AAAA,EACR;AACA,MAAI,KAAK,MAAM;AACd,QAAIA,KAAI,oBAAoB,GAAG,CAAC;AAChC,UAAM,SAAS,CAACA,EAAC;AACjB,aAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC/B,MAAAA,KAAI,oBAAoB,GAAGA,EAAC;AAC5B,aAAO,KAAKA,EAAC;AAAA,IACd;AACA,WAAO,QAAQ;AACf,WAAO;AAAA,EACR;AACA,QAAM,MAAM,KAAK,MAAM,IAAI,CAAC;AAC5B,QAAM,IAAI,oBAAoB,GAAG,CAAC;AAClC,SAAO,CAAC,GAAG,sBAAsB,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,sBAAsB,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AAC5F;AAKA,SAAS,cAAc,KAAoB,MAA6B;AACvE,MAAI,MAAM,oBAAoB,KAAK,IAAI;AACvC,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACrC,QAAI,KAAK,OAAO,IAAI,KAAK;AACxB,YAAM;AAAA,IACP,OAAO;AACN,aAAO;AAAA,IACR;AACA,UAAM,oBAAoB,KAAK,IAAI;AAAA,EACpC;AACA,SAAO;AACR;AAMO,SAAS,6BACf,GACA,GACA,GACW;AACX,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,QAAM,OAAO,sBAAsB,GAAG,GAAG,IAAI,CAAC;AAC9C,QAAM,SAAS,IAAI,MAAc,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,WAAO,CAAC,IAAI,cAAc,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AAAA,EAC/C;AACA,SAAO;AACR;AAMO,SAAS,qBAAqB,GAAkB,GAAkB,GAAqB;AAC7F,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,SAAO,sBAAsB,GAAG,GAAG,CAAC;AACrC;",
+  "names": ["ib", "fb", "ia", "fa", "i", "c"]
+}

package/dist-cjs/lib/reordering.js

@@ -31,15 +31,12 @@ __export(reordering_exports, {
   validateIndexKey: () => validateIndexKey
 });
 module.exports = __toCommonJS(reordering_exports);
-var import_jittered_fractional_indexing = require("jittered-fractional-indexing");
-const generateNKeysBetweenWithNoJitter = (a, b, n) => {
-  return (0, import_jittered_fractional_indexing.generateNKeysBetween)(a, b, n, { jitterBits: 0 });
-};
-const generateKeysFn = process.env.NODE_ENV === "test" ? generateNKeysBetweenWithNoJitter : import_jittered_fractional_indexing.generateNKeysBetween;
+var import_fractionalIndexing = require("./fractionalIndexing");
+const generateKeysFn = process.env.NODE_ENV === "test" ? import_fractionalIndexing.generateNKeysBetween : import_fractionalIndexing.generateNJitteredKeysBetween;
 const ZERO_INDEX_KEY = "a0";
 function validateIndexKey(index) {
   try {
-    (0, import_jittered_fractional_indexing.generateKeyBetween)(index, null);
+    (0, import_fractionalIndexing.validateOrderKey)(index);
   } catch {
     throw new Error("invalid index: " + index);
   }

package/dist-cjs/lib/reordering.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/lib/reordering.ts"],
-  "sourcesContent": ["import { generateKeyBetween, generateNKeysBetween } from 'jittered-fractional-indexing'\n\nconst generateNKeysBetweenWithNoJitter = (a: string | null, b: string | null, n: number) => {\n\treturn generateNKeysBetween(a, b, n, { jitterBits: 0 })\n}\n\nconst generateKeysFn =\n\tprocess.env.NODE_ENV === 'test' ? generateNKeysBetweenWithNoJitter : generateNKeysBetween\n\n/**\n * A string made up of an integer part followed by a fraction part. The fraction point consists of\n * zero or more digits with no trailing zeros. Based on\n * {@link https://observablehq.com/@dgreensp/implementing-fractional-indexing}.\n *\n * @public\n */\nexport type IndexKey = string & { __brand: 'indexKey' }\n\n/**\n * The index key for the first index - 'a0'.\n * @public\n */\nexport const ZERO_INDEX_KEY = 'a0' as IndexKey\n\n/**\n * Validates that a string is a valid IndexKey.\n * @param index - The string to validate.\n * @throws Error if the index is invalid.\n * @internal\n */\nexport function validateIndexKey(index: string): asserts index is IndexKey {\n\ttry {\n\t\tgenerateKeyBetween(index, null)\n\t} catch {\n\t\tthrow new Error('invalid index: ' + index)\n\t}\n}\n\n/**\n * Get a number of indices between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values between below and above.\n * @example\n * ```ts\n * const indices = getIndicesBetween('a0' as IndexKey, 'a2' as IndexKey, 2)\n * console.log(indices) // ['a0V', 'a1']\n * ```\n * @public\n */\nexport function getIndicesBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined,\n\tn: number\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices above an index.\n * @param below - The index below.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values above the given index.\n * @example\n * ```ts\n * const indices = getIndicesAbove('a0' as IndexKey, 3)\n * console.log(indices) // ['a1', 'a2', 'a3']\n * ```\n * @public\n */\nexport function getIndicesAbove(below: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(below ?? null, null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices below an index.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values below the given index.\n * @example\n * ```ts\n * const indices = getIndicesBelow('a2' as IndexKey, 2)\n * console.log(indices) // ['a1', 'a0V']\n * ```\n * @public\n */\nexport function getIndicesBelow(above: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get the index between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @returns A single IndexKey value between below and above.\n * @example\n * ```ts\n * const index = getIndexBetween('a0' as IndexKey, 'a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index above a given index.\n * @param below - The index below.\n * @returns An IndexKey value above the given index.\n * @example\n * ```ts\n * const index = getIndexAbove('a0' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexAbove(below: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(below, null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index below a given index.\n * @param above - The index above.\n * @returns An IndexKey value below the given index.\n * @example\n * ```ts\n * const index = getIndexBelow('a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBelow(above: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(null, above, 1)[0] as IndexKey\n}\n\n/**\n * Get n number of indices, starting at an index.\n * @param n - The number of indices to get.\n * @param start - The index to start at.\n * @returns An array containing the start index plus n additional IndexKey values.\n * @example\n * ```ts\n * const indices = getIndices(3, 'a1' as IndexKey)\n * console.log(indices) // ['a1', 'a2', 'a3', 'a4']\n * ```\n * @public\n */\nexport function getIndices(n: number, start = 'a1' as IndexKey) {\n\treturn [start, ...generateKeysFn(start, null, n)] as IndexKey[]\n}\n\n/**\n * Sort by index.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @returns A number indicating sort order (-1, 0, or 1).\n * @example\n * ```ts\n * const shapes = [\n *   { id: 'b', index: 'a2' as IndexKey },\n *   { id: 'a', index: 'a1' as IndexKey }\n * ]\n * const sorted = shapes.sort(sortByIndex)\n * console.log(sorted) // [{ id: 'a', index: 'a1' }, { id: 'b', index: 'a2' }]\n * ```\n * @public\n */\nexport function sortByIndex<T extends { index: IndexKey }>(a: T, b: T) {\n\tif (a.index < b.index) {\n\t\treturn -1\n\t} else if (a.index > b.index) {\n\t\treturn 1\n\t}\n\treturn 0\n}\n\n/**\n * Sort by index, or null.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @public\n */\nexport function sortByMaybeIndex<T extends { index?: IndexKey | null }>(a: T, b: T) {\n\tif (a.index && b.index) {\n\t\treturn a.index < b.index ? -1 : 1\n\t}\n\tif (a.index && b.index == null) {\n\t\treturn -1\n\t}\n\tif (a.index == null && b.index == null) {\n\t\treturn 0\n\t}\n\treturn 1\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0CAAyD;AAEzD,MAAM,mCAAmC,CAAC,GAAkB,GAAkB,MAAc;AAC3F,aAAO,0DAAqB,GAAG,GAAG,GAAG,EAAE,YAAY,EAAE,CAAC;AACvD;AAEA,MAAM,iBACL,QAAQ,IAAI,aAAa,SAAS,mCAAmC;AAe/D,MAAM,iBAAiB;AAQvB,SAAS,iBAAiB,OAA0C;AAC1E,MAAI;AACH,gEAAmB,OAAO,IAAI;AAAA,EAC/B,QAAQ;AACP,UAAM,IAAI,MAAM,oBAAoB,KAAK;AAAA,EAC1C;AACD;AAeO,SAAS,kBACf,OACA,OACA,GACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC;AACtD;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,SAAS,MAAM,MAAM,CAAC;AAC7C;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,MAAM,SAAS,MAAM,CAAC;AAC7C;AAcO,SAAS,gBACf,OACA,OACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC,EAAE,CAAC;AACzD;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,OAAO,MAAM,CAAC,EAAE,CAAC;AACxC;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,MAAM,OAAO,CAAC,EAAE,CAAC;AACxC;AAcO,SAAS,WAAW,GAAW,QAAQ,MAAkB;AAC/D,SAAO,CAAC,OAAO,GAAG,eAAe,OAAO,MAAM,CAAC,CAAC;AACjD;AAkBO,SAAS,YAA2C,GAAM,GAAM;AACtE,MAAI,EAAE,QAAQ,EAAE,OAAO;AACtB,WAAO;AAAA,EACR,WAAW,EAAE,QAAQ,EAAE,OAAO;AAC7B,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAQO,SAAS,iBAAwD,GAAM,GAAM;AACnF,MAAI,EAAE,SAAS,EAAE,OAAO;AACvB,WAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAAA,EACjC;AACA,MAAI,EAAE,SAAS,EAAE,SAAS,MAAM;AAC/B,WAAO;AAAA,EACR;AACA,MAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;AACvC,WAAO;AAAA,EACR;AACA,SAAO;AACR;",
+  "sourcesContent": ["import {\n\tgenerateNJitteredKeysBetween,\n\tgenerateNKeysBetween,\n\tvalidateOrderKey,\n} from './fractionalIndexing'\n\nconst generateKeysFn =\n\tprocess.env.NODE_ENV === 'test' ? generateNKeysBetween : generateNJitteredKeysBetween\n\n/**\n * A string made up of an integer part followed by a fraction part. The fraction point consists of\n * zero or more digits with no trailing zeros. Based on\n * {@link https://observablehq.com/@dgreensp/implementing-fractional-indexing}.\n *\n * @public\n */\nexport type IndexKey = string & { __brand: 'indexKey' }\n\n/**\n * The index key for the first index - 'a0'.\n * @public\n */\nexport const ZERO_INDEX_KEY = 'a0' as IndexKey\n\n/**\n * Validates that a string is a valid IndexKey.\n * @param index - The string to validate.\n * @throws Error if the index is invalid.\n * @internal\n */\nexport function validateIndexKey(index: string): asserts index is IndexKey {\n\ttry {\n\t\tvalidateOrderKey(index)\n\t} catch {\n\t\tthrow new Error('invalid index: ' + index)\n\t}\n}\n\n/**\n * Get a number of indices between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values between below and above.\n * @example\n * ```ts\n * const indices = getIndicesBetween('a0' as IndexKey, 'a2' as IndexKey, 2)\n * console.log(indices) // ['a0V', 'a1']\n * ```\n * @public\n */\nexport function getIndicesBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined,\n\tn: number\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices above an index.\n * @param below - The index below.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values above the given index.\n * @example\n * ```ts\n * const indices = getIndicesAbove('a0' as IndexKey, 3)\n * console.log(indices) // ['a1', 'a2', 'a3']\n * ```\n * @public\n */\nexport function getIndicesAbove(below: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(below ?? null, null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices below an index.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values below the given index.\n * @example\n * ```ts\n * const indices = getIndicesBelow('a2' as IndexKey, 2)\n * console.log(indices) // ['a1', 'a0V']\n * ```\n * @public\n */\nexport function getIndicesBelow(above: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get the index between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @returns A single IndexKey value between below and above.\n * @example\n * ```ts\n * const index = getIndexBetween('a0' as IndexKey, 'a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index above a given index.\n * @param below - The index below.\n * @returns An IndexKey value above the given index.\n * @example\n * ```ts\n * const index = getIndexAbove('a0' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexAbove(below: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(below, null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index below a given index.\n * @param above - The index above.\n * @returns An IndexKey value below the given index.\n * @example\n * ```ts\n * const index = getIndexBelow('a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBelow(above: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(null, above, 1)[0] as IndexKey\n}\n\n/**\n * Get n number of indices, starting at an index.\n * @param n - The number of indices to get.\n * @param start - The index to start at.\n * @returns An array containing the start index plus n additional IndexKey values.\n * @example\n * ```ts\n * const indices = getIndices(3, 'a1' as IndexKey)\n * console.log(indices) // ['a1', 'a2', 'a3', 'a4']\n * ```\n * @public\n */\nexport function getIndices(n: number, start = 'a1' as IndexKey) {\n\treturn [start, ...generateKeysFn(start, null, n)] as IndexKey[]\n}\n\n/**\n * Sort by index.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @returns A number indicating sort order (-1, 0, or 1).\n * @example\n * ```ts\n * const shapes = [\n *   { id: 'b', index: 'a2' as IndexKey },\n *   { id: 'a', index: 'a1' as IndexKey }\n * ]\n * const sorted = shapes.sort(sortByIndex)\n * console.log(sorted) // [{ id: 'a', index: 'a1' }, { id: 'b', index: 'a2' }]\n * ```\n * @public\n */\nexport function sortByIndex<T extends { index: IndexKey }>(a: T, b: T) {\n\tif (a.index < b.index) {\n\t\treturn -1\n\t} else if (a.index > b.index) {\n\t\treturn 1\n\t}\n\treturn 0\n}\n\n/**\n * Sort by index, or null.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @public\n */\nexport function sortByMaybeIndex<T extends { index?: IndexKey | null }>(a: T, b: T) {\n\tif (a.index && b.index) {\n\t\treturn a.index < b.index ? -1 : 1\n\t}\n\tif (a.index && b.index == null) {\n\t\treturn -1\n\t}\n\tif (a.index == null && b.index == null) {\n\t\treturn 0\n\t}\n\treturn 1\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gCAIO;AAEP,MAAM,iBACL,QAAQ,IAAI,aAAa,SAAS,iDAAuB;AAenD,MAAM,iBAAiB;AAQvB,SAAS,iBAAiB,OAA0C;AAC1E,MAAI;AACH,oDAAiB,KAAK;AAAA,EACvB,QAAQ;AACP,UAAM,IAAI,MAAM,oBAAoB,KAAK;AAAA,EAC1C;AACD;AAeO,SAAS,kBACf,OACA,OACA,GACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC;AACtD;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,SAAS,MAAM,MAAM,CAAC;AAC7C;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,MAAM,SAAS,MAAM,CAAC;AAC7C;AAcO,SAAS,gBACf,OACA,OACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC,EAAE,CAAC;AACzD;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,OAAO,MAAM,CAAC,EAAE,CAAC;AACxC;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,MAAM,OAAO,CAAC,EAAE,CAAC;AACxC;AAcO,SAAS,WAAW,GAAW,QAAQ,MAAkB;AAC/D,SAAO,CAAC,OAAO,GAAG,eAAe,OAAO,MAAM,CAAC,CAAC;AACjD;AAkBO,SAAS,YAA2C,GAAM,GAAM;AACtE,MAAI,EAAE,QAAQ,EAAE,OAAO;AACtB,WAAO;AAAA,EACR,WAAW,EAAE,QAAQ,EAAE,OAAO;AAC7B,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAQO,SAAS,iBAAwD,GAAM,GAAM;AACnF,MAAI,EAAE,SAAS,EAAE,OAAO;AACvB,WAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAAA,EACjC;AACA,MAAI,EAAE,SAAS,EAAE,SAAS,MAAM;AAC/B,WAAO;AAAA,EACR;AACA,MAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;AACvC,WAAO;AAAA,EACR;AACA,SAAO;AACR;",
   "names": []
 }

package/dist-esm/index.mjs

@@ -102,7 +102,7 @@ import { registerTldrawLibraryVersion as registerTldrawLibraryVersion2 } from ".
 import { warnDeprecatedGetter, warnOnce } from "./lib/warn.mjs";
 registerTldrawLibraryVersion(
   "@tldraw/utils",
-  "5.2.0-next.79b13319d317",
+  "5.2.0-next.7b677d60c152",
   "esm"
 );
 export {

package/dist-esm/lib/fractionalIndexing.mjs

@@ -0,0 +1,207 @@
+const DIGITS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+const ZERO = DIGITS[0];
+const LARGEST_DIGIT = DIGITS[DIGITS.length - 1];
+const SMALLEST_INTEGER = "A" + ZERO.repeat(26);
+const JITTER_BITS = 16;
+function getIntegerLength(head) {
+  if (head >= "a" && head <= "z") {
+    return head.charCodeAt(0) - "a".charCodeAt(0) + 2;
+  } else if (head >= "A" && head <= "Z") {
+    return "Z".charCodeAt(0) - head.charCodeAt(0) + 2;
+  }
+  throw new Error("invalid order key head: " + head);
+}
+function getIntegerPart(key) {
+  const integerPartLength = getIntegerLength(key[0]);
+  if (integerPartLength > key.length) {
+    throw new Error("invalid order key: " + key);
+  }
+  return key.slice(0, integerPartLength);
+}
+function digitIndex(char) {
+  const code = char.charCodeAt(0);
+  if (code <= 57) return code - 48;
+  if (code <= 90) return code - 55;
+  return code - 61;
+}
+function validateOrderKey(key) {
+  if (key === SMALLEST_INTEGER) {
+    throw new Error("invalid order key: " + key);
+  }
+  const i = getIntegerPart(key);
+  if (key.length > i.length && key[key.length - 1] === ZERO) {
+    throw new Error("invalid order key: " + key);
+  }
+}
+function midpoint(a, b) {
+  if (b != null && a >= b) {
+    throw new Error(a + " >= " + b);
+  }
+  if (a.slice(-1) === ZERO || b && b.slice(-1) === ZERO) {
+    throw new Error("trailing zero");
+  }
+  if (b) {
+    let n = 0;
+    while ((a[n] || ZERO) === b[n]) {
+      n++;
+    }
+    if (n > 0) {
+      return b.slice(0, n) + midpoint(a.slice(n), b.slice(n));
+    }
+  }
+  const digitA = a ? digitIndex(a[0]) : 0;
+  const digitB = b != null ? digitIndex(b[0]) : DIGITS.length;
+  if (digitB - digitA > 1) {
+    const midDigit = Math.round(0.5 * (digitA + digitB));
+    return DIGITS[midDigit];
+  }
+  if (b && b.length > 1) {
+    return b.slice(0, 1);
+  }
+  return DIGITS[digitA] + midpoint(a.slice(1), null);
+}
+function incrementInteger(x) {
+  const [head, ...digs] = x.split("");
+  let carry = true;
+  for (let i = digs.length - 1; carry && i >= 0; i--) {
+    const d = digitIndex(digs[i]) + 1;
+    if (d === DIGITS.length) {
+      digs[i] = ZERO;
+    } else {
+      digs[i] = DIGITS[d];
+      carry = false;
+    }
+  }
+  if (carry) {
+    if (head === "Z") return "a" + ZERO;
+    if (head === "z") return null;
+    const h = String.fromCharCode(head.charCodeAt(0) + 1);
+    if (h > "a") {
+      digs.push(ZERO);
+    } else {
+      digs.pop();
+    }
+    return h + digs.join("");
+  }
+  return head + digs.join("");
+}
+function decrementInteger(x) {
+  const [head, ...digs] = x.split("");
+  let borrow = true;
+  for (let i = digs.length - 1; borrow && i >= 0; i--) {
+    const d = digitIndex(digs[i]) - 1;
+    if (d === -1) {
+      digs[i] = LARGEST_DIGIT;
+    } else {
+      digs[i] = DIGITS[d];
+      borrow = false;
+    }
+  }
+  if (borrow) {
+    if (head === "a") return "Z" + LARGEST_DIGIT;
+    if (head === "A") return null;
+    const h = String.fromCharCode(head.charCodeAt(0) - 1);
+    if (h < "Z") {
+      digs.push(LARGEST_DIGIT);
+    } else {
+      digs.pop();
+    }
+    return h + digs.join("");
+  }
+  return head + digs.join("");
+}
+function keyBetweenUnchecked(a, b) {
+  if (a != null && b != null && a >= b) {
+    throw new Error(a + " >= " + b);
+  }
+  if (a == null) {
+    if (b == null) return "a" + ZERO;
+    const ib2 = getIntegerPart(b);
+    const fb2 = b.slice(ib2.length);
+    if (ib2 === SMALLEST_INTEGER) {
+      return ib2 + midpoint("", fb2);
+    }
+    if (ib2 < b) return ib2;
+    const res = decrementInteger(ib2);
+    if (res == null) throw new Error("cannot decrement any more");
+    return res;
+  }
+  if (b == null) {
+    const ia2 = getIntegerPart(a);
+    const fa2 = a.slice(ia2.length);
+    const i2 = incrementInteger(ia2);
+    return i2 == null ? ia2 + midpoint(fa2, null) : i2;
+  }
+  const ia = getIntegerPart(a);
+  const fa = a.slice(ia.length);
+  const ib = getIntegerPart(b);
+  const fb = b.slice(ib.length);
+  if (ia === ib) {
+    return ia + midpoint(fa, fb);
+  }
+  const i = incrementInteger(ia);
+  if (i == null) throw new Error("cannot increment any more");
+  if (i < b) return i;
+  return ia + midpoint(fa, null);
+}
+function nKeysBetweenUnchecked(a, b, n) {
+  if (n === 0) return [];
+  if (n === 1) return [keyBetweenUnchecked(a, b)];
+  if (b == null) {
+    let c2 = keyBetweenUnchecked(a, b);
+    const result = [c2];
+    for (let i = 0; i < n - 1; i++) {
+      c2 = keyBetweenUnchecked(c2, b);
+      result.push(c2);
+    }
+    return result;
+  }
+  if (a == null) {
+    let c2 = keyBetweenUnchecked(a, b);
+    const result = [c2];
+    for (let i = 0; i < n - 1; i++) {
+      c2 = keyBetweenUnchecked(a, c2);
+      result.push(c2);
+    }
+    result.reverse();
+    return result;
+  }
+  const mid = Math.floor(n / 2);
+  const c = keyBetweenUnchecked(a, b);
+  return [...nKeysBetweenUnchecked(a, c, mid), c, ...nKeysBetweenUnchecked(c, b, n - mid - 1)];
+}
+function jitterBetween(low, high) {
+  let mid = keyBetweenUnchecked(low, high);
+  for (let i = 0; i < JITTER_BITS; i++) {
+    if (Math.random() < 0.5) {
+      low = mid;
+    } else {
+      high = mid;
+    }
+    mid = keyBetweenUnchecked(low, high);
+  }
+  return mid;
+}
+function generateNJitteredKeysBetween(a, b, n) {
+  if (n === 0) return [];
+  if (a != null) validateOrderKey(a);
+  if (b != null) validateOrderKey(b);
+  const keys = nKeysBetweenUnchecked(a, b, n + 1);
+  const result = new Array(n);
+  for (let i = 0; i < n; i++) {
+    result[i] = jitterBetween(keys[i], keys[i + 1]);
+  }
+  return result;
+}
+function generateNKeysBetween(a, b, n) {
+  if (n === 0) return [];
+  if (a != null) validateOrderKey(a);
+  if (b != null) validateOrderKey(b);
+  return nKeysBetweenUnchecked(a, b, n);
+}
+export {
+  generateNJitteredKeysBetween,
+  generateNKeysBetween,
+  validateOrderKey
+};
+//# sourceMappingURL=fractionalIndexing.mjs.map

package/dist-esm/lib/fractionalIndexing.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/lib/fractionalIndexing.ts"],
+  "sourcesContent": ["// Fractional indexing, specialized to tldraw's needs.\n//\n// This is a vendored and trimmed version of the `fractional-indexing` (by\n// arv@rocicorp.dev) and `jittered-fractional-indexing` (by\n// github@nathanhleung.com) packages, both released under CC0-1.0 (public\n// domain). See https://observablehq.com/@dgreensp/implementing-fractional-indexing\n// for the original algorithm.\n//\n// We only ever use the default base-62 alphabet, so the `digits` parameter has\n// been specialized away. This lets us hoist the per-call allocations that the\n// upstream `validateOrderKey` made (notably `digits[0].repeat(26)`) into module\n// constants, and skip redundant re-validation inside the jitter loop, which are\n// both on hot paths (every index generation and every IndexKey validation).\n\n// Digits must be in ascending character-code order.\nconst DIGITS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'\nconst ZERO = DIGITS[0] // '0'\nconst LARGEST_DIGIT = DIGITS[DIGITS.length - 1] // 'z'\n// The reserved \"smallest integer\" key, which has no valid predecessor.\nconst SMALLEST_INTEGER = 'A' + ZERO.repeat(26)\n// Number of random bisections used to spread concurrently-generated keys apart,\n// reducing the chance of collisions when multiple clients insert into the same\n// gap at once. Each bit costs one extra key generation and ~0.17 characters of\n// key length, so this trades collision resistance against compute and key size.\n// 16 keeps collisions below ~0.1% even for ~10 simultaneous same-position\n// inserts, which is ample headroom for real multiplayer use.\nconst JITTER_BITS = 16\n\nfunction getIntegerLength(head: string): number {\n\tif (head >= 'a' && head <= 'z') {\n\t\treturn head.charCodeAt(0) - 'a'.charCodeAt(0) + 2\n\t} else if (head >= 'A' && head <= 'Z') {\n\t\treturn 'Z'.charCodeAt(0) - head.charCodeAt(0) + 2\n\t}\n\tthrow new Error('invalid order key head: ' + head)\n}\n\nfunction getIntegerPart(key: string): string {\n\tconst integerPartLength = getIntegerLength(key[0])\n\tif (integerPartLength > key.length) {\n\t\tthrow new Error('invalid order key: ' + key)\n\t}\n\treturn key.slice(0, integerPartLength)\n}\n\n// Map a base-62 digit to its value. Faster than DIGITS.indexOf() (which scans\n// the alphabet) on the hot key-generation path. DIGITS is in char-code order:\n// '0'-'9' -> 0-9, 'A'-'Z' -> 10-35, 'a'-'z' -> 36-61.\nfunction digitIndex(char: string): number {\n\tconst code = char.charCodeAt(0)\n\tif (code <= 57) return code - 48\n\tif (code <= 90) return code - 55\n\treturn code - 61\n}\n\n/**\n * Throws if `key` is not a canonical order key. Allocation-free in the common\n * case: no `repeat`/`slice` per call.\n */\nexport function validateOrderKey(key: string): void {\n\tif (key === SMALLEST_INTEGER) {\n\t\tthrow new Error('invalid order key: ' + key)\n\t}\n\t// getIntegerPart throws if the first character is bad or the key is too short.\n\tconst i = getIntegerPart(key)\n\t// The fractional part (everything after the integer part) must not end in the\n\t// smallest digit, as a trailing zero is a non-canonical representation.\n\tif (key.length > i.length && key[key.length - 1] === ZERO) {\n\t\tthrow new Error('invalid order key: ' + key)\n\t}\n}\n\n// `a` may be empty string, `b` is null or non-empty string.\n// `a < b` lexicographically if `b` is non-null. No trailing zeros allowed.\nfunction midpoint(a: string, b: string | null): string {\n\tif (b != null && a >= b) {\n\t\tthrow new Error(a + ' >= ' + b)\n\t}\n\tif (a.slice(-1) === ZERO || (b && b.slice(-1) === ZERO)) {\n\t\tthrow new Error('trailing zero')\n\t}\n\tif (b) {\n\t\t// Remove the longest common prefix, padding `a` with zeros as we go. We\n\t\t// don't need to pad `b`, because it can't end before `a` while traversing\n\t\t// the common prefix.\n\t\tlet n = 0\n\t\twhile ((a[n] || ZERO) === b[n]) {\n\t\t\tn++\n\t\t}\n\t\tif (n > 0) {\n\t\t\treturn b.slice(0, n) + midpoint(a.slice(n), b.slice(n))\n\t\t}\n\t}\n\t// First digits (or lack of digit) are different.\n\tconst digitA = a ? digitIndex(a[0]) : 0\n\tconst digitB = b != null ? digitIndex(b[0]) : DIGITS.length\n\tif (digitB - digitA > 1) {\n\t\tconst midDigit = Math.round(0.5 * (digitA + digitB))\n\t\treturn DIGITS[midDigit]\n\t}\n\t// First digits are consecutive.\n\tif (b && b.length > 1) {\n\t\treturn b.slice(0, 1)\n\t}\n\t// `b` is null or has length 1 (a single digit). The first digit of `a` is the\n\t// previous digit to `b`, or the largest digit if `b` is null.\n\treturn DIGITS[digitA] + midpoint(a.slice(1), null)\n}\n\n// May return null, as there is a largest integer.\nfunction incrementInteger(x: string): string | null {\n\tconst [head, ...digs] = x.split('')\n\tlet carry = true\n\tfor (let i = digs.length - 1; carry && i >= 0; i--) {\n\t\tconst d = digitIndex(digs[i]) + 1\n\t\tif (d === DIGITS.length) {\n\t\t\tdigs[i] = ZERO\n\t\t} else {\n\t\t\tdigs[i] = DIGITS[d]\n\t\t\tcarry = false\n\t\t}\n\t}\n\tif (carry) {\n\t\tif (head === 'Z') return 'a' + ZERO\n\t\tif (head === 'z') return null\n\t\tconst h = String.fromCharCode(head.charCodeAt(0) + 1)\n\t\tif (h > 'a') {\n\t\t\tdigs.push(ZERO)\n\t\t} else {\n\t\t\tdigs.pop()\n\t\t}\n\t\treturn h + digs.join('')\n\t}\n\treturn head + digs.join('')\n}\n\n// May return null, as there is a smallest integer.\nfunction decrementInteger(x: string): string | null {\n\tconst [head, ...digs] = x.split('')\n\tlet borrow = true\n\tfor (let i = digs.length - 1; borrow && i >= 0; i--) {\n\t\tconst d = digitIndex(digs[i]) - 1\n\t\tif (d === -1) {\n\t\t\tdigs[i] = LARGEST_DIGIT\n\t\t} else {\n\t\t\tdigs[i] = DIGITS[d]\n\t\t\tborrow = false\n\t\t}\n\t}\n\tif (borrow) {\n\t\tif (head === 'a') return 'Z' + LARGEST_DIGIT\n\t\tif (head === 'A') return null\n\t\tconst h = String.fromCharCode(head.charCodeAt(0) - 1)\n\t\tif (h < 'Z') {\n\t\t\tdigs.push(LARGEST_DIGIT)\n\t\t} else {\n\t\t\tdigs.pop()\n\t\t}\n\t\treturn h + digs.join('')\n\t}\n\treturn head + digs.join('')\n}\n\n// Generate a key strictly between `a` and `b`, without validating the inputs.\n// `a`/`b` are order keys or null (START/END). `a < b` if both are non-null.\nfunction keyBetweenUnchecked(a: string | null, b: string | null): string {\n\tif (a != null && b != null && a >= b) {\n\t\tthrow new Error(a + ' >= ' + b)\n\t}\n\tif (a == null) {\n\t\tif (b == null) return 'a' + ZERO\n\t\tconst ib = getIntegerPart(b)\n\t\tconst fb = b.slice(ib.length)\n\t\tif (ib === SMALLEST_INTEGER) {\n\t\t\treturn ib + midpoint('', fb)\n\t\t}\n\t\tif (ib < b) return ib\n\t\tconst res = decrementInteger(ib)\n\t\tif (res == null) throw new Error('cannot decrement any more')\n\t\treturn res\n\t}\n\tif (b == null) {\n\t\tconst ia = getIntegerPart(a)\n\t\tconst fa = a.slice(ia.length)\n\t\tconst i = incrementInteger(ia)\n\t\treturn i == null ? ia + midpoint(fa, null) : i\n\t}\n\tconst ia = getIntegerPart(a)\n\tconst fa = a.slice(ia.length)\n\tconst ib = getIntegerPart(b)\n\tconst fb = b.slice(ib.length)\n\tif (ia === ib) {\n\t\treturn ia + midpoint(fa, fb)\n\t}\n\tconst i = incrementInteger(ia)\n\tif (i == null) throw new Error('cannot increment any more')\n\tif (i < b) return i\n\treturn ia + midpoint(fa, null)\n}\n\n// Generate `n` keys between `a` and `b`, without validating the inputs.\n// Intermediate keys are valid by construction, so they're never re-validated.\nfunction nKeysBetweenUnchecked(a: string | null, b: string | null, n: number): string[] {\n\tif (n === 0) return []\n\tif (n === 1) return [keyBetweenUnchecked(a, b)]\n\tif (b == null) {\n\t\tlet c = keyBetweenUnchecked(a, b)\n\t\tconst result = [c]\n\t\tfor (let i = 0; i < n - 1; i++) {\n\t\t\tc = keyBetweenUnchecked(c, b)\n\t\t\tresult.push(c)\n\t\t}\n\t\treturn result\n\t}\n\tif (a == null) {\n\t\tlet c = keyBetweenUnchecked(a, b)\n\t\tconst result = [c]\n\t\tfor (let i = 0; i < n - 1; i++) {\n\t\t\tc = keyBetweenUnchecked(a, c)\n\t\t\tresult.push(c)\n\t\t}\n\t\tresult.reverse()\n\t\treturn result\n\t}\n\tconst mid = Math.floor(n / 2)\n\tconst c = keyBetweenUnchecked(a, b)\n\treturn [...nKeysBetweenUnchecked(a, c, mid), c, ...nKeysBetweenUnchecked(c, b, n - mid - 1)]\n}\n\n// Bisect `[low, high]` JITTER_BITS times, following a random walk, so that keys\n// generated concurrently land in different sub-ranges. `low`/`high` must already\n// be valid (or null); the intermediate midpoints are valid by construction.\nfunction jitterBetween(low: string | null, high: string | null): string {\n\tlet mid = keyBetweenUnchecked(low, high)\n\tfor (let i = 0; i < JITTER_BITS; i++) {\n\t\tif (Math.random() < 0.5) {\n\t\t\tlow = mid\n\t\t} else {\n\t\t\thigh = mid\n\t\t}\n\t\tmid = keyBetweenUnchecked(low, high)\n\t}\n\treturn mid\n}\n\n/**\n * Generate `n` jittered keys evenly spaced between `a` and `b`. Inputs are\n * validated once; everything downstream is generated, hence trusted.\n */\nexport function generateNJitteredKeysBetween(\n\ta: string | null,\n\tb: string | null,\n\tn: number\n): string[] {\n\tif (n === 0) return []\n\tif (a != null) validateOrderKey(a)\n\tif (b != null) validateOrderKey(b)\n\tconst keys = nKeysBetweenUnchecked(a, b, n + 1)\n\tconst result = new Array<string>(n)\n\tfor (let i = 0; i < n; i++) {\n\t\tresult[i] = jitterBetween(keys[i], keys[i + 1])\n\t}\n\treturn result\n}\n\n/**\n * Generate `n` keys evenly spaced between `a` and `b`, without jitter. Used in\n * tests for deterministic output.\n */\nexport function generateNKeysBetween(a: string | null, b: string | null, n: number): string[] {\n\tif (n === 0) return []\n\tif (a != null) validateOrderKey(a)\n\tif (b != null) validateOrderKey(b)\n\treturn nKeysBetweenUnchecked(a, b, n)\n}\n"],
+  "mappings": "AAeA,MAAM,SAAS;AACf,MAAM,OAAO,OAAO,CAAC;AACrB,MAAM,gBAAgB,OAAO,OAAO,SAAS,CAAC;AAE9C,MAAM,mBAAmB,MAAM,KAAK,OAAO,EAAE;AAO7C,MAAM,cAAc;AAEpB,SAAS,iBAAiB,MAAsB;AAC/C,MAAI,QAAQ,OAAO,QAAQ,KAAK;AAC/B,WAAO,KAAK,WAAW,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI;AAAA,EACjD,WAAW,QAAQ,OAAO,QAAQ,KAAK;AACtC,WAAO,IAAI,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI;AAAA,EACjD;AACA,QAAM,IAAI,MAAM,6BAA6B,IAAI;AAClD;AAEA,SAAS,eAAe,KAAqB;AAC5C,QAAM,oBAAoB,iBAAiB,IAAI,CAAC,CAAC;AACjD,MAAI,oBAAoB,IAAI,QAAQ;AACnC,UAAM,IAAI,MAAM,wBAAwB,GAAG;AAAA,EAC5C;AACA,SAAO,IAAI,MAAM,GAAG,iBAAiB;AACtC;AAKA,SAAS,WAAW,MAAsB;AACzC,QAAM,OAAO,KAAK,WAAW,CAAC;AAC9B,MAAI,QAAQ,GAAI,QAAO,OAAO;AAC9B,MAAI,QAAQ,GAAI,QAAO,OAAO;AAC9B,SAAO,OAAO;AACf;AAMO,SAAS,iBAAiB,KAAmB;AACnD,MAAI,QAAQ,kBAAkB;AAC7B,UAAM,IAAI,MAAM,wBAAwB,GAAG;AAAA,EAC5C;AAEA,QAAM,IAAI,eAAe,GAAG;AAG5B,MAAI,IAAI,SAAS,EAAE,UAAU,IAAI,IAAI,SAAS,CAAC,MAAM,MAAM;AAC1D,UAAM,IAAI,MAAM,wBAAwB,GAAG;AAAA,EAC5C;AACD;AAIA,SAAS,SAAS,GAAW,GAA0B;AACtD,MAAI,KAAK,QAAQ,KAAK,GAAG;AACxB,UAAM,IAAI,MAAM,IAAI,SAAS,CAAC;AAAA,EAC/B;AACA,MAAI,EAAE,MAAM,EAAE,MAAM,QAAS,KAAK,EAAE,MAAM,EAAE,MAAM,MAAO;AACxD,UAAM,IAAI,MAAM,eAAe;AAAA,EAChC;AACA,MAAI,GAAG;AAIN,QAAI,IAAI;AACR,YAAQ,EAAE,CAAC,KAAK,UAAU,EAAE,CAAC,GAAG;AAC/B;AAAA,IACD;AACA,QAAI,IAAI,GAAG;AACV,aAAO,EAAE,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;AAAA,IACvD;AAAA,EACD;AAEA,QAAM,SAAS,IAAI,WAAW,EAAE,CAAC,CAAC,IAAI;AACtC,QAAM,SAAS,KAAK,OAAO,WAAW,EAAE,CAAC,CAAC,IAAI,OAAO;AACrD,MAAI,SAAS,SAAS,GAAG;AACxB,UAAM,WAAW,KAAK,MAAM,OAAO,SAAS,OAAO;AACnD,WAAO,OAAO,QAAQ;AAAA,EACvB;AAEA,MAAI,KAAK,EAAE,SAAS,GAAG;AACtB,WAAO,EAAE,MAAM,GAAG,CAAC;AAAA,EACpB;AAGA,SAAO,OAAO,MAAM,IAAI,SAAS,EAAE,MAAM,CAAC,GAAG,IAAI;AAClD;AAGA,SAAS,iBAAiB,GAA0B;AACnD,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI,EAAE,MAAM,EAAE;AAClC,MAAI,QAAQ;AACZ,WAAS,IAAI,KAAK,SAAS,GAAG,SAAS,KAAK,GAAG,KAAK;AACnD,UAAM,IAAI,WAAW,KAAK,CAAC,CAAC,IAAI;AAChC,QAAI,MAAM,OAAO,QAAQ;AACxB,WAAK,CAAC,IAAI;AAAA,IACX,OAAO;AACN,WAAK,CAAC,IAAI,OAAO,CAAC;AAClB,cAAQ;AAAA,IACT;AAAA,EACD;AACA,MAAI,OAAO;AACV,QAAI,SAAS,IAAK,QAAO,MAAM;AAC/B,QAAI,SAAS,IAAK,QAAO;AACzB,UAAM,IAAI,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;AACpD,QAAI,IAAI,KAAK;AACZ,WAAK,KAAK,IAAI;AAAA,IACf,OAAO;AACN,WAAK,IAAI;AAAA,IACV;AACA,WAAO,IAAI,KAAK,KAAK,EAAE;AAAA,EACxB;AACA,SAAO,OAAO,KAAK,KAAK,EAAE;AAC3B;AAGA,SAAS,iBAAiB,GAA0B;AACnD,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI,EAAE,MAAM,EAAE;AAClC,MAAI,SAAS;AACb,WAAS,IAAI,KAAK,SAAS,GAAG,UAAU,KAAK,GAAG,KAAK;AACpD,UAAM,IAAI,WAAW,KAAK,CAAC,CAAC,IAAI;AAChC,QAAI,MAAM,IAAI;AACb,WAAK,CAAC,IAAI;AAAA,IACX,OAAO;AACN,WAAK,CAAC,IAAI,OAAO,CAAC;AAClB,eAAS;AAAA,IACV;AAAA,EACD;AACA,MAAI,QAAQ;AACX,QAAI,SAAS,IAAK,QAAO,MAAM;AAC/B,QAAI,SAAS,IAAK,QAAO;AACzB,UAAM,IAAI,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;AACpD,QAAI,IAAI,KAAK;AACZ,WAAK,KAAK,aAAa;AAAA,IACxB,OAAO;AACN,WAAK,IAAI;AAAA,IACV;AACA,WAAO,IAAI,KAAK,KAAK,EAAE;AAAA,EACxB;AACA,SAAO,OAAO,KAAK,KAAK,EAAE;AAC3B;AAIA,SAAS,oBAAoB,GAAkB,GAA0B;AACxE,MAAI,KAAK,QAAQ,KAAK,QAAQ,KAAK,GAAG;AACrC,UAAM,IAAI,MAAM,IAAI,SAAS,CAAC;AAAA,EAC/B;AACA,MAAI,KAAK,MAAM;AACd,QAAI,KAAK,KAAM,QAAO,MAAM;AAC5B,UAAMA,MAAK,eAAe,CAAC;AAC3B,UAAMC,MAAK,EAAE,MAAMD,IAAG,MAAM;AAC5B,QAAIA,QAAO,kBAAkB;AAC5B,aAAOA,MAAK,SAAS,IAAIC,GAAE;AAAA,IAC5B;AACA,QAAID,MAAK,EAAG,QAAOA;AACnB,UAAM,MAAM,iBAAiBA,GAAE;AAC/B,QAAI,OAAO,KAAM,OAAM,IAAI,MAAM,2BAA2B;AAC5D,WAAO;AAAA,EACR;AACA,MAAI,KAAK,MAAM;AACd,UAAME,MAAK,eAAe,CAAC;AAC3B,UAAMC,MAAK,EAAE,MAAMD,IAAG,MAAM;AAC5B,UAAME,KAAI,iBAAiBF,GAAE;AAC7B,WAAOE,MAAK,OAAOF,MAAK,SAASC,KAAI,IAAI,IAAIC;AAAA,EAC9C;AACA,QAAM,KAAK,eAAe,CAAC;AAC3B,QAAM,KAAK,EAAE,MAAM,GAAG,MAAM;AAC5B,QAAM,KAAK,eAAe,CAAC;AAC3B,QAAM,KAAK,EAAE,MAAM,GAAG,MAAM;AAC5B,MAAI,OAAO,IAAI;AACd,WAAO,KAAK,SAAS,IAAI,EAAE;AAAA,EAC5B;AACA,QAAM,IAAI,iBAAiB,EAAE;AAC7B,MAAI,KAAK,KAAM,OAAM,IAAI,MAAM,2BAA2B;AAC1D,MAAI,IAAI,EAAG,QAAO;AAClB,SAAO,KAAK,SAAS,IAAI,IAAI;AAC9B;AAIA,SAAS,sBAAsB,GAAkB,GAAkB,GAAqB;AACvF,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,MAAM,EAAG,QAAO,CAAC,oBAAoB,GAAG,CAAC,CAAC;AAC9C,MAAI,KAAK,MAAM;AACd,QAAIC,KAAI,oBAAoB,GAAG,CAAC;AAChC,UAAM,SAAS,CAACA,EAAC;AACjB,aAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC/B,MAAAA,KAAI,oBAAoBA,IAAG,CAAC;AAC5B,aAAO,KAAKA,EAAC;AAAA,IACd;AACA,WAAO;AAAA,EACR;AACA,MAAI,KAAK,MAAM;AACd,QAAIA,KAAI,oBAAoB,GAAG,CAAC;AAChC,UAAM,SAAS,CAACA,EAAC;AACjB,aAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC/B,MAAAA,KAAI,oBAAoB,GAAGA,EAAC;AAC5B,aAAO,KAAKA,EAAC;AAAA,IACd;AACA,WAAO,QAAQ;AACf,WAAO;AAAA,EACR;AACA,QAAM,MAAM,KAAK,MAAM,IAAI,CAAC;AAC5B,QAAM,IAAI,oBAAoB,GAAG,CAAC;AAClC,SAAO,CAAC,GAAG,sBAAsB,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,sBAAsB,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AAC5F;AAKA,SAAS,cAAc,KAAoB,MAA6B;AACvE,MAAI,MAAM,oBAAoB,KAAK,IAAI;AACvC,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACrC,QAAI,KAAK,OAAO,IAAI,KAAK;AACxB,YAAM;AAAA,IACP,OAAO;AACN,aAAO;AAAA,IACR;AACA,UAAM,oBAAoB,KAAK,IAAI;AAAA,EACpC;AACA,SAAO;AACR;AAMO,SAAS,6BACf,GACA,GACA,GACW;AACX,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,QAAM,OAAO,sBAAsB,GAAG,GAAG,IAAI,CAAC;AAC9C,QAAM,SAAS,IAAI,MAAc,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,WAAO,CAAC,IAAI,cAAc,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AAAA,EAC/C;AACA,SAAO;AACR;AAMO,SAAS,qBAAqB,GAAkB,GAAkB,GAAqB;AAC7F,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,MAAI,KAAK,KAAM,kBAAiB,CAAC;AACjC,SAAO,sBAAsB,GAAG,GAAG,CAAC;AACrC;",
+  "names": ["ib", "fb", "ia", "fa", "i", "c"]
+}

package/dist-esm/lib/reordering.mjs

@@ -1,12 +1,13 @@
-import { generateKeyBetween, generateNKeysBetween } from "jittered-fractional-indexing";
-const generateNKeysBetweenWithNoJitter = (a, b, n) => {
-  return generateNKeysBetween(a, b, n, { jitterBits: 0 });
-};
-const generateKeysFn = process.env.NODE_ENV === "test" ? generateNKeysBetweenWithNoJitter : generateNKeysBetween;
+import {
+  generateNJitteredKeysBetween,
+  generateNKeysBetween,
+  validateOrderKey
+} from "./fractionalIndexing.mjs";
+const generateKeysFn = process.env.NODE_ENV === "test" ? generateNKeysBetween : generateNJitteredKeysBetween;
 const ZERO_INDEX_KEY = "a0";
 function validateIndexKey(index) {
   try {
-    generateKeyBetween(index, null);
+    validateOrderKey(index);
   } catch {
     throw new Error("invalid index: " + index);
   }

package/dist-esm/lib/reordering.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/lib/reordering.ts"],
-  "sourcesContent": ["import { generateKeyBetween, generateNKeysBetween } from 'jittered-fractional-indexing'\n\nconst generateNKeysBetweenWithNoJitter = (a: string | null, b: string | null, n: number) => {\n\treturn generateNKeysBetween(a, b, n, { jitterBits: 0 })\n}\n\nconst generateKeysFn =\n\tprocess.env.NODE_ENV === 'test' ? generateNKeysBetweenWithNoJitter : generateNKeysBetween\n\n/**\n * A string made up of an integer part followed by a fraction part. The fraction point consists of\n * zero or more digits with no trailing zeros. Based on\n * {@link https://observablehq.com/@dgreensp/implementing-fractional-indexing}.\n *\n * @public\n */\nexport type IndexKey = string & { __brand: 'indexKey' }\n\n/**\n * The index key for the first index - 'a0'.\n * @public\n */\nexport const ZERO_INDEX_KEY = 'a0' as IndexKey\n\n/**\n * Validates that a string is a valid IndexKey.\n * @param index - The string to validate.\n * @throws Error if the index is invalid.\n * @internal\n */\nexport function validateIndexKey(index: string): asserts index is IndexKey {\n\ttry {\n\t\tgenerateKeyBetween(index, null)\n\t} catch {\n\t\tthrow new Error('invalid index: ' + index)\n\t}\n}\n\n/**\n * Get a number of indices between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values between below and above.\n * @example\n * ```ts\n * const indices = getIndicesBetween('a0' as IndexKey, 'a2' as IndexKey, 2)\n * console.log(indices) // ['a0V', 'a1']\n * ```\n * @public\n */\nexport function getIndicesBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined,\n\tn: number\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices above an index.\n * @param below - The index below.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values above the given index.\n * @example\n * ```ts\n * const indices = getIndicesAbove('a0' as IndexKey, 3)\n * console.log(indices) // ['a1', 'a2', 'a3']\n * ```\n * @public\n */\nexport function getIndicesAbove(below: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(below ?? null, null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices below an index.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values below the given index.\n * @example\n * ```ts\n * const indices = getIndicesBelow('a2' as IndexKey, 2)\n * console.log(indices) // ['a1', 'a0V']\n * ```\n * @public\n */\nexport function getIndicesBelow(above: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get the index between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @returns A single IndexKey value between below and above.\n * @example\n * ```ts\n * const index = getIndexBetween('a0' as IndexKey, 'a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index above a given index.\n * @param below - The index below.\n * @returns An IndexKey value above the given index.\n * @example\n * ```ts\n * const index = getIndexAbove('a0' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexAbove(below: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(below, null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index below a given index.\n * @param above - The index above.\n * @returns An IndexKey value below the given index.\n * @example\n * ```ts\n * const index = getIndexBelow('a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBelow(above: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(null, above, 1)[0] as IndexKey\n}\n\n/**\n * Get n number of indices, starting at an index.\n * @param n - The number of indices to get.\n * @param start - The index to start at.\n * @returns An array containing the start index plus n additional IndexKey values.\n * @example\n * ```ts\n * const indices = getIndices(3, 'a1' as IndexKey)\n * console.log(indices) // ['a1', 'a2', 'a3', 'a4']\n * ```\n * @public\n */\nexport function getIndices(n: number, start = 'a1' as IndexKey) {\n\treturn [start, ...generateKeysFn(start, null, n)] as IndexKey[]\n}\n\n/**\n * Sort by index.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @returns A number indicating sort order (-1, 0, or 1).\n * @example\n * ```ts\n * const shapes = [\n *   { id: 'b', index: 'a2' as IndexKey },\n *   { id: 'a', index: 'a1' as IndexKey }\n * ]\n * const sorted = shapes.sort(sortByIndex)\n * console.log(sorted) // [{ id: 'a', index: 'a1' }, { id: 'b', index: 'a2' }]\n * ```\n * @public\n */\nexport function sortByIndex<T extends { index: IndexKey }>(a: T, b: T) {\n\tif (a.index < b.index) {\n\t\treturn -1\n\t} else if (a.index > b.index) {\n\t\treturn 1\n\t}\n\treturn 0\n}\n\n/**\n * Sort by index, or null.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @public\n */\nexport function sortByMaybeIndex<T extends { index?: IndexKey | null }>(a: T, b: T) {\n\tif (a.index && b.index) {\n\t\treturn a.index < b.index ? -1 : 1\n\t}\n\tif (a.index && b.index == null) {\n\t\treturn -1\n\t}\n\tif (a.index == null && b.index == null) {\n\t\treturn 0\n\t}\n\treturn 1\n}\n"],
-  "mappings": "AAAA,SAAS,oBAAoB,4BAA4B;AAEzD,MAAM,mCAAmC,CAAC,GAAkB,GAAkB,MAAc;AAC3F,SAAO,qBAAqB,GAAG,GAAG,GAAG,EAAE,YAAY,EAAE,CAAC;AACvD;AAEA,MAAM,iBACL,QAAQ,IAAI,aAAa,SAAS,mCAAmC;AAe/D,MAAM,iBAAiB;AAQvB,SAAS,iBAAiB,OAA0C;AAC1E,MAAI;AACH,uBAAmB,OAAO,IAAI;AAAA,EAC/B,QAAQ;AACP,UAAM,IAAI,MAAM,oBAAoB,KAAK;AAAA,EAC1C;AACD;AAeO,SAAS,kBACf,OACA,OACA,GACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC;AACtD;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,SAAS,MAAM,MAAM,CAAC;AAC7C;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,MAAM,SAAS,MAAM,CAAC;AAC7C;AAcO,SAAS,gBACf,OACA,OACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC,EAAE,CAAC;AACzD;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,OAAO,MAAM,CAAC,EAAE,CAAC;AACxC;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,MAAM,OAAO,CAAC,EAAE,CAAC;AACxC;AAcO,SAAS,WAAW,GAAW,QAAQ,MAAkB;AAC/D,SAAO,CAAC,OAAO,GAAG,eAAe,OAAO,MAAM,CAAC,CAAC;AACjD;AAkBO,SAAS,YAA2C,GAAM,GAAM;AACtE,MAAI,EAAE,QAAQ,EAAE,OAAO;AACtB,WAAO;AAAA,EACR,WAAW,EAAE,QAAQ,EAAE,OAAO;AAC7B,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAQO,SAAS,iBAAwD,GAAM,GAAM;AACnF,MAAI,EAAE,SAAS,EAAE,OAAO;AACvB,WAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAAA,EACjC;AACA,MAAI,EAAE,SAAS,EAAE,SAAS,MAAM;AAC/B,WAAO;AAAA,EACR;AACA,MAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;AACvC,WAAO;AAAA,EACR;AACA,SAAO;AACR;",
+  "sourcesContent": ["import {\n\tgenerateNJitteredKeysBetween,\n\tgenerateNKeysBetween,\n\tvalidateOrderKey,\n} from './fractionalIndexing'\n\nconst generateKeysFn =\n\tprocess.env.NODE_ENV === 'test' ? generateNKeysBetween : generateNJitteredKeysBetween\n\n/**\n * A string made up of an integer part followed by a fraction part. The fraction point consists of\n * zero or more digits with no trailing zeros. Based on\n * {@link https://observablehq.com/@dgreensp/implementing-fractional-indexing}.\n *\n * @public\n */\nexport type IndexKey = string & { __brand: 'indexKey' }\n\n/**\n * The index key for the first index - 'a0'.\n * @public\n */\nexport const ZERO_INDEX_KEY = 'a0' as IndexKey\n\n/**\n * Validates that a string is a valid IndexKey.\n * @param index - The string to validate.\n * @throws Error if the index is invalid.\n * @internal\n */\nexport function validateIndexKey(index: string): asserts index is IndexKey {\n\ttry {\n\t\tvalidateOrderKey(index)\n\t} catch {\n\t\tthrow new Error('invalid index: ' + index)\n\t}\n}\n\n/**\n * Get a number of indices between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values between below and above.\n * @example\n * ```ts\n * const indices = getIndicesBetween('a0' as IndexKey, 'a2' as IndexKey, 2)\n * console.log(indices) // ['a0V', 'a1']\n * ```\n * @public\n */\nexport function getIndicesBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined,\n\tn: number\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices above an index.\n * @param below - The index below.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values above the given index.\n * @example\n * ```ts\n * const indices = getIndicesAbove('a0' as IndexKey, 3)\n * console.log(indices) // ['a1', 'a2', 'a3']\n * ```\n * @public\n */\nexport function getIndicesAbove(below: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(below ?? null, null, n) as IndexKey[]\n}\n\n/**\n * Get a number of indices below an index.\n * @param above - The index above.\n * @param n - The number of indices to get.\n * @returns An array of n IndexKey values below the given index.\n * @example\n * ```ts\n * const indices = getIndicesBelow('a2' as IndexKey, 2)\n * console.log(indices) // ['a1', 'a0V']\n * ```\n * @public\n */\nexport function getIndicesBelow(above: IndexKey | null | undefined, n: number) {\n\treturn generateKeysFn(null, above ?? null, n) as IndexKey[]\n}\n\n/**\n * Get the index between two indices.\n * @param below - The index below.\n * @param above - The index above.\n * @returns A single IndexKey value between below and above.\n * @example\n * ```ts\n * const index = getIndexBetween('a0' as IndexKey, 'a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBetween(\n\tbelow: IndexKey | null | undefined,\n\tabove: IndexKey | null | undefined\n) {\n\treturn generateKeysFn(below ?? null, above ?? null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index above a given index.\n * @param below - The index below.\n * @returns An IndexKey value above the given index.\n * @example\n * ```ts\n * const index = getIndexAbove('a0' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexAbove(below: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(below, null, 1)[0] as IndexKey\n}\n\n/**\n * Get the index below a given index.\n * @param above - The index above.\n * @returns An IndexKey value below the given index.\n * @example\n * ```ts\n * const index = getIndexBelow('a2' as IndexKey)\n * console.log(index) // 'a1'\n * ```\n * @public\n */\nexport function getIndexBelow(above: IndexKey | null | undefined = null) {\n\treturn generateKeysFn(null, above, 1)[0] as IndexKey\n}\n\n/**\n * Get n number of indices, starting at an index.\n * @param n - The number of indices to get.\n * @param start - The index to start at.\n * @returns An array containing the start index plus n additional IndexKey values.\n * @example\n * ```ts\n * const indices = getIndices(3, 'a1' as IndexKey)\n * console.log(indices) // ['a1', 'a2', 'a3', 'a4']\n * ```\n * @public\n */\nexport function getIndices(n: number, start = 'a1' as IndexKey) {\n\treturn [start, ...generateKeysFn(start, null, n)] as IndexKey[]\n}\n\n/**\n * Sort by index.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @returns A number indicating sort order (-1, 0, or 1).\n * @example\n * ```ts\n * const shapes = [\n *   { id: 'b', index: 'a2' as IndexKey },\n *   { id: 'a', index: 'a1' as IndexKey }\n * ]\n * const sorted = shapes.sort(sortByIndex)\n * console.log(sorted) // [{ id: 'a', index: 'a1' }, { id: 'b', index: 'a2' }]\n * ```\n * @public\n */\nexport function sortByIndex<T extends { index: IndexKey }>(a: T, b: T) {\n\tif (a.index < b.index) {\n\t\treturn -1\n\t} else if (a.index > b.index) {\n\t\treturn 1\n\t}\n\treturn 0\n}\n\n/**\n * Sort by index, or null.\n * @param a - An object with an index property.\n * @param b - An object with an index property.\n * @public\n */\nexport function sortByMaybeIndex<T extends { index?: IndexKey | null }>(a: T, b: T) {\n\tif (a.index && b.index) {\n\t\treturn a.index < b.index ? -1 : 1\n\t}\n\tif (a.index && b.index == null) {\n\t\treturn -1\n\t}\n\tif (a.index == null && b.index == null) {\n\t\treturn 0\n\t}\n\treturn 1\n}\n"],
+  "mappings": "AAAA;AAAA,EACC;AAAA,EACA;AAAA,EACA;AAAA,OACM;AAEP,MAAM,iBACL,QAAQ,IAAI,aAAa,SAAS,uBAAuB;AAenD,MAAM,iBAAiB;AAQvB,SAAS,iBAAiB,OAA0C;AAC1E,MAAI;AACH,qBAAiB,KAAK;AAAA,EACvB,QAAQ;AACP,UAAM,IAAI,MAAM,oBAAoB,KAAK;AAAA,EAC1C;AACD;AAeO,SAAS,kBACf,OACA,OACA,GACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC;AACtD;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,SAAS,MAAM,MAAM,CAAC;AAC7C;AAcO,SAAS,gBAAgB,OAAoC,GAAW;AAC9E,SAAO,eAAe,MAAM,SAAS,MAAM,CAAC;AAC7C;AAcO,SAAS,gBACf,OACA,OACC;AACD,SAAO,eAAe,SAAS,MAAM,SAAS,MAAM,CAAC,EAAE,CAAC;AACzD;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,OAAO,MAAM,CAAC,EAAE,CAAC;AACxC;AAaO,SAAS,cAAc,QAAqC,MAAM;AACxE,SAAO,eAAe,MAAM,OAAO,CAAC,EAAE,CAAC;AACxC;AAcO,SAAS,WAAW,GAAW,QAAQ,MAAkB;AAC/D,SAAO,CAAC,OAAO,GAAG,eAAe,OAAO,MAAM,CAAC,CAAC;AACjD;AAkBO,SAAS,YAA2C,GAAM,GAAM;AACtE,MAAI,EAAE,QAAQ,EAAE,OAAO;AACtB,WAAO;AAAA,EACR,WAAW,EAAE,QAAQ,EAAE,OAAO;AAC7B,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAQO,SAAS,iBAAwD,GAAM,GAAM;AACnF,MAAI,EAAE,SAAS,EAAE,OAAO;AACvB,WAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAAA,EACjC;AACA,MAAI,EAAE,SAAS,EAAE,SAAS,MAAM;AAC/B,WAAO;AAAA,EACR;AACA,MAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;AACvC,WAAO;AAAA,EACR;AACA,SAAO;AACR;",
   "names": []
 }

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tldraw/utils",
   "description": "tldraw infinite canvas SDK (private utilities).",
-  "version": "5.2.0-next.79b13319d317",
+  "version": "5.2.0-next.7b677d60c152",
   "author": {
     "name": "tldraw Inc.",
     "email": "hello@tldraw.com"
@@ -44,7 +44,6 @@
     "lint": "yarn run -T tsx ../../internal/scripts/lint.ts"
   },
   "dependencies": {
-    "jittered-fractional-indexing": "^1.0.0",
     "lodash.isequal": "^4.5.0",
     "lodash.isequalwith": "^4.4.0",
     "lodash.throttle": "^4.1.1",
@@ -58,6 +57,9 @@
     "lazyrepo": "0.0.0-alpha.27",
     "vitest": "^4.1.7"
   },
+  "engines": {
+    "node": ">=22.12.0"
+  },
   "module": "dist-esm/index.mjs",
   "source": "src/index.ts",
   "exports": {

package/src/lib/fractionalIndexing.test.ts

@@ -0,0 +1,138 @@
+import { describe, expect, it } from 'vitest'
+import {
+	generateNJitteredKeysBetween,
+	generateNKeysBetween,
+	validateOrderKey,
+} from './fractionalIndexing'
+
+// Single-key helper: the non-jittered generator with n=1.
+const keyBetween = (a: string | null, b: string | null) => generateNKeysBetween(a, b, 1)[0]
+
+describe('fractionalIndexing', () => {
+	// Golden vectors from the upstream `fractional-indexing` README. These pin the
+	// exact base-62 output, proving the vendored/specialized core stays
+	// byte-for-byte compatible with the original library.
+	describe('generateKeyBetween (golden vectors)', () => {
+		it.each([
+			[null, null, 'a0'],
+			['a0', null, 'a1'],
+			['a1', null, 'a2'],
+			[null, 'a0', 'Zz'],
+			['a0', 'a1', 'a0V'],
+			['a1', 'a2', 'a1V'],
+		])('between %o and %o is %o', (a, b, expected) => {
+			expect(keyBetween(a, b)).toBe(expected)
+		})
+	})
+
+	describe('generateNKeysBetween (golden vectors)', () => {
+		it.each<[string | null, string | null, number, string[]]>([
+			[null, null, 2, ['a0', 'a1']],
+			['a1', null, 2, ['a2', 'a3']],
+			[null, 'a0', 2, ['Zy', 'Zz']],
+			['a0', 'a1', 2, ['a0G', 'a0V']],
+			[null, null, 5, ['a0', 'a1', 'a2', 'a3', 'a4']],
+		])('%o keys between %o and %o', (a, b, n, expected) => {
+			expect(generateNKeysBetween(a, b, n)).toEqual(expected)
+		})
+
+		it('returns an empty array for n = 0', () => {
+			expect(generateNKeysBetween(null, null, 0)).toEqual([])
+		})
+	})
+
+	describe('errors', () => {
+		it('throws when a >= b', () => {
+			expect(() => keyBetween('a1', 'a0')).toThrow()
+			expect(() => keyBetween('a0', 'a0')).toThrow()
+		})
+
+		it('throws on invalid input keys', () => {
+			expect(() => keyBetween('a00', null)).toThrow() // trailing zero
+			expect(() => keyBetween('', null)).toThrow()
+			expect(() => keyBetween('foo', null)).toThrow()
+		})
+	})
+
+	describe('validateOrderKey', () => {
+		it.each(['a0', 'a1', 'a0V', 'Zz', 'a0G', 'b127'])('accepts %s', (key) => {
+			expect(() => validateOrderKey(key)).not.toThrow()
+		})
+
+		it.each([
+			'', // empty
+			'a', // integer part too short
+			'1', // invalid head
+			'a00', // trailing zero in fraction
+			'foo', // invalid head
+			'A' + '0'.repeat(26), // the reserved smallest-integer key
+		])('rejects %o', (key) => {
+			expect(() => validateOrderKey(key)).toThrow()
+		})
+	})
+
+	// Invariant tests: independent of exact output, these catch ordering or
+	// digit-mapping regressions across the whole alphabet (e.g. a bad charCode
+	// offset in digitIndex, or carry/borrow bugs when integers roll over).
+	describe('invariants', () => {
+		it('generateNKeysBetween yields strictly increasing, valid, in-bounds keys', () => {
+			const keys = generateNKeysBetween('a0', 'a1', 200)
+			expect(keys).toHaveLength(200)
+			let prev = 'a0'
+			for (const key of keys) {
+				expect(() => validateOrderKey(key)).not.toThrow()
+				expect(key > prev).toBe(true)
+				expect(key < 'a1').toBe(true)
+				prev = key
+			}
+		})
+
+		it('stays ordered while repeatedly inserting after the last key (integer carries)', () => {
+			// 200 sequential keys force the integer part to roll over many digits,
+			// exercising incrementInteger across the full base-62 alphabet.
+			let key = keyBetween(null, null)
+			let prev = ''
+			for (let i = 0; i < 200; i++) {
+				expect(() => validateOrderKey(key)).not.toThrow()
+				expect(key > prev).toBe(true)
+				prev = key
+				key = keyBetween(key, null)
+			}
+		})
+
+		it('stays ordered while repeatedly inserting before the first key (integer borrows)', () => {
+			let key = keyBetween(null, null)
+			let next = 'zzzzz'
+			for (let i = 0; i < 200; i++) {
+				expect(() => validateOrderKey(key)).not.toThrow()
+				expect(key < next).toBe(true)
+				next = key
+				key = keyBetween(null, key)
+			}
+		})
+
+		it('generateNJitteredKeysBetween yields ordered, valid, in-bounds, distinct keys', () => {
+			const keys = generateNJitteredKeysBetween('a0', 'a5', 100)
+			expect(keys).toHaveLength(100)
+			expect(new Set(keys).size).toBe(100)
+			let prev = 'a0'
+			for (const key of keys) {
+				expect(() => validateOrderKey(key)).not.toThrow()
+				expect(key > prev).toBe(true)
+				expect(key < 'a5').toBe(true)
+				prev = key
+			}
+		})
+
+		it('jittered keys land strictly between their neighbours', () => {
+			const a = keyBetween(null, null)
+			const b = keyBetween(a, null)
+			for (let i = 0; i < 50; i++) {
+				const mid = generateNJitteredKeysBetween(a, b, 1)[0]
+				expect(mid > a).toBe(true)
+				expect(mid < b).toBe(true)
+				expect(() => validateOrderKey(mid)).not.toThrow()
+			}
+		})
+	})
+})

package/src/lib/fractionalIndexing.ts

@@ -0,0 +1,275 @@
+// Fractional indexing, specialized to tldraw's needs.
+//
+// This is a vendored and trimmed version of the `fractional-indexing` (by
+// arv@rocicorp.dev) and `jittered-fractional-indexing` (by
+// github@nathanhleung.com) packages, both released under CC0-1.0 (public
+// domain). See https://observablehq.com/@dgreensp/implementing-fractional-indexing
+// for the original algorithm.
+//
+// We only ever use the default base-62 alphabet, so the `digits` parameter has
+// been specialized away. This lets us hoist the per-call allocations that the
+// upstream `validateOrderKey` made (notably `digits[0].repeat(26)`) into module
+// constants, and skip redundant re-validation inside the jitter loop, which are
+// both on hot paths (every index generation and every IndexKey validation).
+
+// Digits must be in ascending character-code order.
+const DIGITS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'
+const ZERO = DIGITS[0] // '0'
+const LARGEST_DIGIT = DIGITS[DIGITS.length - 1] // 'z'
+// The reserved "smallest integer" key, which has no valid predecessor.
+const SMALLEST_INTEGER = 'A' + ZERO.repeat(26)
+// Number of random bisections used to spread concurrently-generated keys apart,
+// reducing the chance of collisions when multiple clients insert into the same
+// gap at once. Each bit costs one extra key generation and ~0.17 characters of
+// key length, so this trades collision resistance against compute and key size.
+// 16 keeps collisions below ~0.1% even for ~10 simultaneous same-position
+// inserts, which is ample headroom for real multiplayer use.
+const JITTER_BITS = 16
+
+function getIntegerLength(head: string): number {
+	if (head >= 'a' && head <= 'z') {
+		return head.charCodeAt(0) - 'a'.charCodeAt(0) + 2
+	} else if (head >= 'A' && head <= 'Z') {
+		return 'Z'.charCodeAt(0) - head.charCodeAt(0) + 2
+	}
+	throw new Error('invalid order key head: ' + head)
+}
+
+function getIntegerPart(key: string): string {
+	const integerPartLength = getIntegerLength(key[0])
+	if (integerPartLength > key.length) {
+		throw new Error('invalid order key: ' + key)
+	}
+	return key.slice(0, integerPartLength)
+}
+
+// Map a base-62 digit to its value. Faster than DIGITS.indexOf() (which scans
+// the alphabet) on the hot key-generation path. DIGITS is in char-code order:
+// '0'-'9' -> 0-9, 'A'-'Z' -> 10-35, 'a'-'z' -> 36-61.
+function digitIndex(char: string): number {
+	const code = char.charCodeAt(0)
+	if (code <= 57) return code - 48
+	if (code <= 90) return code - 55
+	return code - 61
+}
+
+/**
+ * Throws if `key` is not a canonical order key. Allocation-free in the common
+ * case: no `repeat`/`slice` per call.
+ */
+export function validateOrderKey(key: string): void {
+	if (key === SMALLEST_INTEGER) {
+		throw new Error('invalid order key: ' + key)
+	}
+	// getIntegerPart throws if the first character is bad or the key is too short.
+	const i = getIntegerPart(key)
+	// The fractional part (everything after the integer part) must not end in the
+	// smallest digit, as a trailing zero is a non-canonical representation.
+	if (key.length > i.length && key[key.length - 1] === ZERO) {
+		throw new Error('invalid order key: ' + key)
+	}
+}
+
+// `a` may be empty string, `b` is null or non-empty string.
+// `a < b` lexicographically if `b` is non-null. No trailing zeros allowed.
+function midpoint(a: string, b: string | null): string {
+	if (b != null && a >= b) {
+		throw new Error(a + ' >= ' + b)
+	}
+	if (a.slice(-1) === ZERO || (b && b.slice(-1) === ZERO)) {
+		throw new Error('trailing zero')
+	}
+	if (b) {
+		// Remove the longest common prefix, padding `a` with zeros as we go. We
+		// don't need to pad `b`, because it can't end before `a` while traversing
+		// the common prefix.
+		let n = 0
+		while ((a[n] || ZERO) === b[n]) {
+			n++
+		}
+		if (n > 0) {
+			return b.slice(0, n) + midpoint(a.slice(n), b.slice(n))
+		}
+	}
+	// First digits (or lack of digit) are different.
+	const digitA = a ? digitIndex(a[0]) : 0
+	const digitB = b != null ? digitIndex(b[0]) : DIGITS.length
+	if (digitB - digitA > 1) {
+		const midDigit = Math.round(0.5 * (digitA + digitB))
+		return DIGITS[midDigit]
+	}
+	// First digits are consecutive.
+	if (b && b.length > 1) {
+		return b.slice(0, 1)
+	}
+	// `b` is null or has length 1 (a single digit). The first digit of `a` is the
+	// previous digit to `b`, or the largest digit if `b` is null.
+	return DIGITS[digitA] + midpoint(a.slice(1), null)
+}
+
+// May return null, as there is a largest integer.
+function incrementInteger(x: string): string | null {
+	const [head, ...digs] = x.split('')
+	let carry = true
+	for (let i = digs.length - 1; carry && i >= 0; i--) {
+		const d = digitIndex(digs[i]) + 1
+		if (d === DIGITS.length) {
+			digs[i] = ZERO
+		} else {
+			digs[i] = DIGITS[d]
+			carry = false
+		}
+	}
+	if (carry) {
+		if (head === 'Z') return 'a' + ZERO
+		if (head === 'z') return null
+		const h = String.fromCharCode(head.charCodeAt(0) + 1)
+		if (h > 'a') {
+			digs.push(ZERO)
+		} else {
+			digs.pop()
+		}
+		return h + digs.join('')
+	}
+	return head + digs.join('')
+}
+
+// May return null, as there is a smallest integer.
+function decrementInteger(x: string): string | null {
+	const [head, ...digs] = x.split('')
+	let borrow = true
+	for (let i = digs.length - 1; borrow && i >= 0; i--) {
+		const d = digitIndex(digs[i]) - 1
+		if (d === -1) {
+			digs[i] = LARGEST_DIGIT
+		} else {
+			digs[i] = DIGITS[d]
+			borrow = false
+		}
+	}
+	if (borrow) {
+		if (head === 'a') return 'Z' + LARGEST_DIGIT
+		if (head === 'A') return null
+		const h = String.fromCharCode(head.charCodeAt(0) - 1)
+		if (h < 'Z') {
+			digs.push(LARGEST_DIGIT)
+		} else {
+			digs.pop()
+		}
+		return h + digs.join('')
+	}
+	return head + digs.join('')
+}
+
+// Generate a key strictly between `a` and `b`, without validating the inputs.
+// `a`/`b` are order keys or null (START/END). `a < b` if both are non-null.
+function keyBetweenUnchecked(a: string | null, b: string | null): string {
+	if (a != null && b != null && a >= b) {
+		throw new Error(a + ' >= ' + b)
+	}
+	if (a == null) {
+		if (b == null) return 'a' + ZERO
+		const ib = getIntegerPart(b)
+		const fb = b.slice(ib.length)
+		if (ib === SMALLEST_INTEGER) {
+			return ib + midpoint('', fb)
+		}
+		if (ib < b) return ib
+		const res = decrementInteger(ib)
+		if (res == null) throw new Error('cannot decrement any more')
+		return res
+	}
+	if (b == null) {
+		const ia = getIntegerPart(a)
+		const fa = a.slice(ia.length)
+		const i = incrementInteger(ia)
+		return i == null ? ia + midpoint(fa, null) : i
+	}
+	const ia = getIntegerPart(a)
+	const fa = a.slice(ia.length)
+	const ib = getIntegerPart(b)
+	const fb = b.slice(ib.length)
+	if (ia === ib) {
+		return ia + midpoint(fa, fb)
+	}
+	const i = incrementInteger(ia)
+	if (i == null) throw new Error('cannot increment any more')
+	if (i < b) return i
+	return ia + midpoint(fa, null)
+}
+
+// Generate `n` keys between `a` and `b`, without validating the inputs.
+// Intermediate keys are valid by construction, so they're never re-validated.
+function nKeysBetweenUnchecked(a: string | null, b: string | null, n: number): string[] {
+	if (n === 0) return []
+	if (n === 1) return [keyBetweenUnchecked(a, b)]
+	if (b == null) {
+		let c = keyBetweenUnchecked(a, b)
+		const result = [c]
+		for (let i = 0; i < n - 1; i++) {
+			c = keyBetweenUnchecked(c, b)
+			result.push(c)
+		}
+		return result
+	}
+	if (a == null) {
+		let c = keyBetweenUnchecked(a, b)
+		const result = [c]
+		for (let i = 0; i < n - 1; i++) {
+			c = keyBetweenUnchecked(a, c)
+			result.push(c)
+		}
+		result.reverse()
+		return result
+	}
+	const mid = Math.floor(n / 2)
+	const c = keyBetweenUnchecked(a, b)
+	return [...nKeysBetweenUnchecked(a, c, mid), c, ...nKeysBetweenUnchecked(c, b, n - mid - 1)]
+}
+
+// Bisect `[low, high]` JITTER_BITS times, following a random walk, so that keys
+// generated concurrently land in different sub-ranges. `low`/`high` must already
+// be valid (or null); the intermediate midpoints are valid by construction.
+function jitterBetween(low: string | null, high: string | null): string {
+	let mid = keyBetweenUnchecked(low, high)
+	for (let i = 0; i < JITTER_BITS; i++) {
+		if (Math.random() < 0.5) {
+			low = mid
+		} else {
+			high = mid
+		}
+		mid = keyBetweenUnchecked(low, high)
+	}
+	return mid
+}
+
+/**
+ * Generate `n` jittered keys evenly spaced between `a` and `b`. Inputs are
+ * validated once; everything downstream is generated, hence trusted.
+ */
+export function generateNJitteredKeysBetween(
+	a: string | null,
+	b: string | null,
+	n: number
+): string[] {
+	if (n === 0) return []
+	if (a != null) validateOrderKey(a)
+	if (b != null) validateOrderKey(b)
+	const keys = nKeysBetweenUnchecked(a, b, n + 1)
+	const result = new Array<string>(n)
+	for (let i = 0; i < n; i++) {
+		result[i] = jitterBetween(keys[i], keys[i + 1])
+	}
+	return result
+}
+
+/**
+ * Generate `n` keys evenly spaced between `a` and `b`, without jitter. Used in
+ * tests for deterministic output.
+ */
+export function generateNKeysBetween(a: string | null, b: string | null, n: number): string[] {
+	if (n === 0) return []
+	if (a != null) validateOrderKey(a)
+	if (b != null) validateOrderKey(b)
+	return nKeysBetweenUnchecked(a, b, n)
+}

package/src/lib/reordering.ts

@@ -1,11 +1,11 @@
-import { generateKeyBetween, generateNKeysBetween } from 'jittered-fractional-indexing'
-
-const generateNKeysBetweenWithNoJitter = (a: string | null, b: string | null, n: number) => {
-	return generateNKeysBetween(a, b, n, { jitterBits: 0 })
-}
+import {
+	generateNJitteredKeysBetween,
+	generateNKeysBetween,
+	validateOrderKey,
+} from './fractionalIndexing'
 
 const generateKeysFn =
-	process.env.NODE_ENV === 'test' ? generateNKeysBetweenWithNoJitter : generateNKeysBetween
+	process.env.NODE_ENV === 'test' ? generateNKeysBetween : generateNJitteredKeysBetween
 
 /**
  * A string made up of an integer part followed by a fraction part. The fraction point consists of
@@ -30,7 +30,7 @@ export const ZERO_INDEX_KEY = 'a0' as IndexKey
  */
 export function validateIndexKey(index: string): asserts index is IndexKey {
 	try {
-		generateKeyBetween(index, null)
+		validateOrderKey(index)
 	} catch {
 		throw new Error('invalid index: ' + index)
 	}