ambroisie/blog
ambroisie/blog
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

posts: kd-tree: fix typing

Browse source
This commit is contained in:
Bruno BELANYI 2025-01-29 12:45:39 +00:00
parent b7a405332c
commit 8ee2a234ec
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
content/posts/2024-08-10-kd-tree/index.md
View file

@ -298,7 +298,7 @@ class AABB(NamedTuple):
) )
# Extend a box to contain a given point # 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)))) low = NamedTuple(*(map(min, zip(self.low, point))))
high = NamedTuple(*(map(max, zip(self.high, point)))) high = NamedTuple(*(map(max, zip(self.high, point))))
return AABB(low, high) return AABB(low, high)
@ -392,7 +392,7 @@ class MaxHeap[T]:
return heapq.heappop(self._heap).value return heapq.heappop(self._heap).value
# Pushes a value onto the heap, pops and returns the highest 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 return heapq.heappushpop(self._heap, Reverse(value)).value
``` ```
@ -452,7 +452,7 @@ class KdSplitNode[T]:
def closest( def closest(
self, self,
point: Point, point: Point,
out: list[ClosestPoint[T]], out: MaxHeap[ClosestPoint[T]],
n: int, n: int,
bounds: AABB, bounds: AABB,
) -> None: ) -> None: