Struct quadtree_f32::QuadTree [−][src]
pub struct QuadTree { /* fields omitted */ }
Expand description
A QuadTree that can store rectangles and points
Implementations
Constructs a new QuadTree with at most 1/20th of the items per box = each box contains at max 5% of the points
For performance, how many items should be in each quad before it gets subdivided?
Query the IDs of all items that overlap the rect
Query the IDs of all items completely contained by the rect
Returns all points in the QuadTree that are within the bounds of rect
Returns all rectangles in the QuadTree that overlap rect
Returns all rectangles in the QuadTree that are completely contained by rect
Trait Implementations
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
Auto Trait Implementations
impl RefUnwindSafe for QuadTree
impl UnwindSafe for QuadTree
Blanket Implementations
Mutably borrows from an owned value. Read more