priorityQueue

DataTable
stable

Create a min-heap priority queue for generic items. Elements are inserted in priority order (lower number = higher priority) and the queue exposes enqueue, size, count, and dequeue operations.

API

Signature

Signature TypeScript complète, extraite du fichier util.

typescript

API

Paramètres

Paramètres d'entrée acceptés par cet util.

arr
T[]
[]
Optional seed array of elements. Each element is inserted with priority 0.

API

Valeur de retour

La valeur retournée par cet util.

An object with four methods: enqueue (insert with priority), size (total count), count (count of elements sharing the lowest-priority bucket), and dequeue (remove and return the next element).

Usage

Exemples

Extraits de code prêts à coller.

Sort items by priority

typescript