@fluid-experimental/tree 2.0.0-rc.2.0.1 → 2.0.0-rc.3.0.0

package/lib/test/NumericUuid.perf.tests.js

@@ -1,68 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
-import { defaultClusterCapacity } from '../id-compressor/IdCompressor.js';
-import { getPositiveDelta, incrementUuid, numericUuidFromStableId, stableIdFromNumericUuid, } from '../id-compressor/NumericUuid.js';
-import { assertIsStableId, generateStableId } from '../UuidUtilities.js';
-describe('NumericUuid Perf', () => {
-    const stableId = assertIsStableId('4779fbf2-2012-4510-b4f0-28a99a9f8946');
-    const stableId2 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467525912');
-    const stableId3 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467515912');
-    const uuid = numericUuidFromStableId(stableId);
-    const uuid2 = numericUuidFromStableId(stableId2);
-    const uuid3 = numericUuidFromStableId(stableId3);
-    const deltaMax = 2 ** 52 - 1;
-    const type = BenchmarkType.Measurement;
-    benchmark({
-        type,
-        title: `convert uuid string to numeric uuid`,
-        benchmarkFn: () => {
-            numericUuidFromStableId(stableId);
-        },
-    });
-    benchmark({
-        type,
-        title: `incrementing a uuid`,
-        benchmarkFn: () => {
-            incrementUuid(uuid, defaultClusterCapacity);
-        },
-    });
-    benchmark({
-        type,
-        title: `convert a uuid string into a session uuid`,
-        benchmarkFn: () => {
-            numericUuidFromStableId(stableId);
-        },
-    });
-    benchmark({
-        type,
-        title: `convert an numeric uuid into a uuid string`,
-        benchmarkFn: () => {
-            stableIdFromNumericUuid(uuid);
-        },
-    });
-    benchmark({
-        type,
-        title: `compute the delta between two distant numeric uuids`,
-        benchmarkFn: () => {
-            getPositiveDelta(uuid, uuid2, deltaMax);
-        },
-    });
-    benchmark({
-        type,
-        title: `compute the delta between two close numeric uuids`,
-        benchmarkFn: () => {
-            getPositiveDelta(uuid2, uuid3, deltaMax);
-        },
-    });
-    benchmark({
-        type,
-        title: `generate a random v4 uuid string`,
-        benchmarkFn: () => {
-            generateStableId();
-        },
-    });
-});
-//# sourceMappingURL=NumericUuid.perf.tests.js.map

package/lib/test/NumericUuid.perf.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"NumericUuid.perf.tests.js","sourceRoot":"","sources":["../../src/test/NumericUuid.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,sBAAsB,EAAE,MAAM,kCAAkC,CAAC;AAC1E,OAAO,EACN,gBAAgB,EAChB,aAAa,EACb,uBAAuB,EACvB,uBAAuB,GACvB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAEzE,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAC1E,MAAM,SAAS,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAC3E,MAAM,SAAS,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAC3E,MAAM,IAAI,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,aAAa,CAAC,WAAW,CAAC;IACvC,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,qCAAqC;QAC5C,WAAW,EAAE,GAAG,EAAE;YACjB,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,qBAAqB;QAC5B,WAAW,EAAE,GAAG,EAAE;YACjB,aAAa,CAAC,IAAI,EAAE,sBAAsB,CAAC,CAAC;QAC7C,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,2CAA2C;QAClD,WAAW,EAAE,GAAG,EAAE;YACjB,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,4CAA4C;QACnD,WAAW,EAAE,GAAG,EAAE;YACjB,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,qDAAqD;QAC5D,WAAW,EAAE,GAAG,EAAE;YACjB,gBAAgB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACzC,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,mDAAmD;QAC1D,WAAW,EAAE,GAAG,EAAE;YACjB,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1C,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,kCAAkC;QACzC,WAAW,EAAE,GAAG,EAAE;YACjB,gBAAgB,EAAE,CAAC;QACpB,CAAC;KACD,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { defaultClusterCapacity } from '../id-compressor/IdCompressor.js';\nimport {\n\tgetPositiveDelta,\n\tincrementUuid,\n\tnumericUuidFromStableId,\n\tstableIdFromNumericUuid,\n} from '../id-compressor/NumericUuid.js';\nimport { assertIsStableId, generateStableId } from '../UuidUtilities.js';\n\ndescribe('NumericUuid Perf', () => {\n\tconst stableId = assertIsStableId('4779fbf2-2012-4510-b4f0-28a99a9f8946');\n\tconst stableId2 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467525912');\n\tconst stableId3 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467515912');\n\tconst uuid = numericUuidFromStableId(stableId);\n\tconst uuid2 = numericUuidFromStableId(stableId2);\n\tconst uuid3 = numericUuidFromStableId(stableId3);\n\tconst deltaMax = 2 ** 52 - 1;\n\tconst type = BenchmarkType.Measurement;\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `convert uuid string to numeric uuid`,\n\t\tbenchmarkFn: () => {\n\t\t\tnumericUuidFromStableId(stableId);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `incrementing a uuid`,\n\t\tbenchmarkFn: () => {\n\t\t\tincrementUuid(uuid, defaultClusterCapacity);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `convert a uuid string into a session uuid`,\n\t\tbenchmarkFn: () => {\n\t\t\tnumericUuidFromStableId(stableId);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `convert an numeric uuid into a uuid string`,\n\t\tbenchmarkFn: () => {\n\t\t\tstableIdFromNumericUuid(uuid);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `compute the delta between two distant numeric uuids`,\n\t\tbenchmarkFn: () => {\n\t\t\tgetPositiveDelta(uuid, uuid2, deltaMax);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `compute the delta between two close numeric uuids`,\n\t\tbenchmarkFn: () => {\n\t\t\tgetPositiveDelta(uuid2, uuid3, deltaMax);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `generate a random v4 uuid string`,\n\t\tbenchmarkFn: () => {\n\t\t\tgenerateStableId();\n\t\t},\n\t});\n});\n"]}

package/lib/test/NumericUuid.tests.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=NumericUuid.tests.d.ts.map

package/lib/test/NumericUuid.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"NumericUuid.tests.d.ts","sourceRoot":"","sources":["../../src/test/NumericUuid.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/NumericUuid.tests.js

@@ -1,192 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/* eslint-disable no-bitwise */
-import { strict as assert } from 'assert';
-import { expect } from 'chai';
-import { makeRandom } from '@fluid-private/stochastic-test-utils';
-import { validateAssertionError } from '@fluidframework/test-runtime-utils';
-import { compareStrings } from '../Common.js';
-import { numericUuidEquals, createSessionId, getPositiveDelta, incrementUuid, numericUuidFromStableId, stableIdFromNumericUuid, ensureSessionUuid, } from '../id-compressor/NumericUuid.js';
-import { assertIsStableId, isStableId } from '../UuidUtilities.js';
-import { integerToStableId } from './utilities/IdCompressorTestUtilities.js';
-describe('NumericUuid', () => {
-    it('can detect non-v4 variant 2 UUIDs', () => {
-        expect(isStableId('00000000-0000-0000-0000-000000000000')).to.be.false;
-        expect(isStableId('ffffffff-ffff-ffff-ffff-ffffffffffff')).to.be.false;
-        expect(isStableId('8e8fec9a10ea4d158308ed35bc7f1e66')).to.be.false;
-        expect(isStableId('8e8fec9a-10ea-4d15-8308-ed35bc7f1e66')).to.be.true;
-        [...new Array(16).keys()]
-            .map((n) => [n, n.toString(16)])
-            .forEach(([n, char]) => {
-            const expectUuidVersion = expect(isStableId(`00000000-0000-${char}000-b000-000000000000`));
-            if (char === '4') {
-                expectUuidVersion.to.be.true;
-            }
-            else {
-                expectUuidVersion.to.be.false;
-            }
-            const expectUuidVariant = expect(isStableId(`00000000-0000-4000-${char}000-000000000000`));
-            if (n >= 8 && n <= 11) {
-                expectUuidVariant.to.be.true;
-            }
-            else {
-                expectUuidVariant.to.be.false;
-            }
-        });
-    });
-    const maxStableId = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');
-    it('detects increment overflow', () => {
-        const uuid = numericUuidFromStableId(maxStableId);
-        assert.throws(() => stableIdFromNumericUuid(uuid, 1), (e) => validateAssertionError(e, 'Exceeded maximum numeric UUID'));
-        assert.throws(() => stableIdFromNumericUuid(incrementUuid(uuid, 1)), (e) => validateAssertionError(e, 'Exceeded maximum numeric UUID'));
-        assert.throws(() => stableIdFromNumericUuid(uuid, 256), (e) => validateAssertionError(e, 'Exceeded maximum numeric UUID'));
-        assert.throws(() => stableIdFromNumericUuid(incrementUuid(uuid, 256)), (e) => validateAssertionError(e, 'Exceeded maximum numeric UUID'));
-        assert.throws(() => stableIdFromNumericUuid(uuid, Number.MAX_SAFE_INTEGER), (e) => validateAssertionError(e, 'Exceeded maximum numeric UUID'));
-        assert.throws(() => stableIdFromNumericUuid(incrementUuid(uuid, Number.MAX_SAFE_INTEGER)), (e) => validateAssertionError(e, 'Exceeded maximum numeric UUID'));
-    });
-    it('can rehydrate a valid session UUID', () => {
-        const uuid = assertIsStableId('44f95a8b-c52b-4828-a000-0000f0000003');
-        const sessionUuid = numericUuidFromStableId(uuid);
-        expect(stableIdFromNumericUuid(sessionUuid)).to.equal(uuid);
-    });
-    it('can create valid session UUIDs', () => {
-        for (let i = 0; i < 100; i++) {
-            const sessionId = createSessionId();
-            expect(sessionId.length).to.equal(36);
-            const sessionNumericUuid = numericUuidFromStableId(sessionId);
-            expect(stableIdFromNumericUuid(sessionNumericUuid)).to.equal(sessionId);
-        }
-    });
-    const maxUuidBigint = bigIntFromStableId(maxStableId);
-    it('ensures that session UUIDs are resistant to overflow', () => {
-        const uuid = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');
-        for (let i = 0; i < 128; i++) {
-            const ensuredUuid = ensureSessionUuid(uuid);
-            expect(isStableId(ensuredUuid)).to.be.true;
-            const ensuredBigint = bigIntFromStableId(ensuredUuid);
-            expect(maxUuidBigint - ensuredBigint > Number.MAX_SAFE_INTEGER).to.be.true;
-        }
-    });
-    it('correctly adjusts session UUIDs that are in danger of overflow', () => {
-        const dangerous = [
-            assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff'),
-            assertIsStableId('ffffffff-ffff-4fff-bff0-000000000000'),
-            assertIsStableId('ffffffff-ffff-4fff-bf00-000000000000'),
-        ];
-        const safe = [
-            assertIsStableId('ffffffff-ffff-4fff-beff-ffffffffffff'),
-            assertIsStableId('ffffffff-ffff-4fff-bef0-000000000000'),
-            assertIsStableId('ffffffff-ffff-4fff-be00-000000000000'),
-        ];
-        dangerous.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.not.equal(stableId));
-        safe.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.equal(stableId));
-    });
-    const stableIds = [
-        assertIsStableId('748540ca-b7c5-4c99-83ff-c1b8e02c09d6'),
-        assertIsStableId('748540ca-b7c5-4c99-83ef-c1b8e02c09d6'),
-        assertIsStableId('748540ca-b7c5-4c99-831f-c1b8e02c09d6'),
-        assertIsStableId('0002c79e-b536-4776-b000-000266c252d5'),
-        assertIsStableId('082533b9-6d05-4068-a008-fe2cc43543f7'),
-        assertIsStableId('2c9fa1f8-48d5-4554-a466-000000000000'),
-        assertIsStableId('2c9fa1f8-48d5-4000-a000-000000000000'),
-        assertIsStableId('10000000-0000-4000-b000-000000000000'),
-        assertIsStableId('10000000-0000-4000-b020-000000000000'),
-        assertIsStableId('10000000-0000-4000-b00f-ffffffffffff'),
-        assertIsStableId('10000000-0000-4000-b040-000000000000'),
-        assertIsStableId('f0000000-0000-4000-8000-000000000000'),
-        assertIsStableId('efffffff-ffff-4fff-bfff-ffffffffffff'),
-        integerToStableId(0),
-        integerToStableId(1),
-        integerToStableId(77),
-        integerToStableId(1024),
-        integerToStableId(2 ** 32 - 1),
-        integerToStableId(2 ** 52 - 1),
-        integerToStableId(Number.MAX_SAFE_INTEGER),
-        integerToStableId(Number.MAX_SAFE_INTEGER - 1),
-    ];
-    describe('incrementing', () => {
-        const rand = makeRandom(0);
-        const incrementAmounts = [
-            ...[...new Array(53).keys()].map((n) => 2 ** n - 1),
-            ...[...new Array(10).keys()].map((_) => rand.integer(0, Number.MAX_SAFE_INTEGER)),
-        ];
-        stableIds.forEach((stableId) => {
-            it(`can increment ${stableId}`, () => {
-                const uuid = numericUuidFromStableId(stableId);
-                incrementAmounts.forEach((incrementAmount) => {
-                    const bigintIncremented = bigIntFromStableId(stableId) + BigInt(incrementAmount);
-                    const incremented = incrementUuid(uuid, incrementAmount);
-                    const bigintStr = integerToStableId(bigintIncremented);
-                    expect(stableIdFromNumericUuid(incremented)).to.equal(bigintStr);
-                });
-            });
-        });
-    });
-    it('delta calculation can calculate the integer delta between stable ids', () => {
-        stableIds.forEach((stableIdA) => {
-            const uuidA = numericUuidFromStableId(stableIdA);
-            const bigintA = bigIntFromStableId(stableIdA);
-            const arbitraryMaxDelta = 2 ** 32 - 1;
-            stableIds.forEach((stableIdB) => {
-                const uuidB = numericUuidFromStableId(stableIdB);
-                const bigintB = bigIntFromStableId(stableIdB);
-                const realDelta = bigintA - bigintB;
-                const numericDelta = getPositiveDelta(uuidA, uuidB, Number.MAX_SAFE_INTEGER);
-                if (realDelta > Number.MAX_SAFE_INTEGER || realDelta < 0) {
-                    expect(numericDelta).to.equal(undefined);
-                }
-                else {
-                    expect(numericDelta).to.equal(Number(realDelta));
-                }
-                const numericDeltaCapped = getPositiveDelta(uuidA, uuidB, arbitraryMaxDelta);
-                if (realDelta >= 0 && realDelta <= arbitraryMaxDelta) {
-                    expect(numericDeltaCapped).to.equal(Number(realDelta));
-                }
-                else {
-                    expect(numericDeltaCapped).to.equal(undefined);
-                }
-            });
-        });
-    });
-    it('can round trip between stable ID and uuid', () => {
-        stableIds.forEach((stableId) => {
-            const uuid = numericUuidFromStableId(stableId);
-            const roundTripped = stableIdFromNumericUuid(uuid);
-            expect(stableId).to.equal(roundTripped);
-        });
-    });
-    it('can compare numeric uuids', () => {
-        stableIds.forEach((stableIdA) => {
-            stableIds.forEach((stableIdB) => {
-                const numericA = numericUuidFromStableId(stableIdA);
-                const numericB = numericUuidFromStableId(stableIdB);
-                const comparedNumeric = numericUuidEquals(numericA, numericB);
-                const comparedStrings = compareStrings(stableIdA, stableIdB);
-                expect(comparedNumeric).to.equal(comparedStrings === 0);
-            });
-        });
-    });
-});
-function bigIntFromStableId(id) {
-    const minimized = id.replace(/-/g, '');
-    //      UUID | xxxxxxxx-xxxx-Vxxx-vxxx-xxxxxxxxxxxx | The StableId passed to this function, shown here in standard UUID notation
-    //   nibbles | hhhhhhhh hhhh  mmm llll llllllllllll | Whether or not each nibble is part of the "high", "middle" or "low" group below
-    // bit count | 44444444-4444-0444-2444-444444444444 | The number of bits per nibble that are used to encode the number
-    // Interpret numerically...
-    const highNibbles = BigInt(`0x${minimized.substr(0, 12)}`); // ...all nibbles above the version nibble,
-    const midNibbles = BigInt(`0x${minimized.substr(13, 3)}`); //  the nibbles below the version nibble and above the variant nibble,
-    const lowNibbles = BigInt(`0x${minimized.substr(16, 16)}`); // and the variant nibble and all nibbles below
-    // Count the number of bits that contribute to the number (i.e. are not reserved for version/variant) in...
-    const lowBitCount = BigInt(62); // ...the low nibbles
-    const midBitCount = BigInt(12); // and the mid nibbles
-    // Shift the values of each region by the appropriate number of bits
-    const highNumber = highNibbles << (midBitCount + lowBitCount);
-    const midNumber = midNibbles << lowBitCount;
-    // The low nibbles include the variant nibble because its two low bits are numerical (but its two upper bits are not). So mask them out:
-    const lowNumber = lowNibbles & BigInt('0x3fffffffffffffff'); // A nibble '0011' followed by 15 nibbles '1111'.
-    // Now that high and mid are shifted correctly, the final number is their sum:
-    return highNumber + midNumber + lowNumber;
-}
-//# sourceMappingURL=NumericUuid.tests.js.map

package/lib/test/NumericUuid.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"NumericUuid.tests.js","sourceRoot":"","sources":["../../src/test/NumericUuid.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+BAA+B;AAE/B,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAClE,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,OAAO,EACN,iBAAiB,EACjB,eAAe,EACf,gBAAgB,EAChB,aAAa,EACb,uBAAuB,EACvB,uBAAuB,EACvB,iBAAiB,GACjB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACnE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0CAA0C,CAAC;AAE7E,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACvE,MAAM,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACvE,MAAM,CAAC,UAAU,CAAC,kCAAkC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACnE,MAAM,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACtE,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;aACvB,GAAG,CAAmB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;aACjD,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;YACtB,MAAM,iBAAiB,GAAG,MAAM,CAAC,UAAU,CAAC,iBAAiB,IAAI,uBAAuB,CAAC,CAAC,CAAC;YAC3F,IAAI,IAAI,KAAK,GAAG,EAAE;gBACjB,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;aAC7B;iBAAM;gBACN,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;aAC9B;YAED,MAAM,iBAAiB,GAAG,MAAM,CAAC,UAAU,CAAC,sBAAsB,IAAI,kBAAkB,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE;gBACtB,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;aAC7B;iBAAM;gBACN,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;aAC9B;QACF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAE7E,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,IAAI,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAC;QAClD,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,uBAAuB,CAAC,IAAI,EAAE,CAAC,CAAC,EACtC,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+BAA+B,CAAC,CACxE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,uBAAuB,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EACrD,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+BAA+B,CAAC,CACxE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,uBAAuB,CAAC,IAAI,EAAE,GAAG,CAAC,EACxC,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+BAA+B,CAAC,CACxE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,uBAAuB,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,EACvD,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+BAA+B,CAAC,CACxE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,uBAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,EAC5D,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+BAA+B,CAAC,CACxE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,uBAAuB,CAAC,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAC3E,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+BAA+B,CAAC,CACxE,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;QACtE,MAAM,WAAW,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAClD,MAAM,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,SAAS,GAAG,eAAe,EAAE,CAAC;YACpC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAEtC,MAAM,kBAAkB,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;YAC9D,MAAM,CAAC,uBAAuB,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;SACxE;IACF,CAAC,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IAEtD,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,IAAI,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAC3C,MAAM,aAAa,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;YACtD,MAAM,CAAC,aAAa,GAAG,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;SAC3E;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACzE,MAAM,SAAS,GAAG;YACjB,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;SACxD,CAAC;QAEF,MAAM,IAAI,GAAG;YACZ,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;SACxD,CAAC;QAEF,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5F,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,MAAM,SAAS,GAAG;QACjB,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,iBAAiB,CAAC,CAAC,CAAC;QACpB,iBAAiB,CAAC,CAAC,CAAC;QACpB,iBAAiB,CAAC,EAAE,CAAC;QACrB,iBAAiB,CAAC,IAAI,CAAC;QACvB,iBAAiB,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9B,iBAAiB,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9B,iBAAiB,CAAC,MAAM,CAAC,gBAAgB,CAAC;QAC1C,iBAAiB,CAAC,MAAM,CAAC,gBAAgB,GAAG,CAAC,CAAC;KAC9C,CAAC;IAEF,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,gBAAgB,GAAG;YACxB,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnD,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;SACjF,CAAC;QACF,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;YAC9B,EAAE,CAAC,iBAAiB,QAAQ,EAAE,EAAE,GAAG,EAAE;gBACpC,MAAM,IAAI,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;gBAE/C,gBAAgB,CAAC,OAAO,CAAC,CAAC,eAAe,EAAE,EAAE;oBAC5C,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC;oBACjF,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;oBACzD,MAAM,SAAS,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,CAAC;oBACvD,MAAM,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBAClE,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC/E,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;YAC/B,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;YAC9C,MAAM,iBAAiB,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACtC,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;gBAC/B,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;gBACjD,MAAM,OAAO,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;gBAC9C,MAAM,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;gBACpC,MAAM,YAAY,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;gBAC7E,IAAI,SAAS,GAAG,MAAM,CAAC,gBAAgB,IAAI,SAAS,GAAG,CAAC,EAAE;oBACzD,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;iBACzC;qBAAM;oBACN,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;iBACjD;gBACD,MAAM,kBAAkB,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC;gBAC7E,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,IAAI,iBAAiB,EAAE;oBACrD,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;iBACvD;qBAAM;oBACN,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;iBAC/C;YACF,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;YAC9B,MAAM,IAAI,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YAC/C,MAAM,YAAY,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC;YACnD,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;YAC/B,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;gBAC/B,MAAM,QAAQ,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;gBACpD,MAAM,QAAQ,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;gBACpD,MAAM,eAAe,GAAG,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAC9D,MAAM,eAAe,GAAG,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAC7D,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,KAAK,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,SAAS,kBAAkB,CAAC,EAAY;IACvC,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACvC,gIAAgI;IAChI,qIAAqI;IACrI,sHAAsH;IAEtH,2BAA2B;IAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,2CAA2C;IACvG,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,sEAAsE;IACjI,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,+CAA+C;IAC3G,2GAA2G;IAC3G,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,qBAAqB;IACrD,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,sBAAsB;IACtD,oEAAoE;IACpE,MAAM,UAAU,GAAG,WAAW,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;IAC9D,MAAM,SAAS,GAAG,UAAU,IAAI,WAAW,CAAC;IAC5C,wIAAwI;IACxI,MAAM,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,iDAAiD;IAC9G,8EAA8E;IAC9E,OAAO,UAAU,GAAG,SAAS,GAAG,SAAS,CAAC;AAC3C,CAAC","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 { strict as assert } from 'assert';\nimport { expect } from 'chai';\nimport { makeRandom } from '@fluid-private/stochastic-test-utils';\nimport { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { compareStrings } from '../Common.js';\nimport {\n\tnumericUuidEquals,\n\tcreateSessionId,\n\tgetPositiveDelta,\n\tincrementUuid,\n\tnumericUuidFromStableId,\n\tstableIdFromNumericUuid,\n\tensureSessionUuid,\n} from '../id-compressor/NumericUuid.js';\nimport { StableId } from '../Identifiers.js';\nimport { assertIsStableId, isStableId } from '../UuidUtilities.js';\nimport { integerToStableId } from './utilities/IdCompressorTestUtilities.js';\n\ndescribe('NumericUuid', () => {\n\tit('can detect non-v4 variant 2 UUIDs', () => {\n\t\texpect(isStableId('00000000-0000-0000-0000-000000000000')).to.be.false;\n\t\texpect(isStableId('ffffffff-ffff-ffff-ffff-ffffffffffff')).to.be.false;\n\t\texpect(isStableId('8e8fec9a10ea4d158308ed35bc7f1e66')).to.be.false;\n\t\texpect(isStableId('8e8fec9a-10ea-4d15-8308-ed35bc7f1e66')).to.be.true;\n\t\t[...new Array(16).keys()]\n\t\t\t.map<[number, string]>((n) => [n, n.toString(16)])\n\t\t\t.forEach(([n, char]) => {\n\t\t\t\tconst expectUuidVersion = expect(isStableId(`00000000-0000-${char}000-b000-000000000000`));\n\t\t\t\tif (char === '4') {\n\t\t\t\t\texpectUuidVersion.to.be.true;\n\t\t\t\t} else {\n\t\t\t\t\texpectUuidVersion.to.be.false;\n\t\t\t\t}\n\n\t\t\t\tconst expectUuidVariant = expect(isStableId(`00000000-0000-4000-${char}000-000000000000`));\n\t\t\t\tif (n >= 8 && n <= 11) {\n\t\t\t\t\texpectUuidVariant.to.be.true;\n\t\t\t\t} else {\n\t\t\t\t\texpectUuidVariant.to.be.false;\n\t\t\t\t}\n\t\t\t});\n\t});\n\n\tconst maxStableId = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');\n\n\tit('detects increment overflow', () => {\n\t\tconst uuid = numericUuidFromStableId(maxStableId);\n\t\tassert.throws(\n\t\t\t() => stableIdFromNumericUuid(uuid, 1),\n\t\t\t(e: Error) => validateAssertionError(e, 'Exceeded maximum numeric UUID')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => stableIdFromNumericUuid(incrementUuid(uuid, 1)),\n\t\t\t(e: Error) => validateAssertionError(e, 'Exceeded maximum numeric UUID')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => stableIdFromNumericUuid(uuid, 256),\n\t\t\t(e: Error) => validateAssertionError(e, 'Exceeded maximum numeric UUID')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => stableIdFromNumericUuid(incrementUuid(uuid, 256)),\n\t\t\t(e: Error) => validateAssertionError(e, 'Exceeded maximum numeric UUID')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => stableIdFromNumericUuid(uuid, Number.MAX_SAFE_INTEGER),\n\t\t\t(e: Error) => validateAssertionError(e, 'Exceeded maximum numeric UUID')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => stableIdFromNumericUuid(incrementUuid(uuid, Number.MAX_SAFE_INTEGER)),\n\t\t\t(e: Error) => validateAssertionError(e, 'Exceeded maximum numeric UUID')\n\t\t);\n\t});\n\n\tit('can rehydrate a valid session UUID', () => {\n\t\tconst uuid = assertIsStableId('44f95a8b-c52b-4828-a000-0000f0000003');\n\t\tconst sessionUuid = numericUuidFromStableId(uuid);\n\t\texpect(stableIdFromNumericUuid(sessionUuid)).to.equal(uuid);\n\t});\n\n\tit('can create valid session UUIDs', () => {\n\t\tfor (let i = 0; i < 100; i++) {\n\t\t\tconst sessionId = createSessionId();\n\t\t\texpect(sessionId.length).to.equal(36);\n\n\t\t\tconst sessionNumericUuid = numericUuidFromStableId(sessionId);\n\t\t\texpect(stableIdFromNumericUuid(sessionNumericUuid)).to.equal(sessionId);\n\t\t}\n\t});\n\n\tconst maxUuidBigint = bigIntFromStableId(maxStableId);\n\n\tit('ensures that session UUIDs are resistant to overflow', () => {\n\t\tconst uuid = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');\n\t\tfor (let i = 0; i < 128; i++) {\n\t\t\tconst ensuredUuid = ensureSessionUuid(uuid);\n\t\t\texpect(isStableId(ensuredUuid)).to.be.true;\n\t\t\tconst ensuredBigint = bigIntFromStableId(ensuredUuid);\n\t\t\texpect(maxUuidBigint - ensuredBigint > Number.MAX_SAFE_INTEGER).to.be.true;\n\t\t}\n\t});\n\n\tit('correctly adjusts session UUIDs that are in danger of overflow', () => {\n\t\tconst dangerous = [\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bff0-000000000000'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bf00-000000000000'),\n\t\t];\n\n\t\tconst safe = [\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-beff-ffffffffffff'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bef0-000000000000'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-be00-000000000000'),\n\t\t];\n\n\t\tdangerous.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.not.equal(stableId));\n\t\tsafe.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.equal(stableId));\n\t});\n\n\tconst stableIds = [\n\t\tassertIsStableId('748540ca-b7c5-4c99-83ff-c1b8e02c09d6'),\n\t\tassertIsStableId('748540ca-b7c5-4c99-83ef-c1b8e02c09d6'),\n\t\tassertIsStableId('748540ca-b7c5-4c99-831f-c1b8e02c09d6'),\n\t\tassertIsStableId('0002c79e-b536-4776-b000-000266c252d5'),\n\t\tassertIsStableId('082533b9-6d05-4068-a008-fe2cc43543f7'),\n\t\tassertIsStableId('2c9fa1f8-48d5-4554-a466-000000000000'),\n\t\tassertIsStableId('2c9fa1f8-48d5-4000-a000-000000000000'),\n\t\tassertIsStableId('10000000-0000-4000-b000-000000000000'),\n\t\tassertIsStableId('10000000-0000-4000-b020-000000000000'), // 2^52\n\t\tassertIsStableId('10000000-0000-4000-b00f-ffffffffffff'),\n\t\tassertIsStableId('10000000-0000-4000-b040-000000000000'),\n\t\tassertIsStableId('f0000000-0000-4000-8000-000000000000'),\n\t\tassertIsStableId('efffffff-ffff-4fff-bfff-ffffffffffff'),\n\t\tintegerToStableId(0),\n\t\tintegerToStableId(1),\n\t\tintegerToStableId(77),\n\t\tintegerToStableId(1024),\n\t\tintegerToStableId(2 ** 32 - 1),\n\t\tintegerToStableId(2 ** 52 - 1),\n\t\tintegerToStableId(Number.MAX_SAFE_INTEGER),\n\t\tintegerToStableId(Number.MAX_SAFE_INTEGER - 1),\n\t];\n\n\tdescribe('incrementing', () => {\n\t\tconst rand = makeRandom(0);\n\t\tconst incrementAmounts = [\n\t\t\t...[...new Array(53).keys()].map((n) => 2 ** n - 1),\n\t\t\t...[...new Array(10).keys()].map((_) => rand.integer(0, Number.MAX_SAFE_INTEGER)),\n\t\t];\n\t\tstableIds.forEach((stableId) => {\n\t\t\tit(`can increment ${stableId}`, () => {\n\t\t\t\tconst uuid = numericUuidFromStableId(stableId);\n\n\t\t\t\tincrementAmounts.forEach((incrementAmount) => {\n\t\t\t\t\tconst bigintIncremented = bigIntFromStableId(stableId) + BigInt(incrementAmount);\n\t\t\t\t\tconst incremented = incrementUuid(uuid, incrementAmount);\n\t\t\t\t\tconst bigintStr = integerToStableId(bigintIncremented);\n\t\t\t\t\texpect(stableIdFromNumericUuid(incremented)).to.equal(bigintStr);\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\t});\n\n\tit('delta calculation can calculate the integer delta between stable ids', () => {\n\t\tstableIds.forEach((stableIdA) => {\n\t\t\tconst uuidA = numericUuidFromStableId(stableIdA);\n\t\t\tconst bigintA = bigIntFromStableId(stableIdA);\n\t\t\tconst arbitraryMaxDelta = 2 ** 32 - 1;\n\t\t\tstableIds.forEach((stableIdB) => {\n\t\t\t\tconst uuidB = numericUuidFromStableId(stableIdB);\n\t\t\t\tconst bigintB = bigIntFromStableId(stableIdB);\n\t\t\t\tconst realDelta = bigintA - bigintB;\n\t\t\t\tconst numericDelta = getPositiveDelta(uuidA, uuidB, Number.MAX_SAFE_INTEGER);\n\t\t\t\tif (realDelta > Number.MAX_SAFE_INTEGER || realDelta < 0) {\n\t\t\t\t\texpect(numericDelta).to.equal(undefined);\n\t\t\t\t} else {\n\t\t\t\t\texpect(numericDelta).to.equal(Number(realDelta));\n\t\t\t\t}\n\t\t\t\tconst numericDeltaCapped = getPositiveDelta(uuidA, uuidB, arbitraryMaxDelta);\n\t\t\t\tif (realDelta >= 0 && realDelta <= arbitraryMaxDelta) {\n\t\t\t\t\texpect(numericDeltaCapped).to.equal(Number(realDelta));\n\t\t\t\t} else {\n\t\t\t\t\texpect(numericDeltaCapped).to.equal(undefined);\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\t});\n\n\tit('can round trip between stable ID and uuid', () => {\n\t\tstableIds.forEach((stableId) => {\n\t\t\tconst uuid = numericUuidFromStableId(stableId);\n\t\t\tconst roundTripped = stableIdFromNumericUuid(uuid);\n\t\t\texpect(stableId).to.equal(roundTripped);\n\t\t});\n\t});\n\n\tit('can compare numeric uuids', () => {\n\t\tstableIds.forEach((stableIdA) => {\n\t\t\tstableIds.forEach((stableIdB) => {\n\t\t\t\tconst numericA = numericUuidFromStableId(stableIdA);\n\t\t\t\tconst numericB = numericUuidFromStableId(stableIdB);\n\t\t\t\tconst comparedNumeric = numericUuidEquals(numericA, numericB);\n\t\t\t\tconst comparedStrings = compareStrings(stableIdA, stableIdB);\n\t\t\t\texpect(comparedNumeric).to.equal(comparedStrings === 0);\n\t\t\t});\n\t\t});\n\t});\n});\n\nfunction bigIntFromStableId(id: StableId): bigint {\n\tconst minimized = id.replace(/-/g, '');\n\t//      UUID | xxxxxxxx-xxxx-Vxxx-vxxx-xxxxxxxxxxxx | The StableId passed to this function, shown here in standard UUID notation\n\t//   nibbles | hhhhhhhh hhhh  mmm llll llllllllllll | Whether or not each nibble is part of the \"high\", \"middle\" or \"low\" group below\n\t// bit count | 44444444-4444-0444-2444-444444444444 | The number of bits per nibble that are used to encode the number\n\n\t// Interpret numerically...\n\tconst highNibbles = BigInt(`0x${minimized.substr(0, 12)}`); // ...all nibbles above the version nibble,\n\tconst midNibbles = BigInt(`0x${minimized.substr(13, 3)}`); //  the nibbles below the version nibble and above the variant nibble,\n\tconst lowNibbles = BigInt(`0x${minimized.substr(16, 16)}`); // and the variant nibble and all nibbles below\n\t// Count the number of bits that contribute to the number (i.e. are not reserved for version/variant) in...\n\tconst lowBitCount = BigInt(62); // ...the low nibbles\n\tconst midBitCount = BigInt(12); // and the mid nibbles\n\t// Shift the values of each region by the appropriate number of bits\n\tconst highNumber = highNibbles << (midBitCount + lowBitCount);\n\tconst midNumber = midNibbles << lowBitCount;\n\t// The low nibbles include the variant nibble because its two low bits are numerical (but its two upper bits are not). So mask them out:\n\tconst lowNumber = lowNibbles & BigInt('0x3fffffffffffffff'); // A nibble '0011' followed by 15 nibbles '1111'.\n\t// Now that high and mid are shifted correctly, the final number is their sum:\n\treturn highNumber + midNumber + lowNumber;\n}\n"]}

package/lib/test/RevisionValueCache.tests.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=RevisionValueCache.tests.d.ts.map

package/lib/test/RevisionValueCache.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RevisionValueCache.tests.d.ts","sourceRoot":"","sources":["../../src/test/RevisionValueCache.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/RevisionValueCache.tests.js

@@ -1,106 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from 'assert';
-import { expect } from 'chai';
-import { validateAssertionError } from '@fluidframework/test-runtime-utils';
-import { fail } from '../Common.js';
-import { RevisionValueCache } from '../RevisionValueCache.js';
-const dummyValue = -1;
-describe('RevisionValueCache', () => {
-    function closestEntry(cache, revision) {
-        return (cache.getClosestEntry(revision) ?? fail('No prior revision'))[0];
-    }
-    it('cannot be created with a negative retention window', () => {
-        assert.throws(() => new RevisionValueCache(1, -1), (e) => validateAssertionError(e, 'retentionWindowStart must be initialized >= 0'));
-    });
-    it('cannot move the retention window backwards', () => {
-        const cache = new RevisionValueCache(1, 0);
-        assert.throws(() => cache.updateRetentionWindow(-1), (e) => validateAssertionError(e, 'retention window boundary must not move backwards'));
-    });
-    it('can find closest entry to a queried revision', () => {
-        const cache = new RevisionValueCache(1, 0, [0, dummyValue]);
-        cache.cacheValue(2, dummyValue);
-        expect(closestEntry(cache, 1)).to.equal(0);
-        expect(closestEntry(cache, 2)).to.equal(2);
-        expect(closestEntry(cache, 3)).to.equal(2);
-    });
-    it('evicts entries when full', () => {
-        const size = 3;
-        const cache = new RevisionValueCache(size, size * 3 /* ensure all entries are outside of window */, [0, dummyValue]);
-        // Fill the cache
-        // Start at 1 because the initial revision is never evicted
-        for (let i = 1; i <= size; i++) {
-            cache.cacheValue(i, dummyValue);
-        }
-        for (let i = size + 1; i <= size * 2; i++) {
-            cache.cacheValue(i, dummyValue);
-            // Should have evicted the oldest entry
-            expect(closestEntry(cache, i - size)).to.equal(0);
-        }
-        for (let i = size + 1; i <= size * 2; i++) {
-            expect(closestEntry(cache, i)).to.equal(i);
-        }
-    });
-    it('retains entries within the retention window', () => {
-        const windowStart = 3;
-        const windowEnd = windowStart + 3;
-        const cache = new RevisionValueCache(1, windowStart, [0, dummyValue]);
-        // Add entries within retention window
-        for (let i = windowStart; i <= windowEnd; i++) {
-            cache.cacheValue(i, dummyValue);
-        }
-        // Add entries outside the retention window. These should not cause the in-window entries to be evicted.
-        for (let i = 1; i <= windowStart; i++) {
-            cache.cacheValue(i, dummyValue);
-        }
-        for (let i = windowStart; i <= windowEnd; i++) {
-            expect(closestEntry(cache, i)).to.equal(i);
-        }
-        for (let i = 1; i < windowStart - 1; i++) {
-            expect(closestEntry(cache, i)).to.equal(0);
-        }
-    });
-    it('can evict entries that move out of the retention window', () => {
-        const cache = new RevisionValueCache(1, 0);
-        cache.cacheValue(5, dummyValue);
-        cache.cacheValue(1, dummyValue);
-        expect(closestEntry(cache, 5)).to.equal(5);
-        cache.updateRetentionWindow(6); // adds 5 to LRU, evicts 1
-        cache.cacheValue(2, dummyValue); // evicts 5
-        expect(closestEntry(cache, 5)).to.equal(2);
-    });
-    it('only keeps one explicitly retained value', () => {
-        const cache = new RevisionValueCache(1, 3, [0, dummyValue]);
-        cache.cacheValue(1, dummyValue);
-        // Add a retained entry outside of the retention window
-        cache.cacheRetainedValue(5, dummyValue); // This evicts the previously retained value, 0
-        expect(closestEntry(cache, 1)).to.equal(1);
-        expect(closestEntry(cache, 5)).to.equal(5);
-        cache.cacheValue(2, dummyValue); // Evict 1
-        cache.updateRetentionWindow(10); // Should not add 5, so 2 will still be in cache
-        assert.throws(() => closestEntry(cache, 1)); // 0 will no longer be retained so 1 should be inaccessible
-        expect(closestEntry(cache, 2)).to.equal(2);
-        expect(closestEntry(cache, 5)).to.equal(5);
-        cache.cacheValue(3, dummyValue); // Evict 2
-        assert.throws(() => closestEntry(cache, 2));
-        expect(closestEntry(cache, 5)).to.equal(5);
-    });
-    it('can update retention window to a new range that moves > evictableSize entries', () => {
-        const cacheSize = 5;
-        const cache = new RevisionValueCache(cacheSize, 0);
-        cache.cacheRetainedValue(0, dummyValue);
-        for (let i = 0; i < cacheSize * 3; i++) {
-            cache.cacheValue(i, dummyValue);
-        }
-        for (let i = 0; i < cacheSize * 3; i++) {
-            expect(closestEntry(cache, i)).to.equal(i); // All entries are cached since they are in the window.
-        }
-        cache.updateRetentionWindow(cacheSize * 2 + 1); // adds 2 * cache size to LRU, so [0, cacheSize] should be evicted
-        for (let i = 1; i <= cacheSize; i++) {
-            expect(closestEntry(cache, i)).to.equal(0);
-        }
-    });
-});
-//# sourceMappingURL=RevisionValueCache.tests.js.map

package/lib/test/RevisionValueCache.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"RevisionValueCache.tests.js","sourceRoot":"","sources":["../../src/test/RevisionValueCache.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACpC,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAG9D,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC;AAEtB,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,SAAS,YAAY,CAAC,KAAqC,EAAE,QAAgB;QAC5E,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,IAAI,kBAAkB,CAAa,CAAC,EAAE,CAAC,CAAC,CAAC,EAC/C,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+CAA+C,CAAC,CACxF,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAa,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,EACrC,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,mDAAmD,CAAC,CAC5F,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAa,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QACxE,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAChC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,MAAM,IAAI,GAAG,CAAC,CAAC;QACf,MAAM,KAAK,GAAG,IAAI,kBAAkB,CACnC,IAAI,EACJ,IAAI,GAAG,CAAC,CAAC,8CAA8C,EACvD,CAAC,CAAC,EAAE,UAAU,CAAC,CACf,CAAC;QAEF,iBAAiB;QACjB,2DAA2D;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE;YAC/B,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAChC;QACD,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1C,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAChC,uCAAuC;YACvC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAClD;QACD,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAC3C;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,MAAM,WAAW,GAAG,CAAC,CAAC;QACtB,MAAM,SAAS,GAAG,WAAW,GAAG,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAa,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QAElF,sCAAsC;QACtC,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE;YAC9C,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAChC;QACD,wGAAwG;QACxG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE;YACtC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAChC;QACD,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE;YAC9C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAC3C;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACzC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAC3C;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAa,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAChC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAChC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,KAAK,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,0BAA0B;QAC1D,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,WAAW;QAC5C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAa,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QACxE,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAChC,uDAAuD;QACvD,KAAK,CAAC,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,+CAA+C;QACxF,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU;QAC3C,KAAK,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CAAC,gDAAgD;QACjF,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,2DAA2D;QACxG,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU;QAC3C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+EAA+E,EAAE,GAAG,EAAE;QACxF,MAAM,SAAS,GAAG,CAAC,CAAC;QACpB,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAa,SAAS,EAAE,CAAC,CAAC,CAAC;QAC/D,KAAK,CAAC,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACvC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAChC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,uDAAuD;SACnG;QACD,KAAK,CAAC,qBAAqB,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,kEAAkE;QAClH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAC3C;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from 'assert';\nimport { expect } from 'chai';\nimport { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { fail } from '../Common.js';\nimport { RevisionValueCache } from '../RevisionValueCache.js';\n\ntype DummyValue = number;\nconst dummyValue = -1;\n\ndescribe('RevisionValueCache', () => {\n\tfunction closestEntry(cache: RevisionValueCache<DummyValue>, revision: number): number {\n\t\treturn (cache.getClosestEntry(revision) ?? fail('No prior revision'))[0];\n\t}\n\n\tit('cannot be created with a negative retention window', () => {\n\t\tassert.throws(\n\t\t\t() => new RevisionValueCache<DummyValue>(1, -1),\n\t\t\t(e: Error) => validateAssertionError(e, 'retentionWindowStart must be initialized >= 0')\n\t\t);\n\t});\n\n\tit('cannot move the retention window backwards', () => {\n\t\tconst cache = new RevisionValueCache<DummyValue>(1, 0);\n\t\tassert.throws(\n\t\t\t() => cache.updateRetentionWindow(-1),\n\t\t\t(e: Error) => validateAssertionError(e, 'retention window boundary must not move backwards')\n\t\t);\n\t});\n\n\tit('can find closest entry to a queried revision', () => {\n\t\tconst cache = new RevisionValueCache<DummyValue>(1, 0, [0, dummyValue]);\n\t\tcache.cacheValue(2, dummyValue);\n\t\texpect(closestEntry(cache, 1)).to.equal(0);\n\t\texpect(closestEntry(cache, 2)).to.equal(2);\n\t\texpect(closestEntry(cache, 3)).to.equal(2);\n\t});\n\n\tit('evicts entries when full', () => {\n\t\tconst size = 3;\n\t\tconst cache = new RevisionValueCache<DummyValue>(\n\t\t\tsize,\n\t\t\tsize * 3 /* ensure all entries are outside of window */,\n\t\t\t[0, dummyValue]\n\t\t);\n\n\t\t// Fill the cache\n\t\t// Start at 1 because the initial revision is never evicted\n\t\tfor (let i = 1; i <= size; i++) {\n\t\t\tcache.cacheValue(i, dummyValue);\n\t\t}\n\t\tfor (let i = size + 1; i <= size * 2; i++) {\n\t\t\tcache.cacheValue(i, dummyValue);\n\t\t\t// Should have evicted the oldest entry\n\t\t\texpect(closestEntry(cache, i - size)).to.equal(0);\n\t\t}\n\t\tfor (let i = size + 1; i <= size * 2; i++) {\n\t\t\texpect(closestEntry(cache, i)).to.equal(i);\n\t\t}\n\t});\n\n\tit('retains entries within the retention window', () => {\n\t\tconst windowStart = 3;\n\t\tconst windowEnd = windowStart + 3;\n\t\tconst cache = new RevisionValueCache<DummyValue>(1, windowStart, [0, dummyValue]);\n\n\t\t// Add entries within retention window\n\t\tfor (let i = windowStart; i <= windowEnd; i++) {\n\t\t\tcache.cacheValue(i, dummyValue);\n\t\t}\n\t\t// Add entries outside the retention window. These should not cause the in-window entries to be evicted.\n\t\tfor (let i = 1; i <= windowStart; i++) {\n\t\t\tcache.cacheValue(i, dummyValue);\n\t\t}\n\t\tfor (let i = windowStart; i <= windowEnd; i++) {\n\t\t\texpect(closestEntry(cache, i)).to.equal(i);\n\t\t}\n\t\tfor (let i = 1; i < windowStart - 1; i++) {\n\t\t\texpect(closestEntry(cache, i)).to.equal(0);\n\t\t}\n\t});\n\n\tit('can evict entries that move out of the retention window', () => {\n\t\tconst cache = new RevisionValueCache<DummyValue>(1, 0);\n\t\tcache.cacheValue(5, dummyValue);\n\t\tcache.cacheValue(1, dummyValue);\n\t\texpect(closestEntry(cache, 5)).to.equal(5);\n\t\tcache.updateRetentionWindow(6); // adds 5 to LRU, evicts 1\n\t\tcache.cacheValue(2, dummyValue); // evicts 5\n\t\texpect(closestEntry(cache, 5)).to.equal(2);\n\t});\n\n\tit('only keeps one explicitly retained value', () => {\n\t\tconst cache = new RevisionValueCache<DummyValue>(1, 3, [0, dummyValue]);\n\t\tcache.cacheValue(1, dummyValue);\n\t\t// Add a retained entry outside of the retention window\n\t\tcache.cacheRetainedValue(5, dummyValue); // This evicts the previously retained value, 0\n\t\texpect(closestEntry(cache, 1)).to.equal(1);\n\t\texpect(closestEntry(cache, 5)).to.equal(5);\n\t\tcache.cacheValue(2, dummyValue); // Evict 1\n\t\tcache.updateRetentionWindow(10); // Should not add 5, so 2 will still be in cache\n\t\tassert.throws(() => closestEntry(cache, 1)); // 0 will no longer be retained so 1 should be inaccessible\n\t\texpect(closestEntry(cache, 2)).to.equal(2);\n\t\texpect(closestEntry(cache, 5)).to.equal(5);\n\t\tcache.cacheValue(3, dummyValue); // Evict 2\n\t\tassert.throws(() => closestEntry(cache, 2));\n\t\texpect(closestEntry(cache, 5)).to.equal(5);\n\t});\n\n\tit('can update retention window to a new range that moves > evictableSize entries', () => {\n\t\tconst cacheSize = 5;\n\t\tconst cache = new RevisionValueCache<DummyValue>(cacheSize, 0);\n\t\tcache.cacheRetainedValue(0, dummyValue);\n\t\tfor (let i = 0; i < cacheSize * 3; i++) {\n\t\t\tcache.cacheValue(i, dummyValue);\n\t\t}\n\t\tfor (let i = 0; i < cacheSize * 3; i++) {\n\t\t\texpect(closestEntry(cache, i)).to.equal(i); // All entries are cached since they are in the window.\n\t\t}\n\t\tcache.updateRetentionWindow(cacheSize * 2 + 1); // adds 2 * cache size to LRU, so [0, cacheSize] should be evicted\n\t\tfor (let i = 1; i <= cacheSize; i++) {\n\t\t\texpect(closestEntry(cache, i)).to.equal(0);\n\t\t}\n\t});\n});\n"]}

package/lib/test/RevisionView.tests.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=RevisionView.tests.d.ts.map

package/lib/test/RevisionView.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RevisionView.tests.d.ts","sourceRoot":"","sources":["../../src/test/RevisionView.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/RevisionView.tests.js

@@ -1,131 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { getChangeNodeFromViewNode } from '../SerializationUtilities.js';
-import { convertTreeNodesToViewNodes, RevisionView } from '../RevisionView.js';
-import { StablePlace, StableRange } from '../ChangeTypes.js';
-import { detachRange, insertIntoTrait } from '../EditUtilities.js';
-import { expectDefined } from './utilities/TestCommon.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-describe('RevisionView', () => {
-    const testTree = refreshTestTree();
-    describe('creation from a ChangeNode', () => {
-        it('ignores empty traits', () => {
-            const leaf = testTree.buildLeaf(testTree.generateNodeId());
-            const node = {
-                traits: {
-                    trait: [leaf],
-                    emptyTrait: [],
-                },
-                definition: testTree.definition,
-                identifier: testTree.identifier,
-            };
-            const view = RevisionView.fromTree(node);
-            const changeNode = getChangeNodeFromViewNode(view, testTree.identifier);
-            expect(changeNode.traits.trait[0].identifier).to.equal(leaf.identifier);
-            expect(changeNode.traits.emptyTrait).to.equal(undefined);
-        });
-    });
-    it('correctly converts tree nodes', () => {
-        const viewNodes = expectDefined(convertTreeNodesToViewNodes(testTree, (node) => ({
-            definition: node.definition,
-            identifier: node.identifier,
-        })));
-        let createdRoot = false;
-        let createdLeft = false;
-        let createdRight = false;
-        for (let viewNode = viewNodes.pop(); viewNode !== undefined; viewNode = viewNodes.pop()) {
-            switch (viewNode.identifier) {
-                case testTree.identifier:
-                    expect(createdRoot).to.be.false;
-                    expect(viewNode.definition).to.equal(testTree.definition);
-                    expect(viewNode.traits.size).to.equal(2);
-                    expect(viewNode.traits.get(testTree.left.traitLabel)).to.deep.equal([testTree.left.identifier]);
-                    expect(viewNode.traits.get(testTree.right.traitLabel)).to.deep.equal([testTree.right.identifier]);
-                    createdRoot = true;
-                    break;
-                case testTree.left.identifier:
-                    expect(createdLeft).to.be.false;
-                    expect(viewNode.definition).to.equal(testTree.left.definition);
-                    expect(viewNode.traits.size).to.equal(0);
-                    createdLeft = true;
-                    break;
-                case testTree.right.identifier:
-                    expect(createdRight).to.be.false;
-                    expect(viewNode.definition).to.equal(testTree.right.definition);
-                    expect(viewNode.traits.size).to.equal(0);
-                    createdRight = true;
-                    break;
-                default:
-                    expect.fail('Unexpected view node ID');
-            }
-        }
-    });
-    it('correctly handles tree node conversion failure', () => {
-        let nodesConverted = 0;
-        const viewNodes = convertTreeNodesToViewNodes(testTree, (node) => {
-            if (nodesConverted++ >= 2) {
-                return undefined;
-            }
-            return {
-                definition: node.definition,
-                identifier: node.identifier,
-            };
-        });
-        expect(viewNodes).to.be.undefined;
-    });
-});
-describe('TransactionView', () => {
-    const testTree = refreshTestTree();
-    const traitLabel = 'trait';
-    function getTree() {
-        const childA = testTree.buildLeaf(testTree.generateNodeId());
-        const childB = testTree.buildLeaf(testTree.generateNodeId());
-        const parent = {
-            traits: {
-                [traitLabel]: [childA, childB],
-            },
-            definition: testTree.definition,
-            identifier: testTree.identifier,
-        };
-        return { parent, childA, childB };
-    }
-    it('can detach a single node in a trait', () => {
-        const { parent, childA, childB } = getTree();
-        const startingView = RevisionView.fromTree(parent).openForTransaction();
-        const { view } = detachRange(startingView, StableRange.only(childA));
-        expect(view.size).to.equal(3);
-        expect(view.hasNode(childA.identifier)).to.be.true;
-        expect(view.tryGetParentViewNode(childA.identifier)).to.be.undefined;
-        expect(view.tryGetParentViewNode(childB.identifier)?.identifier).to.equal(parent.identifier);
-        expect(view.getIndexInTrait(childB.identifier)).to.equal(0);
-    });
-    it('can detach an entire trait', () => {
-        const { parent, childA, childB } = getTree();
-        const startingView = RevisionView.fromTree(parent).openForTransaction();
-        const { view, detached } = detachRange(startingView, StableRange.all({ parent: parent.identifier, label: traitLabel }));
-        expect(detached).deep.equals([childA.identifier, childB.identifier]);
-        expect(view.size).to.equal(3);
-        expect(view.hasNode(childA.identifier)).to.be.true;
-        expect(view.hasNode(childB.identifier)).to.be.true;
-        expect(view.tryGetParentViewNode(childA.identifier)).to.be.undefined;
-        expect(view.tryGetParentViewNode(childB.identifier)).to.be.undefined;
-    });
-    it('can insert a node', () => {
-        const { parent, childA, childB } = getTree();
-        const startingView = RevisionView.fromTree(parent).openForTransaction();
-        const newNode = testTree.buildLeaf(testTree.generateNodeId());
-        let view = startingView.addNodes([{ ...newNode, traits: new Map() }]);
-        expect(view.size).to.equal(4);
-        expect(view.hasNode(newNode.identifier)).to.be.true;
-        expect(view.tryGetParentViewNode(newNode.identifier)).to.be.undefined;
-        view = insertIntoTrait(view, [newNode.identifier], StablePlace.atStartOf({ parent: parent.identifier, label: traitLabel }));
-        expect(view.tryGetParentViewNode(newNode.identifier)?.identifier).to.equal(parent.identifier);
-        expect(view.getIndexInTrait(newNode.identifier)).to.equal(0);
-        expect(view.getIndexInTrait(childA.identifier)).to.equal(1);
-        expect(view.getIndexInTrait(childB.identifier)).to.equal(2);
-    });
-});
-//# sourceMappingURL=RevisionView.tests.js.map