@tanstack/db 0.0.1

package/README.md

@@ -0,0 +1,37 @@
+# @tanstack/db
+
+**A reactive client store for building super fast apps on sync**
+
+TanStack DB extends TanStack Query with collections, live queries and transactional mutations that keep your UI reactive, consistent and blazing fast 🔥
+
+<p>
+  <a href="https://x.com/intent/post?text=TanStack%20DB&url=https://tanstack.com/db">
+    <img alt="#TanStack" src="https://img.shields.io/twitter/url?color=%2308a0e9&label=%23TanStack&style=social&url=https%3A%2F%2Ftwitter.com%2Fintent%2Ftweet%3Fbutton_hashtag%3DTanStack" /></a>
+  <a href="#status">
+    <img src="https://img.shields.io/badge/status-alpha-orange" alt="Status - Alpha"></a>
+  <a href="https://npmjs.com/package/@tanstack/db">
+    <img alt="" src="https://img.shields.io/npm/dm/@tanstack/db.svg" /></a>
+  <a href="https://discord.gg/yjUNbvbraC">
+    <img alt="" src="https://img.shields.io/badge/Discord-TanStack-%235865F2" /></a>
+  <a href="https://github.com/tanstack/db/discussions">
+    <img alt="Join the discussion on Github" src="https://img.shields.io/badge/Discussions-Chat%20now!-green" /></a>
+  <a href="https://x.com/tan_stack">
+    <img alt="" src="https://img.shields.io/twitter/follow/tan_stack.svg?style=social&label=Follow @TanStack" /></a>
+</p>
+
+## 💥 Visit the [TanStack/db](https://github.com/TanStack/db) repo for docs and details!
+
+- 🔥 **blazing fast query engine**<br />
+  for sub-millisecond live queries &mdash; even for complex queries with joins and aggregates
+- 🎯 **fine-grained reactivity**<br />
+  to minimize component re-rendering
+- 💪 **robust transaction primitives**<br />
+  for easy optimistic mutations with sync and lifecycle support
+- 🌟 **normalized data**<br />
+  to keep your backend simple
+
+---
+
+### [Become a Sponsor!](https://github.com/sponsors/tannerlinsley/)
+
+Enjoy this library? Try the entire [TanStack](https://tanstack.com), including [TanStack Query](https://tanstack.com/query), [TanStack Store](https://tanstack.com/store), etc.

package/dist/cjs/SortedMap.cjs

@@ -0,0 +1,140 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+class SortedMap {
+  /**
+   * Creates a new SortedMap instance
+   *
+   * @param comparator - Optional function to compare values for sorting
+   */
+  constructor(comparator) {
+    this.map = /* @__PURE__ */ new Map();
+    this.sortedKeys = [];
+    this.comparator = comparator || this.defaultComparator;
+  }
+  /**
+   * Default comparator function used when none is provided
+   *
+   * @param a - First value to compare
+   * @param b - Second value to compare
+   * @returns -1 if a < b, 1 if a > b, 0 if equal
+   */
+  defaultComparator(a, b) {
+    if (a < b) return -1;
+    if (a > b) return 1;
+    return 0;
+  }
+  /**
+   * Sets a key-value pair in the map and maintains sort order
+   *
+   * @param key - The key to set
+   * @param value - The value to associate with the key
+   * @returns This SortedMap instance for chaining
+   */
+  set(key, value) {
+    this.map.set(key, value);
+    if (!this.sortedKeys.includes(key)) {
+      this.sortedKeys.push(key);
+    }
+    this.sortedKeys.sort((a, b) => {
+      const valueA = this.map.get(a);
+      const valueB = this.map.get(b);
+      return this.comparator(valueA, valueB);
+    });
+    return this;
+  }
+  /**
+   * Gets a value by its key
+   *
+   * @param key - The key to look up
+   * @returns The value associated with the key, or undefined if not found
+   */
+  get(key) {
+    return this.map.get(key);
+  }
+  /**
+   * Removes a key-value pair from the map
+   *
+   * @param key - The key to remove
+   * @returns True if the key was found and removed, false otherwise
+   */
+  delete(key) {
+    if (this.map.delete(key)) {
+      const index = this.sortedKeys.indexOf(key);
+      this.sortedKeys.splice(index, 1);
+      return true;
+    }
+    return false;
+  }
+  /**
+   * Checks if a key exists in the map
+   *
+   * @param key - The key to check
+   * @returns True if the key exists, false otherwise
+   */
+  has(key) {
+    return this.map.has(key);
+  }
+  /**
+   * Removes all key-value pairs from the map
+   */
+  clear() {
+    this.map.clear();
+    this.sortedKeys = [];
+  }
+  /**
+   * Gets the number of key-value pairs in the map
+   */
+  get size() {
+    return this.map.size;
+  }
+  /**
+   * Default iterator that returns entries in sorted order
+   *
+   * @returns An iterator for the map's entries
+   */
+  *[Symbol.iterator]() {
+    for (const key of this.sortedKeys) {
+      yield [key, this.map.get(key)];
+    }
+  }
+  /**
+   * Returns an iterator for the map's entries in sorted order
+   *
+   * @returns An iterator for the map's entries
+   */
+  entries() {
+    return this[Symbol.iterator]();
+  }
+  /**
+   * Returns an iterator for the map's keys in sorted order
+   *
+   * @returns An iterator for the map's keys
+   */
+  keys() {
+    return this.sortedKeys[Symbol.iterator]();
+  }
+  /**
+   * Returns an iterator for the map's values in sorted order
+   *
+   * @returns An iterator for the map's values
+   */
+  values() {
+    return (function* () {
+      for (const key of this.sortedKeys) {
+        yield this.map.get(key);
+      }
+    }).call(this);
+  }
+  /**
+   * Executes a callback function for each key-value pair in the map in sorted order
+   *
+   * @param callbackfn - Function to execute for each entry
+   */
+  forEach(callbackfn) {
+    for (const key of this.sortedKeys) {
+      callbackfn(this.map.get(key), key, this.map);
+    }
+  }
+}
+exports.SortedMap = SortedMap;
+//# sourceMappingURL=SortedMap.cjs.map

package/dist/cjs/SortedMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"SortedMap.cjs","sources":["../../src/SortedMap.ts"],"sourcesContent":["/**\n * A Map implementation that keeps its entries sorted based on a comparator function\n * @template TKey - The type of keys in the map\n * @template TValue - The type of values in the map\n */\nexport class SortedMap<TKey, TValue> {\n  private map: Map<TKey, TValue>\n  private sortedKeys: Array<TKey>\n  private comparator: (a: TValue, b: TValue) => number\n\n  /**\n   * Creates a new SortedMap instance\n   *\n   * @param comparator - Optional function to compare values for sorting\n   */\n  constructor(comparator?: (a: TValue, b: TValue) => number) {\n    this.map = new Map<TKey, TValue>()\n    this.sortedKeys = []\n    this.comparator = comparator || this.defaultComparator\n  }\n\n  /**\n   * Default comparator function used when none is provided\n   *\n   * @param a - First value to compare\n   * @param b - Second value to compare\n   * @returns -1 if a < b, 1 if a > b, 0 if equal\n   */\n  private defaultComparator(a: TValue, b: TValue): number {\n    if (a < b) return -1\n    if (a > b) return 1\n    return 0\n  }\n\n  /**\n   * Sets a key-value pair in the map and maintains sort order\n   *\n   * @param key - The key to set\n   * @param value - The value to associate with the key\n   * @returns This SortedMap instance for chaining\n   */\n  set(key: TKey, value: TValue): this {\n    this.map.set(key, value)\n\n    if (!this.sortedKeys.includes(key)) {\n      this.sortedKeys.push(key)\n    }\n\n    // Re-sort keys based on values\n    this.sortedKeys.sort((a, b) => {\n      const valueA = this.map.get(a)!\n      const valueB = this.map.get(b)!\n      return this.comparator(valueA, valueB)\n    })\n\n    return this\n  }\n\n  /**\n   * Gets a value by its key\n   *\n   * @param key - The key to look up\n   * @returns The value associated with the key, or undefined if not found\n   */\n  get(key: TKey): TValue | undefined {\n    return this.map.get(key)\n  }\n\n  /**\n   * Removes a key-value pair from the map\n   *\n   * @param key - The key to remove\n   * @returns True if the key was found and removed, false otherwise\n   */\n  delete(key: TKey): boolean {\n    if (this.map.delete(key)) {\n      const index = this.sortedKeys.indexOf(key)\n      this.sortedKeys.splice(index, 1)\n      return true\n    }\n    return false\n  }\n\n  /**\n   * Checks if a key exists in the map\n   *\n   * @param key - The key to check\n   * @returns True if the key exists, false otherwise\n   */\n  has(key: TKey): boolean {\n    return this.map.has(key)\n  }\n\n  /**\n   * Removes all key-value pairs from the map\n   */\n  clear(): void {\n    this.map.clear()\n    this.sortedKeys = []\n  }\n\n  /**\n   * Gets the number of key-value pairs in the map\n   */\n  get size(): number {\n    return this.map.size\n  }\n\n  /**\n   * Default iterator that returns entries in sorted order\n   *\n   * @returns An iterator for the map's entries\n   */\n  *[Symbol.iterator](): IterableIterator<[TKey, TValue]> {\n    for (const key of this.sortedKeys) {\n      yield [key, this.map.get(key)!] as [TKey, TValue]\n    }\n  }\n\n  /**\n   * Returns an iterator for the map's entries in sorted order\n   *\n   * @returns An iterator for the map's entries\n   */\n  entries(): IterableIterator<[TKey, TValue]> {\n    return this[Symbol.iterator]()\n  }\n\n  /**\n   * Returns an iterator for the map's keys in sorted order\n   *\n   * @returns An iterator for the map's keys\n   */\n  keys(): IterableIterator<TKey> {\n    return this.sortedKeys[Symbol.iterator]()\n  }\n\n  /**\n   * Returns an iterator for the map's values in sorted order\n   *\n   * @returns An iterator for the map's values\n   */\n  values(): IterableIterator<TValue> {\n    return function* (this: SortedMap<TKey, TValue>) {\n      for (const key of this.sortedKeys) {\n        yield this.map.get(key)!\n      }\n    }.call(this)\n  }\n\n  /**\n   * Executes a callback function for each key-value pair in the map in sorted order\n   *\n   * @param callbackfn - Function to execute for each entry\n   */\n  forEach(\n    callbackfn: (value: TValue, key: TKey, map: Map<TKey, TValue>) => void\n  ): void {\n    for (const key of this.sortedKeys) {\n      callbackfn(this.map.get(key)!, key, this.map)\n    }\n  }\n}\n"],"names":[],"mappings":";;AAKO,MAAM,UAAwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUnC,YAAY,YAA+C;AACpD,SAAA,0BAAU,IAAkB;AACjC,SAAK,aAAa,CAAC;AACd,SAAA,aAAa,cAAc,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAU/B,kBAAkB,GAAW,GAAmB;AAClD,QAAA,IAAI,EAAU,QAAA;AACd,QAAA,IAAI,EAAU,QAAA;AACX,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUT,IAAI,KAAW,OAAqB;AAC7B,SAAA,IAAI,IAAI,KAAK,KAAK;AAEvB,QAAI,CAAC,KAAK,WAAW,SAAS,GAAG,GAAG;AAC7B,WAAA,WAAW,KAAK,GAAG;AAAA,IAAA;AAI1B,SAAK,WAAW,KAAK,CAAC,GAAG,MAAM;AAC7B,YAAM,SAAS,KAAK,IAAI,IAAI,CAAC;AAC7B,YAAM,SAAS,KAAK,IAAI,IAAI,CAAC;AACtB,aAAA,KAAK,WAAW,QAAQ,MAAM;AAAA,IAAA,CACtC;AAEM,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAST,IAAI,KAA+B;AAC1B,WAAA,KAAK,IAAI,IAAI,GAAG;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASzB,OAAO,KAAoB;AACzB,QAAI,KAAK,IAAI,OAAO,GAAG,GAAG;AACxB,YAAM,QAAQ,KAAK,WAAW,QAAQ,GAAG;AACpC,WAAA,WAAW,OAAO,OAAO,CAAC;AACxB,aAAA;AAAA,IAAA;AAEF,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAST,IAAI,KAAoB;AACf,WAAA,KAAK,IAAI,IAAI,GAAG;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMzB,QAAc;AACZ,SAAK,IAAI,MAAM;AACf,SAAK,aAAa,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMrB,IAAI,OAAe;AACjB,WAAO,KAAK,IAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQlB,EAAE,OAAO,QAAQ,IAAsC;AAC1C,eAAA,OAAO,KAAK,YAAY;AACjC,YAAM,CAAC,KAAK,KAAK,IAAI,IAAI,GAAG,CAAE;AAAA,IAAA;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQF,UAA4C;AACnC,WAAA,KAAK,OAAO,QAAQ,EAAE;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ/B,OAA+B;AAC7B,WAAO,KAAK,WAAW,OAAO,QAAQ,EAAE;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ1C,SAAmC;AACjC,YAAO,aAA0C;AACpC,iBAAA,OAAO,KAAK,YAAY;AAC3B,cAAA,KAAK,IAAI,IAAI,GAAG;AAAA,MAAA;AAAA,IACxB,GACA,KAAK,IAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQb,QACE,YACM;AACK,eAAA,OAAO,KAAK,YAAY;AACjC,iBAAW,KAAK,IAAI,IAAI,GAAG,GAAI,KAAK,KAAK,GAAG;AAAA,IAAA;AAAA,EAC9C;AAEJ;;"}

package/dist/cjs/SortedMap.d.cts

@@ -0,0 +1,91 @@
+/**
+ * A Map implementation that keeps its entries sorted based on a comparator function
+ * @template TKey - The type of keys in the map
+ * @template TValue - The type of values in the map
+ */
+export declare class SortedMap<TKey, TValue> {
+    private map;
+    private sortedKeys;
+    private comparator;
+    /**
+     * Creates a new SortedMap instance
+     *
+     * @param comparator - Optional function to compare values for sorting
+     */
+    constructor(comparator?: (a: TValue, b: TValue) => number);
+    /**
+     * Default comparator function used when none is provided
+     *
+     * @param a - First value to compare
+     * @param b - Second value to compare
+     * @returns -1 if a < b, 1 if a > b, 0 if equal
+     */
+    private defaultComparator;
+    /**
+     * Sets a key-value pair in the map and maintains sort order
+     *
+     * @param key - The key to set
+     * @param value - The value to associate with the key
+     * @returns This SortedMap instance for chaining
+     */
+    set(key: TKey, value: TValue): this;
+    /**
+     * Gets a value by its key
+     *
+     * @param key - The key to look up
+     * @returns The value associated with the key, or undefined if not found
+     */
+    get(key: TKey): TValue | undefined;
+    /**
+     * Removes a key-value pair from the map
+     *
+     * @param key - The key to remove
+     * @returns True if the key was found and removed, false otherwise
+     */
+    delete(key: TKey): boolean;
+    /**
+     * Checks if a key exists in the map
+     *
+     * @param key - The key to check
+     * @returns True if the key exists, false otherwise
+     */
+    has(key: TKey): boolean;
+    /**
+     * Removes all key-value pairs from the map
+     */
+    clear(): void;
+    /**
+     * Gets the number of key-value pairs in the map
+     */
+    get size(): number;
+    /**
+     * Default iterator that returns entries in sorted order
+     *
+     * @returns An iterator for the map's entries
+     */
+    [Symbol.iterator](): IterableIterator<[TKey, TValue]>;
+    /**
+     * Returns an iterator for the map's entries in sorted order
+     *
+     * @returns An iterator for the map's entries
+     */
+    entries(): IterableIterator<[TKey, TValue]>;
+    /**
+     * Returns an iterator for the map's keys in sorted order
+     *
+     * @returns An iterator for the map's keys
+     */
+    keys(): IterableIterator<TKey>;
+    /**
+     * Returns an iterator for the map's values in sorted order
+     *
+     * @returns An iterator for the map's values
+     */
+    values(): IterableIterator<TValue>;
+    /**
+     * Executes a callback function for each key-value pair in the map in sorted order
+     *
+     * @param callbackfn - Function to execute for each entry
+     */
+    forEach(callbackfn: (value: TValue, key: TKey, map: Map<TKey, TValue>) => void): void;
+}