@graphprotocol/grc-20 0.2.0 → 0.2.2

package/dist/src/core/position-strings/position-source.js

@@ -1,314 +0,0 @@
-import { IDs } from './ids.js';
-import { LastInternal, assert, precond } from './util.js';
-/**
- * A source of lexicographically-ordered "position strings" for
- * collaborative lists and text.
- *
- * In a collaborative list (or text string), you need a way to refer
- * to "positions" within that list that:
- * 1. Point to a specific list element (or text character).
- * 2. Are global (all users agree on them) and immutable (they do not
- * change over time).
- * 3. Can be sorted.
- * 4. Are unique, even if different users concurrently create positions
- * at the same place.
- *
- * `PositionSource` gives you such positions, in the form
- * of lexicographically-ordered strings. Specifically, `createBetween`
- * returns a new "position string" in between two existing position strings.
- *
- * These strings have the bonus properties:
- * - 5. (Non-Interleaving) If two `PositionSource`s concurrently create a (forward or backward)
- * sequence of positions at the same place,
- * their sequences will not be interleaved.
- * For example, if
- * Alice types "Hello" while Bob types "World" at the same place,
- * and they each use a `PositionSource` to create a position for each
- * character, then
- * the resulting order will be "HelloWorld" or "WorldHello", not
- * "HWeolrllod".
- * - 6. If a `PositionSource` creates positions in a forward (increasing)
- * sequence, their lengths as strings will only grow logarithmically,
- * not linearly.
- *
- * Position strings are printable ASCII. Specifically, they
- * contain alphanumeric characters, `','`, and `'.'`.
- * Also, the special string `PositionSource.LAST` is `'~'`.
- *
- * Further reading:
- * - [Fractional indexing](https://www.figma.com/blog/realtime-editing-of-ordered-sequences/#fractional-indexing),
- * a related scheme that satisfies 1-3 but not 4-6.
- * - [List CRDTs](https://mattweidner.com/2022/10/21/basic-list-crdt.html)
- * and how they map to position strings. `PositionSource` uses an optimized
- * variant of that link's string implementation.
- * - [Paper about interleaving](https://www.repository.cam.ac.uk/handle/1810/290391)
- * in collaborative text editors.
- */
-export class PositionSource {
-    /**
-     * A string that is less than all positions.
-     *
-     * Value: `""`.
-     */
-    static FIRST = '';
-    /**
-     * A string that is greater than all positions.
-     *
-     * Value: `"~"`.
-     */
-    static LAST = LastInternal;
-    /**
-     * The unique ID for this `PositionSource`.
-     */
-    ID;
-    /**
-     * Our waypoints' long name: `,${ID}.`.
-     */
-    longName;
-    /**
-     * Variant of longName used for a position's first ID: `${ID}.`.
-     * (Otherwise every position would start with a redundant ','.)
-     */
-    firstName;
-    /**
-     * For each waypoint that we created, maps a prefix (see getPrefix)
-     * for that waypoint to its last (most recent) valueSeq.
-     * We always store the right-side version (odd valueSeq).
-     */
-    lastValueSeqs = new Map();
-    /**
-     * Constructs a new `PositionSource`.
-     *
-     * It is okay to share a single `PositionSource` between
-     * all documents (lists/text strings) in the same JavaScript runtime.
-     *
-     * For efficiency (shorter position strings),
-     * within each JavaScript runtime, you should not use
-     * more than one `PositionSource` for the same document.
-     * An exception is if multiple logical users share the same runtime;
-     * we then recommend one `PositionSource` per user.
-     *
-     * @param options.ID A unique ID for this `PositionSource`. Defaults to
-     * `IDs.random()`.
-     *
-     * If provided, `options.ID` must satisfy:
-     * - It is unique across the entire collaborative application, i.e.,
-     * all `PositionSource`s whose positions may be compared to ours. This
-     * includes past `PositionSource`s, even if they correspond to the same
-     * user/device.
-     * - It does not contain `','` or `'.'`.
-     * - The first character is lexicographically less than `'~'` (code point 126).
-     *
-     * If `options.ID` contains non-alphanumeric characters, then created
-     * positions will contain those characters in addition to
-     * alphanumeric characters, `','`, and `'.'`.
-     */
-    constructor(options) {
-        if (options?.ID !== undefined) {
-            IDs.validate(options.ID);
-        }
-        this.ID = options?.ID ?? IDs.random();
-        this.longName = `,${this.ID}.`;
-        this.firstName = `${this.ID}.`;
-    }
-    /**
-     * Returns a new position between `left` and `right`
-     * (`left < new < right`).
-     *
-     * The new position is unique across the entire collaborative application,
-     * even in the face of concurrent calls to this method on other
-     * `PositionSource`s.
-     *
-     * @param left Defaults to `PositionSource.FIRST` (insert at the beginning).
-     *
-     * @param right Defaults to `PositionSource.LAST` (insert at the end).
-     */
-    createBetween(left = PositionSource.FIRST, right = PositionSource.LAST) {
-        precond(left < right, 'left must be less than right:', left, '!<', right);
-        precond(right <= PositionSource.LAST, 'right must be less than or equal to LAST:', right, '!<=', PositionSource.LAST);
-        const leftFixed = left === PositionSource.FIRST ? null : left;
-        const rightFixed = right === PositionSource.LAST ? null : right;
-        let ans;
-        if (rightFixed !== null && (leftFixed === null || rightFixed.startsWith(leftFixed))) {
-            // Left child of right. This always appends a waypoint.
-            const ancestor = leftVersion(rightFixed);
-            ans = this.appendWaypoint(ancestor);
-        }
-        else {
-            // Right child of left.
-            if (leftFixed === null) {
-                // ancestor is FIRST.
-                ans = this.appendWaypoint('');
-            }
-            else {
-                // Check if we can reuse left's prefix.
-                // It needs to be one of ours, and right can't use the same
-                // prefix (otherwise we would get ans > right by comparing right's
-                // older valueIndex to our new valueIndex).
-                const prefix = getPrefix(leftFixed);
-                const lastValueSeq = this.lastValueSeqs.get(prefix);
-                if (lastValueSeq !== undefined && !(rightFixed !== null && rightFixed.startsWith(prefix))) {
-                    // Reuse.
-                    const valueSeq = nextOddValueSeq(lastValueSeq);
-                    ans = prefix + stringifyBase52(valueSeq);
-                    this.lastValueSeqs.set(prefix, valueSeq);
-                }
-                else {
-                    // Append waypoint.
-                    ans = this.appendWaypoint(leftFixed);
-                }
-            }
-        }
-        assert(left < ans && ans < right, 'Bad position:', left, ans, right);
-        return ans;
-    }
-    /**
-     * Appends a wayoint to the given ancestor (= prefix adjusted for
-     * side), returning a unique new position using that waypoint.
-     *
-     * lastValueSeqs is also updated as needed for the waypoint.
-     */
-    appendWaypoint(ancestor) {
-        let waypointName = ancestor === '' ? this.firstName : this.longName;
-        // If our ID already appears in ancestor, instead use a short
-        // name for the waypoint.
-        // Here we use the uniqueness of ',' and '.' to
-        // claim that if this.longName (= `,${ID}.`) appears in ancestor, then it
-        // must actually be from a waypoint that we created.
-        let existing = ancestor.lastIndexOf(this.longName);
-        if (ancestor.startsWith(this.firstName))
-            existing = 0;
-        if (existing !== -1) {
-            // Find the index of existing among the long-name
-            // waypoints, in backwards order. Here we use the fact that
-            // each longName ends with '.' and that '.' does not appear otherwise.
-            let index = -1;
-            for (let i = existing; i < ancestor.length; i++) {
-                if (ancestor[i] === '.')
-                    index++;
-            }
-            waypointName = stringifyShortName(index);
-        }
-        const prefix = ancestor + waypointName;
-        const lastValueSeq = this.lastValueSeqs.get(prefix);
-        // Use next odd (right-side) valueSeq (1 if it's a new waypoint).
-        const valueSeq = lastValueSeq === undefined ? 1 : nextOddValueSeq(lastValueSeq);
-        this.lastValueSeqs.set(prefix, valueSeq);
-        return prefix + stringifyBase52(valueSeq);
-    }
-}
-/**
- * Returns position's *prefix*: the string through the last waypoint
- * name, or equivalently, without the final valueSeq.
- */
-function getPrefix(position) {
-    // Last waypoint char is the last '.' (for long names) or
-    // digit (for short names). Note that neither appear in valueSeq,
-    // which is all letters.
-    for (let i = position.length - 2; i >= 0; i--) {
-        const char = position[i];
-        if (char === '.' || ('0' <= char && char <= '9')) {
-            // i is the last waypoint char, i.e., the end of the prefix.
-            return position.slice(0, i + 1);
-        }
-    }
-    assert(false, 'No last waypoint char found (not a position?)', position);
-    return '';
-}
-/**
- * Returns the variant of position ending with a "left" marker
- * instead of the default "right" marker.
- *
- * I.e., the ancestor for position's left descendants.
- */
-function leftVersion(position) {
-    // We need to subtract one from the (odd) valueSeq, equivalently, from
-    // its last base52 digit.
-    const last = parseBase52(position[position.length - 1]);
-    assert(last % 2 === 1, 'Bad valueSeq (not a position?)', last, position);
-    return position.slice(0, -1) + stringifyBase52(last - 1);
-}
-/**
- * Base 52, except for last digit, which is base 10 using
- * digits. That makes it easy to find the end of a short name
- * in getPrefix: it ends at the last digit.
- */
-function stringifyShortName(n) {
-    if (n < 10)
-        return String.fromCharCode(48 + n);
-    else
-        return stringifyBase52(Math.floor(n / 10)) + String.fromCharCode(48 + (n % 10));
-}
-/**
- * Base 52 encoding using letters (with "digits" in order by code point).
- */
-function stringifyBase52(n) {
-    if (n === 0)
-        return 'A';
-    const codes = [];
-    while (n > 0) {
-        const digit = n % 52;
-        codes.unshift((digit >= 26 ? 71 : 65) + digit);
-        n = Math.floor(n / 52);
-    }
-    return String.fromCharCode(...codes);
-}
-function parseBase52(s) {
-    let n = 0;
-    for (let i = 0; i < s.length; i++) {
-        const code = s.charCodeAt(i);
-        const digit = code - (code >= 97 ? 71 : 65);
-        n = 52 * n + digit;
-    }
-    return n;
-}
-const log52 = Math.log(52);
-/**
- * Returns the next odd valueSeq in the special sequence.
- * This is equivalent to mapping n to its valueIndex, adding 2,
- * then mapping back.
- *
- * The sequence has the following properties:
- * 1. Each number is a nonnegative integer (however, not all
- * nonnegative integers are enumerated).
- * 2. The numbers' base-52 representations are enumerated in
- * lexicographic order, with no prefixes (i.e., no string
- * representation is a prefix of another).
- * 3. The n-th enumerated number has O(log(n)) base-52 digits.
- *
- * Properties (2) and (3) are analogous to normal counting, except
- * that we order by the (base-52) lexicographic order instead of the
- * usual order by magnitude. It is also the case that
- * the numbers are in order by magnitude, although we do not
- * use this property.
- *
- * The specific sequence is as follows:
- * - Start with 0.
- * - Enumerate 26^1 numbers (A, B, ..., Z).
- * - Add 1, multiply by 52, then enumerate 26^2 numbers
- * (aA, aB, ..., mz).
- * - Add 1, multiply by 52, then enumerate 26^3 numbers
- * (nAA, nAB, ..., tZz).
- * - Repeat this pattern indefinitely, enumerating
- * 26^d d-digit numbers for each d >= 1. Imagining a decimal place
- * in front of each number, each d consumes 2^(-d) of the unit interval,
- * so we never "reach 1" (overflow to d+1 digits when
- * we meant to use d digits).
- *
- * I believe this is related to
- * [Elias gamma coding](https://en.wikipedia.org/wiki/Elias_gamma_coding).
- */
-function nextOddValueSeq(n) {
-    const d = n === 0 ? 1 : Math.floor(Math.log(n) / log52) + 1;
-    // You can calculate that the last d-digit number is 52^d - 26^d - 1.
-    if (n === Math.pow(52, d) - Math.pow(26, d) - 1) {
-        // First step is a new length: n -> (n + 1) * 52.
-        // Second step is n -> n + 1.
-        return (n + 1) * 52 + 1;
-    }
-    else {
-        // n -> n + 1 twice.
-        return n + 2;
-    }
-}
-//# sourceMappingURL=position-source.js.map

package/dist/src/core/position-strings/position-source.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"position-source.js","sourceRoot":"","sources":["../../../../src/core/position-strings/position-source.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAE1D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AACH,MAAM,OAAO,cAAc;IACzB;;;;OAIG;IACH,MAAM,CAAU,KAAK,GAAW,EAAE,CAAC;IACnC;;;;OAIG;IACH,MAAM,CAAU,IAAI,GAAW,YAAY,CAAC;IAE5C;;OAEG;IACM,EAAE,CAAS;IACpB;;OAEG;IACc,QAAQ,CAAS;IAClC;;;OAGG;IACc,SAAS,CAAS;IAEnC;;;;OAIG;IACK,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAElD;;;;;;;;;;;;;;;;;;;;;;;;;;OA0BG;IACH,YAAY,OAAyB;QACnC,IAAI,OAAO,EAAE,EAAE,KAAK,SAAS,EAAE,CAAC;YAC9B,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACtC,IAAI,CAAC,QAAQ,GAAG,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC;IACjC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,aAAa,CAAC,OAAe,cAAc,CAAC,KAAK,EAAE,QAAgB,cAAc,CAAC,IAAI;QACpF,OAAO,CAAC,IAAI,GAAG,KAAK,EAAE,+BAA+B,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1E,OAAO,CACL,KAAK,IAAI,cAAc,CAAC,IAAI,EAC5B,2CAA2C,EAC3C,KAAK,EACL,KAAK,EACL,cAAc,CAAC,IAAI,CACpB,CAAC;QAEF,MAAM,SAAS,GAAG,IAAI,KAAK,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9D,MAAM,UAAU,GAAG,KAAK,KAAK,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QAEhE,IAAI,GAAW,CAAC;QAEhB,IAAI,UAAU,KAAK,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,UAAU,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;YACpF,uDAAuD;YACvD,MAAM,QAAQ,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;YACzC,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,qBAAqB;gBACrB,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,uCAAuC;gBACvC,2DAA2D;gBAC3D,kEAAkE;gBAClE,2CAA2C;gBAC3C,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;gBACpC,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpD,IAAI,YAAY,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;oBAC1F,SAAS;oBACT,MAAM,QAAQ,GAAG,eAAe,CAAC,YAAY,CAAC,CAAC;oBAC/C,GAAG,GAAG,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;oBACzC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAC3C,CAAC;qBAAM,CAAC;oBACN,mBAAmB;oBACnB,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACrE,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,QAAgB;QACrC,IAAI,YAAY,GAAG,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;QACpE,6DAA6D;QAC7D,yBAAyB;QACzB,+CAA+C;QAC/C,yEAAyE;QACzE,oDAAoD;QACpD,IAAI,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnD,IAAI,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;QACtD,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;YACpB,iDAAiD;YACjD,2DAA2D;YAC3D,sEAAsE;YACtE,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,GAAG;oBAAE,KAAK,EAAE,CAAC;YACnC,CAAC;YACD,YAAY,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC;QAED,MAAM,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpD,iEAAiE;QACjE,MAAM,QAAQ,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;QAChF,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACzC,OAAO,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;;AAGH;;;GAGG;AACH,SAAS,SAAS,CAAC,QAAgB;IACjC,yDAAyD;IACzD,iEAAiE;IACjE,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAW,CAAC;QACnC,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACjD,4DAA4D;YAC5D,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IACD,MAAM,CAAC,KAAK,EAAE,+CAA+C,EAAE,QAAQ,CAAC,CAAC;IACzE,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,QAAgB;IACnC,sEAAsE;IACtE,yBAAyB;IACzB,MAAM,IAAI,GAAG,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC,CAAC;IAClE,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,gCAAgC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IACzE,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB,CAAC,CAAS;IACnC,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;;QAC1C,OAAO,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACvF,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,CAAS;IAChC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACxB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC;QACrB,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;QAC/C,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,WAAW,CAAC,CAAS;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC;IACrB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,SAAS,eAAe,CAAC,CAAS;IAChC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5D,qEAAqE;IACrE,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAChD,iDAAiD;QACjD,6BAA6B;QAC7B,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;SAAM,CAAC;QACN,oBAAoB;QACpB,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;AACH,CAAC"}

package/dist/src/core/position-strings/test/cursors.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=cursors.test.d.ts.map

package/dist/src/core/position-strings/test/cursors.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cursors.test.d.ts","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/cursors.test.ts"],"names":[],"mappings":""}

package/dist/src/core/position-strings/test/cursors.test.js

@@ -1,104 +0,0 @@
-import { assert } from "chai";
-import seedrandom from "seedrandom";
-import { Cursors, IDs, PositionSource } from "../src";
-describe("Cursors", () => {
-    let rng;
-    let source;
-    beforeEach(() => {
-        rng = seedrandom("42");
-        source = new PositionSource({ ID: IDs.pseudoRandom(rng) });
-    });
-    function testLength(len) {
-        let list;
-        describe(`length ${len}`, () => {
-            beforeEach(() => {
-                list = [];
-                for (let i = 0; i < len; i++) {
-                    list.push(source.createBetween(list.at(-1), undefined));
-                }
-            });
-            it("present", () => {
-                for (let i = 0; i <= list.length; i++) {
-                    const cursor = Cursors.fromIndex(i, list);
-                    assert.strictEqual(Cursors.toIndex(cursor, list), i);
-                    if (i !== 0) {
-                        // Insert a char in the next gap to the left, shifting the cursor.
-                        const list2 = [
-                            ...list.slice(0, i - 1),
-                            source.createBetween(list[i - 2], list[i - 1]),
-                            ...list.slice(i - 1),
-                        ];
-                        assert.strictEqual(Cursors.toIndex(cursor, list2), i + 1);
-                    }
-                    if (i !== list.length) {
-                        // Insert a char in the next gap to the right, which shouldn't shift the cursor.
-                        const list3 = [
-                            ...list.slice(0, i + 1),
-                            source.createBetween(list[i], list[i + 1]),
-                            ...list.slice(i),
-                        ];
-                        assert.strictEqual(Cursors.toIndex(cursor, list3), i);
-                    }
-                    // Insert a char in the cursor's gap, which
-                    // still shouldn't shift the cursor, since we
-                    // bind to the left char.
-                    const list4 = [
-                        ...list.slice(0, i),
-                        source.createBetween(list[i - 1], list[i]),
-                        ...list.slice(i),
-                    ];
-                    assert.strictEqual(Cursors.toIndex(cursor, list4), i);
-                }
-            });
-            it("not present", () => {
-                for (let i = 0; i <= list.length; i++) {
-                    // Set the cursor to a new position that we "delete"
-                    // (actually just leave not-present) in list.
-                    const listExtended = [
-                        ...list.slice(0, i),
-                        source.createBetween(list[i - 1], list[i]),
-                        ...list.slice(i),
-                    ];
-                    const cursor = Cursors.fromIndex(i + 1, listExtended);
-                    // In list, the index falls back by 1 to i.
-                    assert.strictEqual(Cursors.toIndex(cursor, list), i);
-                    if (i !== 0) {
-                        // Insert a char in the next gap to the left, shifting the cursor.
-                        const list2 = [
-                            ...list.slice(0, i - 1),
-                            source.createBetween(list[i - 2], list[i - 1]),
-                            ...list.slice(i - 1),
-                        ];
-                        assert.strictEqual(Cursors.toIndex(cursor, list2), i + 1);
-                    }
-                    if (i !== list.length) {
-                        // Insert a char in the next gap to the right, which shouldn't shift the cursor.
-                        const list3 = [
-                            ...list.slice(0, i + 1),
-                            source.createBetween(list[i], list[i + 1]),
-                            ...list.slice(i),
-                        ];
-                        assert.strictEqual(Cursors.toIndex(cursor, list3), i);
-                    }
-                    // Insert a char in the cursor's gap, which
-                    // may or may not shift the cursor, depending on how
-                    // the new position compares to the cursor's.
-                    const list4 = [
-                        ...list.slice(0, i),
-                        source.createBetween(list[i - 1], list[i]),
-                        ...list.slice(i),
-                    ];
-                    const index4 = Cursors.toIndex(cursor, list4);
-                    assert(i <= index4 && index4 <= i + 1);
-                }
-            });
-        });
-    }
-    testLength(32);
-    testLength(31);
-    testLength(33);
-    testLength(23);
-    testLength(1);
-    testLength(0);
-});
-//# sourceMappingURL=cursors.test.js.map

package/dist/src/core/position-strings/test/cursors.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cursors.test.js","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/cursors.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,UAAU,MAAM,YAAY,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,cAAc,EAAE,MAAM,QAAQ,CAAC;AAEtD,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACvB,IAAI,GAAqB,CAAC;IAC1B,IAAI,MAAuB,CAAC;IAE5B,UAAU,CAAC,GAAG,EAAE;QACd,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,GAAG,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,SAAS,UAAU,CAAC,GAAW;QAC7B,IAAI,IAAe,CAAC;QAEpB,QAAQ,CAAC,UAAU,GAAG,EAAE,EAAE,GAAG,EAAE;YAC7B,UAAU,CAAC,GAAG,EAAE;gBACd,IAAI,GAAG,EAAE,CAAC;gBACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;gBACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;oBAC1C,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBACrD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;wBACZ,kEAAkE;wBAClE,MAAM,KAAK,GAAG;4BACZ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;4BACvB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC9C,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBACrB,CAAC;wBACF,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5D,CAAC;oBACD,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;wBACtB,gFAAgF;wBAChF,MAAM,KAAK,GAAG;4BACZ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;4BACvB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC1C,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;yBACjB,CAAC;wBACF,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;oBACxD,CAAC;oBACD,2CAA2C;oBAC3C,6CAA6C;oBAC7C,yBAAyB;oBACzB,MAAM,KAAK,GAAG;wBACZ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;wBACnB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC1C,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;qBACjB,CAAC;oBACF,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;gBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,oDAAoD;oBACpD,6CAA6C;oBAC7C,MAAM,YAAY,GAAG;wBACnB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;wBACnB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC1C,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;qBACjB,CAAC;oBACF,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,CAAC;oBAEtD,2CAA2C;oBAC3C,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBACrD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;wBACZ,kEAAkE;wBAClE,MAAM,KAAK,GAAG;4BACZ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;4BACvB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC9C,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBACrB,CAAC;wBACF,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5D,CAAC;oBACD,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;wBACtB,gFAAgF;wBAChF,MAAM,KAAK,GAAG;4BACZ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;4BACvB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC1C,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;yBACjB,CAAC;wBACF,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;oBACxD,CAAC;oBACD,2CAA2C;oBAC3C,oDAAoD;oBACpD,6CAA6C;oBAC7C,MAAM,KAAK,GAAG;wBACZ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;wBACnB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC1C,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;qBACjB,CAAC;oBACF,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;oBAC9C,MAAM,CAAC,CAAC,IAAI,MAAM,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,CAAC,CAAC,CAAC;IACd,UAAU,CAAC,CAAC,CAAC,CAAC;AAChB,CAAC,CAAC,CAAC"}

package/dist/src/core/position-strings/test/find-position.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=find-position.test.d.ts.map

package/dist/src/core/position-strings/test/find-position.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-position.test.d.ts","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/find-position.test.ts"],"names":[],"mappings":""}

package/dist/src/core/position-strings/test/find-position.test.js

@@ -1,48 +0,0 @@
-import { assert } from 'chai';
-import { beforeEach, describe, it } from 'vitest';
-import { findPosition } from '../find-position.js';
-import { IDs } from '../ids.js';
-import { PositionSource } from '../position-source.js';
-describe('findPosition', () => {
-    let source;
-    beforeEach(() => {
-        source = new PositionSource({ ID: IDs.random() });
-    });
-    function testLength(len) {
-        let list;
-        describe(`length ${len}`, () => {
-            beforeEach(() => {
-                list = [];
-                for (let i = 0; i < len; i++) {
-                    list.push(source.createBetween(list.at(-1), undefined));
-                }
-            });
-            it('present', () => {
-                for (let i = 0; i < list.length; i++) {
-                    assert.deepStrictEqual(findPosition(list[i], list), {
-                        index: i,
-                        isPresent: true,
-                    });
-                }
-            });
-            it('not present', () => {
-                for (let i = 0; i <= list.length; i++) {
-                    const newPos = source.createBetween(list[i - 1], list[i]);
-                    // newPos would be at index i if present (between the current
-                    // i - 1 & i).
-                    assert.deepStrictEqual(findPosition(newPos, list), {
-                        index: i,
-                        isPresent: false,
-                    });
-                }
-            });
-        });
-    }
-    testLength(32);
-    testLength(31);
-    testLength(33);
-    testLength(23);
-    testLength(1);
-    testLength(0);
-});
-//# sourceMappingURL=find-position.test.js.map

package/dist/src/core/position-strings/test/find-position.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-position.test.js","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/find-position.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAElD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAChC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAEvD,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAI,MAAuB,CAAC;IAE5B,UAAU,CAAC,GAAG,EAAE;QACd,MAAM,GAAG,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,SAAS,UAAU,CAAC,GAAW;QAC7B,IAAI,IAAe,CAAC;QAEpB,QAAQ,CAAC,UAAU,GAAG,EAAE,EAAE,GAAG,EAAE;YAC7B,UAAU,CAAC,GAAG,EAAE;gBACd,IAAI,GAAG,EAAE,CAAC;gBACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;gBACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,MAAM,CAAC,eAAe,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAW,EAAE,IAAI,CAAC,EAAE;wBAC5D,KAAK,EAAE,CAAC;wBACR,SAAS,EAAE,IAAI;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;gBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1D,6DAA6D;oBAC7D,cAAc;oBACd,MAAM,CAAC,eAAe,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;wBACjD,KAAK,EAAE,CAAC;wBACR,SAAS,EAAE,KAAK;qBACjB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,EAAE,CAAC,CAAC;IACf,UAAU,CAAC,CAAC,CAAC,CAAC;IACd,UAAU,CAAC,CAAC,CAAC,CAAC;AAChB,CAAC,CAAC,CAAC"}

package/dist/src/core/position-strings/test/fuzz.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=fuzz.test.d.ts.map

package/dist/src/core/position-strings/test/fuzz.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fuzz.test.d.ts","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/fuzz.test.ts"],"names":[],"mappings":""}

package/dist/src/core/position-strings/test/fuzz.test.js

@@ -1,78 +0,0 @@
-import seedrandom from "seedrandom";
-import { assertIsOrdered, newSources, testUniqueAfterDelete } from "./util";
-describe("fuzz", () => {
-    describe("sequential", () => {
-        describe("1 user", () => sequential(1));
-        describe("10 users", () => sequential(10));
-    });
-});
-function sequential(numUsers) {
-    let rng;
-    beforeEach(() => {
-        rng = seedrandom("42");
-    });
-    it("random", () => {
-        const sources = newSources(rng, numUsers);
-        // Randomly create positions in a single list, simulating sequential access.
-        const list = [];
-        for (let i = 0; i < 1000; i++) {
-            const source = sources[Math.floor(rng() * sources.length)];
-            const index = Math.floor(rng() * (list.length + 1));
-            // Out-of-bounds okay.
-            const newPosition = source.createBetween(list[index - 1], list[index]);
-            list.splice(index, 0, newPosition);
-        }
-        assertIsOrdered(list);
-        testUniqueAfterDelete(list, sources[0]);
-    });
-    it("random LtR runs", () => {
-        const sources = newSources(rng, numUsers);
-        // Randomly create positions in a single list, simulating sequential access.
-        // This time, create short LtR runs at a time.
-        const list = [];
-        for (let i = 0; i < 200; i++) {
-            const source = sources[Math.floor(rng() * sources.length)];
-            const index = Math.floor(rng() * (list.length + 1));
-            // Out-of-bounds okay.
-            for (let j = 0; j < 5; j++) {
-                const newPosition = source.createBetween(list[index - 1 + j], list[index + j]);
-                list.splice(index + j, 0, newPosition);
-            }
-        }
-        assertIsOrdered(list);
-        testUniqueAfterDelete(list, sources[0]);
-    });
-    it("random RtL runs", () => {
-        const sources = newSources(rng, numUsers);
-        // Randomly create positions in a single list, simulating sequential access.
-        // This time, create short RtL runs at a time.
-        const list = [];
-        for (let i = 0; i < 200; i++) {
-            const source = sources[Math.floor(rng() * sources.length)];
-            const index = Math.floor(rng() * (list.length + 1));
-            // Out-of-bounds okay.
-            for (let j = 0; j < 5; j++) {
-                const newPosition = source.createBetween(list[index - 1], list[index]);
-                list.splice(index, 0, newPosition);
-            }
-        }
-        assertIsOrdered(list);
-        testUniqueAfterDelete(list, sources[0]);
-    });
-    it("biased", () => {
-        const sources = newSources(rng, numUsers);
-        // Randomly create positions in a single list, simulating sequential access.
-        // This time, bias towards smaller indices using a sqrt.
-        const list = [];
-        for (let i = 0; i < 1000; i++) {
-            const source = sources[Math.floor(Math.sqrt(rng() * sources.length * sources.length))];
-            const index = Math.floor(rng() * (list.length + 1));
-            // Out-of-bounds okay.
-            const newPosition = source.createBetween(list[index - 1], list[index]);
-            list.splice(index, 0, newPosition);
-        }
-        assertIsOrdered(list);
-        testUniqueAfterDelete(list, sources[0]);
-    });
-}
-//# sourceMappingURL=fuzz.test.js.map

package/dist/src/core/position-strings/test/fuzz.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fuzz.test.js","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/fuzz.test.ts"],"names":[],"mappings":"AAAA,OAAO,UAAU,MAAM,YAAY,CAAC;AACpC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,qBAAqB,EAAE,MAAM,QAAQ,CAAC;AAE5E,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;IACpB,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC1B,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,SAAS,UAAU,CAAC,QAAgB;IAClC,IAAI,GAAqB,CAAC;IAE1B,UAAU,CAAC,GAAG,EAAE;QACd,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QAChB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAE1C,4EAA4E;QAC5E,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACpD,sBAAsB;YACtB,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QACrC,CAAC;QAED,eAAe,CAAC,IAAI,CAAC,CAAC;QACtB,qBAAqB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAE1C,4EAA4E;QAC5E,8CAA8C;QAC9C,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACpD,sBAAsB;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CACtC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,EACnB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAChB,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,eAAe,CAAC,IAAI,CAAC,CAAC;QACtB,qBAAqB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAE1C,4EAA4E;QAC5E,8CAA8C;QAC9C,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACpD,sBAAsB;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACvE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,eAAe,CAAC,IAAI,CAAC,CAAC;QACtB,qBAAqB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QAChB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAE1C,4EAA4E;QAC5E,wDAAwD;QACxD,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,MAAM,GACV,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACpD,sBAAsB;YACtB,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QACrC,CAAC;QAED,eAAe,CAAC,IAAI,CAAC,CAAC;QACtB,qBAAqB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/src/core/position-strings/test/ids.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=ids.test.d.ts.map

package/dist/src/core/position-strings/test/ids.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ids.test.d.ts","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/ids.test.ts"],"names":[],"mappings":""}

package/dist/src/core/position-strings/test/ids.test.js

@@ -1,17 +0,0 @@
-import { assert } from "chai";
-import { PositionSource } from "../src";
-describe("IDs", () => {
-    describe("validate", () => {
-        it("rejects period", () => {
-            assert.throws(() => new PositionSource({ ID: "ali.ce" }));
-        });
-        it("rejects comma", () => {
-            assert.throws(() => new PositionSource({ ID: "ali,ce" }));
-        });
-        it("rejects LAST or greater", () => {
-            assert.throws(() => new PositionSource({ ID: PositionSource.LAST }));
-            assert.throws(() => new PositionSource({ ID: PositionSource.LAST + "alice" }));
-        });
-    });
-});
-//# sourceMappingURL=ids.test.js.map

package/dist/src/core/position-strings/test/ids.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ids.test.js","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/ids.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,cAAc,EAAE,MAAM,QAAQ,CAAC;AAExC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;IACnB,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACxB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACvB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACrE,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,CAAC,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,cAAc,CAAC,IAAI,GAAG,OAAO,EAAE,CAAC,CAChE,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/core/position-strings/test/manual.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=manual.test.d.ts.map

package/dist/src/core/position-strings/test/manual.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"manual.test.d.ts","sourceRoot":"","sources":["../../../../../src/core/position-strings/test/manual.test.ts"],"names":[],"mappings":""}