https://github.com/badrap/sorted-queue

A sorted queue, based on an array-backed binary heap
https://github.com/badrap/sorted-queue

javascript priority-queue typescript

Last synced: about 2 months ago
JSON representation

A sorted queue, based on an array-backed binary heap

• Host: GitHub
• URL: https://github.com/badrap/sorted-queue
• Owner: badrap
• License: mit
• Created: 2019-11-25T10:53:31.000Z (almost 5 years ago)
• Default Branch: main
• Last Pushed: 2024-05-02T14:26:12.000Z (5 months ago)
• Last Synced: 2024-05-19T12:29:04.512Z (4 months ago)
• Topics: javascript, priority-queue, typescript
• Language: TypeScript
• Homepage:
• Size: 572 KB
• Stars: 106
• Watchers: 2
• Forks: 3
• Open Issues: 2
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# sorted-queue ![](https://github.com/badrap/sorted-queue/workflows/tests/badge.svg) [![npm](https://img.shields.io/npm/v/sorted-queue.svg)](https://www.npmjs.com/package/sorted-queue)

A sorted queue, based on an array-backed binary heap.

> [!NOTE]

> While this package is still evolving, we're currently not accepting any new feature requests or suggestions. Please use the issue tracker for bug reports and security concerns, which we highly value and welcome. Thank you for your understanding ❤️

## Installation

```sh

$ npm i sorted-queue

```

## Usage

```ts

import { SortedQueue } from "sorted-queue";

const queue = new SortedQueue();

// `queue.push()` adds a value to the queue and returns an object

// `item` with the `item.value` set to the pushed value.

queue.push(1); // { value: 1, ... }

queue.push(-1); // { value: -1, ... }

queue.push(0); // { value: 0, ... }

// `queue.peek()` returns the item with the smallest value.

queue.peek().value; // -1

// `queue.pop()` returns the item with the smallest value

// and also removes it from the queue.

queue.pop().value; // -1

queue.pop().value; // 0

queue.pop().value; // 1

// `pop()` and `peek()` return `undefined` when the queue is empty

queue.pop(); // undefined

queue.peek(); // undefined

// `empty()` returns `true` when the queue is empty, `false` otherwise

queue.empty(); // true

// Items returned by push() can also be removed using `item.pop()`.

const first = queue.push(0);

const middle = queue.push(1);

const last = queue.push(2);

// `item.pop()` returns `true` if the item existed in the queue, and

// `false` if the item has already been removed previously.

middle.pop(); // true

middle.pop(); // false

// The order is preserved no matter from which position the item got

// removed from.

first.pop(); // true

queue.pop().value; // 2

queue.pop(); // undefined

// For more complex sortings you can defined a custom comparison function

// (with the same signature as the comparison function Array#sort takes).

const custom = new SortedQueue<{ name: string }>((a, b) =>

  a.name.localeCompare(b.name)

);

custom.push({ name: "Mallory" });

custom.push({ name: "Alice" });

custom.push({ name: "Bob" });

custom.pop().value; // { name: "Alice" }

custom.pop().value; // { name: "Bob" }

custom.pop().value; // { name: "Mallory" }

```

## License

This library is licensed under the MIT license. See [LICENSE](./LICENSE).