@tanstack/db-ivm 0.1.6 → 0.1.8

package/src/operators/distinct.ts

@@ -4,21 +4,25 @@ import { hash } from "../hashing/index.js"
 import { MultiSet } from "../multiset.js"
 import type { Hash } from "../hashing/index.js"
 import type { DifferenceStreamReader } from "../graph.js"
-import type { IStreamBuilder } from "../types.js"
+import type { IStreamBuilder, KeyValue } from "../types.js"
 
 type Multiplicity = number
 
+type GetValue<T> = T extends KeyValue<any, infer V> ? V : never
+
 /**
  * Operator that removes duplicates
  */
-export class DistinctOperator<T> extends UnaryOperator<T> {
+export class DistinctOperator<
+  T extends KeyValue<any, any>,
+> extends UnaryOperator<T, KeyValue<number, GetValue<T>>> {
   #by: (value: T) => any
   #values: Map<Hash, Multiplicity> // keeps track of the number of times each value has been seen
 
   constructor(
     id: number,
     input: DifferenceStreamReader<T>,
-    output: DifferenceStreamWriter<T>,
+    output: DifferenceStreamWriter<KeyValue<number, GetValue<T>>>,
     by: (value: T) => any = (value: T) => value
   ) {
     super(id, input, output)
@@ -39,12 +43,11 @@ export class DistinctOperator<T> extends UnaryOperator<T> {
           this.#values.get(hashedValue) ??
           0
         const newMultiplicity = oldMultiplicity + diff
-
         updatedValues.set(hashedValue, [newMultiplicity, value])
       }
     }
 
-    const result: Array<[T, number]> = []
+    const result: Array<[KeyValue<number, GetValue<T>>, number]> = []
 
     // Check which values became visible or disappeared
     for (const [
@@ -62,11 +65,11 @@ export class DistinctOperator<T> extends UnaryOperator<T> {
       if (oldMultiplicity <= 0 && newMultiplicity > 0) {
         // The value wasn't present in the stream
         // but with this change it is now present in the stream
-        result.push([value, 1])
+        result.push([[hash(this.#by(value)), value[1]], 1])
       } else if (oldMultiplicity > 0 && newMultiplicity <= 0) {
         // The value was present in the stream
         // but with this change it is no longer present in the stream
-        result.push([value, -1])
+        result.push([[hash(this.#by(value)), value[1]], -1])
       }
     }
 
@@ -79,7 +82,9 @@ export class DistinctOperator<T> extends UnaryOperator<T> {
 /**
  * Removes duplicate values
  */
-export function distinct<T>(by: (value: T) => any = (value: T) => value) {
+export function distinct<T extends KeyValue<any, any>>(
+  by: (value: T) => any = (value: T) => value
+) {
   return (stream: IStreamBuilder<T>): IStreamBuilder<T> => {
     const output = new StreamBuilder<T>(
       stream.graph,
@@ -92,7 +97,6 @@ export function distinct<T>(by: (value: T) => any = (value: T) => value) {
       by
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/filter.ts

@@ -42,7 +42,6 @@ export function filter<T>(f: (data: T) => boolean): PipedOperator<T, T> {
       f
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/join.ts

@@ -149,7 +149,6 @@ export function innerJoin<
       output.writer
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/map.ts

@@ -42,7 +42,6 @@ export function map<T, O>(f: (data: T) => O): PipedOperator<T, O> {
       f
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/negate.ts

@@ -27,7 +27,6 @@ export function negate<T>(): PipedOperator<T, T> {
       output.writer
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/output.ts

@@ -47,7 +47,6 @@ export function output<T>(
       fn
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(outputStream.connectReader())
     return outputStream
   }
 }

package/src/operators/reduce.ts

@@ -118,7 +118,6 @@ export function reduce<
       f
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/tap.ts

@@ -45,7 +45,6 @@ export function tap<T>(f: (data: MultiSet<T>) => void): PipedOperator<T, T> {
       f
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/topKWithFractionalIndex.ts

@@ -327,7 +327,6 @@ export function topKWithFractionalIndex<KType, T>(
       opts
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/operators/topKWithFractionalIndexBTree.ts

@@ -302,7 +302,6 @@ export function topKWithFractionalIndexBTree<KType, T>(
       opts
     )
     stream.graph.addOperator(operator)
-    stream.graph.addStream(output.connectReader())
     return output
   }
 }

package/src/types.ts

@@ -27,7 +27,6 @@ export interface ID2 {
   getNextOperatorId: () => number
   newInput: <T>() => IStreamBuilder<T>
   addOperator: (operator: UnaryOperator<any> | BinaryOperator<any>) => void
-  addStream: (stream: DifferenceStreamReader<any>) => void
   finalize: () => void
   step: () => void
 }

package/dist/cjs/hashIndex.cjs

@@ -1,83 +0,0 @@
-"use strict";
-var __typeError = (msg) => {
-  throw TypeError(msg);
-};
-var __accessCheck = (obj, member, msg) => member.has(obj) || __typeError("Cannot " + msg);
-var __privateGet = (obj, member, getter) => (__accessCheck(obj, member, "read from private field"), getter ? getter.call(obj) : member.get(obj));
-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 _inner;
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const utils = require("./utils.cjs");
-const hash = require("./hashing/hash.cjs");
-class HashIndex {
-  constructor() {
-    __privateAdd(this, _inner);
-    __privateSet(this, _inner, new utils.DefaultMap(
-      () => new utils.DefaultMap(() => [void 0, 0])
-    ));
-  }
-  toString(indent = false) {
-    return `HashIndex(${JSON.stringify(
-      [...__privateGet(this, _inner)].map(([k, valueMap]) => [k, [...valueMap]]),
-      void 0,
-      indent ? 2 : void 0
-    )})`;
-  }
-  get(key) {
-    const valueMap = __privateGet(this, _inner).get(key);
-    return [...valueMap.values()];
-  }
-  getMultiplicity(key, value) {
-    const valueMap = __privateGet(this, _inner).get(key);
-    const valueHash = hash.hash(value);
-    const [, multiplicity] = valueMap.get(valueHash);
-    return multiplicity;
-  }
-  entries() {
-    return __privateGet(this, _inner).entries();
-  }
-  *entriesIterator() {
-    for (const [key, valueMap] of __privateGet(this, _inner).entries()) {
-      for (const [_valueHash, [value, multiplicity]] of valueMap.entries()) {
-        yield [key, [value, multiplicity]];
-      }
-    }
-  }
-  has(key) {
-    return __privateGet(this, _inner).has(key);
-  }
-  delete(key) {
-    __privateGet(this, _inner).delete(key);
-  }
-  get size() {
-    return __privateGet(this, _inner).size;
-  }
-  /**
-   * Adds a value to the index and does not return anything
-   * except if the addition caused the value to be removed
-   * and the key to be left with only a single value.
-   * In that case, we return the single remaining value.
-   */
-  addValue(key, value) {
-    const [val, multiplicity] = value;
-    const valueMap = __privateGet(this, _inner).get(key);
-    const valueHash = hash.hash(val);
-    const [, existingMultiplicity] = valueMap.get(valueHash);
-    const newMultiplicity = existingMultiplicity + multiplicity;
-    if (multiplicity !== 0) {
-      if (newMultiplicity === 0) {
-        valueMap.delete(valueHash);
-        if (valueMap.size === 1) {
-          return valueMap.entries().next().value[1];
-        }
-      } else {
-        valueMap.set(valueHash, [val, newMultiplicity]);
-      }
-    }
-    __privateGet(this, _inner).set(key, valueMap);
-  }
-}
-_inner = new WeakMap();
-exports.HashIndex = HashIndex;
-//# sourceMappingURL=hashIndex.cjs.map

package/dist/cjs/hashIndex.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"hashIndex.cjs","sources":["../../src/hashIndex.ts"],"sourcesContent":["import { DefaultMap } from \"./utils.js\"\nimport { hash } from \"./hashing/index.js\"\nimport type { Hash } from \"./hashing/index.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 HashIndex<K, V> {\n  #inner: DefaultMap<K, DefaultMap<Hash, [V, number]>>\n\n  constructor() {\n    this.#inner = new DefaultMap<K, DefaultMap<Hash, [V, number]>>(\n      () => new DefaultMap<Hash, [V, number]>(() => [undefined as any as V, 0])\n    )\n    // #inner is as map of:\n    // {\n    //   [key]: {\n    //     [hash(value)]: [value, multiplicity]\n    //   }\n    // }\n  }\n\n  toString(indent = false): string {\n    return `HashIndex(${JSON.stringify(\n      [...this.#inner].map(([k, valueMap]) => [k, [...valueMap]]),\n      undefined,\n      indent ? 2 : undefined\n    )})`\n  }\n\n  get(key: K): Array<[V, number]> {\n    const valueMap = this.#inner.get(key)\n    return [...valueMap.values()]\n  }\n\n  getMultiplicity(key: K, value: V): number {\n    const valueMap = this.#inner.get(key)\n    const valueHash = hash(value)\n    const [, multiplicity] = valueMap.get(valueHash)\n    return multiplicity\n  }\n\n  entries() {\n    return this.#inner.entries()\n  }\n\n  *entriesIterator(): Generator<[K, [V, number]]> {\n    for (const [key, valueMap] of this.#inner.entries()) {\n      for (const [_valueHash, [value, multiplicity]] of valueMap.entries()) {\n        yield [key, [value, multiplicity]]\n      }\n    }\n  }\n\n  has(key: K): boolean {\n    return this.#inner.has(key)\n  }\n\n  delete(key: K): void {\n    this.#inner.delete(key)\n  }\n\n  get size(): number {\n    return this.#inner.size\n  }\n\n  /**\n   * Adds a value to the index and does not return anything\n   * except if the addition caused the value to be removed\n   * and the key to be left with only a single value.\n   * In that case, we return the single remaining value.\n   */\n  addValue(key: K, value: [V, number]): [V, number] | void {\n    const [val, multiplicity] = value\n    const valueMap = this.#inner.get(key)\n    const valueHash = hash(val)\n    const [, existingMultiplicity] = valueMap.get(valueHash)\n    const newMultiplicity = existingMultiplicity + multiplicity\n    if (multiplicity !== 0) {\n      if (newMultiplicity === 0) {\n        valueMap.delete(valueHash)\n        if (valueMap.size === 1) {\n          // Signal that the key only has a single remaining value\n          return valueMap.entries().next().value![1]\n        }\n      } else {\n        valueMap.set(valueHash, [val, newMultiplicity])\n      }\n    }\n    this.#inner.set(key, valueMap)\n  }\n}\n"],"names":["DefaultMap","hash"],"mappings":";;;;;;;;;;;;AASO,MAAM,UAAgB;AAAA,EAG3B,cAAc;AAFd;AAGE,uBAAK,QAAS,IAAIA,MAAAA;AAAAA,MAChB,MAAM,IAAIA,MAAAA,WAA8B,MAAM,CAAC,QAAuB,CAAC,CAAC;AAAA,IAAA;AAAA,EAQ5E;AAAA,EAEA,SAAS,SAAS,OAAe;AAC/B,WAAO,aAAa,KAAK;AAAA,MACvB,CAAC,GAAG,mBAAK,OAAM,EAAE,IAAI,CAAC,CAAC,GAAG,QAAQ,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;AAAA,MAC1D;AAAA,MACA,SAAS,IAAI;AAAA,IAAA,CACd;AAAA,EACH;AAAA,EAEA,IAAI,KAA4B;AAC9B,UAAM,WAAW,mBAAK,QAAO,IAAI,GAAG;AACpC,WAAO,CAAC,GAAG,SAAS,QAAQ;AAAA,EAC9B;AAAA,EAEA,gBAAgB,KAAQ,OAAkB;AACxC,UAAM,WAAW,mBAAK,QAAO,IAAI,GAAG;AACpC,UAAM,YAAYC,KAAAA,KAAK,KAAK;AAC5B,UAAM,CAAA,EAAG,YAAY,IAAI,SAAS,IAAI,SAAS;AAC/C,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AACR,WAAO,mBAAK,QAAO,QAAA;AAAA,EACrB;AAAA,EAEA,CAAC,kBAA+C;AAC9C,eAAW,CAAC,KAAK,QAAQ,KAAK,mBAAK,QAAO,WAAW;AACnD,iBAAW,CAAC,YAAY,CAAC,OAAO,YAAY,CAAC,KAAK,SAAS,WAAW;AACpE,cAAM,CAAC,KAAK,CAAC,OAAO,YAAY,CAAC;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,mBAAK,QAAO,IAAI,GAAG;AAAA,EAC5B;AAAA,EAEA,OAAO,KAAc;AACnB,uBAAK,QAAO,OAAO,GAAG;AAAA,EACxB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,mBAAK,QAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAS,KAAQ,OAAwC;AACvD,UAAM,CAAC,KAAK,YAAY,IAAI;AAC5B,UAAM,WAAW,mBAAK,QAAO,IAAI,GAAG;AACpC,UAAM,YAAYA,KAAAA,KAAK,GAAG;AAC1B,UAAM,CAAA,EAAG,oBAAoB,IAAI,SAAS,IAAI,SAAS;AACvD,UAAM,kBAAkB,uBAAuB;AAC/C,QAAI,iBAAiB,GAAG;AACtB,UAAI,oBAAoB,GAAG;AACzB,iBAAS,OAAO,SAAS;AACzB,YAAI,SAAS,SAAS,GAAG;AAEvB,iBAAO,SAAS,QAAA,EAAU,KAAA,EAAO,MAAO,CAAC;AAAA,QAC3C;AAAA,MACF,OAAO;AACL,iBAAS,IAAI,WAAW,CAAC,KAAK,eAAe,CAAC;AAAA,MAChD;AAAA,IACF;AACA,uBAAK,QAAO,IAAI,KAAK,QAAQ;AAAA,EAC/B;AACF;AAnFE;;"}

package/dist/cjs/hashIndex.d.cts

@@ -1,25 +0,0 @@
-import { DefaultMap } from './utils.js';
-/**
- * A map from a difference collection trace's keys -> (value, multiplicities) that changed.
- * Used in operations like join and reduce where the operation needs to
- * exploit the key-value structure of the data to run efficiently.
- */
-export declare class HashIndex<K, V> {
-    #private;
-    constructor();
-    toString(indent?: boolean): string;
-    get(key: K): Array<[V, number]>;
-    getMultiplicity(key: K, value: V): number;
-    entries(): MapIterator<[K, DefaultMap<number, [V, number]>]>;
-    entriesIterator(): Generator<[K, [V, number]]>;
-    has(key: K): boolean;
-    delete(key: K): void;
-    get size(): number;
-    /**
-     * Adds a value to the index and does not return anything
-     * except if the addition caused the value to be removed
-     * and the key to be left with only a single value.
-     * In that case, we return the single remaining value.
-     */
-    addValue(key: K, value: [V, number]): [V, number] | void;
-}

package/dist/cjs/valueIndex.cjs

@@ -1,74 +0,0 @@
-"use strict";
-var __typeError = (msg) => {
-  throw TypeError(msg);
-};
-var __accessCheck = (obj, member, msg) => member.has(obj) || __typeError("Cannot " + msg);
-var __privateGet = (obj, member, getter) => (__accessCheck(obj, member, "read from private field"), getter ? getter.call(obj) : member.get(obj));
-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 _inner, _ValueIndex_instances, setMultiplicity_fn;
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const hash = require("./hashing/hash.cjs");
-class ValueIndex {
-  // Maps key to the value and its multiplicity
-  constructor() {
-    __privateAdd(this, _ValueIndex_instances);
-    __privateAdd(this, _inner);
-    __privateSet(this, _inner, /* @__PURE__ */ new Map());
-  }
-  toString(indent = false) {
-    return `ValueIndex(${JSON.stringify(
-      [...__privateGet(this, _inner).entries()],
-      void 0,
-      indent ? 2 : void 0
-    )})`;
-  }
-  get(key) {
-    return __privateGet(this, _inner).get(key);
-  }
-  getMultiplicity(key) {
-    var _a;
-    return ((_a = this.get(key)) == null ? void 0 : _a[1]) ?? 0;
-  }
-  entries() {
-    return __privateGet(this, _inner).entries();
-  }
-  has(key) {
-    return __privateGet(this, _inner).has(key);
-  }
-  delete(key) {
-    __privateGet(this, _inner).delete(key);
-  }
-  get size() {
-    return __privateGet(this, _inner).size;
-  }
-  addValue(key, v) {
-    const [value, multiplicity] = v;
-    if (multiplicity === 0) {
-      return;
-    }
-    if (this.has(key)) {
-      const [currValue, currMultiplicity] = this.get(key);
-      if (hash.hash(value) === hash.hash(currValue)) {
-        __privateMethod(this, _ValueIndex_instances, setMultiplicity_fn).call(this, key, value, currMultiplicity + multiplicity);
-        return;
-      }
-      throw new Error(
-        `Cannot add value for key ${key} because it already exists in ValueIndex with a different value`
-      );
-    }
-    __privateGet(this, _inner).set(key, [value, multiplicity]);
-  }
-}
-_inner = new WeakMap();
-_ValueIndex_instances = new WeakSet();
-setMultiplicity_fn = function(key, value, multiplicity) {
-  if (multiplicity === 0) {
-    __privateGet(this, _inner).delete(key);
-  } else {
-    __privateGet(this, _inner).set(key, [value, multiplicity]);
-  }
-};
-exports.ValueIndex = ValueIndex;
-//# sourceMappingURL=valueIndex.cjs.map

package/dist/cjs/valueIndex.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"valueIndex.cjs","sources":["../../src/valueIndex.ts"],"sourcesContent":["import { hash } from \"./hashing/index.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 ValueIndex<K, V> {\n  #inner: Map<K, [V, number]> // Maps key to the value and its multiplicity\n\n  constructor() {\n    this.#inner = new Map()\n  }\n\n  toString(indent = false): string {\n    return `ValueIndex(${JSON.stringify(\n      [...this.#inner.entries()],\n      undefined,\n      indent ? 2 : undefined\n    )})`\n  }\n\n  get(key: K): [V, number] | undefined {\n    return this.#inner.get(key)\n  }\n\n  getMultiplicity(key: K): number {\n    return this.get(key)?.[1] ?? 0\n  }\n\n  entries() {\n    return this.#inner.entries()\n  }\n\n  has(key: K): boolean {\n    return this.#inner.has(key)\n  }\n\n  delete(key: K): void {\n    this.#inner.delete(key)\n  }\n\n  get size(): number {\n    return this.#inner.size\n  }\n\n  addValue(key: K, v: [V, number]): void {\n    const [value, multiplicity] = v\n\n    if (multiplicity === 0) {\n      return\n    }\n\n    if (this.has(key)) {\n      const [currValue, currMultiplicity] = this.get(key)!\n      if (hash(value) === hash(currValue)) {\n        // Update the multiplicity\n        this.#setMultiplicity(key, value, currMultiplicity + multiplicity)\n        return\n      }\n      // Different value, not allowed.\n      // ValueIndex only supports one value per key.\n      throw new Error(\n        `Cannot add value for key ${key} because it already exists in ValueIndex with a different value`\n      )\n    }\n\n    this.#inner.set(key, [value, multiplicity])\n  }\n\n  #setMultiplicity(key: K, value: V, multiplicity: number): void {\n    if (multiplicity === 0) {\n      this.#inner.delete(key)\n    } else {\n      this.#inner.set(key, [value, multiplicity])\n    }\n  }\n}\n"],"names":["hash"],"mappings":";;;;;;;;;;;;AAOO,MAAM,WAAiB;AAAA;AAAA,EAG5B,cAAc;AAHT;AACL;AAGE,uBAAK,4BAAa,IAAA;AAAA,EACpB;AAAA,EAEA,SAAS,SAAS,OAAe;AAC/B,WAAO,cAAc,KAAK;AAAA,MACxB,CAAC,GAAG,mBAAK,QAAO,SAAS;AAAA,MACzB;AAAA,MACA,SAAS,IAAI;AAAA,IAAA,CACd;AAAA,EACH;AAAA,EAEA,IAAI,KAAiC;AACnC,WAAO,mBAAK,QAAO,IAAI,GAAG;AAAA,EAC5B;AAAA,EAEA,gBAAgB,KAAgB;;AAC9B,aAAO,UAAK,IAAI,GAAG,MAAZ,mBAAgB,OAAM;AAAA,EAC/B;AAAA,EAEA,UAAU;AACR,WAAO,mBAAK,QAAO,QAAA;AAAA,EACrB;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,mBAAK,QAAO,IAAI,GAAG;AAAA,EAC5B;AAAA,EAEA,OAAO,KAAc;AACnB,uBAAK,QAAO,OAAO,GAAG;AAAA,EACxB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,mBAAK,QAAO;AAAA,EACrB;AAAA,EAEA,SAAS,KAAQ,GAAsB;AACrC,UAAM,CAAC,OAAO,YAAY,IAAI;AAE9B,QAAI,iBAAiB,GAAG;AACtB;AAAA,IACF;AAEA,QAAI,KAAK,IAAI,GAAG,GAAG;AACjB,YAAM,CAAC,WAAW,gBAAgB,IAAI,KAAK,IAAI,GAAG;AAClD,UAAIA,KAAAA,KAAK,KAAK,MAAMA,KAAAA,KAAK,SAAS,GAAG;AAEnC,8BAAK,2CAAL,WAAsB,KAAK,OAAO,mBAAmB;AACrD;AAAA,MACF;AAGA,YAAM,IAAI;AAAA,QACR,4BAA4B,GAAG;AAAA,MAAA;AAAA,IAEnC;AAEA,uBAAK,QAAO,IAAI,KAAK,CAAC,OAAO,YAAY,CAAC;AAAA,EAC5C;AASF;AArEE;AADK;AA+DL,qBAAA,SAAiB,KAAQ,OAAU,cAA4B;AAC7D,MAAI,iBAAiB,GAAG;AACtB,uBAAK,QAAO,OAAO,GAAG;AAAA,EACxB,OAAO;AACL,uBAAK,QAAO,IAAI,KAAK,CAAC,OAAO,YAAY,CAAC;AAAA,EAC5C;AACF;;"}

package/dist/cjs/valueIndex.d.cts

@@ -1,17 +0,0 @@
-/**
- * A map from a difference collection trace's keys -> (value, multiplicities) that changed.
- * Used in operations like join and reduce where the operation needs to
- * exploit the key-value structure of the data to run efficiently.
- */
-export declare class ValueIndex<K, V> {
-    #private;
-    constructor();
-    toString(indent?: boolean): string;
-    get(key: K): [V, number] | undefined;
-    getMultiplicity(key: K): number;
-    entries(): MapIterator<[K, [V, number]]>;
-    has(key: K): boolean;
-    delete(key: K): void;
-    get size(): number;
-    addValue(key: K, v: [V, number]): void;
-}

package/dist/esm/hashIndex.d.ts

@@ -1,25 +0,0 @@
-import { DefaultMap } from './utils.js';
-/**
- * A map from a difference collection trace's keys -> (value, multiplicities) that changed.
- * Used in operations like join and reduce where the operation needs to
- * exploit the key-value structure of the data to run efficiently.
- */
-export declare class HashIndex<K, V> {
-    #private;
-    constructor();
-    toString(indent?: boolean): string;
-    get(key: K): Array<[V, number]>;
-    getMultiplicity(key: K, value: V): number;
-    entries(): MapIterator<[K, DefaultMap<number, [V, number]>]>;
-    entriesIterator(): Generator<[K, [V, number]]>;
-    has(key: K): boolean;
-    delete(key: K): void;
-    get size(): number;
-    /**
-     * Adds a value to the index and does not return anything
-     * except if the addition caused the value to be removed
-     * and the key to be left with only a single value.
-     * In that case, we return the single remaining value.
-     */
-    addValue(key: K, value: [V, number]): [V, number] | void;
-}

package/dist/esm/hashIndex.js

@@ -1,83 +0,0 @@
-var __typeError = (msg) => {
-  throw TypeError(msg);
-};
-var __accessCheck = (obj, member, msg) => member.has(obj) || __typeError("Cannot " + msg);
-var __privateGet = (obj, member, getter) => (__accessCheck(obj, member, "read from private field"), getter ? getter.call(obj) : member.get(obj));
-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 _inner;
-import { DefaultMap } from "./utils.js";
-import { hash } from "./hashing/hash.js";
-class HashIndex {
-  constructor() {
-    __privateAdd(this, _inner);
-    __privateSet(this, _inner, new DefaultMap(
-      () => new DefaultMap(() => [void 0, 0])
-    ));
-  }
-  toString(indent = false) {
-    return `HashIndex(${JSON.stringify(
-      [...__privateGet(this, _inner)].map(([k, valueMap]) => [k, [...valueMap]]),
-      void 0,
-      indent ? 2 : void 0
-    )})`;
-  }
-  get(key) {
-    const valueMap = __privateGet(this, _inner).get(key);
-    return [...valueMap.values()];
-  }
-  getMultiplicity(key, value) {
-    const valueMap = __privateGet(this, _inner).get(key);
-    const valueHash = hash(value);
-    const [, multiplicity] = valueMap.get(valueHash);
-    return multiplicity;
-  }
-  entries() {
-    return __privateGet(this, _inner).entries();
-  }
-  *entriesIterator() {
-    for (const [key, valueMap] of __privateGet(this, _inner).entries()) {
-      for (const [_valueHash, [value, multiplicity]] of valueMap.entries()) {
-        yield [key, [value, multiplicity]];
-      }
-    }
-  }
-  has(key) {
-    return __privateGet(this, _inner).has(key);
-  }
-  delete(key) {
-    __privateGet(this, _inner).delete(key);
-  }
-  get size() {
-    return __privateGet(this, _inner).size;
-  }
-  /**
-   * Adds a value to the index and does not return anything
-   * except if the addition caused the value to be removed
-   * and the key to be left with only a single value.
-   * In that case, we return the single remaining value.
-   */
-  addValue(key, value) {
-    const [val, multiplicity] = value;
-    const valueMap = __privateGet(this, _inner).get(key);
-    const valueHash = hash(val);
-    const [, existingMultiplicity] = valueMap.get(valueHash);
-    const newMultiplicity = existingMultiplicity + multiplicity;
-    if (multiplicity !== 0) {
-      if (newMultiplicity === 0) {
-        valueMap.delete(valueHash);
-        if (valueMap.size === 1) {
-          return valueMap.entries().next().value[1];
-        }
-      } else {
-        valueMap.set(valueHash, [val, newMultiplicity]);
-      }
-    }
-    __privateGet(this, _inner).set(key, valueMap);
-  }
-}
-_inner = new WeakMap();
-export {
-  HashIndex
-};
-//# sourceMappingURL=hashIndex.js.map

package/dist/esm/hashIndex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hashIndex.js","sources":["../../src/hashIndex.ts"],"sourcesContent":["import { DefaultMap } from \"./utils.js\"\nimport { hash } from \"./hashing/index.js\"\nimport type { Hash } from \"./hashing/index.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 HashIndex<K, V> {\n  #inner: DefaultMap<K, DefaultMap<Hash, [V, number]>>\n\n  constructor() {\n    this.#inner = new DefaultMap<K, DefaultMap<Hash, [V, number]>>(\n      () => new DefaultMap<Hash, [V, number]>(() => [undefined as any as V, 0])\n    )\n    // #inner is as map of:\n    // {\n    //   [key]: {\n    //     [hash(value)]: [value, multiplicity]\n    //   }\n    // }\n  }\n\n  toString(indent = false): string {\n    return `HashIndex(${JSON.stringify(\n      [...this.#inner].map(([k, valueMap]) => [k, [...valueMap]]),\n      undefined,\n      indent ? 2 : undefined\n    )})`\n  }\n\n  get(key: K): Array<[V, number]> {\n    const valueMap = this.#inner.get(key)\n    return [...valueMap.values()]\n  }\n\n  getMultiplicity(key: K, value: V): number {\n    const valueMap = this.#inner.get(key)\n    const valueHash = hash(value)\n    const [, multiplicity] = valueMap.get(valueHash)\n    return multiplicity\n  }\n\n  entries() {\n    return this.#inner.entries()\n  }\n\n  *entriesIterator(): Generator<[K, [V, number]]> {\n    for (const [key, valueMap] of this.#inner.entries()) {\n      for (const [_valueHash, [value, multiplicity]] of valueMap.entries()) {\n        yield [key, [value, multiplicity]]\n      }\n    }\n  }\n\n  has(key: K): boolean {\n    return this.#inner.has(key)\n  }\n\n  delete(key: K): void {\n    this.#inner.delete(key)\n  }\n\n  get size(): number {\n    return this.#inner.size\n  }\n\n  /**\n   * Adds a value to the index and does not return anything\n   * except if the addition caused the value to be removed\n   * and the key to be left with only a single value.\n   * In that case, we return the single remaining value.\n   */\n  addValue(key: K, value: [V, number]): [V, number] | void {\n    const [val, multiplicity] = value\n    const valueMap = this.#inner.get(key)\n    const valueHash = hash(val)\n    const [, existingMultiplicity] = valueMap.get(valueHash)\n    const newMultiplicity = existingMultiplicity + multiplicity\n    if (multiplicity !== 0) {\n      if (newMultiplicity === 0) {\n        valueMap.delete(valueHash)\n        if (valueMap.size === 1) {\n          // Signal that the key only has a single remaining value\n          return valueMap.entries().next().value![1]\n        }\n      } else {\n        valueMap.set(valueHash, [val, newMultiplicity])\n      }\n    }\n    this.#inner.set(key, valueMap)\n  }\n}\n"],"names":[],"mappings":";;;;;;;;;;AASO,MAAM,UAAgB;AAAA,EAG3B,cAAc;AAFd;AAGE,uBAAK,QAAS,IAAI;AAAA,MAChB,MAAM,IAAI,WAA8B,MAAM,CAAC,QAAuB,CAAC,CAAC;AAAA,IAAA;AAAA,EAQ5E;AAAA,EAEA,SAAS,SAAS,OAAe;AAC/B,WAAO,aAAa,KAAK;AAAA,MACvB,CAAC,GAAG,mBAAK,OAAM,EAAE,IAAI,CAAC,CAAC,GAAG,QAAQ,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;AAAA,MAC1D;AAAA,MACA,SAAS,IAAI;AAAA,IAAA,CACd;AAAA,EACH;AAAA,EAEA,IAAI,KAA4B;AAC9B,UAAM,WAAW,mBAAK,QAAO,IAAI,GAAG;AACpC,WAAO,CAAC,GAAG,SAAS,QAAQ;AAAA,EAC9B;AAAA,EAEA,gBAAgB,KAAQ,OAAkB;AACxC,UAAM,WAAW,mBAAK,QAAO,IAAI,GAAG;AACpC,UAAM,YAAY,KAAK,KAAK;AAC5B,UAAM,CAAA,EAAG,YAAY,IAAI,SAAS,IAAI,SAAS;AAC/C,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AACR,WAAO,mBAAK,QAAO,QAAA;AAAA,EACrB;AAAA,EAEA,CAAC,kBAA+C;AAC9C,eAAW,CAAC,KAAK,QAAQ,KAAK,mBAAK,QAAO,WAAW;AACnD,iBAAW,CAAC,YAAY,CAAC,OAAO,YAAY,CAAC,KAAK,SAAS,WAAW;AACpE,cAAM,CAAC,KAAK,CAAC,OAAO,YAAY,CAAC;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,mBAAK,QAAO,IAAI,GAAG;AAAA,EAC5B;AAAA,EAEA,OAAO,KAAc;AACnB,uBAAK,QAAO,OAAO,GAAG;AAAA,EACxB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,mBAAK,QAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAS,KAAQ,OAAwC;AACvD,UAAM,CAAC,KAAK,YAAY,IAAI;AAC5B,UAAM,WAAW,mBAAK,QAAO,IAAI,GAAG;AACpC,UAAM,YAAY,KAAK,GAAG;AAC1B,UAAM,CAAA,EAAG,oBAAoB,IAAI,SAAS,IAAI,SAAS;AACvD,UAAM,kBAAkB,uBAAuB;AAC/C,QAAI,iBAAiB,GAAG;AACtB,UAAI,oBAAoB,GAAG;AACzB,iBAAS,OAAO,SAAS;AACzB,YAAI,SAAS,SAAS,GAAG;AAEvB,iBAAO,SAAS,QAAA,EAAU,KAAA,EAAO,MAAO,CAAC;AAAA,QAC3C;AAAA,MACF,OAAO;AACL,iBAAS,IAAI,WAAW,CAAC,KAAK,eAAe,CAAC;AAAA,MAChD;AAAA,IACF;AACA,uBAAK,QAAO,IAAI,KAAK,QAAQ;AAAA,EAC/B;AACF;AAnFE;"}

package/dist/esm/valueIndex.d.ts

@@ -1,17 +0,0 @@
-/**
- * A map from a difference collection trace's keys -> (value, multiplicities) that changed.
- * Used in operations like join and reduce where the operation needs to
- * exploit the key-value structure of the data to run efficiently.
- */
-export declare class ValueIndex<K, V> {
-    #private;
-    constructor();
-    toString(indent?: boolean): string;
-    get(key: K): [V, number] | undefined;
-    getMultiplicity(key: K): number;
-    entries(): MapIterator<[K, [V, number]]>;
-    has(key: K): boolean;
-    delete(key: K): void;
-    get size(): number;
-    addValue(key: K, v: [V, number]): void;
-}

package/dist/esm/valueIndex.js

@@ -1,74 +0,0 @@
-var __typeError = (msg) => {
-  throw TypeError(msg);
-};
-var __accessCheck = (obj, member, msg) => member.has(obj) || __typeError("Cannot " + msg);
-var __privateGet = (obj, member, getter) => (__accessCheck(obj, member, "read from private field"), getter ? getter.call(obj) : member.get(obj));
-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 _inner, _ValueIndex_instances, setMultiplicity_fn;
-import { hash } from "./hashing/hash.js";
-class ValueIndex {
-  // Maps key to the value and its multiplicity
-  constructor() {
-    __privateAdd(this, _ValueIndex_instances);
-    __privateAdd(this, _inner);
-    __privateSet(this, _inner, /* @__PURE__ */ new Map());
-  }
-  toString(indent = false) {
-    return `ValueIndex(${JSON.stringify(
-      [...__privateGet(this, _inner).entries()],
-      void 0,
-      indent ? 2 : void 0
-    )})`;
-  }
-  get(key) {
-    return __privateGet(this, _inner).get(key);
-  }
-  getMultiplicity(key) {
-    var _a;
-    return ((_a = this.get(key)) == null ? void 0 : _a[1]) ?? 0;
-  }
-  entries() {
-    return __privateGet(this, _inner).entries();
-  }
-  has(key) {
-    return __privateGet(this, _inner).has(key);
-  }
-  delete(key) {
-    __privateGet(this, _inner).delete(key);
-  }
-  get size() {
-    return __privateGet(this, _inner).size;
-  }
-  addValue(key, v) {
-    const [value, multiplicity] = v;
-    if (multiplicity === 0) {
-      return;
-    }
-    if (this.has(key)) {
-      const [currValue, currMultiplicity] = this.get(key);
-      if (hash(value) === hash(currValue)) {
-        __privateMethod(this, _ValueIndex_instances, setMultiplicity_fn).call(this, key, value, currMultiplicity + multiplicity);
-        return;
-      }
-      throw new Error(
-        `Cannot add value for key ${key} because it already exists in ValueIndex with a different value`
-      );
-    }
-    __privateGet(this, _inner).set(key, [value, multiplicity]);
-  }
-}
-_inner = new WeakMap();
-_ValueIndex_instances = new WeakSet();
-setMultiplicity_fn = function(key, value, multiplicity) {
-  if (multiplicity === 0) {
-    __privateGet(this, _inner).delete(key);
-  } else {
-    __privateGet(this, _inner).set(key, [value, multiplicity]);
-  }
-};
-export {
-  ValueIndex
-};
-//# sourceMappingURL=valueIndex.js.map

package/dist/esm/valueIndex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"valueIndex.js","sources":["../../src/valueIndex.ts"],"sourcesContent":["import { hash } from \"./hashing/index.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 ValueIndex<K, V> {\n  #inner: Map<K, [V, number]> // Maps key to the value and its multiplicity\n\n  constructor() {\n    this.#inner = new Map()\n  }\n\n  toString(indent = false): string {\n    return `ValueIndex(${JSON.stringify(\n      [...this.#inner.entries()],\n      undefined,\n      indent ? 2 : undefined\n    )})`\n  }\n\n  get(key: K): [V, number] | undefined {\n    return this.#inner.get(key)\n  }\n\n  getMultiplicity(key: K): number {\n    return this.get(key)?.[1] ?? 0\n  }\n\n  entries() {\n    return this.#inner.entries()\n  }\n\n  has(key: K): boolean {\n    return this.#inner.has(key)\n  }\n\n  delete(key: K): void {\n    this.#inner.delete(key)\n  }\n\n  get size(): number {\n    return this.#inner.size\n  }\n\n  addValue(key: K, v: [V, number]): void {\n    const [value, multiplicity] = v\n\n    if (multiplicity === 0) {\n      return\n    }\n\n    if (this.has(key)) {\n      const [currValue, currMultiplicity] = this.get(key)!\n      if (hash(value) === hash(currValue)) {\n        // Update the multiplicity\n        this.#setMultiplicity(key, value, currMultiplicity + multiplicity)\n        return\n      }\n      // Different value, not allowed.\n      // ValueIndex only supports one value per key.\n      throw new Error(\n        `Cannot add value for key ${key} because it already exists in ValueIndex with a different value`\n      )\n    }\n\n    this.#inner.set(key, [value, multiplicity])\n  }\n\n  #setMultiplicity(key: K, value: V, multiplicity: number): void {\n    if (multiplicity === 0) {\n      this.#inner.delete(key)\n    } else {\n      this.#inner.set(key, [value, multiplicity])\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;;;;;;AAOO,MAAM,WAAiB;AAAA;AAAA,EAG5B,cAAc;AAHT;AACL;AAGE,uBAAK,4BAAa,IAAA;AAAA,EACpB;AAAA,EAEA,SAAS,SAAS,OAAe;AAC/B,WAAO,cAAc,KAAK;AAAA,MACxB,CAAC,GAAG,mBAAK,QAAO,SAAS;AAAA,MACzB;AAAA,MACA,SAAS,IAAI;AAAA,IAAA,CACd;AAAA,EACH;AAAA,EAEA,IAAI,KAAiC;AACnC,WAAO,mBAAK,QAAO,IAAI,GAAG;AAAA,EAC5B;AAAA,EAEA,gBAAgB,KAAgB;;AAC9B,aAAO,UAAK,IAAI,GAAG,MAAZ,mBAAgB,OAAM;AAAA,EAC/B;AAAA,EAEA,UAAU;AACR,WAAO,mBAAK,QAAO,QAAA;AAAA,EACrB;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,mBAAK,QAAO,IAAI,GAAG;AAAA,EAC5B;AAAA,EAEA,OAAO,KAAc;AACnB,uBAAK,QAAO,OAAO,GAAG;AAAA,EACxB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,mBAAK,QAAO;AAAA,EACrB;AAAA,EAEA,SAAS,KAAQ,GAAsB;AACrC,UAAM,CAAC,OAAO,YAAY,IAAI;AAE9B,QAAI,iBAAiB,GAAG;AACtB;AAAA,IACF;AAEA,QAAI,KAAK,IAAI,GAAG,GAAG;AACjB,YAAM,CAAC,WAAW,gBAAgB,IAAI,KAAK,IAAI,GAAG;AAClD,UAAI,KAAK,KAAK,MAAM,KAAK,SAAS,GAAG;AAEnC,8BAAK,2CAAL,WAAsB,KAAK,OAAO,mBAAmB;AACrD;AAAA,MACF;AAGA,YAAM,IAAI;AAAA,QACR,4BAA4B,GAAG;AAAA,MAAA;AAAA,IAEnC;AAEA,uBAAK,QAAO,IAAI,KAAK,CAAC,OAAO,YAAY,CAAC;AAAA,EAC5C;AASF;AArEE;AADK;AA+DL,qBAAA,SAAiB,KAAQ,OAAU,cAA4B;AAC7D,MAAI,iBAAiB,GAAG;AACtB,uBAAK,QAAO,OAAO,GAAG;AAAA,EACxB,OAAO;AACL,uBAAK,QAAO,IAAI,KAAK,CAAC,OAAO,YAAY,CAAC;AAAA,EAC5C;AACF;"}