duo-map 0.0.2 → 0.1.0

package/README.md

@@ -3,13 +3,17 @@
 [![npm version](https://img.shields.io/npm/v/duo-map.svg)](https://www.npmjs.com/package/duo-map) [![npm downloads](http://img.shields.io/npm/dm/duo-map.svg)](https://npmcharts.com/compare/duo-map,token-types?start=1200&interval=30)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/59dd6795e61949fb97066ca52e6097ef)](https://www.codacy.com/app/Borewit/duo-map?utm_source=github.com&utm_medium=referral&utm_content=Borewit/duo-map&utm_campaign=Badge_Grade)
 
-A `Map` that maps **two keys to a single value**. Think of it as a nested `Map<Map>` with a flat API — no manual `get`/`set` bookkeeping of the inner map.
+
+This package offers 2 containers:
+
+- `DuoMap<K1, K2, V>`: A map with two keys.
+- `TresMap<K1, K2, K3, V>`: A map with three keys.
 
 For more awesome packages, check out [my homepage💛](https://baendlorel.github.io/?repoType=npm)
 
 ## Features
 
-- 🗝️ **Two keys, one lookup**: `get(key1, key2)` replaces the `map.get(a)?.get(b)` dance.
+- 🗝️ **Two/three keys, one lookup**: `duo.get(key1, key2)`/`tres.get(key1, key2, key3)` replaces the `map.get(a)?.get(b)`/`map.get(a)?.get(b)?.get(c)` dance.
 - 🌲 **Nested semantics**: entries are grouped by `key1`, but the API is flat.
 - 🧹 **Self-cleaning**: deleting the last pair of a `key1` group removes the group itself.
 - 💤 **Lazy inserts**: `getOrInsertComputed` only computes when the pair is actually missing.
@@ -202,16 +206,16 @@ Keys are compared with **SameValueZero**, exactly like native `Map` — `NaN` ma
 
 ## Differences from native `Map`
 
-| Feature               | `Map`                 | `DuoMap`                                     |
-| --------------------- | --------------------- | -------------------------------------------- |
-| Keys per entry        | 1                     | 2                                            |
-| Read / write          | `(key)`               | `(key1, key2)`                               |
-| Iteration yields      | `[key, value]`        | `[key1, key2, value]`                        |
-| `forEach` callback    | `(value, key, map)`   | `(value, key1, key2)`                        |
-| `keys()` / `values()` | iterators             | plain arrays                                 |
-| `getOrInsert`         | proposal only         | shipped, with a lazy `getOrInsertComputed`   |
-| Empty group cleanup   | —                     | `key1` group dropped with its last `delete`  |
-| `.size`               | O(1)                  | O(number of `key1` groups)                   |
+| Feature               | `Map`               | `DuoMap`                                    |
+| --------------------- | ------------------- | ------------------------------------------- |
+| Keys per entry        | 1                   | 2                                           |
+| Read / write          | `(key)`             | `(key1, key2)`                              |
+| Iteration yields      | `[key, value]`      | `[key1, key2, value]`                       |
+| `forEach` callback    | `(value, key, map)` | `(value, key1, key2)`                       |
+| `keys()` / `values()` | iterators           | plain arrays                                |
+| `getOrInsert`         | proposal only       | shipped, with a lazy `getOrInsertComputed`  |
+| Empty group cleanup   | —                   | `key1` group dropped with its last `delete` |
+| `.size`               | O(1)                | O(number of `key1` groups)                  |
 
 ## License
 

package/dist/index.cjs

@@ -1,2 +1,2 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=(e,t,n)=>(e.has(t)||e.set(t,n),e.get(t)),t=(e,t,n)=>(e.has(t)||e.set(t,n(t)),e.get(t)),n=()=>/* @__PURE__ */ new Map;var r=class{map=/* @__PURE__ */ new Map;get size(){let e=0;return this.map.forEach(t=>e+=t.size),e}set(e,r,i){return t(this.map,e,n).set(r,i),this}get(e,t){return this.map.get(e)?.get(t)}getOrInsert(r,i,a){let o=t(this.map,r,n);return e(o,i,a)}getOrInsertComputed(e,r,i){let a=t(this.map,e,n);return t(a,r,()=>i(e,r))}has(e,t){return this.map.get(e)?.has(t)??!1}delete(e,t){let n=this.map.get(e);if(!n)return!1;let r=n.delete(t);return n.size===0&&this.map.delete(e),r}clear(){this.map.clear()}forEach(e){this.map.forEach((t,n)=>t.forEach((t,r)=>e(t,n,r)))}keys(){let e=[];return this.map.forEach((t,n)=>t.forEach((t,r)=>e.push([n,r]))),e}values(){let e=[];return this.map.forEach(t=>t.forEach(t=>e.push(t))),e}entries(){let e=[];return this.map.forEach((t,n)=>t.forEach((t,r)=>e.push([n,r,t]))),e}[Symbol.iterator](){let e=this.entries(),t=0;return{next(){return t<e.length?{value:e[t++],done:!1}:{value:void 0,done:!0}}}}};exports.DuoMap=r;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=(e,t,n)=>(e.has(t)||e.set(t,n),e.get(t)),t=(e,t,n)=>(e.has(t)||e.set(t,n(t)),e.get(t)),n=()=>/* @__PURE__ */ new Map;var r=class{map=/* @__PURE__ */ new Map;get size(){let e=0;return this.map.forEach(t=>e+=t.size),e}set(e,r,i){return t(this.map,e,n).set(r,i),this}get(e,t){return this.map.get(e)?.get(t)}getOrInsert(r,i,a){let o=t(this.map,r,n);return e(o,i,a)}getOrInsertComputed(e,r,i){let a=t(this.map,e,n);return t(a,r,()=>i(e,r))}has(e,t){return this.map.get(e)?.has(t)??!1}delete(e,t){let n=this.map.get(e);if(!n)return!1;let r=n.delete(t);return n.size===0&&this.map.delete(e),r}clear(){this.map.clear()}forEach(e){this.map.forEach((t,n)=>t.forEach((t,r)=>e(t,n,r)))}*keys(){for(let[e,t]of this.map)for(let n of t.keys())yield[e,n]}*values(){for(let e of this.map.values())yield*e.values()}*entries(){for(let[e,t]of this.map)for(let[n,r]of t)yield[e,n,r]}*[Symbol.iterator](){yield*this.entries()}},i=class{map=/* @__PURE__ */ new Map;get size(){let e=0;return this.map.forEach(t=>t.forEach(t=>e+=t.size)),e}set(e,r,i,a){let o=t(this.map,e,n);return t(o,r,n).set(i,a),this}get(e,t,n){return this.map.get(e)?.get(t)?.get(n)}getOrInsert(r,i,a,o){let s=t(this.map,r,n),c=t(s,i,n);return e(c,a,o)}getOrInsertComputed(e,r,i,a){let o=t(this.map,e,n),s=t(o,r,n);return t(s,i,()=>a(e,r,i))}has(e,t,n){return this.map.get(e)?.get(t)?.has(n)??!1}delete(e,t,n){let r=this.map.get(e);if(!r)return!1;let i=r.get(t);if(!i)return!1;let a=i.delete(n);return i.size===0&&(r.delete(t),r.size===0&&this.map.delete(e)),a}clear(){this.map.clear()}forEach(e){this.map.forEach((t,n)=>t.forEach((t,r)=>t.forEach((t,i)=>e(t,n,r,i))))}*keys(){for(let[e,t]of this.map)for(let[n,r]of t)for(let t of r.keys())yield[e,n,t]}*values(){for(let e of this.map.values())for(let t of e.values())yield*t.values()}*entries(){for(let[e,t]of this.map)for(let[n,r]of t)for(let[t,i]of r)yield[e,n,t,i]}*[Symbol.iterator](){yield*this.entries()}};exports.DuoMap=r,exports.TresMap=i;
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":["_getOrInsert","map","key","value","_getOrInsertComputed","compute","MapConstruct","DuoMap","count","m","key1","key2","result","callback","entries","index"],"sources":["../../_shared/std/map.ts","../src/index.ts"],"sourcesContent":["// # Map\nexport const _getOrInsert = <K, V>(map: Map<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _getOrInsertComputed = <K, V>(map: Map<K, V>, key: K, compute: (key: K) => V): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n\n// # WeakMap\nexport const _weakGetOrInsert = <K extends WeakKey, V>(map: WeakMap<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _weakGetOrInsertComputed = <K extends WeakKey, V>(\n  map: WeakMap<K, V>,\n  key: K,\n  compute: (key: K) => V,\n): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n","import { _getOrInsertComputed, _getOrInsert } from '@shared/std/map.js';\n\nconst MapConstruct = () => new Map();\n\nexport class DuoMap<K1 = any, K2 = any, V = any> {\n  private map = new Map<K1, Map<K2, V>>();\n\n  get size(): number {\n    let count = 0;\n    this.map.forEach((m) => (count += m.size));\n    return count;\n  }\n\n  set(key1: K1, key2: K2, value: V): this {\n    _getOrInsertComputed(this.map, key1, MapConstruct).set(key2, value);\n    return this;\n  }\n\n  get(key1: K1, key2: K2): V | undefined {\n    return this.map.get(key1)?.get(key2);\n  }\n\n  getOrInsert(key1: K1, key2: K2, value: V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsert(m, key2, value);\n  }\n\n  getOrInsertComputed(key1: K1, key2: K2, compute: (key1: K1, key2: K2) => V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsertComputed(m, key2, () => compute(key1, key2));\n  }\n\n  has(key1: K1, key2: K2): boolean {\n    return this.map.get(key1)?.has(key2) ?? false;\n  }\n\n  delete(key1: K1, key2: K2): boolean {\n    const m = this.map.get(key1);\n    if (!m) {\n      return false;\n    }\n    const result = m.delete(key2);\n    if (m.size === 0) {\n      this.map.delete(key1);\n    }\n    return result;\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  forEach(callback: (value: V, key1: K1, key2: K2) => void): void {\n    this.map.forEach((m, key1) => m.forEach((value, key2) => callback(value, key1, key2)));\n  }\n\n  keys(): [K1, K2][] {\n    const result: [K1, K2][] = [];\n    this.map.forEach((m, key1) => m.forEach((_, key2) => result.push([key1, key2])));\n    return result;\n  }\n\n  values(): V[] {\n    const result: V[] = [];\n    this.map.forEach((m) => m.forEach((value) => result.push(value)));\n    return result;\n  }\n\n  entries(): [K1, K2, V][] {\n    const result: [K1, K2, V][] = [];\n    this.map.forEach((m, key1) => m.forEach((value, key2) => result.push([key1, key2, value])));\n    return result;\n  }\n\n  [Symbol.iterator](): Iterator<[K1, K2, V]> {\n    const entries = this.entries();\n    let index = 0;\n    return {\n      next(): IteratorResult<[K1, K2, V]> {\n        if (index < entries.length) {\n          return { value: entries[index++], done: false };\n        } else {\n          return { value: undefined as any, done: true };\n        }\n      },\n    };\n  }\n}\n"],"mappings":"mEACA,MAAaA,GAAsB,EAAgB,EAAQ,KACpDC,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKC,CAAK,EAEbF,EAAI,IAAIC,CAAG,GAGPE,GAA8B,EAAgB,EAAQ,KAC5DH,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKG,EAAQH,CAAG,CAAC,EAEpBD,EAAI,IAAIC,CAAG,GCVdI,sBAAqB,IAAI,IAE/B,IAAaC,EAAb,KAAiD,CAC/C,oBAAc,IAAI,IAElB,IAAI,MAAe,CACjB,IAAIC,EAAQ,EAEZ,OADA,KAAK,IAAI,QAAS,GAAO,GAASC,EAAE,IAAK,EAClCD,CACT,CAEA,IAAI,EAAU,EAAU,EAAgB,CAEtC,OADAJ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,CAAC,CAAC,IAAIK,EAAMR,CAAK,EAC3D,IACT,CAEA,IAAI,EAAU,EAAyB,CACrC,OAAO,KAAK,IAAI,IAAIO,CAAI,CAAC,EAAE,IAAIC,CAAI,CACrC,CAEA,YAAY,EAAU,EAAU,EAAa,CAC3C,IAAMF,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAON,EAAaS,EAAGE,EAAMR,CAAK,CACpC,CAEA,oBAAoB,EAAU,EAAU,EAAuC,CAC7E,IAAMM,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAOF,EAAqBK,EAAGE,MAAYN,EAAQK,EAAMC,CAAI,CAAC,CAChE,CAEA,IAAI,EAAU,EAAmB,CAC/B,OAAO,KAAK,IAAI,IAAID,CAAI,CAAC,EAAE,IAAIC,CAAI,GAAK,EAC1C,CAEA,OAAO,EAAU,EAAmB,CAClC,IAAMF,EAAI,KAAK,IAAI,IAAIC,CAAI,EAC3B,GAAI,CAACD,EACH,MAAO,GAET,IAAMG,EAASH,EAAE,OAAOE,CAAI,EAI5B,OAHIF,EAAE,OAAS,GACb,KAAK,IAAI,OAAOC,CAAI,EAEfE,CACT,CAEA,OAAc,CACZ,KAAK,IAAI,MAAM,CACjB,CAEA,QAAQ,EAAwD,CAC9D,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAO,IAASI,EAASV,EAAOO,EAAMC,CAAI,CAAC,CAAC,CACvF,CAEA,MAAmB,CACjB,IAAMC,EAAqB,CAAC,EAE5B,OADA,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAG,IAASG,EAAO,KAAK,CAACF,EAAMC,CAAI,CAAC,CAAC,CAAC,EACxEC,CACT,CAEA,QAAc,CACZ,IAAMA,EAAc,CAAC,EAErB,OADA,KAAK,IAAI,QAAS,GAAMH,EAAE,QAAS,GAAUG,EAAO,KAAKT,CAAK,CAAC,CAAC,EACzDS,CACT,CAEA,SAAyB,CACvB,IAAMA,EAAwB,CAAC,EAE/B,OADA,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAO,IAASG,EAAO,KAAK,CAACF,EAAMC,EAAMR,CAAK,CAAC,CAAC,CAAC,EACnFS,CACT,CAEA,CAAC,OAAO,WAAmC,CACzC,IAAME,EAAU,KAAK,QAAQ,EACzBC,EAAQ,EACZ,MAAO,CACL,MAAoC,CAIhC,OAHEA,EAAQD,EAAQ,OACX,CAAE,MAAOA,EAAQ,KAAU,KAAM,EAAM,EAEvC,CAAE,MAAO,IAAA,GAAkB,KAAM,EAAK,CAEjD,CACF,CACF,CACF"}
+{"version":3,"file":"index.cjs","names":["_getOrInsert","map","key","value","_getOrInsertComputed","compute","MapConstruct","DuoMap","count","m","key1","key2","result","callback","TresMap","m2","m1","key3"],"sources":["../../_shared/std/map.ts","../src/index.ts"],"sourcesContent":["// # Map\nexport const _getOrInsert = <K, V>(map: Map<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _getOrInsertComputed = <K, V>(map: Map<K, V>, key: K, compute: (key: K) => V): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n\n// # WeakMap\nexport const _weakGetOrInsert = <K extends WeakKey, V>(map: WeakMap<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _weakGetOrInsertComputed = <K extends WeakKey, V>(\n  map: WeakMap<K, V>,\n  key: K,\n  compute: (key: K) => V,\n): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n","import { _getOrInsertComputed, _getOrInsert } from '@shared/std/map.js';\n\nconst MapConstruct = () => new Map();\n\n/**\n * Creates a two-keyed map structure.\n *\n * @template K1 - The type of the first-level keys.\n * @template K2 - The type of the second-level keys.\n * @template V - The type of the values.\n */\nexport class DuoMap<K1 = any, K2 = any, V = any> {\n  private map = new Map<K1, Map<K2, V>>();\n\n  get size(): number {\n    let count = 0;\n    this.map.forEach((m) => (count += m.size));\n    return count;\n  }\n\n  set(key1: K1, key2: K2, value: V): this {\n    _getOrInsertComputed(this.map, key1, MapConstruct).set(key2, value);\n    return this;\n  }\n\n  get(key1: K1, key2: K2): V | undefined {\n    return this.map.get(key1)?.get(key2);\n  }\n\n  getOrInsert(key1: K1, key2: K2, value: V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsert(m, key2, value);\n  }\n\n  getOrInsertComputed(key1: K1, key2: K2, compute: (key1: K1, key2: K2) => V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsertComputed(m, key2, () => compute(key1, key2));\n  }\n\n  has(key1: K1, key2: K2): boolean {\n    return this.map.get(key1)?.has(key2) ?? false;\n  }\n\n  delete(key1: K1, key2: K2): boolean {\n    const m = this.map.get(key1);\n    if (!m) {\n      return false;\n    }\n    const result = m.delete(key2);\n    if (m.size === 0) {\n      this.map.delete(key1);\n    }\n    return result;\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  forEach(callback: (value: V, key1: K1, key2: K2) => void): void {\n    this.map.forEach((m, key1) => m.forEach((value, key2) => callback(value, key1, key2)));\n  }\n\n  *keys(): IterableIterator<[K1, K2]> {\n    for (const [key1, m] of this.map) {\n      for (const key2 of m.keys()) {\n        yield [key1, key2];\n      }\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    for (const m of this.map.values()) {\n      yield* m.values();\n    }\n  }\n\n  *entries(): IterableIterator<[K1, K2, V]> {\n    for (const [key1, m] of this.map) {\n      for (const [key2, value] of m) {\n        yield [key1, key2, value];\n      }\n    }\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K1, K2, V]> {\n    yield* this.entries();\n  }\n}\n\n/**\n * Creates a three-keyed map structure.\n *\n * @template K1 - The type of the first-level keys.\n * @template K2 - The type of the second-level keys.\n * @template K3 - The type of the third-level keys.\n * @template V - The type of the values.\n */\nexport class TresMap<K1 = any, K2 = any, K3 = any, V = any> {\n  private map = new Map<K1, Map<K2, Map<K3, V>>>();\n\n  get size(): number {\n    let count = 0;\n    this.map.forEach((m) => m.forEach((m2) => (count += m2.size)));\n    return count;\n  }\n\n  set(key1: K1, key2: K2, key3: K3, value: V): this {\n    const m1 = _getOrInsertComputed(this.map, key1, MapConstruct);\n    _getOrInsertComputed(m1, key2, MapConstruct).set(key3, value);\n    return this;\n  }\n\n  get(key1: K1, key2: K2, key3: K3): V | undefined {\n    return this.map.get(key1)?.get(key2)?.get(key3);\n  }\n\n  getOrInsert(key1: K1, key2: K2, key3: K3, value: V): V {\n    const m1 = _getOrInsertComputed(this.map, key1, MapConstruct);\n    const m2 = _getOrInsertComputed(m1, key2, MapConstruct);\n    return _getOrInsert(m2, key3, value);\n  }\n\n  getOrInsertComputed(key1: K1, key2: K2, key3: K3, compute: (key1: K1, key2: K2, key3: K3) => V): V {\n    const m1 = _getOrInsertComputed(this.map, key1, MapConstruct);\n    const m2 = _getOrInsertComputed(m1, key2, MapConstruct);\n    return _getOrInsertComputed(m2, key3, () => compute(key1, key2, key3));\n  }\n\n  has(key1: K1, key2: K2, key3: K3): boolean {\n    return this.map.get(key1)?.get(key2)?.has(key3) ?? false;\n  }\n\n  delete(key1: K1, key2: K2, key3: K3): boolean {\n    const m1 = this.map.get(key1);\n    if (!m1) return false;\n    const m2 = m1.get(key2);\n    if (!m2) return false;\n    const result = m2.delete(key3);\n    if (m2.size === 0) {\n      m1.delete(key2);\n      if (m1.size === 0) {\n        this.map.delete(key1);\n      }\n    }\n    return result;\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  forEach(callback: (value: V, key1: K1, key2: K2, key3: K3) => void): void {\n    this.map.forEach((m, key1) =>\n      m.forEach((m2, key2) => m2.forEach((value, key3) => callback(value, key1, key2, key3))),\n    );\n  }\n\n  *keys(): IterableIterator<[K1, K2, K3]> {\n    for (const [key1, m1] of this.map) {\n      for (const [key2, m2] of m1) {\n        for (const key3 of m2.keys()) {\n          yield [key1, key2, key3];\n        }\n      }\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    for (const m1 of this.map.values()) {\n      for (const m2 of m1.values()) {\n        yield* m2.values();\n      }\n    }\n  }\n\n  *entries(): IterableIterator<[K1, K2, K3, V]> {\n    for (const [key1, m1] of this.map) {\n      for (const [key2, m2] of m1) {\n        for (const [key3, value] of m2) {\n          yield [key1, key2, key3, value];\n        }\n      }\n    }\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K1, K2, K3, V]> {\n    yield* this.entries();\n  }\n}\n"],"mappings":"mEACA,MAAaA,GAAsB,EAAgB,EAAQ,KACpDC,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKC,CAAK,EAEbF,EAAI,IAAIC,CAAG,GAGPE,GAA8B,EAAgB,EAAQ,KAC5DH,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKG,EAAQH,CAAG,CAAC,EAEpBD,EAAI,IAAIC,CAAG,GCVdI,sBAAqB,IAAI,IAS/B,IAAaC,EAAb,KAAiD,CAC/C,oBAAc,IAAI,IAElB,IAAI,MAAe,CACjB,IAAIC,EAAQ,EAEZ,OADA,KAAK,IAAI,QAAS,GAAO,GAASC,EAAE,IAAK,EAClCD,CACT,CAEA,IAAI,EAAU,EAAU,EAAgB,CAEtC,OADAJ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,CAAC,CAAC,IAAIK,EAAMR,CAAK,EAC3D,IACT,CAEA,IAAI,EAAU,EAAyB,CACrC,OAAO,KAAK,IAAI,IAAIO,CAAI,CAAC,EAAE,IAAIC,CAAI,CACrC,CAEA,YAAY,EAAU,EAAU,EAAa,CAC3C,IAAMF,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAON,EAAaS,EAAGE,EAAMR,CAAK,CACpC,CAEA,oBAAoB,EAAU,EAAU,EAAuC,CAC7E,IAAMM,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAOF,EAAqBK,EAAGE,MAAYN,EAAQK,EAAMC,CAAI,CAAC,CAChE,CAEA,IAAI,EAAU,EAAmB,CAC/B,OAAO,KAAK,IAAI,IAAID,CAAI,CAAC,EAAE,IAAIC,CAAI,GAAK,EAC1C,CAEA,OAAO,EAAU,EAAmB,CAClC,IAAMF,EAAI,KAAK,IAAI,IAAIC,CAAI,EAC3B,GAAI,CAACD,EACH,MAAO,GAET,IAAMG,EAASH,EAAE,OAAOE,CAAI,EAI5B,OAHIF,EAAE,OAAS,GACb,KAAK,IAAI,OAAOC,CAAI,EAEfE,CACT,CAEA,OAAc,CACZ,KAAK,IAAI,MAAM,CACjB,CAEA,QAAQ,EAAwD,CAC9D,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAO,IAASI,EAASV,EAAOO,EAAMC,CAAI,CAAC,CAAC,CACvF,CAEA,CAAC,MAAmC,CAClC,IAAK,GAAM,CAACD,EAAMD,KAAM,KAAK,IAC3B,IAAK,IAAME,KAAQF,EAAE,KAAK,EACxB,KAAM,CAACC,EAAMC,CAAI,CAGvB,CAEA,CAAC,QAA8B,CAC7B,IAAK,IAAMF,KAAK,KAAK,IAAI,OAAO,EAC9B,MAAOA,EAAE,OAAO,CAEpB,CAEA,CAAC,SAAyC,CACxC,IAAK,GAAM,CAACC,EAAMD,KAAM,KAAK,IAC3B,IAAK,GAAM,CAACE,EAAMR,KAAUM,EAC1B,KAAM,CAACC,EAAMC,EAAMR,CAAK,CAG9B,CAEA,EAAE,OAAO,WAA2C,CAClD,MAAO,KAAK,QAAQ,CACtB,CACF,EAUaW,EAAb,KAA4D,CAC1D,oBAAc,IAAI,IAElB,IAAI,MAAe,CACjB,IAAIN,EAAQ,EAEZ,OADA,KAAK,IAAI,QAAS,GAAMC,EAAE,QAAS,GAAQ,GAASM,EAAG,IAAK,CAAC,EACtDP,CACT,CAEA,IAAI,EAAU,EAAU,EAAU,EAAgB,CAChD,IAAMQ,EAAKZ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAE5D,OADAF,EAAqBY,EAAIL,EAAML,CAAY,CAAC,CAAC,IAAIW,EAAMd,CAAK,EACrD,IACT,CAEA,IAAI,EAAU,EAAU,EAAyB,CAC/C,OAAO,KAAK,IAAI,IAAIO,CAAI,CAAC,EAAE,IAAIC,CAAI,CAAC,EAAE,IAAIM,CAAI,CAChD,CAEA,YAAY,EAAU,EAAU,EAAU,EAAa,CACrD,IAAMD,EAAKZ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EACtDS,EAAKX,EAAqBY,EAAIL,EAAML,CAAY,EACtD,OAAON,EAAae,EAAIE,EAAMd,CAAK,CACrC,CAEA,oBAAoB,EAAU,EAAU,EAAU,EAAiD,CACjG,IAAMa,EAAKZ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EACtDS,EAAKX,EAAqBY,EAAIL,EAAML,CAAY,EACtD,OAAOF,EAAqBW,EAAIE,MAAYZ,EAAQK,EAAMC,EAAMM,CAAI,CAAC,CACvE,CAEA,IAAI,EAAU,EAAU,EAAmB,CACzC,OAAO,KAAK,IAAI,IAAIP,CAAI,CAAC,EAAE,IAAIC,CAAI,CAAC,EAAE,IAAIM,CAAI,GAAK,EACrD,CAEA,OAAO,EAAU,EAAU,EAAmB,CAC5C,IAAMD,EAAK,KAAK,IAAI,IAAIN,CAAI,EAC5B,GAAI,CAACM,EAAI,MAAO,GAChB,IAAMD,EAAKC,EAAG,IAAIL,CAAI,EACtB,GAAI,CAACI,EAAI,MAAO,GAChB,IAAMH,EAASG,EAAG,OAAOE,CAAI,EAO7B,OANIF,EAAG,OAAS,IACdC,EAAG,OAAOL,CAAI,EACVK,EAAG,OAAS,GACd,KAAK,IAAI,OAAON,CAAI,GAGjBE,CACT,CAEA,OAAc,CACZ,KAAK,IAAI,MAAM,CACjB,CAEA,QAAQ,EAAkE,CACxE,KAAK,IAAI,SAAS,EAAG,IACnBH,EAAE,SAAS,EAAI,IAASM,EAAG,SAAS,EAAO,IAASF,EAASV,EAAOO,EAAMC,EAAMM,CAAI,CAAC,CAAC,CACxF,CACF,CAEA,CAAC,MAAuC,CACtC,IAAK,GAAM,CAACP,EAAMM,KAAO,KAAK,IAC5B,IAAK,GAAM,CAACL,EAAMI,KAAOC,EACvB,IAAK,IAAMC,KAAQF,EAAG,KAAK,EACzB,KAAM,CAACL,EAAMC,EAAMM,CAAI,CAI/B,CAEA,CAAC,QAA8B,CAC7B,IAAK,IAAMD,KAAM,KAAK,IAAI,OAAO,EAC/B,IAAK,IAAMD,KAAMC,EAAG,OAAO,EACzB,MAAOD,EAAG,OAAO,CAGvB,CAEA,CAAC,SAA6C,CAC5C,IAAK,GAAM,CAACL,EAAMM,KAAO,KAAK,IAC5B,IAAK,GAAM,CAACL,EAAMI,KAAOC,EACvB,IAAK,GAAM,CAACC,EAAMd,KAAUY,EAC1B,KAAM,CAACL,EAAMC,EAAMM,EAAMd,CAAK,CAItC,CAEA,EAAE,OAAO,WAA+C,CACtD,MAAO,KAAK,QAAQ,CACtB,CACF"}

package/dist/index.d.cts

@@ -1,4 +1,11 @@
 //#region src/index.d.ts
+/**
+ * Creates a two-keyed map structure.
+ *
+ * @template K1 - The type of the first-level keys.
+ * @template K2 - The type of the second-level keys.
+ * @template V - The type of the values.
+ */
 declare class DuoMap<K1 = any, K2 = any, V = any> {
   private map;
   get size(): number;
@@ -10,11 +17,35 @@ declare class DuoMap<K1 = any, K2 = any, V = any> {
   delete(key1: K1, key2: K2): boolean;
   clear(): void;
   forEach(callback: (value: V, key1: K1, key2: K2) => void): void;
-  keys(): [K1, K2][];
-  values(): V[];
-  entries(): [K1, K2, V][];
-  [Symbol.iterator](): Iterator<[K1, K2, V]>;
+  keys(): IterableIterator<[K1, K2]>;
+  values(): IterableIterator<V>;
+  entries(): IterableIterator<[K1, K2, V]>;
+  [Symbol.iterator](): IterableIterator<[K1, K2, V]>;
+}
+/**
+ * Creates a three-keyed map structure.
+ *
+ * @template K1 - The type of the first-level keys.
+ * @template K2 - The type of the second-level keys.
+ * @template K3 - The type of the third-level keys.
+ * @template V - The type of the values.
+ */
+declare class TresMap<K1 = any, K2 = any, K3 = any, V = any> {
+  private map;
+  get size(): number;
+  set(key1: K1, key2: K2, key3: K3, value: V): this;
+  get(key1: K1, key2: K2, key3: K3): V | undefined;
+  getOrInsert(key1: K1, key2: K2, key3: K3, value: V): V;
+  getOrInsertComputed(key1: K1, key2: K2, key3: K3, compute: (key1: K1, key2: K2, key3: K3) => V): V;
+  has(key1: K1, key2: K2, key3: K3): boolean;
+  delete(key1: K1, key2: K2, key3: K3): boolean;
+  clear(): void;
+  forEach(callback: (value: V, key1: K1, key2: K2, key3: K3) => void): void;
+  keys(): IterableIterator<[K1, K2, K3]>;
+  values(): IterableIterator<V>;
+  entries(): IterableIterator<[K1, K2, K3, V]>;
+  [Symbol.iterator](): IterableIterator<[K1, K2, K3, V]>;
 }
 //#endregion
-export { DuoMap };
+export { DuoMap, TresMap };
 //# sourceMappingURL=index.d.cts.map

package/dist/index.d.mts

@@ -1,4 +1,11 @@
 //#region src/index.d.ts
+/**
+ * Creates a two-keyed map structure.
+ *
+ * @template K1 - The type of the first-level keys.
+ * @template K2 - The type of the second-level keys.
+ * @template V - The type of the values.
+ */
 declare class DuoMap<K1 = any, K2 = any, V = any> {
   private map;
   get size(): number;
@@ -10,11 +17,35 @@ declare class DuoMap<K1 = any, K2 = any, V = any> {
   delete(key1: K1, key2: K2): boolean;
   clear(): void;
   forEach(callback: (value: V, key1: K1, key2: K2) => void): void;
-  keys(): [K1, K2][];
-  values(): V[];
-  entries(): [K1, K2, V][];
-  [Symbol.iterator](): Iterator<[K1, K2, V]>;
+  keys(): IterableIterator<[K1, K2]>;
+  values(): IterableIterator<V>;
+  entries(): IterableIterator<[K1, K2, V]>;
+  [Symbol.iterator](): IterableIterator<[K1, K2, V]>;
+}
+/**
+ * Creates a three-keyed map structure.
+ *
+ * @template K1 - The type of the first-level keys.
+ * @template K2 - The type of the second-level keys.
+ * @template K3 - The type of the third-level keys.
+ * @template V - The type of the values.
+ */
+declare class TresMap<K1 = any, K2 = any, K3 = any, V = any> {
+  private map;
+  get size(): number;
+  set(key1: K1, key2: K2, key3: K3, value: V): this;
+  get(key1: K1, key2: K2, key3: K3): V | undefined;
+  getOrInsert(key1: K1, key2: K2, key3: K3, value: V): V;
+  getOrInsertComputed(key1: K1, key2: K2, key3: K3, compute: (key1: K1, key2: K2, key3: K3) => V): V;
+  has(key1: K1, key2: K2, key3: K3): boolean;
+  delete(key1: K1, key2: K2, key3: K3): boolean;
+  clear(): void;
+  forEach(callback: (value: V, key1: K1, key2: K2, key3: K3) => void): void;
+  keys(): IterableIterator<[K1, K2, K3]>;
+  values(): IterableIterator<V>;
+  entries(): IterableIterator<[K1, K2, K3, V]>;
+  [Symbol.iterator](): IterableIterator<[K1, K2, K3, V]>;
 }
 //#endregion
-export { DuoMap };
+export { DuoMap, TresMap };
 //# sourceMappingURL=index.d.mts.map

package/dist/index.mjs

@@ -1,2 +1,2 @@
-const e=(e,t,n)=>(e.has(t)||e.set(t,n),e.get(t)),t=(e,t,n)=>(e.has(t)||e.set(t,n(t)),e.get(t)),n=()=>/* @__PURE__ */ new Map;var r=class{map=/* @__PURE__ */ new Map;get size(){let e=0;return this.map.forEach(t=>e+=t.size),e}set(e,r,i){return t(this.map,e,n).set(r,i),this}get(e,t){return this.map.get(e)?.get(t)}getOrInsert(r,i,a){let o=t(this.map,r,n);return e(o,i,a)}getOrInsertComputed(e,r,i){let a=t(this.map,e,n);return t(a,r,()=>i(e,r))}has(e,t){return this.map.get(e)?.has(t)??!1}delete(e,t){let n=this.map.get(e);if(!n)return!1;let r=n.delete(t);return n.size===0&&this.map.delete(e),r}clear(){this.map.clear()}forEach(e){this.map.forEach((t,n)=>t.forEach((t,r)=>e(t,n,r)))}keys(){let e=[];return this.map.forEach((t,n)=>t.forEach((t,r)=>e.push([n,r]))),e}values(){let e=[];return this.map.forEach(t=>t.forEach(t=>e.push(t))),e}entries(){let e=[];return this.map.forEach((t,n)=>t.forEach((t,r)=>e.push([n,r,t]))),e}[Symbol.iterator](){let e=this.entries(),t=0;return{next(){return t<e.length?{value:e[t++],done:!1}:{value:void 0,done:!0}}}}};export{r as DuoMap};
+const e=(e,t,n)=>(e.has(t)||e.set(t,n),e.get(t)),t=(e,t,n)=>(e.has(t)||e.set(t,n(t)),e.get(t)),n=()=>/* @__PURE__ */ new Map;var r=class{map=/* @__PURE__ */ new Map;get size(){let e=0;return this.map.forEach(t=>e+=t.size),e}set(e,r,i){return t(this.map,e,n).set(r,i),this}get(e,t){return this.map.get(e)?.get(t)}getOrInsert(r,i,a){let o=t(this.map,r,n);return e(o,i,a)}getOrInsertComputed(e,r,i){let a=t(this.map,e,n);return t(a,r,()=>i(e,r))}has(e,t){return this.map.get(e)?.has(t)??!1}delete(e,t){let n=this.map.get(e);if(!n)return!1;let r=n.delete(t);return n.size===0&&this.map.delete(e),r}clear(){this.map.clear()}forEach(e){this.map.forEach((t,n)=>t.forEach((t,r)=>e(t,n,r)))}*keys(){for(let[e,t]of this.map)for(let n of t.keys())yield[e,n]}*values(){for(let e of this.map.values())yield*e.values()}*entries(){for(let[e,t]of this.map)for(let[n,r]of t)yield[e,n,r]}*[Symbol.iterator](){yield*this.entries()}},i=class{map=/* @__PURE__ */ new Map;get size(){let e=0;return this.map.forEach(t=>t.forEach(t=>e+=t.size)),e}set(e,r,i,a){let o=t(this.map,e,n);return t(o,r,n).set(i,a),this}get(e,t,n){return this.map.get(e)?.get(t)?.get(n)}getOrInsert(r,i,a,o){let s=t(this.map,r,n),c=t(s,i,n);return e(c,a,o)}getOrInsertComputed(e,r,i,a){let o=t(this.map,e,n),s=t(o,r,n);return t(s,i,()=>a(e,r,i))}has(e,t,n){return this.map.get(e)?.get(t)?.has(n)??!1}delete(e,t,n){let r=this.map.get(e);if(!r)return!1;let i=r.get(t);if(!i)return!1;let a=i.delete(n);return i.size===0&&(r.delete(t),r.size===0&&this.map.delete(e)),a}clear(){this.map.clear()}forEach(e){this.map.forEach((t,n)=>t.forEach((t,r)=>t.forEach((t,i)=>e(t,n,r,i))))}*keys(){for(let[e,t]of this.map)for(let[n,r]of t)for(let t of r.keys())yield[e,n,t]}*values(){for(let e of this.map.values())for(let t of e.values())yield*t.values()}*entries(){for(let[e,t]of this.map)for(let[n,r]of t)for(let[t,i]of r)yield[e,n,t,i]}*[Symbol.iterator](){yield*this.entries()}};export{r as DuoMap,i as TresMap};
 //# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":["_getOrInsert","map","key","value","_getOrInsertComputed","compute","MapConstruct","DuoMap","count","m","key1","key2","result","callback","entries","index"],"sources":["../../_shared/std/map.ts","../src/index.ts"],"sourcesContent":["// # Map\nexport const _getOrInsert = <K, V>(map: Map<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _getOrInsertComputed = <K, V>(map: Map<K, V>, key: K, compute: (key: K) => V): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n\n// # WeakMap\nexport const _weakGetOrInsert = <K extends WeakKey, V>(map: WeakMap<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _weakGetOrInsertComputed = <K extends WeakKey, V>(\n  map: WeakMap<K, V>,\n  key: K,\n  compute: (key: K) => V,\n): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n","import { _getOrInsertComputed, _getOrInsert } from '@shared/std/map.js';\n\nconst MapConstruct = () => new Map();\n\nexport class DuoMap<K1 = any, K2 = any, V = any> {\n  private map = new Map<K1, Map<K2, V>>();\n\n  get size(): number {\n    let count = 0;\n    this.map.forEach((m) => (count += m.size));\n    return count;\n  }\n\n  set(key1: K1, key2: K2, value: V): this {\n    _getOrInsertComputed(this.map, key1, MapConstruct).set(key2, value);\n    return this;\n  }\n\n  get(key1: K1, key2: K2): V | undefined {\n    return this.map.get(key1)?.get(key2);\n  }\n\n  getOrInsert(key1: K1, key2: K2, value: V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsert(m, key2, value);\n  }\n\n  getOrInsertComputed(key1: K1, key2: K2, compute: (key1: K1, key2: K2) => V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsertComputed(m, key2, () => compute(key1, key2));\n  }\n\n  has(key1: K1, key2: K2): boolean {\n    return this.map.get(key1)?.has(key2) ?? false;\n  }\n\n  delete(key1: K1, key2: K2): boolean {\n    const m = this.map.get(key1);\n    if (!m) {\n      return false;\n    }\n    const result = m.delete(key2);\n    if (m.size === 0) {\n      this.map.delete(key1);\n    }\n    return result;\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  forEach(callback: (value: V, key1: K1, key2: K2) => void): void {\n    this.map.forEach((m, key1) => m.forEach((value, key2) => callback(value, key1, key2)));\n  }\n\n  keys(): [K1, K2][] {\n    const result: [K1, K2][] = [];\n    this.map.forEach((m, key1) => m.forEach((_, key2) => result.push([key1, key2])));\n    return result;\n  }\n\n  values(): V[] {\n    const result: V[] = [];\n    this.map.forEach((m) => m.forEach((value) => result.push(value)));\n    return result;\n  }\n\n  entries(): [K1, K2, V][] {\n    const result: [K1, K2, V][] = [];\n    this.map.forEach((m, key1) => m.forEach((value, key2) => result.push([key1, key2, value])));\n    return result;\n  }\n\n  [Symbol.iterator](): Iterator<[K1, K2, V]> {\n    const entries = this.entries();\n    let index = 0;\n    return {\n      next(): IteratorResult<[K1, K2, V]> {\n        if (index < entries.length) {\n          return { value: entries[index++], done: false };\n        } else {\n          return { value: undefined as any, done: true };\n        }\n      },\n    };\n  }\n}\n"],"mappings":"AACA,MAAaA,GAAsB,EAAgB,EAAQ,KACpDC,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKC,CAAK,EAEbF,EAAI,IAAIC,CAAG,GAGPE,GAA8B,EAAgB,EAAQ,KAC5DH,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKG,EAAQH,CAAG,CAAC,EAEpBD,EAAI,IAAIC,CAAG,GCVdI,sBAAqB,IAAI,IAE/B,IAAaC,EAAb,KAAiD,CAC/C,oBAAc,IAAI,IAElB,IAAI,MAAe,CACjB,IAAIC,EAAQ,EAEZ,OADA,KAAK,IAAI,QAAS,GAAO,GAASC,EAAE,IAAK,EAClCD,CACT,CAEA,IAAI,EAAU,EAAU,EAAgB,CAEtC,OADAJ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,CAAC,CAAC,IAAIK,EAAMR,CAAK,EAC3D,IACT,CAEA,IAAI,EAAU,EAAyB,CACrC,OAAO,KAAK,IAAI,IAAIO,CAAI,CAAC,EAAE,IAAIC,CAAI,CACrC,CAEA,YAAY,EAAU,EAAU,EAAa,CAC3C,IAAMF,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAON,EAAaS,EAAGE,EAAMR,CAAK,CACpC,CAEA,oBAAoB,EAAU,EAAU,EAAuC,CAC7E,IAAMM,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAOF,EAAqBK,EAAGE,MAAYN,EAAQK,EAAMC,CAAI,CAAC,CAChE,CAEA,IAAI,EAAU,EAAmB,CAC/B,OAAO,KAAK,IAAI,IAAID,CAAI,CAAC,EAAE,IAAIC,CAAI,GAAK,EAC1C,CAEA,OAAO,EAAU,EAAmB,CAClC,IAAMF,EAAI,KAAK,IAAI,IAAIC,CAAI,EAC3B,GAAI,CAACD,EACH,MAAO,GAET,IAAMG,EAASH,EAAE,OAAOE,CAAI,EAI5B,OAHIF,EAAE,OAAS,GACb,KAAK,IAAI,OAAOC,CAAI,EAEfE,CACT,CAEA,OAAc,CACZ,KAAK,IAAI,MAAM,CACjB,CAEA,QAAQ,EAAwD,CAC9D,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAO,IAASI,EAASV,EAAOO,EAAMC,CAAI,CAAC,CAAC,CACvF,CAEA,MAAmB,CACjB,IAAMC,EAAqB,CAAC,EAE5B,OADA,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAG,IAASG,EAAO,KAAK,CAACF,EAAMC,CAAI,CAAC,CAAC,CAAC,EACxEC,CACT,CAEA,QAAc,CACZ,IAAMA,EAAc,CAAC,EAErB,OADA,KAAK,IAAI,QAAS,GAAMH,EAAE,QAAS,GAAUG,EAAO,KAAKT,CAAK,CAAC,CAAC,EACzDS,CACT,CAEA,SAAyB,CACvB,IAAMA,EAAwB,CAAC,EAE/B,OADA,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAO,IAASG,EAAO,KAAK,CAACF,EAAMC,EAAMR,CAAK,CAAC,CAAC,CAAC,EACnFS,CACT,CAEA,CAAC,OAAO,WAAmC,CACzC,IAAME,EAAU,KAAK,QAAQ,EACzBC,EAAQ,EACZ,MAAO,CACL,MAAoC,CAIhC,OAHEA,EAAQD,EAAQ,OACX,CAAE,MAAOA,EAAQ,KAAU,KAAM,EAAM,EAEvC,CAAE,MAAO,IAAA,GAAkB,KAAM,EAAK,CAEjD,CACF,CACF,CACF"}
+{"version":3,"file":"index.mjs","names":["_getOrInsert","map","key","value","_getOrInsertComputed","compute","MapConstruct","DuoMap","count","m","key1","key2","result","callback","TresMap","m2","m1","key3"],"sources":["../../_shared/std/map.ts","../src/index.ts"],"sourcesContent":["// # Map\nexport const _getOrInsert = <K, V>(map: Map<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _getOrInsertComputed = <K, V>(map: Map<K, V>, key: K, compute: (key: K) => V): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n\n// # WeakMap\nexport const _weakGetOrInsert = <K extends WeakKey, V>(map: WeakMap<K, V>, key: K, value: V): V => {\n  if (!map.has(key)) {\n    map.set(key, value);\n  }\n  return map.get(key)!;\n};\n\nexport const _weakGetOrInsertComputed = <K extends WeakKey, V>(\n  map: WeakMap<K, V>,\n  key: K,\n  compute: (key: K) => V,\n): V => {\n  if (!map.has(key)) {\n    map.set(key, compute(key));\n  }\n  return map.get(key)!;\n};\n","import { _getOrInsertComputed, _getOrInsert } from '@shared/std/map.js';\n\nconst MapConstruct = () => new Map();\n\n/**\n * Creates a two-keyed map structure.\n *\n * @template K1 - The type of the first-level keys.\n * @template K2 - The type of the second-level keys.\n * @template V - The type of the values.\n */\nexport class DuoMap<K1 = any, K2 = any, V = any> {\n  private map = new Map<K1, Map<K2, V>>();\n\n  get size(): number {\n    let count = 0;\n    this.map.forEach((m) => (count += m.size));\n    return count;\n  }\n\n  set(key1: K1, key2: K2, value: V): this {\n    _getOrInsertComputed(this.map, key1, MapConstruct).set(key2, value);\n    return this;\n  }\n\n  get(key1: K1, key2: K2): V | undefined {\n    return this.map.get(key1)?.get(key2);\n  }\n\n  getOrInsert(key1: K1, key2: K2, value: V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsert(m, key2, value);\n  }\n\n  getOrInsertComputed(key1: K1, key2: K2, compute: (key1: K1, key2: K2) => V): V {\n    const m = _getOrInsertComputed(this.map, key1, MapConstruct);\n    return _getOrInsertComputed(m, key2, () => compute(key1, key2));\n  }\n\n  has(key1: K1, key2: K2): boolean {\n    return this.map.get(key1)?.has(key2) ?? false;\n  }\n\n  delete(key1: K1, key2: K2): boolean {\n    const m = this.map.get(key1);\n    if (!m) {\n      return false;\n    }\n    const result = m.delete(key2);\n    if (m.size === 0) {\n      this.map.delete(key1);\n    }\n    return result;\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  forEach(callback: (value: V, key1: K1, key2: K2) => void): void {\n    this.map.forEach((m, key1) => m.forEach((value, key2) => callback(value, key1, key2)));\n  }\n\n  *keys(): IterableIterator<[K1, K2]> {\n    for (const [key1, m] of this.map) {\n      for (const key2 of m.keys()) {\n        yield [key1, key2];\n      }\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    for (const m of this.map.values()) {\n      yield* m.values();\n    }\n  }\n\n  *entries(): IterableIterator<[K1, K2, V]> {\n    for (const [key1, m] of this.map) {\n      for (const [key2, value] of m) {\n        yield [key1, key2, value];\n      }\n    }\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K1, K2, V]> {\n    yield* this.entries();\n  }\n}\n\n/**\n * Creates a three-keyed map structure.\n *\n * @template K1 - The type of the first-level keys.\n * @template K2 - The type of the second-level keys.\n * @template K3 - The type of the third-level keys.\n * @template V - The type of the values.\n */\nexport class TresMap<K1 = any, K2 = any, K3 = any, V = any> {\n  private map = new Map<K1, Map<K2, Map<K3, V>>>();\n\n  get size(): number {\n    let count = 0;\n    this.map.forEach((m) => m.forEach((m2) => (count += m2.size)));\n    return count;\n  }\n\n  set(key1: K1, key2: K2, key3: K3, value: V): this {\n    const m1 = _getOrInsertComputed(this.map, key1, MapConstruct);\n    _getOrInsertComputed(m1, key2, MapConstruct).set(key3, value);\n    return this;\n  }\n\n  get(key1: K1, key2: K2, key3: K3): V | undefined {\n    return this.map.get(key1)?.get(key2)?.get(key3);\n  }\n\n  getOrInsert(key1: K1, key2: K2, key3: K3, value: V): V {\n    const m1 = _getOrInsertComputed(this.map, key1, MapConstruct);\n    const m2 = _getOrInsertComputed(m1, key2, MapConstruct);\n    return _getOrInsert(m2, key3, value);\n  }\n\n  getOrInsertComputed(key1: K1, key2: K2, key3: K3, compute: (key1: K1, key2: K2, key3: K3) => V): V {\n    const m1 = _getOrInsertComputed(this.map, key1, MapConstruct);\n    const m2 = _getOrInsertComputed(m1, key2, MapConstruct);\n    return _getOrInsertComputed(m2, key3, () => compute(key1, key2, key3));\n  }\n\n  has(key1: K1, key2: K2, key3: K3): boolean {\n    return this.map.get(key1)?.get(key2)?.has(key3) ?? false;\n  }\n\n  delete(key1: K1, key2: K2, key3: K3): boolean {\n    const m1 = this.map.get(key1);\n    if (!m1) return false;\n    const m2 = m1.get(key2);\n    if (!m2) return false;\n    const result = m2.delete(key3);\n    if (m2.size === 0) {\n      m1.delete(key2);\n      if (m1.size === 0) {\n        this.map.delete(key1);\n      }\n    }\n    return result;\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  forEach(callback: (value: V, key1: K1, key2: K2, key3: K3) => void): void {\n    this.map.forEach((m, key1) =>\n      m.forEach((m2, key2) => m2.forEach((value, key3) => callback(value, key1, key2, key3))),\n    );\n  }\n\n  *keys(): IterableIterator<[K1, K2, K3]> {\n    for (const [key1, m1] of this.map) {\n      for (const [key2, m2] of m1) {\n        for (const key3 of m2.keys()) {\n          yield [key1, key2, key3];\n        }\n      }\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    for (const m1 of this.map.values()) {\n      for (const m2 of m1.values()) {\n        yield* m2.values();\n      }\n    }\n  }\n\n  *entries(): IterableIterator<[K1, K2, K3, V]> {\n    for (const [key1, m1] of this.map) {\n      for (const [key2, m2] of m1) {\n        for (const [key3, value] of m2) {\n          yield [key1, key2, key3, value];\n        }\n      }\n    }\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K1, K2, K3, V]> {\n    yield* this.entries();\n  }\n}\n"],"mappings":"AACA,MAAaA,GAAsB,EAAgB,EAAQ,KACpDC,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKC,CAAK,EAEbF,EAAI,IAAIC,CAAG,GAGPE,GAA8B,EAAgB,EAAQ,KAC5DH,EAAI,IAAIC,CAAG,GACdD,EAAI,IAAIC,EAAKG,EAAQH,CAAG,CAAC,EAEpBD,EAAI,IAAIC,CAAG,GCVdI,sBAAqB,IAAI,IAS/B,IAAaC,EAAb,KAAiD,CAC/C,oBAAc,IAAI,IAElB,IAAI,MAAe,CACjB,IAAIC,EAAQ,EAEZ,OADA,KAAK,IAAI,QAAS,GAAO,GAASC,EAAE,IAAK,EAClCD,CACT,CAEA,IAAI,EAAU,EAAU,EAAgB,CAEtC,OADAJ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,CAAC,CAAC,IAAIK,EAAMR,CAAK,EAC3D,IACT,CAEA,IAAI,EAAU,EAAyB,CACrC,OAAO,KAAK,IAAI,IAAIO,CAAI,CAAC,EAAE,IAAIC,CAAI,CACrC,CAEA,YAAY,EAAU,EAAU,EAAa,CAC3C,IAAMF,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAON,EAAaS,EAAGE,EAAMR,CAAK,CACpC,CAEA,oBAAoB,EAAU,EAAU,EAAuC,CAC7E,IAAMM,EAAIL,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAC3D,OAAOF,EAAqBK,EAAGE,MAAYN,EAAQK,EAAMC,CAAI,CAAC,CAChE,CAEA,IAAI,EAAU,EAAmB,CAC/B,OAAO,KAAK,IAAI,IAAID,CAAI,CAAC,EAAE,IAAIC,CAAI,GAAK,EAC1C,CAEA,OAAO,EAAU,EAAmB,CAClC,IAAMF,EAAI,KAAK,IAAI,IAAIC,CAAI,EAC3B,GAAI,CAACD,EACH,MAAO,GAET,IAAMG,EAASH,EAAE,OAAOE,CAAI,EAI5B,OAHIF,EAAE,OAAS,GACb,KAAK,IAAI,OAAOC,CAAI,EAEfE,CACT,CAEA,OAAc,CACZ,KAAK,IAAI,MAAM,CACjB,CAEA,QAAQ,EAAwD,CAC9D,KAAK,IAAI,SAAS,EAAG,IAASH,EAAE,SAAS,EAAO,IAASI,EAASV,EAAOO,EAAMC,CAAI,CAAC,CAAC,CACvF,CAEA,CAAC,MAAmC,CAClC,IAAK,GAAM,CAACD,EAAMD,KAAM,KAAK,IAC3B,IAAK,IAAME,KAAQF,EAAE,KAAK,EACxB,KAAM,CAACC,EAAMC,CAAI,CAGvB,CAEA,CAAC,QAA8B,CAC7B,IAAK,IAAMF,KAAK,KAAK,IAAI,OAAO,EAC9B,MAAOA,EAAE,OAAO,CAEpB,CAEA,CAAC,SAAyC,CACxC,IAAK,GAAM,CAACC,EAAMD,KAAM,KAAK,IAC3B,IAAK,GAAM,CAACE,EAAMR,KAAUM,EAC1B,KAAM,CAACC,EAAMC,EAAMR,CAAK,CAG9B,CAEA,EAAE,OAAO,WAA2C,CAClD,MAAO,KAAK,QAAQ,CACtB,CACF,EAUaW,EAAb,KAA4D,CAC1D,oBAAc,IAAI,IAElB,IAAI,MAAe,CACjB,IAAIN,EAAQ,EAEZ,OADA,KAAK,IAAI,QAAS,GAAMC,EAAE,QAAS,GAAQ,GAASM,EAAG,IAAK,CAAC,EACtDP,CACT,CAEA,IAAI,EAAU,EAAU,EAAU,EAAgB,CAChD,IAAMQ,EAAKZ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EAE5D,OADAF,EAAqBY,EAAIL,EAAML,CAAY,CAAC,CAAC,IAAIW,EAAMd,CAAK,EACrD,IACT,CAEA,IAAI,EAAU,EAAU,EAAyB,CAC/C,OAAO,KAAK,IAAI,IAAIO,CAAI,CAAC,EAAE,IAAIC,CAAI,CAAC,EAAE,IAAIM,CAAI,CAChD,CAEA,YAAY,EAAU,EAAU,EAAU,EAAa,CACrD,IAAMD,EAAKZ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EACtDS,EAAKX,EAAqBY,EAAIL,EAAML,CAAY,EACtD,OAAON,EAAae,EAAIE,EAAMd,CAAK,CACrC,CAEA,oBAAoB,EAAU,EAAU,EAAU,EAAiD,CACjG,IAAMa,EAAKZ,EAAqB,KAAK,IAAKM,EAAMJ,CAAY,EACtDS,EAAKX,EAAqBY,EAAIL,EAAML,CAAY,EACtD,OAAOF,EAAqBW,EAAIE,MAAYZ,EAAQK,EAAMC,EAAMM,CAAI,CAAC,CACvE,CAEA,IAAI,EAAU,EAAU,EAAmB,CACzC,OAAO,KAAK,IAAI,IAAIP,CAAI,CAAC,EAAE,IAAIC,CAAI,CAAC,EAAE,IAAIM,CAAI,GAAK,EACrD,CAEA,OAAO,EAAU,EAAU,EAAmB,CAC5C,IAAMD,EAAK,KAAK,IAAI,IAAIN,CAAI,EAC5B,GAAI,CAACM,EAAI,MAAO,GAChB,IAAMD,EAAKC,EAAG,IAAIL,CAAI,EACtB,GAAI,CAACI,EAAI,MAAO,GAChB,IAAMH,EAASG,EAAG,OAAOE,CAAI,EAO7B,OANIF,EAAG,OAAS,IACdC,EAAG,OAAOL,CAAI,EACVK,EAAG,OAAS,GACd,KAAK,IAAI,OAAON,CAAI,GAGjBE,CACT,CAEA,OAAc,CACZ,KAAK,IAAI,MAAM,CACjB,CAEA,QAAQ,EAAkE,CACxE,KAAK,IAAI,SAAS,EAAG,IACnBH,EAAE,SAAS,EAAI,IAASM,EAAG,SAAS,EAAO,IAASF,EAASV,EAAOO,EAAMC,EAAMM,CAAI,CAAC,CAAC,CACxF,CACF,CAEA,CAAC,MAAuC,CACtC,IAAK,GAAM,CAACP,EAAMM,KAAO,KAAK,IAC5B,IAAK,GAAM,CAACL,EAAMI,KAAOC,EACvB,IAAK,IAAMC,KAAQF,EAAG,KAAK,EACzB,KAAM,CAACL,EAAMC,EAAMM,CAAI,CAI/B,CAEA,CAAC,QAA8B,CAC7B,IAAK,IAAMD,KAAM,KAAK,IAAI,OAAO,EAC/B,IAAK,IAAMD,KAAMC,EAAG,OAAO,EACzB,MAAOD,EAAG,OAAO,CAGvB,CAEA,CAAC,SAA6C,CAC5C,IAAK,GAAM,CAACL,EAAMM,KAAO,KAAK,IAC5B,IAAK,GAAM,CAACL,EAAMI,KAAOC,EACvB,IAAK,GAAM,CAACC,EAAMd,KAAUY,EAC1B,KAAM,CAACL,EAAMC,EAAMM,EAAMd,CAAK,CAItC,CAEA,EAAE,OAAO,WAA+C,CACtD,MAAO,KAAK,QAAQ,CACtB,CACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "duo-map",
-  "version": "0.0.2",
+  "version": "0.1.0",
   "author": {
     "name": "KasukabeTsumugi",
     "email": "futami16237@gmail.com"
@@ -46,4 +46,4 @@
   },
   "homepage": "https://github.com/baendlorel/tsumugi-lib/tree/main/packages/duo-map#readme",
   "devDependencies": {}
-}
+}