@contember/utilities 2.1.0-alpha.36 → 2.1.0-alpha.39

package/dist/development/index.cjs

@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const BijectiveIndexedMap = require("./src/structures/BijectiveIndexedMap.cjs");
+const LRUCache = require("./src/structures/LRUCache.cjs");
+const WeakIdCache = require("./src/structures/WeakIdCache.cjs");
+const assertNever = require("./src/assert-types/assertNever.cjs");
+const dataAttribute = require("./src/dom/dataAttribute.cjs");
+const deprecate = require("./src/deprecate/deprecate.cjs");
+const svgSizeProps = require("./src/dom/svgSizeProps.cjs");
+exports.BijectiveIndexedMap = BijectiveIndexedMap.BijectiveIndexedMap;
+exports.LRUCache = LRUCache.LRUCache;
+exports.WeakIdCache = WeakIdCache.WeakIdCache;
+exports.assertNever = assertNever.assertNever;
+exports.dataAttribute = dataAttribute.dataAttribute;
+exports.deprecate = deprecate.deprecate;
+exports.svgSizeProps = svgSizeProps.svgSizeProps;
+//# sourceMappingURL=index.cjs.map

package/dist/development/index.cjs.map

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

package/dist/development/index.js

@@ -0,0 +1,17 @@
+import { BijectiveIndexedMap } from "./src/structures/BijectiveIndexedMap.js";
+import { LRUCache } from "./src/structures/LRUCache.js";
+import { WeakIdCache } from "./src/structures/WeakIdCache.js";
+import { assertNever } from "./src/assert-types/assertNever.js";
+import { dataAttribute } from "./src/dom/dataAttribute.js";
+import { deprecate } from "./src/deprecate/deprecate.js";
+import { svgSizeProps } from "./src/dom/svgSizeProps.js";
+export {
+  BijectiveIndexedMap,
+  LRUCache,
+  WeakIdCache,
+  assertNever,
+  dataAttribute,
+  deprecate,
+  svgSizeProps
+};
+//# sourceMappingURL=index.js.map

package/dist/development/index.js.map

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

package/dist/development/src/assert-types/assertNever.cjs

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function assertNever(_) {
+  throw new Error("Exhaustive Error: This line should never be reached.");
+}
+exports.assertNever = assertNever;
+//# sourceMappingURL=assertNever.cjs.map

package/dist/development/src/assert-types/assertNever.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"assertNever.cjs","sources":["../../../../../packages/utilities/src/assert-types/assertNever.ts"],"sourcesContent":["export function assertNever(_: never): never {\n\tthrow new Error('Exhaustive Error: This line should never be reached.')\n}\n"],"names":[],"mappings":";;AAAO,SAAS,YAAY,GAAiB;AAC5C,QAAM,IAAI,MAAM,sDAAsD;AACvE;;"}

package/dist/development/src/assert-types/assertNever.js

@@ -0,0 +1,7 @@
+function assertNever(_) {
+  throw new Error("Exhaustive Error: This line should never be reached.");
+}
+export {
+  assertNever
+};
+//# sourceMappingURL=assertNever.js.map

package/dist/development/src/assert-types/assertNever.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assertNever.js","sources":["../../../../../packages/utilities/src/assert-types/assertNever.ts"],"sourcesContent":["export function assertNever(_: never): never {\n\tthrow new Error('Exhaustive Error: This line should never be reached.')\n}\n"],"names":[],"mappings":"AAAO,SAAS,YAAY,GAAiB;AAC5C,QAAM,IAAI,MAAM,sDAAsD;AACvE;"}

package/dist/development/src/deprecate/deprecate.cjs

@@ -0,0 +1,20 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function deprecate(removal, condition, deprecated, replacement) {
+  if (condition === true) {
+    {
+      const shouldThrow = Boolean(void 0);
+      if (shouldThrow) {
+        throw new Error(
+          `Support for ${deprecated} was planned to be removed in the ${removal} release.${replacement ? ` Replace it with ${replacement} instead.` : "Remove it."}`
+        );
+      } else {
+        console.warn(
+          `Use of ${deprecated} is deprecated and might be removed in the next release.${replacement ? ` Use ${replacement} instead.` : " There is no replacement."}`
+        );
+      }
+    }
+  }
+}
+exports.deprecate = deprecate;
+//# sourceMappingURL=deprecate.cjs.map

package/dist/development/src/deprecate/deprecate.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"deprecate.cjs","sources":["../../../../../packages/utilities/src/deprecate/deprecate.ts"],"sourcesContent":["import { SemverString } from './types'\n\n/**\n * Logs a deprecation warning if the assertion is `false`.\n * @internal\n *\n * @param removal - Version when the deprecated feature will be removed\n * @param condition - Condition under which the deprecation warning will be logged\n * @param deprecated - Name of the deprecated feature\n * @param replacement - Name of the feature that replaces the deprecated feature\n *\n * @example\n * ```ts\n * const { visible } = props\n * deprecate(visible !== 'default', '1.3.0', '\"default\"', '\"hidden\"')\n * // Logs: Use of \"default\" is deprecated and might be removed in the next release. Use \"hidden\" instead.\n * ```\n */\nexport function deprecate(removal: SemverString, condition: boolean, deprecated: string, replacement: string | null): void {\n\tif (condition === true) {\n\t\tif (import.meta.env.DEV) {\n\t\t\tconst shouldThrow = Boolean(import.meta.env.VITE_CONTEMBER_ADMIN_STRICT_DEPRECATIONS)\n\n\t\t\tif (shouldThrow) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Support for ${deprecated} was planned to be removed in the ${removal} release.${\n\t\t\t\t\t\treplacement ? ` Replace it with ${replacement} instead.` : 'Remove it.'\n\t\t\t\t\t}`,\n\t\t\t\t)\n\t\t\t} else {\n\t\t\t\tconsole.warn(\n\t\t\t\t\t`Use of ${deprecated} is deprecated and might be removed in the next release.${\n\t\t\t\t\t\treplacement ? ` Use ${replacement} instead.` : ' There is no replacement.'\n\t\t\t\t\t}`,\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n}\n"],"names":[],"mappings":";;AAkBO,SAAS,UAAU,SAAuB,WAAoB,YAAoB,aAAkC;AAC1H,MAAI,cAAc,MAAM;AACE;AACxB,YAAM,cAAc,QAAQ,MAAA;AAE5B,UAAI,aAAa;AAChB,cAAM,IAAI;AAAA,UACT,eAAe,UAAU,qCAAqC,OAAO,YACpE,cAAc,oBAAoB,WAAW,cAAc,YAC5D;AAAA,QAAA;AAAA,MAEF,OAAO;AACN,gBAAQ;AAAA,UACP,UAAU,UAAU,2DACnB,cAAc,QAAQ,WAAW,cAAc,2BAChD;AAAA,QAAA;AAAA,MAEF;AAAA,IACD;AAAA,EACD;AACD;;"}

package/dist/development/src/deprecate/deprecate.js

@@ -0,0 +1,20 @@
+function deprecate(removal, condition, deprecated, replacement) {
+  if (condition === true) {
+    {
+      const shouldThrow = Boolean(void 0);
+      if (shouldThrow) {
+        throw new Error(
+          `Support for ${deprecated} was planned to be removed in the ${removal} release.${replacement ? ` Replace it with ${replacement} instead.` : "Remove it."}`
+        );
+      } else {
+        console.warn(
+          `Use of ${deprecated} is deprecated and might be removed in the next release.${replacement ? ` Use ${replacement} instead.` : " There is no replacement."}`
+        );
+      }
+    }
+  }
+}
+export {
+  deprecate
+};
+//# sourceMappingURL=deprecate.js.map

package/dist/development/src/deprecate/deprecate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deprecate.js","sources":["../../../../../packages/utilities/src/deprecate/deprecate.ts"],"sourcesContent":["import { SemverString } from './types'\n\n/**\n * Logs a deprecation warning if the assertion is `false`.\n * @internal\n *\n * @param removal - Version when the deprecated feature will be removed\n * @param condition - Condition under which the deprecation warning will be logged\n * @param deprecated - Name of the deprecated feature\n * @param replacement - Name of the feature that replaces the deprecated feature\n *\n * @example\n * ```ts\n * const { visible } = props\n * deprecate(visible !== 'default', '1.3.0', '\"default\"', '\"hidden\"')\n * // Logs: Use of \"default\" is deprecated and might be removed in the next release. Use \"hidden\" instead.\n * ```\n */\nexport function deprecate(removal: SemverString, condition: boolean, deprecated: string, replacement: string | null): void {\n\tif (condition === true) {\n\t\tif (import.meta.env.DEV) {\n\t\t\tconst shouldThrow = Boolean(import.meta.env.VITE_CONTEMBER_ADMIN_STRICT_DEPRECATIONS)\n\n\t\t\tif (shouldThrow) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Support for ${deprecated} was planned to be removed in the ${removal} release.${\n\t\t\t\t\t\treplacement ? ` Replace it with ${replacement} instead.` : 'Remove it.'\n\t\t\t\t\t}`,\n\t\t\t\t)\n\t\t\t} else {\n\t\t\t\tconsole.warn(\n\t\t\t\t\t`Use of ${deprecated} is deprecated and might be removed in the next release.${\n\t\t\t\t\t\treplacement ? ` Use ${replacement} instead.` : ' There is no replacement.'\n\t\t\t\t\t}`,\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n}\n"],"names":[],"mappings":"AAkBO,SAAS,UAAU,SAAuB,WAAoB,YAAoB,aAAkC;AAC1H,MAAI,cAAc,MAAM;AACE;AACxB,YAAM,cAAc,QAAQ,MAAA;AAE5B,UAAI,aAAa;AAChB,cAAM,IAAI;AAAA,UACT,eAAe,UAAU,qCAAqC,OAAO,YACpE,cAAc,oBAAoB,WAAW,cAAc,YAC5D;AAAA,QAAA;AAAA,MAEF,OAAO;AACN,gBAAQ;AAAA,UACP,UAAU,UAAU,2DACnB,cAAc,QAAQ,WAAW,cAAc,2BAChD;AAAA,QAAA;AAAA,MAEF;AAAA,IACD;AAAA,EACD;AACD;"}

package/dist/development/src/dom/dataAttribute.cjs

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function dataAttribute(value) {
+  if (value === false || value === void 0 || value === null) {
+    return void 0;
+  } else if (value === true) {
+    return "";
+  } else {
+    return String(value);
+  }
+}
+exports.dataAttribute = dataAttribute;
+//# sourceMappingURL=dataAttribute.cjs.map

package/dist/development/src/dom/dataAttribute.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataAttribute.cjs","sources":["../../../../../packages/utilities/src/dom/dataAttribute.ts"],"sourcesContent":["export function dataAttribute(value: boolean | null | undefined): '' | undefined\nexport function dataAttribute<const T extends string>(value: T): T\nexport function dataAttribute(value: boolean | string | number | undefined | null): string | undefined\nexport function dataAttribute(value: unknown): string | true | undefined {\n\tif (value === false || value === undefined || value === null) {\n\t\treturn undefined\n\t} else if (value === true) {\n\t\t// Closest to HTML: https://html.spec.whatwg.org/multipage/common-microsyntaxes.html#boolean-attributes\n\t\t// React issue: https://github.com/facebook/react/issues/24812\n\t\treturn ''\n\t} else {\n\t\treturn String(value)\n\t}\n}\n"],"names":[],"mappings":";;AAGO,SAAS,cAAc,OAA2C;AACxE,MAAI,UAAU,SAAS,UAAU,UAAa,UAAU,MAAM;AAC7D,WAAO;AAAA,EACR,WAAW,UAAU,MAAM;AAG1B,WAAO;AAAA,EACR,OAAO;AACN,WAAO,OAAO,KAAK;AAAA,EACpB;AACD;;"}

package/dist/development/src/dom/dataAttribute.js

@@ -0,0 +1,13 @@
+function dataAttribute(value) {
+  if (value === false || value === void 0 || value === null) {
+    return void 0;
+  } else if (value === true) {
+    return "";
+  } else {
+    return String(value);
+  }
+}
+export {
+  dataAttribute
+};
+//# sourceMappingURL=dataAttribute.js.map

package/dist/development/src/dom/dataAttribute.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataAttribute.js","sources":["../../../../../packages/utilities/src/dom/dataAttribute.ts"],"sourcesContent":["export function dataAttribute(value: boolean | null | undefined): '' | undefined\nexport function dataAttribute<const T extends string>(value: T): T\nexport function dataAttribute(value: boolean | string | number | undefined | null): string | undefined\nexport function dataAttribute(value: unknown): string | true | undefined {\n\tif (value === false || value === undefined || value === null) {\n\t\treturn undefined\n\t} else if (value === true) {\n\t\t// Closest to HTML: https://html.spec.whatwg.org/multipage/common-microsyntaxes.html#boolean-attributes\n\t\t// React issue: https://github.com/facebook/react/issues/24812\n\t\treturn ''\n\t} else {\n\t\treturn String(value)\n\t}\n}\n"],"names":[],"mappings":"AAGO,SAAS,cAAc,OAA2C;AACxE,MAAI,UAAU,SAAS,UAAU,UAAa,UAAU,MAAM;AAC7D,WAAO;AAAA,EACR,WAAW,UAAU,MAAM;AAG1B,WAAO;AAAA,EACR,OAAO;AACN,WAAO,OAAO,KAAK;AAAA,EACpB;AACD;"}

package/dist/development/src/dom/svgSizeProps.cjs

@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function svgSizeProps(width, height, crop = 0) {
+  const viewBoxWidth = width - crop * 2;
+  const viewBoxHeight = (height ?? width) - crop * 2;
+  const viewBoxX = crop;
+  const viewBoxY = crop;
+  return {
+    width: viewBoxWidth,
+    height: viewBoxHeight,
+    viewBox: `${viewBoxX} ${viewBoxY} ${viewBoxWidth} ${viewBoxHeight}`
+  };
+}
+exports.svgSizeProps = svgSizeProps;
+//# sourceMappingURL=svgSizeProps.cjs.map

package/dist/development/src/dom/svgSizeProps.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"svgSizeProps.cjs","sources":["../../../../../packages/utilities/src/dom/svgSizeProps.ts"],"sourcesContent":["export interface SvgSizeProps {\n\twidth: number\n\theight: number\n\tviewBox: string\n}\n\nexport function svgSizeProps(\n\twidth: number,\n\theight?: number,\n\tcrop: number = 0,\n): SvgSizeProps {\n\tconst viewBoxWidth = width - crop * 2\n\tconst viewBoxHeight = (height ?? width) - crop * 2\n\tconst viewBoxX = crop\n\tconst viewBoxY = crop\n\treturn {\n\t\twidth: viewBoxWidth,\n\t\theight: viewBoxHeight,\n\t\tviewBox: `${viewBoxX} ${viewBoxY} ${viewBoxWidth} ${viewBoxHeight}`,\n\t}\n}\n"],"names":[],"mappings":";;AAMO,SAAS,aACf,OACA,QACA,OAAe,GACA;AACf,QAAM,eAAe,QAAQ,OAAO;AACpC,QAAM,iBAAiB,UAAU,SAAS,OAAO;AACjD,QAAM,WAAW;AACjB,QAAM,WAAW;AACjB,SAAO;AAAA,IACN,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,SAAS,GAAG,QAAQ,IAAI,QAAQ,IAAI,YAAY,IAAI,aAAa;AAAA,EAAA;AAEnE;;"}

package/dist/development/src/dom/svgSizeProps.js

@@ -0,0 +1,15 @@
+function svgSizeProps(width, height, crop = 0) {
+  const viewBoxWidth = width - crop * 2;
+  const viewBoxHeight = (height ?? width) - crop * 2;
+  const viewBoxX = crop;
+  const viewBoxY = crop;
+  return {
+    width: viewBoxWidth,
+    height: viewBoxHeight,
+    viewBox: `${viewBoxX} ${viewBoxY} ${viewBoxWidth} ${viewBoxHeight}`
+  };
+}
+export {
+  svgSizeProps
+};
+//# sourceMappingURL=svgSizeProps.js.map

package/dist/development/src/dom/svgSizeProps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"svgSizeProps.js","sources":["../../../../../packages/utilities/src/dom/svgSizeProps.ts"],"sourcesContent":["export interface SvgSizeProps {\n\twidth: number\n\theight: number\n\tviewBox: string\n}\n\nexport function svgSizeProps(\n\twidth: number,\n\theight?: number,\n\tcrop: number = 0,\n): SvgSizeProps {\n\tconst viewBoxWidth = width - crop * 2\n\tconst viewBoxHeight = (height ?? width) - crop * 2\n\tconst viewBoxX = crop\n\tconst viewBoxY = crop\n\treturn {\n\t\twidth: viewBoxWidth,\n\t\theight: viewBoxHeight,\n\t\tviewBox: `${viewBoxX} ${viewBoxY} ${viewBoxWidth} ${viewBoxHeight}`,\n\t}\n}\n"],"names":[],"mappings":"AAMO,SAAS,aACf,OACA,QACA,OAAe,GACA;AACf,QAAM,eAAe,QAAQ,OAAO;AACpC,QAAM,iBAAiB,UAAU,SAAS,OAAO;AACjD,QAAM,WAAW;AACjB,QAAM,WAAW;AACjB,SAAO;AAAA,IACN,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,SAAS,GAAG,QAAQ,IAAI,QAAQ,IAAI,YAAY,IAAI,aAAa;AAAA,EAAA;AAEnE;"}

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

@@ -0,0 +1,133 @@
+"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);
+  }
+  getOrInsert(key, defaultValue) {
+    const existing = this.get(key);
+    if (existing !== void 0) {
+      return existing;
+    }
+    this.set(key, defaultValue);
+    return defaultValue;
+  }
+  getOrInsertComputed(key, callback) {
+    const existing = this.get(key);
+    if (existing !== void 0) {
+      return existing;
+    }
+    const value = callback(key);
+    this.set(key, value);
+    return value;
+  }
+  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 getOrInsert(key: K, defaultValue: V): V {\n\t\tconst existing = this.get(key)\n\t\tif (existing !== undefined) {\n\t\t\treturn existing\n\t\t}\n\t\tthis.set(key, defaultValue)\n\t\treturn defaultValue\n\t}\n\n\tpublic getOrInsertComputed(key: K, callback: (key: K) => V): V {\n\t\tconst existing = this.get(key)\n\t\tif (existing !== undefined) {\n\t\t\treturn existing\n\t\t}\n\t\tconst value = callback(key)\n\t\tthis.set(key, value)\n\t\treturn value\n\t}\n\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](): MapIterator<[K, V]> {\n\t\tyield* this.entries()\n\t}\n\n\tpublic *entries(): MapIterator<[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(): MapIterator<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(): MapIterator<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;AAVhF,kBAAA,MAAiB,YAAA;AACjB,kBAAA,MAAiB,OAAA;AACjB,kBAAA,MAAQ,WAAA;AAER,kBAAA,MAAiB,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,IAC7B,OAAO;AACN,WAAK,iCAAiB,IAAA;AACtB,WAAK,4BAAY,IAAA;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,MAAA;AAChB,SAAK,MAAM,MAAA;AAAA,EACZ;AAAA,EACO,OAAO,KAAiB;AAC9B,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACxB,aAAO;AAAA,IACR;AACA,SAAK,WAAW,OAAO,KAAK;AAC5B,SAAK,MAAM,OAAO,GAAG;AACrB,WAAO;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;AACxB,aAAO;AAAA,IACR;AACA,WAAO,KAAK,WAAW,IAAI,KAAK;AAAA,EACjC;AAAA,EACO,IAAI,KAAiB;AAC3B,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC1B;AAAA,EACO,YAAY,KAAQ,cAAoB;AAC9C,UAAM,WAAW,KAAK,IAAI,GAAG;AAC7B,QAAI,aAAa,QAAW;AAC3B,aAAO;AAAA,IACR;AACA,SAAK,IAAI,KAAK,YAAY;AAC1B,WAAO;AAAA,EACR;AAAA,EAEO,oBAAoB,KAAQ,UAA4B;AAC9D,UAAM,WAAW,KAAK,IAAI,GAAG;AAC7B,QAAI,aAAa,QAAW;AAC3B,aAAO;AAAA,IACR;AACA,UAAM,QAAQ,SAAS,GAAG;AAC1B,SAAK,IAAI,KAAK,KAAK;AACnB,WAAO;AAAA,EACR;AAAA,EAEO,IAAI,KAAQ,OAAgB;AAClC,UAAM,gBAAgB,KAAK,MAAM,IAAI,GAAG;AAExC,QAAI,kBAAkB,QAAW;AAChC,YAAM,WAAW,KAAK,YAAA;AACtB,WAAK,MAAM,IAAI,KAAK,QAAQ;AAC5B,WAAK,WAAW,IAAI,UAAU,KAAK;AAAA,IACpC,OAAO;AACN,WAAK,WAAW,IAAI,eAAe,KAAK;AAAA,IACzC;AACA,WAAO;AAAA,EACR;AAAA;AAAA;AAAA,EAIO,UAAU,QAAW,QAAiB;AAC5C,UAAM,QAAQ,KAAK,MAAM,IAAI,MAAM;AACnC,QAAI,UAAU,QAAW;AACxB,YAAM,IAAI,MAAA;AAAA,IACX;AACA,SAAK,MAAM,OAAO,MAAM;AACxB,SAAK,MAAM,IAAI,QAAQ,KAAK;AAC5B,WAAO;AAAA,EACR;AAAA,EAEO,eAAe,UAAuB;AAC5C,eAAW,OAAO,UAAU;AAC3B,YAAM,WAAW,KAAK,MAAM,IAAI,GAAG;AACnC,UAAI,aAAa,QAAW;AAC3B,cAAM,IAAI,MAAA;AAAA,MACX;AACA,YAAM,QAAQ,KAAK,WAAW,IAAI,QAAQ;AAK1C,WAAK,WAAW,OAAO,QAAQ;AAC/B,WAAK,WAAW,IAAI,UAAU,KAAK;AAAA,IACpC;AAAA,EACD;AAAA,EAEA,GArHiB,KAAA,OAAO,aAqHf,OAAO,aAAiC;AAChD,WAAO,KAAK,QAAA;AAAA,EACb;AAAA,EAEA,CAAQ,UAA+B;AACtC,eAAW,SAAS,KAAK,UAAU;AAClC,YAAM,CAAC,KAAK,QAAQ,KAAK,GAAG,KAAK;AAAA,IAClC;AAAA,EACD;AAAA,EAEA,CAAQ,OAAuB;AAC9B,eAAW,SAAS,KAAK,UAAU;AAClC,YAAM,KAAK,QAAQ,KAAK;AAAA,IACzB;AAAA,EACD;AAAA,EAEA,CAAQ,SAAyB;AAChC,eAAW,SAAS,KAAK,WAAW,OAAA,GAAU;AAC7C,UAAI,UAAU,QAAW;AACxB;AAAA,MACD;AACA,YAAM;AAAA,IACP;AAAA,EACD;AACD;;"}

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

@@ -0,0 +1,133 @@
+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);
+  }
+  getOrInsert(key, defaultValue) {
+    const existing = this.get(key);
+    if (existing !== void 0) {
+      return existing;
+    }
+    this.set(key, defaultValue);
+    return defaultValue;
+  }
+  getOrInsertComputed(key, callback) {
+    const existing = this.get(key);
+    if (existing !== void 0) {
+      return existing;
+    }
+    const value = callback(key);
+    this.set(key, value);
+    return value;
+  }
+  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 getOrInsert(key: K, defaultValue: V): V {\n\t\tconst existing = this.get(key)\n\t\tif (existing !== undefined) {\n\t\t\treturn existing\n\t\t}\n\t\tthis.set(key, defaultValue)\n\t\treturn defaultValue\n\t}\n\n\tpublic getOrInsertComputed(key: K, callback: (key: K) => V): V {\n\t\tconst existing = this.get(key)\n\t\tif (existing !== undefined) {\n\t\t\treturn existing\n\t\t}\n\t\tconst value = callback(key)\n\t\tthis.set(key, value)\n\t\treturn value\n\t}\n\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](): MapIterator<[K, V]> {\n\t\tyield* this.entries()\n\t}\n\n\tpublic *entries(): MapIterator<[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(): MapIterator<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(): MapIterator<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;AAVhF,kBAAA,MAAiB,YAAA;AACjB,kBAAA,MAAiB,OAAA;AACjB,kBAAA,MAAQ,WAAA;AAER,kBAAA,MAAiB,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,IAC7B,OAAO;AACN,WAAK,iCAAiB,IAAA;AACtB,WAAK,4BAAY,IAAA;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,MAAA;AAChB,SAAK,MAAM,MAAA;AAAA,EACZ;AAAA,EACO,OAAO,KAAiB;AAC9B,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACxB,aAAO;AAAA,IACR;AACA,SAAK,WAAW,OAAO,KAAK;AAC5B,SAAK,MAAM,OAAO,GAAG;AACrB,WAAO;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;AACxB,aAAO;AAAA,IACR;AACA,WAAO,KAAK,WAAW,IAAI,KAAK;AAAA,EACjC;AAAA,EACO,IAAI,KAAiB;AAC3B,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC1B;AAAA,EACO,YAAY,KAAQ,cAAoB;AAC9C,UAAM,WAAW,KAAK,IAAI,GAAG;AAC7B,QAAI,aAAa,QAAW;AAC3B,aAAO;AAAA,IACR;AACA,SAAK,IAAI,KAAK,YAAY;AAC1B,WAAO;AAAA,EACR;AAAA,EAEO,oBAAoB,KAAQ,UAA4B;AAC9D,UAAM,WAAW,KAAK,IAAI,GAAG;AAC7B,QAAI,aAAa,QAAW;AAC3B,aAAO;AAAA,IACR;AACA,UAAM,QAAQ,SAAS,GAAG;AAC1B,SAAK,IAAI,KAAK,KAAK;AACnB,WAAO;AAAA,EACR;AAAA,EAEO,IAAI,KAAQ,OAAgB;AAClC,UAAM,gBAAgB,KAAK,MAAM,IAAI,GAAG;AAExC,QAAI,kBAAkB,QAAW;AAChC,YAAM,WAAW,KAAK,YAAA;AACtB,WAAK,MAAM,IAAI,KAAK,QAAQ;AAC5B,WAAK,WAAW,IAAI,UAAU,KAAK;AAAA,IACpC,OAAO;AACN,WAAK,WAAW,IAAI,eAAe,KAAK;AAAA,IACzC;AACA,WAAO;AAAA,EACR;AAAA;AAAA;AAAA,EAIO,UAAU,QAAW,QAAiB;AAC5C,UAAM,QAAQ,KAAK,MAAM,IAAI,MAAM;AACnC,QAAI,UAAU,QAAW;AACxB,YAAM,IAAI,MAAA;AAAA,IACX;AACA,SAAK,MAAM,OAAO,MAAM;AACxB,SAAK,MAAM,IAAI,QAAQ,KAAK;AAC5B,WAAO;AAAA,EACR;AAAA,EAEO,eAAe,UAAuB;AAC5C,eAAW,OAAO,UAAU;AAC3B,YAAM,WAAW,KAAK,MAAM,IAAI,GAAG;AACnC,UAAI,aAAa,QAAW;AAC3B,cAAM,IAAI,MAAA;AAAA,MACX;AACA,YAAM,QAAQ,KAAK,WAAW,IAAI,QAAQ;AAK1C,WAAK,WAAW,OAAO,QAAQ;AAC/B,WAAK,WAAW,IAAI,UAAU,KAAK;AAAA,IACpC;AAAA,EACD;AAAA,EAEA,GArHiB,KAAA,OAAO,aAqHf,OAAO,aAAiC;AAChD,WAAO,KAAK,QAAA;AAAA,EACb;AAAA,EAEA,CAAQ,UAA+B;AACtC,eAAW,SAAS,KAAK,UAAU;AAClC,YAAM,CAAC,KAAK,QAAQ,KAAK,GAAG,KAAK;AAAA,IAClC;AAAA,EACD;AAAA,EAEA,CAAQ,OAAuB;AAC9B,eAAW,SAAS,KAAK,UAAU;AAClC,YAAM,KAAK,QAAQ,KAAK;AAAA,IACzB;AAAA,EACD;AAAA,EAEA,CAAQ,SAAyB;AAChC,eAAW,SAAS,KAAK,WAAW,OAAA,GAAU;AAC7C,UAAI,UAAU,QAAW;AACxB;AAAA,MACD;AACA,YAAM;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;AAFpC,kBAAA,MAAiB,6BAAY,IAAA,CAAgB;AAAA,EAES;AAAA,EAE/C,IAAI,KAA6B;AACvC,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACxB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,IAAI,KAAK,KAAK;AAAA,IAC1B;AACA,WAAO;AAAA,EACR;AAAA,EAEO,IAAI,KAAU,OAAc;AAClC,QAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,WAAK,MAAM,OAAO,GAAG;AAAA,IACtB,WAAW,KAAK,MAAM,SAAS,KAAK,SAAS;AAC5C,WAAK,MAAM,OAAO,KAAK,aAAA,CAAc;AAAA,IACtC;AACA,SAAK,MAAM,IAAI,KAAK,KAAK;AAAA,EAC1B;AAAA,EAEQ,eAAoB;AAC3B,WAAO,KAAK,MAAM,KAAA,EAAO,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;AAFpC,kBAAA,MAAiB,6BAAY,IAAA,CAAgB;AAAA,EAES;AAAA,EAE/C,IAAI,KAA6B;AACvC,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAEhC,QAAI,UAAU,QAAW;AACxB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,IAAI,KAAK,KAAK;AAAA,IAC1B;AACA,WAAO;AAAA,EACR;AAAA,EAEO,IAAI,KAAU,OAAc;AAClC,QAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,WAAK,MAAM,OAAO,GAAG;AAAA,IACtB,WAAW,KAAK,MAAM,SAAS,KAAK,SAAS;AAC5C,WAAK,MAAM,OAAO,KAAK,aAAA,CAAc;AAAA,IACtC;AACA,SAAK,MAAM,IAAI,KAAK,KAAK;AAAA,EAC1B;AAAA,EAEQ,eAAoB;AAC3B,WAAO,KAAK,MAAM,KAAA,EAAO,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;AACN,kBAAA,MAAiB,6BAAY,QAAA,CAAmB;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;AAC3B,WAAK,MAAM,IAAI,KAAK,WAAW,KAAK,SAAS,KAAK,MAAM,CAAC;AAAA,IAC1D;AACA,WAAO;AAAA,EACR;AAAA,EAEO,iBAAiB,KAA4B;AACnD,QAAI,QAAQ,QAAW;AACtB,aAAO,KAAK;AAAA,IACb;AACA,WAAO,KAAK,MAAM,GAAG;AAAA,EACtB;AAAA,EAEQ,SAAS,MAAsB;AACtC,WAAO,KAAK,QAAQ,CAAC;AAAA,EACtB;AACD;;"}