fastquadtree 0.5.0__cp38-abi3-win_amd64.whl → 0.6.0__cp38-abi3-win_amd64.whl

fastquadtree/__init__.py

@@ -1,13 +1,13 @@
 from __future__ import annotations
 
-from typing import Any, Iterable, List, Optional, Tuple, overload
-from typing import Literal
+from typing import Any, Literal, Tuple, overload
 
-# Compiled Rust module is provided by maturin (tool.maturin.module-name)
-from ._native import QuadTree as _RustQuadTree
 from ._bimap import BiMap  # type: ignore[attr-defined]
 from ._item import Item
 
+# Compiled Rust module is provided by maturin (tool.maturin.module-name)
+from ._native import QuadTree as _RustQuadTree
+
 Bounds = Tuple[float, float, float, float]
 """Axis-aligned rectangle as (min_x, min_y, max_x, max_y)."""
 
@@ -45,14 +45,14 @@ class QuadTree:
         ValueError: If parameters are invalid or inserts are out of bounds.
     """
 
-    __slots__ = ("_native", "_items", "_next_id", "_count", "_bounds")
+    __slots__ = ("_bounds", "_count", "_items", "_native", "_next_id")
 
     def __init__(
         self,
         bounds: Bounds,
         capacity: int,
         *,
-        max_depth: Optional[int] = None,
+        max_depth: int | None = None,
         track_objects: bool = False,
         start_id: int = 1,
     ):
@@ -60,14 +60,14 @@ class QuadTree:
             self._native = _RustQuadTree(bounds, capacity)
         else:
             self._native = _RustQuadTree(bounds, capacity, max_depth=max_depth)
-        self._items: Optional[BiMap] = BiMap() if track_objects else None
+        self._items: BiMap | None = BiMap() if track_objects else None
         self._next_id: int = int(start_id)
         self._count: int = 0
         self._bounds = bounds
 
     # ---------- inserts ----------
 
-    def insert(self, xy: Point, *, id: Optional[int] = None, obj: Any = None) -> int:
+    def insert(self, xy: Point, *, id_: int | None = None, obj: Any = None) -> int:
         """
         Insert a single point.
 
@@ -83,15 +83,14 @@ class QuadTree:
         Raises:
             ValueError: If the point is outside tree bounds.
         """
-        if id is None:
-            id = self._next_id
+        if id_ is None:
+            id_ = self._next_id
             self._next_id += 1
-        else:
-            # ensure future auto-ids do not collide
-            if id >= self._next_id:
-                self._next_id = id + 1
+        # ensure future auto-ids do not collide
+        elif id_ >= self._next_id:
+            self._next_id = id_ + 1
 
-        if not self._native.insert(id, xy):
+        if not self._native.insert(id_, xy):
             x, y = xy
             bx0, by0, bx1, by1 = self._bounds
             raise ValueError(
@@ -99,76 +98,72 @@ class QuadTree:
             )
 
         if self._items is not None:
-            self._items.add(Item(id, xy[0], xy[1], obj))
+            self._items.add(Item(id_, xy[0], xy[1], obj))
 
         self._count += 1
-        return id
+        return id_
 
-    def insert_many_points(self, points: Iterable[Point]) -> int:
+    def insert_many_points(self, points: list[Point]) -> int:
         """
         Bulk insert points with auto-assigned ids.
 
         Args:
-            points: Iterable of (x, y) points.
+            points: List of (x, y) points.
 
         Returns:
-            Number of points successfully inserted.
-
-        Raises:
-            ValueError: If any point is outside tree bounds.
+            The number of points inserted
         """
-        ins = self._native.insert
-        nid = self._next_id
-        inserted = 0
-        bx0, by0, bx1, by1 = self._bounds
-        for xy in points:
-            id_ = nid
-            nid += 1
-            if not ins(id_, xy):
-                x, y = xy
-                raise ValueError(
-                    f"Point ({x}, {y}) is outside bounds ({bx0}, {by0}, {bx1}, {by1})"
-                )
-            inserted += 1
-            if self._items is not None:
-                self._items.add(Item(id_, xy[0], xy[1], None))
-        self._next_id = nid
-        self._count += inserted
-        return inserted
+        start_id = self._next_id
+        last_id = self._native.insert_many_points(start_id, points)
 
-    def attach(self, id: int, obj: Any) -> None:
+        num_inserted = last_id - start_id + 1
+
+        if num_inserted < len(points):
+            raise ValueError("One or more points are outside tree bounds")
+
+        self._next_id = last_id + 1
+
+        # Update the item tracker if needed
+        if self._items is not None:
+            for i, id_ in enumerate(range(start_id, last_id + 1)):
+                x, y = points[i]
+                self._items.add(Item(id_, x, y, None))
+
+        return num_inserted
+
+    def attach(self, id_: int, obj: Any) -> None:
         """
         Attach or replace the Python object for an existing id.
         Tracking must be enabled.
 
         Args:
-            id: Target id.
+            id_: Target id.
             obj: Object to associate with id.
         """
         if self._items is None:
             raise ValueError("Cannot attach objects when track_objects=False")
 
-        item = self._items.by_id(id)
+        item = self._items.by_id(id_)
         if item is None:
-            raise KeyError(f"Id {id} not found in quadtree")
-        self._items.add(Item(id, item.x, item.y, obj))
+            raise KeyError(f"Id {id_} not found in quadtree")
+        self._items.add(Item(id_, item.x, item.y, obj))
 
-    def delete(self, id: int, xy: Point) -> bool:
+    def delete(self, id_: int, xy: Point) -> bool:
         """
         Delete an item by id and exact coordinates.
 
         Args:
-            id: Integer id to remove.
+            id_: Integer id to remove.
             xy: Coordinates (x, y) of the item.
 
         Returns:
             True if the item was found and deleted, else False.
         """
-        deleted = self._native.delete(id, xy)
+        deleted = self._native.delete(id_, xy)
         if deleted:
             self._count -= 1
             if self._items is not None:
-                self._items.pop_id(id)  # ignore result
+                self._items.pop_id(id_)  # ignore result
         return deleted
 
     def delete_by_object(self, obj: Any) -> bool:
@@ -196,21 +191,21 @@ class QuadTree:
         if item is None:
             return False
 
-        return self.delete(item.id, (item.x, item.y))
+        return self.delete(item.id_, (item.x, item.y))
 
     # ---------- queries ----------
 
     @overload
     def query(
         self, rect: Bounds, *, as_items: Literal[False] = ...
-    ) -> List[_IdCoord]: ...
+    ) -> list[_IdCoord]: ...
 
     @overload
-    def query(self, rect: Bounds, *, as_items: Literal[True]) -> List[Item]: ...
+    def query(self, rect: Bounds, *, as_items: Literal[True]) -> list[Item]: ...
 
     def query(
         self, rect: Bounds, *, as_items: bool = False
-    ) -> List[_IdCoord] | List[Item]:
+    ) -> list[_IdCoord] | list[Item]:
         """
         Return all points inside an axis-aligned rectangle.
 
@@ -228,8 +223,8 @@ class QuadTree:
 
         if self._items is None:
             raise ValueError("Cannot return results as items with track_objects=False")
-        out: List[Item] = []
-        for id_, x, y in raw:
+        out: list[Item] = []
+        for id_, _, _ in raw:
             item = self._items.by_id(id_)
             if item is None:
                 raise RuntimeError(
@@ -242,12 +237,10 @@ class QuadTree:
     @overload
     def nearest_neighbor(
         self, xy: Point, *, as_item: Literal[False] = ...
-    ) -> Optional[_IdCoord]: ...
+    ) -> _IdCoord | None: ...
 
     @overload
-    def nearest_neighbor(
-        self, xy: Point, *, as_item: Literal[True]
-    ) -> Optional[Item]: ...
+    def nearest_neighbor(self, xy: Point, *, as_item: Literal[True]) -> Item | None: ...
 
     def nearest_neighbor(self, xy: Point, *, as_item: bool = False):
         """
@@ -266,7 +259,7 @@ class QuadTree:
 
         if self._items is None:
             raise ValueError("Cannot return result as item with track_objects=False")
-        id_, x, y = t
+        id_, _x, _y = t
         item = self._items.by_id(id_)
         if item is None:
             raise RuntimeError(
@@ -278,12 +271,12 @@ class QuadTree:
     @overload
     def nearest_neighbors(
         self, xy: Point, k: int, *, as_items: Literal[False] = ...
-    ) -> List[_IdCoord]: ...
+    ) -> list[_IdCoord]: ...
 
     @overload
     def nearest_neighbors(
         self, xy: Point, k: int, *, as_items: Literal[True]
-    ) -> List[Item]: ...
+    ) -> list[Item]: ...
 
     def nearest_neighbors(self, xy: Point, k: int, *, as_items: bool = False):
         """
@@ -303,7 +296,7 @@ class QuadTree:
         if self._items is None:
             raise ValueError("Cannot return results as items with track_objects=False")
 
-        out: List[Item] = []
+        out: list[Item] = []
         for id_, _, _ in raw:
             item = self._items.by_id(id_)
             if item is None:
@@ -316,7 +309,7 @@ class QuadTree:
 
     # ---------- misc ----------
 
-    def get(self, id: int) -> Any | None:
+    def get(self, id_: int) -> Any | None:
         """
         Return the object associated with id.
 
@@ -325,12 +318,12 @@ class QuadTree:
         """
         if self._items is None:
             raise ValueError("Cannot get objects when track_objects=False")
-        item = self._items.by_id(id)
+        item = self._items.by_id(id_)
         if item is None:
             return None
         return item.obj
 
-    def get_all_rectangles(self) -> List[Bounds]:
+    def get_all_rectangles(self) -> list[Bounds]:
         """
         Return all node rectangles in the current quadtree.
 
@@ -339,7 +332,7 @@ class QuadTree:
         """
         return self._native.get_all_rectangles()
 
-    def get_all_objects(self) -> List[Any]:
+    def get_all_objects(self) -> list[Any]:
         """
         Return all tracked objects.
 
@@ -350,7 +343,7 @@ class QuadTree:
             raise ValueError("Cannot get objects when track_objects=False")
         return [t.obj for t in self._items.items() if t.obj is not None]
 
-    def get_all_items(self) -> List[Item]:
+    def get_all_items(self) -> list[Item]:
         """
         Return all tracked items.
 
@@ -385,4 +378,4 @@ class QuadTree:
     NativeQuadTree = _RustQuadTree
 
 
-__all__ = ["QuadTree", "Item", "Bounds", "Point"]
+__all__ = ["Bounds", "Item", "Point", "QuadTree"]

fastquadtree/__init__.pyi

@@ -1,67 +1,70 @@
-from typing import Any, Iterable, List, Optional, Tuple, Type, overload
-from typing import Literal as _Literal  # avoid polluting public namespace
+from typing import (
+    Any,
+    Iterable,
+    Literal as _Literal,  # avoid polluting public namespace
+    overload,
+)
 
-Bounds = Tuple[float, float, float, float]
-Point = Tuple[float, float]
+Bounds = tuple[float, float, float, float]
+Point = tuple[float, float]
 
 class Item:
-    id: int
+    id_: int
     x: float
     y: float
     obj: Any | None
 
 class QuadTree:
     # Expose the raw native class for power users
-    NativeQuadTree: Type
+    NativeQuadTree: type
 
     def __init__(
         self,
         bounds: Bounds,
         capacity: int,
         *,
-        max_depth: Optional[int] = None,
+        max_depth: int | None = None,
         track_objects: bool = False,
         start_id: int = 1,
     ) -> None: ...
 
     # Inserts
-    def insert(self, xy: Point, *, id: Optional[int] = ..., obj: Any = ...) -> int: ...
+    def insert(self, xy: Point, *, id_: int | None = ..., obj: Any = ...) -> int: ...
     def insert_many_points(self, points: Iterable[Point]) -> int: ...
-    def insert_many(self, items: Iterable[Tuple[Point, Any]]) -> int: ...
-    def attach(self, id: int, obj: Any) -> None: ...
+    def attach(self, id_: int, obj: Any) -> None: ...
 
     # Deletions
-    def delete(self, id: int, xy: Point) -> bool: ...
+    def delete(self, id_: int, xy: Point) -> bool: ...
     def delete_by_object(self, obj: Any) -> bool: ...
 
     # Queries
     @overload
     def query(
         self, rect: Bounds, *, as_items: _Literal[False] = ...
-    ) -> List[Tuple[int, float, float]]: ...
+    ) -> list[tuple[int, float, float]]: ...
     @overload
-    def query(self, rect: Bounds, *, as_items: _Literal[True]) -> List[Item]: ...
+    def query(self, rect: Bounds, *, as_items: _Literal[True]) -> list[Item]: ...
     @overload
     def nearest_neighbor(
         self, xy: Point, *, as_item: _Literal[False] = ...
-    ) -> Optional[Tuple[int, float, float]]: ...
+    ) -> tuple[int, float, float] | None: ...
     @overload
     def nearest_neighbor(
         self, xy: Point, *, as_item: _Literal[True]
-    ) -> Optional[Item]: ...
+    ) -> Item | None: ...
     @overload
     def nearest_neighbors(
         self, xy: Point, k: int, *, as_items: _Literal[False] = ...
-    ) -> List[Tuple[int, float, float]]: ...
+    ) -> list[tuple[int, float, float]]: ...
     @overload
     def nearest_neighbors(
         self, xy: Point, k: int, *, as_items: _Literal[True]
-    ) -> List[Item]: ...
+    ) -> list[Item]: ...
 
     # Misc
-    def get(self, id: int) -> Any | None: ...
-    def get_all_rectangles(self) -> List[Bounds]: ...
-    def get_all_objects(self) -> List[Any]: ...
-    def get_all_items(self) -> List[Item]: ...
+    def get(self, id_: int) -> Any | None: ...
+    def get_all_rectangles(self) -> list[Bounds]: ...
+    def get_all_objects(self) -> list[Any]: ...
+    def get_all_items(self) -> list[Item]: ...
     def count_items(self) -> int: ...
     def __len__(self) -> int: ...

fastquadtree/_bimap.py

@@ -1,6 +1,7 @@
 # _bimap.py
 from __future__ import annotations
-from typing import Any, Iterable, Iterator, Tuple, Optional
+
+from typing import Any, Iterable, Iterator
 
 from ._item import Item
 
@@ -33,7 +34,7 @@ class BiMap:
         Insert or replace mapping for this Item.
         Handles conflicts so that both id and obj point to this exact Item.
         """
-        id_ = item.id
+        id_ = item.id_
         obj = item.obj
 
         # Unlink any old item currently bound to this id
@@ -47,20 +48,20 @@ class BiMap:
         if obj is not None:
             prev = self._objid_to_item.get(id(obj))
             if prev is not None and prev is not item:
-                self._id_to_item.pop(prev.id, None)
+                self._id_to_item.pop(prev.id_, None)
 
         # Link new
         self._id_to_item[id_] = item
         if obj is not None:
             self._objid_to_item[id(obj)] = item
 
-    def by_id(self, id_: int) -> Optional[Item]:
+    def by_id(self, id_: int) -> Item | None:
         return self._id_to_item.get(id_)
 
-    def by_obj(self, obj: Any) -> Optional[Item]:
+    def by_obj(self, obj: Any) -> Item | None:
         return self._objid_to_item.get(id(obj))
 
-    def pop_id(self, id_: int) -> Optional[Item]:
+    def pop_id(self, id_: int) -> Item | None:
         it = self._id_to_item.pop(id_, None)
         if it is not None:
             obj = it.obj
@@ -68,19 +69,19 @@ class BiMap:
                 self._objid_to_item.pop(id(obj), None)
         return it
 
-    def pop_obj(self, obj: Any) -> Optional[Item]:
+    def pop_obj(self, obj: Any) -> Item | None:
         it = self._objid_to_item.pop(id(obj), None)
         if it is not None:
-            self._id_to_item.pop(it.id, None)
+            self._id_to_item.pop(it.id_, None)
         return it
 
-    def pop_item(self, item: Item) -> Optional[Item]:
+    def pop_item(self, item: Item) -> Item | None:
         """
         Remove this exact Item if present on either side.
         """
         removed = None
         # Remove by id first
-        removed = self._id_to_item.pop(item.id)
+        removed = self._id_to_item.pop(item.id_)
 
         # Remove by obj side
         obj = item.obj
@@ -104,7 +105,7 @@ class BiMap:
     def contains_obj(self, obj: Any) -> bool:
         return id(obj) in self._objid_to_item
 
-    def items_by_id(self) -> Iterator[Tuple[int, Item]]:
+    def items_by_id(self) -> Iterator[tuple[int, Item]]:
         return iter(self._id_to_item.items())
 
     def items(self) -> Iterator[Item]:

fastquadtree/_item.py

@@ -1,5 +1,6 @@
 # item.py
 from __future__ import annotations
+
 from typing import Any
 
 
@@ -8,16 +9,16 @@ class Item:
     Lightweight view of an index entry.
 
     Attributes:
-        id: Integer identifier.
+        id_: Integer identifier.
         x: X coordinate.
         y: Y coordinate.
         obj: The attached Python object if available, else None.
     """
 
-    __slots__ = ("id", "x", "y", "obj")
+    __slots__ = ("id_", "obj", "x", "y")
 
-    def __init__(self, id: int, x: float, y: float, obj: Any | None = None):
-        self.id = id
+    def __init__(self, id_: int, x: float, y: float, obj: Any | None = None):
+        self.id_ = id_
         self.x = x
         self.y = y
         self.obj = obj

{fastquadtree-0.5.0.dist-info → fastquadtree-0.6.0.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: fastquadtree
-Version: 0.5.0
+Version: 0.6.0
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Programming Language :: Rust
@@ -11,6 +11,13 @@ Classifier: Topic :: Scientific/Engineering :: Information Analysis
 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: coverage>=7.5 ; extra == 'dev'
+Requires-Dist: mypy>=1.10 ; extra == 'dev'
+Requires-Dist: build>=1.2.1 ; 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
@@ -28,15 +35,15 @@ Project-URL: Issues, https://github.com/Elan456/fastquadtree/issues
 [![Wheels](https://img.shields.io/pypi/wheel/fastquadtree.svg)](https://pypi.org/project/fastquadtree/#files)
 [![License: MIT](https://img.shields.io/pypi/l/fastquadtree.svg)](LICENSE)
 
-[![Downloads total](https://static.pepy.tech/badge/fastquadtree)](https://pepy.tech/projects/fastquadtree)
-[![Downloads month](https://static.pepy.tech/badge/fastquadtree/month)](https://pepy.tech/projects/fastquadtree)
+[![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)
 [![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/)
 [![Built with maturin](https://img.shields.io/badge/Built%20with-maturin-1f6feb)](https://www.maturin.rs/)
-[![Code style: Black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)
+[![Ruff](https://img.shields.io/endpoint?url=https://raw.githubusercontent.com/astral-sh/ruff/main/assets/badge/v2.json)](https://github.com/astral-sh/ruff)
+
 
 
 ![Interactive_V2_Screenshot](https://raw.githubusercontent.com/Elan456/fastquadtree/main/assets/interactive_v2_screenshot.png)
@@ -58,18 +65,27 @@ fastquadtree **outperforms** all other quadtree Python packages, including the R
 ![Throughput](https://raw.githubusercontent.com/Elan456/fastquadtree/main/assets/quadtree_bench_throughput.png)
 
 ### Summary (largest dataset, PyQtree baseline)
-- Points: **500,000**, Queries: **500**
+- Points: **250,000**, Queries: **500**
 --------------------
-- Fastest total: **fastquadtree** at **1.591 s**
+- Fastest total: **fastquadtree** at **0.120 s**
 
 | Library | Build (s) | Query (s) | Total (s) | Speed vs PyQtree |
 |---|---:|---:|---:|---:|
-| fastquadtree | 0.165 | 1.427 | 1.591 | 5.09× |
-| Rtree        | 1.320 | 2.369 | 3.688 | 2.20× |
-| PyQtree      | 2.687 | 5.415 | 8.102 | 1.00× |
-| nontree-QuadTree | 1.284 | 9.891 | 11.175 | 0.73× |
-| quads        | 2.346 | 10.129 | 12.475 | 0.65× |
-| e-pyquadtree | 1.795 | 11.855 | 13.650 | 0.59× |
+| 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
+| Parameter | Value |
+|---|---:|
+| Bounds | (0, 0, 1000, 1000) |
+| Max points per node | 128 |
+| Max depth | 16 |
+| Queries per experiment | 500 |
 
 ## Install
 
@@ -273,7 +289,7 @@ MIT. See `LICENSE`.
 
 ## Acknowledgments
 
-* Python libraries compared: [PyQtree], [e-pyquadtree], [Rtree], [nontree], [quads]
+* Python libraries compared: [PyQtree], [e-pyquadtree], [Rtree], [nontree], [quads], [Shapely]
 * Built with [PyO3] and [maturin]
 
 [PyQtree]: https://pypi.org/project/pyqtree/
@@ -282,4 +298,6 @@ MIT. See `LICENSE`.
 [maturin]: https://www.maturin.rs/
 [Rtree]: https://pypi.org/project/Rtree/
 [nontree]: https://pypi.org/project/nontree/
-[quads]: https://pypi.org/project/quads/
+[quads]: https://pypi.org/project/quads/
+[Shapely]: https://pypi.org/project/Shapely/
+

fastquadtree-0.6.0.dist-info/RECORD

@@ -0,0 +1,10 @@
+fastquadtree-0.6.0.dist-info/METADATA,sha256=NRMlg6YFAuT7fwSjEfV2F_r3Yw71JDwKibvRVPaQyHI,10746
+fastquadtree-0.6.0.dist-info/WHEEL,sha256=7bfl5v0wbVhXZba613g0x-n2obNNfpQuN8I1cQ4oaU8,94
+fastquadtree-0.6.0.dist-info/licenses/LICENSE,sha256=46IVFhoCIwMo-ocq4olyEB1eBvvtaKic5yGLeKXnDuc,1092
+fastquadtree/__init__.py,sha256=o7zH6lOu2lTxMafl9FNVZiecM0KVxqhC3FNSRbpaaqY,12435
+fastquadtree/__init__.pyi,sha256=_HGJ9lpIZ9-JTSfMKSn8aif_tu60m2vgOXR4d0uXnRY,2062
+fastquadtree/_bimap.py,sha256=SPFFw9hWAVRKZVXyDGYFFNw4MLV8qUlOq8gDbLcTqkg,3402
+fastquadtree/_item.py,sha256=p-ymnE9S-c8Lc00KhNKN9Pt4bd05nZ6g-DB8q8D9zYk,533
+fastquadtree/_native.pyd,sha256=72nxQfcx-JZkSZM3Jm-r7qHbwrL6Rhd5lrvftuuioeQ,254464
+fastquadtree/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+fastquadtree-0.6.0.dist-info/RECORD,,

fastquadtree-0.5.0.dist-info/RECORD

@@ -1,10 +0,0 @@
-fastquadtree-0.5.0.dist-info/METADATA,sha256=7TPGeXEmmg20TEZc2Wx3gAiGMzdTuklhapwtEbn8IrQ,10119
-fastquadtree-0.5.0.dist-info/WHEEL,sha256=7bfl5v0wbVhXZba613g0x-n2obNNfpQuN8I1cQ4oaU8,94
-fastquadtree-0.5.0.dist-info/licenses/LICENSE,sha256=46IVFhoCIwMo-ocq4olyEB1eBvvtaKic5yGLeKXnDuc,1092
-fastquadtree/__init__.py,sha256=rqttCrFBaqMjD7BDZlcwkU9eeOQh2gzRi81xKHHLwLk,12652
-fastquadtree/__init__.pyi,sha256=4lKaqtnvylRzhj322ue_y_DO_xxrkzOzjpYnH5SN1Fg,2166
-fastquadtree/_bimap.py,sha256=zMp20NJkvVuO3jn2OeVApf7j4siBI4r2kU6SHyb7EZE,3428
-fastquadtree/_item.py,sha256=imyiwnbmY21mHsOvNqB4j-TsOPpAmsvb38LKxEL8q4o,526
-fastquadtree/_native.pyd,sha256=84XbRhl0Lj2ofRahwDK4Pjw_JiXvOVHfEFGD8hHbbJ0,247808
-fastquadtree/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-fastquadtree-0.5.0.dist-info/RECORD,,