@fluidframework/container-runtime 2.0.0-internal.7.3.0 → 2.0.0-internal.7.4.0

package/lib/id-compressor/index.js

@@ -1,13 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/**
- * Exports for `id-compressor`
- */
-export { IdCompressor } from "./idCompressor";
-export { compareFiniteNumbers, createSessionId, assertIsSessionId, numericUuidFromStableId, offsetNumericUuid, stableIdFromNumericUuid, subtractNumericUuids, addNumericUuids, assertIsStableId, generateStableId, isStableId, } from "./utilities";
-export { readNumericUuid, writeNumericUuid } from "./persistanceUtilities";
-export { AppendOnlySortedMap } from "./appendOnlySortedMap";
-export { SessionSpaceNormalizer } from "./sessionSpaceNormalizer";
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/id-compressor/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EACN,oBAAoB,EACpB,eAAe,EACf,iBAAiB,EACjB,uBAAuB,EACvB,iBAAiB,EACjB,uBAAuB,EACvB,oBAAoB,EACpB,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,UAAU,GACV,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC3E,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC","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 { IdCompressor } from \"./idCompressor\";\nexport {\n\tcompareFiniteNumbers,\n\tcreateSessionId,\n\tassertIsSessionId,\n\tnumericUuidFromStableId,\n\toffsetNumericUuid,\n\tstableIdFromNumericUuid,\n\tsubtractNumericUuids,\n\taddNumericUuids,\n\tassertIsStableId,\n\tgenerateStableId,\n\tisStableId,\n} from \"./utilities\";\nexport { readNumericUuid, writeNumericUuid } from \"./persistanceUtilities\";\nexport { AppendOnlySortedMap } from \"./appendOnlySortedMap\";\nexport { SessionSpaceNormalizer } from \"./sessionSpaceNormalizer\";\n"]}

package/lib/id-compressor/persistanceUtilities.d.ts

@@ -1,22 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { NumericUuid } from "./identifiers";
-export declare function writeNumber(buffer: Float64Array, index: number, value: number): number;
-export declare function writeNumericUuid(buffer: BigUint64Array, index: number, value: NumericUuid): number;
-export declare function writeBoolean(buffer: Float64Array, index: number, value: boolean): number;
-/**
- * Helper type to allow returning a value when reading as well as incrementing an index to make
- * deserialization easier.
- * Should be constructed with two views of the same buffer and index set to 0.
- */
-export interface Index {
-    bufferFloat: Float64Array;
-    bufferUint: BigUint64Array;
-    index: number;
-}
-export declare function readNumber(index: Index): number;
-export declare function readNumericUuid(index: Index): NumericUuid;
-export declare function readBoolean(index: Index): boolean;
-//# sourceMappingURL=persistanceUtilities.d.ts.map

package/lib/id-compressor/persistanceUtilities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"persistanceUtilities.d.ts","sourceRoot":"","sources":["../../src/id-compressor/persistanceUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAK5C,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGtF;AAED,wBAAgB,gBAAgB,CAC/B,MAAM,EAAE,cAAc,EACtB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,WAAW,GAChB,MAAM,CAIR;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAExF;AAED;;;;GAIG;AACH,MAAM,WAAW,KAAK;IACrB,WAAW,EAAE,YAAY,CAAC;IAC1B,UAAU,EAAE,cAAc,CAAC;IAC3B,KAAK,EAAE,MAAM,CAAC;CACd;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAI/C;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAMzD;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAEjD"}

package/lib/id-compressor/persistanceUtilities.js

@@ -1,34 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-const halfNumeric = BigInt("0xFFFFFFFFFFFFFFFF");
-const sixtyFour = BigInt(64);
-export function writeNumber(buffer, index, value) {
-    buffer[index] = value;
-    return index + 1;
-}
-export function writeNumericUuid(buffer, index, value) {
-    buffer[index] = value & halfNumeric;
-    buffer[index + 1] = value >> sixtyFour;
-    return index + 2; // UUID values are 16 bytes.
-}
-export function writeBoolean(buffer, index, value) {
-    return writeNumber(buffer, index, value ? 1 : 0);
-}
-export function readNumber(index) {
-    const value = index.bufferFloat[index.index];
-    index.index += 1;
-    return value;
-}
-export function readNumericUuid(index) {
-    const lowerHalf = index.bufferUint[index.index];
-    const upperHalf = index.bufferUint[index.index + 1];
-    const value = (upperHalf << sixtyFour) | lowerHalf;
-    index.index += 2;
-    return value;
-}
-export function readBoolean(index) {
-    return readNumber(index) === 1;
-}
-//# sourceMappingURL=persistanceUtilities.js.map

package/lib/id-compressor/persistanceUtilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"persistanceUtilities.js","sourceRoot":"","sources":["../../src/id-compressor/persistanceUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,MAAM,WAAW,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC;AACjD,MAAM,SAAS,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AAE7B,MAAM,UAAU,WAAW,CAAC,MAAoB,EAAE,KAAa,EAAE,KAAa;IAC7E,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACtB,OAAO,KAAK,GAAG,CAAC,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC/B,MAAsB,EACtB,KAAa,EACb,KAAkB;IAElB,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,WAAW,CAAC;IACpC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,IAAI,SAAS,CAAC;IACvC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,4BAA4B;AAC/C,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,MAAoB,EAAE,KAAa,EAAE,KAAc;IAC/E,OAAO,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAaD,MAAM,UAAU,UAAU,CAAC,KAAY;IACtC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC7C,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IACjB,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAY;IAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,CAAC,SAAS,IAAI,SAAS,CAAC,GAAG,SAAS,CAAC;IACnD,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IACjB,OAAO,KAAoB,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAY;IACvC,OAAO,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAChC,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 */\nimport { NumericUuid } from \"./identifiers\";\n\nconst halfNumeric = BigInt(\"0xFFFFFFFFFFFFFFFF\");\nconst sixtyFour = BigInt(64);\n\nexport function writeNumber(buffer: Float64Array, index: number, value: number): number {\n\tbuffer[index] = value;\n\treturn index + 1;\n}\n\nexport function writeNumericUuid(\n\tbuffer: BigUint64Array,\n\tindex: number,\n\tvalue: NumericUuid,\n): number {\n\tbuffer[index] = value & halfNumeric;\n\tbuffer[index + 1] = value >> sixtyFour;\n\treturn index + 2; // UUID values are 16 bytes.\n}\n\nexport function writeBoolean(buffer: Float64Array, index: number, value: boolean): number {\n\treturn writeNumber(buffer, index, value ? 1 : 0);\n}\n\n/**\n * Helper type to allow returning a value when reading as well as incrementing an index to make\n * deserialization easier.\n * Should be constructed with two views of the same buffer and index set to 0.\n */\nexport interface Index {\n\tbufferFloat: Float64Array;\n\tbufferUint: BigUint64Array;\n\tindex: number;\n}\n\nexport function readNumber(index: Index): number {\n\tconst value = index.bufferFloat[index.index];\n\tindex.index += 1;\n\treturn value;\n}\n\nexport function readNumericUuid(index: Index): NumericUuid {\n\tconst lowerHalf = index.bufferUint[index.index];\n\tconst upperHalf = index.bufferUint[index.index + 1];\n\tconst value = (upperHalf << sixtyFour) | lowerHalf;\n\tindex.index += 2;\n\treturn value as NumericUuid;\n}\n\nexport function readBoolean(index: Index): boolean {\n\treturn readNumber(index) === 1;\n}\n"]}

package/lib/id-compressor/sessionSpaceNormalizer.d.ts

@@ -1,46 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { AppendOnlySortedMap } from "./appendOnlySortedMap";
-import { LocalCompressedId } from "./identifiers";
-/**
- * The `SessionSpaceNormalizer` tracks the form of the IDs created by the local session.
- * More precisely, it acts as a set of all `LocalCompressedId`s created by the local session and allows querying whether a specific
- * ID was produced by the local session. This information can be used to determine whether the nth ID created by the local session
- * was produced as a local ID (negative) or a final ID (positive).
- *
- * The local and final forms of IDs made by a session can be thought of as two equal-length sparse arrays, aligned such
- * that normalizeLocalToFinal(locals[i]) === finals[i] and vice versa.
- * Below is an example to illustrate how various mappings can arise:
- *
- * ```
- *     +- Creation Index
- *    /     +- Locals
- *   /     /    +- Finals
- *  /     /    /
- * ---+-----+----
- * 0  | -1  | 0   -|___ Two IDs are allocated as locals since no cluster exists. A new cluster is created when acked.
- * 1  | -2  | 1   -|
- * 2  |     | 2   -|
- * 3  |     | 3   --|-- Three more IDs are allocated as finals eagerly since a cluster exists with available capacity.
- * 4  |     | 4   -|
- * 5  | -6  | 10  ----- One ID is allocated as a local (it overflows the existing cluster) and a new cluster is created after ack.
- * 6  |     | 11  ----- This ID (and the subsequent few) is allocated eagerly as a final ID into the existing cluster.
- * 7  |     | 12
- * 8  |     | 13
- * 9  |     | 14
- * 10 | -11 |     ----- The cluster is out of room, so a local ID is allocated. It has no corresponding final ID since it has not been acked.
- * ```
- *
- * This class stores the set of local IDs and thus their indices, as local IDs are essentially negative offsets from the first ID.
- * The form (local or final) of a given ID index (for example, the 5th ID made by the local session) can be deduced from this information.
- */
-export declare class SessionSpaceNormalizer {
-    private readonly localIdRanges;
-    get idRanges(): Pick<AppendOnlySortedMap<number, number>, "size" | "entries">;
-    addLocalRange(baseGenCount: number, count: number): void;
-    contains(query: LocalCompressedId): boolean;
-    equals(other: SessionSpaceNormalizer): boolean;
-}
-//# sourceMappingURL=sessionSpaceNormalizer.d.ts.map

package/lib/id-compressor/sessionSpaceNormalizer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sessionSpaceNormalizer.d.ts","sourceRoot":"","sources":["../../src/id-compressor/sessionSpaceNormalizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAGlD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,qBAAa,sBAAsB;IAGlC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAiE;IAE/F,IAAW,QAAQ,IAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAEnF;IAEM,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAcxD,QAAQ,CAAC,KAAK,EAAE,iBAAiB,GAAG,OAAO;IAY3C,MAAM,CAAC,KAAK,EAAE,sBAAsB,GAAG,OAAO;CAMrD"}

package/lib/id-compressor/sessionSpaceNormalizer.js

@@ -1,76 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { AppendOnlySortedMap } from "./appendOnlySortedMap";
-import { compareFiniteNumbers, genCountFromLocalId } from "./utilities";
-/**
- * The `SessionSpaceNormalizer` tracks the form of the IDs created by the local session.
- * More precisely, it acts as a set of all `LocalCompressedId`s created by the local session and allows querying whether a specific
- * ID was produced by the local session. This information can be used to determine whether the nth ID created by the local session
- * was produced as a local ID (negative) or a final ID (positive).
- *
- * The local and final forms of IDs made by a session can be thought of as two equal-length sparse arrays, aligned such
- * that normalizeLocalToFinal(locals[i]) === finals[i] and vice versa.
- * Below is an example to illustrate how various mappings can arise:
- *
- * ```
- *     +- Creation Index
- *    /     +- Locals
- *   /     /    +- Finals
- *  /     /    /
- * ---+-----+----
- * 0  | -1  | 0   -|___ Two IDs are allocated as locals since no cluster exists. A new cluster is created when acked.
- * 1  | -2  | 1   -|
- * 2  |     | 2   -|
- * 3  |     | 3   --|-- Three more IDs are allocated as finals eagerly since a cluster exists with available capacity.
- * 4  |     | 4   -|
- * 5  | -6  | 10  ----- One ID is allocated as a local (it overflows the existing cluster) and a new cluster is created after ack.
- * 6  |     | 11  ----- This ID (and the subsequent few) is allocated eagerly as a final ID into the existing cluster.
- * 7  |     | 12
- * 8  |     | 13
- * 9  |     | 14
- * 10 | -11 |     ----- The cluster is out of room, so a local ID is allocated. It has no corresponding final ID since it has not been acked.
- * ```
- *
- * This class stores the set of local IDs and thus their indices, as local IDs are essentially negative offsets from the first ID.
- * The form (local or final) of a given ID index (for example, the 5th ID made by the local session) can be deduced from this information.
- */
-export class SessionSpaceNormalizer {
-    constructor() {
-        // Run-length encoding of IDs that were generated as local IDs. They are stored as a list of tuples (genCount, count)
-        // that are sorted on the genCount so that contains checks can use a binary search.
-        this.localIdRanges = new AppendOnlySortedMap(compareFiniteNumbers);
-    }
-    get idRanges() {
-        return this.localIdRanges;
-    }
-    addLocalRange(baseGenCount, count) {
-        const last = this.localIdRanges.last();
-        if (last !== undefined) {
-            const [lastGenCount, lastCount] = last;
-            // Check to see if the added run of local IDs is contiguous with the last range added.
-            // If it is, simply merge them (this is the common case).
-            if (lastGenCount + lastCount === baseGenCount) {
-                this.localIdRanges.replaceLast(lastGenCount, lastCount + count);
-                return;
-            }
-        }
-        this.localIdRanges.append(baseGenCount, count);
-    }
-    contains(query) {
-        const genCount = genCountFromLocalId(query);
-        const containingBlock = this.localIdRanges.getPairOrNextLower(genCount);
-        if (containingBlock !== undefined) {
-            const [baseGenCount, count] = containingBlock;
-            if (genCount <= baseGenCount + (count - 1)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    equals(other) {
-        return this.localIdRanges.equals(other.localIdRanges, (countA, countB) => countA === countB);
-    }
-}
-//# sourceMappingURL=sessionSpaceNormalizer.js.map

package/lib/id-compressor/sessionSpaceNormalizer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sessionSpaceNormalizer.js","sourceRoot":"","sources":["../../src/id-compressor/sessionSpaceNormalizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAE5D,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAExE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,OAAO,sBAAsB;IAAnC;QACC,qHAAqH;QACrH,mFAAmF;QAClE,kBAAa,GAAG,IAAI,mBAAmB,CAAiB,oBAAoB,CAAC,CAAC;IAsChG,CAAC;IApCA,IAAW,QAAQ;QAClB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC3B,CAAC;IAEM,aAAa,CAAC,YAAoB,EAAE,KAAa;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS,EAAE;YACvB,MAAM,CAAC,YAAY,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC;YACvC,sFAAsF;YACtF,yDAAyD;YACzD,IAAI,YAAY,GAAG,SAAS,KAAK,YAAY,EAAE;gBAC9C,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,YAAY,EAAE,SAAS,GAAG,KAAK,CAAC,CAAC;gBAChE,OAAO;aACP;SACD;QACD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IAEM,QAAQ,CAAC,KAAwB;QACvC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,eAAe,GAAG,IAAI,CAAC,aAAa,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QACxE,IAAI,eAAe,KAAK,SAAS,EAAE;YAClC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,GAAG,eAAe,CAAC;YAC9C,IAAI,QAAQ,IAAI,YAAY,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE;gBAC3C,OAAO,IAAI,CAAC;aACZ;SACD;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAEM,MAAM,CAAC,KAA6B;QAC1C,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAC/B,KAAK,CAAC,aAAa,EACnB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,MAAM,CACrC,CAAC;IACH,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { AppendOnlySortedMap } from \"./appendOnlySortedMap\";\nimport { LocalCompressedId } from \"./identifiers\";\nimport { compareFiniteNumbers, genCountFromLocalId } from \"./utilities\";\n\n/**\n * The `SessionSpaceNormalizer` tracks the form of the IDs created by the local session.\n * More precisely, it acts as a set of all `LocalCompressedId`s created by the local session and allows querying whether a specific\n * ID was produced by the local session. This information can be used to determine whether the nth ID created by the local session\n * was produced as a local ID (negative) or a final ID (positive).\n *\n * The local and final forms of IDs made by a session can be thought of as two equal-length sparse arrays, aligned such\n * that normalizeLocalToFinal(locals[i]) === finals[i] and vice versa.\n * Below is an example to illustrate how various mappings can arise:\n *\n * ```\n *     +- Creation Index\n *    /     +- Locals\n *   /     /    +- Finals\n *  /     /    /\n * ---+-----+----\n * 0  | -1  | 0   -|___ Two IDs are allocated as locals since no cluster exists. A new cluster is created when acked.\n * 1  | -2  | 1   -|\n * 2  |     | 2   -|\n * 3  |     | 3   --|-- Three more IDs are allocated as finals eagerly since a cluster exists with available capacity.\n * 4  |     | 4   -|\n * 5  | -6  | 10  ----- One ID is allocated as a local (it overflows the existing cluster) and a new cluster is created after ack.\n * 6  |     | 11  ----- This ID (and the subsequent few) is allocated eagerly as a final ID into the existing cluster.\n * 7  |     | 12\n * 8  |     | 13\n * 9  |     | 14\n * 10 | -11 |     ----- The cluster is out of room, so a local ID is allocated. It has no corresponding final ID since it has not been acked.\n * ```\n *\n * This class stores the set of local IDs and thus their indices, as local IDs are essentially negative offsets from the first ID.\n * The form (local or final) of a given ID index (for example, the 5th ID made by the local session) can be deduced from this information.\n */\nexport class SessionSpaceNormalizer {\n\t// Run-length encoding of IDs that were generated as local IDs. They are stored as a list of tuples (genCount, count)\n\t// that are sorted on the genCount so that contains checks can use a binary search.\n\tprivate readonly localIdRanges = new AppendOnlySortedMap<number, number>(compareFiniteNumbers);\n\n\tpublic get idRanges(): Pick<AppendOnlySortedMap<number, number>, \"size\" | \"entries\"> {\n\t\treturn this.localIdRanges;\n\t}\n\n\tpublic addLocalRange(baseGenCount: number, count: number): void {\n\t\tconst last = this.localIdRanges.last();\n\t\tif (last !== undefined) {\n\t\t\tconst [lastGenCount, lastCount] = last;\n\t\t\t// Check to see if the added run of local IDs is contiguous with the last range added.\n\t\t\t// If it is, simply merge them (this is the common case).\n\t\t\tif (lastGenCount + lastCount === baseGenCount) {\n\t\t\t\tthis.localIdRanges.replaceLast(lastGenCount, lastCount + count);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tthis.localIdRanges.append(baseGenCount, count);\n\t}\n\n\tpublic contains(query: LocalCompressedId): boolean {\n\t\tconst genCount = genCountFromLocalId(query);\n\t\tconst containingBlock = this.localIdRanges.getPairOrNextLower(genCount);\n\t\tif (containingBlock !== undefined) {\n\t\t\tconst [baseGenCount, count] = containingBlock;\n\t\t\tif (genCount <= baseGenCount + (count - 1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\tpublic equals(other: SessionSpaceNormalizer): boolean {\n\t\treturn this.localIdRanges.equals(\n\t\t\tother.localIdRanges,\n\t\t\t(countA, countB) => countA === countB,\n\t\t);\n\t}\n}\n"]}

package/lib/id-compressor/sessions.d.ts

@@ -1,115 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { SessionId, StableId } from "@fluidframework/runtime-definitions";
-import { FinalCompressedId, LocalCompressedId, NumericUuid } from "./identifiers";
-/**
- * A collection of all sessions known to the compressor (i.e. all finalized/acked allocated UUIDs and their corresponding local and final forms).
- * This collection of all sessions comprises a distributed document's IDs.
- */
-export declare class Sessions {
-    private readonly uuidSpace;
-    private readonly sessionCache;
-    constructor(sessions?: [sessionBase: NumericUuid, session: Session][]);
-    sessions(): IterableIterator<Session>;
-    getOrCreate(sessionId: SessionId): Session;
-    get(sessionId: SessionId): Session | undefined;
-    getContainingCluster(query: StableId): [cluster: IdCluster, alignedLocal: LocalCompressedId] | undefined;
-    clusterCollides(cluster: IdCluster): boolean;
-    equals(other: Sessions, includeLocalState: boolean): boolean;
-}
-/**
- * The IDs created by a specific session, stored as a cluster chain to allow for fast conversions.
- */
-export declare class Session {
-    private readonly clusterChain;
-    readonly sessionUuid: NumericUuid;
-    constructor(sessionId: SessionId | NumericUuid);
-    /**
-     * Adds a new empty cluster to the cluster chain of this session.
-     */
-    addNewCluster(baseFinalId: FinalCompressedId, capacity: number, count: number): IdCluster;
-    isEmpty(): boolean;
-    /**
-     * Returns the last cluster in this session's cluster chain, if any.
-     */
-    getLastCluster(): IdCluster | undefined;
-    /**
-     * Converts the local ID from this session to a final ID, if possible.
-     * @param includeAllocated - true if the conversion should succeed even if the local ID aligns with a part of the cluster that is allocated but not finalized.
-     */
-    tryConvertToFinal(searchLocal: LocalCompressedId, includeAllocated: boolean): FinalCompressedId | undefined;
-    /**
-     * Returns the cluster containing the supplied local ID, if possible.
-     * @param includeAllocated - true if the conversion should succeed even if the local ID aligns with a part of the cluster that is allocated but not finalized.
-     */
-    getClusterByLocal(localId: LocalCompressedId, includeAllocated: boolean): IdCluster | undefined;
-    /**
-     * Returns the cluster containing the supplied final ID, if possible.
-     */
-    getClusterByAllocatedFinal(final: FinalCompressedId): IdCluster | undefined;
-    /**
-     * Returns the cluster from the supplied cluster chain containing the supplied final ID, if possible.
-     * `clusterChain` must be sorted by final/local base ID.
-     */
-    static getContainingCluster(finalId: FinalCompressedId, clusterChain: readonly IdCluster[]): IdCluster | undefined;
-    static binarySearch<S, T>(search: S, arr: readonly T[], comparator: (a: S, b: T) => number): T | undefined;
-    equals(other: Session): boolean;
-}
-/**
- * A cluster of final (sequenced via consensus), sequentially allocated compressed IDs.
- * A final ID in a cluster decompresses to a sequentially allocated UUID that is the result of adding its offset within
- * the cluster to base UUID for the session that created it.
- */
-export interface IdCluster {
-    /**
-     * The session that created this cluster.
-     */
-    readonly session: Session;
-    /**
-     * The first final ID in the cluster.
-     */
-    readonly baseFinalId: FinalCompressedId;
-    /**
-     * The local ID aligned with `baseFinalId`.
-     */
-    readonly baseLocalId: LocalCompressedId;
-    /**
-     * The total number of final IDs reserved for allocation in the cluster.
-     * Clusters are reserved in blocks as a performance optimization.
-     */
-    capacity: number;
-    /**
-     * The number of final IDs currently allocated in the cluster.
-     */
-    count: number;
-}
-export declare function clustersEqual(a: IdCluster, b: IdCluster): boolean;
-/**
- * Returns the final ID that is aligned with the supplied local ID within a cluster.
- * Includes allocated IDs.
- */
-export declare function getAlignedFinal(cluster: IdCluster, localWithin: LocalCompressedId): FinalCompressedId | undefined;
-/**
- * Returns the local ID that is aligned with the supplied final ID within a cluster.
- * Fails if the supplied ID does not fall within the cluster bounds.
- */
-export declare function getAlignedLocal(cluster: IdCluster, finalWithin: FinalCompressedId): LocalCompressedId;
-/**
- * Returns the last allocated final ID (i.e. any ID between base final and base final + capacity) within a cluster
- */
-export declare function lastAllocatedFinal(cluster: IdCluster): FinalCompressedId;
-/**
- * Returns the last allocated final ID (i.e. any ID between base final and base final + count) within a cluster
- */
-export declare function lastFinalizedFinal(cluster: IdCluster): FinalCompressedId;
-/**
- * Returns the last allocated local ID (i.e. any ID between base local and base local + capacity) within a cluster
- */
-export declare function lastAllocatedLocal(cluster: IdCluster): LocalCompressedId;
-/**
- * Returns the last allocated local ID (i.e. any ID between base local and base local + count) within a cluster
- */
-export declare function lastFinalizedLocal(cluster: IdCluster): LocalCompressedId;
-//# sourceMappingURL=sessions.d.ts.map

package/lib/id-compressor/sessions.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sessions.d.ts","sourceRoot":"","sources":["../../src/id-compressor/sessions.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AAW1E,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAElF;;;GAGG;AACH,qBAAa,QAAQ;IAGpB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA8D;IAExF,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAiC;gBAE3C,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE;IAgBrE,QAAQ,IAAI,gBAAgB,CAAC,OAAO,CAAC;IAIrC,WAAW,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAc1C,GAAG,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO,GAAG,SAAS;IAI9C,oBAAoB,CAC1B,KAAK,EAAE,QAAQ,GACb,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,iBAAiB,CAAC,GAAG,SAAS;IAmB7D,eAAe,CAAC,OAAO,EAAE,SAAS,GAAG,OAAO;IA0C5C,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,GAAG,OAAO;CAsBnE;AAED;;GAEG;AACH,qBAAa,OAAO;IAEnB,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAmB;IAEhD,SAAgB,WAAW,EAAE,WAAW,CAAC;gBAEtB,SAAS,EAAE,SAAS,GAAG,WAAW;IAKrD;;OAEG;IACI,aAAa,CACnB,WAAW,EAAE,iBAAiB,EAC9B,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GACX,SAAS;IAeL,OAAO,IAAI,OAAO;IAIzB;;OAEG;IACI,cAAc,IAAI,SAAS,GAAG,SAAS;IAI9C;;;OAGG;IACI,iBAAiB,CACvB,WAAW,EAAE,iBAAiB,EAC9B,gBAAgB,EAAE,OAAO,GACvB,iBAAiB,GAAG,SAAS;IAQhC;;;OAGG;IACI,iBAAiB,CACvB,OAAO,EAAE,iBAAiB,EAC1B,gBAAgB,EAAE,OAAO,GACvB,SAAS,GAAG,SAAS;IAqBxB;;OAEG;IACI,0BAA0B,CAAC,KAAK,EAAE,iBAAiB,GAAG,SAAS,GAAG,SAAS;IAIlF;;;OAGG;WACW,oBAAoB,CACjC,OAAO,EAAE,iBAAiB,EAC1B,YAAY,EAAE,SAAS,SAAS,EAAE,GAChC,SAAS,GAAG,SAAS;IAaxB,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,EACvB,MAAM,EAAE,CAAC,EACT,GAAG,EAAE,SAAS,CAAC,EAAE,EACjB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAChC,CAAC,GAAG,SAAS;IAiBT,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;CAQtC;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACzB;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B;;OAEG;IACH,QAAQ,CAAC,WAAW,EAAE,iBAAiB,CAAC;IAExC;;OAEG;IACH,QAAQ,CAAC,WAAW,EAAE,iBAAiB,CAAC;IAExC;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;CACd;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAQjE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC9B,OAAO,EAAE,SAAS,EAClB,WAAW,EAAE,iBAAiB,GAC5B,iBAAiB,GAAG,SAAS,CAO/B;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC9B,OAAO,EAAE,SAAS,EAClB,WAAW,EAAE,iBAAiB,GAC5B,iBAAiB,CAOnB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,SAAS,GAAG,iBAAiB,CAExE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,SAAS,GAAG,iBAAiB,CAExE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,SAAS,GAAG,iBAAiB,CAExE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,SAAS,GAAG,iBAAiB,CAExE"}

package/lib/id-compressor/sessions.js

@@ -1,290 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import BTree from "sorted-btree";
-import { assert } from "@fluidframework/core-utils";
-import { compareBigints, localIdFromGenCount, genCountFromLocalId, numericUuidFromStableId, stableIdFromNumericUuid, subtractNumericUuids, offsetNumericUuid, } from "./utilities";
-/**
- * A collection of all sessions known to the compressor (i.e. all finalized/acked allocated UUIDs and their corresponding local and final forms).
- * This collection of all sessions comprises a distributed document's IDs.
- */
-export class Sessions {
-    constructor(sessions) {
-        // A range-queryable store of all sessions. A btree is used as it solves the predecessor problem for any given UUID, allowing
-        // us to quickly find the session that may have produced it.
-        this.uuidSpace = new BTree(undefined, compareBigints);
-        // A fast lookup table from session ID to the session object, used to avoid accessing the slower btree
-        this.sessionCache = new Map();
-        if (sessions !== undefined) {
-            // bulk load path
-            for (const [numeric, session] of sessions) {
-                this.sessionCache.set(stableIdFromNumericUuid(numeric), session);
-            }
-            this.uuidSpace = new BTree(sessions, compareBigints);
-            if (this.sessionCache.size !== sessions.length ||
-                sessions.length !== this.uuidSpace.size) {
-                throw new Error("Cannot resume existing session.");
-            }
-        }
-    }
-    sessions() {
-        return this.sessionCache.values();
-    }
-    getOrCreate(sessionId) {
-        const existing = this.sessionCache.get(sessionId);
-        if (existing !== undefined) {
-            return existing;
-        }
-        const session = new Session(sessionId);
-        assert(this.uuidSpace.set(session.sessionUuid, session), 0x760 /* Duplicate session in map. */);
-        this.sessionCache.set(sessionId, session);
-        return session;
-    }
-    get(sessionId) {
-        return this.sessionCache.get(sessionId);
-    }
-    getContainingCluster(query) {
-        const numericStable = numericUuidFromStableId(query);
-        const possibleMatch = this.uuidSpace.getPairOrNextLower(numericStable);
-        if (possibleMatch === undefined) {
-            return undefined;
-        }
-        const [_, session] = possibleMatch;
-        const numericDelta = subtractNumericUuids(numericStable, session.sessionUuid);
-        if (numericDelta > Number.MAX_SAFE_INTEGER) {
-            return undefined;
-        }
-        const alignedLocal = localIdFromGenCount(Number(numericDelta) + 1);
-        const containingCluster = session.getClusterByLocal(alignedLocal, true);
-        if (containingCluster === undefined) {
-            return undefined;
-        }
-        return [containingCluster, alignedLocal];
-    }
-    clusterCollides(cluster) {
-        const { session: owningSession, baseLocalId, capacity } = cluster;
-        const clusterBaseNumeric = offsetNumericUuid(owningSession.sessionUuid, genCountFromLocalId(baseLocalId) - 1);
-        const clusterMaxNumeric = offsetNumericUuid(clusterBaseNumeric, capacity - 1);
-        let closestMatch = this.uuidSpace.getPairOrNextLower(clusterMaxNumeric);
-        // Find the first session that is not the owner of this new cluster.
-        // Once we have that, check to see if its cluster chain overlaps with the new cluster.
-        // Consider the following diagram of UUID space:
-        // Cluster chain A:  |----------------------|
-        // Cluster chain B:       |----------|
-        // Cluster chain C:                       |-------|
-        // While it is true that when adding a cluster to chain C, we would find
-        // the next lower session (which is B) and erroneously determine we do not collide
-        // with any other session, but this situation is impossible to get into as B would
-        // have detected that it collided with A (or the other way around, depending on ordering).
-        while (closestMatch !== undefined && closestMatch[1] === owningSession) {
-            closestMatch = this.uuidSpace.nextLowerPair(closestMatch[0]);
-        }
-        if (closestMatch === undefined) {
-            return false;
-        }
-        const [_, session] = closestMatch;
-        assert(session !== owningSession, 0x761 /* Failed to attempt to detect collisions. */);
-        const lastCluster = session.getLastCluster();
-        if (lastCluster === undefined) {
-            // If the closest session is empty (the local session), then it is guaranteed (probabilistically) that there are no
-            // non-empty sessions that have a cluster chain that starts prior to the empty session and collides with the cluster
-            // we are checking, so we can return false.
-            return false;
-        }
-        const lastAllocatedNumeric = offsetNumericUuid(session.sessionUuid, genCountFromLocalId(lastAllocatedLocal(lastCluster)) - 1);
-        return lastAllocatedNumeric >= clusterBaseNumeric;
-    }
-    equals(other, includeLocalState) {
-        const checkIsSubset = (sessionsA, sessionsB) => {
-            const first = sessionsA.sessions().next();
-            const firstSessionThis = first.done ? undefined : first.value;
-            for (const [stableId, session] of sessionsA.sessionCache.entries()) {
-                const otherSession = sessionsB.sessionCache.get(stableId);
-                if (otherSession === undefined) {
-                    if (!session.isEmpty() || includeLocalState) {
-                        return false;
-                    }
-                    assert(session === firstSessionThis, 0x762 /* The only non-empty session must be the local session. */);
-                }
-                else if (!session.equals(otherSession)) {
-                    return false;
-                }
-            }
-            return true;
-        };
-        return checkIsSubset(this, other) && checkIsSubset(other, this);
-    }
-}
-/**
- * The IDs created by a specific session, stored as a cluster chain to allow for fast conversions.
- */
-export class Session {
-    constructor(sessionId) {
-        // All clusters created by this session, in creation order (thus sorted by base final and local ID).
-        this.clusterChain = [];
-        this.sessionUuid =
-            typeof sessionId === "string" ? numericUuidFromStableId(sessionId) : sessionId;
-    }
-    /**
-     * Adds a new empty cluster to the cluster chain of this session.
-     */
-    addNewCluster(baseFinalId, capacity, count) {
-        const lastCluster = this.getLastCluster();
-        const newCluster = {
-            session: this,
-            baseFinalId,
-            baseLocalId: (lastCluster === undefined
-                ? -1
-                : lastAllocatedLocal(lastCluster) - 1),
-            capacity,
-            count,
-        };
-        this.clusterChain.push(newCluster);
-        return newCluster;
-    }
-    isEmpty() {
-        return this.clusterChain.length === 0;
-    }
-    /**
-     * Returns the last cluster in this session's cluster chain, if any.
-     */
-    getLastCluster() {
-        return this.clusterChain[this.clusterChain.length - 1];
-    }
-    /**
-     * Converts the local ID from this session to a final ID, if possible.
-     * @param includeAllocated - true if the conversion should succeed even if the local ID aligns with a part of the cluster that is allocated but not finalized.
-     */
-    tryConvertToFinal(searchLocal, includeAllocated) {
-        const containingCluster = this.getClusterByLocal(searchLocal, includeAllocated);
-        if (containingCluster === undefined) {
-            return undefined;
-        }
-        return getAlignedFinal(containingCluster, searchLocal);
-    }
-    /**
-     * Returns the cluster containing the supplied local ID, if possible.
-     * @param includeAllocated - true if the conversion should succeed even if the local ID aligns with a part of the cluster that is allocated but not finalized.
-     */
-    getClusterByLocal(localId, includeAllocated) {
-        const lastValidLocal = includeAllocated
-            ? lastAllocatedLocal
-            : lastFinalizedLocal;
-        const matchedCluster = Session.binarySearch(localId, this.clusterChain, (local, cluster) => {
-            const lastLocal = lastValidLocal(cluster);
-            if (local < lastLocal) {
-                return 1;
-            }
-            else if (local > cluster.baseLocalId) {
-                return -1;
-            }
-            else {
-                return 0;
-            }
-        });
-        return matchedCluster;
-    }
-    /**
-     * Returns the cluster containing the supplied final ID, if possible.
-     */
-    getClusterByAllocatedFinal(final) {
-        return Session.getContainingCluster(final, this.clusterChain);
-    }
-    /**
-     * Returns the cluster from the supplied cluster chain containing the supplied final ID, if possible.
-     * `clusterChain` must be sorted by final/local base ID.
-     */
-    static getContainingCluster(finalId, clusterChain) {
-        return Session.binarySearch(finalId, clusterChain, (final, cluster) => {
-            const lastFinal = lastAllocatedFinal(cluster);
-            if (final < cluster.baseFinalId) {
-                return -1;
-            }
-            else if (final > lastFinal) {
-                return 1;
-            }
-            else {
-                return 0;
-            }
-        });
-    }
-    static binarySearch(search, arr, comparator) {
-        let left = 0;
-        let right = arr.length - 1;
-        while (left <= right) {
-            const mid = Math.floor((left + right) / 2);
-            const c = comparator(search, arr[mid]);
-            if (c === 0) {
-                return arr[mid]; // Found the target, return its index.
-            }
-            else if (c > 0) {
-                left = mid + 1; // Continue search on right half.
-            }
-            else {
-                right = mid - 1; // Continue search on left half.
-            }
-        }
-        return undefined; // If we reach here, target is not in array.
-    }
-    equals(other) {
-        for (let i = 0; i < this.clusterChain.length; i++) {
-            if (!clustersEqual(this.clusterChain[i], other.clusterChain[i])) {
-                return false;
-            }
-        }
-        return this.sessionUuid === other.sessionUuid;
-    }
-}
-export function clustersEqual(a, b) {
-    return (a.session.sessionUuid === b.session.sessionUuid &&
-        a.baseFinalId === b.baseFinalId &&
-        a.baseLocalId === b.baseLocalId &&
-        a.capacity === b.capacity &&
-        a.count === b.count);
-}
-/**
- * Returns the final ID that is aligned with the supplied local ID within a cluster.
- * Includes allocated IDs.
- */
-export function getAlignedFinal(cluster, localWithin) {
-    const clusterOffset = genCountFromLocalId(localWithin) - genCountFromLocalId(cluster.baseLocalId);
-    if (clusterOffset < cluster.capacity) {
-        return (cluster.baseFinalId + clusterOffset);
-    }
-    return undefined;
-}
-/**
- * Returns the local ID that is aligned with the supplied final ID within a cluster.
- * Fails if the supplied ID does not fall within the cluster bounds.
- */
-export function getAlignedLocal(cluster, finalWithin) {
-    assert(finalWithin >= cluster.baseFinalId && finalWithin <= lastAllocatedFinal(cluster), 0x763 /* Supplied ID is not within the cluster. */);
-    const finalDelta = finalWithin - cluster.baseFinalId;
-    return (cluster.baseLocalId - finalDelta);
-}
-/**
- * Returns the last allocated final ID (i.e. any ID between base final and base final + capacity) within a cluster
- */
-export function lastAllocatedFinal(cluster) {
-    return (cluster.baseFinalId + (cluster.capacity - 1));
-}
-/**
- * Returns the last allocated final ID (i.e. any ID between base final and base final + count) within a cluster
- */
-export function lastFinalizedFinal(cluster) {
-    return (cluster.baseFinalId + (cluster.count - 1));
-}
-/**
- * Returns the last allocated local ID (i.e. any ID between base local and base local + capacity) within a cluster
- */
-export function lastAllocatedLocal(cluster) {
-    return (cluster.baseLocalId - (cluster.capacity - 1));
-}
-/**
- * Returns the last allocated local ID (i.e. any ID between base local and base local + count) within a cluster
- */
-export function lastFinalizedLocal(cluster) {
-    return (cluster.baseLocalId - (cluster.count - 1));
-}
-//# sourceMappingURL=sessions.js.map