From efdf50a55a32c18c3563b883563f271531a6c38b Mon Sep 17 00:00:00 2001
From: Julien Dessaux
Date: Sun, 14 May 2023 01:50:19 +0200
Subject: Implemented a basic extraction loop

---
 lib/priority_queue.js | 39 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 lib/priority_queue.js

(limited to 'lib/priority_queue.js')

diff --git a/lib/priority_queue.js b/lib/priority_queue.js
new file mode 100644
index 0000000..da526b2
--- /dev/null
+++ b/lib/priority_queue.js
@@ -0,0 +1,39 @@
+export class QElement {
+	constructor(element, priority) {
+		this.element = element;
+		this.priority = priority;
+	}
+}
+
+export class PriorityQueue {
+	constructor(elt) {
+		this.items = [];
+		if (elt !== undefined) {
+			this.enqueue(elt, 0);
+		}
+	}
+
+	enqueue(element, priority) {
+		let qElement = new QElement(element, priority);
+
+		for (let i = 0; i < this.items.length; ++i) {
+			if (this.items[i].priority > qElement.priority) {
+				this.items.splice(i, 0, qElement);
+				return;
+			}
+		}
+		this.items.push(qElement);
+	}
+	dequeue() {
+		return this.items.shift(); // we would use pop to get the highest priority, shift() gives us the lowest priority
+	}
+	front() {
+		return this.items[0];
+	}
+	rear() {
+		return this.items[this.items.length - 1];
+	}
+	isEmpty() {
+		return this.items.length === 0;
+	}
+}
-- 
cgit v1.2.3