fastquadtree 0.8.0__tar.gz → 0.8.1__tar.gz

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/Cargo.lock

@@ -22,7 +22,7 @@ checksum = "2fd1289c04a9ea8cb22300a459a72a385d7c73d3259e2ed7dcb2af674838cfa9"
 
 [[package]]
 name = "fastquadtree"
-version = "0.8.0"
+version = "0.8.1"
 dependencies = [
  "pyo3",
  "smallvec",

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "fastquadtree"
-version = "0.8.0"
+version = "0.8.1"
 edition = "2021"
 readme = "README.md"
 

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: fastquadtree
-Version: 0.8.0
+Version: 0.8.1
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Programming Language :: Rust

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/docs/benchmark.md

@@ -33,6 +33,8 @@ Quadtrees are the focus of the benchmark, but Rtrees are included for reference.
 | Max depth | 16 |
 | Queries per experiment | 500 |
 
+---------
+
 ## Native vs Shim
 
 ### Configuration
@@ -55,6 +57,8 @@ Using the shim with object tracking increases build time by 3.604x and query tim
 
 Adding the object map only impacts the build time, not the query time.
 
+---------
+
 ## System Info
 - **OS**: Windows 11 AMD64
 - **Python**: CPython 3.12.2

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/docs/index.md

@@ -39,6 +39,7 @@
 - Fast inserts and queries on hundreds of thousands of points
 - Optional object tracking for id ↔ object mapping
 - Clean integrations for range queries and nearest neighbors
+- Support for inserting bounding boxes or points
 
 ## Install
 ```bash

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/docs/quickstart.md

@@ -2,7 +2,7 @@
 
 Meet **fastquadtree** — a Rust powered spatial index for Python
 
-> TLDR: create a tree, insert points, query ranges or nearest neighbors.
+> TLDR: create a tree, insert points, insert boxes, query ranges or nearest neighbors.
 
 ## Installation
 

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/docs/runnables.md

@@ -21,6 +21,8 @@ pip install -r interactive/requirements.txt
 python interactive/interactive_v2_rect.py
 ```
 
+![Interactive_V2_Rect_Screenshot](https://raw.githubusercontent.com/Elan456/fastquadtree/main/assets/interactive_v2_rect_screenshot.png)
+
 ## 2. Ball Pit  
 - Spawn balls in a pit with physics-based collisions
 - Easily switch between brute force and quadtree collision detection to see the performance difference

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/interactive/interactive_v2_rect.py

@@ -85,8 +85,8 @@ class Box:
         spd = random.uniform(60.0, 160.0)
         self.vx = math.cos(ang) * spd
         self.vy = math.sin(ang) * spd
-        self.w = random.uniform(8.0, 20.0)
-        self.h = random.uniform(8.0, 20.0)
+        self.w = random.uniform(8.0, 200.0)
+        self.h = random.uniform(8.0, 200.0)
 
     def update(self, dt):
         self.x += self.vx * dt

{fastquadtree-0.8.0 → fastquadtree-0.8.1}/pysrc/fastquadtree/rect_quadtree.py

@@ -59,7 +59,9 @@ class RectQuadTree(_BaseQuadTree[Bounds, _IdRect, RectItem]):
     ) -> list[_IdRect]: ...
     @overload
     def query(self, rect: Bounds, *, as_items: Literal[True]) -> list[RectItem]: ...
-    def query(self, rect: Bounds, *, as_items: bool = False):
+    def query(
+        self, rect: Bounds, *, as_items: bool = False
+    ) -> list[_IdRect] | list[RectItem]:
         """
         Query the tree for all items that intersect the given rectangle.