- fix doc mistakes

- remove unreachable impl for tuple

Author: kingwingfly

CHANGELOG.md

@@ -9,6 +9,11 @@ Note: In this file, do not use the hard wrap in the middle of a sentence for com
 -->
 
 ## [Unreleased]
+### [0.15.1-alpha3] - 2025-01-20
+
+- fix doc mistakes
+- remove unreachable impl for tuple
+
 ### [0.15.1-alpha2] - 2025-01-20
 
 - Add `ID` type parameter for differentiating multiple quadtree if needed.

Cargo.toml

@@ -3,7 +3,7 @@ members = ["bevy_quadtree"]
 resolver = "2"
 
 [workspace.package]
-version = "0.15.1-alpha2"
+version = "0.15.1-alpha3"
 authors = ["Louis <[email protected]>"]
 description = "A quadtree plugin for bevy"
 license = "MIT"

bevy_quadtree/README.md

@@ -193,7 +193,7 @@ xx.observe(
             let delta = Vec2::new(ev.width * FONT_WIDTH, (ev.height - 1.) * FONT_HEIGHT);
             s.custom_size = Some(CUSTOM_SIZE + delta);
             // the plugin default only track `Changed<GlobalTransform>`
-            // without feature `sprite` enable, you can also do this way.
+            // without feature `sprite` enabled, you can also do this way.
             c.set_init_size(CUSTOM_SIZE + delta);
         }
     },

bevy_quadtree/src/query.rs

@@ -8,7 +8,7 @@ pub struct QOr<T>(core::marker::PhantomData<T>);
 /// `Not` filter used in `QuadTree::query`
 pub struct QNot<T>(core::marker::PhantomData<T>);
 
-/// implemented for [`Disjoint`], [`Overlap`], [`Contain`], [`Contained`], [`QOr`], [`QNot`] and tuple of them.
+/// implemented for [`Disjoint`], [`Overlap`], [`Contain`], [`Contained`], [`QOr`], [`QNot`].
 ///
 /// There is no `QAnd` because all the filters do not overlap, e.g. `QAnd<(Disjoint, Contain)>` is always empty.
 #[allow(missing_docs)]
@@ -191,15 +191,10 @@ macro_rules! impl_or_relation {
     };
 }
 
-impl_or_relation!(R1);
-impl_or_relation!(R1, R2);
-impl_or_relation!(R1, R2, R3);
-impl_or_relation!(R1, R2, R3, R4);
-impl_or_relation!(R1, R2, R3, R4, R5);
-impl_or_relation!(R1, R2, R3, R4, R5, R6);
-impl_or_relation!(R1, R2, R3, R4, R5, R6, R7);
-impl_or_relation!(R1, R2, R3, R4, R5, R6, R7, R8);
-impl_or_relation!(R1, R2, R3, R4, R5, R6, R7, R8, R9);
+impl_or_relation!(R0);
+impl_or_relation!(R0, R1);
+impl_or_relation!(R0, R1, R2);
+impl_or_relation!(R0, R1, R2, R3);
 
 macro_rules! impl_not_relation {
     ($($r: ident), +) => {

bevy_quadtree/src/tree.rs

@@ -88,7 +88,7 @@ impl<const N: usize, const W: usize, const H: usize, const K: usize, const ID: u
     /// The rule of the relation is defined in [`CollisionQuery::query`] and [`query`](crate::query).
     ///
     /// [`QRelation`]: implemented for [`Disjoint`](crate::Disjoint), [`Overlap`](crate::Overlap),
-    /// [`Contain`](crate::Contain), [`Contained`](crate::Contained), [`QOr`](crate::QOr), [`QNot`](crate::QNot) and tuple of them.
+    /// [`Contain`](crate::Contain), [`Contained`](crate::Contained), [`QOr`](crate::QOr), [`QNot`](crate::QNot).
     pub fn query<S, Q>(&self, boundary: &S) -> EntityHashSet
     where
         S: CollisionQuery,