From 28ec48cc859f4ccae49379c74aa096668ec1040a Mon Sep 17 00:00:00 2001
From: Niklas Kapelle <niklas@kapelle.org>
Date: Sat, 12 Oct 2024 20:58:10 +0200
Subject: [PATCH] added PriorityQueue for later use

---
 src/lib/PriorityQueue.hx | 69 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 69 insertions(+)
 create mode 100644 src/lib/PriorityQueue.hx

diff --git a/src/lib/PriorityQueue.hx b/src/lib/PriorityQueue.hx
new file mode 100644
index 0000000..c014b7a
--- /dev/null
+++ b/src/lib/PriorityQueue.hx
@@ -0,0 +1,69 @@
+package lib;
+
+using Lambda;
+
+abstract PriorityQueue<T>(Array<{prio:Float, val:T}>) {
+	public inline function new() {
+		this = [];
+	}
+
+	public function containsElement(element:T):Bool {
+		return this.exists((e) -> e.val == element);
+	}
+
+	public function isEmpty():Bool {
+		return this.length == 0;
+	}
+
+	public function insert(e:T, prio:Float) {
+		this.push({prio: prio, val: e});
+		bubbleUp(this.length - 1);
+	}
+
+	public function extractMin():Null<T> {
+		if (this.length == 0) {
+			return null;
+		}
+
+		swap(0, this.length - 1);
+		var minElement = this.pop();
+
+		bubbleDown(0);
+
+		return minElement.val;
+	}
+
+	private function bubbleUp(index:Int) {
+		var parentIndex:Int = Math.floor((index - 1) / 2);
+
+		if (index > 0 && this[index].prio < this[parentIndex].prio) {
+			swap(index, parentIndex);
+			bubbleUp(parentIndex);
+		}
+	}
+
+	private function bubbleDown(index:Int) {
+		var leftIndex = 2 * index + 1;
+		var rightIndex = 2 * index + 2;
+		var smallest = index;
+
+		if (leftIndex < this.length && this[leftIndex].prio < this[smallest].prio) {
+			smallest = leftIndex;
+		}
+
+		if (rightIndex < this.length && this[rightIndex].prio < this[smallest].prio) {
+			smallest = rightIndex;
+		}
+
+		if (smallest != index) {
+			swap(index, smallest);
+			bubbleDown(smallest);
+		}
+	}
+
+	private function swap(i:Int, j:Int) {
+		var tmp = this[i];
+		this[i] = this[j];
+		this[j] = tmp;
+	}
+}