@contember/utilities 2.0.0-alpha.16 → 2.0.0-alpha.18

package/dist/development/index.cjs

@@ -18,6 +18,9 @@ const omit = require("./src/functional/omit.cjs");
 const pick = require("./src/functional/pick.cjs");
 const range = require("./src/functional/range.cjs");
 const kebabCase = require("./src/string-utilities/kebabCase.cjs");
+const BijectiveIndexedMap = require("./src/structures/BijectiveIndexedMap.cjs");
+const LRUCache = require("./src/structures/LRUCache.cjs");
+const WeakIdCache = require("./src/structures/WeakIdCache.cjs");
 exports.AssertionError = AssertionError.AssertionError;
 exports.isNonNegativeNumber = Predicates.isNonNegativeNumber;
 exports.assert = assert.assert;
@@ -37,4 +40,7 @@ exports.omit = omit.omit;
 exports.pick = pick.pick;
 exports.range = range.range;
 exports.toKebabCase = kebabCase.toKebabCase;
+exports.BijectiveIndexedMap = BijectiveIndexedMap.BijectiveIndexedMap;
+exports.LRUCache = LRUCache.LRUCache;
+exports.WeakIdCache = WeakIdCache.WeakIdCache;
 //# sourceMappingURL=index.cjs.map

package/dist/development/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/development/index.js

@@ -16,8 +16,14 @@ import { omit } from "./src/functional/omit.js";
 import { pick } from "./src/functional/pick.js";
 import { range } from "./src/functional/range.js";
 import { toKebabCase } from "./src/string-utilities/kebabCase.js";
+import { BijectiveIndexedMap } from "./src/structures/BijectiveIndexedMap.js";
+import { LRUCache } from "./src/structures/LRUCache.js";
+import { WeakIdCache } from "./src/structures/WeakIdCache.js";
 export {
   AssertionError,
+  BijectiveIndexedMap,
+  LRUCache,
+  WeakIdCache,
   assert,
   assertNever,
   dataAttribute,

package/dist/development/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;"}

package/dist/development/src/structures/BijectiveIndexedMap.cjs

@@ -0,0 +1,116 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+var _a;
+class BijectiveIndexedMap {
+  constructor(inverseOrMap) {
+    __publicField(this, "valueStore");
+    __publicField(this, "index");
+    __publicField(this, "indexSeed");
+    __publicField(this, "inverse");
+    __publicField(this, _a, "BijectiveIndexedMap");
+    if (inverseOrMap instanceof BijectiveIndexedMap) {
+      this.valueStore = new Map(inverseOrMap.valueStore);
+      this.index = new Map(inverseOrMap.index);
+      this.indexSeed = inverseOrMap.indexSeed;
+      this.inverse = inverseOrMap.inverse;
+    } else {
+      this.valueStore = /* @__PURE__ */ new Map();
+      this.index = /* @__PURE__ */ new Map();
+      this.indexSeed = 0;
+      this.inverse = inverseOrMap;
+    }
+  }
+  getNewIndex() {
+    return this.indexSeed++;
+  }
+  get size() {
+    return this.valueStore.size;
+  }
+  clear() {
+    this.valueStore.clear();
+    this.index.clear();
+  }
+  delete(key) {
+    const index = this.index.get(key);
+    if (index === void 0) {
+      return false;
+    }
+    this.valueStore.delete(index);
+    this.index.delete(key);
+    return true;
+  }
+  forEach(callback, thisArg) {
+    for (const [key, value] of this.entries()) {
+      callback.call(thisArg, value, key, this);
+    }
+  }
+  get(key) {
+    const index = this.index.get(key);
+    if (index === void 0) {
+      return void 0;
+    }
+    return this.valueStore.get(index);
+  }
+  has(key) {
+    return this.index.has(key);
+  }
+  set(key, value) {
+    const existingIndex = this.index.get(key);
+    if (existingIndex === void 0) {
+      const newIndex = this.getNewIndex();
+      this.index.set(key, newIndex);
+      this.valueStore.set(newIndex, value);
+    } else {
+      this.valueStore.set(existingIndex, value);
+    }
+    return this;
+  }
+  // This doesn't use the inverse in order to avoid confusion.
+  // See the description above.
+  changeKey(oldKey, newKey) {
+    const index = this.index.get(oldKey);
+    if (index === void 0) {
+      throw new Error();
+    }
+    this.index.delete(oldKey);
+    this.index.set(newKey, index);
+    return this;
+  }
+  changeKeyOrder(newOrder) {
+    for (const key of newOrder) {
+      const keyIndex = this.index.get(key);
+      if (keyIndex === void 0) {
+        throw new Error();
+      }
+      const value = this.valueStore.get(keyIndex);
+      this.valueStore.delete(keyIndex);
+      this.valueStore.set(keyIndex, value);
+    }
+  }
+  *[(_a = Symbol.toStringTag, Symbol.iterator)]() {
+    yield* this.entries();
+  }
+  *entries() {
+    for (const value of this.values()) {
+      yield [this.inverse(value), value];
+    }
+  }
+  *keys() {
+    for (const value of this.values()) {
+      yield this.inverse(value);
+    }
+  }
+  *values() {
+    for (const value of this.valueStore.values()) {
+      if (value === void 0) {
+        continue;
+      }
+      yield value;
+    }
+  }
+}
+exports.BijectiveIndexedMap = BijectiveIndexedMap;
+//# sourceMappingURL=BijectiveIndexedMap.cjs.map

package/dist/development/src/structures/BijectiveIndexedMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"BijectiveIndexedMap.cjs","sources":["../../../../../packages/utilities/src/structures/BijectiveIndexedMap.ts"],"sourcesContent":["// Bijective as in we need to supply the inverse and also guarantee that the values are unique.\n// Provided this invariant, this should behave more or less like a regular map except it has a somewhat special\n// iteration order. Unlike a regular map, which just honors insertion order, this also provides a special method\n// changeKey. With this, we can change the key under which a value (that is already on the map) is accessible.\n// With an ordinary map, that operation would require us to delete the original [K1, V] pair and insert\n// a new one [K2, V]. That would however change the order of iteration. This main purpose of this data structure is\n// the ability to avoid that and enable the value V to preserve its original place.\nexport class BijectiveIndexedMap<K, V> implements Map<K, V> {\n\tprivate readonly valueStore: Map<number, V>\n\tprivate readonly index: Map<K, number>\n\tprivate indexSeed: number\n\n\tprivate readonly inverse: (value: V) => K\n\n\tpublic readonly [Symbol.toStringTag] = 'BijectiveIndexedMap'\n\n\tpublic constructor(originalMap: BijectiveIndexedMap<K, V>)\n\tpublic constructor(inverse: (value: V) => K)\n\tpublic constructor(inverseOrMap: BijectiveIndexedMap<K, V> | ((value: V) => K)) {\n\t\tif (inverseOrMap instanceof BijectiveIndexedMap) {\n\t\t\tthis.valueStore = new Map(inverseOrMap.valueStore)\n\t\t\tthis.index = new Map(inverseOrMap.index)\n\t\t\tthis.indexSeed = inverseOrMap.indexSeed\n\t\t\tthis.inverse = inverseOrMap.inverse\n\t\t} else {\n\t\t\tthis.valueStore = new Map()\n\t\t\tthis.index = new Map()\n\t\t\tthis.indexSeed = 0\n\t\t\tthis.inverse = inverseOrMap\n\t\t}\n\t}\n\n\tprivate getNewIndex() {\n\t\treturn this.indexSeed++\n\t}\n\n\tpublic get size(): number {\n\t\treturn this.valueStore.size\n\t}\n\n\tpublic clear(): void {\n\t\tthis.valueStore.clear()\n\t\tthis.index.clear()\n\t}\n\tpublic delete(key: K): boolean {\n\t\tconst index = this.index.get(key)\n\n\t\tif (index === undefined) {\n\t\t\treturn false\n\t\t}\n\t\tthis.valueStore.delete(index)\n\t\tthis.index.delete(key)\n\t\treturn true\n\t}\n\tpublic forEach(callback: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tfor (const [key, value] of this.entries()) {\n\t\t\tcallback.call(thisArg, value, key, this)\n\t\t}\n\t}\n\n\tpublic get(key: K): V | undefined {\n\t\tconst index = this.index.get(key)\n\n\t\tif (index === undefined) {\n\t\t\treturn undefined\n\t\t}\n\t\treturn this.valueStore.get(index)\n\t}\n\tpublic has(key: K): boolean {\n\t\treturn this.index.has(key)\n\t}\n\tpublic set(key: K, value: V): this {\n\t\tconst existingIndex = this.index.get(key)\n\n\t\tif (existingIndex === undefined) {\n\t\t\tconst newIndex = this.getNewIndex()\n\t\t\tthis.index.set(key, newIndex)\n\t\t\tthis.valueStore.set(newIndex, value)\n\t\t} else {\n\t\t\tthis.valueStore.set(existingIndex, value)\n\t\t}\n\t\treturn this\n\t}\n\n\t// This doesn't use the inverse in order to avoid confusion.\n\t// See the description above.\n\tpublic changeKey(oldKey: K, newKey: K): this {\n\t\tconst index = this.index.get(oldKey)\n\t\tif (index === undefined) {\n\t\t\tthrow new Error()\n\t\t}\n\t\tthis.index.delete(oldKey)\n\t\tthis.index.set(newKey, index)\n\t\treturn this\n\t}\n\n\tpublic changeKeyOrder(newOrder: Iterable<K>) {\n\t\tfor (const key of newOrder) {\n\t\t\tconst keyIndex = this.index.get(key)\n\t\t\tif (keyIndex === undefined) {\n\t\t\t\tthrow new Error()\n\t\t\t}\n\t\t\tconst value = this.valueStore.get(keyIndex)!\n\n\t\t\t// This effectively removes value from wherever it was and puts it at the end.\n\t\t\t// Provided newOrder.size is the same as valueStore, by the end of this loop\n\t\t\t// the values will be in the correct order.\n\t\t\tthis.valueStore.delete(keyIndex)\n\t\t\tthis.valueStore.set(keyIndex, value)\n\t\t}\n\t}\n\n\tpublic *[Symbol.iterator](): IterableIterator<[K, V]> {\n\t\tyield* this.entries()\n\t}\n\n\tpublic *entries(): IterableIterator<[K, V]> {\n\t\tfor (const value of this.values()) {\n\t\t\tyield [this.inverse(value), value]\n\t\t}\n\t}\n\n\tpublic *keys(): IterableIterator<K> {\n\t\tfor (const value of this.values()) {\n\t\t\tyield this.inverse(value)\n\t\t}\n\t}\n\n\tpublic *values(): IterableIterator<V> {\n\t\tfor (const value of this.valueStore.values()) {\n\t\t\tif (value === undefined) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tyield value\n\t\t}\n\t}\n}\n"],"names":[],"mappings":";;;;;AAAA,IAAA;AAOO,MAAM,oBAA+C;AAAA,EAWpD,YAAY,cAA6D;AAV/D,kBAAA,MAAA,YAAA;AACA,kBAAA,MAAA,OAAA;AACT,kBAAA,MAAA,WAAA;AAES,kBAAA,MAAA,SAAA;AAEjB,kBAAA,MAAiB,IAAsB,qBAAA;AAKtC,QAAI,wBAAwB,qBAAqB;AAChD,WAAK,aAAa,IAAI,IAAI,aAAa,UAAU;AACjD,WAAK,QAAQ,IAAI,IAAI,aAAa,KAAK;AACvC,WAAK,YAAY,aAAa;AAC9B,WAAK,UAAU,aAAa;AAAA,IAAA,OACtB;AACD,WAAA,iCAAiB;AACjB,WAAA,4BAAY;AACjB,WAAK,YAAY;AACjB,WAAK,UAAU;AAAA,IAChB;AAAA,EACD;AAAA,EAEQ,cAAc;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,IAAW,OAAe;AACzB,WAAO,KAAK,WAAW;AAAA,EACxB;AAAA,EAEO,QAAc;AACpB,SAAK,WAAW;AAChB,SAAK,MAAM;EACZ;AAAA,EACO,OAAO,KAAiB;AAC9B,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACjB,aAAA;AAAA,IACR;AACK,SAAA,WAAW,OAAO,KAAK;AACvB,SAAA,MAAM,OAAO,GAAG;AACd,WAAA;AAAA,EACR;AAAA,EACO,QAAQ,UAAsD,SAAqB;AACzF,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,WAAW;AAC1C,eAAS,KAAK,SAAS,OAAO,KAAK,IAAI;AAAA,IACxC;AAAA,EACD;AAAA,EAEO,IAAI,KAAuB;AACjC,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACjB,aAAA;AAAA,IACR;AACO,WAAA,KAAK,WAAW,IAAI,KAAK;AAAA,EACjC;AAAA,EACO,IAAI,KAAiB;AACpB,WAAA,KAAK,MAAM,IAAI,GAAG;AAAA,EAC1B;AAAA,EACO,IAAI,KAAQ,OAAgB;AAClC,UAAM,gBAAgB,KAAK,MAAM,IAAI,GAAG;AAExC,QAAI,kBAAkB,QAAW;AAC1B,YAAA,WAAW,KAAK;AACjB,WAAA,MAAM,IAAI,KAAK,QAAQ;AACvB,WAAA,WAAW,IAAI,UAAU,KAAK;AAAA,IAAA,OAC7B;AACD,WAAA,WAAW,IAAI,eAAe,KAAK;AAAA,IACzC;AACO,WAAA;AAAA,EACR;AAAA;AAAA;AAAA,EAIO,UAAU,QAAW,QAAiB;AAC5C,UAAM,QAAQ,KAAK,MAAM,IAAI,MAAM;AACnC,QAAI,UAAU,QAAW;AACxB,YAAM,IAAI,MAAM;AAAA,IACjB;AACK,SAAA,MAAM,OAAO,MAAM;AACnB,SAAA,MAAM,IAAI,QAAQ,KAAK;AACrB,WAAA;AAAA,EACR;AAAA,EAEO,eAAe,UAAuB;AAC5C,eAAW,OAAO,UAAU;AAC3B,YAAM,WAAW,KAAK,MAAM,IAAI,GAAG;AACnC,UAAI,aAAa,QAAW;AAC3B,cAAM,IAAI,MAAM;AAAA,MACjB;AACA,YAAM,QAAQ,KAAK,WAAW,IAAI,QAAQ;AAKrC,WAAA,WAAW,OAAO,QAAQ;AAC1B,WAAA,WAAW,IAAI,UAAU,KAAK;AAAA,IACpC;AAAA,EACD;AAAA,EAEA,GAlGiB,KAAA,OAAO,aAkGf,OAAO,aAAsC;AACrD,WAAO,KAAK;EACb;AAAA,EAEA,CAAQ,UAAoC;AAChC,eAAA,SAAS,KAAK,UAAU;AAClC,YAAM,CAAC,KAAK,QAAQ,KAAK,GAAG,KAAK;AAAA,IAClC;AAAA,EACD;AAAA,EAEA,CAAQ,OAA4B;AACxB,eAAA,SAAS,KAAK,UAAU;AAC5B,YAAA,KAAK,QAAQ,KAAK;AAAA,IACzB;AAAA,EACD;AAAA,EAEA,CAAQ,SAA8B;AACrC,eAAW,SAAS,KAAK,WAAW,OAAA,GAAU;AAC7C,UAAI,UAAU,QAAW;AACxB;AAAA,MACD;AACM,YAAA;AAAA,IACP;AAAA,EACD;AACD;;"}

package/dist/development/src/structures/BijectiveIndexedMap.js

@@ -0,0 +1,116 @@
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+var _a;
+class BijectiveIndexedMap {
+  constructor(inverseOrMap) {
+    __publicField(this, "valueStore");
+    __publicField(this, "index");
+    __publicField(this, "indexSeed");
+    __publicField(this, "inverse");
+    __publicField(this, _a, "BijectiveIndexedMap");
+    if (inverseOrMap instanceof BijectiveIndexedMap) {
+      this.valueStore = new Map(inverseOrMap.valueStore);
+      this.index = new Map(inverseOrMap.index);
+      this.indexSeed = inverseOrMap.indexSeed;
+      this.inverse = inverseOrMap.inverse;
+    } else {
+      this.valueStore = /* @__PURE__ */ new Map();
+      this.index = /* @__PURE__ */ new Map();
+      this.indexSeed = 0;
+      this.inverse = inverseOrMap;
+    }
+  }
+  getNewIndex() {
+    return this.indexSeed++;
+  }
+  get size() {
+    return this.valueStore.size;
+  }
+  clear() {
+    this.valueStore.clear();
+    this.index.clear();
+  }
+  delete(key) {
+    const index = this.index.get(key);
+    if (index === void 0) {
+      return false;
+    }
+    this.valueStore.delete(index);
+    this.index.delete(key);
+    return true;
+  }
+  forEach(callback, thisArg) {
+    for (const [key, value] of this.entries()) {
+      callback.call(thisArg, value, key, this);
+    }
+  }
+  get(key) {
+    const index = this.index.get(key);
+    if (index === void 0) {
+      return void 0;
+    }
+    return this.valueStore.get(index);
+  }
+  has(key) {
+    return this.index.has(key);
+  }
+  set(key, value) {
+    const existingIndex = this.index.get(key);
+    if (existingIndex === void 0) {
+      const newIndex = this.getNewIndex();
+      this.index.set(key, newIndex);
+      this.valueStore.set(newIndex, value);
+    } else {
+      this.valueStore.set(existingIndex, value);
+    }
+    return this;
+  }
+  // This doesn't use the inverse in order to avoid confusion.
+  // See the description above.
+  changeKey(oldKey, newKey) {
+    const index = this.index.get(oldKey);
+    if (index === void 0) {
+      throw new Error();
+    }
+    this.index.delete(oldKey);
+    this.index.set(newKey, index);
+    return this;
+  }
+  changeKeyOrder(newOrder) {
+    for (const key of newOrder) {
+      const keyIndex = this.index.get(key);
+      if (keyIndex === void 0) {
+        throw new Error();
+      }
+      const value = this.valueStore.get(keyIndex);
+      this.valueStore.delete(keyIndex);
+      this.valueStore.set(keyIndex, value);
+    }
+  }
+  *[(_a = Symbol.toStringTag, Symbol.iterator)]() {
+    yield* this.entries();
+  }
+  *entries() {
+    for (const value of this.values()) {
+      yield [this.inverse(value), value];
+    }
+  }
+  *keys() {
+    for (const value of this.values()) {
+      yield this.inverse(value);
+    }
+  }
+  *values() {
+    for (const value of this.valueStore.values()) {
+      if (value === void 0) {
+        continue;
+      }
+      yield value;
+    }
+  }
+}
+export {
+  BijectiveIndexedMap
+};
+//# sourceMappingURL=BijectiveIndexedMap.js.map

package/dist/development/src/structures/BijectiveIndexedMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BijectiveIndexedMap.js","sources":["../../../../../packages/utilities/src/structures/BijectiveIndexedMap.ts"],"sourcesContent":["// Bijective as in we need to supply the inverse and also guarantee that the values are unique.\n// Provided this invariant, this should behave more or less like a regular map except it has a somewhat special\n// iteration order. Unlike a regular map, which just honors insertion order, this also provides a special method\n// changeKey. With this, we can change the key under which a value (that is already on the map) is accessible.\n// With an ordinary map, that operation would require us to delete the original [K1, V] pair and insert\n// a new one [K2, V]. That would however change the order of iteration. This main purpose of this data structure is\n// the ability to avoid that and enable the value V to preserve its original place.\nexport class BijectiveIndexedMap<K, V> implements Map<K, V> {\n\tprivate readonly valueStore: Map<number, V>\n\tprivate readonly index: Map<K, number>\n\tprivate indexSeed: number\n\n\tprivate readonly inverse: (value: V) => K\n\n\tpublic readonly [Symbol.toStringTag] = 'BijectiveIndexedMap'\n\n\tpublic constructor(originalMap: BijectiveIndexedMap<K, V>)\n\tpublic constructor(inverse: (value: V) => K)\n\tpublic constructor(inverseOrMap: BijectiveIndexedMap<K, V> | ((value: V) => K)) {\n\t\tif (inverseOrMap instanceof BijectiveIndexedMap) {\n\t\t\tthis.valueStore = new Map(inverseOrMap.valueStore)\n\t\t\tthis.index = new Map(inverseOrMap.index)\n\t\t\tthis.indexSeed = inverseOrMap.indexSeed\n\t\t\tthis.inverse = inverseOrMap.inverse\n\t\t} else {\n\t\t\tthis.valueStore = new Map()\n\t\t\tthis.index = new Map()\n\t\t\tthis.indexSeed = 0\n\t\t\tthis.inverse = inverseOrMap\n\t\t}\n\t}\n\n\tprivate getNewIndex() {\n\t\treturn this.indexSeed++\n\t}\n\n\tpublic get size(): number {\n\t\treturn this.valueStore.size\n\t}\n\n\tpublic clear(): void {\n\t\tthis.valueStore.clear()\n\t\tthis.index.clear()\n\t}\n\tpublic delete(key: K): boolean {\n\t\tconst index = this.index.get(key)\n\n\t\tif (index === undefined) {\n\t\t\treturn false\n\t\t}\n\t\tthis.valueStore.delete(index)\n\t\tthis.index.delete(key)\n\t\treturn true\n\t}\n\tpublic forEach(callback: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tfor (const [key, value] of this.entries()) {\n\t\t\tcallback.call(thisArg, value, key, this)\n\t\t}\n\t}\n\n\tpublic get(key: K): V | undefined {\n\t\tconst index = this.index.get(key)\n\n\t\tif (index === undefined) {\n\t\t\treturn undefined\n\t\t}\n\t\treturn this.valueStore.get(index)\n\t}\n\tpublic has(key: K): boolean {\n\t\treturn this.index.has(key)\n\t}\n\tpublic set(key: K, value: V): this {\n\t\tconst existingIndex = this.index.get(key)\n\n\t\tif (existingIndex === undefined) {\n\t\t\tconst newIndex = this.getNewIndex()\n\t\t\tthis.index.set(key, newIndex)\n\t\t\tthis.valueStore.set(newIndex, value)\n\t\t} else {\n\t\t\tthis.valueStore.set(existingIndex, value)\n\t\t}\n\t\treturn this\n\t}\n\n\t// This doesn't use the inverse in order to avoid confusion.\n\t// See the description above.\n\tpublic changeKey(oldKey: K, newKey: K): this {\n\t\tconst index = this.index.get(oldKey)\n\t\tif (index === undefined) {\n\t\t\tthrow new Error()\n\t\t}\n\t\tthis.index.delete(oldKey)\n\t\tthis.index.set(newKey, index)\n\t\treturn this\n\t}\n\n\tpublic changeKeyOrder(newOrder: Iterable<K>) {\n\t\tfor (const key of newOrder) {\n\t\t\tconst keyIndex = this.index.get(key)\n\t\t\tif (keyIndex === undefined) {\n\t\t\t\tthrow new Error()\n\t\t\t}\n\t\t\tconst value = this.valueStore.get(keyIndex)!\n\n\t\t\t// This effectively removes value from wherever it was and puts it at the end.\n\t\t\t// Provided newOrder.size is the same as valueStore, by the end of this loop\n\t\t\t// the values will be in the correct order.\n\t\t\tthis.valueStore.delete(keyIndex)\n\t\t\tthis.valueStore.set(keyIndex, value)\n\t\t}\n\t}\n\n\tpublic *[Symbol.iterator](): IterableIterator<[K, V]> {\n\t\tyield* this.entries()\n\t}\n\n\tpublic *entries(): IterableIterator<[K, V]> {\n\t\tfor (const value of this.values()) {\n\t\t\tyield [this.inverse(value), value]\n\t\t}\n\t}\n\n\tpublic *keys(): IterableIterator<K> {\n\t\tfor (const value of this.values()) {\n\t\t\tyield this.inverse(value)\n\t\t}\n\t}\n\n\tpublic *values(): IterableIterator<V> {\n\t\tfor (const value of this.valueStore.values()) {\n\t\t\tif (value === undefined) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tyield value\n\t\t}\n\t}\n}\n"],"names":[],"mappings":";;;AAAA,IAAA;AAOO,MAAM,oBAA+C;AAAA,EAWpD,YAAY,cAA6D;AAV/D,kBAAA,MAAA,YAAA;AACA,kBAAA,MAAA,OAAA;AACT,kBAAA,MAAA,WAAA;AAES,kBAAA,MAAA,SAAA;AAEjB,kBAAA,MAAiB,IAAsB,qBAAA;AAKtC,QAAI,wBAAwB,qBAAqB;AAChD,WAAK,aAAa,IAAI,IAAI,aAAa,UAAU;AACjD,WAAK,QAAQ,IAAI,IAAI,aAAa,KAAK;AACvC,WAAK,YAAY,aAAa;AAC9B,WAAK,UAAU,aAAa;AAAA,IAAA,OACtB;AACD,WAAA,iCAAiB;AACjB,WAAA,4BAAY;AACjB,WAAK,YAAY;AACjB,WAAK,UAAU;AAAA,IAChB;AAAA,EACD;AAAA,EAEQ,cAAc;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,IAAW,OAAe;AACzB,WAAO,KAAK,WAAW;AAAA,EACxB;AAAA,EAEO,QAAc;AACpB,SAAK,WAAW;AAChB,SAAK,MAAM;EACZ;AAAA,EACO,OAAO,KAAiB;AAC9B,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACjB,aAAA;AAAA,IACR;AACK,SAAA,WAAW,OAAO,KAAK;AACvB,SAAA,MAAM,OAAO,GAAG;AACd,WAAA;AAAA,EACR;AAAA,EACO,QAAQ,UAAsD,SAAqB;AACzF,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,WAAW;AAC1C,eAAS,KAAK,SAAS,OAAO,KAAK,IAAI;AAAA,IACxC;AAAA,EACD;AAAA,EAEO,IAAI,KAAuB;AACjC,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACjB,aAAA;AAAA,IACR;AACO,WAAA,KAAK,WAAW,IAAI,KAAK;AAAA,EACjC;AAAA,EACO,IAAI,KAAiB;AACpB,WAAA,KAAK,MAAM,IAAI,GAAG;AAAA,EAC1B;AAAA,EACO,IAAI,KAAQ,OAAgB;AAClC,UAAM,gBAAgB,KAAK,MAAM,IAAI,GAAG;AAExC,QAAI,kBAAkB,QAAW;AAC1B,YAAA,WAAW,KAAK;AACjB,WAAA,MAAM,IAAI,KAAK,QAAQ;AACvB,WAAA,WAAW,IAAI,UAAU,KAAK;AAAA,IAAA,OAC7B;AACD,WAAA,WAAW,IAAI,eAAe,KAAK;AAAA,IACzC;AACO,WAAA;AAAA,EACR;AAAA;AAAA;AAAA,EAIO,UAAU,QAAW,QAAiB;AAC5C,UAAM,QAAQ,KAAK,MAAM,IAAI,MAAM;AACnC,QAAI,UAAU,QAAW;AACxB,YAAM,IAAI,MAAM;AAAA,IACjB;AACK,SAAA,MAAM,OAAO,MAAM;AACnB,SAAA,MAAM,IAAI,QAAQ,KAAK;AACrB,WAAA;AAAA,EACR;AAAA,EAEO,eAAe,UAAuB;AAC5C,eAAW,OAAO,UAAU;AAC3B,YAAM,WAAW,KAAK,MAAM,IAAI,GAAG;AACnC,UAAI,aAAa,QAAW;AAC3B,cAAM,IAAI,MAAM;AAAA,MACjB;AACA,YAAM,QAAQ,KAAK,WAAW,IAAI,QAAQ;AAKrC,WAAA,WAAW,OAAO,QAAQ;AAC1B,WAAA,WAAW,IAAI,UAAU,KAAK;AAAA,IACpC;AAAA,EACD;AAAA,EAEA,GAlGiB,KAAA,OAAO,aAkGf,OAAO,aAAsC;AACrD,WAAO,KAAK;EACb;AAAA,EAEA,CAAQ,UAAoC;AAChC,eAAA,SAAS,KAAK,UAAU;AAClC,YAAM,CAAC,KAAK,QAAQ,KAAK,GAAG,KAAK;AAAA,IAClC;AAAA,EACD;AAAA,EAEA,CAAQ,OAA4B;AACxB,eAAA,SAAS,KAAK,UAAU;AAC5B,YAAA,KAAK,QAAQ,KAAK;AAAA,IACzB;AAAA,EACD;AAAA,EAEA,CAAQ,SAA8B;AACrC,eAAW,SAAS,KAAK,WAAW,OAAA,GAAU;AAC7C,UAAI,UAAU,QAAW;AACxB;AAAA,MACD;AACM,YAAA;AAAA,IACP;AAAA,EACD;AACD;"}

package/dist/development/src/structures/LRUCache.cjs

@@ -0,0 +1,32 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, key + "", value);
+class LRUCache {
+  constructor(maxSize) {
+    this.maxSize = maxSize;
+    __publicField(this, "cache", /* @__PURE__ */ new Map());
+  }
+  get(key) {
+    const value = this.cache.get(key);
+    if (value !== void 0) {
+      this.cache.delete(key);
+      this.cache.set(key, value);
+    }
+    return value;
+  }
+  set(key, value) {
+    if (this.cache.has(key)) {
+      this.cache.delete(key);
+    } else if (this.cache.size === this.maxSize) {
+      this.cache.delete(this.getOldestKey());
+    }
+    this.cache.set(key, value);
+  }
+  getOldestKey() {
+    return this.cache.keys().next().value;
+  }
+}
+exports.LRUCache = LRUCache;
+//# sourceMappingURL=LRUCache.cjs.map

package/dist/development/src/structures/LRUCache.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"LRUCache.cjs","sources":["../../../../../packages/utilities/src/structures/LRUCache.ts"],"sourcesContent":["// This is heavily inspired by https://stackoverflow.com/a/46432113\nexport class LRUCache<Key, Value> {\n\tprivate readonly cache = new Map<Key, Value>()\n\n\tpublic constructor(private readonly maxSize: number) {}\n\n\tpublic get(key: Key): Value | undefined {\n\t\tconst value = this.cache.get(key)\n\n\t\tif (value !== undefined) {\n\t\t\tthis.cache.delete(key)\n\t\t\tthis.cache.set(key, value)\n\t\t}\n\t\treturn value\n\t}\n\n\tpublic set(key: Key, value: Value) {\n\t\tif (this.cache.has(key)) {\n\t\t\tthis.cache.delete(key) // Refresh this key\n\t\t} else if (this.cache.size === this.maxSize) {\n\t\t\tthis.cache.delete(this.getOldestKey()) // Evict the oldest value\n\t\t}\n\t\tthis.cache.set(key, value)\n\t}\n\n\tprivate getOldestKey(): Key {\n\t\treturn this.cache.keys().next().value\n\t}\n}\n"],"names":[],"mappings":";;;;;AACO,MAAM,SAAqB;AAAA,EAG1B,YAA6B,SAAiB;AAAjB,SAAA,UAAA;AAFnB,kBAAA,MAAA,6BAAY,IAAgB,CAAA;AAAA,EAES;AAAA,EAE/C,IAAI,KAA6B;AACvC,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACnB,WAAA,MAAM,OAAO,GAAG;AAChB,WAAA,MAAM,IAAI,KAAK,KAAK;AAAA,IAC1B;AACO,WAAA;AAAA,EACR;AAAA,EAEO,IAAI,KAAU,OAAc;AAClC,QAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACnB,WAAA,MAAM,OAAO,GAAG;AAAA,IACX,WAAA,KAAK,MAAM,SAAS,KAAK,SAAS;AAC5C,WAAK,MAAM,OAAO,KAAK,aAAc,CAAA;AAAA,IACtC;AACK,SAAA,MAAM,IAAI,KAAK,KAAK;AAAA,EAC1B;AAAA,EAEQ,eAAoB;AAC3B,WAAO,KAAK,MAAM,KAAK,EAAE,OAAO;AAAA,EACjC;AACD;;"}

package/dist/development/src/structures/LRUCache.js

@@ -0,0 +1,32 @@
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, key + "", value);
+class LRUCache {
+  constructor(maxSize) {
+    this.maxSize = maxSize;
+    __publicField(this, "cache", /* @__PURE__ */ new Map());
+  }
+  get(key) {
+    const value = this.cache.get(key);
+    if (value !== void 0) {
+      this.cache.delete(key);
+      this.cache.set(key, value);
+    }
+    return value;
+  }
+  set(key, value) {
+    if (this.cache.has(key)) {
+      this.cache.delete(key);
+    } else if (this.cache.size === this.maxSize) {
+      this.cache.delete(this.getOldestKey());
+    }
+    this.cache.set(key, value);
+  }
+  getOldestKey() {
+    return this.cache.keys().next().value;
+  }
+}
+export {
+  LRUCache
+};
+//# sourceMappingURL=LRUCache.js.map

package/dist/development/src/structures/LRUCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LRUCache.js","sources":["../../../../../packages/utilities/src/structures/LRUCache.ts"],"sourcesContent":["// This is heavily inspired by https://stackoverflow.com/a/46432113\nexport class LRUCache<Key, Value> {\n\tprivate readonly cache = new Map<Key, Value>()\n\n\tpublic constructor(private readonly maxSize: number) {}\n\n\tpublic get(key: Key): Value | undefined {\n\t\tconst value = this.cache.get(key)\n\n\t\tif (value !== undefined) {\n\t\t\tthis.cache.delete(key)\n\t\t\tthis.cache.set(key, value)\n\t\t}\n\t\treturn value\n\t}\n\n\tpublic set(key: Key, value: Value) {\n\t\tif (this.cache.has(key)) {\n\t\t\tthis.cache.delete(key) // Refresh this key\n\t\t} else if (this.cache.size === this.maxSize) {\n\t\t\tthis.cache.delete(this.getOldestKey()) // Evict the oldest value\n\t\t}\n\t\tthis.cache.set(key, value)\n\t}\n\n\tprivate getOldestKey(): Key {\n\t\treturn this.cache.keys().next().value\n\t}\n}\n"],"names":[],"mappings":";;;AACO,MAAM,SAAqB;AAAA,EAG1B,YAA6B,SAAiB;AAAjB,SAAA,UAAA;AAFnB,kBAAA,MAAA,6BAAY,IAAgB,CAAA;AAAA,EAES;AAAA,EAE/C,IAAI,KAA6B;AACvC,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACnB,WAAA,MAAM,OAAO,GAAG;AAChB,WAAA,MAAM,IAAI,KAAK,KAAK;AAAA,IAC1B;AACO,WAAA;AAAA,EACR;AAAA,EAEO,IAAI,KAAU,OAAc;AAClC,QAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACnB,WAAA,MAAM,OAAO,GAAG;AAAA,IACX,WAAA,KAAK,MAAM,SAAS,KAAK,SAAS;AAC5C,WAAK,MAAM,OAAO,KAAK,aAAc,CAAA;AAAA,IACtC;AACK,SAAA,MAAM,IAAI,KAAK,KAAK;AAAA,EAC1B;AAAA,EAEQ,eAAoB;AAC3B,WAAO,KAAK,MAAM,KAAK,EAAE,OAAO;AAAA,EACjC;AACD;"}

package/dist/development/src/structures/WeakIdCache.cjs

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+class WeakIdCache {
+  constructor() {
+    __publicField(this, "cache", /* @__PURE__ */ new WeakMap());
+    __publicField(this, "seed", 0);
+    __publicField(this, "rootId", this.seedToId(this.seed++));
+  }
+  getId(key) {
+    let existing = this.cache.get(key);
+    if (existing === void 0) {
+      this.cache.set(key, existing = this.seedToId(this.seed++));
+    }
+    return existing;
+  }
+  getOptionalKeyId(key) {
+    if (key === void 0) {
+      return this.rootId;
+    }
+    return this.getId(key);
+  }
+  seedToId(seed) {
+    return seed.toFixed(0);
+  }
+}
+exports.WeakIdCache = WeakIdCache;
+//# sourceMappingURL=WeakIdCache.cjs.map

package/dist/development/src/structures/WeakIdCache.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"WeakIdCache.cjs","sources":["../../../../../packages/utilities/src/structures/WeakIdCache.ts"],"sourcesContent":["export class WeakIdCache<K extends object> {\n\tprivate readonly cache = new WeakMap<K, string>()\n\tprivate seed = 0\n\tprivate readonly rootId = this.seedToId(this.seed++)\n\n\tpublic getId(key: K): string {\n\t\tlet existing = this.cache.get(key)\n\n\t\tif (existing === undefined) {\n\t\t\tthis.cache.set(key, (existing = this.seedToId(this.seed++)))\n\t\t}\n\t\treturn existing\n\t}\n\n\tpublic getOptionalKeyId(key: K | undefined): string {\n\t\tif (key === undefined) {\n\t\t\treturn this.rootId\n\t\t}\n\t\treturn this.getId(key)\n\t}\n\n\tprivate seedToId(seed: number): string {\n\t\treturn seed.toFixed(0)\n\t}\n}\n"],"names":[],"mappings":";;;;;AAAO,MAAM,YAA8B;AAAA,EAApC,cAAA;AACW,kBAAA,MAAA,6BAAY,QAAmB,CAAA;AAChD,kBAAA,MAAQ,QAAO,CAAA;AACf,kBAAA,MAAiB,UAAS,KAAK,SAAS,KAAK,MAAM,CAAA;AAAA,EAAA;AAAA,EAE5C,MAAM,KAAgB;AAC5B,QAAI,WAAW,KAAK,MAAM,IAAI,GAAG;AAEjC,QAAI,aAAa,QAAW;AACtB,WAAA,MAAM,IAAI,KAAM,WAAW,KAAK,SAAS,KAAK,MAAM,CAAE;AAAA,IAC5D;AACO,WAAA;AAAA,EACR;AAAA,EAEO,iBAAiB,KAA4B;AACnD,QAAI,QAAQ,QAAW;AACtB,aAAO,KAAK;AAAA,IACb;AACO,WAAA,KAAK,MAAM,GAAG;AAAA,EACtB;AAAA,EAEQ,SAAS,MAAsB;AAC/B,WAAA,KAAK,QAAQ,CAAC;AAAA,EACtB;AACD;;"}

package/dist/development/src/structures/WeakIdCache.js

@@ -0,0 +1,30 @@
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+class WeakIdCache {
+  constructor() {
+    __publicField(this, "cache", /* @__PURE__ */ new WeakMap());
+    __publicField(this, "seed", 0);
+    __publicField(this, "rootId", this.seedToId(this.seed++));
+  }
+  getId(key) {
+    let existing = this.cache.get(key);
+    if (existing === void 0) {
+      this.cache.set(key, existing = this.seedToId(this.seed++));
+    }
+    return existing;
+  }
+  getOptionalKeyId(key) {
+    if (key === void 0) {
+      return this.rootId;
+    }
+    return this.getId(key);
+  }
+  seedToId(seed) {
+    return seed.toFixed(0);
+  }
+}
+export {
+  WeakIdCache
+};
+//# sourceMappingURL=WeakIdCache.js.map

package/dist/development/src/structures/WeakIdCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WeakIdCache.js","sources":["../../../../../packages/utilities/src/structures/WeakIdCache.ts"],"sourcesContent":["export class WeakIdCache<K extends object> {\n\tprivate readonly cache = new WeakMap<K, string>()\n\tprivate seed = 0\n\tprivate readonly rootId = this.seedToId(this.seed++)\n\n\tpublic getId(key: K): string {\n\t\tlet existing = this.cache.get(key)\n\n\t\tif (existing === undefined) {\n\t\t\tthis.cache.set(key, (existing = this.seedToId(this.seed++)))\n\t\t}\n\t\treturn existing\n\t}\n\n\tpublic getOptionalKeyId(key: K | undefined): string {\n\t\tif (key === undefined) {\n\t\t\treturn this.rootId\n\t\t}\n\t\treturn this.getId(key)\n\t}\n\n\tprivate seedToId(seed: number): string {\n\t\treturn seed.toFixed(0)\n\t}\n}\n"],"names":[],"mappings":";;;AAAO,MAAM,YAA8B;AAAA,EAApC,cAAA;AACW,kBAAA,MAAA,6BAAY,QAAmB,CAAA;AAChD,kBAAA,MAAQ,QAAO,CAAA;AACf,kBAAA,MAAiB,UAAS,KAAK,SAAS,KAAK,MAAM,CAAA;AAAA,EAAA;AAAA,EAE5C,MAAM,KAAgB;AAC5B,QAAI,WAAW,KAAK,MAAM,IAAI,GAAG;AAEjC,QAAI,aAAa,QAAW;AACtB,WAAA,MAAM,IAAI,KAAM,WAAW,KAAK,SAAS,KAAK,MAAM,CAAE;AAAA,IAC5D;AACO,WAAA;AAAA,EACR;AAAA,EAEO,iBAAiB,KAA4B;AACnD,QAAI,QAAQ,QAAW;AACtB,aAAO,KAAK;AAAA,IACb;AACO,WAAA,KAAK,MAAM,GAAG;AAAA,EACtB;AAAA,EAEQ,SAAS,MAAsB;AAC/B,WAAA,KAAK,QAAQ,CAAC;AAAA,EACtB;AACD;"}

package/dist/production/index.cjs

@@ -18,6 +18,9 @@ const omit = require("./src/functional/omit.cjs");
 const pick = require("./src/functional/pick.cjs");
 const range = require("./src/functional/range.cjs");
 const kebabCase = require("./src/string-utilities/kebabCase.cjs");
+const BijectiveIndexedMap = require("./src/structures/BijectiveIndexedMap.cjs");
+const LRUCache = require("./src/structures/LRUCache.cjs");
+const WeakIdCache = require("./src/structures/WeakIdCache.cjs");
 exports.AssertionError = AssertionError.AssertionError;
 exports.isNonNegativeNumber = Predicates.isNonNegativeNumber;
 exports.assert = assert.assert;
@@ -37,4 +40,7 @@ exports.omit = omit.omit;
 exports.pick = pick.pick;
 exports.range = range.range;
 exports.toKebabCase = kebabCase.toKebabCase;
+exports.BijectiveIndexedMap = BijectiveIndexedMap.BijectiveIndexedMap;
+exports.LRUCache = LRUCache.LRUCache;
+exports.WeakIdCache = WeakIdCache.WeakIdCache;
 //# sourceMappingURL=index.cjs.map

package/dist/production/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/production/index.js

@@ -16,8 +16,14 @@ import { omit } from "./src/functional/omit.js";
 import { pick } from "./src/functional/pick.js";
 import { range } from "./src/functional/range.js";
 import { toKebabCase } from "./src/string-utilities/kebabCase.js";
+import { BijectiveIndexedMap } from "./src/structures/BijectiveIndexedMap.js";
+import { LRUCache } from "./src/structures/LRUCache.js";
+import { WeakIdCache } from "./src/structures/WeakIdCache.js";
 export {
   AssertionError,
+  BijectiveIndexedMap,
+  LRUCache,
+  WeakIdCache,
   assert,
   assertNever,
   dataAttribute,

package/dist/production/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;"}

package/dist/production/src/structures/BijectiveIndexedMap.cjs

@@ -0,0 +1,116 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+var _a;
+class BijectiveIndexedMap {
+  constructor(inverseOrMap) {
+    __publicField(this, "valueStore");
+    __publicField(this, "index");
+    __publicField(this, "indexSeed");
+    __publicField(this, "inverse");
+    __publicField(this, _a, "BijectiveIndexedMap");
+    if (inverseOrMap instanceof BijectiveIndexedMap) {
+      this.valueStore = new Map(inverseOrMap.valueStore);
+      this.index = new Map(inverseOrMap.index);
+      this.indexSeed = inverseOrMap.indexSeed;
+      this.inverse = inverseOrMap.inverse;
+    } else {
+      this.valueStore = /* @__PURE__ */ new Map();
+      this.index = /* @__PURE__ */ new Map();
+      this.indexSeed = 0;
+      this.inverse = inverseOrMap;
+    }
+  }
+  getNewIndex() {
+    return this.indexSeed++;
+  }
+  get size() {
+    return this.valueStore.size;
+  }
+  clear() {
+    this.valueStore.clear();
+    this.index.clear();
+  }
+  delete(key) {
+    const index = this.index.get(key);
+    if (index === void 0) {
+      return false;
+    }
+    this.valueStore.delete(index);
+    this.index.delete(key);
+    return true;
+  }
+  forEach(callback, thisArg) {
+    for (const [key, value] of this.entries()) {
+      callback.call(thisArg, value, key, this);
+    }
+  }
+  get(key) {
+    const index = this.index.get(key);
+    if (index === void 0) {
+      return void 0;
+    }
+    return this.valueStore.get(index);
+  }
+  has(key) {
+    return this.index.has(key);
+  }
+  set(key, value) {
+    const existingIndex = this.index.get(key);
+    if (existingIndex === void 0) {
+      const newIndex = this.getNewIndex();
+      this.index.set(key, newIndex);
+      this.valueStore.set(newIndex, value);
+    } else {
+      this.valueStore.set(existingIndex, value);
+    }
+    return this;
+  }
+  // This doesn't use the inverse in order to avoid confusion.
+  // See the description above.
+  changeKey(oldKey, newKey) {
+    const index = this.index.get(oldKey);
+    if (index === void 0) {
+      throw new Error();
+    }
+    this.index.delete(oldKey);
+    this.index.set(newKey, index);
+    return this;
+  }
+  changeKeyOrder(newOrder) {
+    for (const key of newOrder) {
+      const keyIndex = this.index.get(key);
+      if (keyIndex === void 0) {
+        throw new Error();
+      }
+      const value = this.valueStore.get(keyIndex);
+      this.valueStore.delete(keyIndex);
+      this.valueStore.set(keyIndex, value);
+    }
+  }
+  *[(_a = Symbol.toStringTag, Symbol.iterator)]() {
+    yield* this.entries();
+  }
+  *entries() {
+    for (const value of this.values()) {
+      yield [this.inverse(value), value];
+    }
+  }
+  *keys() {
+    for (const value of this.values()) {
+      yield this.inverse(value);
+    }
+  }
+  *values() {
+    for (const value of this.valueStore.values()) {
+      if (value === void 0) {
+        continue;
+      }
+      yield value;
+    }
+  }
+}
+exports.BijectiveIndexedMap = BijectiveIndexedMap;
+//# sourceMappingURL=BijectiveIndexedMap.cjs.map

package/dist/production/src/structures/BijectiveIndexedMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"BijectiveIndexedMap.cjs","sources":["../../../../../packages/utilities/src/structures/BijectiveIndexedMap.ts"],"sourcesContent":["// Bijective as in we need to supply the inverse and also guarantee that the values are unique.\n// Provided this invariant, this should behave more or less like a regular map except it has a somewhat special\n// iteration order. Unlike a regular map, which just honors insertion order, this also provides a special method\n// changeKey. With this, we can change the key under which a value (that is already on the map) is accessible.\n// With an ordinary map, that operation would require us to delete the original [K1, V] pair and insert\n// a new one [K2, V]. That would however change the order of iteration. This main purpose of this data structure is\n// the ability to avoid that and enable the value V to preserve its original place.\nexport class BijectiveIndexedMap<K, V> implements Map<K, V> {\n\tprivate readonly valueStore: Map<number, V>\n\tprivate readonly index: Map<K, number>\n\tprivate indexSeed: number\n\n\tprivate readonly inverse: (value: V) => K\n\n\tpublic readonly [Symbol.toStringTag] = 'BijectiveIndexedMap'\n\n\tpublic constructor(originalMap: BijectiveIndexedMap<K, V>)\n\tpublic constructor(inverse: (value: V) => K)\n\tpublic constructor(inverseOrMap: BijectiveIndexedMap<K, V> | ((value: V) => K)) {\n\t\tif (inverseOrMap instanceof BijectiveIndexedMap) {\n\t\t\tthis.valueStore = new Map(inverseOrMap.valueStore)\n\t\t\tthis.index = new Map(inverseOrMap.index)\n\t\t\tthis.indexSeed = inverseOrMap.indexSeed\n\t\t\tthis.inverse = inverseOrMap.inverse\n\t\t} else {\n\t\t\tthis.valueStore = new Map()\n\t\t\tthis.index = new Map()\n\t\t\tthis.indexSeed = 0\n\t\t\tthis.inverse = inverseOrMap\n\t\t}\n\t}\n\n\tprivate getNewIndex() {\n\t\treturn this.indexSeed++\n\t}\n\n\tpublic get size(): number {\n\t\treturn this.valueStore.size\n\t}\n\n\tpublic clear(): void {\n\t\tthis.valueStore.clear()\n\t\tthis.index.clear()\n\t}\n\tpublic delete(key: K): boolean {\n\t\tconst index = this.index.get(key)\n\n\t\tif (index === undefined) {\n\t\t\treturn false\n\t\t}\n\t\tthis.valueStore.delete(index)\n\t\tthis.index.delete(key)\n\t\treturn true\n\t}\n\tpublic forEach(callback: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tfor (const [key, value] of this.entries()) {\n\t\t\tcallback.call(thisArg, value, key, this)\n\t\t}\n\t}\n\n\tpublic get(key: K): V | undefined {\n\t\tconst index = this.index.get(key)\n\n\t\tif (index === undefined) {\n\t\t\treturn undefined\n\t\t}\n\t\treturn this.valueStore.get(index)\n\t}\n\tpublic has(key: K): boolean {\n\t\treturn this.index.has(key)\n\t}\n\tpublic set(key: K, value: V): this {\n\t\tconst existingIndex = this.index.get(key)\n\n\t\tif (existingIndex === undefined) {\n\t\t\tconst newIndex = this.getNewIndex()\n\t\t\tthis.index.set(key, newIndex)\n\t\t\tthis.valueStore.set(newIndex, value)\n\t\t} else {\n\t\t\tthis.valueStore.set(existingIndex, value)\n\t\t}\n\t\treturn this\n\t}\n\n\t// This doesn't use the inverse in order to avoid confusion.\n\t// See the description above.\n\tpublic changeKey(oldKey: K, newKey: K): this {\n\t\tconst index = this.index.get(oldKey)\n\t\tif (index === undefined) {\n\t\t\tthrow new Error()\n\t\t}\n\t\tthis.index.delete(oldKey)\n\t\tthis.index.set(newKey, index)\n\t\treturn this\n\t}\n\n\tpublic changeKeyOrder(newOrder: Iterable<K>) {\n\t\tfor (const key of newOrder) {\n\t\t\tconst keyIndex = this.index.get(key)\n\t\t\tif (keyIndex === undefined) {\n\t\t\t\tthrow new Error()\n\t\t\t}\n\t\t\tconst value = this.valueStore.get(keyIndex)!\n\n\t\t\t// This effectively removes value from wherever it was and puts it at the end.\n\t\t\t// Provided newOrder.size is the same as valueStore, by the end of this loop\n\t\t\t// the values will be in the correct order.\n\t\t\tthis.valueStore.delete(keyIndex)\n\t\t\tthis.valueStore.set(keyIndex, value)\n\t\t}\n\t}\n\n\tpublic *[Symbol.iterator](): IterableIterator<[K, V]> {\n\t\tyield* this.entries()\n\t}\n\n\tpublic *entries(): IterableIterator<[K, V]> {\n\t\tfor (const value of this.values()) {\n\t\t\tyield [this.inverse(value), value]\n\t\t}\n\t}\n\n\tpublic *keys(): IterableIterator<K> {\n\t\tfor (const value of this.values()) {\n\t\t\tyield this.inverse(value)\n\t\t}\n\t}\n\n\tpublic *values(): IterableIterator<V> {\n\t\tfor (const value of this.valueStore.values()) {\n\t\t\tif (value === undefined) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tyield value\n\t\t}\n\t}\n}\n"],"names":[],"mappings":";;;;;AAAA,IAAA;AAOO,MAAM,oBAA+C;AAAA,EAWpD,YAAY,cAA6D;AAV/D,kBAAA,MAAA,YAAA;AACA,kBAAA,MAAA,OAAA;AACT,kBAAA,MAAA,WAAA;AAES,kBAAA,MAAA,SAAA;AAEjB,kBAAA,MAAiB,IAAsB,qBAAA;AAKtC,QAAI,wBAAwB,qBAAqB;AAChD,WAAK,aAAa,IAAI,IAAI,aAAa,UAAU;AACjD,WAAK,QAAQ,IAAI,IAAI,aAAa,KAAK;AACvC,WAAK,YAAY,aAAa;AAC9B,WAAK,UAAU,aAAa;AAAA,IAAA,OACtB;AACD,WAAA,iCAAiB;AACjB,WAAA,4BAAY;AACjB,WAAK,YAAY;AACjB,WAAK,UAAU;AAAA,IAChB;AAAA,EACD;AAAA,EAEQ,cAAc;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,IAAW,OAAe;AACzB,WAAO,KAAK,WAAW;AAAA,EACxB;AAAA,EAEO,QAAc;AACpB,SAAK,WAAW;AAChB,SAAK,MAAM;EACZ;AAAA,EACO,OAAO,KAAiB;AAC9B,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACjB,aAAA;AAAA,IACR;AACK,SAAA,WAAW,OAAO,KAAK;AACvB,SAAA,MAAM,OAAO,GAAG;AACd,WAAA;AAAA,EACR;AAAA,EACO,QAAQ,UAAsD,SAAqB;AACzF,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,WAAW;AAC1C,eAAS,KAAK,SAAS,OAAO,KAAK,IAAI;AAAA,IACxC;AAAA,EACD;AAAA,EAEO,IAAI,KAAuB;AACjC,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACjB,aAAA;AAAA,IACR;AACO,WAAA,KAAK,WAAW,IAAI,KAAK;AAAA,EACjC;AAAA,EACO,IAAI,KAAiB;AACpB,WAAA,KAAK,MAAM,IAAI,GAAG;AAAA,EAC1B;AAAA,EACO,IAAI,KAAQ,OAAgB;AAClC,UAAM,gBAAgB,KAAK,MAAM,IAAI,GAAG;AAExC,QAAI,kBAAkB,QAAW;AAC1B,YAAA,WAAW,KAAK;AACjB,WAAA,MAAM,IAAI,KAAK,QAAQ;AACvB,WAAA,WAAW,IAAI,UAAU,KAAK;AAAA,IAAA,OAC7B;AACD,WAAA,WAAW,IAAI,eAAe,KAAK;AAAA,IACzC;AACO,WAAA;AAAA,EACR;AAAA;AAAA;AAAA,EAIO,UAAU,QAAW,QAAiB;AAC5C,UAAM,QAAQ,KAAK,MAAM,IAAI,MAAM;AACnC,QAAI,UAAU,QAAW;AACxB,YAAM,IAAI,MAAM;AAAA,IACjB;AACK,SAAA,MAAM,OAAO,MAAM;AACnB,SAAA,MAAM,IAAI,QAAQ,KAAK;AACrB,WAAA;AAAA,EACR;AAAA,EAEO,eAAe,UAAuB;AAC5C,eAAW,OAAO,UAAU;AAC3B,YAAM,WAAW,KAAK,MAAM,IAAI,GAAG;AACnC,UAAI,aAAa,QAAW;AAC3B,cAAM,IAAI,MAAM;AAAA,MACjB;AACA,YAAM,QAAQ,KAAK,WAAW,IAAI,QAAQ;AAKrC,WAAA,WAAW,OAAO,QAAQ;AAC1B,WAAA,WAAW,IAAI,UAAU,KAAK;AAAA,IACpC;AAAA,EACD;AAAA,EAEA,GAlGiB,KAAA,OAAO,aAkGf,OAAO,aAAsC;AACrD,WAAO,KAAK;EACb;AAAA,EAEA,CAAQ,UAAoC;AAChC,eAAA,SAAS,KAAK,UAAU;AAClC,YAAM,CAAC,KAAK,QAAQ,KAAK,GAAG,KAAK;AAAA,IAClC;AAAA,EACD;AAAA,EAEA,CAAQ,OAA4B;AACxB,eAAA,SAAS,KAAK,UAAU;AAC5B,YAAA,KAAK,QAAQ,KAAK;AAAA,IACzB;AAAA,EACD;AAAA,EAEA,CAAQ,SAA8B;AACrC,eAAW,SAAS,KAAK,WAAW,OAAA,GAAU;AAC7C,UAAI,UAAU,QAAW;AACxB;AAAA,MACD;AACM,YAAA;AAAA,IACP;AAAA,EACD;AACD;;"}