@fluid-experimental/tree 0.58.2002 → 0.58.3000-61081

package/dist/id-compressor/NumericUuid.js

@@ -0,0 +1,377 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ensureSessionUuid = exports.incrementUuid = exports.numericUuidEquals = exports.createSessionId = exports.isStableId = exports.assertIsStableId = exports.numericUuidFromStableId = exports.stableIdFromNumericUuid = exports.getPositiveDelta = void 0;
+/* eslint-disable no-bitwise */
+const uuid_1 = require("uuid");
+const Common_1 = require("../Common");
+const bitsInNumericUuidInteger = 52; // Not tunable. Do not change.
+const nibblesInNumericUuidInteger = bitsInNumericUuidInteger / 4;
+const stringEntryLength = 22;
+const maxNumericUuidInteger = 2 ** bitsInNumericUuidInteger - 1;
+const fiftyThirdBit = 2 ** 52;
+/**
+ * Calculates the numeric delta between a and b (i.e. a - b).
+ * @param a an uuid
+ * @param b an other uuid
+ * @param maxDelta the maximum integer delta (inclusive) to tolerate.
+ * @returns undefined if the delta is negative or greater than `maxDelta`
+ */
+function getPositiveDelta(a, b, maxDelta) {
+    const [stringEntryA, lowNumberA] = a;
+    const [stringEntryB, lowNumberB] = b;
+    if (stringEntryA === stringEntryB) {
+        const difference = lowNumberA - lowNumberB;
+        if (difference >= 0 && difference <= maxDelta) {
+            return difference;
+        }
+        return undefined;
+    }
+    const highNumberA = Number.parseInt(ChunkMath.Upper.parse(stringEntryA), 16);
+    const highNumberB = Number.parseInt(ChunkMath.Upper.parse(stringEntryB), 16);
+    let subtractHigh = highNumberA - highNumberB;
+    if (Math.abs(subtractHigh) > 1) {
+        // If the high bits differ by more than 1, then there is no chance that any lower bits could compensate
+        return undefined;
+    }
+    let midNumberA = ChunkMath.getNumericValue(ChunkMath.Variant.parse(stringEntryA));
+    const midNumberB = ChunkMath.getNumericValue(ChunkMath.Variant.parse(stringEntryB));
+    let subtractLow = lowNumberA - lowNumberB;
+    if (subtractLow < 0) {
+        midNumberA -= 1;
+        subtractLow += fiftyThirdBit;
+    }
+    let subtractMid = midNumberA - midNumberB;
+    if (subtractMid < 0) {
+        subtractHigh -= 1;
+        subtractMid += ChunkMath.twentyThirdBit;
+    }
+    if (subtractHigh !== 0) {
+        // a < b, no positive delta, or
+        // a > b by much more than MAX_SAFE_INTEGER
+        return undefined;
+    }
+    if (subtractMid > 1) {
+        return undefined;
+    }
+    else {
+        const trueDelta = fiftyThirdBit * subtractMid + subtractLow;
+        return trueDelta > maxDelta ? undefined : trueDelta;
+    }
+}
+exports.getPositiveDelta = getPositiveDelta;
+// Pre-allocated array of strings of zeros.
+// Used to pad hex strings up to 52 bits
+const zeros = [];
+for (let i = 0; i < nibblesInNumericUuidInteger; i++) {
+    zeros.push('0'.repeat(i));
+}
+function padToLengthWithZeros(str, count) {
+    return str.length === count ? str : zeros[count - str.length] + str;
+}
+/**
+ * @param offset an optional offset to increment the returned StableId
+ * @returns the string representation of a `NumericUuid`.
+ */
+function stableIdFromNumericUuid(uuid, offset = 0) {
+    const lowerAdd = uuid[1] + offset;
+    // Common fast-path
+    if (lowerAdd <= maxNumericUuidInteger) {
+        const lowerString = padToLengthWithZeros(lowerAdd.toString(16), nibblesInNumericUuidInteger);
+        return `${uuid[0] + lowerString.slice(0, 1)}-${lowerString.slice(1)}`;
+    }
+    return stableIdFromNumericUuid(incrementUuid(uuid, offset));
+}
+exports.stableIdFromNumericUuid = stableIdFromNumericUuid;
+/**
+ * @param stableId a minimal uuid string
+ * @returns a numeric representation of `stableId`.
+ */
+function numericUuidFromStableId(stableId) {
+    const uuid = new Array(2);
+    uuid[0] = stableId.slice(0, stringEntryLength);
+    uuid[1] = Number.parseInt(ChunkMath.Lower.parse(stableId), 16);
+    return uuid;
+}
+exports.numericUuidFromStableId = numericUuidFromStableId;
+/**
+ * Asserts that the supplied uuid is a stable ID.
+ */
+function assertIsStableId(uuid) {
+    Common_1.assert(isStableId(uuid), `${uuid} is not a StableId.`);
+    return uuid;
+}
+exports.assertIsStableId = assertIsStableId;
+const charCode0 = '0'.charCodeAt(0);
+const charCode9 = '9'.charCodeAt(0);
+const charCodea = 'a'.charCodeAt(0);
+const charCodef = 'f'.charCodeAt(0);
+const charCodeA = 'A'.charCodeAt(0);
+const charCodeF = 'F'.charCodeAt(0);
+/**
+ * Returns whether the supplied string is a v4 variant 2 uuid.
+ */
+function isStableId(str) {
+    if (str.length !== 36) {
+        return false;
+    }
+    for (let i = 0; i < str.length; i++) {
+        switch (i) {
+            case 8:
+            case 13:
+            case 18:
+            case 23: {
+                if (str.charAt(i) !== '-') {
+                    return false;
+                }
+                break;
+            }
+            case 14: {
+                if (str.charAt(i) !== '4') {
+                    return false;
+                }
+                break;
+            }
+            case 19: {
+                const c = str.charAt(i);
+                if (c !== '8' && c !== '9' && c !== 'a' && c !== 'b') {
+                    return false;
+                }
+                break;
+            }
+            default: {
+                const code = str.charCodeAt(i);
+                const isUuidChar = (code >= charCode0 && code <= charCode9) ||
+                    (code >= charCodea && code <= charCodef) ||
+                    (code >= charCodeA && code <= charCodeF);
+                if (!isUuidChar) {
+                    return false;
+                }
+                break;
+            }
+        }
+    }
+    return true;
+}
+exports.isStableId = isStableId;
+/**
+ * Creates a session base ID.
+ * This method (rather than standard uuid generation methods) should be used to generate session IDs.
+ */
+function createSessionId() {
+    const uuid = assertIsStableId(uuid_1.v4());
+    return ensureSessionUuid(uuid);
+}
+exports.createSessionId = createSessionId;
+/**
+ * Compares numeric uuids for equality.
+ */
+function numericUuidEquals(a, b) {
+    return a[0] === b[0] && a[1] === b[1];
+}
+exports.numericUuidEquals = numericUuidEquals;
+/**
+ * The maximum value that can be contained in the upper string region of a numeric UUID (i.e. the string region excluding the version
+ * nibble and the variant chunk)
+ */
+const maxUpperNumber = 2 ** 48 - 1;
+/**
+ * Increments the uuid. `amount` must be a positive integer.
+ * @returns the result of incrementing the uuid by `amount`.`
+ */
+function incrementUuid(uuid, amount) {
+    /*
+     * UUIDs incremented beyond the max UUID "ffffffff-ffff-4fff-bfff-ffffffffffff" will cause a failure.
+     * Also, some reserved bits of the v4 UUID must be treated as immutable (e.g. the version and
+     * variant bits) and thus must not be incremented.
+     */
+    let newUuid;
+    const result = uuid[1] + amount;
+    if (result <= maxNumericUuidInteger) {
+        // The new number still fits within the number region of a numeric UUID.
+        // Incrementing is usually done with small amounts, so this is the dominantly common case.
+        newUuid = [uuid[0], result];
+    }
+    else {
+        // The numeric UUID's number region has overflowed. We will need to carry the overflow into the variant chunk (see `VariantChunk`).
+        /** The amount left over after filling up the rest of the uuid's number region with the increment amount */
+        const remainder = amount - (maxNumericUuidInteger - uuid[1]) - 1;
+        const stringEntry = uuid[0];
+        const [newVariantChunkString, carried] = ChunkMath.increment(stringEntry);
+        if (carried) {
+            // The variant chunk itself also overflowed. We'll need to carry the overflow further, into the upper string region of the UUID.
+            const upperString = ChunkMath.Upper.parse(stringEntry);
+            const upperNumber = Number.parseInt(upperString, 16);
+            Common_1.assert(upperNumber <= maxUpperNumber);
+            const newUpperNumber = upperNumber + 1;
+            if (newUpperNumber > maxUpperNumber) {
+                Common_1.fail('Exceeded maximum numeric UUID');
+            }
+            else {
+                // The variant chunk overflowed but the upper string region did not. Splice in the incremented string region.
+                const newUpperChunk = padToLengthWithZeros(newUpperNumber.toString(16), 12);
+                newUuid = [
+                    `${ChunkMath.Upper.hyphenate(newUpperChunk)}-4${ChunkMath.Variant.hyphenate(newVariantChunkString)}`,
+                    remainder,
+                ];
+            }
+        }
+        else {
+            // The variant chunk did not overflow, so just splice it back in.
+            newUuid = [
+                `${ChunkMath.Upper.slice(stringEntry)}-4${ChunkMath.Variant.hyphenate(newVariantChunkString)}`,
+                remainder,
+            ];
+        }
+    }
+    return newUuid;
+}
+exports.incrementUuid = incrementUuid;
+var ChunkMath;
+(function (ChunkMath) {
+    /*
+     * Recall the UUID diagram from the top of this file which describes the layout of a Numeric UUID. To implement addition, we define
+     * another region called the "variant chunk" which overlaps with the "string" region. Note that it is just beneath the required v4 uuid
+     * version identifier (the 13th nibble 'V' which is always '4' in a v4 UUID) and just above the "number" region of the layout. It
+     * contains inside of it the v4 UUID variant identifier bits as well (see https://datatracker.ietf.org/doc/html/rfc4122#section-4.1.1).
+     *
+     * UUUUUUUU-UUUU-VUUU-vUUU-UUUUUUUUUUUU - the uuid
+     * SSSSSSSS SSSS SSSS SSS               - array[0]: string
+     *                       N NNNNNNNNNNNN - array[1]: integer
+     *                VVV-VVV               - the variant chunk
+     *
+     * By defining the variant chunk in this way it is simple to splice in the v4 UUID version identifier ('V') just above it and any
+     * "bit math" required due to the fact that the variant identifier bits ('v') do not fill up an entire nibble is handled within it.
+     * The variant chunk is made up of 6 nibbles. Note the "vv" which denotes the two bits used for the v4 UUID variant identifier:
+     *
+     * AAAA BBBB CCCC vvDD EEEE FFFF
+     *
+     * Since we'll be needing to "skip" the variant bits ("vv") when doing addition, we define a a few masks which will be used below to
+     * separate the variant chunk into pieces before recombining it:
+     */
+    //                                         AAAA BBBB CCCC vvDD EEEE FFFF
+    const upperVariantChunkMask = 0xfff000; // XXXX XXXX XXXX
+    const variantBitMask = 0x800; //                          XX
+    const middleVariantChunkMask = 0x300; //                    XX
+    const lowerVariantChunkMask = 0xff; //                         XXXX XXXX
+    /** The maximum numeric value that can be represented by the numerically relevant bits in the variant chunk */
+    const maxVariantNumber = 2 ** 22 - 1;
+    ChunkMath.twentyThirdBit = 2 ** 22;
+    /** the upper chunk, denoted by 'U's in UUUUUUUU-UUUU-VVVV-vVVL-LLLLLLLLLLLL */
+    let Upper;
+    (function (Upper) {
+        function parse(stringEntry) {
+            return stringEntry.slice(0, 8) + stringEntry.slice(9, 13);
+        }
+        Upper.parse = parse;
+        function hyphenate(upperChunk) {
+            return `${upperChunk.slice(0, 8)}-${upperChunk.slice(8)}`;
+        }
+        Upper.hyphenate = hyphenate;
+        function slice(stringEntry) {
+            return stringEntry.slice(0, 13);
+        }
+        Upper.slice = slice;
+    })(Upper = ChunkMath.Upper || (ChunkMath.Upper = {}));
+    /** the variant chunk, denoted by 'V's in UUUUUUUU-UUUU-VVVV-vVVL-LLLLLLLLLLLL */
+    let Variant;
+    (function (Variant) {
+        function parse(stringEntry) {
+            return stringEntry.slice(15, 18) + stringEntry.slice(19, 22);
+        }
+        Variant.parse = parse;
+        function hyphenate(variantChunk) {
+            return `${variantChunk.slice(0, 3)}-${variantChunk.slice(3)}`;
+        }
+        Variant.hyphenate = hyphenate;
+    })(Variant = ChunkMath.Variant || (ChunkMath.Variant = {}));
+    /** the lower chunk, denoted by 'L's in UUUUUUUU-UUUU-VVVV-vVVL-LLLLLLLLLLLL */
+    let Lower;
+    (function (Lower) {
+        function parse(stableId) {
+            return stableId.slice(stringEntryLength, stringEntryLength + 1) + stableId.slice(stringEntryLength + 2);
+        }
+        Lower.parse = parse;
+        function hyphenate(lowerChunk) {
+            return `${lowerChunk.slice(0, 1)}-${lowerChunk.slice(1)}`;
+        }
+        Lower.hyphenate = hyphenate;
+    })(Lower = ChunkMath.Lower || (ChunkMath.Lower = {}));
+    /**
+     * Returns the number representation of the given bits corresponding to the variant chunk. The value is derived by parsing all bits
+     * except for reserved bits (i.e. the variant bits).
+     * @param variantChunkBits
+     */
+    function getNumericValue(variantChunk) {
+        const variantChunkBits = Number.parseInt(variantChunk, 16);
+        const upperVariantBits = (variantChunkBits & upperVariantChunkMask) >> 2;
+        const middleVariantBits = variantChunkBits & middleVariantChunkMask;
+        const lowerVariantBits = variantChunkBits & lowerVariantChunkMask;
+        return upperVariantBits + middleVariantBits + lowerVariantBits;
+    }
+    ChunkMath.getNumericValue = getNumericValue;
+    /**
+     * Given the string portion of a numeric uuid, add one to it.
+     * @returns the resulting hex string and whether or not the new value overflowed, i.e. it exceeds `maxVariantNumber`. In this case,
+     * the resulting hex string will wrap around to its minimum value '000b00'
+     */
+    function increment(stringEntry) {
+        // To implement addition, the variant identifier bits are extracted from the variant chunk, the chunk is interpreted as a number,
+        // that number is incremented by 1, and then the variant identifier bits are returned as we convert the number back into a hex
+        // string.
+        // This diagram may be helpful for seeing how the nibbles line up before and after the variant identifier bits are extracted. The
+        // letters used for each nibble ("AAAA", "BBBB") etc. are arbitrary and are simply there to differentiate the nibbles as they shift.
+        // --------------------------------
+        // 1. AAAA BBBB CCCC vvDD EEEE FFFF
+        // 2.   AA AABB BBCC CCDD EEEE FFFF
+        // 3.   AA AABB BBCC CCDD EEEE FFFF
+        //                              + 1
+        //    = GG GGHH HHII IIJJ JJKK KKLL
+        // 4. GGGG HHHH IIII vvJJ JJKK KKLL
+        // 1. The variant chunk is given as a 6 character (6 nibble) hex string, where the fourth nibble contains the variant bits
+        // 2. The numerically important bits (i.e. not the variant identifier bits vv which are constant) are extracted into a single number
+        const variantChunk = Variant.parse(stringEntry);
+        const variantNumber = getNumericValue(variantChunk);
+        Common_1.assert(variantNumber <= maxVariantNumber);
+        // 3. Add one to the variant number to produce our new variant number.
+        const newVariantNumber = variantNumber + 1;
+        // 4. The variant identifier bits are added back into the number, which is then turned back into a hex string
+        const newUpperVariantBits = (newVariantNumber & (upperVariantChunkMask >> 2)) << 2;
+        const newMiddleVariantBits = (newVariantNumber & middleVariantChunkMask) | variantBitMask; // Add the variant bits back in
+        const newLowerVariantBits = newVariantNumber & lowerVariantChunkMask;
+        const newVariantChunkBits = newUpperVariantBits + newMiddleVariantBits + newLowerVariantBits;
+        const newVariantChunk = padToLengthWithZeros(newVariantChunkBits.toString(16), variantChunk.length);
+        return [newVariantChunk, newVariantNumber > maxVariantNumber];
+    }
+    ChunkMath.increment = increment;
+})(ChunkMath || (ChunkMath = {}));
+const maxUpperUuid = 'ffffffff-ffff-4fff-bf';
+const maxNibbleCount = [...maxUpperUuid].filter((n) => n === 'f').length;
+const newNibbles = ['7', 'b', 'd', 'e'];
+function isMaxUpperNibble(index) {
+    return maxUpperUuid.charAt(index) === 'f';
+}
+/**
+ * Any session uuid with all of its highish bits set is in danger of overflowing after fewer than 2^53 increments.
+ * By zeroing one of those bits at random, potential overflow is prevented.
+ */
+function ensureSessionUuid(uuid) {
+    if (uuid.startsWith(maxUpperUuid)) {
+        const targetNibble = Math.floor(Math.random() * maxNibbleCount);
+        let actualIndex = 0;
+        for (let nibbleIndex = 0; nibbleIndex < targetNibble && !isMaxUpperNibble(actualIndex); actualIndex += 1) {
+            if (isMaxUpperNibble(actualIndex)) {
+                nibbleIndex++;
+            }
+        }
+        const newNibble = newNibbles[Math.floor(Math.random() * newNibbles.length)]; // Randomly choose a bit to zero
+        const newUuid = uuid.slice(0, actualIndex) + newNibble + uuid.slice(actualIndex + 1);
+        return newUuid;
+    }
+    return uuid;
+}
+exports.ensureSessionUuid = ensureSessionUuid;
+//# sourceMappingURL=NumericUuid.js.map

package/dist/id-compressor/NumericUuid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NumericUuid.js","sourceRoot":"","sources":["../../src/id-compressor/NumericUuid.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+BAA+B;AAE/B,+BAA0B;AAC1B,sCAAyC;AAgBzC,MAAM,wBAAwB,GAAG,EAAE,CAAC,CAAC,8BAA8B;AACnE,MAAM,2BAA2B,GAAG,wBAAwB,GAAG,CAAC,CAAC;AACjE,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAC7B,MAAM,qBAAqB,GAAG,CAAC,IAAI,wBAAwB,GAAG,CAAC,CAAC;AAChE,MAAM,aAAa,GAAG,CAAC,IAAI,EAAE,CAAC;AAE9B;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAAC,CAAc,EAAE,CAAc,EAAE,QAAgB;IAChF,MAAM,CAAC,YAAY,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC;IACrC,MAAM,CAAC,YAAY,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC;IAErC,IAAI,YAAY,KAAK,YAAY,EAAE;QAClC,MAAM,UAAU,GAAG,UAAU,GAAG,UAAU,CAAC;QAC3C,IAAI,UAAU,IAAI,CAAC,IAAI,UAAU,IAAI,QAAQ,EAAE;YAC9C,OAAO,UAAU,CAAC;SAClB;QACD,OAAO,SAAS,CAAC;KACjB;IAED,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC;IAC7E,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC;IAE7E,IAAI,YAAY,GAAG,WAAW,GAAG,WAAW,CAAC;IAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE;QAC/B,uGAAuG;QACvG,OAAO,SAAS,CAAC;KACjB;IAED,IAAI,UAAU,GAAG,SAAS,CAAC,eAAe,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;IAClF,MAAM,UAAU,GAAG,SAAS,CAAC,eAAe,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;IAEpF,IAAI,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC;IAC1C,IAAI,WAAW,GAAG,CAAC,EAAE;QACpB,UAAU,IAAI,CAAC,CAAC;QAChB,WAAW,IAAI,aAAa,CAAC;KAC7B;IAED,IAAI,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC;IAC1C,IAAI,WAAW,GAAG,CAAC,EAAE;QACpB,YAAY,IAAI,CAAC,CAAC;QAClB,WAAW,IAAI,SAAS,CAAC,cAAc,CAAC;KACxC;IAED,IAAI,YAAY,KAAK,CAAC,EAAE;QACvB,+BAA+B;QAC/B,2CAA2C;QAC3C,OAAO,SAAS,CAAC;KACjB;IAED,IAAI,WAAW,GAAG,CAAC,EAAE;QACpB,OAAO,SAAS,CAAC;KACjB;SAAM;QACN,MAAM,SAAS,GAAG,aAAa,GAAG,WAAW,GAAG,WAAW,CAAC;QAC5D,OAAO,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;KACpD;AACF,CAAC;AAhDD,4CAgDC;AAED,2CAA2C;AAC3C,wCAAwC;AACxC,MAAM,KAAK,GAAa,EAAE,CAAC;AAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,2BAA2B,EAAE,CAAC,EAAE,EAAE;IACrD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CAC1B;AAED,SAAS,oBAAoB,CAAC,GAAW,EAAE,KAAa;IACvD,OAAO,GAAG,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;AACrE,CAAC;AAED;;;GAGG;AACH,SAAgB,uBAAuB,CAAC,IAAiB,EAAE,MAAM,GAAG,CAAC;IACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAClC,mBAAmB;IACnB,IAAI,QAAQ,IAAI,qBAAqB,EAAE;QACtC,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;QAC7F,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAc,CAAC;KAClF;IACD,OAAO,uBAAuB,CAAC,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAC7D,CAAC;AARD,0DAQC;AAED;;;GAGG;AACH,SAAgB,uBAAuB,CAAC,QAAkB;IACzD,MAAM,IAAI,GAAwB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC/C,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;IAC/D,OAAO,IAAmD,CAAC;AAC5D,CAAC;AALD,0DAKC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAC,IAAY;IAC5C,eAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,qBAAqB,CAAC,CAAC;IACvD,OAAO,IAAI,CAAC;AACb,CAAC;AAHD,4CAGC;AAED,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACpC,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACpC,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACpC,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACpC,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACpC,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAEpC;;GAEG;AACH,SAAgB,UAAU,CAAC,GAAW;IACrC,IAAI,GAAG,CAAC,MAAM,KAAK,EAAE,EAAE;QACtB,OAAO,KAAK,CAAC;KACb;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,QAAQ,CAAC,EAAE;YACV,KAAK,CAAC,CAAC;YACP,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,CAAC,CAAC;gBACR,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;oBAC1B,OAAO,KAAK,CAAC;iBACb;gBACD,MAAM;aACN;YAED,KAAK,EAAE,CAAC,CAAC;gBACR,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;oBAC1B,OAAO,KAAK,CAAC;iBACb;gBACD,MAAM;aACN;YAED,KAAK,EAAE,CAAC,CAAC;gBACR,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE;oBACrD,OAAO,KAAK,CAAC;iBACb;gBACD,MAAM;aACN;YAED,OAAO,CAAC,CAAC;gBACR,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,UAAU,GACf,CAAC,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC;oBACxC,CAAC,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC;oBACxC,CAAC,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,CAAC;gBAE1C,IAAI,CAAC,UAAU,EAAE;oBAChB,OAAO,KAAK,CAAC;iBACb;gBACD,MAAM;aACN;SACD;KACD;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAhDD,gCAgDC;AAED;;;GAGG;AACH,SAAgB,eAAe;IAC9B,MAAM,IAAI,GAAG,gBAAgB,CAAC,SAAE,EAAE,CAAC,CAAC;IACpC,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC;AAHD,0CAGC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAAC,CAAc,EAAE,CAAc;IAC/D,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AAFD,8CAEC;AAED;;;GAGG;AACH,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AAEnC;;;GAGG;AACH,SAAgB,aAAa,CAAC,IAAiB,EAAE,MAAc;IAC9D;;;;OAIG;IACH,IAAI,OAAyB,CAAC;IAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAChC,IAAI,MAAM,IAAI,qBAAqB,EAAE;QACpC,wEAAwE;QACxE,0FAA0F;QAC1F,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;KAC5B;SAAM;QACN,mIAAmI;QACnI,2GAA2G;QAC3G,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,qBAAqB,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,qBAAqB,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAE1E,IAAI,OAAO,EAAE;YACZ,gIAAgI;YAChI,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACvD,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;YACrD,eAAM,CAAC,WAAW,IAAI,cAAc,CAAC,CAAC;YACtC,MAAM,cAAc,GAAG,WAAW,GAAG,CAAC,CAAC;YACvC,IAAI,cAAc,GAAG,cAAc,EAAE;gBACpC,aAAI,CAAC,+BAA+B,CAAC,CAAC;aACtC;iBAAM;gBACN,6GAA6G;gBAC7G,MAAM,aAAa,GAAG,oBAAoB,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC5E,OAAO,GAAG;oBACT,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,aAAa,CAAC,KAAK,SAAS,CAAC,OAAO,CAAC,SAAS,CAC1E,qBAAqB,CACrB,EAAE;oBACH,SAAS;iBACT,CAAC;aACF;SACD;aAAM;YACN,iEAAiE;YACjE,OAAO,GAAG;gBACT,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,qBAAqB,CAAC,EAAE;gBAC9F,SAAS;aACT,CAAC;SACF;KACD;IAED,OAAO,OAAmD,CAAC;AAC5D,CAAC;AA/CD,sCA+CC;AAED,IAAU,SAAS,CAsHlB;AAtHD,WAAU,SAAS;IAClB;;;;;;;;;;;;;;;;;;;OAmBG;IAEH,wEAAwE;IACxE,MAAM,qBAAqB,GAAG,QAAQ,CAAC,CAAC,iBAAiB;IACzD,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,8BAA8B;IAC5D,MAAM,sBAAsB,GAAG,KAAK,CAAC,CAAC,wBAAwB;IAC9D,MAAM,qBAAqB,GAAG,IAAI,CAAC,CAAC,oCAAoC;IAExE,8GAA8G;IAC9G,MAAM,gBAAgB,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAExB,wBAAc,GAAG,CAAC,IAAI,EAAE,CAAC;IAEtC,+EAA+E;IAC/E,IAAiB,KAAK,CAYrB;IAZD,WAAiB,KAAK;QACrB,SAAgB,KAAK,CAAC,WAAmB;YACxC,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3D,CAAC;QAFe,WAAK,QAEpB,CAAA;QAED,SAAgB,SAAS,CAAC,UAAkB;YAC3C,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,CAAC;QAFe,eAAS,YAExB,CAAA;QAED,SAAgB,KAAK,CAAC,WAAmB;YACxC,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;QAFe,WAAK,QAEpB,CAAA;IACF,CAAC,EAZgB,KAAK,GAAL,eAAK,KAAL,eAAK,QAYrB;IAED,iFAAiF;IACjF,IAAiB,OAAO,CAQvB;IARD,WAAiB,OAAO;QACvB,SAAgB,KAAK,CAAC,WAAmB;YACxC,OAAO,WAAW,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9D,CAAC;QAFe,aAAK,QAEpB,CAAA;QAED,SAAgB,SAAS,CAAC,YAAoB;YAC7C,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,CAAC;QAFe,iBAAS,YAExB,CAAA;IACF,CAAC,EARgB,OAAO,GAAP,iBAAO,KAAP,iBAAO,QAQvB;IAED,+EAA+E;IAC/E,IAAiB,KAAK,CAQrB;IARD,WAAiB,KAAK;QACrB,SAAgB,KAAK,CAAC,QAAkB;YACvC,OAAO,QAAQ,CAAC,KAAK,CAAC,iBAAiB,EAAE,iBAAiB,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;QACzG,CAAC;QAFe,WAAK,QAEpB,CAAA;QAED,SAAgB,SAAS,CAAC,UAAkB;YAC3C,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,CAAC;QAFe,eAAS,YAExB,CAAA;IACF,CAAC,EARgB,KAAK,GAAL,eAAK,KAAL,eAAK,QAQrB;IAED;;;;OAIG;IACH,SAAgB,eAAe,CAAC,YAAoB;QACnD,MAAM,gBAAgB,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QAC3D,MAAM,gBAAgB,GAAG,CAAC,gBAAgB,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;QACzE,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,sBAAsB,CAAC;QACpE,MAAM,gBAAgB,GAAG,gBAAgB,GAAG,qBAAqB,CAAC;QAClE,OAAO,gBAAgB,GAAG,iBAAiB,GAAG,gBAAgB,CAAC;IAChE,CAAC;IANe,yBAAe,kBAM9B,CAAA;IAED;;;;OAIG;IACH,SAAgB,SAAS,CAAC,WAAmB;QAC5C,iIAAiI;QACjI,8HAA8H;QAC9H,UAAU;QAEV,iIAAiI;QACjI,oIAAoI;QACpI,mCAAmC;QACnC,mCAAmC;QACnC,mCAAmC;QACnC,mCAAmC;QACnC,mCAAmC;QACnC,mCAAmC;QACnC,mCAAmC;QAEnC,0HAA0H;QAC1H,oIAAoI;QACpI,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAChD,MAAM,aAAa,GAAG,eAAe,CAAC,YAAY,CAAC,CAAC;QACpD,eAAM,CAAC,aAAa,IAAI,gBAAgB,CAAC,CAAC;QAC1C,sEAAsE;QACtE,MAAM,gBAAgB,GAAG,aAAa,GAAG,CAAC,CAAC;QAC3C,6GAA6G;QAC7G,MAAM,mBAAmB,GAAG,CAAC,gBAAgB,GAAG,CAAC,qBAAqB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnF,MAAM,oBAAoB,GAAG,CAAC,gBAAgB,GAAG,sBAAsB,CAAC,GAAG,cAAc,CAAC,CAAC,+BAA+B;QAC1H,MAAM,mBAAmB,GAAG,gBAAgB,GAAG,qBAAqB,CAAC;QACrE,MAAM,mBAAmB,GAAG,mBAAmB,GAAG,oBAAoB,GAAG,mBAAmB,CAAC;QAC7F,MAAM,eAAe,GAAG,oBAAoB,CAAC,mBAAmB,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;QACpG,OAAO,CAAC,eAAe,EAAE,gBAAgB,GAAG,gBAAgB,CAAC,CAAC;IAC/D,CAAC;IA7Be,mBAAS,YA6BxB,CAAA;AACF,CAAC,EAtHS,SAAS,KAAT,SAAS,QAsHlB;AAED,MAAM,YAAY,GAAG,uBAAuB,CAAC;AAC7C,MAAM,cAAc,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;AACzE,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACxC,SAAS,gBAAgB,CAAC,KAAa;IACtC,OAAO,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;AAC3C,CAAC;AAED;;;GAGG;AACH,SAAgB,iBAAiB,CAAC,IAAc;IAC/C,IAAI,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE;QAClC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC;QAChE,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,YAAY,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE;YACzG,IAAI,gBAAgB,CAAC,WAAW,CAAC,EAAE;gBAClC,WAAW,EAAE,CAAC;aACd;SACD;QAED,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,gCAAgC;QAC7G,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QACrF,OAAO,OAAoB,CAAC;KAC5B;IAED,OAAO,IAAiB,CAAC;AAC1B,CAAC;AAhBD,8CAgBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { v4 } from 'uuid';\nimport { assert, fail } from '../Common';\nimport { SessionId, StableId } from '../Identifiers';\n\n/**\n * A UUID (128 bit identifier) optimized for use as a 128 bit unsigned integer with fast addition and toString operations.\n * The string entry is the upper 76 bits of the uuid and the integer entry holds the lower 52 bits:\n * UUUUUUUU-UUUU-VUUU-vUUU-UUUUUUUUUUUU - the uuid\n * SSSSSSSS-SSSS-SSSS-SSS               - array[0]: string\n *                       N NNNNNNNNNNNN - array[1]: integer\n * The integer keeps the common case cost of incrementing and computing deltas very low.\n * The string optimizes toString by caching the the majority of the resulting string.\n */\nexport type NumericUuid = readonly [string, number] & {\n\treadonly NumericUuid: '9132ea20-a811-4756-85f8-aa6da5ca90f8';\n};\n\nconst bitsInNumericUuidInteger = 52; // Not tunable. Do not change.\nconst nibblesInNumericUuidInteger = bitsInNumericUuidInteger / 4;\nconst stringEntryLength = 22;\nconst maxNumericUuidInteger = 2 ** bitsInNumericUuidInteger - 1;\nconst fiftyThirdBit = 2 ** 52;\n\n/**\n * Calculates the numeric delta between a and b (i.e. a - b).\n * @param a an uuid\n * @param b an other uuid\n * @param maxDelta the maximum integer delta (inclusive) to tolerate.\n * @returns undefined if the delta is negative or greater than `maxDelta`\n */\nexport function getPositiveDelta(a: NumericUuid, b: NumericUuid, maxDelta: number): number | undefined {\n\tconst [stringEntryA, lowNumberA] = a;\n\tconst [stringEntryB, lowNumberB] = b;\n\n\tif (stringEntryA === stringEntryB) {\n\t\tconst difference = lowNumberA - lowNumberB;\n\t\tif (difference >= 0 && difference <= maxDelta) {\n\t\t\treturn difference;\n\t\t}\n\t\treturn undefined;\n\t}\n\n\tconst highNumberA = Number.parseInt(ChunkMath.Upper.parse(stringEntryA), 16);\n\tconst highNumberB = Number.parseInt(ChunkMath.Upper.parse(stringEntryB), 16);\n\n\tlet subtractHigh = highNumberA - highNumberB;\n\tif (Math.abs(subtractHigh) > 1) {\n\t\t// If the high bits differ by more than 1, then there is no chance that any lower bits could compensate\n\t\treturn undefined;\n\t}\n\n\tlet midNumberA = ChunkMath.getNumericValue(ChunkMath.Variant.parse(stringEntryA));\n\tconst midNumberB = ChunkMath.getNumericValue(ChunkMath.Variant.parse(stringEntryB));\n\n\tlet subtractLow = lowNumberA - lowNumberB;\n\tif (subtractLow < 0) {\n\t\tmidNumberA -= 1;\n\t\tsubtractLow += fiftyThirdBit;\n\t}\n\n\tlet subtractMid = midNumberA - midNumberB;\n\tif (subtractMid < 0) {\n\t\tsubtractHigh -= 1;\n\t\tsubtractMid += ChunkMath.twentyThirdBit;\n\t}\n\n\tif (subtractHigh !== 0) {\n\t\t// a < b, no positive delta, or\n\t\t// a > b by much more than MAX_SAFE_INTEGER\n\t\treturn undefined;\n\t}\n\n\tif (subtractMid > 1) {\n\t\treturn undefined;\n\t} else {\n\t\tconst trueDelta = fiftyThirdBit * subtractMid + subtractLow;\n\t\treturn trueDelta > maxDelta ? undefined : trueDelta;\n\t}\n}\n\n// Pre-allocated array of strings of zeros.\n// Used to pad hex strings up to 52 bits\nconst zeros: string[] = [];\nfor (let i = 0; i < nibblesInNumericUuidInteger; i++) {\n\tzeros.push('0'.repeat(i));\n}\n\nfunction padToLengthWithZeros(str: string, count: number): string {\n\treturn str.length === count ? str : zeros[count - str.length] + str;\n}\n\n/**\n * @param offset an optional offset to increment the returned StableId\n * @returns the string representation of a `NumericUuid`.\n */\nexport function stableIdFromNumericUuid(uuid: NumericUuid, offset = 0): StableId {\n\tconst lowerAdd = uuid[1] + offset;\n\t// Common fast-path\n\tif (lowerAdd <= maxNumericUuidInteger) {\n\t\tconst lowerString = padToLengthWithZeros(lowerAdd.toString(16), nibblesInNumericUuidInteger);\n\t\treturn `${uuid[0] + lowerString.slice(0, 1)}-${lowerString.slice(1)}` as StableId;\n\t}\n\treturn stableIdFromNumericUuid(incrementUuid(uuid, offset));\n}\n\n/**\n * @param stableId a minimal uuid string\n * @returns a numeric representation of `stableId`.\n */\nexport function numericUuidFromStableId(stableId: StableId): NumericUuid {\n\tconst uuid: (string | number)[] = new Array(2);\n\tuuid[0] = stableId.slice(0, stringEntryLength);\n\tuuid[1] = Number.parseInt(ChunkMath.Lower.parse(stableId), 16);\n\treturn uuid as readonly (number | string)[] as NumericUuid;\n}\n\n/**\n * Asserts that the supplied uuid is a stable ID.\n */\nexport function assertIsStableId(uuid: string): StableId {\n\tassert(isStableId(uuid), `${uuid} is not a StableId.`);\n\treturn uuid;\n}\n\nconst charCode0 = '0'.charCodeAt(0);\nconst charCode9 = '9'.charCodeAt(0);\nconst charCodea = 'a'.charCodeAt(0);\nconst charCodef = 'f'.charCodeAt(0);\nconst charCodeA = 'A'.charCodeAt(0);\nconst charCodeF = 'F'.charCodeAt(0);\n\n/**\n * Returns whether the supplied string is a v4 variant 2 uuid.\n */\nexport function isStableId(str: string): str is StableId {\n\tif (str.length !== 36) {\n\t\treturn false;\n\t}\n\n\tfor (let i = 0; i < str.length; i++) {\n\t\tswitch (i) {\n\t\t\tcase 8:\n\t\t\tcase 13:\n\t\t\tcase 18:\n\t\t\tcase 23: {\n\t\t\t\tif (str.charAt(i) !== '-') {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase 14: {\n\t\t\t\tif (str.charAt(i) !== '4') {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase 19: {\n\t\t\t\tconst c = str.charAt(i);\n\t\t\t\tif (c !== '8' && c !== '9' && c !== 'a' && c !== 'b') {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdefault: {\n\t\t\t\tconst code = str.charCodeAt(i);\n\t\t\t\tconst isUuidChar =\n\t\t\t\t\t(code >= charCode0 && code <= charCode9) ||\n\t\t\t\t\t(code >= charCodea && code <= charCodef) ||\n\t\t\t\t\t(code >= charCodeA && code <= charCodeF);\n\n\t\t\t\tif (!isUuidChar) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\n/**\n * Creates a session base ID.\n * This method (rather than standard uuid generation methods) should be used to generate session IDs.\n */\nexport function createSessionId(): SessionId {\n\tconst uuid = assertIsStableId(v4());\n\treturn ensureSessionUuid(uuid);\n}\n\n/**\n * Compares numeric uuids for equality.\n */\nexport function numericUuidEquals(a: NumericUuid, b: NumericUuid): boolean {\n\treturn a[0] === b[0] && a[1] === b[1];\n}\n\n/**\n * The maximum value that can be contained in the upper string region of a numeric UUID (i.e. the string region excluding the version\n * nibble and the variant chunk)\n */\nconst maxUpperNumber = 2 ** 48 - 1;\n\n/**\n * Increments the uuid. `amount` must be a positive integer.\n * @returns the result of incrementing the uuid by `amount`.`\n */\nexport function incrementUuid(uuid: NumericUuid, amount: number): NumericUuid {\n\t/*\n\t * UUIDs incremented beyond the max UUID \"ffffffff-ffff-4fff-bfff-ffffffffffff\" will cause a failure.\n\t * Also, some reserved bits of the v4 UUID must be treated as immutable (e.g. the version and\n\t * variant bits) and thus must not be incremented.\n\t */\n\tlet newUuid: [string, number];\n\tconst result = uuid[1] + amount;\n\tif (result <= maxNumericUuidInteger) {\n\t\t// The new number still fits within the number region of a numeric UUID.\n\t\t// Incrementing is usually done with small amounts, so this is the dominantly common case.\n\t\tnewUuid = [uuid[0], result];\n\t} else {\n\t\t// The numeric UUID's number region has overflowed. We will need to carry the overflow into the variant chunk (see `VariantChunk`).\n\t\t/** The amount left over after filling up the rest of the uuid's number region with the increment amount */\n\t\tconst remainder = amount - (maxNumericUuidInteger - uuid[1]) - 1;\n\t\tconst stringEntry = uuid[0];\n\t\tconst [newVariantChunkString, carried] = ChunkMath.increment(stringEntry);\n\n\t\tif (carried) {\n\t\t\t// The variant chunk itself also overflowed. We'll need to carry the overflow further, into the upper string region of the UUID.\n\t\t\tconst upperString = ChunkMath.Upper.parse(stringEntry);\n\t\t\tconst upperNumber = Number.parseInt(upperString, 16);\n\t\t\tassert(upperNumber <= maxUpperNumber);\n\t\t\tconst newUpperNumber = upperNumber + 1;\n\t\t\tif (newUpperNumber > maxUpperNumber) {\n\t\t\t\tfail('Exceeded maximum numeric UUID');\n\t\t\t} else {\n\t\t\t\t// The variant chunk overflowed but the upper string region did not. Splice in the incremented string region.\n\t\t\t\tconst newUpperChunk = padToLengthWithZeros(newUpperNumber.toString(16), 12);\n\t\t\t\tnewUuid = [\n\t\t\t\t\t`${ChunkMath.Upper.hyphenate(newUpperChunk)}-4${ChunkMath.Variant.hyphenate(\n\t\t\t\t\t\tnewVariantChunkString\n\t\t\t\t\t)}`,\n\t\t\t\t\tremainder,\n\t\t\t\t];\n\t\t\t}\n\t\t} else {\n\t\t\t// The variant chunk did not overflow, so just splice it back in.\n\t\t\tnewUuid = [\n\t\t\t\t`${ChunkMath.Upper.slice(stringEntry)}-4${ChunkMath.Variant.hyphenate(newVariantChunkString)}`,\n\t\t\t\tremainder,\n\t\t\t];\n\t\t}\n\t}\n\n\treturn newUuid as readonly [string, number] as NumericUuid;\n}\n\nnamespace ChunkMath {\n\t/*\n\t * Recall the UUID diagram from the top of this file which describes the layout of a Numeric UUID. To implement addition, we define\n\t * another region called the \"variant chunk\" which overlaps with the \"string\" region. Note that it is just beneath the required v4 uuid\n\t * version identifier (the 13th nibble 'V' which is always '4' in a v4 UUID) and just above the \"number\" region of the layout. It\n\t * contains inside of it the v4 UUID variant identifier bits as well (see https://datatracker.ietf.org/doc/html/rfc4122#section-4.1.1).\n\t *\n\t * UUUUUUUU-UUUU-VUUU-vUUU-UUUUUUUUUUUU - the uuid\n\t * SSSSSSSS SSSS SSSS SSS               - array[0]: string\n\t *                       N NNNNNNNNNNNN - array[1]: integer\n\t *                VVV-VVV               - the variant chunk\n\t *\n\t * By defining the variant chunk in this way it is simple to splice in the v4 UUID version identifier ('V') just above it and any\n\t * \"bit math\" required due to the fact that the variant identifier bits ('v') do not fill up an entire nibble is handled within it.\n\t * The variant chunk is made up of 6 nibbles. Note the \"vv\" which denotes the two bits used for the v4 UUID variant identifier:\n\t *\n\t * AAAA BBBB CCCC vvDD EEEE FFFF\n\t *\n\t * Since we'll be needing to \"skip\" the variant bits (\"vv\") when doing addition, we define a a few masks which will be used below to\n\t * separate the variant chunk into pieces before recombining it:\n\t */\n\n\t//                                         AAAA BBBB CCCC vvDD EEEE FFFF\n\tconst upperVariantChunkMask = 0xfff000; // XXXX XXXX XXXX\n\tconst variantBitMask = 0x800; //                          XX\n\tconst middleVariantChunkMask = 0x300; //                    XX\n\tconst lowerVariantChunkMask = 0xff; //                         XXXX XXXX\n\n\t/** The maximum numeric value that can be represented by the numerically relevant bits in the variant chunk */\n\tconst maxVariantNumber = 2 ** 22 - 1;\n\n\texport const twentyThirdBit = 2 ** 22;\n\n\t/** the upper chunk, denoted by 'U's in UUUUUUUU-UUUU-VVVV-vVVL-LLLLLLLLLLLL */\n\texport namespace Upper {\n\t\texport function parse(stringEntry: string): string {\n\t\t\treturn stringEntry.slice(0, 8) + stringEntry.slice(9, 13);\n\t\t}\n\n\t\texport function hyphenate(upperChunk: string): string {\n\t\t\treturn `${upperChunk.slice(0, 8)}-${upperChunk.slice(8)}`;\n\t\t}\n\n\t\texport function slice(stringEntry: string): string {\n\t\t\treturn stringEntry.slice(0, 13);\n\t\t}\n\t}\n\n\t/** the variant chunk, denoted by 'V's in UUUUUUUU-UUUU-VVVV-vVVL-LLLLLLLLLLLL */\n\texport namespace Variant {\n\t\texport function parse(stringEntry: string): string {\n\t\t\treturn stringEntry.slice(15, 18) + stringEntry.slice(19, 22);\n\t\t}\n\n\t\texport function hyphenate(variantChunk: string): string {\n\t\t\treturn `${variantChunk.slice(0, 3)}-${variantChunk.slice(3)}`;\n\t\t}\n\t}\n\n\t/** the lower chunk, denoted by 'L's in UUUUUUUU-UUUU-VVVV-vVVL-LLLLLLLLLLLL */\n\texport namespace Lower {\n\t\texport function parse(stableId: StableId): string {\n\t\t\treturn stableId.slice(stringEntryLength, stringEntryLength + 1) + stableId.slice(stringEntryLength + 2);\n\t\t}\n\n\t\texport function hyphenate(lowerChunk: string): string {\n\t\t\treturn `${lowerChunk.slice(0, 1)}-${lowerChunk.slice(1)}`;\n\t\t}\n\t}\n\n\t/**\n\t * Returns the number representation of the given bits corresponding to the variant chunk. The value is derived by parsing all bits\n\t * except for reserved bits (i.e. the variant bits).\n\t * @param variantChunkBits\n\t */\n\texport function getNumericValue(variantChunk: string): number {\n\t\tconst variantChunkBits = Number.parseInt(variantChunk, 16);\n\t\tconst upperVariantBits = (variantChunkBits & upperVariantChunkMask) >> 2;\n\t\tconst middleVariantBits = variantChunkBits & middleVariantChunkMask;\n\t\tconst lowerVariantBits = variantChunkBits & lowerVariantChunkMask;\n\t\treturn upperVariantBits + middleVariantBits + lowerVariantBits;\n\t}\n\n\t/**\n\t * Given the string portion of a numeric uuid, add one to it.\n\t * @returns the resulting hex string and whether or not the new value overflowed, i.e. it exceeds `maxVariantNumber`. In this case,\n\t * the resulting hex string will wrap around to its minimum value '000b00'\n\t */\n\texport function increment(stringEntry: string): [newVariantChunk: string, overflowed: boolean] {\n\t\t// To implement addition, the variant identifier bits are extracted from the variant chunk, the chunk is interpreted as a number,\n\t\t// that number is incremented by 1, and then the variant identifier bits are returned as we convert the number back into a hex\n\t\t// string.\n\n\t\t// This diagram may be helpful for seeing how the nibbles line up before and after the variant identifier bits are extracted. The\n\t\t// letters used for each nibble (\"AAAA\", \"BBBB\") etc. are arbitrary and are simply there to differentiate the nibbles as they shift.\n\t\t// --------------------------------\n\t\t// 1. AAAA BBBB CCCC vvDD EEEE FFFF\n\t\t// 2.   AA AABB BBCC CCDD EEEE FFFF\n\t\t// 3.   AA AABB BBCC CCDD EEEE FFFF\n\t\t//                              + 1\n\t\t//    = GG GGHH HHII IIJJ JJKK KKLL\n\t\t// 4. GGGG HHHH IIII vvJJ JJKK KKLL\n\n\t\t// 1. The variant chunk is given as a 6 character (6 nibble) hex string, where the fourth nibble contains the variant bits\n\t\t// 2. The numerically important bits (i.e. not the variant identifier bits vv which are constant) are extracted into a single number\n\t\tconst variantChunk = Variant.parse(stringEntry);\n\t\tconst variantNumber = getNumericValue(variantChunk);\n\t\tassert(variantNumber <= maxVariantNumber);\n\t\t// 3. Add one to the variant number to produce our new variant number.\n\t\tconst newVariantNumber = variantNumber + 1;\n\t\t// 4. The variant identifier bits are added back into the number, which is then turned back into a hex string\n\t\tconst newUpperVariantBits = (newVariantNumber & (upperVariantChunkMask >> 2)) << 2;\n\t\tconst newMiddleVariantBits = (newVariantNumber & middleVariantChunkMask) | variantBitMask; // Add the variant bits back in\n\t\tconst newLowerVariantBits = newVariantNumber & lowerVariantChunkMask;\n\t\tconst newVariantChunkBits = newUpperVariantBits + newMiddleVariantBits + newLowerVariantBits;\n\t\tconst newVariantChunk = padToLengthWithZeros(newVariantChunkBits.toString(16), variantChunk.length);\n\t\treturn [newVariantChunk, newVariantNumber > maxVariantNumber];\n\t}\n}\n\nconst maxUpperUuid = 'ffffffff-ffff-4fff-bf';\nconst maxNibbleCount = [...maxUpperUuid].filter((n) => n === 'f').length;\nconst newNibbles = ['7', 'b', 'd', 'e'];\nfunction isMaxUpperNibble(index: number): boolean {\n\treturn maxUpperUuid.charAt(index) === 'f';\n}\n\n/**\n * Any session uuid with all of its highish bits set is in danger of overflowing after fewer than 2^53 increments.\n * By zeroing one of those bits at random, potential overflow is prevented.\n */\nexport function ensureSessionUuid(uuid: StableId): SessionId {\n\tif (uuid.startsWith(maxUpperUuid)) {\n\t\tconst targetNibble = Math.floor(Math.random() * maxNibbleCount);\n\t\tlet actualIndex = 0;\n\t\tfor (let nibbleIndex = 0; nibbleIndex < targetNibble && !isMaxUpperNibble(actualIndex); actualIndex += 1) {\n\t\t\tif (isMaxUpperNibble(actualIndex)) {\n\t\t\t\tnibbleIndex++;\n\t\t\t}\n\t\t}\n\n\t\tconst newNibble = newNibbles[Math.floor(Math.random() * newNibbles.length)]; // Randomly choose a bit to zero\n\t\tconst newUuid = uuid.slice(0, actualIndex) + newNibble + uuid.slice(actualIndex + 1);\n\t\treturn newUuid as SessionId;\n\t}\n\n\treturn uuid as SessionId;\n}\n"]}

package/dist/id-compressor/index.d.ts

@@ -0,0 +1,12 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * Exports for `id-compressor`
+ */
+export * from './IdCompressor';
+export * from './IdRange';
+export * from './persisted-types';
+export { createSessionId } from './NumericUuid';
+//# sourceMappingURL=index.d.ts.map

package/dist/id-compressor/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/id-compressor/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,WAAW,CAAC;AAC1B,cAAc,mBAAmB,CAAC;AAClC,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC"}

package/dist/id-compressor/index.js

@@ -0,0 +1,26 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createSessionId = void 0;
+/**
+ * Exports for `id-compressor`
+ */
+__exportStar(require("./IdCompressor"), exports);
+__exportStar(require("./IdRange"), exports);
+__exportStar(require("./persisted-types"), exports);
+var NumericUuid_1 = require("./NumericUuid");
+Object.defineProperty(exports, "createSessionId", { enumerable: true, get: function () { return NumericUuid_1.createSessionId; } });
+//# sourceMappingURL=index.js.map

package/dist/id-compressor/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/id-compressor/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;AAEH;;GAEG;AAEH,iDAA+B;AAC/B,4CAA0B;AAC1B,oDAAkC;AAClC,6CAAgD;AAAvC,8GAAA,eAAe,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * Exports for `id-compressor`\n */\n\nexport * from './IdCompressor';\nexport * from './IdRange';\nexport * from './persisted-types';\nexport { createSessionId } from './NumericUuid';\n"]}

package/dist/id-compressor/persisted-types/0.0.1.d.ts

@@ -0,0 +1,156 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import type { Serializable } from '@fluidframework/datastore-definitions';
+import type { FinalCompressedId, LocalCompressedId, OpSpaceCompressedId, SessionId } from '../../Identifiers';
+/**
+ * Extensible attribution info associated with a session.
+ */
+export declare type AttributionInfo = Serializable;
+/**
+ * A serialized ID allocation session for an `IdCompressor`.
+ */
+export declare type SerializedSessionData = readonly [
+    /**
+     * The ID of the session.
+     */
+    sessionId: SessionId,
+    /**
+     * The attribution info provided for the session
+     */
+    attributionInfo?: AttributionInfo
+];
+export declare type SerializedClusterOverrides = readonly [
+    /** The overridden final ID, represented as an index into the cluster's ID range */
+    overriddenFinalIndex: number,
+    /** The override string */
+    override: string,
+    /** The first ID that was finalized and associated with this override, set only if different than the `overriddenFinalIndex` */
+    overriddenId?: FinalCompressedId
+][];
+/**
+ * A serialized final ID cluster.
+ */
+export declare type SerializedCluster = readonly [
+    /**
+     * Index into the serialized sessions array. Can be converted into a baseUuid via its order in `clusters`.
+     * If negative, then this cluster was created by the local session.
+     */
+    sessionIndex: number,
+    /**
+     * The capacity of the cluster.
+     */
+    capacity: number,
+    /**
+     * The number of IDs in the cluster. Omitted if count === capacity.
+     * --OR--
+     * The overrides in this cluster. Omitted if no overrides exist in the cluster.
+     */
+    countOrOverrides?: number | SerializedClusterOverrides,
+    /**
+     * Overrides in this cluster. Omitted if no overrides exist in the cluster.
+     */
+    overrides?: SerializedClusterOverrides
+];
+export declare type SerializedLocalOverrides = readonly [LocalCompressedId, string][];
+export interface SerializedLocalState {
+    /**
+     * The total number of local IDs created by this session
+     */
+    localIdCount: number;
+    /**
+     * Overrides generated by this session. Omitted if no local overrides exist in the session.
+     */
+    overrides?: SerializedLocalOverrides;
+    /**
+     * Boolean to track whether attribution has been sent with an ID range yet.
+     */
+    sentAttributionInfo: boolean;
+    /**
+     * The most recent local ID in a range returned by `takeNextCreationRange`.
+     */
+    lastTakenLocalId: LocalCompressedId | undefined;
+}
+/**
+ * The minimal required contents of a serialized IdCompressor.
+ */
+export interface VersionedSerializedIdCompressor {
+    readonly _versionedSerializedIdCompressor: '8c73c57c-1cf4-4278-8915-6444cb4f6af5';
+    readonly version: string;
+}
+/**
+ * The serialized contents of an IdCompressor, suitable for persistence in a summary.
+ */
+export interface SerializedIdCompressor extends VersionedSerializedIdCompressor {
+    /** The cluster capacity of this compressor */
+    readonly clusterCapacity: number;
+    /** The number of reserved IDs in this compressor */
+    readonly reservedIdCount: number;
+    /** All sessions except the local session. */
+    readonly sessions: readonly SerializedSessionData[];
+    /** All clusters in the compressor in the order they were created. */
+    readonly clusters: readonly SerializedCluster[];
+}
+/**
+ * The serialized contents of an IdCompressor, suitable for persistence in a summary.
+ */
+export interface SerializedIdCompressorWithNoSession extends SerializedIdCompressor {
+    readonly _noLocalState: '3aa2e1e8-cc28-4ea7-bc1a-a11dc3f26dfb';
+}
+/**
+ * The serialized contents of an IdCompressor, suitable for persistence in a summary.
+ */
+export interface SerializedIdCompressorWithOngoingSession extends SerializedIdCompressor {
+    readonly _hasLocalState: '1281acae-6d14-47e7-bc92-71c8ee0819cb';
+    /** The session ID of the local session, by index into `sessions`. */
+    readonly localSessionIndex: number;
+    /** This is only present if the local session made any IDs. */
+    readonly localState?: SerializedLocalState;
+}
+/**
+ * Data describing a range of session-local IDs (from a remote or local session).
+ *
+ * A range is composed of local IDs that were generated. Some of these may have overrides.
+ *
+ * @example
+ * Suppose an IdCompressor generated a sequence of local IDs as follows:
+ * ```
+ * compressor.generateLocalId()
+ * compressor.generateLocalId('0093cf29-9454-4034-8940-33b1077b41c3')
+ * compressor.generateLocalId()
+ * compressor.generateLocalId('0ed545f8-e97e-4dc1-acf9-c4a783258bdf')
+ * compressor.generateLocalId()
+ * compressor.generateLocalId()
+ * compressor.takeNextCreationRange()
+ * ```
+ * This would result in the following range:
+ * ```
+ * {
+ *     first: localId1,
+ *     last: localId6,
+ *     overrides: [[localId2, '0093cf29-9454-4034-8940-33b1077b41c3'], [localId4, '0ed545f8-e97e-4dc1-acf9-c4a783258bdf']]
+ * }
+ * ```
+ */
+export interface IdCreationRange {
+    readonly sessionId: SessionId;
+    readonly ids?: IdCreationRange.Ids;
+    readonly attributionInfo?: AttributionInfo;
+}
+export declare type UnackedLocalId = LocalCompressedId & OpSpaceCompressedId;
+export declare namespace IdCreationRange {
+    type Ids = {
+        readonly first: UnackedLocalId;
+        readonly last: UnackedLocalId;
+    } | ({
+        readonly first?: UnackedLocalId;
+        readonly last?: UnackedLocalId;
+    } & HasOverrides);
+    interface HasOverrides {
+        readonly overrides: Overrides;
+    }
+    type Override = readonly [id: UnackedLocalId, override: string];
+    type Overrides = readonly [Override, ...Override[]];
+}
+//# sourceMappingURL=0.0.1.d.ts.map

package/dist/id-compressor/persisted-types/0.0.1.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"0.0.1.d.ts","sourceRoot":"","sources":["../../../src/id-compressor/persisted-types/0.0.1.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9G;;GAEG;AACH,oBAAY,eAAe,GAAG,YAAY,CAAC;AAE3C;;GAEG;AACH,oBAAY,qBAAqB,GAAG,SAAS;IAC5C;;OAEG;IACH,SAAS,EAAE,SAAS;IAEpB;;OAEG;IACH,eAAe,CAAC,EAAE,eAAe;CACjC,CAAC;AAEF,oBAAY,0BAA0B,GAAG,SAAS;IACjD,mFAAmF;IACnF,oBAAoB,EAAE,MAAM;IAC5B,0BAA0B;IAC1B,QAAQ,EAAE,MAAM;IAChB,+HAA+H;IAC/H,YAAY,CAAC,EAAE,iBAAiB;CAChC,EAAE,CAAC;AAEJ;;GAEG;AACH,oBAAY,iBAAiB,GAAG,SAAS;IACxC;;;OAGG;IACH,YAAY,EAAE,MAAM;IAEpB;;OAEG;IACH,QAAQ,EAAE,MAAM;IAEhB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,MAAM,GAAG,0BAA0B;IAEtD;;OAEG;IACH,SAAS,CAAC,EAAE,0BAA0B;CACtC,CAAC;AAEF,oBAAY,wBAAwB,GAAG,SAAS,CAAC,iBAAiB,EAAE,MAAM,CAAC,EAAE,CAAC;AAE9E,MAAM,WAAW,oBAAoB;IACpC;;OAEG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB;;OAEG;IACH,SAAS,CAAC,EAAE,wBAAwB,CAAC;IAErC;;OAEG;IACH,mBAAmB,EAAE,OAAO,CAAC;IAE7B;;OAEG;IACH,gBAAgB,EAAE,iBAAiB,GAAG,SAAS,CAAC;CAChD;AAED;;GAEG;AACH,MAAM,WAAW,+BAA+B;IAC/C,QAAQ,CAAC,gCAAgC,EAAE,sCAAsC,CAAC;IAClF,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAuB,SAAQ,+BAA+B;IAC9E,8CAA8C;IAC9C,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,oDAAoD;IACpD,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,6CAA6C;IAC7C,QAAQ,CAAC,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACpD,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,EAAE,SAAS,iBAAiB,EAAE,CAAC;CAChD;AAED;;GAEG;AACH,MAAM,WAAW,mCAAoC,SAAQ,sBAAsB;IAClF,QAAQ,CAAC,aAAa,EAAE,sCAAsC,CAAC;CAC/D;AAED;;GAEG;AACH,MAAM,WAAW,wCAAyC,SAAQ,sBAAsB;IACvF,QAAQ,CAAC,cAAc,EAAE,sCAAsC,CAAC;IAChE,qEAAqE;IACrE,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,8DAA8D;IAC9D,QAAQ,CAAC,UAAU,CAAC,EAAE,oBAAoB,CAAC;CAC3C;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,WAAW,eAAe;IAC/B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,QAAQ,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,GAAG,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,eAAe,CAAC;CAC3C;AAED,oBAAY,cAAc,GAAG,iBAAiB,GAAG,mBAAmB,CAAC;AAErE,yBAAiB,eAAe,CAAC;IAChC,KAAY,GAAG,GACZ;QACA,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;QAC/B,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;KAC7B,GACD,CAAC;QACD,QAAQ,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC;QAChC,QAAQ,CAAC,IAAI,CAAC,EAAE,cAAc,CAAC;KAC9B,GAAG,YAAY,CAAC,CAAC;IAErB,UAAiB,YAAY;QAC5B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;KAC9B;IAED,KAAY,QAAQ,GAAG,SAAS,CAAC,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IACvE,KAAY,SAAS,GAAG,SAAS,CAAC,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;CAC3D"}

package/dist/id-compressor/persisted-types/0.0.1.js

@@ -0,0 +1,7 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=0.0.1.js.map