@procedures/collections 0.12.1 → 0.12.2

package/dist/index.js

@@ -68,6 +68,8 @@ export * from "./interfaces/set.js";
 export * from "./storage/index.js";
 // The overlay: a logical document through a stack of layers, and the stacks from rules
 export * from "./overlay/index.js";
+// The order of a list as data: a rank between two neighbors, and the index of a drop
+export * from "./order/index.js";
 // ============================================================================
 // Implementations
 // ============================================================================

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgDG;AAEH,+EAA+E;AAC/E,2BAA2B;AAC3B,+EAA+E;AAE/E,cAAc,kBAAkB,CAAC;AACjC,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,sBAAsB,CAAC;AACrC,cAAc,kBAAkB,CAAC;AACjC,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E,cAAc,4BAA4B,CAAC;AAC3C,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AAEpC,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E,cAAc,oBAAoB,CAAC;AAEnC,uFAAuF;AACvF,cAAc,oBAAoB,CAAC;AAcnC,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E,cAAc,sBAAsB,CAAC;AACrC,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,0BAA0B,CAAC;AAEzC,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,6EAA6E;AAC7E,OAAO,EAEL,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,OAAO,GACR,MAAM,wBAAwB,CAAC;AAEhC,cAAc,yBAAyB,CAAC;AACxC,cAAc,qBAAqB,CAAC;AACpC,cAAc,wBAAwB,CAAC;AACvC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E,cAAc,wBAAwB,CAAC;AACvC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E,cAAc,cAAc,CAAC;AAC7B,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,6BAA6B;AAC7B,+EAA+E;AAE/E,6BAA6B;AAC7B,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,mBAAmB;AACnB,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC9E,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAC/E,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAC3D,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAE/E,mBAAmB;AACnB,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAChE,OAAO,EAAE,SAAS,EAAgB,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EACL,OAAO,EACP,OAAO,EACP,MAAM,EACN,OAAO,EACP,MAAM,EACN,QAAQ,EACR,MAAM,EACN,KAAK,EACL,KAAK,EACL,UAAU,GACX,MAAM,qBAAqB,CAAC;AAE7B,wBAAwB;AACxB,OAAO,EACL,GAAG,EACH,MAAM,EACN,OAAO,EACP,OAAO,EACP,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,GAAG,EACH,SAAS,EACT,KAAK,EACL,MAAM,EACN,SAAS,EACT,MAAM,EACN,IAAI,EACJ,IAAI,EACJ,OAAO,EACP,QAAQ,EACR,mBAAmB,EACnB,GAAG,EACH,IAAI,EACJ,KAAK,EACL,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,GAAG,EACH,GAAG,EACH,GAAG,EACH,OAAO,EACP,OAAO,EACP,KAAK,EACL,KAAK,IAAI,SAAS,EAClB,IAAI,GACL,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,OAAO,EACP,MAAM,IAAI,aAAa,EACvB,OAAO,IAAI,cAAc,EACzB,KAAK,IAAI,YAAY,EACrB,KAAK,IAAI,YAAY,EACrB,UAAU,EACV,cAAc,EACd,cAAc,EACd,QAAQ,EACR,aAAa,EACb,eAAe,EACf,KAAK,EACL,KAAK,EACL,OAAO,EACP,OAAO,EACP,SAAS,EACT,WAAW,EACX,QAAQ,EACR,YAAY,EACZ,MAAM,EACN,KAAK,EACL,IAAI,EACJ,iBAAiB,GAClB,MAAM,oBAAoB,CAAC;AAE5B,mBAAmB;AACnB,OAAO,EACL,SAAS,EACT,QAAQ,EACR,UAAU,EACV,aAAa,EACb,YAAY,EACZ,OAAO,EACP,MAAM,EACN,KAAK,EACL,KAAK,EACL,OAAO,EACP,MAAM,EACN,KAAK,EACL,OAAO,GACR,MAAM,sBAAsB,CAAC;AAE9B,UAAU;AACV,OAAO,EACL,IAAI,EACJ,IAAI,EAEJ,EAAE,EACF,GAAG,EAEH,MAAM,EACN,MAAM,EACN,IAAI,EACJ,KAAK,EACL,SAAS,EACT,MAAM,GACP,MAAM,mBAAmB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgDG;AAEH,+EAA+E;AAC/E,2BAA2B;AAC3B,+EAA+E;AAE/E,cAAc,kBAAkB,CAAC;AACjC,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,sBAAsB,CAAC;AACrC,cAAc,kBAAkB,CAAC;AACjC,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E,cAAc,4BAA4B,CAAC;AAC3C,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AAEpC,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E,cAAc,oBAAoB,CAAC;AAEnC,uFAAuF;AACvF,cAAc,oBAAoB,CAAC;AAEnC,qFAAqF;AACrF,cAAc,kBAAkB,CAAC;AAcjC,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E,cAAc,sBAAsB,CAAC;AACrC,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,0BAA0B,CAAC;AAEzC,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,6EAA6E;AAC7E,OAAO,EAEL,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,OAAO,GACR,MAAM,wBAAwB,CAAC;AAEhC,cAAc,yBAAyB,CAAC;AACxC,cAAc,qBAAqB,CAAC;AACpC,cAAc,wBAAwB,CAAC;AACvC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E,cAAc,wBAAwB,CAAC;AACvC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E,cAAc,cAAc,CAAC;AAC7B,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC;AAEnC,+EAA+E;AAC/E,6BAA6B;AAC7B,+EAA+E;AAE/E,6BAA6B;AAC7B,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,mBAAmB;AACnB,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC9E,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAC/E,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAC3D,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAE/E,mBAAmB;AACnB,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAChE,OAAO,EAAE,SAAS,EAAgB,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EACL,OAAO,EACP,OAAO,EACP,MAAM,EACN,OAAO,EACP,MAAM,EACN,QAAQ,EACR,MAAM,EACN,KAAK,EACL,KAAK,EACL,UAAU,GACX,MAAM,qBAAqB,CAAC;AAE7B,wBAAwB;AACxB,OAAO,EACL,GAAG,EACH,MAAM,EACN,OAAO,EACP,OAAO,EACP,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,GAAG,EACH,SAAS,EACT,KAAK,EACL,MAAM,EACN,SAAS,EACT,MAAM,EACN,IAAI,EACJ,IAAI,EACJ,OAAO,EACP,QAAQ,EACR,mBAAmB,EACnB,GAAG,EACH,IAAI,EACJ,KAAK,EACL,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,GAAG,EACH,GAAG,EACH,GAAG,EACH,OAAO,EACP,OAAO,EACP,KAAK,EACL,KAAK,IAAI,SAAS,EAClB,IAAI,GACL,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,OAAO,EACP,MAAM,IAAI,aAAa,EACvB,OAAO,IAAI,cAAc,EACzB,KAAK,IAAI,YAAY,EACrB,KAAK,IAAI,YAAY,EACrB,UAAU,EACV,cAAc,EACd,cAAc,EACd,QAAQ,EACR,aAAa,EACb,eAAe,EACf,KAAK,EACL,KAAK,EACL,OAAO,EACP,OAAO,EACP,SAAS,EACT,WAAW,EACX,QAAQ,EACR,YAAY,EACZ,MAAM,EACN,KAAK,EACL,IAAI,EACJ,iBAAiB,GAClB,MAAM,oBAAoB,CAAC;AAE5B,mBAAmB;AACnB,OAAO,EACL,SAAS,EACT,QAAQ,EACR,UAAU,EACV,aAAa,EACb,YAAY,EACZ,OAAO,EACP,MAAM,EACN,KAAK,EACL,KAAK,EACL,OAAO,EACP,MAAM,EACN,KAAK,EACL,OAAO,GACR,MAAM,sBAAsB,CAAC;AAE9B,UAAU;AACV,OAAO,EACL,IAAI,EACJ,IAAI,EAEJ,EAAE,EACF,GAAG,EAEH,MAAM,EACN,MAAM,EACN,IAAI,EACJ,KAAK,EACL,SAAS,EACT,MAAM,GACP,MAAM,mBAAmB,CAAC"}

package/dist/order/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * The order of a list as data (Graph's split, wave 2, W1). Each item keeps a string key, and the list
+ * sorts by it. An item that moves between two others gets a key between theirs, so a move writes one
+ * item and no other.
+ */
+export { KEY_DIGITS, keyBetween, keysBetween, keysForDrop, compareKeys, isValidKey, dropIndex, type KeyCheckOptions, type KeyedItem, type Point } from "./rank.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/order/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/order/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,eAAe,EAAE,KAAK,SAAS,EAAE,KAAK,KAAK,EAAE,MAAM,WAAW,CAAC"}

package/dist/order/index.js

@@ -0,0 +1,7 @@
+/**
+ * The order of a list as data (Graph's split, wave 2, W1). Each item keeps a string key, and the list
+ * sorts by it. An item that moves between two others gets a key between theirs, so a move writes one
+ * item and no other.
+ */
+export { KEY_DIGITS, keyBetween, keysBetween, keysForDrop, compareKeys, isValidKey, dropIndex } from "./rank.js";
+//# sourceMappingURL=index.js.map

package/dist/order/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/order/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAoD,MAAM,WAAW,CAAC"}

package/dist/order/rank.d.ts

@@ -0,0 +1,100 @@
+/**
+ * The keys of an ordered list (Graph's split, wave 2, W1): fractional indexing with base-62 keys. A
+ * key is a string. Each item of the list keeps one, and the list sorts by it. An item that moves
+ * between two others gets a key between theirs, so a move writes one item and no other.
+ *
+ * - A key has an integer part and a fraction part. The first character of the integer part gives its
+ *   length. An insertion at an end changes the integer part, so the keys stay short. An insertion
+ *   between two keys uses the fraction part, which can grow without a limit: the keys never run out,
+ *   and the list needs no rebalance.
+ * - Compare two keys by the code units of the strings (`a < b`), never with `localeCompare`.
+ * - Two writers that move items into the same gap at the same time can get the same key. Sort by the
+ *   key, then by the id of the item, so each reader sees one order.
+ *
+ * The algorithm is the one of the `fractional-indexing` package of Rocicorp (CC0), after the article
+ * "Implementing Fractional Indexing" of David Greenspan.
+ */
+/** The digits of a key, in ascending order of their code units. */
+export declare const KEY_DIGITS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+/**
+ * This function gives a key strictly between two keys. Without `prev`, the key comes before `next`.
+ * Without `next`, it comes after `prev`. Without both, it gives the first key of a list ("a0").
+ *
+ * @throws RangeError when a key is not valid, or when `prev` is not before `next`
+ *
+ * @example
+ * ```ts
+ * keyBetween(undefined, undefined); // "a0"
+ * keyBetween("a0", undefined); // "a1", after a0
+ * keyBetween("a0", "a1"); // "a0V"
+ * ```
+ */
+export declare function keyBetween(prev: string | null | undefined, next: string | null | undefined): string;
+/**
+ * This function gives `count` keys in ascending order, strictly between two keys, for example to put
+ * several items at one place, or to give keys to the items of a list for the first time.
+ *
+ * @throws RangeError as `keyBetween`, or when `count` is not an integer of 0 or more
+ */
+export declare function keysBetween(prev: string | null | undefined, next: string | null | undefined, count: number): string[];
+/** The options of `isValidKey`. */
+export interface KeyCheckOptions {
+    /** The longest key that the check accepts. The default is 1024 characters. */
+    readonly maxLength?: number;
+}
+/**
+ * This function tells if a value is a valid key, for example a key that a client writes. A key that
+ * is longer than `maxLength` is not valid.
+ */
+export declare function isValidKey(key: unknown, options?: KeyCheckOptions): key is string;
+/** An item of an ordered list: its id and its key. */
+export interface KeyedItem {
+    readonly id: string;
+    readonly key: string;
+}
+/**
+ * This function gives the writes of a move: the new key of the item that moves, and new keys for the
+ * neighbors that need them. Give the other items of the list in order (by key, then by id), without
+ * the item that moves, and the index of the drop from 0 to their number (`dropIndex`).
+ *
+ * Two writers can give two items one key. A drop between two such items has no key between them, so
+ * the helper first gives new keys to the items after the drop that have the key of the item before
+ * it. Each write is `{ id, key }`. The writes of the neighbors come first, and the write of the item
+ * that moves comes last.
+ *
+ * @throws RangeError when the index is outside the list, when the list holds the item that moves, or
+ * when a key is not valid
+ *
+ * @example
+ * ```ts
+ * const index = dropIndex(pointer, others.map(centerOf));
+ * for (const { id, key } of keysForDrop(others, index, dragged.id)) await save(id, { rank: key });
+ * ```
+ */
+export declare function keysForDrop(items: readonly KeyedItem[], index: number, movingId: string): Array<{
+    id: string;
+    key: string;
+}>;
+/** The order of two keys: the code units of the strings, as the keys need (never `localeCompare`). */
+export declare function compareKeys(a: string, b: string): number;
+/** A point, for example the center of an item on the screen. */
+export interface Point {
+    readonly x: number;
+    readonly y: number;
+}
+/**
+ * This function gives the index at which a point goes among the items of a list on the screen, in
+ * reading order: the rows from top to bottom, and each row from left to right. It is the index of the
+ * first item whose center comes after the point, from 0 to the number of items. A center within
+ * `rowTolerance` of the point on the vertical axis is in the row of the point.
+ *
+ * Give the centers in reading order, the same order as the keys, and without the item that moves.
+ *
+ * @example
+ * ```ts
+ * const index = dropIndex(pointer, others.map(centerOf));
+ * const key = keyBetween(keys[index - 1], keys[index]);
+ * ```
+ */
+export declare function dropIndex(point: Point, centers: readonly Point[], rowTolerance?: number): number;
+//# sourceMappingURL=rank.d.ts.map

package/dist/order/rank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank.d.ts","sourceRoot":"","sources":["../../src/order/rank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,mEAAmE;AACnE,eAAO,MAAM,UAAU,mEAAmE,CAAC;AAuF3F;;;;;;;;;;;;GAYG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM,CA6BnG;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAmBrH;AAED,mCAAmC;AACnC,MAAM,WAAW,eAAe;IAC9B,8EAA8E;IAC9E,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,GAAE,eAAoB,GAAG,GAAG,IAAI,MAAM,CAQrF;AAED,sDAAsD;AACtD,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAAC,CAe5H;AAED,sGAAsG;AACtG,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAExD;AAED,gEAAgE;AAChE,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,KAAK,EAAE,EAAE,YAAY,SAAK,GAAG,MAAM,CAO5F"}

package/dist/order/rank.js

@@ -0,0 +1,286 @@
+/**
+ * The keys of an ordered list (Graph's split, wave 2, W1): fractional indexing with base-62 keys. A
+ * key is a string. Each item of the list keeps one, and the list sorts by it. An item that moves
+ * between two others gets a key between theirs, so a move writes one item and no other.
+ *
+ * - A key has an integer part and a fraction part. The first character of the integer part gives its
+ *   length. An insertion at an end changes the integer part, so the keys stay short. An insertion
+ *   between two keys uses the fraction part, which can grow without a limit: the keys never run out,
+ *   and the list needs no rebalance.
+ * - Compare two keys by the code units of the strings (`a < b`), never with `localeCompare`.
+ * - Two writers that move items into the same gap at the same time can get the same key. Sort by the
+ *   key, then by the id of the item, so each reader sees one order.
+ *
+ * The algorithm is the one of the `fractional-indexing` package of Rocicorp (CC0), after the article
+ * "Implementing Fractional Indexing" of David Greenspan.
+ */
+/** The digits of a key, in ascending order of their code units. */
+export const KEY_DIGITS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+const ZERO = KEY_DIGITS[0];
+const LAST = KEY_DIGITS[KEY_DIGITS.length - 1];
+/** The smallest integer part. No key comes before it. */
+const SMALLEST_INTEGER = `A${ZERO.repeat(26)}`;
+function invalid(message) {
+    return new RangeError(message);
+}
+/** The length of the integer part that starts with a head character: a to z give 2 to 27, Z to A give 2 to 27. */
+function integerLength(head) {
+    if (head >= "a" && head <= "z")
+        return head.charCodeAt(0) - "a".charCodeAt(0) + 2;
+    if (head >= "A" && head <= "Z")
+        return "Z".charCodeAt(0) - head.charCodeAt(0) + 2;
+    throw invalid(`A key cannot start with "${head}"`);
+}
+function integerPart(key) {
+    const length = integerLength(key[0] ?? "");
+    if (length > key.length)
+        throw invalid(`The key "${key}" is too short for its integer part`);
+    return key.slice(0, length);
+}
+function validateKey(key) {
+    if (typeof key !== "string" || key === "")
+        throw invalid("A key is a string that is not empty");
+    for (const c of key)
+        if (!KEY_DIGITS.includes(c))
+            throw invalid(`The key "${key}" has a character that is no digit of a key`);
+    if (key === SMALLEST_INTEGER)
+        throw invalid(`The key "${key}" is reserved`);
+    const fraction = key.slice(integerPart(key).length);
+    if (fraction.endsWith(ZERO))
+        throw invalid(`The fraction part of the key "${key}" ends with ${ZERO}`);
+}
+/** A fraction strictly between two fractions. `b` null is the end. Neither one ends with the zero digit. */
+function midpoint(a, b) {
+    if (b !== null) {
+        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 ? KEY_DIGITS.indexOf(a[0]) : 0;
+    const digitB = b !== null ? KEY_DIGITS.indexOf(b[0]) : KEY_DIGITS.length;
+    if (digitB - digitA > 1)
+        return KEY_DIGITS[Math.round((digitA + digitB) / 2)];
+    // The first digits are next to each other
+    if (b !== null && b.length > 1)
+        return b.slice(0, 1);
+    return KEY_DIGITS[digitA] + midpoint(a.slice(1), null);
+}
+function incrementInteger(x) {
+    const [head, ...digits] = x.split("");
+    let carry = true;
+    for (let i = digits.length - 1; carry && i >= 0; i--) {
+        const d = KEY_DIGITS.indexOf(digits[i]) + 1;
+        if (d === KEY_DIGITS.length)
+            digits[i] = ZERO;
+        else {
+            digits[i] = KEY_DIGITS[d];
+            carry = false;
+        }
+    }
+    if (!carry)
+        return head + digits.join("");
+    if (head === "Z")
+        return `a${ZERO}`;
+    if (head === "z")
+        return null;
+    const next = String.fromCharCode(head.charCodeAt(0) + 1);
+    if (next > "a")
+        digits.push(ZERO);
+    else
+        digits.pop();
+    return next + digits.join("");
+}
+function decrementInteger(x) {
+    const [head, ...digits] = x.split("");
+    let borrow = true;
+    for (let i = digits.length - 1; borrow && i >= 0; i--) {
+        const d = KEY_DIGITS.indexOf(digits[i]) - 1;
+        if (d === -1)
+            digits[i] = LAST;
+        else {
+            digits[i] = KEY_DIGITS[d];
+            borrow = false;
+        }
+    }
+    if (!borrow)
+        return head + digits.join("");
+    if (head === "a")
+        return `Z${LAST}`;
+    if (head === "A")
+        return null;
+    const next = String.fromCharCode(head.charCodeAt(0) - 1);
+    if (next < "Z")
+        digits.push(LAST);
+    else
+        digits.pop();
+    return next + digits.join("");
+}
+/**
+ * This function gives a key strictly between two keys. Without `prev`, the key comes before `next`.
+ * Without `next`, it comes after `prev`. Without both, it gives the first key of a list ("a0").
+ *
+ * @throws RangeError when a key is not valid, or when `prev` is not before `next`
+ *
+ * @example
+ * ```ts
+ * keyBetween(undefined, undefined); // "a0"
+ * keyBetween("a0", undefined); // "a1", after a0
+ * keyBetween("a0", "a1"); // "a0V"
+ * ```
+ */
+export function keyBetween(prev, next) {
+    const a = prev ?? null;
+    const b = next ?? null;
+    if (a !== null)
+        validateKey(a);
+    if (b !== null)
+        validateKey(b);
+    if (a !== null && b !== null && a >= b)
+        throw invalid(`The key "${a}" is not before the key "${b}"`);
+    if (a === null) {
+        if (b === null)
+            return `a${ZERO}`;
+        const ib = integerPart(b);
+        const fb = b.slice(ib.length);
+        if (ib === SMALLEST_INTEGER)
+            return ib + midpoint("", fb);
+        if (ib < b)
+            return ib;
+        const decremented = decrementInteger(ib);
+        if (decremented === null)
+            throw invalid("No key comes before this one");
+        return decremented;
+    }
+    const ia = integerPart(a);
+    const fa = a.slice(ia.length);
+    if (b === null) {
+        const incremented = incrementInteger(ia);
+        return incremented === null ? ia + midpoint(fa, null) : incremented;
+    }
+    const ib = integerPart(b);
+    const fb = b.slice(ib.length);
+    if (ia === ib)
+        return ia + midpoint(fa, fb);
+    const incremented = incrementInteger(ia);
+    if (incremented === null)
+        throw invalid("No key comes after this one");
+    if (incremented < b)
+        return incremented;
+    return ia + midpoint(fa, null);
+}
+/**
+ * This function gives `count` keys in ascending order, strictly between two keys, for example to put
+ * several items at one place, or to give keys to the items of a list for the first time.
+ *
+ * @throws RangeError as `keyBetween`, or when `count` is not an integer of 0 or more
+ */
+export function keysBetween(prev, next, count) {
+    if (!Number.isInteger(count) || count < 0)
+        throw invalid(`A count of keys is an integer of 0 or more, not ${count}`);
+    const a = prev ?? null;
+    const b = next ?? null;
+    if (count === 0)
+        return [];
+    if (count === 1)
+        return [keyBetween(a, b)];
+    if (b === null) {
+        const keys = [keyBetween(a, null)];
+        for (let i = 1; i < count; i++)
+            keys.push(keyBetween(keys[i - 1], null));
+        return keys;
+    }
+    if (a === null) {
+        const keys = [keyBetween(null, b)];
+        for (let i = 1; i < count; i++)
+            keys.push(keyBetween(null, keys[i - 1]));
+        return keys.reverse();
+    }
+    const half = Math.floor(count / 2);
+    const middle = keyBetween(a, b);
+    return [...keysBetween(a, middle, half), middle, ...keysBetween(middle, b, count - half - 1)];
+}
+/**
+ * This function tells if a value is a valid key, for example a key that a client writes. A key that
+ * is longer than `maxLength` is not valid.
+ */
+export function isValidKey(key, options = {}) {
+    if (typeof key !== "string" || key.length > (options.maxLength ?? 1024))
+        return false;
+    try {
+        validateKey(key);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * This function gives the writes of a move: the new key of the item that moves, and new keys for the
+ * neighbors that need them. Give the other items of the list in order (by key, then by id), without
+ * the item that moves, and the index of the drop from 0 to their number (`dropIndex`).
+ *
+ * Two writers can give two items one key. A drop between two such items has no key between them, so
+ * the helper first gives new keys to the items after the drop that have the key of the item before
+ * it. Each write is `{ id, key }`. The writes of the neighbors come first, and the write of the item
+ * that moves comes last.
+ *
+ * @throws RangeError when the index is outside the list, when the list holds the item that moves, or
+ * when a key is not valid
+ *
+ * @example
+ * ```ts
+ * const index = dropIndex(pointer, others.map(centerOf));
+ * for (const { id, key } of keysForDrop(others, index, dragged.id)) await save(id, { rank: key });
+ * ```
+ */
+export function keysForDrop(items, index, movingId) {
+    if (!Number.isInteger(index) || index < 0 || index > items.length)
+        throw invalid(`The index ${index} is outside the list of ${items.length} items`);
+    if (items.some((item) => item.id === movingId))
+        throw invalid(`The list holds the item that moves (${movingId})`);
+    const prev = items[index - 1]?.key ?? null;
+    // The items from the index on that do not come after the item before the drop need new keys
+    let end = index;
+    while (end < items.length && prev !== null && items[end].key <= prev)
+        end++;
+    const writes = [];
+    if (end > index) {
+        const keys = keysBetween(prev, items[end]?.key ?? null, end - index);
+        for (let i = index; i < end; i++)
+            writes.push({ id: items[i].id, key: keys[i - index] });
+    }
+    const next = writes.length > 0 ? writes[0].key : (items[index]?.key ?? null);
+    writes.push({ id: movingId, key: keyBetween(prev, next) });
+    return writes;
+}
+/** The order of two keys: the code units of the strings, as the keys need (never `localeCompare`). */
+export function compareKeys(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+/**
+ * This function gives the index at which a point goes among the items of a list on the screen, in
+ * reading order: the rows from top to bottom, and each row from left to right. It is the index of the
+ * first item whose center comes after the point, from 0 to the number of items. A center within
+ * `rowTolerance` of the point on the vertical axis is in the row of the point.
+ *
+ * Give the centers in reading order, the same order as the keys, and without the item that moves.
+ *
+ * @example
+ * ```ts
+ * const index = dropIndex(pointer, others.map(centerOf));
+ * const key = keyBetween(keys[index - 1], keys[index]);
+ * ```
+ */
+export function dropIndex(point, centers, rowTolerance = 24) {
+    for (let i = 0; i < centers.length; i++) {
+        const c = centers[i];
+        if (point.y < c.y - rowTolerance)
+            return i;
+        if (Math.abs(point.y - c.y) <= rowTolerance && point.x < c.x)
+            return i;
+    }
+    return centers.length;
+}
+//# sourceMappingURL=rank.js.map

package/dist/order/rank.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank.js","sourceRoot":"","sources":["../../src/order/rank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,mEAAmE;AACnE,MAAM,CAAC,MAAM,UAAU,GAAG,gEAAgE,CAAC;AAE3F,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;AAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;AAChD,yDAAyD;AACzD,MAAM,gBAAgB,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AAE/C,SAAS,OAAO,CAAC,OAAe;IAC9B,OAAO,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;AACjC,CAAC;AAED,kHAAkH;AAClH,SAAS,aAAa,CAAC,IAAY;IACjC,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG;QAAE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClF,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG;QAAE,OAAO,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClF,MAAM,OAAO,CAAC,4BAA4B,IAAI,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,WAAW,CAAC,GAAW;IAC9B,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,GAAG,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,YAAY,GAAG,qCAAqC,CAAC,CAAC;IAC7F,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,WAAW,CAAC,GAAW;IAC9B,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,EAAE;QAAE,MAAM,OAAO,CAAC,qCAAqC,CAAC,CAAC;IAChG,KAAK,MAAM,CAAC,IAAI,GAAG;QAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,OAAO,CAAC,YAAY,GAAG,6CAA6C,CAAC,CAAC;IAC9H,IAAI,GAAG,KAAK,gBAAgB;QAAE,MAAM,OAAO,CAAC,YAAY,GAAG,eAAe,CAAC,CAAC;IAC5E,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACpD,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,MAAM,OAAO,CAAC,iCAAiC,GAAG,eAAe,IAAI,EAAE,CAAC,CAAC;AACxG,CAAC;AAED,4GAA4G;AAC5G,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAgB;IAC3C,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;IAC1E,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;IAC/E,0CAA0C;IAC1C,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrD,OAAO,UAAU,CAAC,MAAM,CAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAS;IACjC,MAAM,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAA0B,CAAC;IAC/D,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACrD,MAAM,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,UAAU,CAAC,MAAM;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;aACzC,CAAC;YACJ,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;YAC3B,KAAK,GAAG,KAAK,CAAC;QAChB,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C,IAAI,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,IAAI,EAAE,CAAC;IACpC,IAAI,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,IAAI,IAAI,GAAG,GAAG;QAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;QAC7B,MAAM,CAAC,GAAG,EAAE,CAAC;IAClB,OAAO,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAChC,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAS;IACjC,MAAM,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAA0B,CAAC;IAC/D,IAAI,MAAM,GAAG,IAAI,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACtD,MAAM,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;aAC1B,CAAC;YACJ,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;YAC3B,MAAM,GAAG,KAAK,CAAC;QACjB,CAAC;IACH,CAAC;IACD,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,IAAI,EAAE,CAAC;IACpC,IAAI,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,IAAI,IAAI,GAAG,GAAG;QAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;QAC7B,MAAM,CAAC,GAAG,EAAE,CAAC;IAClB,OAAO,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,UAAU,CAAC,IAA+B,EAAE,IAA+B;IACzF,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;IACvB,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;IACvB,IAAI,CAAC,KAAK,IAAI;QAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,KAAK,IAAI;QAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;QAAE,MAAM,OAAO,CAAC,YAAY,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;IACrG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,IAAI,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAI,EAAE,KAAK,gBAAgB;YAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1D,IAAI,EAAE,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QACtB,MAAM,WAAW,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,WAAW,KAAK,IAAI;YAAE,MAAM,OAAO,CAAC,8BAA8B,CAAC,CAAC;QACxE,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IAC9B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,MAAM,WAAW,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;QACzC,OAAO,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IACtE,CAAC;IACD,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IAC9B,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5C,MAAM,WAAW,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;IACzC,IAAI,WAAW,KAAK,IAAI;QAAE,MAAM,OAAO,CAAC,6BAA6B,CAAC,CAAC;IACvE,IAAI,WAAW,GAAG,CAAC;QAAE,OAAO,WAAW,CAAC;IACxC,OAAO,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,IAA+B,EAAE,IAA+B,EAAE,KAAa;IACzG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;QAAE,MAAM,OAAO,CAAC,mDAAmD,KAAK,EAAE,CAAC,CAAC;IACrH,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;IACvB,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;IACvB,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3B,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3C,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC;QAC1E,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;AAChG,CAAC;AAQD;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAY,EAAE,OAAO,GAAoB,EAAE;IACpE,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACtF,IAAI,CAAC;QACH,WAAW,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAQD;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,WAAW,CAAC,KAA2B,EAAE,KAAa,EAAE,QAAgB;IACtF,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,aAAa,KAAK,2BAA2B,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;IACpJ,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC;QAAE,MAAM,OAAO,CAAC,uCAAuC,QAAQ,GAAG,CAAC,CAAC;IAClH,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC;IAC3C,4FAA4F;IAC5F,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,OAAO,GAAG,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG,CAAE,CAAC,GAAG,IAAI,IAAI;QAAE,GAAG,EAAE,CAAC;IAC7E,MAAM,MAAM,GAAuC,EAAE,CAAC;IACtD,IAAI,GAAG,GAAG,KAAK,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC;QACrE,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAE,EAAE,CAAC,CAAC;IAC7F,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC;IAC9E,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sGAAsG;AACtG,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAQD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,SAAS,CAAC,KAAY,EAAE,OAAyB,EAAE,YAAY,GAAG,EAAE;IAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACtB,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY;YAAE,OAAO,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IACzE,CAAC;IACD,OAAO,OAAO,CAAC,MAAM,CAAC;AACxB,CAAC"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "$schema": "https://json.schemastore.org/package",
   "name": "@procedures/collections",
-  "version": "0.12.1",
+  "version": "0.12.2",
   "description": "Collections for TypeScript: ArrayList, LinkedList, ArrayDeque, HashMap, LinkedHashMap, TreeMap (red-black), PriorityQueue, LRU and TTL maps, async queues, channels and collectors, tested with fast-check.",
   "keywords": [
     "collections",
@@ -59,7 +59,7 @@
     "provenance": true
   },
   "dependencies": {
-    "@procedures/client": "0.12.1"
+    "@procedures/client": "0.12.2"
   },
   "devDependencies": {
     "typescript": "^7.0.2",

package/src/index.ts

@@ -75,6 +75,9 @@ export * from "./storage/index.js";
 // The overlay: a logical document through a stack of layers, and the stacks from rules
 export * from "./overlay/index.js";
 
+// The order of a list as data: a rank between two neighbors, and the index of a drop
+export * from "./order/index.js";
+
 // Export queue interfaces with disambiguation for PriorityQueue
 export type {
   ReadonlyQueue,

package/src/order/index.ts

@@ -0,0 +1,6 @@
+/**
+ * The order of a list as data (Graph's split, wave 2, W1). Each item keeps a string key, and the list
+ * sorts by it. An item that moves between two others gets a key between theirs, so a move writes one
+ * item and no other.
+ */
+export { KEY_DIGITS, keyBetween, keysBetween, keysForDrop, compareKeys, isValidKey, dropIndex, type KeyCheckOptions, type KeyedItem, type Point } from "./rank.js";