UNPKG

@tanstack/db

Version:

A reactive client store for building super fast apps on sync

168 lines (167 loc) 4.34 kB
"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; } /** * Finds the index where a key-value pair should be inserted to maintain sort order. * Uses binary search to find the correct position based on the value. * Hence, it is in O(log n) time. * * @param key - The key to find position for * @param value - The value to compare against * @returns The index where the key should be inserted */ indexOf(value) { let left = 0; let right = this.sortedKeys.length; while (left < right) { const mid = Math.floor((left + right) / 2); const midKey = this.sortedKeys[mid]; const midValue = this.map.get(midKey); const comparison = this.comparator(value, midValue); if (comparison < 0) { right = mid; } else if (comparison > 0) { left = mid + 1; } else { return mid; } } return left; } /** * 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) { if (this.map.has(key)) { const oldValue = this.map.get(key); const oldIndex = this.indexOf(oldValue); this.sortedKeys.splice(oldIndex, 1); } const index = this.indexOf(value); this.sortedKeys.splice(index, 0, key); this.map.set(key, value); 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.has(key)) { const oldValue = this.map.get(key); const index = this.indexOf(oldValue); this.sortedKeys.splice(index, 1); return this.map.delete(key); } 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