@tanstack/db-ivm 0.1.6 → 0.1.8

package/dist/cjs/d2.cjs

@@ -15,13 +15,12 @@ var __privateWrapper = (obj, member, setter, getter) => ({
     return __privateGet(obj, member, getter);
   }
 });
-var _streams, _operators, _nextOperatorId, _finalized, _D2_instances, checkNotFinalized_fn, _graph, _writer;
+var _operators, _nextOperatorId, _finalized, _D2_instances, checkNotFinalized_fn, _graph, _writer;
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const graph = require("./graph.cjs");
 class D2 {
   constructor() {
     __privateAdd(this, _D2_instances);
-    __privateAdd(this, _streams, []);
     __privateAdd(this, _operators, []);
     __privateAdd(this, _nextOperatorId, 0);
     __privateAdd(this, _finalized, false);
@@ -34,17 +33,12 @@ class D2 {
     __privateMethod(this, _D2_instances, checkNotFinalized_fn).call(this);
     const writer = new graph.DifferenceStreamWriter();
     const streamBuilder = new RootStreamBuilder(this, writer);
-    __privateGet(this, _streams).push(streamBuilder.connectReader());
     return streamBuilder;
   }
   addOperator(operator) {
     __privateMethod(this, _D2_instances, checkNotFinalized_fn).call(this);
     __privateGet(this, _operators).push(operator);
   }
-  addStream(stream) {
-    __privateMethod(this, _D2_instances, checkNotFinalized_fn).call(this);
-    __privateGet(this, _streams).push(stream);
-  }
   finalize() {
     __privateMethod(this, _D2_instances, checkNotFinalized_fn).call(this);
     __privateSet(this, _finalized, true);
@@ -66,7 +60,6 @@ class D2 {
     }
   }
 }
-_streams = new WeakMap();
 _operators = new WeakMap();
 _nextOperatorId = new WeakMap();
 _finalized = new WeakMap();

package/dist/cjs/d2.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"d2.cjs","sources":["../../src/d2.ts"],"sourcesContent":["import { DifferenceStreamWriter } from \"./graph.js\"\nimport type {\n  BinaryOperator,\n  DifferenceStreamReader,\n  UnaryOperator,\n} from \"./graph.js\"\nimport type { MultiSet, MultiSetArray } from \"./multiset.js\"\nimport type { ID2, IStreamBuilder, PipedOperator } from \"./types.js\"\n\nexport class D2 implements ID2 {\n  #streams: Array<DifferenceStreamReader<any>> = []\n  #operators: Array<UnaryOperator<any> | BinaryOperator<any>> = []\n  #nextOperatorId = 0\n  #finalized = false\n\n  constructor() {}\n\n  #checkNotFinalized(): void {\n    if (this.#finalized) {\n      throw new Error(`Graph already finalized`)\n    }\n  }\n\n  getNextOperatorId(): number {\n    this.#checkNotFinalized()\n    return this.#nextOperatorId++\n  }\n\n  newInput<T>(): RootStreamBuilder<T> {\n    this.#checkNotFinalized()\n    const writer = new DifferenceStreamWriter<T>()\n    // Use the root stream builder that exposes the sendData and sendFrontier methods\n    const streamBuilder = new RootStreamBuilder<T>(this, writer)\n    this.#streams.push(streamBuilder.connectReader())\n    return streamBuilder\n  }\n\n  addOperator(operator: UnaryOperator<any> | BinaryOperator<any>): void {\n    this.#checkNotFinalized()\n    this.#operators.push(operator)\n  }\n\n  addStream(stream: DifferenceStreamReader<any>): void {\n    this.#checkNotFinalized()\n    this.#streams.push(stream)\n  }\n\n  finalize() {\n    this.#checkNotFinalized()\n    this.#finalized = true\n  }\n\n  step(): void {\n    if (!this.#finalized) {\n      throw new Error(`Graph not finalized`)\n    }\n    for (const op of this.#operators) {\n      op.run()\n    }\n  }\n\n  pendingWork(): boolean {\n    return this.#operators.some((op) => op.hasPendingWork())\n  }\n\n  run(): void {\n    while (this.pendingWork()) {\n      this.step()\n    }\n  }\n}\n\nexport class StreamBuilder<T> implements IStreamBuilder<T> {\n  #graph: ID2\n  #writer: DifferenceStreamWriter<T>\n\n  constructor(graph: ID2, writer: DifferenceStreamWriter<T>) {\n    this.#graph = graph\n    this.#writer = writer\n  }\n\n  connectReader(): DifferenceStreamReader<T> {\n    return this.#writer.newReader()\n  }\n\n  get writer(): DifferenceStreamWriter<T> {\n    return this.#writer\n  }\n\n  get graph(): ID2 {\n    return this.#graph\n  }\n\n  // Don't judge, this is the only way to type this function.\n  // rxjs has very similar code to type its pipe function\n  // https://github.com/ReactiveX/rxjs/blob/master/packages/rxjs/src/internal/util/pipe.ts\n  // We go to 20 operators deep, because surly that's enough for anyone...\n  // A user can always split the pipe into multiple pipes to get around this.\n  pipe<O>(o1: PipedOperator<T, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, T18>, o18: PipedOperator<T18, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, T18>, o18: PipedOperator<T18, T19>, o19: PipedOperator<T19, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, T18>, o18: PipedOperator<T18, T19>, o19: PipedOperator<T19, T20>, o20: PipedOperator<T20, O>): IStreamBuilder<O>\n\n  pipe(...operators: Array<PipedOperator<any, any>>): IStreamBuilder<any> {\n    return operators.reduce((stream, operator) => {\n      return operator(stream)\n    }, this as IStreamBuilder<any>)\n  }\n}\n\nexport class RootStreamBuilder<T> extends StreamBuilder<T> {\n  sendData(collection: MultiSet<T> | MultiSetArray<T>): void {\n    this.writer.sendData(collection)\n  }\n}\n"],"names":["DifferenceStreamWriter","graph"],"mappings":";;;;;;;;;;;;;;;;;;;;AASO,MAAM,GAAkB;AAAA,EAM7B,cAAc;AANT;AACL,iCAA+C,CAAA;AAC/C,mCAA8D,CAAA;AAC9D,wCAAkB;AAClB,mCAAa;AAAA,EAEE;AAAA,EAQf,oBAA4B;AAC1B,0BAAK,qCAAL;AACA,WAAO,uBAAK,iBAAL;AAAA,EACT;AAAA,EAEA,WAAoC;AAClC,0BAAK,qCAAL;AACA,UAAM,SAAS,IAAIA,6BAAA;AAEnB,UAAM,gBAAgB,IAAI,kBAAqB,MAAM,MAAM;AAC3D,uBAAK,UAAS,KAAK,cAAc,cAAA,CAAe;AAChD,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,UAA0D;AACpE,0BAAK,qCAAL;AACA,uBAAK,YAAW,KAAK,QAAQ;AAAA,EAC/B;AAAA,EAEA,UAAU,QAA2C;AACnD,0BAAK,qCAAL;AACA,uBAAK,UAAS,KAAK,MAAM;AAAA,EAC3B;AAAA,EAEA,WAAW;AACT,0BAAK,qCAAL;AACA,uBAAK,YAAa;AAAA,EACpB;AAAA,EAEA,OAAa;AACX,QAAI,CAAC,mBAAK,aAAY;AACpB,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AACA,eAAW,MAAM,mBAAK,aAAY;AAChC,SAAG,IAAA;AAAA,IACL;AAAA,EACF;AAAA,EAEA,cAAuB;AACrB,WAAO,mBAAK,YAAW,KAAK,CAAC,OAAO,GAAG,gBAAgB;AAAA,EACzD;AAAA,EAEA,MAAY;AACV,WAAO,KAAK,eAAe;AACzB,WAAK,KAAA;AAAA,IACP;AAAA,EACF;AACF;AA5DE;AACA;AACA;AACA;AAJK;AAQL,uBAAA,WAA2B;AACzB,MAAI,mBAAK,aAAY;AACnB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AACF;AAmDK,MAAM,cAA8C;AAAA,EAIzD,YAAYC,QAAY,QAAmC;AAH3D;AACA;AAGE,uBAAK,QAASA;AACd,uBAAK,SAAU;AAAA,EACjB;AAAA,EAEA,gBAA2C;AACzC,WAAO,mBAAK,SAAQ,UAAA;AAAA,EACtB;AAAA,EAEA,IAAI,SAAoC;AACtC,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,QAAa;AACf,WAAO,mBAAK;AAAA,EACd;AAAA,EA+CA,QAAQ,WAAgE;AACtE,WAAO,UAAU,OAAO,CAAC,QAAQ,aAAa;AAC5C,aAAO,SAAS,MAAM;AAAA,IACxB,GAAG,IAA2B;AAAA,EAChC;AACF;AAtEE;AACA;AAuEK,MAAM,0BAA6B,cAAiB;AAAA,EACzD,SAAS,YAAkD;AACzD,SAAK,OAAO,SAAS,UAAU;AAAA,EACjC;AACF;;;;"}
+{"version":3,"file":"d2.cjs","sources":["../../src/d2.ts"],"sourcesContent":["import { DifferenceStreamWriter } from \"./graph.js\"\nimport type {\n  BinaryOperator,\n  DifferenceStreamReader,\n  UnaryOperator,\n} from \"./graph.js\"\nimport type { MultiSet, MultiSetArray } from \"./multiset.js\"\nimport type { ID2, IStreamBuilder, PipedOperator } from \"./types.js\"\n\nexport class D2 implements ID2 {\n  #operators: Array<UnaryOperator<any> | BinaryOperator<any>> = []\n  #nextOperatorId = 0\n  #finalized = false\n\n  constructor() {}\n\n  #checkNotFinalized(): void {\n    if (this.#finalized) {\n      throw new Error(`Graph already finalized`)\n    }\n  }\n\n  getNextOperatorId(): number {\n    this.#checkNotFinalized()\n    return this.#nextOperatorId++\n  }\n\n  newInput<T>(): RootStreamBuilder<T> {\n    this.#checkNotFinalized()\n    const writer = new DifferenceStreamWriter<T>()\n    // Use the root stream builder that exposes the sendData and sendFrontier methods\n    const streamBuilder = new RootStreamBuilder<T>(this, writer)\n    return streamBuilder\n  }\n\n  addOperator(operator: UnaryOperator<any> | BinaryOperator<any>): void {\n    this.#checkNotFinalized()\n    this.#operators.push(operator)\n  }\n\n  finalize() {\n    this.#checkNotFinalized()\n    this.#finalized = true\n  }\n\n  step(): void {\n    if (!this.#finalized) {\n      throw new Error(`Graph not finalized`)\n    }\n    for (const op of this.#operators) {\n      op.run()\n    }\n  }\n\n  pendingWork(): boolean {\n    return this.#operators.some((op) => op.hasPendingWork())\n  }\n\n  run(): void {\n    while (this.pendingWork()) {\n      this.step()\n    }\n  }\n}\n\nexport class StreamBuilder<T> implements IStreamBuilder<T> {\n  #graph: ID2\n  #writer: DifferenceStreamWriter<T>\n\n  constructor(graph: ID2, writer: DifferenceStreamWriter<T>) {\n    this.#graph = graph\n    this.#writer = writer\n  }\n\n  connectReader(): DifferenceStreamReader<T> {\n    return this.#writer.newReader()\n  }\n\n  get writer(): DifferenceStreamWriter<T> {\n    return this.#writer\n  }\n\n  get graph(): ID2 {\n    return this.#graph\n  }\n\n  // Don't judge, this is the only way to type this function.\n  // rxjs has very similar code to type its pipe function\n  // https://github.com/ReactiveX/rxjs/blob/master/packages/rxjs/src/internal/util/pipe.ts\n  // We go to 20 operators deep, because surly that's enough for anyone...\n  // A user can always split the pipe into multiple pipes to get around this.\n  pipe<O>(o1: PipedOperator<T, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, T18>, o18: PipedOperator<T18, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, T18>, o18: PipedOperator<T18, T19>, o19: PipedOperator<T19, O>): IStreamBuilder<O>\n  // prettier-ignore\n  pipe<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, O>(o1: PipedOperator<T, T2>, o2: PipedOperator<T2, T3>, o3: PipedOperator<T3, T4>, o4: PipedOperator<T4, T5>, o5: PipedOperator<T5, T6>, o6: PipedOperator<T6, T7>, o7: PipedOperator<T7, T8>, o8: PipedOperator<T8, T9>, o9: PipedOperator<T9, T10>, o10: PipedOperator<T10, T11>, o11: PipedOperator<T11, T12>, o12: PipedOperator<T12, T13>, o13: PipedOperator<T13, T14>, o14: PipedOperator<T14, T15>, o15: PipedOperator<T15, T16>, o16: PipedOperator<T16, T17>, o17: PipedOperator<T17, T18>, o18: PipedOperator<T18, T19>, o19: PipedOperator<T19, T20>, o20: PipedOperator<T20, O>): IStreamBuilder<O>\n\n  pipe(...operators: Array<PipedOperator<any, any>>): IStreamBuilder<any> {\n    return operators.reduce((stream, operator) => {\n      return operator(stream)\n    }, this as IStreamBuilder<any>)\n  }\n}\n\nexport class RootStreamBuilder<T> extends StreamBuilder<T> {\n  sendData(collection: MultiSet<T> | MultiSetArray<T>): void {\n    this.writer.sendData(collection)\n  }\n}\n"],"names":["DifferenceStreamWriter","graph"],"mappings":";;;;;;;;;;;;;;;;;;;;AASO,MAAM,GAAkB;AAAA,EAK7B,cAAc;AALT;AACL,mCAA8D,CAAA;AAC9D,wCAAkB;AAClB,mCAAa;AAAA,EAEE;AAAA,EAQf,oBAA4B;AAC1B,0BAAK,qCAAL;AACA,WAAO,uBAAK,iBAAL;AAAA,EACT;AAAA,EAEA,WAAoC;AAClC,0BAAK,qCAAL;AACA,UAAM,SAAS,IAAIA,6BAAA;AAEnB,UAAM,gBAAgB,IAAI,kBAAqB,MAAM,MAAM;AAC3D,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,UAA0D;AACpE,0BAAK,qCAAL;AACA,uBAAK,YAAW,KAAK,QAAQ;AAAA,EAC/B;AAAA,EAEA,WAAW;AACT,0BAAK,qCAAL;AACA,uBAAK,YAAa;AAAA,EACpB;AAAA,EAEA,OAAa;AACX,QAAI,CAAC,mBAAK,aAAY;AACpB,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AACA,eAAW,MAAM,mBAAK,aAAY;AAChC,SAAG,IAAA;AAAA,IACL;AAAA,EACF;AAAA,EAEA,cAAuB;AACrB,WAAO,mBAAK,YAAW,KAAK,CAAC,OAAO,GAAG,gBAAgB;AAAA,EACzD;AAAA,EAEA,MAAY;AACV,WAAO,KAAK,eAAe;AACzB,WAAK,KAAA;AAAA,IACP;AAAA,EACF;AACF;AArDE;AACA;AACA;AAHK;AAOL,uBAAA,WAA2B;AACzB,MAAI,mBAAK,aAAY;AACnB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AACF;AA6CK,MAAM,cAA8C;AAAA,EAIzD,YAAYC,QAAY,QAAmC;AAH3D;AACA;AAGE,uBAAK,QAASA;AACd,uBAAK,SAAU;AAAA,EACjB;AAAA,EAEA,gBAA2C;AACzC,WAAO,mBAAK,SAAQ,UAAA;AAAA,EACtB;AAAA,EAEA,IAAI,SAAoC;AACtC,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,QAAa;AACf,WAAO,mBAAK;AAAA,EACd;AAAA,EA+CA,QAAQ,WAAgE;AACtE,WAAO,UAAU,OAAO,CAAC,QAAQ,aAAa;AAC5C,aAAO,SAAS,MAAM;AAAA,IACxB,GAAG,IAA2B;AAAA,EAChC;AACF;AAtEE;AACA;AAuEK,MAAM,0BAA6B,cAAiB;AAAA,EACzD,SAAS,YAAkD;AACzD,SAAK,OAAO,SAAS,UAAU;AAAA,EACjC;AACF;;;;"}

package/dist/cjs/d2.d.cts

@@ -7,7 +7,6 @@ export declare class D2 implements ID2 {
     getNextOperatorId(): number;
     newInput<T>(): RootStreamBuilder<T>;
     addOperator(operator: UnaryOperator<any> | BinaryOperator<any>): void;
-    addStream(stream: DifferenceStreamReader<any>): void;
     finalize(): void;
     step(): void;
     pendingWork(): boolean;

package/dist/cjs/indexes.cjs

@@ -7,98 +7,228 @@ var __privateGet = (obj, member, getter) => (__accessCheck(obj, member, "read fr
 var __privateAdd = (obj, member, value) => member.has(obj) ? __typeError("Cannot add the same private member more than once") : member instanceof WeakSet ? member.add(obj) : member.set(obj, value);
 var __privateSet = (obj, member, value, setter) => (__accessCheck(obj, member, "write to private field"), setter ? setter.call(obj, value) : member.set(obj, value), value);
 var __privateMethod = (obj, member, method) => (__accessCheck(obj, member, "access private method"), method);
-var _valueIndex, _hashIndex, _Index_instances, entries_fn, entriesIterators_fn;
+var _inner, _Index_instances, handleSingleValueTransition_fn;
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const multiset = require("./multiset.cjs");
-const hashIndex = require("./hashIndex.cjs");
-const valueIndex = require("./valueIndex.cjs");
-const utils = require("./utils.cjs");
+const hash = require("./hashing/hash.cjs");
+const NO_PREFIX = Symbol(`NO_PREFIX`);
+class PrefixMap extends Map {
+  /**
+   * Add a value to the PrefixMap. Returns true if the map becomes empty after the operation.
+   */
+  addValue(value, multiplicity) {
+    if (multiplicity === 0) return this.size === 0;
+    const prefix = getPrefix(value);
+    const valueMapOrSingleValue = this.get(prefix);
+    if (isSingleValue(valueMapOrSingleValue)) {
+      const [currentValue, currentMultiplicity] = valueMapOrSingleValue;
+      const currentPrefix = getPrefix(currentValue);
+      if (currentPrefix !== prefix) {
+        throw new Error(`Mismatching prefixes, this should never happen`);
+      }
+      if (currentValue === value || hash.hash(currentValue) === hash.hash(value)) {
+        const newMultiplicity = currentMultiplicity + multiplicity;
+        if (newMultiplicity === 0) {
+          this.delete(prefix);
+        } else {
+          this.set(prefix, [value, newMultiplicity]);
+        }
+      } else {
+        const valueMap = new ValueMap();
+        valueMap.set(hash.hash(currentValue), valueMapOrSingleValue);
+        valueMap.set(hash.hash(value), [value, multiplicity]);
+        this.set(prefix, valueMap);
+      }
+    } else if (valueMapOrSingleValue === void 0) {
+      this.set(prefix, [value, multiplicity]);
+    } else {
+      const isEmpty = valueMapOrSingleValue.addValue(value, multiplicity);
+      if (isEmpty) {
+        this.delete(prefix);
+      }
+    }
+    return this.size === 0;
+  }
+}
+class ValueMap extends Map {
+  /**
+   * Add a value to the ValueMap. Returns true if the map becomes empty after the operation.
+   * @param value - The full value to store
+   * @param multiplicity - The multiplicity to add
+   * @param hashKey - Optional hash key to use instead of hashing the full value (used when in PrefixMap context)
+   */
+  addValue(value, multiplicity) {
+    if (multiplicity === 0) return this.size === 0;
+    const key = hash.hash(value);
+    const currentValue = this.get(key);
+    if (currentValue) {
+      const [, currentMultiplicity] = currentValue;
+      const newMultiplicity = currentMultiplicity + multiplicity;
+      if (newMultiplicity === 0) {
+        this.delete(key);
+      } else {
+        this.set(key, [value, newMultiplicity]);
+      }
+    } else {
+      this.set(key, [value, multiplicity]);
+    }
+    return this.size === 0;
+  }
+}
 class Index {
   constructor() {
     __privateAdd(this, _Index_instances);
     /*
-     * This is a hybrid Index that composes a ValueIndex and a HashIndex.
-     * Keys that have only one value are stored in the ValueIndex.
-     * Keys that have multiple values are stored in the HashIndex, the hash distinguishes between the values.
-     * This reduces the amount of hashes we need to compute since often times only a small portion of the keys are updated
-     * so we don't have to hash the keys that are never updated.
-     *
-     * Note: The `valueIndex` and `hashIndex` have disjoint keys.
-     *       When a key that has only one value gets a new distinct value,
-     *       it is added to the `hashIndex` and removed from the `valueIndex` and vice versa.
+     * This index maintains a nested map of keys -> (value, multiplicities), where:
+     * - initially the values are stored against the key as a single value tuple
+     * - when a key gets additional values, the values are stored against the key in a
+     *   prefix map
+     * - the prefix is extract where possible from values that are structured as
+     *   [rowPrimaryKey, rowValue], as they are in the Tanstack DB query pipeline.
+     * - only when there are multiple values for a given prefix do we fall back to a
+     *   hash to identify identical values, storing them in a third level value map.
      */
-    __privateAdd(this, _valueIndex);
-    __privateAdd(this, _hashIndex);
-    __privateSet(this, _valueIndex, new valueIndex.ValueIndex());
-    __privateSet(this, _hashIndex, new hashIndex.HashIndex());
+    __privateAdd(this, _inner);
+    __privateSet(this, _inner, /* @__PURE__ */ new Map());
   }
+  /**
+   * This method returns a string representation of the index.
+   * @param indent - Whether to indent the string representation.
+   * @returns A string representation of the index.
+   */
   toString(indent = false) {
-    return `Index(
-  ${__privateGet(this, _valueIndex).toString(indent)},
-  ${__privateGet(this, _hashIndex).toString(indent)}
-)`;
+    return `Index(${JSON.stringify(
+      [...this.entries()],
+      void 0,
+      indent ? 2 : void 0
+    )})`;
+  }
+  /**
+   * The size of the index.
+   */
+  get size() {
+    return __privateGet(this, _inner).size;
   }
+  /**
+   * This method checks if the index has a given key.
+   * @param key - The key to check.
+   * @returns True if the index has the key, false otherwise.
+   */
+  has(key) {
+    return __privateGet(this, _inner).has(key);
+  }
+  /**
+   * This method returns all values for a given key.
+   * @param key - The key to get the values for.
+   * @returns An array of value tuples [value, multiplicity].
+   */
   get(key) {
-    if (__privateGet(this, _valueIndex).has(key)) {
-      return [__privateGet(this, _valueIndex).get(key)];
-    }
-    return __privateGet(this, _hashIndex).get(key);
+    return [...this.getIterator(key)];
   }
-  getMultiplicity(key, value) {
-    if (__privateGet(this, _valueIndex).has(key)) {
-      return __privateGet(this, _valueIndex).getMultiplicity(key);
+  /**
+   * This method returns an iterator over all values for a given key.
+   * @param key - The key to get the values for.
+   * @returns An iterator of value tuples [value, multiplicity].
+   */
+  *getIterator(key) {
+    const mapOrSingleValue = __privateGet(this, _inner).get(key);
+    if (isSingleValue(mapOrSingleValue)) {
+      yield mapOrSingleValue;
+    } else if (mapOrSingleValue === void 0) {
+      return;
+    } else if (mapOrSingleValue instanceof ValueMap) {
+      for (const valueTuple of mapOrSingleValue.values()) {
+        yield valueTuple;
+      }
+    } else {
+      for (const singleValueOrValueMap of mapOrSingleValue.values()) {
+        if (isSingleValue(singleValueOrValueMap)) {
+          yield singleValueOrValueMap;
+        } else {
+          for (const valueTuple of singleValueOrValueMap.values()) {
+            yield valueTuple;
+          }
+        }
+      }
     }
-    return __privateGet(this, _hashIndex).getMultiplicity(key, value);
   }
-  has(key) {
-    return __privateGet(this, _valueIndex).has(key) || __privateGet(this, _hashIndex).has(key);
+  /**
+   * This returns an iterator that iterates over all key-value pairs.
+   * @returns An iterable of all key-value pairs (and their multiplicities) in the index.
+   */
+  *entries() {
+    for (const key of __privateGet(this, _inner).keys()) {
+      for (const valueTuple of this.getIterator(key)) {
+        yield [key, valueTuple];
+      }
+    }
   }
-  get size() {
-    return __privateGet(this, _valueIndex).size + __privateGet(this, _hashIndex).size;
-  }
-  addValue(key, value) {
-    const containedInValueIndex = __privateGet(this, _valueIndex).has(key);
-    const containedInHashIndex = __privateGet(this, _hashIndex).has(key);
-    if (containedInHashIndex && containedInValueIndex) {
-      throw new Error(
-        `Key ${key} is contained in both the value index and the hash index. This should never happen because they should have disjoint keysets.`
-      );
+  /**
+   * This method only iterates over the keys and not over the values.
+   * Hence, it is more efficient than the `#entries` method.
+   * It returns an iterator that you can use if you need to iterate over the values for a given key.
+   * @returns An iterator of all *keys* in the index and their corresponding value iterator.
+   */
+  *entriesIterators() {
+    for (const key of __privateGet(this, _inner).keys()) {
+      yield [key, this.getIterator(key)];
     }
-    if (!containedInValueIndex && !containedInHashIndex) {
-      __privateGet(this, _valueIndex).addValue(key, value);
+  }
+  /**
+   * This method adds a value to the index.
+   * @param key - The key to add the value to.
+   * @param valueTuple - The value tuple [value, multiplicity] to add to the index.
+   */
+  addValue(key, valueTuple) {
+    const [value, multiplicity] = valueTuple;
+    if (multiplicity === 0) return;
+    const mapOrSingleValue = __privateGet(this, _inner).get(key);
+    if (mapOrSingleValue === void 0) {
+      __privateGet(this, _inner).set(key, valueTuple);
       return;
     }
-    if (containedInValueIndex) {
-      try {
-        __privateGet(this, _valueIndex).addValue(key, value);
-      } catch {
-        const existingValue = __privateGet(this, _valueIndex).get(key);
-        __privateGet(this, _valueIndex).delete(key);
-        __privateGet(this, _hashIndex).addValue(key, existingValue);
-        __privateGet(this, _hashIndex).addValue(key, value);
-      }
+    if (isSingleValue(mapOrSingleValue)) {
+      __privateMethod(this, _Index_instances, handleSingleValueTransition_fn).call(this, key, mapOrSingleValue, value, multiplicity);
       return;
     }
-    if (containedInHashIndex) {
-      const singleRemainingValue = __privateGet(this, _hashIndex).addValue(key, value);
-      if (singleRemainingValue) {
-        __privateGet(this, _hashIndex).delete(key);
-        __privateGet(this, _valueIndex).addValue(key, singleRemainingValue);
+    if (mapOrSingleValue instanceof ValueMap) {
+      const prefix = getPrefix(value);
+      if (prefix !== NO_PREFIX) {
+        const prefixMap = new PrefixMap();
+        prefixMap.set(NO_PREFIX, mapOrSingleValue);
+        prefixMap.set(prefix, valueTuple);
+        __privateGet(this, _inner).set(key, prefixMap);
+      } else {
+        const isEmpty = mapOrSingleValue.addValue(value, multiplicity);
+        if (isEmpty) {
+          __privateGet(this, _inner).delete(key);
+        }
+      }
+    } else {
+      const isEmpty = mapOrSingleValue.addValue(value, multiplicity);
+      if (isEmpty) {
+        __privateGet(this, _inner).delete(key);
       }
-      return;
     }
   }
+  /**
+   * This method appends another index to the current index.
+   * @param other - The index to append to the current index.
+   */
   append(other) {
-    var _a;
-    for (const [key, value] of __privateMethod(_a = other, _Index_instances, entries_fn).call(_a)) {
+    for (const [key, value] of other.entries()) {
       this.addValue(key, value);
     }
   }
+  /**
+   * This method joins two indexes.
+   * @param other - The index to join with the current index.
+   * @returns A multiset of the joined values.
+   */
   join(other) {
-    var _a;
     const result = [];
     if (this.size <= other.size) {
-      for (const [key, valueIt] of __privateMethod(this, _Index_instances, entriesIterators_fn).call(this)) {
+      for (const [key, valueIt] of this.entriesIterators()) {
         if (!other.has(key)) continue;
         const otherValues = other.get(key);
         for (const [val1, mul1] of valueIt) {
@@ -110,7 +240,7 @@ class Index {
         }
       }
     } else {
-      for (const [key, otherValueIt] of __privateMethod(_a = other, _Index_instances, entriesIterators_fn).call(_a)) {
+      for (const [key, otherValueIt] of other.entriesIterators()) {
         if (!this.has(key)) continue;
         const values = this.get(key);
         for (const [val2, mul2] of otherValueIt) {
@@ -125,32 +255,60 @@ class Index {
     return new multiset.MultiSet(result);
   }
 }
-_valueIndex = new WeakMap();
-_hashIndex = new WeakMap();
+_inner = new WeakMap();
 _Index_instances = new WeakSet();
 /**
- * This returns an iterator that iterates over all key-value pairs.
- * @returns An iterable of all key-value pairs (and their multiplicities) in the index.
+ * Handle the transition from a single value to either a ValueMap or PrefixMap
  */
-entries_fn = function() {
-  return utils.concatIterable(
-    __privateGet(this, _valueIndex).entries(),
-    __privateGet(this, _hashIndex).entriesIterator()
-  );
-};
-entriesIterators_fn = function* () {
-  for (const [key, [value, multiplicity]] of __privateGet(this, _valueIndex).entries()) {
-    yield [key, /* @__PURE__ */ new Map([[value, multiplicity]])];
-  }
-  for (const [key, valueMap] of __privateGet(this, _hashIndex).entries()) {
-    yield [
-      key,
-      utils.mapIterable(valueMap, ([_hash, [value, multiplicity]]) => [
-        value,
-        multiplicity
-      ])
-    ];
+handleSingleValueTransition_fn = function(key, currentSingleValue, newValue, multiplicity) {
+  const [currentValue, currentMultiplicity] = currentSingleValue;
+  if (currentValue === newValue) {
+    const newMultiplicity = currentMultiplicity + multiplicity;
+    if (newMultiplicity === 0) {
+      __privateGet(this, _inner).delete(key);
+    } else {
+      __privateGet(this, _inner).set(key, [newValue, newMultiplicity]);
+    }
+    return;
+  }
+  const newPrefix = getPrefix(newValue);
+  const currentPrefix = getPrefix(currentValue);
+  if (currentPrefix === newPrefix && (currentValue === newValue || hash.hash(currentValue) === hash.hash(newValue))) {
+    const newMultiplicity = currentMultiplicity + multiplicity;
+    if (newMultiplicity === 0) {
+      __privateGet(this, _inner).delete(key);
+    } else {
+      __privateGet(this, _inner).set(key, [newValue, newMultiplicity]);
+    }
+    return;
+  }
+  if (currentPrefix === NO_PREFIX && newPrefix === NO_PREFIX) {
+    const valueMap = new ValueMap();
+    valueMap.set(hash.hash(currentValue), currentSingleValue);
+    valueMap.set(hash.hash(newValue), [newValue, multiplicity]);
+    __privateGet(this, _inner).set(key, valueMap);
+  } else {
+    const prefixMap = new PrefixMap();
+    if (currentPrefix === newPrefix) {
+      const valueMap = new ValueMap();
+      valueMap.set(hash.hash(currentValue), currentSingleValue);
+      valueMap.set(hash.hash(newValue), [newValue, multiplicity]);
+      prefixMap.set(currentPrefix, valueMap);
+    } else {
+      prefixMap.set(currentPrefix, currentSingleValue);
+      prefixMap.set(newPrefix, [newValue, multiplicity]);
+    }
+    __privateGet(this, _inner).set(key, prefixMap);
   }
 };
+function getPrefix(value) {
+  if (Array.isArray(value) && (typeof value[0] === `string` || typeof value[0] === `number` || typeof value[0] === `bigint`)) {
+    return value[0];
+  }
+  return NO_PREFIX;
+}
+function isSingleValue(value) {
+  return Array.isArray(value);
+}
 exports.Index = Index;
 //# sourceMappingURL=indexes.cjs.map

package/dist/cjs/indexes.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"indexes.cjs","sources":["../../src/indexes.ts"],"sourcesContent":["import { MultiSet } from \"./multiset.js\"\nimport { HashIndex } from \"./hashIndex.js\"\nimport { ValueIndex } from \"./valueIndex.js\"\nimport { concatIterable, mapIterable } from \"./utils.js\"\n\n/**\n * A map from a difference collection trace's keys -> (value, multiplicities) that changed.\n * Used in operations like join and reduce where the operation needs to\n * exploit the key-value structure of the data to run efficiently.\n */\nexport class Index<K, V> {\n  /*\n   * This is a hybrid Index that composes a ValueIndex and a HashIndex.\n   * Keys that have only one value are stored in the ValueIndex.\n   * Keys that have multiple values are stored in the HashIndex, the hash distinguishes between the values.\n   * This reduces the amount of hashes we need to compute since often times only a small portion of the keys are updated\n   * so we don't have to hash the keys that are never updated.\n   *\n   * Note: The `valueIndex` and `hashIndex` have disjoint keys.\n   *       When a key that has only one value gets a new distinct value,\n   *       it is added to the `hashIndex` and removed from the `valueIndex` and vice versa.\n   */\n  #valueIndex: ValueIndex<K, V>\n  #hashIndex: HashIndex<K, V>\n\n  constructor() {\n    this.#valueIndex = new ValueIndex<K, V>()\n    this.#hashIndex = new HashIndex<K, V>()\n  }\n\n  toString(indent = false): string {\n    return `Index(\\n  ${this.#valueIndex.toString(indent)},\\n  ${this.#hashIndex.toString(indent)}\\n)`\n  }\n\n  get(key: K): Array<[V, number]> {\n    if (this.#valueIndex.has(key)) {\n      return [this.#valueIndex.get(key)!]\n    }\n    return this.#hashIndex.get(key)\n  }\n\n  getMultiplicity(key: K, value: V): number {\n    if (this.#valueIndex.has(key)) {\n      return this.#valueIndex.getMultiplicity(key)\n    }\n    return this.#hashIndex.getMultiplicity(key, value)\n  }\n\n  /**\n   * This returns an iterator that iterates over all key-value pairs.\n   * @returns An iterable of all key-value pairs (and their multiplicities) in the index.\n   */\n  #entries(): Iterable<[K, [V, number]]> {\n    return concatIterable(\n      this.#valueIndex.entries(),\n      this.#hashIndex.entriesIterator()\n    )\n  }\n\n  /**\n   * This method only iterates over the keys and not over the values.\n   * Hence, it is more efficient than the `#entries` method.\n   * It returns an iterator that you can use if you need to iterate over the values for a given key.\n   * @returns An iterator of all *keys* in the index and their corresponding value iterator.\n   */\n  *#entriesIterators(): Iterable<[K, Iterable<[V, number]>]> {\n    for (const [key, [value, multiplicity]] of this.#valueIndex.entries()) {\n      yield [key, new Map<V, number>([[value, multiplicity]])]\n    }\n    for (const [key, valueMap] of this.#hashIndex.entries()) {\n      yield [\n        key,\n        mapIterable(valueMap, ([_hash, [value, multiplicity]]) => [\n          value,\n          multiplicity,\n        ]),\n      ]\n    }\n  }\n\n  has(key: K): boolean {\n    return this.#valueIndex.has(key) || this.#hashIndex.has(key)\n  }\n\n  get size(): number {\n    return this.#valueIndex.size + this.#hashIndex.size\n  }\n\n  addValue(key: K, value: [V, number]): void {\n    const containedInValueIndex = this.#valueIndex.has(key)\n    const containedInHashIndex = this.#hashIndex.has(key)\n\n    if (containedInHashIndex && containedInValueIndex) {\n      throw new Error(\n        `Key ${key} is contained in both the value index and the hash index. This should never happen because they should have disjoint keysets.`\n      )\n    }\n\n    if (!containedInValueIndex && !containedInHashIndex) {\n      // This is the first time we see the key\n      // Add it to the value index\n      this.#valueIndex.addValue(key, value)\n      return\n    }\n\n    if (containedInValueIndex) {\n      // This key is already in the value index\n      // It could be that it's the same value or a different one\n      // If it's a different value we will need to remove the key from the value index\n      // and add the key and its two values to the hash index\n      try {\n        this.#valueIndex.addValue(key, value)\n      } catch {\n        // This is a different value, need to move the key to the hash index\n        const existingValue = this.#valueIndex.get(key)!\n        this.#valueIndex.delete(key)\n        this.#hashIndex.addValue(key, existingValue)\n        this.#hashIndex.addValue(key, value)\n      }\n      return\n    }\n\n    if (containedInHashIndex) {\n      // This key is already in the hash index so it already has two or more values.\n      // However, this new value and multiplicity could cause an existing value to be removed\n      // and lead to the key having only a single value in which case we need to move it back to the value index\n      const singleRemainingValue = this.#hashIndex.addValue(key, value)\n      if (singleRemainingValue) {\n        // The key only has a single remaining value so we need to move it back to the value index\n        this.#hashIndex.delete(key)\n        this.#valueIndex.addValue(key, singleRemainingValue)\n      }\n      return\n    }\n  }\n\n  append(other: Index<K, V>): void {\n    for (const [key, value] of other.#entries()) {\n      this.addValue(key, value)\n    }\n  }\n\n  join<V2>(other: Index<K, V2>): MultiSet<[K, [V, V2]]> {\n    const result: Array<[[K, [V, V2]], number]> = []\n\n    // We want to iterate over the smaller of the two indexes to reduce the\n    // number of operations we need to do.\n    if (this.size <= other.size) {\n      for (const [key, valueIt] of this.#entriesIterators()) {\n        if (!other.has(key)) continue\n        const otherValues = other.get(key)\n        for (const [val1, mul1] of valueIt) {\n          for (const [val2, mul2] of otherValues) {\n            if (mul1 !== 0 && mul2 !== 0) {\n              result.push([[key, [val1, val2]], mul1 * mul2])\n            }\n          }\n        }\n      }\n    } else {\n      for (const [key, otherValueIt] of other.#entriesIterators()) {\n        if (!this.has(key)) continue\n        const values = this.get(key)\n        for (const [val2, mul2] of otherValueIt) {\n          for (const [val1, mul1] of values) {\n            if (mul1 !== 0 && mul2 !== 0) {\n              result.push([[key, [val1, val2]], mul1 * mul2])\n            }\n          }\n        }\n      }\n    }\n\n    return new MultiSet(result)\n  }\n}\n"],"names":["ValueIndex","HashIndex","MultiSet","concatIterable","mapIterable"],"mappings":";;;;;;;;;;;;;;;AAUO,MAAM,MAAY;AAAA,EAevB,cAAc;AAfT;AAYL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACA;AAGE,uBAAK,aAAc,IAAIA,sBAAA;AACvB,uBAAK,YAAa,IAAIC,oBAAA;AAAA,EACxB;AAAA,EAEA,SAAS,SAAS,OAAe;AAC/B,WAAO;AAAA,IAAa,mBAAK,aAAY,SAAS,MAAM,CAAC;AAAA,IAAQ,mBAAK,YAAW,SAAS,MAAM,CAAC;AAAA;AAAA,EAC/F;AAAA,EAEA,IAAI,KAA4B;AAC9B,QAAI,mBAAK,aAAY,IAAI,GAAG,GAAG;AAC7B,aAAO,CAAC,mBAAK,aAAY,IAAI,GAAG,CAAE;AAAA,IACpC;AACA,WAAO,mBAAK,YAAW,IAAI,GAAG;AAAA,EAChC;AAAA,EAEA,gBAAgB,KAAQ,OAAkB;AACxC,QAAI,mBAAK,aAAY,IAAI,GAAG,GAAG;AAC7B,aAAO,mBAAK,aAAY,gBAAgB,GAAG;AAAA,IAC7C;AACA,WAAO,mBAAK,YAAW,gBAAgB,KAAK,KAAK;AAAA,EACnD;AAAA,EAkCA,IAAI,KAAiB;AACnB,WAAO,mBAAK,aAAY,IAAI,GAAG,KAAK,mBAAK,YAAW,IAAI,GAAG;AAAA,EAC7D;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,mBAAK,aAAY,OAAO,mBAAK,YAAW;AAAA,EACjD;AAAA,EAEA,SAAS,KAAQ,OAA0B;AACzC,UAAM,wBAAwB,mBAAK,aAAY,IAAI,GAAG;AACtD,UAAM,uBAAuB,mBAAK,YAAW,IAAI,GAAG;AAEpD,QAAI,wBAAwB,uBAAuB;AACjD,YAAM,IAAI;AAAA,QACR,OAAO,GAAG;AAAA,MAAA;AAAA,IAEd;AAEA,QAAI,CAAC,yBAAyB,CAAC,sBAAsB;AAGnD,yBAAK,aAAY,SAAS,KAAK,KAAK;AACpC;AAAA,IACF;AAEA,QAAI,uBAAuB;AAKzB,UAAI;AACF,2BAAK,aAAY,SAAS,KAAK,KAAK;AAAA,MACtC,QAAQ;AAEN,cAAM,gBAAgB,mBAAK,aAAY,IAAI,GAAG;AAC9C,2BAAK,aAAY,OAAO,GAAG;AAC3B,2BAAK,YAAW,SAAS,KAAK,aAAa;AAC3C,2BAAK,YAAW,SAAS,KAAK,KAAK;AAAA,MACrC;AACA;AAAA,IACF;AAEA,QAAI,sBAAsB;AAIxB,YAAM,uBAAuB,mBAAK,YAAW,SAAS,KAAK,KAAK;AAChE,UAAI,sBAAsB;AAExB,2BAAK,YAAW,OAAO,GAAG;AAC1B,2BAAK,aAAY,SAAS,KAAK,oBAAoB;AAAA,MACrD;AACA;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,OAA0B;;AAC/B,eAAW,CAAC,KAAK,KAAK,KAAK,4BAAM,8BAAN,UAAkB;AAC3C,WAAK,SAAS,KAAK,KAAK;AAAA,IAC1B;AAAA,EACF;AAAA,EAEA,KAAS,OAA6C;;AACpD,UAAM,SAAwC,CAAA;AAI9C,QAAI,KAAK,QAAQ,MAAM,MAAM;AAC3B,iBAAW,CAAC,KAAK,OAAO,KAAK,sBAAK,uCAAL,YAA0B;AACrD,YAAI,CAAC,MAAM,IAAI,GAAG,EAAG;AACrB,cAAM,cAAc,MAAM,IAAI,GAAG;AACjC,mBAAW,CAAC,MAAM,IAAI,KAAK,SAAS;AAClC,qBAAW,CAAC,MAAM,IAAI,KAAK,aAAa;AACtC,gBAAI,SAAS,KAAK,SAAS,GAAG;AAC5B,qBAAO,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC;AAAA,YAChD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF,OAAO;AACL,iBAAW,CAAC,KAAK,YAAY,KAAK,4BAAM,uCAAN,UAA2B;AAC3D,YAAI,CAAC,KAAK,IAAI,GAAG,EAAG;AACpB,cAAM,SAAS,KAAK,IAAI,GAAG;AAC3B,mBAAW,CAAC,MAAM,IAAI,KAAK,cAAc;AACvC,qBAAW,CAAC,MAAM,IAAI,KAAK,QAAQ;AACjC,gBAAI,SAAS,KAAK,SAAS,GAAG;AAC5B,qBAAO,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC;AAAA,YAChD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO,IAAIC,SAAAA,SAAS,MAAM;AAAA,EAC5B;AACF;AAzJE;AACA;AAbK;AAAA;AAAA;AAAA;AAAA;AA0CL,aAAA,WAAuC;AACrC,SAAOC,MAAAA;AAAAA,IACL,mBAAK,aAAY,QAAA;AAAA,IACjB,mBAAK,YAAW,gBAAA;AAAA,EAAgB;AAEpC;AAQC,sBAAA,aAA0D;AACzD,aAAW,CAAC,KAAK,CAAC,OAAO,YAAY,CAAC,KAAK,mBAAK,aAAY,WAAW;AACrE,UAAM,CAAC,KAAK,oBAAI,IAAe,CAAC,CAAC,OAAO,YAAY,CAAC,CAAC,CAAC;AAAA,EACzD;AACA,aAAW,CAAC,KAAK,QAAQ,KAAK,mBAAK,YAAW,WAAW;AACvD,UAAM;AAAA,MACJ;AAAA,MACAC,MAAAA,YAAY,UAAU,CAAC,CAAC,OAAO,CAAC,OAAO,YAAY,CAAC,MAAM;AAAA,QACxD;AAAA,QACA;AAAA,MAAA,CACD;AAAA,IAAA;AAAA,EAEL;AACF;;"}
+{"version":3,"file":"indexes.cjs","sources":["../../src/indexes.ts"],"sourcesContent":["/**\n * # Optimized Index Data Structure\n *\n * Multi-level index that adapts storage strategy based on data patterns to minimize memory\n * usage, eliminate wasteful lookups, and avoid hashing whenever possible.\n *\n * ## Storage Strategy\n *\n * **Single value**: `IndexMap['key'] → [value, multiplicity]` (no hashing needed)\n *\n * **Multiple unprefixed values**: Direct ValueMap (avoids NO_PREFIX lookup)\n * ```\n * IndexMap['key'] → ValueMap { hash(value1) → [value1, mult1], ... }\n * ```\n *\n * **Values with prefixes**: PrefixMap uses prefix keys directly (no hashing)\n * ```\n * IndexMap['key'] → PrefixMap { 'prefix1' → [value1, mult1], NO_PREFIX → ValueMap{...} }\n * ```\n *\n * **Multiple values per prefix**: ValueMap within PrefixMap (hash only suffixes)\n * ```\n * PrefixMap['prefix'] → ValueMap { hash(suffix1) → [full_value1, mult1], ... }\n * ```\n *\n * ## Dynamic Evolution\n *\n * Structure automatically evolves as data is added:\n * - Single → ValueMap (when both values unprefixed)\n * - Single → PrefixMap (when at least one prefixed)\n * - ValueMap → PrefixMap (adding prefixed value to unprefixed)\n *\n * Prefixes extracted from array values: `['prefix', 'suffix']` → prefix='prefix'\n */\n\nimport { MultiSet } from \"./multiset.js\"\nimport { hash } from \"./hashing/index.js\"\nimport type { Hash } from \"./hashing/index.js\"\n\n// We use a symbol to represent the absence of a prefix, unprefixed values a stored\n// against this key.\nconst NO_PREFIX = Symbol(`NO_PREFIX`)\ntype NO_PREFIX = typeof NO_PREFIX\n\n// A single value is a tuple of the value and the multiplicity.\ntype SingleValue<TValue> = [TValue, number]\n\n// Base map type for the index. Stores single values, prefix maps, or value maps against a key.\ntype IndexMap<TKey, TValue, TPrefix> = Map<\n  TKey,\n  SingleValue<TValue> | PrefixMap<TValue, TPrefix> | ValueMap<TValue>\n>\n\n// Second level map type for the index, stores single values or value maps against a prefix.\nclass PrefixMap<TValue, TPrefix> extends Map<\n  TPrefix | NO_PREFIX,\n  SingleValue<TValue> | ValueMap<TValue>\n> {\n  /**\n   * Add a value to the PrefixMap. Returns true if the map becomes empty after the operation.\n   */\n  addValue(value: TValue, multiplicity: number): boolean {\n    if (multiplicity === 0) return this.size === 0\n\n    const prefix = getPrefix<TValue, TPrefix>(value)\n    const valueMapOrSingleValue = this.get(prefix)\n\n    if (isSingleValue(valueMapOrSingleValue)) {\n      const [currentValue, currentMultiplicity] = valueMapOrSingleValue\n      const currentPrefix = getPrefix<TValue, TPrefix>(currentValue)\n\n      if (currentPrefix !== prefix) {\n        throw new Error(`Mismatching prefixes, this should never happen`)\n      }\n\n      if (currentValue === value || hash(currentValue) === hash(value)) {\n        // Same value, update multiplicity\n        const newMultiplicity = currentMultiplicity + multiplicity\n        if (newMultiplicity === 0) {\n          this.delete(prefix)\n        } else {\n          this.set(prefix, [value, newMultiplicity])\n        }\n      } else {\n        // Different suffixes, need to create ValueMap\n        const valueMap = new ValueMap<TValue>()\n        valueMap.set(hash(currentValue), valueMapOrSingleValue)\n        valueMap.set(hash(value), [value, multiplicity])\n        this.set(prefix, valueMap)\n      }\n    } else if (valueMapOrSingleValue === undefined) {\n      // No existing value for this prefix\n      this.set(prefix, [value, multiplicity])\n    } else {\n      // Existing ValueMap\n      const isEmpty = valueMapOrSingleValue.addValue(value, multiplicity)\n      if (isEmpty) {\n        this.delete(prefix)\n      }\n    }\n\n    return this.size === 0\n  }\n}\n\n// Third level map type for the index, stores single values or value maps against a hash.\nclass ValueMap<TValue> extends Map<Hash, [TValue, number]> {\n  /**\n   * Add a value to the ValueMap. Returns true if the map becomes empty after the operation.\n   * @param value - The full value to store\n   * @param multiplicity - The multiplicity to add\n   * @param hashKey - Optional hash key to use instead of hashing the full value (used when in PrefixMap context)\n   */\n  addValue(value: TValue, multiplicity: number): boolean {\n    if (multiplicity === 0) return this.size === 0\n\n    const key = hash(value)\n    const currentValue = this.get(key)\n\n    if (currentValue) {\n      const [, currentMultiplicity] = currentValue\n      const newMultiplicity = currentMultiplicity + multiplicity\n      if (newMultiplicity === 0) {\n        this.delete(key)\n      } else {\n        this.set(key, [value, newMultiplicity])\n      }\n    } else {\n      this.set(key, [value, multiplicity])\n    }\n\n    return this.size === 0\n  }\n}\n\n/**\n * A map from a difference collection trace's keys -> (value, multiplicities) that changed.\n * Used in operations like join and reduce where the operation needs to\n * exploit the key-value structure of the data to run efficiently.\n */\nexport class Index<TKey, TValue, TPrefix = any> {\n  /*\n   * This index maintains a nested map of keys -> (value, multiplicities), where:\n   * - initially the values are stored against the key as a single value tuple\n   * - when a key gets additional values, the values are stored against the key in a\n   *   prefix map\n   * - the prefix is extract where possible from values that are structured as\n   *   [rowPrimaryKey, rowValue], as they are in the Tanstack DB query pipeline.\n   * - only when there are multiple values for a given prefix do we fall back to a\n   *   hash to identify identical values, storing them in a third level value map.\n   */\n  #inner: IndexMap<TKey, TValue, TPrefix>\n\n  constructor() {\n    this.#inner = new Map()\n  }\n\n  /**\n   * This method returns a string representation of the index.\n   * @param indent - Whether to indent the string representation.\n   * @returns A string representation of the index.\n   */\n  toString(indent = false): string {\n    return `Index(${JSON.stringify(\n      [...this.entries()],\n      undefined,\n      indent ? 2 : undefined\n    )})`\n  }\n\n  /**\n   * The size of the index.\n   */\n  get size(): number {\n    return this.#inner.size\n  }\n\n  /**\n   * This method checks if the index has a given key.\n   * @param key - The key to check.\n   * @returns True if the index has the key, false otherwise.\n   */\n  has(key: TKey): boolean {\n    return this.#inner.has(key)\n  }\n\n  /**\n   * This method returns all values for a given key.\n   * @param key - The key to get the values for.\n   * @returns An array of value tuples [value, multiplicity].\n   */\n  get(key: TKey): Array<[TValue, number]> {\n    return [...this.getIterator(key)]\n  }\n\n  /**\n   * This method returns an iterator over all values for a given key.\n   * @param key - The key to get the values for.\n   * @returns An iterator of value tuples [value, multiplicity].\n   */\n  *getIterator(key: TKey): Iterable<[TValue, number]> {\n    const mapOrSingleValue = this.#inner.get(key)\n    if (isSingleValue(mapOrSingleValue)) {\n      yield mapOrSingleValue\n    } else if (mapOrSingleValue === undefined) {\n      return\n    } else if (mapOrSingleValue instanceof ValueMap) {\n      // Direct ValueMap - all values have NO_PREFIX\n      for (const valueTuple of mapOrSingleValue.values()) {\n        yield valueTuple\n      }\n    } else {\n      // PrefixMap - iterate through all prefixes\n      for (const singleValueOrValueMap of mapOrSingleValue.values()) {\n        if (isSingleValue(singleValueOrValueMap)) {\n          yield singleValueOrValueMap\n        } else {\n          for (const valueTuple of singleValueOrValueMap.values()) {\n            yield valueTuple\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * This returns an iterator that iterates over all key-value pairs.\n   * @returns An iterable of all key-value pairs (and their multiplicities) in the index.\n   */\n  *entries(): Iterable<[TKey, [TValue, number]]> {\n    for (const key of this.#inner.keys()) {\n      for (const valueTuple of this.getIterator(key)) {\n        yield [key, valueTuple]\n      }\n    }\n  }\n\n  /**\n   * This method only iterates over the keys and not over the values.\n   * Hence, it is more efficient than the `#entries` method.\n   * It returns an iterator that you can use if you need to iterate over the values for a given key.\n   * @returns An iterator of all *keys* in the index and their corresponding value iterator.\n   */\n  *entriesIterators(): Iterable<[TKey, Iterable<[TValue, number]>]> {\n    for (const key of this.#inner.keys()) {\n      yield [key, this.getIterator(key)]\n    }\n  }\n\n  /**\n   * This method adds a value to the index.\n   * @param key - The key to add the value to.\n   * @param valueTuple - The value tuple [value, multiplicity] to add to the index.\n   */\n  addValue(key: TKey, valueTuple: SingleValue<TValue>) {\n    const [value, multiplicity] = valueTuple\n    // If the multiplicity is 0, do nothing\n    if (multiplicity === 0) return\n\n    const mapOrSingleValue = this.#inner.get(key)\n\n    if (mapOrSingleValue === undefined) {\n      // First value for this key\n      this.#inner.set(key, valueTuple)\n      return\n    }\n\n    if (isSingleValue(mapOrSingleValue)) {\n      // Handle transition from single value to map\n      this.#handleSingleValueTransition(\n        key,\n        mapOrSingleValue,\n        value,\n        multiplicity\n      )\n      return\n    }\n\n    if (mapOrSingleValue instanceof ValueMap) {\n      // Handle existing ValueMap\n      const prefix = getPrefix<TValue, TPrefix>(value)\n      if (prefix !== NO_PREFIX) {\n        // Convert ValueMap to PrefixMap since we have a prefixed value\n        const prefixMap = new PrefixMap<TValue, TPrefix>()\n        prefixMap.set(NO_PREFIX, mapOrSingleValue)\n        prefixMap.set(prefix, valueTuple)\n        this.#inner.set(key, prefixMap)\n      } else {\n        // Add to existing ValueMap\n        const isEmpty = mapOrSingleValue.addValue(value, multiplicity)\n        if (isEmpty) {\n          this.#inner.delete(key)\n        }\n      }\n    } else {\n      // Handle existing PrefixMap\n      const isEmpty = mapOrSingleValue.addValue(value, multiplicity)\n      if (isEmpty) {\n        this.#inner.delete(key)\n      }\n    }\n  }\n\n  /**\n   * Handle the transition from a single value to either a ValueMap or PrefixMap\n   */\n  #handleSingleValueTransition(\n    key: TKey,\n    currentSingleValue: SingleValue<TValue>,\n    newValue: TValue,\n    multiplicity: number\n  ) {\n    const [currentValue, currentMultiplicity] = currentSingleValue\n\n    // Check for exact same value (reference equality)\n    if (currentValue === newValue) {\n      const newMultiplicity = currentMultiplicity + multiplicity\n      if (newMultiplicity === 0) {\n        this.#inner.delete(key)\n      } else {\n        this.#inner.set(key, [newValue, newMultiplicity])\n      }\n      return\n    }\n\n    // Get prefixes for both values\n    const newPrefix = getPrefix<TValue, TPrefix>(newValue)\n    const currentPrefix = getPrefix<TValue, TPrefix>(currentValue)\n\n    // Check if they're the same value by prefix/suffix comparison\n    if (\n      currentPrefix === newPrefix &&\n      (currentValue === newValue || hash(currentValue) === hash(newValue))\n    ) {\n      const newMultiplicity = currentMultiplicity + multiplicity\n      if (newMultiplicity === 0) {\n        this.#inner.delete(key)\n      } else {\n        this.#inner.set(key, [newValue, newMultiplicity])\n      }\n      return\n    }\n\n    // Different values - choose appropriate map type\n    if (currentPrefix === NO_PREFIX && newPrefix === NO_PREFIX) {\n      // Both have NO_PREFIX, use ValueMap directly\n      const valueMap = new ValueMap<TValue>()\n      valueMap.set(hash(currentValue), currentSingleValue)\n      valueMap.set(hash(newValue), [newValue, multiplicity])\n      this.#inner.set(key, valueMap)\n    } else {\n      // At least one has a prefix, use PrefixMap\n      const prefixMap = new PrefixMap<TValue, TPrefix>()\n\n      if (currentPrefix === newPrefix) {\n        // Same prefix, different suffixes - need ValueMap within PrefixMap\n        const valueMap = new ValueMap<TValue>()\n        valueMap.set(hash(currentValue), currentSingleValue)\n        valueMap.set(hash(newValue), [newValue, multiplicity])\n        prefixMap.set(currentPrefix, valueMap)\n      } else {\n        // Different prefixes - store as separate single values\n        prefixMap.set(currentPrefix, currentSingleValue)\n        prefixMap.set(newPrefix, [newValue, multiplicity])\n      }\n\n      this.#inner.set(key, prefixMap)\n    }\n  }\n\n  /**\n   * This method appends another index to the current index.\n   * @param other - The index to append to the current index.\n   */\n  append(other: Index<TKey, TValue>): void {\n    for (const [key, value] of other.entries()) {\n      this.addValue(key, value)\n    }\n  }\n\n  /**\n   * This method joins two indexes.\n   * @param other - The index to join with the current index.\n   * @returns A multiset of the joined values.\n   */\n  join<TValue2>(\n    other: Index<TKey, TValue2>\n  ): MultiSet<[TKey, [TValue, TValue2]]> {\n    const result: Array<[[TKey, [TValue, TValue2]], number]> = []\n    // We want to iterate over the smaller of the two indexes to reduce the\n    // number of operations we need to do.\n    if (this.size <= other.size) {\n      for (const [key, valueIt] of this.entriesIterators()) {\n        if (!other.has(key)) continue\n        const otherValues = other.get(key)\n        for (const [val1, mul1] of valueIt) {\n          for (const [val2, mul2] of otherValues) {\n            if (mul1 !== 0 && mul2 !== 0) {\n              result.push([[key, [val1, val2]], mul1 * mul2])\n            }\n          }\n        }\n      }\n    } else {\n      for (const [key, otherValueIt] of other.entriesIterators()) {\n        if (!this.has(key)) continue\n        const values = this.get(key)\n        for (const [val2, mul2] of otherValueIt) {\n          for (const [val1, mul1] of values) {\n            if (mul1 !== 0 && mul2 !== 0) {\n              result.push([[key, [val1, val2]], mul1 * mul2])\n            }\n          }\n        }\n      }\n    }\n\n    return new MultiSet(result)\n  }\n}\n\n/**\n * This function extracts the prefix from a value.\n * @param value - The value to extract the prefix from.\n * @returns The prefix and the suffix.\n */\nfunction getPrefix<TValue, TPrefix>(value: TValue): TPrefix | NO_PREFIX {\n  // If the value is an array and the first element is a string or number, then the\n  // first element is the prefix. This is used to distinguish between values without\n  // the need for hashing unless there are multiple values for the same prefix.\n  if (\n    Array.isArray(value) &&\n    (typeof value[0] === `string` ||\n      typeof value[0] === `number` ||\n      typeof value[0] === `bigint`)\n  ) {\n    return value[0] as TPrefix\n  }\n  return NO_PREFIX\n}\n\n/**\n * This function checks if a value is a single value.\n * @param value - The value to check.\n * @returns True if the value is a single value, false otherwise.\n */\nfunction isSingleValue<TValue>(\n  value: SingleValue<TValue> | unknown\n): value is SingleValue<TValue> {\n  return Array.isArray(value)\n}\n"],"names":["hash","MultiSet"],"mappings":";;;;;;;;;;;;;AAyCA,MAAM,YAAY,OAAO,WAAW;AAapC,MAAM,kBAAmC,IAGvC;AAAA;AAAA;AAAA;AAAA,EAIA,SAAS,OAAe,cAA+B;AACrD,QAAI,iBAAiB,EAAG,QAAO,KAAK,SAAS;AAE7C,UAAM,SAAS,UAA2B,KAAK;AAC/C,UAAM,wBAAwB,KAAK,IAAI,MAAM;AAE7C,QAAI,cAAc,qBAAqB,GAAG;AACxC,YAAM,CAAC,cAAc,mBAAmB,IAAI;AAC5C,YAAM,gBAAgB,UAA2B,YAAY;AAE7D,UAAI,kBAAkB,QAAQ;AAC5B,cAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AAEA,UAAI,iBAAiB,SAASA,KAAAA,KAAK,YAAY,MAAMA,KAAAA,KAAK,KAAK,GAAG;AAEhE,cAAM,kBAAkB,sBAAsB;AAC9C,YAAI,oBAAoB,GAAG;AACzB,eAAK,OAAO,MAAM;AAAA,QACpB,OAAO;AACL,eAAK,IAAI,QAAQ,CAAC,OAAO,eAAe,CAAC;AAAA,QAC3C;AAAA,MACF,OAAO;AAEL,cAAM,WAAW,IAAI,SAAA;AACrB,iBAAS,IAAIA,KAAAA,KAAK,YAAY,GAAG,qBAAqB;AACtD,iBAAS,IAAIA,UAAK,KAAK,GAAG,CAAC,OAAO,YAAY,CAAC;AAC/C,aAAK,IAAI,QAAQ,QAAQ;AAAA,MAC3B;AAAA,IACF,WAAW,0BAA0B,QAAW;AAE9C,WAAK,IAAI,QAAQ,CAAC,OAAO,YAAY,CAAC;AAAA,IACxC,OAAO;AAEL,YAAM,UAAU,sBAAsB,SAAS,OAAO,YAAY;AAClE,UAAI,SAAS;AACX,aAAK,OAAO,MAAM;AAAA,MACpB;AAAA,IACF;AAEA,WAAO,KAAK,SAAS;AAAA,EACvB;AACF;AAGA,MAAM,iBAAyB,IAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOzD,SAAS,OAAe,cAA+B;AACrD,QAAI,iBAAiB,EAAG,QAAO,KAAK,SAAS;AAE7C,UAAM,MAAMA,KAAAA,KAAK,KAAK;AACtB,UAAM,eAAe,KAAK,IAAI,GAAG;AAEjC,QAAI,cAAc;AAChB,YAAM,CAAA,EAAG,mBAAmB,IAAI;AAChC,YAAM,kBAAkB,sBAAsB;AAC9C,UAAI,oBAAoB,GAAG;AACzB,aAAK,OAAO,GAAG;AAAA,MACjB,OAAO;AACL,aAAK,IAAI,KAAK,CAAC,OAAO,eAAe,CAAC;AAAA,MACxC;AAAA,IACF,OAAO;AACL,WAAK,IAAI,KAAK,CAAC,OAAO,YAAY,CAAC;AAAA,IACrC;AAEA,WAAO,KAAK,SAAS;AAAA,EACvB;AACF;AAOO,MAAM,MAAmC;AAAA,EAa9C,cAAc;AAbT;AAWL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAGE,uBAAK,4BAAa,IAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,SAAS,OAAe;AAC/B,WAAO,SAAS,KAAK;AAAA,MACnB,CAAC,GAAG,KAAK,SAAS;AAAA,MAClB;AAAA,MACA,SAAS,IAAI;AAAA,IAAA,CACd;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,OAAe;AACjB,WAAO,mBAAK,QAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,KAAoB;AACtB,WAAO,mBAAK,QAAO,IAAI,GAAG;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,KAAoC;AACtC,WAAO,CAAC,GAAG,KAAK,YAAY,GAAG,CAAC;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,CAAC,YAAY,KAAuC;AAClD,UAAM,mBAAmB,mBAAK,QAAO,IAAI,GAAG;AAC5C,QAAI,cAAc,gBAAgB,GAAG;AACnC,YAAM;AAAA,IACR,WAAW,qBAAqB,QAAW;AACzC;AAAA,IACF,WAAW,4BAA4B,UAAU;AAE/C,iBAAW,cAAc,iBAAiB,UAAU;AAClD,cAAM;AAAA,MACR;AAAA,IACF,OAAO;AAEL,iBAAW,yBAAyB,iBAAiB,UAAU;AAC7D,YAAI,cAAc,qBAAqB,GAAG;AACxC,gBAAM;AAAA,QACR,OAAO;AACL,qBAAW,cAAc,sBAAsB,UAAU;AACvD,kBAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,UAA8C;AAC7C,eAAW,OAAO,mBAAK,QAAO,KAAA,GAAQ;AACpC,iBAAW,cAAc,KAAK,YAAY,GAAG,GAAG;AAC9C,cAAM,CAAC,KAAK,UAAU;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAAC,mBAAiE;AAChE,eAAW,OAAO,mBAAK,QAAO,KAAA,GAAQ;AACpC,YAAM,CAAC,KAAK,KAAK,YAAY,GAAG,CAAC;AAAA,IACnC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,KAAW,YAAiC;AACnD,UAAM,CAAC,OAAO,YAAY,IAAI;AAE9B,QAAI,iBAAiB,EAAG;AAExB,UAAM,mBAAmB,mBAAK,QAAO,IAAI,GAAG;AAE5C,QAAI,qBAAqB,QAAW;AAElC,yBAAK,QAAO,IAAI,KAAK,UAAU;AAC/B;AAAA,IACF;AAEA,QAAI,cAAc,gBAAgB,GAAG;AAEnC,4BAAK,kDAAL,WACE,KACA,kBACA,OACA;AAEF;AAAA,IACF;AAEA,QAAI,4BAA4B,UAAU;AAExC,YAAM,SAAS,UAA2B,KAAK;AAC/C,UAAI,WAAW,WAAW;AAExB,cAAM,YAAY,IAAI,UAAA;AACtB,kBAAU,IAAI,WAAW,gBAAgB;AACzC,kBAAU,IAAI,QAAQ,UAAU;AAChC,2BAAK,QAAO,IAAI,KAAK,SAAS;AAAA,MAChC,OAAO;AAEL,cAAM,UAAU,iBAAiB,SAAS,OAAO,YAAY;AAC7D,YAAI,SAAS;AACX,6BAAK,QAAO,OAAO,GAAG;AAAA,QACxB;AAAA,MACF;AAAA,IACF,OAAO;AAEL,YAAM,UAAU,iBAAiB,SAAS,OAAO,YAAY;AAC7D,UAAI,SAAS;AACX,2BAAK,QAAO,OAAO,GAAG;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAyEA,OAAO,OAAkC;AACvC,eAAW,CAAC,KAAK,KAAK,KAAK,MAAM,WAAW;AAC1C,WAAK,SAAS,KAAK,KAAK;AAAA,IAC1B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KACE,OACqC;AACrC,UAAM,SAAqD,CAAA;AAG3D,QAAI,KAAK,QAAQ,MAAM,MAAM;AAC3B,iBAAW,CAAC,KAAK,OAAO,KAAK,KAAK,oBAAoB;AACpD,YAAI,CAAC,MAAM,IAAI,GAAG,EAAG;AACrB,cAAM,cAAc,MAAM,IAAI,GAAG;AACjC,mBAAW,CAAC,MAAM,IAAI,KAAK,SAAS;AAClC,qBAAW,CAAC,MAAM,IAAI,KAAK,aAAa;AACtC,gBAAI,SAAS,KAAK,SAAS,GAAG;AAC5B,qBAAO,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC;AAAA,YAChD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF,OAAO;AACL,iBAAW,CAAC,KAAK,YAAY,KAAK,MAAM,oBAAoB;AAC1D,YAAI,CAAC,KAAK,IAAI,GAAG,EAAG;AACpB,cAAM,SAAS,KAAK,IAAI,GAAG;AAC3B,mBAAW,CAAC,MAAM,IAAI,KAAK,cAAc;AACvC,qBAAW,CAAC,MAAM,IAAI,KAAK,QAAQ;AACjC,gBAAI,SAAS,KAAK,SAAS,GAAG;AAC5B,qBAAO,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC;AAAA,YAChD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO,IAAIC,SAAAA,SAAS,MAAM;AAAA,EAC5B;AACF;AA5QE;AAXK;AAAA;AAAA;AAAA;AAsKL,iCAAA,SACE,KACA,oBACA,UACA,cACA;AACA,QAAM,CAAC,cAAc,mBAAmB,IAAI;AAG5C,MAAI,iBAAiB,UAAU;AAC7B,UAAM,kBAAkB,sBAAsB;AAC9C,QAAI,oBAAoB,GAAG;AACzB,yBAAK,QAAO,OAAO,GAAG;AAAA,IACxB,OAAO;AACL,yBAAK,QAAO,IAAI,KAAK,CAAC,UAAU,eAAe,CAAC;AAAA,IAClD;AACA;AAAA,EACF;AAGA,QAAM,YAAY,UAA2B,QAAQ;AACrD,QAAM,gBAAgB,UAA2B,YAAY;AAG7D,MACE,kBAAkB,cACjB,iBAAiB,YAAYD,UAAK,YAAY,MAAMA,KAAAA,KAAK,QAAQ,IAClE;AACA,UAAM,kBAAkB,sBAAsB;AAC9C,QAAI,oBAAoB,GAAG;AACzB,yBAAK,QAAO,OAAO,GAAG;AAAA,IACxB,OAAO;AACL,yBAAK,QAAO,IAAI,KAAK,CAAC,UAAU,eAAe,CAAC;AAAA,IAClD;AACA;AAAA,EACF;AAGA,MAAI,kBAAkB,aAAa,cAAc,WAAW;AAE1D,UAAM,WAAW,IAAI,SAAA;AACrB,aAAS,IAAIA,KAAAA,KAAK,YAAY,GAAG,kBAAkB;AACnD,aAAS,IAAIA,UAAK,QAAQ,GAAG,CAAC,UAAU,YAAY,CAAC;AACrD,uBAAK,QAAO,IAAI,KAAK,QAAQ;AAAA,EAC/B,OAAO;AAEL,UAAM,YAAY,IAAI,UAAA;AAEtB,QAAI,kBAAkB,WAAW;AAE/B,YAAM,WAAW,IAAI,SAAA;AACrB,eAAS,IAAIA,KAAAA,KAAK,YAAY,GAAG,kBAAkB;AACnD,eAAS,IAAIA,UAAK,QAAQ,GAAG,CAAC,UAAU,YAAY,CAAC;AACrD,gBAAU,IAAI,eAAe,QAAQ;AAAA,IACvC,OAAO;AAEL,gBAAU,IAAI,eAAe,kBAAkB;AAC/C,gBAAU,IAAI,WAAW,CAAC,UAAU,YAAY,CAAC;AAAA,IACnD;AAEA,uBAAK,QAAO,IAAI,KAAK,SAAS;AAAA,EAChC;AACF;AA0DF,SAAS,UAA2B,OAAoC;AAItE,MACE,MAAM,QAAQ,KAAK,MAClB,OAAO,MAAM,CAAC,MAAM,YACnB,OAAO,MAAM,CAAC,MAAM,YACpB,OAAO,MAAM,CAAC,MAAM,WACtB;AACA,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,SAAO;AACT;AAOA,SAAS,cACP,OAC8B;AAC9B,SAAO,MAAM,QAAQ,KAAK;AAC5B;;"}