fastquadtree 1.2.1__tar.gz → 1.3.0__tar.gz

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/.github/workflows/release.yml

@@ -16,7 +16,7 @@ jobs:
       - name: Set up Python
         uses: actions/setup-python@v5
         with:
-          python-version: "3.10"
+          python-version: "3.9"
 
       - name: Create venv for maturin develop
         run: python -m venv .venv

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/Cargo.lock

@@ -30,9 +30,10 @@ dependencies = [
 
 [[package]]
 name = "fastquadtree"
-version = "1.2.1"
+version = "1.3.0"
 dependencies = [
  "bincode",
+ "num-traits",
  "numpy",
  "pyo3",
  "serde",

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "fastquadtree"
-version = "1.2.1"
+version = "1.3.0"
 edition = "2021"
 readme = "README.md"
 
@@ -13,6 +13,7 @@ smallvec = "1.15.1"
 numpy = "0.26"
 serde = { version = "1.0", features = ["derive"] }
 bincode = {version = "2.0.1", features = ["serde"]}
+num-traits = "0.2"
 
 [profile.release]
 opt-level = 3

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: fastquadtree
-Version: 1.2.1
+Version: 1.3.0
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Programming Language :: Rust
@@ -26,12 +26,13 @@ Requires-Dist: mkdocs-minify-plugin ; extra == 'dev'
 Requires-Dist: maturin>=1.5 ; extra == 'dev'
 Requires-Dist: pyqtree==1.0.0 ; extra == 'dev'
 Requires-Dist: numpy ; extra == 'dev'
+Requires-Dist: pre-commit ; extra == 'dev'
 Provides-Extra: dev
 License-File: LICENSE
 Summary: Rust-accelerated quadtree for Python with fast inserts, range queries, and k-NN search.
 Keywords: quadtree,spatial-index,geometry,rust,pyo3,nearest-neighbor,k-nn
 Author: Ethan Anderson
-Requires-Python: >=3.8
+Requires-Python: >=3.9
 Description-Content-Type: text/markdown
 Project-URL: Homepage, https://github.com/Elan456/fastquadtree
 Project-URL: Repository, https://github.com/Elan456/fastquadtree
@@ -45,6 +46,8 @@ Project-URL: Issues, https://github.com/Elan456/fastquadtree/issues
 
 Rust-optimized quadtree with a clean Python API
 
+👉 **Check out the Docs:** https://elan456.github.io/fastquadtree/
+
 [![PyPI](https://img.shields.io/pypi/v/fastquadtree.svg)](https://pypi.org/project/fastquadtree/)
 [![Python versions](https://img.shields.io/pypi/pyversions/fastquadtree.svg)](https://pypi.org/project/fastquadtree/)
 [![Downloads](https://static.pepy.tech/personalized-badge/fastquadtree?period=total&units=INTERNATIONAL_SYSTEM&left_color=GRAY&right_color=BLUE&left_text=Total%20Downloads)](https://pepy.tech/projects/fastquadtree)
@@ -64,19 +67,19 @@ Rust-optimized quadtree with a clean Python API
 
 ## Why use fastquadtree
 
-- Clean [Python API](https://elan456.github.io/fastquadtree/api/quadtree/) with no external dependencies and modern typing hints
+- Clean [Python API](https://elan456.github.io/fastquadtree/api/quadtree/) with **no external dependencies** and modern typing hints
 - The fastest quadtree Python package ([>10x faster](https://elan456.github.io/fastquadtree/benchmark/) than pyqtree)
 - Prebuilt wheels for Windows, macOS, and Linux
 - Support for [inserting bounding boxes](https://elan456.github.io/fastquadtree/api/rect_quadtree/) or points
 - Fast KNN and range queries
 - Optional object tracking for id ↔ object mapping
 - Fast [serialization](https://elan456.github.io/fastquadtree/benchmark/#serialization-vs-rebuild) to/from bytes
+- Support for multiple data types (f32, f64, i32, i64) for coordinates
 - [100% test coverage](https://codecov.io/gh/Elan456/fastquadtree) and CI on GitHub Actions
 - Offers a drop-in [pyqtree shim](https://elan456.github.io/fastquadtree/benchmark/#pyqtree-drop-in-shim-performance-gains) that is 6.567x faster while keeping the same API
 
 ----
 
-👉 **Docs:** https://elan456.github.io/fastquadtree/
 
 ## Examples
 See examples of how fastquadtree can be used in the [runnables](https://elan456.github.io/fastquadtree/runnables/) section.

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/README.md

@@ -5,6 +5,8 @@
 
 Rust-optimized quadtree with a clean Python API
 
+👉 **Check out the Docs:** https://elan456.github.io/fastquadtree/
+
 [![PyPI](https://img.shields.io/pypi/v/fastquadtree.svg)](https://pypi.org/project/fastquadtree/)
 [![Python versions](https://img.shields.io/pypi/pyversions/fastquadtree.svg)](https://pypi.org/project/fastquadtree/)
 [![Downloads](https://static.pepy.tech/personalized-badge/fastquadtree?period=total&units=INTERNATIONAL_SYSTEM&left_color=GRAY&right_color=BLUE&left_text=Total%20Downloads)](https://pepy.tech/projects/fastquadtree)
@@ -24,19 +26,19 @@ Rust-optimized quadtree with a clean Python API
 
 ## Why use fastquadtree
 
-- Clean [Python API](https://elan456.github.io/fastquadtree/api/quadtree/) with no external dependencies and modern typing hints
+- Clean [Python API](https://elan456.github.io/fastquadtree/api/quadtree/) with **no external dependencies** and modern typing hints
 - The fastest quadtree Python package ([>10x faster](https://elan456.github.io/fastquadtree/benchmark/) than pyqtree)
 - Prebuilt wheels for Windows, macOS, and Linux
 - Support for [inserting bounding boxes](https://elan456.github.io/fastquadtree/api/rect_quadtree/) or points
 - Fast KNN and range queries
 - Optional object tracking for id ↔ object mapping
 - Fast [serialization](https://elan456.github.io/fastquadtree/benchmark/#serialization-vs-rebuild) to/from bytes
+- Support for multiple data types (f32, f64, i32, i64) for coordinates
 - [100% test coverage](https://codecov.io/gh/Elan456/fastquadtree) and CI on GitHub Actions
 - Offers a drop-in [pyqtree shim](https://elan456.github.io/fastquadtree/benchmark/#pyqtree-drop-in-shim-performance-gains) that is 6.567x faster while keeping the same API
 
 ----
 
-👉 **Docs:** https://elan456.github.io/fastquadtree/
 
 ## Examples
 See examples of how fastquadtree can be used in the [runnables](https://elan456.github.io/fastquadtree/runnables/) section.

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/docs/benchmark.md

@@ -11,21 +11,20 @@ Quadtrees are the focus of the benchmark, but Rtrees are included for reference.
 ![Throughput](https://raw.githubusercontent.com/Elan456/fastquadtree/main/assets/quadtree_bench_throughput.png)
 
 ### Summary (largest dataset, PyQtree baseline)
-
 - Points: **250,000**, Queries: **500**
-- Fastest total: **fastquadtree** at **0.120 s**
+- Fastest total: **fastquadtree** at **0.100 s**
 
 | Library | Build (s) | Query (s) | Total (s) | Speed vs PyQtree |
 |---|---:|---:|---:|---:|
-| **fastquadtree** | 0.031 | 0.089 | 0.120 | **14.64×** |
-| Shapely STRtree | 0.179 | 0.100 | 0.279 | 6.29× |
-| nontree-QuadTree | 0.595 | 0.605 | 1.200 | 1.46× |
-| Rtree        | 0.961 | 0.300 | 1.261 | 1.39× |
-| e-pyquadtree | 1.005 | 0.660 | 1.665 | 1.05× |
-| PyQtree      | 1.492 | 0.263 | 1.755 | 1.00× |
-| quads        | 1.407 | 0.484 | 1.890 | 0.93× |
-
-### Benchmark Configuration
+| fastquadtree | 0.027 | 0.073 | 0.100 | 16.12× |
+| Shapely STRtree | 0.148 | 0.083 | 0.231 | 7.00× |
+| Rtree        | 0.814 | 0.245 | 1.059 | 1.53× |
+| nontree-QuadTree | 0.532 | 0.582 | 1.114 | 1.45× |
+| e-pyquadtree | 0.913 | 0.641 | 1.554 | 1.04× |
+| PyQtree      | 1.352 | 0.264 | 1.616 | 1.00× |
+| quads        | 1.231 | 0.465 | 1.695 | 0.95× |
+
+#### Benchmark Configuration
 | Parameter | Value |
 |---|---:|
 | Bounds | (0, 0, 1000, 1000) |

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/docs/future_features.md

@@ -5,26 +5,43 @@ If you really want any of these features, please let us know by opening an issue
 
 If you have any suggestions or would like to contribute, please feel free to open an issue or a pull request.
 
-## Planned Features
+The features will likely be implemented in the order they are listed below, but this is not guaranteed.
 
-### 1. [COMPLETE] Quadtree serialization
+## 🚧 Planned Features
 
-By serializing the quadtree, we can save its state to a file and load it later. This will allow us to persist the quadtree structure and data across sessions. For example, you could pre build a quadtree with all the walls in your video game level, serialize it to a file, and then load it when the game starts. This will heavily reduce the game load time since you won't have to rebuild the quadtree from scratch every time.
+### 1. KNN with criteria function
 
-### 2. Circle support
+Currently, KNN only supports finding the nearest neighbors based on euclidean distance.
+By adding a criteria function, we could allow users to define custom criteria for finding neighbors by passing a function that 
+takes in a point and returns a score. The KNN algorithm would then use this score to determine the nearest neighbors.
+
+### 2. KNN in rectangle quadtree
+
+Currently, KNN is only supported in the point quadtree. By adding KNN support to the rectangle quadtree, we could allow users to find the nearest rectangles to a given point. This would be to the nearest edge of the rectangle, adding complexity to the algorithm.
+However, it will allow for really quick collision detection between a point and a set of rectangles as the point can just do
+robust-collision handling with the nearest rectangles.
+
+### 3. Circle support
 
 Currently, we support points and rectangles in two separate quadtrees.
 For example, in the ball-pit demo, we use a point quadtree, but then query a larger area to account for the radius of the balls.
 With a circle quadtree, we could directly insert circles and perform circle-circle collision detection.
 
-### 3. KNN with criteria function
+A good alternative is to use the rectangle quadtree and insert the minimum bounding rectangles of the circles.
 
-Currently, KNN only supports finding the nearest neighbors based on euclidean distance.
-By adding a criteria function, we could allow users to define custom criteria for finding neighbors by passing a function that 
-takes in a point and returns a score. The KNN algorithm would then use this score to determine the nearest neighbors.
+## ✅ Completed Planned Features
 
-### 4. KNN in rectangle quadtree
+Once a feature from above is completed, it will be moved to this section.
 
-Currently, KNN is only supported in the point quadtree. By adding KNN support to the rectangle quadtree, we could allow users to find the nearest rectangles to a given point. This would be to the nearest edge of the rectangle, adding complexity to the algorithm.
-However, it will allow for really quick collision detection between a point and a set of rectangles as the point can just do
-robust-collision handling with the nearest rectangles.
+
+### Configurable Quadtree Coordinate Type (1.3.0)
+
+Currently, the point quadtree only uses f32 for point coordinates, limiting precision in favor of better performance.
+To make the quadtree more flexible, we could allow users to specify the coordinate type (e.g., f64, i32, etc.) when creating a quadtree.
+The f32 will remain the default, but users will be able to specify a different type if needed.
+
+If the type cannot be made truly generic, then only the following types would be supported: f32, f64, i32, i64
+
+### Quadtree serialization (1.2.0)
+
+By serializing the quadtree, we can save its state to a file and load it later. This will allow us to persist the quadtree structure and data across sessions. For example, you could pre build a quadtree with all the walls in your video game level, serialize it to a file, and then load it when the game starts. This will heavily reduce the game load time since you won't have to rebuild the quadtree from scratch every time.

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/docs/index.md

@@ -42,6 +42,7 @@
 - Fast KNN and range queries
 - Optional object tracking for id ↔ object mapping
 - Fast [serialization](benchmark.md#serialization-vs-rebuild) to/from bytes
+- Support for multiple data types (f32, f64, i32, i64) for coordinates
 - [100% test coverage](https://codecov.io/gh/Elan456/fastquadtree) and CI on GitHub Actions
 
 ## Examples

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/interactive/ballpit.py

@@ -246,7 +246,7 @@ def main():
 
     running = True
     while running:
-        dt_ms = clock.tick(60)  # target 60 fps
+        dt_ms = clock.tick(200)  # target 200 FPS
         dt = dt_ms / 1000.0
 
         for event in pygame.event.get():

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/mkdocs.yml

@@ -12,10 +12,12 @@ theme:
     - navigation.tracking
     - navigation.indexes
     - content.code.copy
-    - toc.integrate
+    - toc.follow
     - search.suggest
     - search.highlight
     - content.tooltips
+    - navigation.footer
+    - navigation.top
   palette:
     - scheme: slate
       primary: indigo
@@ -37,13 +39,14 @@ plugins:
           options:
             docstring_style: google
             merge_init_into_class: true
-            show_source: true
+            show_source: false
             show_root_heading: false
             show_signature: true
             show_if_no_docstring: true
-            separate_signature: true
-            line_length: 88
-            heading_level: 2
+            separate_signature: false
+            line_length: 100
+            heading_level: 3
+            members_order: source
             filters:  # Exclude __slots__ and __len__ and anything with a single underscore prefix (don't filter insert_many even though it has a single underscore)
               - "!__slots__"
               - "!__len__"

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/pyproject.toml

@@ -8,7 +8,7 @@ name = "fastquadtree"
 dynamic = ["version"]
 description = "Rust-accelerated quadtree for Python with fast inserts, range queries, and k-NN search."
 readme = { file = "README.md", content-type = "text/markdown" }
-requires-python = ">=3.8"
+requires-python = ">=3.9"
 dependencies = [] # No runtime dependencies
 license = { file = "LICENSE" }
 authors = [{ name = "Ethan Anderson" }]
@@ -80,6 +80,7 @@ dev = [
   "maturin>=1.5",  # build Rust wheels
   "pyqtree==1.0.0", # for comparison in tests
   "numpy",
+  "pre-commit",
 ]
 
 [tool.ruff]

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/pysrc/fastquadtree/_base_quadtree.py

@@ -18,6 +18,8 @@ from ._item import Item  # base class for PointItem and RectItem
 from ._obj_store import ObjStore
 
 if TYPE_CHECKING:
+    from typing import Self  # Only in Python 3.11+
+
     from numpy.typing import NDArray
 
 Bounds = Tuple[float, float, float, float]
@@ -46,6 +48,7 @@ class _BaseQuadTree(Generic[G, HitT, ItemType], ABC):
         "_bounds",
         "_capacity",
         "_count",
+        "_dtype",
         "_max_depth",
         "_native",
         "_next_id",
@@ -59,6 +62,10 @@ class _BaseQuadTree(Generic[G, HitT, ItemType], ABC):
     def _new_native(self, bounds: Bounds, capacity: int, max_depth: int | None) -> Any:
         """Create the native engine instance."""
 
+    @classmethod
+    def _new_native_from_bytes(cls, data: bytes, dtype: str) -> Any:
+        """Create the native engine instance from serialized bytes."""
+
     @staticmethod
     @abstractmethod
     def _make_item(id_: int, geom: G, obj: Any | None) -> ItemType:
@@ -73,10 +80,12 @@ class _BaseQuadTree(Generic[G, HitT, ItemType], ABC):
         *,
         max_depth: int | None = None,
         track_objects: bool = False,
+        dtype: str = "f32",
     ):
         self._bounds = bounds
         self._max_depth = max_depth
         self._capacity = capacity
+        self._dtype = dtype
         self._native = self._new_native(bounds, capacity, max_depth)
 
         self._track_objects = bool(track_objects)
@@ -132,12 +141,13 @@ class _BaseQuadTree(Generic[G, HitT, ItemType], ABC):
         return pickle.dumps(self.to_dict())
 
     @classmethod
-    def from_bytes(cls, data: bytes) -> _BaseQuadTree[G, HitT, ItemType]:
+    def from_bytes(cls, data: bytes, dtype: str = "f32") -> Self:
         """
-        Deserialize a quadtree from bytes.
+        Deserialize a quadtree from bytes. Specifiy the dtype if the original tree that was serialized used a non-default dtype.
 
         Args:
             data: Bytes representing the serialized quadtree from `to_bytes()`.
+            dtype: The data type used in the native engine ('f32', 'f64', 'i32', 'i64') when saved to bytes.
 
         Returns:
             A new quadtree instance with the same state as when serialized.
@@ -154,7 +164,15 @@ class _BaseQuadTree(Generic[G, HitT, ItemType], ABC):
         store_dict = in_dict["store"]
 
         qt = cls.__new__(cls)  # type: ignore[call-arg]
-        qt._native = cls._new_native_from_bytes(core_bytes)
+        try:
+            qt._native = cls._new_native_from_bytes(core_bytes, dtype=dtype)
+        except ValueError as ve:
+            raise ValueError(
+                "Failed to deserialize quadtree native core. "
+                "This may be due to a dtype mismatch. "
+                "Ensure the dtype used in from_bytes() matches the original tree. "
+                "Error details: " + str(ve)
+            ) from ve
 
         if store_dict is not None:
             qt._store = ObjStore.from_dict(store_dict, qt._make_item)

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/pysrc/fastquadtree/point_quadtree.py

@@ -5,10 +5,17 @@ from typing import Any, Literal, Tuple, overload
 
 from ._base_quadtree import Bounds, _BaseQuadTree
 from ._item import Point, PointItem
-from ._native import QuadTree as _RustQuadTree  # native point tree
+from ._native import QuadTree as QuadTreeF32, QuadTreeF64, QuadTreeI32, QuadTreeI64
 
 _IdCoord = Tuple[int, float, float]
 
+DTYPE_MAP = {
+    "f32": QuadTreeF32,
+    "f64": QuadTreeF64,
+    "i32": QuadTreeI32,
+    "i64": QuadTreeI64,
+}
+
 
 class QuadTree(_BaseQuadTree[Point, _IdCoord, PointItem]):
     """
@@ -29,6 +36,7 @@ class QuadTree(_BaseQuadTree[Point, _IdCoord, PointItem]):
         capacity: Max number of points per node before splitting.
         max_depth: Optional max tree depth. If omitted, engine decides.
         track_objects: Enable id <-> object mapping inside Python.
+        dtype: Data type for coordinates and ids in the native engine. Default is 'f32'. Options are 'f32', 'f64', 'i32', 'i64'.
 
     Raises:
         ValueError: If parameters are invalid or inserts are out of bounds.
@@ -41,26 +49,16 @@ class QuadTree(_BaseQuadTree[Point, _IdCoord, PointItem]):
         *,
         max_depth: int | None = None,
         track_objects: bool = False,
+        dtype: str = "f32",
     ):
         super().__init__(
             bounds,
             capacity,
             max_depth=max_depth,
             track_objects=track_objects,
+            dtype=dtype,
         )
 
-    @classmethod
-    def from_bytes(cls, data: bytes) -> QuadTree:
-        """
-        Create a QuadTree instance from serialized bytes.
-
-        Args:
-            data: Serialized byte data from `to_bytes()`.
-        Returns:
-            A QuadTree instance.
-        """
-        return super().from_bytes(data)
-
     @overload
     def query(
         self, rect: Bounds, *, as_items: Literal[False] = ...
@@ -160,14 +158,19 @@ class QuadTree(_BaseQuadTree[Point, _IdCoord, PointItem]):
         return out
 
     def _new_native(self, bounds: Bounds, capacity: int, max_depth: int | None) -> Any:
-        if max_depth is None:
-            return _RustQuadTree(bounds, capacity)
-        return _RustQuadTree(bounds, capacity, max_depth=max_depth)
+        """Create the native engine instance."""
+        rust_cls = DTYPE_MAP.get(self._dtype)
+        if rust_cls is None:
+            raise ValueError(f"Unsupported dtype: {self._dtype}")
+        return rust_cls(bounds, capacity, max_depth)
 
     @classmethod
-    def _new_native_from_bytes(cls, data: bytes) -> Any:
+    def _new_native_from_bytes(cls, data: bytes, dtype: str = "f32") -> Any:
         """Create a new native engine instance from serialized bytes."""
-        return _RustQuadTree.from_bytes(data)
+        rust_cls = DTYPE_MAP.get(dtype)
+        if rust_cls is None:
+            raise ValueError(f"Unsupported dtype: {dtype}")
+        return rust_cls.from_bytes(data)
 
     @staticmethod
     def _make_item(id_: int, geom: Point, obj: Any | None) -> PointItem:

{fastquadtree-1.2.1 → fastquadtree-1.3.0}/pysrc/fastquadtree/rect_quadtree.py

@@ -5,10 +5,21 @@ from typing import Any, Literal, Tuple, overload
 
 from ._base_quadtree import Bounds, _BaseQuadTree
 from ._item import RectItem
-from ._native import RectQuadTree as _RustRectQuadTree  # native rect tree
+from ._native import (
+    RectQuadTree as RectQuadTreeF32,
+    RectQuadTreeF64,
+    RectQuadTreeI32,
+    RectQuadTreeI64,
+)
 
 _IdRect = Tuple[int, float, float, float, float]
-Point = Tuple[float, float]  # only for type hints in docstrings
+
+DTYPE_MAP = {
+    "f32": RectQuadTreeF32,
+    "f64": RectQuadTreeF64,
+    "i32": RectQuadTreeI32,
+    "i64": RectQuadTreeI64,
+}
 
 
 class RectQuadTree(_BaseQuadTree[Bounds, _IdRect, RectItem]):
@@ -30,6 +41,7 @@ class RectQuadTree(_BaseQuadTree[Bounds, _IdRect, RectItem]):
         capacity: Max number of points per node before splitting.
         max_depth: Optional max tree depth. If omitted, engine decides.
         track_objects: Enable id <-> object mapping inside Python.
+        dtype: Data type for coordinates and ids in the native engine. Default is 'f32'. Options are 'f32', 'f64', 'i32', 'i64'.
 
     Raises:
         ValueError: If parameters are invalid or inserts are out of bounds.
@@ -42,26 +54,16 @@ class RectQuadTree(_BaseQuadTree[Bounds, _IdRect, RectItem]):
         *,
         max_depth: int | None = None,
         track_objects: bool = False,
+        dtype: str = "f32",
     ):
         super().__init__(
             bounds,
             capacity,
             max_depth=max_depth,
             track_objects=track_objects,
+            dtype=dtype,
         )
 
-    @classmethod
-    def from_bytes(cls, data: bytes) -> RectQuadTree:
-        """
-        Create a RectQuadTree instance from serialized bytes.
-
-        Args:
-            data: Serialized byte data from `to_bytes()`.
-        Returns:
-            A RectQuadTree instance.
-        """
-        return super().from_bytes(data)
-
     @overload
     def query(
         self, rect: Bounds, *, as_items: Literal[False] = ...
@@ -96,14 +98,19 @@ class RectQuadTree(_BaseQuadTree[Bounds, _IdRect, RectItem]):
         return self._store.get_many_by_ids(self._native.query_ids(rect))
 
     def _new_native(self, bounds: Bounds, capacity: int, max_depth: int | None) -> Any:
-        if max_depth is None:
-            return _RustRectQuadTree(bounds, capacity)
-        return _RustRectQuadTree(bounds, capacity, max_depth=max_depth)
+        """Create the native engine instance."""
+        rust_cls = DTYPE_MAP.get(self._dtype)
+        if rust_cls is None:
+            raise ValueError(f"Unsupported dtype: {self._dtype}")
+        return rust_cls(bounds, capacity, max_depth)
 
     @classmethod
-    def _new_native_from_bytes(cls, data: bytes) -> Any:
+    def _new_native_from_bytes(cls, data: bytes, dtype: str = "f32") -> Any:
         """Create a new native engine instance from serialized bytes."""
-        return _RustRectQuadTree.from_bytes(data)
+        rust_cls = DTYPE_MAP.get(dtype)
+        if rust_cls is None:
+            raise ValueError(f"Unsupported dtype: {dtype}")
+        return rust_cls.from_bytes(data)
 
     @staticmethod
     def _make_item(id_: int, geom: Bounds, obj: Any | None) -> RectItem:

fastquadtree-1.3.0/src/geom.rs

@@ -0,0 +1,73 @@
+use core::ops::{Add, Sub, Mul, Div};
+use num_traits::{Zero, One};
+use serde::{de::DeserializeOwned, Deserialize, Serialize};
+
+// Creating a set of traits for coordinate types
+// Requires basic arithmetic operations and ordering
+pub trait Coord:
+    Copy + PartialOrd + Add<Output = Self> + Sub<Output = Self> + Mul<Output = Self> + Div<Output = Self> + Zero + One + Serialize + DeserializeOwned
+{}
+
+impl<T> Coord for T where
+    T: Copy + PartialOrd + Add<Output = Self> + Sub<Output = Self> + Mul<Output = Self> + Div<Output = Self> + Zero + One + Serialize + DeserializeOwned
+{}
+
+// Generic mid function for all Coord types
+#[inline(always)]
+pub fn mid<T: Coord>(a: T, b: T) -> T {
+    // a + (b - a) / 2
+    a + (b - a) / (T::one() + T::one())  // 1 + 1 = 2 for Div
+}
+
+#[derive(Copy, Clone, Debug, PartialEq, Default, Serialize, Deserialize)]
+#[serde(bound(serialize = "", deserialize = ""))]
+pub struct Point<T: Coord> {
+    pub x: T,
+    pub y: T,
+}
+
+#[derive(Copy, Clone, Debug, PartialEq, Default, Serialize, Deserialize)]
+#[serde(bound(serialize = "", deserialize = ""))]
+pub struct Rect<T: Coord> {
+    pub min_x: T,
+    pub min_y: T,
+    pub max_x: T,
+    pub max_y: T,
+}
+
+impl<T: Coord> Rect<T> {
+    pub fn contains(&self, point: &Point<T>) -> bool {
+        return point.x >= self.min_x && point.x < self.max_x && point.y >= self.min_y && point.y < self.max_y;
+    }
+
+    // Check if two Rect overlap at all
+    pub fn intersects(&self, other: &Rect<T>) -> bool {
+        return self.min_x < other.max_x && self.max_x > other.min_x && self.min_y < other.max_y && self.max_y > other.min_y
+    }
+}
+
+pub fn dist_sq_point_to_rect<T: Coord>(p: &Point<T>, r: &Rect<T>) -> T {
+    let dx = if p.x < r.min_x {
+        r.min_x - p.x
+    } else if p.x > r.max_x {
+        p.x - r.max_x
+    } else {
+        T::zero()
+    };
+
+    let dy = if p.y < r.min_y {
+        r.min_y - p.y
+    } else if p.y > r.max_y {
+        p.y - r.max_y
+    } else {
+        T::zero()
+    };
+
+    dx * dx + dy * dy
+}
+
+pub fn dist_sq_points<T: Coord>(a: &Point<T>, b: &Point<T>) -> T {
+    let dx = a.x - b.x;
+    let dy = a.y - b.y;
+    dx * dx + dy * dy
+}