fastquadtree 0.7.0__tar.gz → 0.8.0__tar.gz

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

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

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

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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: fastquadtree
-Version: 0.7.0
+Version: 0.8.0
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Programming Language :: Rust
@@ -12,8 +12,8 @@ Classifier: Topic :: Software Development :: Libraries
 Classifier: Typing :: Typed
 Classifier: License :: OSI Approved :: MIT License
 Requires-Dist: ruff>=0.6.0 ; extra == 'dev'
-Requires-Dist: pytest>=7.0 ; extra == 'dev'
-Requires-Dist: pytest-cov>=4.1 ; extra == 'dev'
+Requires-Dist: pytest>=8.4.2 ; extra == 'dev'
+Requires-Dist: pytest-cov>=7.0.0 ; extra == 'dev'
 Requires-Dist: coverage>=7.5 ; extra == 'dev'
 Requires-Dist: mypy>=1.10 ; extra == 'dev'
 Requires-Dist: build>=1.2.1 ; extra == 'dev'
@@ -23,6 +23,7 @@ Requires-Dist: mkdocstrings[python] ; extra == 'dev'
 Requires-Dist: mkdocs-autorefs ; extra == 'dev'
 Requires-Dist: mkdocs-git-revision-date-localized-plugin ; extra == 'dev'
 Requires-Dist: mkdocs-minify-plugin ; extra == 'dev'
+Requires-Dist: maturin>=1.5 ; extra == 'dev'
 Provides-Extra: dev
 License-File: LICENSE
 Summary: Rust-accelerated quadtree for Python with fast inserts, range queries, and k-NN search.
@@ -45,7 +46,7 @@ Project-URL: Issues, https://github.com/Elan456/fastquadtree/issues
 
 [![PyPI Downloads](https://static.pepy.tech/personalized-badge/fastquadtree?period=total&units=INTERNATIONAL_SYSTEM&left_color=GRAY&right_color=BLUE&left_text=Total+Downloads)](https://pepy.tech/projects/fastquadtree)
 
-[![Build](https://github.com/Elan456/fastquadtree/actions/workflows/release.yml/badge.svg)](https://github.com/Elan456/fastquadtree/actions/workflows/ci.yml)
+[![Build](https://github.com/Elan456/fastquadtree/actions/workflows/release.yml/badge.svg)](https://github.com/Elan456/fastquadtree/actions/workflows/release.yml)
 [![Codecov](https://codecov.io/gh/Elan456/fastquadtree/branch/main/graph/badge.svg)](https://codecov.io/gh/Elan456/fastquadtree)
 
 [![Rust core via PyO3](https://img.shields.io/badge/Rust-core%20via%20PyO3-orange)](https://pyo3.rs/)
@@ -76,7 +77,6 @@ fastquadtree **outperforms** all other quadtree Python packages, including the R
 
 ### Summary (largest dataset, PyQtree baseline)
 - Points: **250,000**, Queries: **500**
---------------------
 - Fastest total: **fastquadtree** at **0.120 s**
 
 | Library | Build (s) | Query (s) | Total (s) | Speed vs PyQtree |
@@ -89,7 +89,7 @@ fastquadtree **outperforms** all other quadtree Python packages, including the R
 | PyQtree      | 1.492 | 0.263 | 1.755 | 1.00× |
 | quads        | 1.407 | 0.484 | 1.890 | 0.93× |
 
-#### Benchmark Configuration
+### Benchmark Configuration
 | Parameter | Value |
 |---|---:|
 | Bounds | (0, 0, 1000, 1000) |
@@ -97,11 +97,13 @@ fastquadtree **outperforms** all other quadtree Python packages, including the R
 | Max depth | 16 |
 | Queries per experiment | 500 |
 
+See the [benchmark section](https://elan456.github.io/fastquadtree/benchmark/) for details.
+
 ## Install
 
 ```bash
 pip install fastquadtree
-````
+```
 
 If you are developing locally:
 
@@ -111,77 +113,11 @@ maturin develop --release
 ```
 
 ## Quickstart
-
-```python
-from fastquadtree import QuadTree
-
-# Bounds are (min_x, min_y, max_x, max_y)
-qt = QuadTree(bounds=(0, 0, 1000, 1000), capacity=20)  # max_depth is optional
-
-# Insert points with auto ids
-id1 = qt.insert((10, 10))
-id2 = qt.insert((200, 300))
-id3 = qt.insert((999, 500), id=42)  # you can supply your own id
-
-# Axis-aligned rectangle query
-hits = qt.query((0, 0, 250, 350))  # returns [(id, x, y), ...] by default
-print(hits)  # e.g. [(1, 10.0, 10.0), (2, 200.0, 300.0)]
-
-# Nearest neighbor
-best = qt.nearest_neighbor((210, 310))  # -> (id, x, y) or None
-print(best)
-
-# k-nearest neighbors
-top3 = qt.nearest_neighbors((210, 310), 3)
-print(top3)  # list of up to 3 (id, x, y) tuples
-
-# Delete items by ID and location
-deleted = qt.delete(id2, (200, 300))  # True if found and deleted
-print(f"Deleted: {deleted}")
-print(f"Remaining items: {qt.count_items()}")
-
-# For object tracking with track_objects=True
-qt_tracked = QuadTree((0, 0, 1000, 1000), capacity=4, track_objects=True)
-player1 = {"name": "Alice", "score": 100}
-player2 = {"name": "Bob", "score": 200}
-
-id1 = qt_tracked.insert((50, 50), obj=player1)
-id2 = qt_tracked.insert((150, 150), obj=player2)
-
-# Delete by object reference (O(1) lookup!)
-deleted = qt_tracked.delete_by_object(player1)
-print(f"Deleted player: {deleted}")  # True
-```
-
-### Working with Python objects
-
-You can keep the tree pure and manage your own id → object map, or let the wrapper manage it.
-
-**Wrapper Managed Objects**
-
-```python
-from fastquadtree import QuadTree
-
-qt = QuadTree((0, 0, 1000, 1000), capacity=16, track_objects=True)
-
-# Store the object alongside the point
-qt.insert((25, 40), obj={"name": "apple"})
-
-# Ask for Item objects within a bounding box
-items = qt.query((0, 0, 100, 100), as_items=True)
-for it in items:
-    print(it.id, it.x, it.y, it.obj)
-```
-
-You can also attach or replace an object later:
-
-```python
-qt.attach(123, my_object)  # binds object to id 123
-```
+[See the quickstart guide](https://elan456.github.io/fastquadtree/quickstart/)
 
 ## API
 
-[Full api for QuadTree](https://elan456.github.io/fastquadtree/api/quadtree/)
+[See the full API](https://elan456.github.io/fastquadtree/api/quadtree/)
 
 ### `QuadTree(bounds, capacity, max_depth=None, track_objects=False, start_id=1)`
 
@@ -191,38 +127,17 @@ qt.attach(123, my_object)  # binds object to id 123
 * `track_objects` — if `True`, the wrapper maintains an id → object map for convenience.
 * `start_id` — starting value for auto-assigned ids
 
-### Core Methods
+### Key Methods
 
 - `insert(xy, *, id=None, obj=None) -> int`
 
-- `insert_many_points(points) -> int`
-
 - `query(rect, *, as_items=False) -> list`
 
 - `nearest_neighbor(xy, *, as_item=False) -> (id, x, y) | Item | None`
 
-- `nearest_neighbors(xy, k, *, as_items=False) -> list`
-
 - `delete(id, xy) -> bool`
 
-- `delete_by_object(obj) -> bool (requires track_objects=True)`
-
-- `clear(*, reset_ids=False) -> None`
-
-- `attach(id, obj) -> None (requires track_objects=True)`
-
-- `count_items() -> int`
-
-- `get(id) -> object | None`
-
-- `get_all_rectangles() -> list[tuple] (for visualization)`
-
-- `get_all_objects() -> list[object] (requires track_objects=True)`
-
-### `Item` (returned when `as_items=True`)
-
-* Attributes: `id`, `x`, `y`, and a lazy `obj` property
-* Accessing `obj` performs a dictionary lookup only if tracking is enabled
+There are more methods and object tracking versions in the [docs](https://elan456.github.io/fastquadtree/api/quadtree/).
 
 ### Geometric conventions
 
@@ -236,52 +151,8 @@ qt.attach(123, my_object)  # binds object to id 123
 * Choose `capacity` so that leaves keep a small batch of points. Typical values are 8 to 64.
 * If your data is very skewed, set a `max_depth` to prevent long chains.
 * For fastest local runs, use `maturin develop --release`.
-* The wrapper only maintains an ID -> Obj map only if the quadtree was constructed with `track_objects=True`. If you don't need it, leave it off for best performance. Look at the [Native vs Shim Benchmark](#native-vs-shim-benchmark) below for details.
-
-
-### Native vs Shim Benchmark
-
-**Setup**
-- Points: 500,000
-- Queries: 500
-- Repeats: 5
-
-**Timing (seconds)**
-
-| Variant | Build | Query | Total |
-|---|---:|---:|---:|
-| Native | 0.483 | 4.380 | 4.863 |
-| Shim (no map) | 0.668 | 4.167 | 4.835 |
-| Shim (track+objs) | 1.153 | 4.458 | 5.610 |
-
-**Overhead vs Native**
-
-- No map: build 1.38x, query 0.95x, total 0.99x  
-- Track + objs: build 2.39x, query 1.02x, total 1.15x
-
-### Run benchmarks
-To run the benchmarks yourself, first install the dependencies:
-
-```bash
-pip install -r benchmarks/requirements.txt
-```
-
-Then run:
-
-```bash
-python benchmarks/cross_library_bench.py
-python benchmarks/benchmark_native_vs_shim.py 
-```
-
-Check the CLI arguments for the cross-library benchmark in `benchmarks/quadtree_bench/main.py`.
-
-## Run Visualizer
-A visualizer is included to help you understand how the quadtree subdivides space.
-
-```bash
-pip install -r interactive/requirements.txt
-python interactive/interactive_v2.py
-```
+* The wrapper maintains an object map only if the quadtree was constructed with `track_objects=True`. If you don't need it, leave it off for best performance.
+* Refer to the [Native vs Shim Benchmark](https://elan456.github.io/fastquadtree/benchmark/#native-vs-shim-benchmark) for overhead details.
 
 ### Pygame Ball Pit Demo
 
@@ -290,10 +161,7 @@ python interactive/interactive_v2.py
 A simple demo of moving objects with collision detection using **fastquadtree**. 
 You can toggle between quadtree mode and brute-force mode to see the performance difference.
 
-```bash
-pip install -r interactive/requirements.txt
-python interactive/ball_pit.py
-```
+See the [runnables guide](https://elan456.github.io/fastquadtree/runnables/) for setup instructions.
 
 ## FAQ
 
@@ -304,7 +172,7 @@ Allowed. For k-nearest, duplicates are de-duplicated by id. For range queries yo
 Yes! Use `delete(id, xy)` to remove specific items. You must provide both the ID and exact location for precise deletion. This handles cases where multiple items exist at the same location. If you're using `track_objects=True`, you can also use `delete_by_object(obj)` for convenient object-based deletion with O(1) lookup. The tree automatically merges nodes when item counts drop below capacity.
 
 **Can I store rectangles or circles?**
-The core stores points. To index objects with extent, insert whatever representative point you choose. For rectangles you can insert centers or build an AABB tree separately.
+Yes, you can store rectangles using the `RectQuadTree` class. Circles can be approximated with bounding boxes. See the [RectQuadTree docs](https://elan456.github.io/fastquadtree/api/rect_quadtree/) for details.
 
 ## License
 

{fastquadtree-0.7.0 → fastquadtree-0.8.0}/README.md

@@ -8,7 +8,7 @@
 
 [![PyPI Downloads](https://static.pepy.tech/personalized-badge/fastquadtree?period=total&units=INTERNATIONAL_SYSTEM&left_color=GRAY&right_color=BLUE&left_text=Total+Downloads)](https://pepy.tech/projects/fastquadtree)
 
-[![Build](https://github.com/Elan456/fastquadtree/actions/workflows/release.yml/badge.svg)](https://github.com/Elan456/fastquadtree/actions/workflows/ci.yml)
+[![Build](https://github.com/Elan456/fastquadtree/actions/workflows/release.yml/badge.svg)](https://github.com/Elan456/fastquadtree/actions/workflows/release.yml)
 [![Codecov](https://codecov.io/gh/Elan456/fastquadtree/branch/main/graph/badge.svg)](https://codecov.io/gh/Elan456/fastquadtree)
 
 [![Rust core via PyO3](https://img.shields.io/badge/Rust-core%20via%20PyO3-orange)](https://pyo3.rs/)
@@ -39,7 +39,6 @@ fastquadtree **outperforms** all other quadtree Python packages, including the R
 
 ### Summary (largest dataset, PyQtree baseline)
 - Points: **250,000**, Queries: **500**
---------------------
 - Fastest total: **fastquadtree** at **0.120 s**
 
 | Library | Build (s) | Query (s) | Total (s) | Speed vs PyQtree |
@@ -52,7 +51,7 @@ fastquadtree **outperforms** all other quadtree Python packages, including the R
 | PyQtree      | 1.492 | 0.263 | 1.755 | 1.00× |
 | quads        | 1.407 | 0.484 | 1.890 | 0.93× |
 
-#### Benchmark Configuration
+### Benchmark Configuration
 | Parameter | Value |
 |---|---:|
 | Bounds | (0, 0, 1000, 1000) |
@@ -60,11 +59,13 @@ fastquadtree **outperforms** all other quadtree Python packages, including the R
 | Max depth | 16 |
 | Queries per experiment | 500 |
 
+See the [benchmark section](https://elan456.github.io/fastquadtree/benchmark/) for details.
+
 ## Install
 
 ```bash
 pip install fastquadtree
-````
+```
 
 If you are developing locally:
 
@@ -74,77 +75,11 @@ maturin develop --release
 ```
 
 ## Quickstart
-
-```python
-from fastquadtree import QuadTree
-
-# Bounds are (min_x, min_y, max_x, max_y)
-qt = QuadTree(bounds=(0, 0, 1000, 1000), capacity=20)  # max_depth is optional
-
-# Insert points with auto ids
-id1 = qt.insert((10, 10))
-id2 = qt.insert((200, 300))
-id3 = qt.insert((999, 500), id=42)  # you can supply your own id
-
-# Axis-aligned rectangle query
-hits = qt.query((0, 0, 250, 350))  # returns [(id, x, y), ...] by default
-print(hits)  # e.g. [(1, 10.0, 10.0), (2, 200.0, 300.0)]
-
-# Nearest neighbor
-best = qt.nearest_neighbor((210, 310))  # -> (id, x, y) or None
-print(best)
-
-# k-nearest neighbors
-top3 = qt.nearest_neighbors((210, 310), 3)
-print(top3)  # list of up to 3 (id, x, y) tuples
-
-# Delete items by ID and location
-deleted = qt.delete(id2, (200, 300))  # True if found and deleted
-print(f"Deleted: {deleted}")
-print(f"Remaining items: {qt.count_items()}")
-
-# For object tracking with track_objects=True
-qt_tracked = QuadTree((0, 0, 1000, 1000), capacity=4, track_objects=True)
-player1 = {"name": "Alice", "score": 100}
-player2 = {"name": "Bob", "score": 200}
-
-id1 = qt_tracked.insert((50, 50), obj=player1)
-id2 = qt_tracked.insert((150, 150), obj=player2)
-
-# Delete by object reference (O(1) lookup!)
-deleted = qt_tracked.delete_by_object(player1)
-print(f"Deleted player: {deleted}")  # True
-```
-
-### Working with Python objects
-
-You can keep the tree pure and manage your own id → object map, or let the wrapper manage it.
-
-**Wrapper Managed Objects**
-
-```python
-from fastquadtree import QuadTree
-
-qt = QuadTree((0, 0, 1000, 1000), capacity=16, track_objects=True)
-
-# Store the object alongside the point
-qt.insert((25, 40), obj={"name": "apple"})
-
-# Ask for Item objects within a bounding box
-items = qt.query((0, 0, 100, 100), as_items=True)
-for it in items:
-    print(it.id, it.x, it.y, it.obj)
-```
-
-You can also attach or replace an object later:
-
-```python
-qt.attach(123, my_object)  # binds object to id 123
-```
+[See the quickstart guide](https://elan456.github.io/fastquadtree/quickstart/)
 
 ## API
 
-[Full api for QuadTree](https://elan456.github.io/fastquadtree/api/quadtree/)
+[See the full API](https://elan456.github.io/fastquadtree/api/quadtree/)
 
 ### `QuadTree(bounds, capacity, max_depth=None, track_objects=False, start_id=1)`
 
@@ -154,38 +89,17 @@ qt.attach(123, my_object)  # binds object to id 123
 * `track_objects` — if `True`, the wrapper maintains an id → object map for convenience.
 * `start_id` — starting value for auto-assigned ids
 
-### Core Methods
+### Key Methods
 
 - `insert(xy, *, id=None, obj=None) -> int`
 
-- `insert_many_points(points) -> int`
-
 - `query(rect, *, as_items=False) -> list`
 
 - `nearest_neighbor(xy, *, as_item=False) -> (id, x, y) | Item | None`
 
-- `nearest_neighbors(xy, k, *, as_items=False) -> list`
-
 - `delete(id, xy) -> bool`
 
-- `delete_by_object(obj) -> bool (requires track_objects=True)`
-
-- `clear(*, reset_ids=False) -> None`
-
-- `attach(id, obj) -> None (requires track_objects=True)`
-
-- `count_items() -> int`
-
-- `get(id) -> object | None`
-
-- `get_all_rectangles() -> list[tuple] (for visualization)`
-
-- `get_all_objects() -> list[object] (requires track_objects=True)`
-
-### `Item` (returned when `as_items=True`)
-
-* Attributes: `id`, `x`, `y`, and a lazy `obj` property
-* Accessing `obj` performs a dictionary lookup only if tracking is enabled
+There are more methods and object tracking versions in the [docs](https://elan456.github.io/fastquadtree/api/quadtree/).
 
 ### Geometric conventions
 
@@ -199,52 +113,8 @@ qt.attach(123, my_object)  # binds object to id 123
 * Choose `capacity` so that leaves keep a small batch of points. Typical values are 8 to 64.
 * If your data is very skewed, set a `max_depth` to prevent long chains.
 * For fastest local runs, use `maturin develop --release`.
-* The wrapper only maintains an ID -> Obj map only if the quadtree was constructed with `track_objects=True`. If you don't need it, leave it off for best performance. Look at the [Native vs Shim Benchmark](#native-vs-shim-benchmark) below for details.
-
-
-### Native vs Shim Benchmark
-
-**Setup**
-- Points: 500,000
-- Queries: 500
-- Repeats: 5
-
-**Timing (seconds)**
-
-| Variant | Build | Query | Total |
-|---|---:|---:|---:|
-| Native | 0.483 | 4.380 | 4.863 |
-| Shim (no map) | 0.668 | 4.167 | 4.835 |
-| Shim (track+objs) | 1.153 | 4.458 | 5.610 |
-
-**Overhead vs Native**
-
-- No map: build 1.38x, query 0.95x, total 0.99x  
-- Track + objs: build 2.39x, query 1.02x, total 1.15x
-
-### Run benchmarks
-To run the benchmarks yourself, first install the dependencies:
-
-```bash
-pip install -r benchmarks/requirements.txt
-```
-
-Then run:
-
-```bash
-python benchmarks/cross_library_bench.py
-python benchmarks/benchmark_native_vs_shim.py 
-```
-
-Check the CLI arguments for the cross-library benchmark in `benchmarks/quadtree_bench/main.py`.
-
-## Run Visualizer
-A visualizer is included to help you understand how the quadtree subdivides space.
-
-```bash
-pip install -r interactive/requirements.txt
-python interactive/interactive_v2.py
-```
+* The wrapper maintains an object map only if the quadtree was constructed with `track_objects=True`. If you don't need it, leave it off for best performance.
+* Refer to the [Native vs Shim Benchmark](https://elan456.github.io/fastquadtree/benchmark/#native-vs-shim-benchmark) for overhead details.
 
 ### Pygame Ball Pit Demo
 
@@ -253,10 +123,7 @@ python interactive/interactive_v2.py
 A simple demo of moving objects with collision detection using **fastquadtree**. 
 You can toggle between quadtree mode and brute-force mode to see the performance difference.
 
-```bash
-pip install -r interactive/requirements.txt
-python interactive/ball_pit.py
-```
+See the [runnables guide](https://elan456.github.io/fastquadtree/runnables/) for setup instructions.
 
 ## FAQ
 
@@ -267,7 +134,7 @@ Allowed. For k-nearest, duplicates are de-duplicated by id. For range queries yo
 Yes! Use `delete(id, xy)` to remove specific items. You must provide both the ID and exact location for precise deletion. This handles cases where multiple items exist at the same location. If you're using `track_objects=True`, you can also use `delete_by_object(obj)` for convenient object-based deletion with O(1) lookup. The tree automatically merges nodes when item counts drop below capacity.
 
 **Can I store rectangles or circles?**
-The core stores points. To index objects with extent, insert whatever representative point you choose. For rectangles you can insert centers or build an AABB tree separately.
+Yes, you can store rectangles using the `RectQuadTree` class. Circles can be approximated with bounding boxes. See the [RectQuadTree docs](https://elan456.github.io/fastquadtree/api/rect_quadtree/) for details.
 
 ## License
 

{fastquadtree-0.7.0 → fastquadtree-0.8.0}/benchmarks/benchmark_native_vs_shim.py

@@ -7,6 +7,7 @@ import random
 import statistics as stats
 from time import perf_counter as now
 
+from system_info_collector import collect_system_info, format_system_info_markdown_lite
 from tqdm import tqdm
 
 from fastquadtree import QuadTree as ShimQuadTree
@@ -55,10 +56,10 @@ def bench_shim(points, queries, *, track_objects: bool, with_objs: bool):
     )
     if with_objs:
         for i, p in enumerate(points):
-            qt.insert(p, id=i, obj=i)  # store a tiny object
+            qt.insert(p, id_=i, obj=i)  # store a tiny object
     else:
         for i, p in enumerate(points):
-            qt.insert(p, id=i)
+            qt.insert(p, id_=i)
     t_build = now() - t0
 
     t0 = now()
@@ -133,14 +134,14 @@ def main():
         return f"{x:.3f}"
 
     md = f"""
-### Native vs Shim
+## Native vs Shim
 
-**Setup**
+### Configuration
 - Points: {args.points:,}
 - Queries: {args.queries}
 - Repeats: {args.repeats}
 
-**Timing (seconds)**
+### Results
 
 | Variant | Build | Query | Total |
 |---|---:|---:|---:|
@@ -148,13 +149,18 @@ def main():
 | Shim (no map) | {fmt(s_build_no_map)} | {fmt(s_query_no_map)} | {fmt(s_build_no_map + s_query_no_map)} |
 | Shim (track+objs) | {fmt(s_build_map)} | {fmt(s_query_map)} | {fmt(s_build_map + s_query_map)} |
 
-**Overhead vs Native**
+### Summary
 
-- No map: build {s_build_no_map / n_build:.2f}x, query {s_query_no_map / n_query:.2f}x, total {(s_build_no_map + s_query_no_map) / (n_build + n_query):.2f}x
-- Track + objs: build {s_build_map / n_build:.2f}x, query {s_query_map / n_query:.2f}x, total {(s_build_map + s_query_map) / (n_build + n_query):.2f}x
+Using the shim with object tracking increases build time by {fmt(s_build_map / n_build)}x and query time by {fmt(s_query_map / n_query)}x.
+**Total slowdown = {fmt((s_build_map + s_query_map) / (n_build + n_query))}x.**
+
+Adding the object map only impacts the build time, not the query time.
 """
     print(md.strip())
 
+    info = collect_system_info()
+    print(format_system_info_markdown_lite(info))
+
 
 if __name__ == "__main__":
     main()

fastquadtree-0.8.0/benchmarks/cross_library_bench.py

@@ -0,0 +1,6 @@
+import system_info_collector
+from quadtree_bench.main import main
+
+main()
+system_info = system_info_collector.collect_system_info()
+print(system_info_collector.format_system_info_markdown_lite(system_info))

{fastquadtree-0.7.0 → fastquadtree-0.8.0}/benchmarks/quadtree_bench/engines.py

@@ -104,7 +104,7 @@ def _create_fastquadtree_engine(
 
     def build(points):
         qt = RustQuadTree(bounds, max_points, max_depth=max_depth)
-        qt.insert_many_points(points)
+        qt.insert_many(points)
         return qt
 
     def query(qt, queries):

{fastquadtree-0.7.0 → fastquadtree-0.8.0}/benchmarks/quadtree_bench/runner.py

@@ -6,7 +6,6 @@ and result collection for performance analysis.
 """
 
 import gc
-import json
 import math
 import random
 import statistics as stats
@@ -17,7 +16,6 @@ from typing import Any, Dict, List, Tuple
 from tqdm import tqdm
 
 from .engines import Engine
-from .system_info_collector import collect_system_info
 
 
 @dataclass
@@ -257,8 +255,8 @@ class BenchmarkRunner:
         experiment_bar.close()
 
         # Add metadata to results
-        results["engines"] = engines
-        results["config"] = self.config
+        results["engines"] = engines  # pyright: ignore[reportArgumentType]
+        results["config"] = self.config  # pyright: ignore[reportArgumentType]
 
         return results
 
@@ -279,7 +277,6 @@ class BenchmarkRunner:
         print(
             f"- Points: **{config.experiments[i]:,}**, Queries: **{config.n_queries}**"
         )
-        print("--------------------")
 
         # Find fastest and show key results
         ranked = sorted(
@@ -317,9 +314,3 @@ class BenchmarkRunner:
         print(f"| Max points per node | {config.max_points} |")
         print(f"| Max depth | {config.max_depth} |")
         print(f"| Queries per experiment | {config.n_queries} |")
-
-        system_info = collect_system_info()
-        print("#### System Info")
-        print("```json")
-        print(json.dumps(system_info, indent=2))
-        print("```")

{fastquadtree-0.7.0 → fastquadtree-0.8.0}/benchmarks/requirements.txt

@@ -17,5 +17,4 @@ shapely>=2.0.0       # STRtree comparator
 # For getting system info
 psutil
 py-cpuinfo
-distro
-GPUtil
+distro