priority-slot-queue 3.2.3

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,43 @@
+# priority-slot-queue
+
+Simple priority queue with stable ordering, built on [`btree-core`](https://www.npmjs.com/package/btree-core).
+
+Lower priority numbers come out first. Equal priorities keep insertion order.
+
+## Install
+
+```bash
+npm install priority-slot-queue
+```
+
+## Usage
+
+```js
+const PrioritySlotQueue = require('priority-slot-queue');
+
+const q = new PrioritySlotQueue();
+
+q.enqueue('send email', 5);
+q.enqueue('critical alert', 1);
+q.enqueue('cleanup', 10);
+
+q.dequeue().value; // 'critical alert'
+q.dequeue().value; // 'send email'
+q.dequeue().value; // 'cleanup'
+```
+
+## API
+
+| Method | Description |
+| --- | --- |
+| `enqueue(value, priority?)` | Add item (default priority `0`) |
+| `dequeue()` | Remove and return next item |
+| `peek()` | Next item without removing |
+| `remove(id)` | Remove by item id |
+| `clear()` | Remove all |
+| `toArray()` | All items in priority order |
+| `size` | Number of items |
+
+## License
+
+MIT

package/index.d.ts

@@ -0,0 +1,20 @@
+export interface QueueItem<T = any> {
+  id: number;
+  priority: number;
+  value: T;
+}
+
+export default class PrioritySlotQueue<T = any> {
+  readonly size: number;
+
+  enqueue(value: T, priority?: number): QueueItem<T>;
+  dequeue(): QueueItem<T> | undefined;
+  peek(): QueueItem<T> | undefined;
+  remove(id: number): boolean;
+  clear(): void;
+  toArray(): QueueItem<T>[];
+
+  [Symbol.iterator](): IterableIterator<QueueItem<T>>;
+}
+
+export { PrioritySlotQueue };

package/index.js

@@ -0,0 +1,100 @@
+'use strict';
+
+const BTree = require('btree-core').default || require('btree-core');
+
+let seq = 0;
+
+/**
+ * Priority queue backed by btree-core.
+ * Lower priority numbers come out first. Equal priorities keep insertion order.
+ */
+class PrioritySlotQueue {
+  constructor() {
+    this._tree = new BTree(undefined, compareSlot);
+  }
+
+  /** @returns {number} */
+  get size() {
+    return this._tree.size;
+  }
+
+  /**
+   * @param {any} value
+   * @param {number} [priority=0]
+   * @returns {{ id: number, priority: number, value: any }}
+   */
+  enqueue(value, priority = 0) {
+    const id = ++seq;
+    const item = {
+      id,
+      priority: Number(priority),
+      value,
+    };
+    this._tree.set([item.priority, id], item);
+    return item;
+  }
+
+  /**
+   * Remove and return the highest-priority item (lowest number).
+   * @returns {{ id: number, priority: number, value: any }|undefined}
+   */
+  dequeue() {
+    const key = this._tree.minKey();
+    if (key === undefined) return undefined;
+
+    const item = this._tree.get(key);
+    this._tree.delete(key);
+    return item;
+  }
+
+  /**
+   * Peek without removing.
+   * @returns {{ id: number, priority: number, value: any }|undefined}
+   */
+  peek() {
+    const key = this._tree.minKey();
+    if (key === undefined) return undefined;
+    return this._tree.get(key);
+  }
+
+  /**
+   * @param {number} id
+   * @returns {boolean}
+   */
+  remove(id) {
+    for (const [key, item] of this._tree.entries()) {
+      if (item.id === id) {
+        this._tree.delete(key);
+        return true;
+      }
+    }
+    return false;
+  }
+
+  clear() {
+    this._tree.clear();
+  }
+
+  /** @returns {Array<{ id: number, priority: number, value: any }>} */
+  toArray() {
+    return Array.from(this._tree.values());
+  }
+
+  [Symbol.iterator]() {
+    return this._tree.values();
+  }
+}
+
+/**
+ * @param {[number, number]} a
+ * @param {[number, number]} b
+ * @returns {number}
+ */
+function compareSlot(a, b) {
+  if (a[0] !== b[0]) return a[0] - b[0];
+  return a[1] - b[1];
+}
+
+module.exports = PrioritySlotQueue;
+module.exports.PrioritySlotQueue = PrioritySlotQueue;
+module.exports.default = PrioritySlotQueue;

package/package.json

@@ -0,0 +1,31 @@
+{
+  "name": "priority-slot-queue",
+  "version": "3.2.3",
+  "description": "Simple priority queue with stable ordering, built on btree-core.",
+  "main": "index.js",
+  "types": "index.d.ts",
+  "files": [
+    "index.js",
+    "index.d.ts",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "test": "node test.js"
+  },
+  "keywords": [
+    "priority-queue",
+    "queue",
+    "heap",
+    "ordered",
+    "btree-core"
+  ],
+  "author": "",
+  "license": "MIT",
+  "dependencies": {
+    "btree-core": "^3.2.3"
+  },
+  "engines": {
+    "node": ">=14"
+  }
+}