From b7a405332c0e95a0b8f8ff35ea170cf653a9d945 Mon Sep 17 00:00:00 2001
From: Bruno BELANYI <bruno@belanyi.fr>
Date: Wed, 29 Jan 2025 12:44:20 +0000
Subject: [PATCH 1/3] posts: kd-tree-revisited: fix title

---
 content/posts/2024-08-17-kd-tree-revisited/index.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/content/posts/2024-08-17-kd-tree-revisited/index.md b/content/posts/2024-08-17-kd-tree-revisited/index.md
index be15f48..b01fa3b 100644
--- a/content/posts/2024-08-17-kd-tree-revisited/index.md
+++ b/content/posts/2024-08-17-kd-tree-revisited/index.md
@@ -1,5 +1,5 @@
 ---
-title: "Kd Tree Revisited"
+title: "k-d Tree Revisited"
 date: 2024-08-17T14:20:22+01:00
 draft: false # I don't care for draft mode, git has branches for that
 description: "Simplifying the nearest neighbour search"

From 8ee2a234ec9d5a7da4840d31dfda05073413bb80 Mon Sep 17 00:00:00 2001
From: Bruno BELANYI <bruno@belanyi.fr>
Date: Wed, 29 Jan 2025 12:45:39 +0000
Subject: [PATCH 2/3] posts: kd-tree: fix typing

---
 content/posts/2024-08-10-kd-tree/index.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/content/posts/2024-08-10-kd-tree/index.md b/content/posts/2024-08-10-kd-tree/index.md
index 3135647..2863201 100644
--- a/content/posts/2024-08-10-kd-tree/index.md
+++ b/content/posts/2024-08-10-kd-tree/index.md
@@ -298,7 +298,7 @@ class AABB(NamedTuple):
         )
 
     # Extend a box to contain a given point
-    def extend(self, point: Point) -> None:
+    def extend(self, point: Point) -> AABB:
         low = NamedTuple(*(map(min, zip(self.low, point))))
         high = NamedTuple(*(map(max, zip(self.high, point))))
         return AABB(low, high)
@@ -392,7 +392,7 @@ class MaxHeap[T]:
         return heapq.heappop(self._heap).value
 
     # Pushes a value onto the heap, pops and returns the highest value
-    def pushpop(self, value: T) -> None:
+    def pushpop(self, value: T) -> T:
         return heapq.heappushpop(self._heap, Reverse(value)).value
 ```
 
@@ -452,7 +452,7 @@ class KdSplitNode[T]:
     def closest(
         self,
         point: Point,
-        out: list[ClosestPoint[T]],
+        out: MaxHeap[ClosestPoint[T]],
         n: int,
         bounds: AABB,
     ) -> None:

From f15aa0567eada3de4a24b6323bc570d1e9854af8 Mon Sep 17 00:00:00 2001
From: Bruno BELANYI <bruno@belanyi.fr>
Date: Wed, 29 Jan 2025 12:45:39 +0000
Subject: [PATCH 3/3] posts: kd-tree-revisited: fix typing

---
 content/posts/2024-08-17-kd-tree-revisited/index.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/content/posts/2024-08-17-kd-tree-revisited/index.md b/content/posts/2024-08-17-kd-tree-revisited/index.md
index b01fa3b..58d2a6b 100644
--- a/content/posts/2024-08-17-kd-tree-revisited/index.md
+++ b/content/posts/2024-08-17-kd-tree-revisited/index.md
@@ -92,7 +92,7 @@ class KdSplitNode[T]:
     def closest(
         self,
         point: Point,
-        out: list[ClosestPoint[T]],
+        out: MaxHeap[ClosestPoint[T]],
         n: int,
         projection: Point,
     ) -> None: