@llblab/uniqueue 1.1.0 → 1.2.0

package/README.md

@@ -11,7 +11,7 @@ Combines a binary heap with a key-to-index `Map`, enabling O(log n) inserts/upda
 - **O(1) Lookup**: Tracks item positions internally, avoiding O(n) scans for updates.
 - **Max Size Eviction**: Automatically removes the lowest-priority item when the limit is reached.
 - **Iterable**: Supports `for...of` iteration over items.
-- **Zero Dependencies**: ~1KB minified.
+- **Zero Dependencies**: ~1.7KB minified, ~0.7KB gzipped.
 
 ## Installation
 
@@ -24,10 +24,10 @@ npm install @llblab/uniqueue
 ### Basic Example (Max Heap)
 
 ```javascript
-import { UniQueue } from "@llblab/uniqueue";
+import { Uniqueue } from "@llblab/uniqueue";
 
 // Create a max-heap for leaderboard scores
-const leaderboard = new UniQueue({
+const leaderboard = new Uniqueue({
   compare: (a, b) => b.score - a.score, // Sort by score descending
   extractKey: (item) => item.playerId, // Unique by playerId
   maxSize: 3, // Keep only top 3 scores
@@ -60,7 +60,7 @@ for (const player of leaderboard) {
 
 ## API
 
-### `new UniQueue(options)`
+### `new Uniqueue(options)`
 
 Creates a new priority queue instance.
 

package/dist/index.d.ts

@@ -1,14 +1,14 @@
-export interface UniQueueOptions<T> {
+export interface UniqueueOptions<T> {
     data?: T[];
     maxSize?: number;
     compare?: (a: T, b: T) => number;
     extractKey?: (item: T) => string;
 }
-export declare class UniQueue<T> {
+export declare class Uniqueue<T> {
     #private;
     data: T[];
     indexes: Map<string, number>;
-    constructor({ data, maxSize, compare, extractKey, }?: UniQueueOptions<T>);
+    constructor({ data, maxSize, compare, extractKey, }?: UniqueueOptions<T>);
     push(item: T): T | undefined;
     pop(): T | undefined;
     peek(): T | undefined;

package/dist/index.js

@@ -1,62 +1,94 @@
-var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
-    if (kind === "m") throw new TypeError("Private method is not writable");
-    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
-    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
-    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
-};
-var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
-    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
-    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
-    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
-};
-var _UniQueue_instances, _UniQueue_maxSize, _UniQueue_compare, _UniQueue_extractKey, _UniQueue_siftUp, _UniQueue_siftDown;
-export class UniQueue {
+export class Uniqueue {
+    data;
+    indexes;
+    #maxSize;
+    #compare;
+    #extractKey;
     constructor({ data = [], maxSize = Infinity, compare = (a, b) => (a < b ? -1 : a > b ? 1 : 0), extractKey = (item) => item, } = {}) {
-        _UniQueue_instances.add(this);
-        _UniQueue_maxSize.set(this, void 0);
-        _UniQueue_compare.set(this, void 0);
-        _UniQueue_extractKey.set(this, void 0);
         this.data = data;
         this.indexes = new Map(data.map((item, index) => [extractKey(item), index]));
-        __classPrivateFieldSet(this, _UniQueue_maxSize, maxSize, "f");
-        __classPrivateFieldSet(this, _UniQueue_compare, compare, "f");
-        __classPrivateFieldSet(this, _UniQueue_extractKey, extractKey, "f");
+        this.#maxSize = maxSize;
+        this.#compare = compare;
+        this.#extractKey = extractKey;
         if (data.length > 0) {
             for (let i = (data.length >>> 1) - 1; i >= 0; i--) {
-                __classPrivateFieldGet(this, _UniQueue_instances, "m", _UniQueue_siftDown).call(this, i);
+                this.#siftDown(i);
             }
         }
     }
+    #siftUp(pos) {
+        const { data, indexes } = this;
+        const compare = this.#compare;
+        const extractKey = this.#extractKey;
+        const item = data[pos];
+        while (pos > 0) {
+            const parentIndex = (pos - 1) >>> 1;
+            const parent = data[parentIndex];
+            if (compare(item, parent) >= 0)
+                break;
+            indexes.set(extractKey(parent), pos);
+            data[pos] = parent;
+            pos = parentIndex;
+        }
+        indexes.set(extractKey(item), pos);
+        data[pos] = item;
+    }
+    #siftDown(pos) {
+        const { data, indexes } = this;
+        const compare = this.#compare;
+        const extractKey = this.#extractKey;
+        const item = data[pos];
+        const halfLength = data.length >>> 1;
+        while (pos < halfLength) {
+            let leftIndex = (pos << 1) + 1;
+            let best = data[leftIndex];
+            const rightIndex = leftIndex + 1;
+            if (rightIndex < data.length) {
+                const right = data[rightIndex];
+                if (compare(right, best) < 0) {
+                    leftIndex = rightIndex;
+                    best = right;
+                }
+            }
+            if (compare(best, item) >= 0)
+                break;
+            indexes.set(extractKey(best), pos);
+            data[pos] = best;
+            pos = leftIndex;
+        }
+        indexes.set(extractKey(item), pos);
+        data[pos] = item;
+    }
     push(item) {
-        const key = __classPrivateFieldGet(this, _UniQueue_extractKey, "f").call(this, item);
+        const key = this.#extractKey(item);
         const index = this.indexes.get(key);
         if (index === undefined) {
             this.data.push(item);
-            __classPrivateFieldGet(this, _UniQueue_instances, "m", _UniQueue_siftUp).call(this, this.data.length - 1);
-            if (this.data.length <= __classPrivateFieldGet(this, _UniQueue_maxSize, "f"))
+            this.#siftUp(this.data.length - 1);
+            if (this.data.length <= this.#maxSize)
                 return;
             return this.pop();
         }
         const oldItem = this.data[index];
         this.data[index] = item;
-        const cmp = __classPrivateFieldGet(this, _UniQueue_compare, "f").call(this, oldItem, item);
+        const cmp = this.#compare(oldItem, item);
         if (cmp < 0) {
-            __classPrivateFieldGet(this, _UniQueue_instances, "m", _UniQueue_siftDown).call(this, index);
+            this.#siftDown(index);
         }
         else if (cmp > 0) {
-            __classPrivateFieldGet(this, _UniQueue_instances, "m", _UniQueue_siftUp).call(this, index);
+            this.#siftUp(index);
         }
     }
     pop() {
         if (this.data.length === 0)
             return;
         const top = this.data[0];
-        this.indexes.delete(__classPrivateFieldGet(this, _UniQueue_extractKey, "f").call(this, top));
+        this.indexes.delete(this.#extractKey(top));
         const bottom = this.data.pop();
         if (this.data.length > 0 && bottom !== undefined) {
-            this.indexes.set(__classPrivateFieldGet(this, _UniQueue_extractKey, "f").call(this, bottom), 0);
+            this.indexes.set(this.#extractKey(bottom), 0);
             this.data[0] = bottom;
-            __classPrivateFieldGet(this, _UniQueue_instances, "m", _UniQueue_siftDown).call(this, 0);
+            this.#siftDown(0);
         }
         return top;
     }
@@ -75,14 +107,14 @@ export class UniQueue {
         }
         const item = this.data.pop();
         this.indexes.delete(key);
-        this.indexes.set(__classPrivateFieldGet(this, _UniQueue_extractKey, "f").call(this, item), index);
+        this.indexes.set(this.#extractKey(item), index);
         this.data[index] = item;
         const parentIndex = (index - 1) >>> 1;
-        if (index > 0 && __classPrivateFieldGet(this, _UniQueue_compare, "f").call(this, item, this.data[parentIndex]) < 0) {
-            __classPrivateFieldGet(this, _UniQueue_instances, "m", _UniQueue_siftUp).call(this, index);
+        if (index > 0 && this.#compare(item, this.data[parentIndex]) < 0) {
+            this.#siftUp(index);
         }
         else {
-            __classPrivateFieldGet(this, _UniQueue_instances, "m", _UniQueue_siftDown).call(this, index);
+            this.#siftDown(index);
         }
         return true;
     }
@@ -100,48 +132,7 @@ export class UniQueue {
     get size() {
         return this.data.length;
     }
-    *[(_UniQueue_maxSize = new WeakMap(), _UniQueue_compare = new WeakMap(), _UniQueue_extractKey = new WeakMap(), _UniQueue_instances = new WeakSet(), _UniQueue_siftUp = function _UniQueue_siftUp(pos) {
-        const { data, indexes } = this;
-        const compare = __classPrivateFieldGet(this, _UniQueue_compare, "f");
-        const extractKey = __classPrivateFieldGet(this, _UniQueue_extractKey, "f");
-        const item = data[pos];
-        while (pos > 0) {
-            const parentIndex = (pos - 1) >>> 1;
-            const parent = data[parentIndex];
-            if (compare(item, parent) >= 0)
-                break;
-            indexes.set(extractKey(parent), pos);
-            data[pos] = parent;
-            pos = parentIndex;
-        }
-        indexes.set(extractKey(item), pos);
-        data[pos] = item;
-    }, _UniQueue_siftDown = function _UniQueue_siftDown(pos) {
-        const { data, indexes } = this;
-        const compare = __classPrivateFieldGet(this, _UniQueue_compare, "f");
-        const extractKey = __classPrivateFieldGet(this, _UniQueue_extractKey, "f");
-        const item = data[pos];
-        const halfLength = data.length >>> 1;
-        while (pos < halfLength) {
-            let leftIndex = (pos << 1) + 1;
-            let best = data[leftIndex];
-            const rightIndex = leftIndex + 1;
-            if (rightIndex < data.length) {
-                const right = data[rightIndex];
-                if (compare(right, best) < 0) {
-                    leftIndex = rightIndex;
-                    best = right;
-                }
-            }
-            if (compare(best, item) >= 0)
-                break;
-            indexes.set(extractKey(best), pos);
-            data[pos] = best;
-            pos = leftIndex;
-        }
-        indexes.set(extractKey(item), pos);
-        data[pos] = item;
-    }, Symbol.iterator)]() {
+    *[Symbol.iterator]() {
         yield* this.data;
     }
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@llblab/uniqueue",
-  "version": "1.1.0",
+  "version": "1.2.0",
   "description": "High-performance priority queue with unique key constraint (O(1) lookup, O(log n) update)",
   "type": "module",
   "main": "dist/index.js",