@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/util/idAllocator.js

@@ -0,0 +1,34 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fakeIdAllocator = exports.idAllocatorFromState = exports.idAllocatorFromMaxId = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const utils_1 = require("./utils");
+/**
+ * @internal
+ */
+function idAllocatorFromMaxId(maxId = undefined) {
+    return idAllocatorFromState({ maxId: maxId ?? -1 });
+}
+exports.idAllocatorFromMaxId = idAllocatorFromMaxId;
+function idAllocatorFromState(state) {
+    return {
+        allocate: (c) => {
+            const count = c ?? 1;
+            (0, core_utils_1.assert)(count > 0, 0x5cf /* Must allocate at least one ID */);
+            const id = state.maxId + 1;
+            state.maxId += count;
+            return id;
+        },
+        getNextId: () => state.maxId,
+    };
+}
+exports.idAllocatorFromState = idAllocatorFromState;
+exports.fakeIdAllocator = {
+    allocate: () => (0, utils_1.fail)("Should not allocate IDs"),
+    getNextId: () => 0,
+};
+//# sourceMappingURL=idAllocator.js.map

package/dist/util/idAllocator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"idAllocator.js","sourceRoot":"","sources":["../../src/util/idAllocator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,mCAA+B;AAsB/B;;GAEG;AACH,SAAgB,oBAAoB,CAAC,QAA4B,SAAS;IACzE,OAAO,oBAAoB,CAAC,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;AACrD,CAAC;AAFD,oDAEC;AAED,SAAgB,oBAAoB,CAAC,KAAwB;IAC5D,OAAO;QACN,QAAQ,EAAE,CAAC,CAAU,EAAE,EAAE;YACxB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAA,mBAAM,EAAC,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;YAC7D,MAAM,EAAE,GAAW,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;YACnC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC;YACrB,OAAO,EAAE,CAAC;QACX,CAAC;QACD,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK;KAC5B,CAAC;AACH,CAAC;AAXD,oDAWC;AAEY,QAAA,eAAe,GAAgB;IAC3C,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAA,YAAI,EAAC,yBAAyB,CAAC;IAC/C,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;CAClB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { fail } from \"./utils\";\n\n/**\n * Used for allocating IDs unique to a particular instance of the allocator.\n * @internal\n */\nexport interface IdAllocator<TId = number> {\n\t/**\n\t * Allocates a block of `count` consecutive IDs and returns the first ID in the block.\n\t * For convenience can be called with no parameters to allocate a single ID.\n\t */\n\tallocate: (count?: number) => TId;\n\t/**\n\t * @returns The next ID that will be allocated by this allocator.\n\t */\n\tgetNextId: () => TId;\n}\n\nexport interface IdAllocationState {\n\tmaxId: number;\n}\n\n/**\n * @internal\n */\nexport function idAllocatorFromMaxId(maxId: number | undefined = undefined): IdAllocator {\n\treturn idAllocatorFromState({ maxId: maxId ?? -1 });\n}\n\nexport function idAllocatorFromState(state: IdAllocationState): IdAllocator {\n\treturn {\n\t\tallocate: (c?: number) => {\n\t\t\tconst count = c ?? 1;\n\t\t\tassert(count > 0, 0x5cf /* Must allocate at least one ID */);\n\t\t\tconst id: number = state.maxId + 1;\n\t\t\tstate.maxId += count;\n\t\t\treturn id;\n\t\t},\n\t\tgetNextId: () => state.maxId,\n\t};\n}\n\nexport const fakeIdAllocator: IdAllocator = {\n\tallocate: () => fail(\"Should not allocate IDs\"),\n\tgetNextId: () => 0,\n};\n"]}

package/dist/util/index.d.ts

@@ -0,0 +1,18 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { brand, Brand, BrandedType, brandOpaque, brandedNumberType, brandedStringType, extractFromOpaque, ExtractFromOpaque, fromErased, Erased, ErasedType, NameFromBranded, Opaque, ValueFromBranded, brandErased, } from "./brand";
+export { deleteFromNestedMap, getOrAddInMap, getOrAddInNestedMap, getOrDefaultInNestedMap, forEachInNestedMap, NestedMap, SizedNestedMap, populateNestedMap, setInNestedMap, tryAddToNestedMap, tryGetFromNestedMap, nestedMapToFlatList, nestedMapFromFlatList, } from "./nestedMap";
+export { addToNestedSet, NestedSet, nestedSetContains } from "./nestedSet";
+export { OffsetList, OffsetListFactory } from "./offsetList";
+export { TransactionResult } from "./transactionResult";
+export { areSafelyAssignable, Contravariant, Covariant, eitherIsAny, EnforceTypeCheckTests, Invariant, isAny, isAssignableTo, isStrictSubset, MakeNominal, requireFalse, requireTrue, requireAssignableTo, } from "./typeCheck";
+export { StackyIterator } from "./stackyIterator";
+export { asMutable, clone, compareSets, fail, getOrAddEmptyToMap, getOrCreate, isJsonObject, isReadonlyArray, JsonCompatible, JsonCompatibleObject, JsonCompatibleReadOnly, JsonCompatibleReadOnlySchema, makeArray, mapIterable, Mutable, Populated, RecursiveReadonly, zipIterables, Assume, assertValidIndex, assertValidRange, assertNonNegativeSafeInteger, generateStableId, useDeterministicStableId, useAsyncDeterministicStableId, objectToMap, invertMap, oneFromSet, Named, compareNamed, disposeSymbol, IDisposable, capitalize, assertValidRangeIndices, transformObjectMap, compareStrings, } from "./utils";
+export { ReferenceCountedBase, ReferenceCounted } from "./referenceCounting";
+export { AllowOptional, RequiredFields, OptionalFields, _InlineTrick, _RecursiveTrick, FlattenKeys, AllowOptionalNotFlattened, RestrictiveReadonlyRecord, } from "./typeUtils";
+export { BrandedKey, BrandedKeyContent, BrandedMapSubset, getOrCreateSlotContent, brandedSlot, } from "./brandedMap";
+export { getFirstEntryFromRangeMap, getFromRangeMap, RangeEntry, RangeMap, RangeQueryResult, setInRangeMap, } from "./rangeMap";
+export { IdAllocator, idAllocatorFromMaxId, idAllocatorFromState, IdAllocationState, fakeIdAllocator, } from "./idAllocator";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,KAAK,EACL,KAAK,EACL,WAAW,EACX,WAAW,EACX,iBAAiB,EACjB,iBAAiB,EACjB,iBAAiB,EACjB,iBAAiB,EACjB,UAAU,EACV,MAAM,EACN,UAAU,EACV,eAAe,EACf,MAAM,EACN,gBAAgB,EAChB,WAAW,GACX,MAAM,SAAS,CAAC;AACjB,OAAO,EACN,mBAAmB,EACnB,aAAa,EACb,mBAAmB,EACnB,uBAAuB,EACvB,kBAAkB,EAClB,SAAS,EACT,cAAc,EACd,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,mBAAmB,EACnB,mBAAmB,EACnB,qBAAqB,GACrB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAC3E,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EACN,mBAAmB,EACnB,aAAa,EACb,SAAS,EACT,WAAW,EACX,qBAAqB,EACrB,SAAS,EACT,KAAK,EACL,cAAc,EACd,cAAc,EACd,WAAW,EACX,YAAY,EACZ,WAAW,EACX,mBAAmB,GACnB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EACN,SAAS,EACT,KAAK,EACL,WAAW,EACX,IAAI,EACJ,kBAAkB,EAClB,WAAW,EACX,YAAY,EACZ,eAAe,EACf,cAAc,EACd,oBAAoB,EACpB,sBAAsB,EACtB,4BAA4B,EAC5B,SAAS,EACT,WAAW,EACX,OAAO,EACP,SAAS,EACT,iBAAiB,EACjB,YAAY,EACZ,MAAM,EACN,gBAAgB,EAChB,gBAAgB,EAChB,4BAA4B,EAC5B,gBAAgB,EAChB,wBAAwB,EACxB,6BAA6B,EAC7B,WAAW,EACX,SAAS,EACT,UAAU,EACV,KAAK,EACL,YAAY,EACZ,aAAa,EACb,WAAW,EACX,UAAU,EACV,uBAAuB,EACvB,kBAAkB,EAClB,cAAc,GACd,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAE7E,OAAO,EACN,aAAa,EACb,cAAc,EACd,cAAc,EACd,YAAY,EACZ,eAAe,EACf,WAAW,EACX,yBAAyB,EACzB,yBAAyB,GACzB,MAAM,aAAa,CAAC;AAErB,OAAO,EACN,UAAU,EACV,iBAAiB,EACjB,gBAAgB,EAChB,sBAAsB,EACtB,WAAW,GACX,MAAM,cAAc,CAAC;AAEtB,OAAO,EACN,yBAAyB,EACzB,eAAe,EACf,UAAU,EACV,QAAQ,EACR,gBAAgB,EAChB,aAAa,GACb,MAAM,YAAY,CAAC;AAEpB,OAAO,EACN,WAAW,EACX,oBAAoB,EACpB,oBAAoB,EACpB,iBAAiB,EACjB,eAAe,GACf,MAAM,eAAe,CAAC"}

package/dist/util/index.js

@@ -0,0 +1,82 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.capitalize = exports.disposeSymbol = exports.compareNamed = exports.oneFromSet = exports.invertMap = exports.objectToMap = exports.useAsyncDeterministicStableId = exports.useDeterministicStableId = exports.generateStableId = exports.assertNonNegativeSafeInteger = exports.assertValidRange = exports.assertValidIndex = exports.zipIterables = exports.mapIterable = exports.makeArray = exports.JsonCompatibleReadOnlySchema = exports.isReadonlyArray = exports.isJsonObject = exports.getOrCreate = exports.getOrAddEmptyToMap = exports.fail = exports.compareSets = exports.clone = exports.asMutable = exports.StackyIterator = exports.TransactionResult = exports.OffsetListFactory = exports.nestedSetContains = exports.addToNestedSet = exports.nestedMapFromFlatList = exports.nestedMapToFlatList = exports.tryGetFromNestedMap = exports.tryAddToNestedMap = exports.setInNestedMap = exports.populateNestedMap = exports.SizedNestedMap = exports.forEachInNestedMap = exports.getOrDefaultInNestedMap = exports.getOrAddInNestedMap = exports.getOrAddInMap = exports.deleteFromNestedMap = exports.brandErased = exports.ErasedType = exports.fromErased = exports.extractFromOpaque = exports.brandedStringType = exports.brandedNumberType = exports.brandOpaque = exports.BrandedType = exports.brand = void 0;
+exports.fakeIdAllocator = exports.idAllocatorFromState = exports.idAllocatorFromMaxId = exports.setInRangeMap = exports.getFromRangeMap = exports.getFirstEntryFromRangeMap = exports.brandedSlot = exports.getOrCreateSlotContent = exports.ReferenceCountedBase = exports.compareStrings = exports.transformObjectMap = exports.assertValidRangeIndices = void 0;
+var brand_1 = require("./brand");
+Object.defineProperty(exports, "brand", { enumerable: true, get: function () { return brand_1.brand; } });
+Object.defineProperty(exports, "BrandedType", { enumerable: true, get: function () { return brand_1.BrandedType; } });
+Object.defineProperty(exports, "brandOpaque", { enumerable: true, get: function () { return brand_1.brandOpaque; } });
+Object.defineProperty(exports, "brandedNumberType", { enumerable: true, get: function () { return brand_1.brandedNumberType; } });
+Object.defineProperty(exports, "brandedStringType", { enumerable: true, get: function () { return brand_1.brandedStringType; } });
+Object.defineProperty(exports, "extractFromOpaque", { enumerable: true, get: function () { return brand_1.extractFromOpaque; } });
+Object.defineProperty(exports, "fromErased", { enumerable: true, get: function () { return brand_1.fromErased; } });
+Object.defineProperty(exports, "ErasedType", { enumerable: true, get: function () { return brand_1.ErasedType; } });
+Object.defineProperty(exports, "brandErased", { enumerable: true, get: function () { return brand_1.brandErased; } });
+var nestedMap_1 = require("./nestedMap");
+Object.defineProperty(exports, "deleteFromNestedMap", { enumerable: true, get: function () { return nestedMap_1.deleteFromNestedMap; } });
+Object.defineProperty(exports, "getOrAddInMap", { enumerable: true, get: function () { return nestedMap_1.getOrAddInMap; } });
+Object.defineProperty(exports, "getOrAddInNestedMap", { enumerable: true, get: function () { return nestedMap_1.getOrAddInNestedMap; } });
+Object.defineProperty(exports, "getOrDefaultInNestedMap", { enumerable: true, get: function () { return nestedMap_1.getOrDefaultInNestedMap; } });
+Object.defineProperty(exports, "forEachInNestedMap", { enumerable: true, get: function () { return nestedMap_1.forEachInNestedMap; } });
+Object.defineProperty(exports, "SizedNestedMap", { enumerable: true, get: function () { return nestedMap_1.SizedNestedMap; } });
+Object.defineProperty(exports, "populateNestedMap", { enumerable: true, get: function () { return nestedMap_1.populateNestedMap; } });
+Object.defineProperty(exports, "setInNestedMap", { enumerable: true, get: function () { return nestedMap_1.setInNestedMap; } });
+Object.defineProperty(exports, "tryAddToNestedMap", { enumerable: true, get: function () { return nestedMap_1.tryAddToNestedMap; } });
+Object.defineProperty(exports, "tryGetFromNestedMap", { enumerable: true, get: function () { return nestedMap_1.tryGetFromNestedMap; } });
+Object.defineProperty(exports, "nestedMapToFlatList", { enumerable: true, get: function () { return nestedMap_1.nestedMapToFlatList; } });
+Object.defineProperty(exports, "nestedMapFromFlatList", { enumerable: true, get: function () { return nestedMap_1.nestedMapFromFlatList; } });
+var nestedSet_1 = require("./nestedSet");
+Object.defineProperty(exports, "addToNestedSet", { enumerable: true, get: function () { return nestedSet_1.addToNestedSet; } });
+Object.defineProperty(exports, "nestedSetContains", { enumerable: true, get: function () { return nestedSet_1.nestedSetContains; } });
+var offsetList_1 = require("./offsetList");
+Object.defineProperty(exports, "OffsetListFactory", { enumerable: true, get: function () { return offsetList_1.OffsetListFactory; } });
+var transactionResult_1 = require("./transactionResult");
+Object.defineProperty(exports, "TransactionResult", { enumerable: true, get: function () { return transactionResult_1.TransactionResult; } });
+var stackyIterator_1 = require("./stackyIterator");
+Object.defineProperty(exports, "StackyIterator", { enumerable: true, get: function () { return stackyIterator_1.StackyIterator; } });
+var utils_1 = require("./utils");
+Object.defineProperty(exports, "asMutable", { enumerable: true, get: function () { return utils_1.asMutable; } });
+Object.defineProperty(exports, "clone", { enumerable: true, get: function () { return utils_1.clone; } });
+Object.defineProperty(exports, "compareSets", { enumerable: true, get: function () { return utils_1.compareSets; } });
+Object.defineProperty(exports, "fail", { enumerable: true, get: function () { return utils_1.fail; } });
+Object.defineProperty(exports, "getOrAddEmptyToMap", { enumerable: true, get: function () { return utils_1.getOrAddEmptyToMap; } });
+Object.defineProperty(exports, "getOrCreate", { enumerable: true, get: function () { return utils_1.getOrCreate; } });
+Object.defineProperty(exports, "isJsonObject", { enumerable: true, get: function () { return utils_1.isJsonObject; } });
+Object.defineProperty(exports, "isReadonlyArray", { enumerable: true, get: function () { return utils_1.isReadonlyArray; } });
+Object.defineProperty(exports, "JsonCompatibleReadOnlySchema", { enumerable: true, get: function () { return utils_1.JsonCompatibleReadOnlySchema; } });
+Object.defineProperty(exports, "makeArray", { enumerable: true, get: function () { return utils_1.makeArray; } });
+Object.defineProperty(exports, "mapIterable", { enumerable: true, get: function () { return utils_1.mapIterable; } });
+Object.defineProperty(exports, "zipIterables", { enumerable: true, get: function () { return utils_1.zipIterables; } });
+Object.defineProperty(exports, "assertValidIndex", { enumerable: true, get: function () { return utils_1.assertValidIndex; } });
+Object.defineProperty(exports, "assertValidRange", { enumerable: true, get: function () { return utils_1.assertValidRange; } });
+Object.defineProperty(exports, "assertNonNegativeSafeInteger", { enumerable: true, get: function () { return utils_1.assertNonNegativeSafeInteger; } });
+Object.defineProperty(exports, "generateStableId", { enumerable: true, get: function () { return utils_1.generateStableId; } });
+Object.defineProperty(exports, "useDeterministicStableId", { enumerable: true, get: function () { return utils_1.useDeterministicStableId; } });
+Object.defineProperty(exports, "useAsyncDeterministicStableId", { enumerable: true, get: function () { return utils_1.useAsyncDeterministicStableId; } });
+Object.defineProperty(exports, "objectToMap", { enumerable: true, get: function () { return utils_1.objectToMap; } });
+Object.defineProperty(exports, "invertMap", { enumerable: true, get: function () { return utils_1.invertMap; } });
+Object.defineProperty(exports, "oneFromSet", { enumerable: true, get: function () { return utils_1.oneFromSet; } });
+Object.defineProperty(exports, "compareNamed", { enumerable: true, get: function () { return utils_1.compareNamed; } });
+Object.defineProperty(exports, "disposeSymbol", { enumerable: true, get: function () { return utils_1.disposeSymbol; } });
+Object.defineProperty(exports, "capitalize", { enumerable: true, get: function () { return utils_1.capitalize; } });
+Object.defineProperty(exports, "assertValidRangeIndices", { enumerable: true, get: function () { return utils_1.assertValidRangeIndices; } });
+Object.defineProperty(exports, "transformObjectMap", { enumerable: true, get: function () { return utils_1.transformObjectMap; } });
+Object.defineProperty(exports, "compareStrings", { enumerable: true, get: function () { return utils_1.compareStrings; } });
+var referenceCounting_1 = require("./referenceCounting");
+Object.defineProperty(exports, "ReferenceCountedBase", { enumerable: true, get: function () { return referenceCounting_1.ReferenceCountedBase; } });
+var brandedMap_1 = require("./brandedMap");
+Object.defineProperty(exports, "getOrCreateSlotContent", { enumerable: true, get: function () { return brandedMap_1.getOrCreateSlotContent; } });
+Object.defineProperty(exports, "brandedSlot", { enumerable: true, get: function () { return brandedMap_1.brandedSlot; } });
+var rangeMap_1 = require("./rangeMap");
+Object.defineProperty(exports, "getFirstEntryFromRangeMap", { enumerable: true, get: function () { return rangeMap_1.getFirstEntryFromRangeMap; } });
+Object.defineProperty(exports, "getFromRangeMap", { enumerable: true, get: function () { return rangeMap_1.getFromRangeMap; } });
+Object.defineProperty(exports, "setInRangeMap", { enumerable: true, get: function () { return rangeMap_1.setInRangeMap; } });
+var idAllocator_1 = require("./idAllocator");
+Object.defineProperty(exports, "idAllocatorFromMaxId", { enumerable: true, get: function () { return idAllocator_1.idAllocatorFromMaxId; } });
+Object.defineProperty(exports, "idAllocatorFromState", { enumerable: true, get: function () { return idAllocator_1.idAllocatorFromState; } });
+Object.defineProperty(exports, "fakeIdAllocator", { enumerable: true, get: function () { return idAllocator_1.fakeIdAllocator; } });
+//# sourceMappingURL=index.js.map

package/dist/util/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;AAEH,iCAgBiB;AAfhB,8FAAA,KAAK,OAAA;AAEL,oGAAA,WAAW,OAAA;AACX,oGAAA,WAAW,OAAA;AACX,0GAAA,iBAAiB,OAAA;AACjB,0GAAA,iBAAiB,OAAA;AACjB,0GAAA,iBAAiB,OAAA;AAEjB,mGAAA,UAAU,OAAA;AAEV,mGAAA,UAAU,OAAA;AAIV,oGAAA,WAAW,OAAA;AAEZ,yCAcqB;AAbpB,gHAAA,mBAAmB,OAAA;AACnB,0GAAA,aAAa,OAAA;AACb,gHAAA,mBAAmB,OAAA;AACnB,oHAAA,uBAAuB,OAAA;AACvB,+GAAA,kBAAkB,OAAA;AAElB,2GAAA,cAAc,OAAA;AACd,8GAAA,iBAAiB,OAAA;AACjB,2GAAA,cAAc,OAAA;AACd,8GAAA,iBAAiB,OAAA;AACjB,gHAAA,mBAAmB,OAAA;AACnB,gHAAA,mBAAmB,OAAA;AACnB,kHAAA,qBAAqB,OAAA;AAEtB,yCAA2E;AAAlE,2GAAA,cAAc,OAAA;AAAa,8GAAA,iBAAiB,OAAA;AACrD,2CAA6D;AAAxC,+GAAA,iBAAiB,OAAA;AACtC,yDAAwD;AAA/C,sHAAA,iBAAiB,OAAA;AAgB1B,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AACvB,iCAqCiB;AApChB,kGAAA,SAAS,OAAA;AACT,8FAAA,KAAK,OAAA;AACL,oGAAA,WAAW,OAAA;AACX,6FAAA,IAAI,OAAA;AACJ,2GAAA,kBAAkB,OAAA;AAClB,oGAAA,WAAW,OAAA;AACX,qGAAA,YAAY,OAAA;AACZ,wGAAA,eAAe,OAAA;AAIf,qHAAA,4BAA4B,OAAA;AAC5B,kGAAA,SAAS,OAAA;AACT,oGAAA,WAAW,OAAA;AAIX,qGAAA,YAAY,OAAA;AAEZ,yGAAA,gBAAgB,OAAA;AAChB,yGAAA,gBAAgB,OAAA;AAChB,qHAAA,4BAA4B,OAAA;AAC5B,yGAAA,gBAAgB,OAAA;AAChB,iHAAA,wBAAwB,OAAA;AACxB,sHAAA,6BAA6B,OAAA;AAC7B,oGAAA,WAAW,OAAA;AACX,kGAAA,SAAS,OAAA;AACT,mGAAA,UAAU,OAAA;AAEV,qGAAA,YAAY,OAAA;AACZ,sGAAA,aAAa,OAAA;AAEb,mGAAA,UAAU,OAAA;AACV,gHAAA,uBAAuB,OAAA;AACvB,2GAAA,kBAAkB,OAAA;AAClB,uGAAA,cAAc,OAAA;AAEf,yDAA6E;AAApE,yHAAA,oBAAoB,OAAA;AAa7B,2CAMsB;AAFrB,oHAAA,sBAAsB,OAAA;AACtB,yGAAA,WAAW,OAAA;AAGZ,uCAOoB;AANnB,qHAAA,yBAAyB,OAAA;AACzB,2GAAA,eAAe,OAAA;AAIf,yGAAA,aAAa,OAAA;AAGd,6CAMuB;AAJtB,mHAAA,oBAAoB,OAAA;AACpB,mHAAA,oBAAoB,OAAA;AAEpB,8GAAA,eAAe,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tbrand,\n\tBrand,\n\tBrandedType,\n\tbrandOpaque,\n\tbrandedNumberType,\n\tbrandedStringType,\n\textractFromOpaque,\n\tExtractFromOpaque,\n\tfromErased,\n\tErased,\n\tErasedType,\n\tNameFromBranded,\n\tOpaque,\n\tValueFromBranded,\n\tbrandErased,\n} from \"./brand\";\nexport {\n\tdeleteFromNestedMap,\n\tgetOrAddInMap,\n\tgetOrAddInNestedMap,\n\tgetOrDefaultInNestedMap,\n\tforEachInNestedMap,\n\tNestedMap,\n\tSizedNestedMap,\n\tpopulateNestedMap,\n\tsetInNestedMap,\n\ttryAddToNestedMap,\n\ttryGetFromNestedMap,\n\tnestedMapToFlatList,\n\tnestedMapFromFlatList,\n} from \"./nestedMap\";\nexport { addToNestedSet, NestedSet, nestedSetContains } from \"./nestedSet\";\nexport { OffsetList, OffsetListFactory } from \"./offsetList\";\nexport { TransactionResult } from \"./transactionResult\";\nexport {\n\tareSafelyAssignable,\n\tContravariant,\n\tCovariant,\n\teitherIsAny,\n\tEnforceTypeCheckTests,\n\tInvariant,\n\tisAny,\n\tisAssignableTo,\n\tisStrictSubset,\n\tMakeNominal,\n\trequireFalse,\n\trequireTrue,\n\trequireAssignableTo,\n} from \"./typeCheck\";\nexport { StackyIterator } from \"./stackyIterator\";\nexport {\n\tasMutable,\n\tclone,\n\tcompareSets,\n\tfail,\n\tgetOrAddEmptyToMap,\n\tgetOrCreate,\n\tisJsonObject,\n\tisReadonlyArray,\n\tJsonCompatible,\n\tJsonCompatibleObject,\n\tJsonCompatibleReadOnly,\n\tJsonCompatibleReadOnlySchema,\n\tmakeArray,\n\tmapIterable,\n\tMutable,\n\tPopulated,\n\tRecursiveReadonly,\n\tzipIterables,\n\tAssume,\n\tassertValidIndex,\n\tassertValidRange,\n\tassertNonNegativeSafeInteger,\n\tgenerateStableId,\n\tuseDeterministicStableId,\n\tuseAsyncDeterministicStableId,\n\tobjectToMap,\n\tinvertMap,\n\toneFromSet,\n\tNamed,\n\tcompareNamed,\n\tdisposeSymbol,\n\tIDisposable,\n\tcapitalize,\n\tassertValidRangeIndices,\n\ttransformObjectMap,\n\tcompareStrings,\n} from \"./utils\";\nexport { ReferenceCountedBase, ReferenceCounted } from \"./referenceCounting\";\n\nexport {\n\tAllowOptional,\n\tRequiredFields,\n\tOptionalFields,\n\t_InlineTrick,\n\t_RecursiveTrick,\n\tFlattenKeys,\n\tAllowOptionalNotFlattened,\n\tRestrictiveReadonlyRecord,\n} from \"./typeUtils\";\n\nexport {\n\tBrandedKey,\n\tBrandedKeyContent,\n\tBrandedMapSubset,\n\tgetOrCreateSlotContent,\n\tbrandedSlot,\n} from \"./brandedMap\";\n\nexport {\n\tgetFirstEntryFromRangeMap,\n\tgetFromRangeMap,\n\tRangeEntry,\n\tRangeMap,\n\tRangeQueryResult,\n\tsetInRangeMap,\n} from \"./rangeMap\";\n\nexport {\n\tIdAllocator,\n\tidAllocatorFromMaxId,\n\tidAllocatorFromState,\n\tIdAllocationState,\n\tfakeIdAllocator,\n} from \"./idAllocator\";\n"]}

package/dist/util/nestedMap.d.ts

@@ -0,0 +1,129 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { MapGetSet } from "./utils";
+/**
+ * A dictionary whose values are keyed off of two objects (key1, key2).
+ * As it is a nested map, size() will return the number of distinct key1s.
+ * If you need constant-time access to the number of values, use SizedNestedMap instead.
+ *
+ * This code assumes values will not be undefined (keys can be undefined).
+ *
+ * @internal
+ */
+export type NestedMap<Key1, Key2, Value> = Map<Key1, Map<Key2, Value>>;
+/**
+ * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is returned.
+ *
+ * @internal
+ */
+export declare function tryAddToNestedMap<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>, key1: Key1, key2: Key2, value: Value): Value | undefined;
+/**
+ * Copies over all entries from the source map into the destination map.
+ *
+ * @internal
+ */
+export declare function populateNestedMap<Key1, Key2, Value>(source: NestedMap<Key1, Key2, Value>, destination: NestedMap<Key1, Key2, Value>): void;
+/**
+ * Sets the value at (key1, key2) in map to value.
+ * If there already is a value for (key1, key2), it is replaced with the provided one.
+ *
+ * @internal
+ */
+export declare function setInNestedMap<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>, key1: Key1, key2: Key2, value: Value): void;
+/**
+ * Sets the value at `key` in map to value if not already present.
+ * Returns the value at `key` after setting it.
+ * This is equivalent to a get or default that adds the default to the map.
+ */
+export declare function getOrAddInMap<Key, Value>(map: MapGetSet<Key, Value>, key: Key, value: Value): Value;
+/**
+ * Returns the value at (key1, key2) in map, or undefined if not present.
+ *
+ * @internal
+ */
+export declare function tryGetFromNestedMap<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>, key1: Key1, key2: Key2): Value | undefined;
+/**
+ * If (key1, key2) is not in the map, add value to the map.
+ * Returns whatever is at (key1, key2) in map (which will be value if it was empty before).
+ *
+ * @internal
+ */
+export declare function getOrAddInNestedMap<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>, key1: Key1, key2: Key2, value: Value): Value;
+/**
+ * Does not change map.
+ * If (key1, key2) is not in map, returns value.
+ * If (key1, key2) is in map, return its entry.
+ *
+ * @internal
+ */
+export declare function getOrDefaultInNestedMap<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>, key1: Key1, key2: Key2, value: Value): Value;
+/**
+ * Removes the value at (key1, key2) from the map.
+ *
+ * @returns true iff found.
+ *
+ * @internal
+ */
+export declare function deleteFromNestedMap<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>, key1: Key1, key2: Key2): boolean;
+/**
+ * Converts a nested map to a flat list of triplets.
+ */
+export declare function nestedMapToFlatList<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>): [Key1, Key2, Value][];
+/**
+ * Builds a nested map from a flat list of triplets.
+ */
+export declare function nestedMapFromFlatList<Key1, Key2, Value>(list: readonly (readonly [Key1, Key2, Value])[]): NestedMap<Key1, Key2, Value>;
+export declare function forEachInNestedMap<Key1, Key2, Value>(map: NestedMap<Key1, Key2, Value>, delegate: (value: Value, key1: Key1, key2: Key2) => void): void;
+/**
+ * Map with two keys; same semantics as NestedMap, but maintains a size count for the entire collection.
+ * Note: undefined is not supported as a value, and will cause incorrect behavior.
+ *
+ * @internal
+ */
+export declare class SizedNestedMap<Key1, Key2, Value> {
+    private readonly nestedMap;
+    private count;
+    /**
+     * Returns the total number of elements in this nested map.
+     */
+    get size(): number;
+    /**
+     * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is
+     * returned.
+     */
+    tryGet(key1: Key1, key2: Key2): Value | undefined;
+    /**
+     * Does not change map.
+     * If (key1, key2) is not in map, returns value.
+     * If (key1, key2) is in map, return its entry.
+     */
+    getOrDefault(key1: Key1, key2: Key2, value: Value): Value;
+    /**
+     * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is
+     * returned.
+     */
+    tryAdd(key1: Key1, key2: Key2, value: Value): Value | undefined;
+    /**
+     * Sets the value at (key1, key2) in map to value.
+     * If there already is a value for (key1, key2), it is replaced with the provided one.
+     */
+    set(key1: Key1, key2: Key2, value: Value): void;
+    /**
+     * Removes the value at (key1, key2) from the map.
+     * Returns true iff found.
+     */
+    delete(key1: Key1, key2: Key2): boolean;
+    /**
+     * Runs the supplied delegate for every (value, key1, key2).
+     */
+    forEach(delegate: (value: Value, key1: Key1, key2: Key2) => void): void;
+    /**
+     * Clears the map.
+     */
+    clear(): void;
+    values(): IterableIterator<Value>;
+    [Symbol.iterator](): IterableIterator<[Key1, Map<Key2, Value>]>;
+}
+//# sourceMappingURL=nestedMap.d.ts.map

package/dist/util/nestedMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nestedMap.d.ts","sourceRoot":"","sources":["../../src/util/nestedMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEpC;;;;;;;;GAQG;AACH,MAAM,MAAM,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;AAEvE;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAClD,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACjC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GACV,KAAK,GAAG,SAAS,CAWnB;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAClD,MAAM,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACpC,WAAW,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,GACvC,IAAI,CAIN;AACD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAC/C,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACjC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GACV,IAAI,CAGN;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,KAAK,EACvC,GAAG,EAAE,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,EAC1B,GAAG,EAAE,GAAG,EACR,KAAK,EAAE,KAAK,GACV,KAAK,CAOP;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EACpD,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACjC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,GACR,KAAK,GAAG,SAAS,CAMnB;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EACpD,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACjC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GACV,KAAK,CAMP;AAED;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EACxD,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACjC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GACV,KAAK,CAMP;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EACpD,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACjC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,GACR,OAAO,CAUT;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EACpD,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,GAC/B,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAQvB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EACtD,IAAI,EAAE,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,GAC7C,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAM9B;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EACnD,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EACjC,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,GACtD,IAAI,CAMN;AAED;;;;;GAKG;AACH,qBAAa,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK;IAC5C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA2C;IACrE,OAAO,CAAC,KAAK,CAAK;IAElB;;OAEG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;OAGG;IACI,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,KAAK,GAAG,SAAS;IAIxD;;;;OAIG;IACI,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK;IAIhE;;;OAGG;IACI,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IAQtE;;;OAGG;IACI,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI;IAMtD;;;OAGG;IACI,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO;IAQ9C;;OAEG;IACI,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAI9E;;OAEG;IACI,KAAK,IAAI,IAAI;IAKb,MAAM,IAAI,gBAAgB,CAAC,KAAK,CAAC;IAIjC,CAAC,MAAM,CAAC,QAAQ,CAAC;CAGxB"}

package/dist/util/nestedMap.js

@@ -0,0 +1,239 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SizedNestedMap = exports.forEachInNestedMap = exports.nestedMapFromFlatList = exports.nestedMapToFlatList = exports.deleteFromNestedMap = exports.getOrDefaultInNestedMap = exports.getOrAddInNestedMap = exports.tryGetFromNestedMap = exports.getOrAddInMap = exports.setInNestedMap = exports.populateNestedMap = exports.tryAddToNestedMap = void 0;
+/**
+ * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is returned.
+ *
+ * @internal
+ */
+function tryAddToNestedMap(map, key1, key2, value) {
+    let innerMap = map.get(key1);
+    if (innerMap === undefined) {
+        innerMap = new Map();
+        map.set(key1, innerMap);
+    }
+    if (innerMap.has(key2)) {
+        return innerMap.get(key2);
+    }
+    innerMap.set(key2, value);
+    return undefined;
+}
+exports.tryAddToNestedMap = tryAddToNestedMap;
+/**
+ * Copies over all entries from the source map into the destination map.
+ *
+ * @internal
+ */
+function populateNestedMap(source, destination) {
+    for (const [key1, innerMap] of source) {
+        destination.set(key1, new Map(innerMap));
+    }
+}
+exports.populateNestedMap = populateNestedMap;
+/**
+ * Sets the value at (key1, key2) in map to value.
+ * If there already is a value for (key1, key2), it is replaced with the provided one.
+ *
+ * @internal
+ */
+function setInNestedMap(map, key1, key2, value) {
+    const innerMap = getOrAddInMap(map, key1, new Map());
+    innerMap.set(key2, value);
+}
+exports.setInNestedMap = setInNestedMap;
+/**
+ * Sets the value at `key` in map to value if not already present.
+ * Returns the value at `key` after setting it.
+ * This is equivalent to a get or default that adds the default to the map.
+ */
+function getOrAddInMap(map, key, value) {
+    const currentValue = map.get(key);
+    if (currentValue !== undefined) {
+        return currentValue;
+    }
+    map.set(key, value);
+    return value;
+}
+exports.getOrAddInMap = getOrAddInMap;
+/**
+ * Returns the value at (key1, key2) in map, or undefined if not present.
+ *
+ * @internal
+ */
+function tryGetFromNestedMap(map, key1, key2) {
+    const innerMap = map.get(key1);
+    if (innerMap === undefined) {
+        return undefined;
+    }
+    return innerMap.get(key2);
+}
+exports.tryGetFromNestedMap = tryGetFromNestedMap;
+/**
+ * If (key1, key2) is not in the map, add value to the map.
+ * Returns whatever is at (key1, key2) in map (which will be value if it was empty before).
+ *
+ * @internal
+ */
+function getOrAddInNestedMap(map, key1, key2, value) {
+    const existing = tryAddToNestedMap(map, key1, key2, value);
+    if (existing !== undefined) {
+        return existing;
+    }
+    return value;
+}
+exports.getOrAddInNestedMap = getOrAddInNestedMap;
+/**
+ * Does not change map.
+ * If (key1, key2) is not in map, returns value.
+ * If (key1, key2) is in map, return its entry.
+ *
+ * @internal
+ */
+function getOrDefaultInNestedMap(map, key1, key2, value) {
+    const existing = tryGetFromNestedMap(map, key1, key2);
+    if (existing !== undefined) {
+        return existing;
+    }
+    return value;
+}
+exports.getOrDefaultInNestedMap = getOrDefaultInNestedMap;
+/**
+ * Removes the value at (key1, key2) from the map.
+ *
+ * @returns true iff found.
+ *
+ * @internal
+ */
+function deleteFromNestedMap(map, key1, key2) {
+    const innerMap = map.get(key1);
+    if (innerMap === undefined) {
+        return false;
+    }
+    const deleted = innerMap.delete(key2);
+    if (innerMap.size === 0) {
+        map.delete(key1);
+    }
+    return deleted;
+}
+exports.deleteFromNestedMap = deleteFromNestedMap;
+/**
+ * Converts a nested map to a flat list of triplets.
+ */
+function nestedMapToFlatList(map) {
+    const list = [];
+    map.forEach((innerMap, key1) => {
+        innerMap.forEach((val, key2) => {
+            list.push([key1, key2, val]);
+        });
+    });
+    return list;
+}
+exports.nestedMapToFlatList = nestedMapToFlatList;
+/**
+ * Builds a nested map from a flat list of triplets.
+ */
+function nestedMapFromFlatList(list) {
+    const map = new Map();
+    for (const [key1, key2, val] of list) {
+        getOrAddInMap(map, key1, new Map()).set(key2, val);
+    }
+    return map;
+}
+exports.nestedMapFromFlatList = nestedMapFromFlatList;
+function forEachInNestedMap(map, delegate) {
+    map.forEach((innerMap, keyFirst) => {
+        innerMap.forEach((val, keySecond) => {
+            delegate(val, keyFirst, keySecond);
+        });
+    });
+}
+exports.forEachInNestedMap = forEachInNestedMap;
+/**
+ * Map with two keys; same semantics as NestedMap, but maintains a size count for the entire collection.
+ * Note: undefined is not supported as a value, and will cause incorrect behavior.
+ *
+ * @internal
+ */
+class SizedNestedMap {
+    constructor() {
+        this.nestedMap = new Map();
+        this.count = 0;
+    }
+    /**
+     * Returns the total number of elements in this nested map.
+     */
+    get size() {
+        return this.count;
+    }
+    /**
+     * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is
+     * returned.
+     */
+    tryGet(key1, key2) {
+        return tryGetFromNestedMap(this.nestedMap, key1, key2);
+    }
+    /**
+     * Does not change map.
+     * If (key1, key2) is not in map, returns value.
+     * If (key1, key2) is in map, return its entry.
+     */
+    getOrDefault(key1, key2, value) {
+        return getOrDefaultInNestedMap(this.nestedMap, key1, key2, value);
+    }
+    /**
+     * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is
+     * returned.
+     */
+    tryAdd(key1, key2, value) {
+        const currentVal = tryAddToNestedMap(this.nestedMap, key1, key2, value);
+        if (currentVal === undefined) {
+            this.count++;
+        }
+        return currentVal;
+    }
+    /**
+     * Sets the value at (key1, key2) in map to value.
+     * If there already is a value for (key1, key2), it is replaced with the provided one.
+     */
+    set(key1, key2, value) {
+        if (this.tryAdd(key1, key2, value) !== undefined) {
+            setInNestedMap(this.nestedMap, key1, key2, value);
+        }
+    }
+    /**
+     * Removes the value at (key1, key2) from the map.
+     * Returns true iff found.
+     */
+    delete(key1, key2) {
+        const deleted = deleteFromNestedMap(this.nestedMap, key1, key2);
+        if (deleted) {
+            this.count--;
+        }
+        return deleted;
+    }
+    /**
+     * Runs the supplied delegate for every (value, key1, key2).
+     */
+    forEach(delegate) {
+        forEachInNestedMap(this.nestedMap, delegate);
+    }
+    /**
+     * Clears the map.
+     */
+    clear() {
+        this.count = 0;
+        this.nestedMap.clear();
+    }
+    values() {
+        return Array.from(this.nestedMap.values()).flatMap((innerMap) => innerMap.values())[0];
+    }
+    [Symbol.iterator]() {
+        return this.nestedMap[Symbol.iterator]();
+    }
+}
+exports.SizedNestedMap = SizedNestedMap;
+//# sourceMappingURL=nestedMap.js.map

package/dist/util/nestedMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nestedMap.js","sourceRoot":"","sources":["../../src/util/nestedMap.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAeH;;;;GAIG;AACH,SAAgB,iBAAiB,CAChC,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,IAAI,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7B,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QACrB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;KACxB;IACD,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QACvB,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;KAC1B;IACD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC1B,OAAO,SAAS,CAAC;AAClB,CAAC;AAhBD,8CAgBC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAChC,MAAoC,EACpC,WAAyC;IAEzC,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,EAAE;QACtC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;KACzC;AACF,CAAC;AAPD,8CAOC;AACD;;;;;GAKG;AACH,SAAgB,cAAc,CAC7B,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,EAAe,CAAC,CAAC;IAClE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC3B,CAAC;AARD,wCAQC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAC5B,GAA0B,EAC1B,GAAQ,EACR,KAAY;IAEZ,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,YAAY,KAAK,SAAS,EAAE;QAC/B,OAAO,YAAY,CAAC;KACpB;IACD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACpB,OAAO,KAAK,CAAC;AACd,CAAC;AAXD,sCAWC;AAED;;;;GAIG;AACH,SAAgB,mBAAmB,CAClC,GAAiC,EACjC,IAAU,EACV,IAAU;IAEV,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,SAAS,CAAC;KACjB;IACD,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAVD,kDAUC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAClC,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC3D,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,QAAQ,CAAC;KAChB;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAXD,kDAWC;AAED;;;;;;GAMG;AACH,SAAgB,uBAAuB,CACtC,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACtD,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,QAAQ,CAAC;KAChB;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAXD,0DAWC;AAED;;;;;;GAMG;AACH,SAAgB,mBAAmB,CAClC,GAAiC,EACjC,IAAU,EACV,IAAU;IAEV,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,KAAK,CAAC;KACb;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;QACxB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;KACjB;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAdD,kDAcC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAClC,GAAiC;IAEjC,MAAM,IAAI,GAA0B,EAAE,CAAC;IACvC,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE;QAC9B,QAAQ,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;YAC9B,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,IAAI,CAAC;AACb,CAAC;AAVD,kDAUC;AAED;;GAEG;AACH,SAAgB,qBAAqB,CACpC,IAA+C;IAE/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE;QACrC,aAAa,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,EAAe,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;KAChE;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AARD,sDAQC;AAED,SAAgB,kBAAkB,CACjC,GAAiC,EACjC,QAAwD;IAExD,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;QAClC,QAAQ,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE;YACnC,QAAQ,CAAC,GAAG,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AATD,gDASC;AAED;;;;;GAKG;AACH,MAAa,cAAc;IAA3B;QACkB,cAAS,GAAiC,IAAI,GAAG,EAAE,CAAC;QAC7D,UAAK,GAAG,CAAC,CAAC;IAkFnB,CAAC;IAhFA;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,IAAU,EAAE,IAAU;QACnC,OAAO,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACxD,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,IAAU,EAAE,IAAU,EAAE,KAAY;QACvD,OAAO,uBAAuB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,IAAU,EAAE,IAAU,EAAE,KAAY;QACjD,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;SACb;QACD,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,GAAG,CAAC,IAAU,EAAE,IAAU,EAAE,KAAY;QAC9C,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,SAAS,EAAE;YACjD,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;SAClD;IACF,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,IAAU,EAAE,IAAU;QACnC,MAAM,OAAO,GAAG,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChE,IAAI,OAAO,EAAE;YACZ,IAAI,CAAC,KAAK,EAAE,CAAC;SACb;QACD,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,QAAwD;QACtE,kBAAkB,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,KAAK;QACX,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAEM,MAAM;QACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC1C,CAAC;CACD;AApFD,wCAoFC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { MapGetSet } from \"./utils\";\n\n/**\n * A dictionary whose values are keyed off of two objects (key1, key2).\n * As it is a nested map, size() will return the number of distinct key1s.\n * If you need constant-time access to the number of values, use SizedNestedMap instead.\n *\n * This code assumes values will not be undefined (keys can be undefined).\n *\n * @internal\n */\nexport type NestedMap<Key1, Key2, Value> = Map<Key1, Map<Key2, Value>>;\n\n/**\n * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is returned.\n *\n * @internal\n */\nexport function tryAddToNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): Value | undefined {\n\tlet innerMap = map.get(key1);\n\tif (innerMap === undefined) {\n\t\tinnerMap = new Map();\n\t\tmap.set(key1, innerMap);\n\t}\n\tif (innerMap.has(key2)) {\n\t\treturn innerMap.get(key2);\n\t}\n\tinnerMap.set(key2, value);\n\treturn undefined;\n}\n\n/**\n * Copies over all entries from the source map into the destination map.\n *\n * @internal\n */\nexport function populateNestedMap<Key1, Key2, Value>(\n\tsource: NestedMap<Key1, Key2, Value>,\n\tdestination: NestedMap<Key1, Key2, Value>,\n): void {\n\tfor (const [key1, innerMap] of source) {\n\t\tdestination.set(key1, new Map(innerMap));\n\t}\n}\n/**\n * Sets the value at (key1, key2) in map to value.\n * If there already is a value for (key1, key2), it is replaced with the provided one.\n *\n * @internal\n */\nexport function setInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): void {\n\tconst innerMap = getOrAddInMap(map, key1, new Map<Key2, Value>());\n\tinnerMap.set(key2, value);\n}\n\n/**\n * Sets the value at `key` in map to value if not already present.\n * Returns the value at `key` after setting it.\n * This is equivalent to a get or default that adds the default to the map.\n */\nexport function getOrAddInMap<Key, Value>(\n\tmap: MapGetSet<Key, Value>,\n\tkey: Key,\n\tvalue: Value,\n): Value {\n\tconst currentValue = map.get(key);\n\tif (currentValue !== undefined) {\n\t\treturn currentValue;\n\t}\n\tmap.set(key, value);\n\treturn value;\n}\n\n/**\n * Returns the value at (key1, key2) in map, or undefined if not present.\n *\n * @internal\n */\nexport function tryGetFromNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n): Value | undefined {\n\tconst innerMap = map.get(key1);\n\tif (innerMap === undefined) {\n\t\treturn undefined;\n\t}\n\treturn innerMap.get(key2);\n}\n\n/**\n * If (key1, key2) is not in the map, add value to the map.\n * Returns whatever is at (key1, key2) in map (which will be value if it was empty before).\n *\n * @internal\n */\nexport function getOrAddInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): Value {\n\tconst existing = tryAddToNestedMap(map, key1, key2, value);\n\tif (existing !== undefined) {\n\t\treturn existing;\n\t}\n\treturn value;\n}\n\n/**\n * Does not change map.\n * If (key1, key2) is not in map, returns value.\n * If (key1, key2) is in map, return its entry.\n *\n * @internal\n */\nexport function getOrDefaultInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): Value {\n\tconst existing = tryGetFromNestedMap(map, key1, key2);\n\tif (existing !== undefined) {\n\t\treturn existing;\n\t}\n\treturn value;\n}\n\n/**\n * Removes the value at (key1, key2) from the map.\n *\n * @returns true iff found.\n *\n * @internal\n */\nexport function deleteFromNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n): boolean {\n\tconst innerMap = map.get(key1);\n\tif (innerMap === undefined) {\n\t\treturn false;\n\t}\n\tconst deleted = innerMap.delete(key2);\n\tif (innerMap.size === 0) {\n\t\tmap.delete(key1);\n\t}\n\treturn deleted;\n}\n\n/**\n * Converts a nested map to a flat list of triplets.\n */\nexport function nestedMapToFlatList<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n): [Key1, Key2, Value][] {\n\tconst list: [Key1, Key2, Value][] = [];\n\tmap.forEach((innerMap, key1) => {\n\t\tinnerMap.forEach((val, key2) => {\n\t\t\tlist.push([key1, key2, val]);\n\t\t});\n\t});\n\treturn list;\n}\n\n/**\n * Builds a nested map from a flat list of triplets.\n */\nexport function nestedMapFromFlatList<Key1, Key2, Value>(\n\tlist: readonly (readonly [Key1, Key2, Value])[],\n): NestedMap<Key1, Key2, Value> {\n\tconst map = new Map<Key1, Map<Key2, Value>>();\n\tfor (const [key1, key2, val] of list) {\n\t\tgetOrAddInMap(map, key1, new Map<Key2, Value>()).set(key2, val);\n\t}\n\treturn map;\n}\n\nexport function forEachInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tdelegate: (value: Value, key1: Key1, key2: Key2) => void,\n): void {\n\tmap.forEach((innerMap, keyFirst) => {\n\t\tinnerMap.forEach((val, keySecond) => {\n\t\t\tdelegate(val, keyFirst, keySecond);\n\t\t});\n\t});\n}\n\n/**\n * Map with two keys; same semantics as NestedMap, but maintains a size count for the entire collection.\n * Note: undefined is not supported as a value, and will cause incorrect behavior.\n *\n * @internal\n */\nexport class SizedNestedMap<Key1, Key2, Value> {\n\tprivate readonly nestedMap: NestedMap<Key1, Key2, Value> = new Map();\n\tprivate count = 0;\n\n\t/**\n\t * Returns the total number of elements in this nested map.\n\t */\n\tpublic get size(): number {\n\t\treturn this.count;\n\t}\n\n\t/**\n\t * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is\n\t * returned.\n\t */\n\tpublic tryGet(key1: Key1, key2: Key2): Value | undefined {\n\t\treturn tryGetFromNestedMap(this.nestedMap, key1, key2);\n\t}\n\n\t/**\n\t * Does not change map.\n\t * If (key1, key2) is not in map, returns value.\n\t * If (key1, key2) is in map, return its entry.\n\t */\n\tpublic getOrDefault(key1: Key1, key2: Key2, value: Value): Value {\n\t\treturn getOrDefaultInNestedMap(this.nestedMap, key1, key2, value);\n\t}\n\n\t/**\n\t * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is\n\t * returned.\n\t */\n\tpublic tryAdd(key1: Key1, key2: Key2, value: Value): Value | undefined {\n\t\tconst currentVal = tryAddToNestedMap(this.nestedMap, key1, key2, value);\n\t\tif (currentVal === undefined) {\n\t\t\tthis.count++;\n\t\t}\n\t\treturn currentVal;\n\t}\n\n\t/**\n\t * Sets the value at (key1, key2) in map to value.\n\t * If there already is a value for (key1, key2), it is replaced with the provided one.\n\t */\n\tpublic set(key1: Key1, key2: Key2, value: Value): void {\n\t\tif (this.tryAdd(key1, key2, value) !== undefined) {\n\t\t\tsetInNestedMap(this.nestedMap, key1, key2, value);\n\t\t}\n\t}\n\n\t/**\n\t * Removes the value at (key1, key2) from the map.\n\t * Returns true iff found.\n\t */\n\tpublic delete(key1: Key1, key2: Key2): boolean {\n\t\tconst deleted = deleteFromNestedMap(this.nestedMap, key1, key2);\n\t\tif (deleted) {\n\t\t\tthis.count--;\n\t\t}\n\t\treturn deleted;\n\t}\n\n\t/**\n\t * Runs the supplied delegate for every (value, key1, key2).\n\t */\n\tpublic forEach(delegate: (value: Value, key1: Key1, key2: Key2) => void): void {\n\t\tforEachInNestedMap(this.nestedMap, delegate);\n\t}\n\n\t/**\n\t * Clears the map.\n\t */\n\tpublic clear(): void {\n\t\tthis.count = 0;\n\t\tthis.nestedMap.clear();\n\t}\n\n\tpublic values(): IterableIterator<Value> {\n\t\treturn Array.from(this.nestedMap.values()).flatMap((innerMap) => innerMap.values())[0];\n\t}\n\n\tpublic [Symbol.iterator]() {\n\t\treturn this.nestedMap[Symbol.iterator]();\n\t}\n}\n"]}

package/dist/util/nestedSet.d.ts

@@ -0,0 +1,9 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { NestedMap } from "./nestedMap";
+export type NestedSet<Key1, Key2> = NestedMap<Key1, Key2, boolean>;
+export declare function addToNestedSet<Key1, Key2>(set: NestedSet<Key1, Key2>, key1: Key1, key2: Key2): void;
+export declare function nestedSetContains<Key1, Key2>(set: NestedSet<Key1, Key2>, key1: Key1, key2: Key2): boolean;
+//# sourceMappingURL=nestedSet.d.ts.map

package/dist/util/nestedSet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nestedSet.d.ts","sourceRoot":"","sources":["../../src/util/nestedSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAA2B,SAAS,EAAkB,MAAM,aAAa,CAAC;AAEjF,MAAM,MAAM,SAAS,CAAC,IAAI,EAAE,IAAI,IAAI,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AAEnE,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EACxC,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,EAC1B,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,GACR,IAAI,CAEN;AAED,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAC3C,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,EAC1B,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,GACR,OAAO,CAET"}

package/dist/util/nestedSet.js

@@ -0,0 +1,17 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nestedSetContains = exports.addToNestedSet = void 0;
+const nestedMap_1 = require("./nestedMap");
+function addToNestedSet(set, key1, key2) {
+    (0, nestedMap_1.setInNestedMap)(set, key1, key2, true);
+}
+exports.addToNestedSet = addToNestedSet;
+function nestedSetContains(set, key1, key2) {
+    return (0, nestedMap_1.getOrDefaultInNestedMap)(set, key1, key2, false);
+}
+exports.nestedSetContains = nestedSetContains;
+//# sourceMappingURL=nestedSet.js.map

package/dist/util/nestedSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nestedSet.js","sourceRoot":"","sources":["../../src/util/nestedSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2CAAiF;AAIjF,SAAgB,cAAc,CAC7B,GAA0B,EAC1B,IAAU,EACV,IAAU;IAEV,IAAA,0BAAc,EAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACvC,CAAC;AAND,wCAMC;AAED,SAAgB,iBAAiB,CAChC,GAA0B,EAC1B,IAAU,EACV,IAAU;IAEV,OAAO,IAAA,mCAAuB,EAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACxD,CAAC;AAND,8CAMC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { getOrDefaultInNestedMap, NestedMap, setInNestedMap } from \"./nestedMap\";\n\nexport type NestedSet<Key1, Key2> = NestedMap<Key1, Key2, boolean>;\n\nexport function addToNestedSet<Key1, Key2>(\n\tset: NestedSet<Key1, Key2>,\n\tkey1: Key1,\n\tkey2: Key2,\n): void {\n\tsetInNestedMap(set, key1, key2, true);\n}\n\nexport function nestedSetContains<Key1, Key2>(\n\tset: NestedSet<Key1, Key2>,\n\tkey1: Key1,\n\tkey2: Key2,\n): boolean {\n\treturn getOrDefaultInNestedMap(set, key1, key2, false);\n}\n"]}

package/dist/util/offsetList.d.ts

@@ -0,0 +1,22 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export type OffsetList<TContent = Exclude<unknown, number>, TOffset = number> = (TOffset | TContent)[];
+/**
+ * Helper class for constructing an offset list that...
+ *
+ * - Does not insert offsets if there is no content after them
+ *
+ * - Does not insert 0-sized offsets
+ *
+ * - Merges runs of offsets together
+ */
+export declare class OffsetListFactory<TContent> {
+    private offset;
+    readonly list: OffsetList<TContent>;
+    push(...offsetOrContent: (number | TContent)[]): void;
+    pushOffset(offset: number): void;
+    pushContent(content: TContent): void;
+}
+//# sourceMappingURL=offsetList.d.ts.map

package/dist/util/offsetList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"offsetList.d.ts","sourceRoot":"","sources":["../../src/util/offsetList.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,MAAM,UAAU,CAAC,QAAQ,GAAG,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM,IAAI,CAC7E,OAAO,GACP,QAAQ,CACV,EAAE,CAAC;AAEJ;;;;;;;;GAQG;AACH,qBAAa,iBAAiB,CAAC,QAAQ;IACtC,OAAO,CAAC,MAAM,CAAK;IACnB,SAAgB,IAAI,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAM;IAEzC,IAAI,CAAC,GAAG,eAAe,EAAE,CAAC,MAAM,GAAG,QAAQ,CAAC,EAAE,GAAG,IAAI;IAUrD,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIhC,WAAW,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI;CAO3C"}