Skip to content

Update README.md #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
alexespencer merged 1 commit into from
May 25, 2025
Merged

Update README.md #10

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,8 +10,8 @@ use std::num::NonZero;

// Create a region, the bounds of the quadtree
let region = Region::new(&[
Interval::try_new(0.0, 10.0).unwrap(), // X-axis
Interval::try_new(0.0, 10.0).unwrap(), // Y-axis
Interval::try_new(0.0, 10.0)?, // X-axis
Interval::try_new(0.0, 10.0)?, // Y-axis
]);

// Initialise the QuadTree with this region and the maximum number of points each
Expand All @@ -23,16 +23,16 @@ let mut quadtree = QuadTree::new(&region, NonZero::new(4).unwrap());

// Insert points into the QuadTree
for i in 0..4 {
quadtree.insert(Point::new(&[i, 0])).unwrap();
quadtree.insert(Point::new(&[i, 0]))?;
}

// To query the QuadTree, provide a region, or anything that implements the Query trait
let query_region = Region::new(&[
Interval::try_new(0.0, 2.0).unwrap(),
Interval::try_new(0.0, 10.0).unwrap(),
Interval::try_new(0.0, 2.0)?,
Interval::try_new(0.0, 10.0)?,
]);

let results: Vec<_> = quadtree.query(&query_region).collect();

assert_eq!(results.len(), 2);
```
```