fastquadtree 1.2.1__tar.gz → 1.2.3__tar.gz

{fastquadtree-1.2.1 → fastquadtree-1.2.3}/.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.2.3}/Cargo.lock

@@ -30,7 +30,7 @@ dependencies = [
 
 [[package]]
 name = "fastquadtree"
-version = "1.2.1"
+version = "1.2.3"
 dependencies = [
  "bincode",
  "numpy",

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

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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: fastquadtree
-Version: 1.2.1
+Version: 1.2.3
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Programming Language :: Rust
@@ -31,7 +31,7 @@ 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 +45,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,7 +66,7 @@ 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
@@ -76,7 +78,6 @@ Rust-optimized quadtree with a clean Python 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.2.3}/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,7 +26,7 @@ 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
@@ -36,7 +38,6 @@ Rust-optimized quadtree with a clean Python 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.2.3}/docs/future_features.md

@@ -5,26 +5,42 @@ 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. Configurable Quadtree Coordinate Type
 
-### 2. Circle support
+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.
 
-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.
+If the type cannot be made truly generic, then only the following types would be supported: f32, f64, i32, i64
 
-### 3. KNN with criteria function
+### 2. KNN with criteria function
 
 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.
 
-### 4. KNN in rectangle quadtree
+### 3. 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.
+robust-collision handling with the nearest rectangles.
+
+### 4. 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.
+
+A good alternative is to use the rectangle quadtree and insert the minimum bounding rectangles of the circles.
+
+## ✅ Completed Planned Features
+
+Once a feature from above is completed, it will be moved to this section.
+
+### Quadtree serialization
+
+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.2.3}/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.2.3}/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" }]

{fastquadtree-1.2.1 → fastquadtree-1.2.3}/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]
@@ -59,6 +61,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) -> Any:
+        """Create the native engine instance from serialized bytes."""
+
     @staticmethod
     @abstractmethod
     def _make_item(id_: int, geom: G, obj: Any | None) -> ItemType:
@@ -132,7 +138,7 @@ 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) -> Self:
         """
         Deserialize a quadtree from bytes.
 

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

@@ -49,18 +49,6 @@ class QuadTree(_BaseQuadTree[Point, _IdCoord, PointItem]):
             track_objects=track_objects,
         )
 
-    @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] = ...

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

@@ -50,18 +50,6 @@ class RectQuadTree(_BaseQuadTree[Bounds, _IdRect, RectItem]):
             track_objects=track_objects,
         )
 
-    @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] = ...