James Adam Buckland

Hi @JohnDowson, I noticed that you made a few kinds of changes in this PR. Some of your changes were purely stylistic, and others were logical and prepared the crate...

I don't believe that information is currently publicly accessible. PRs implementing a query method exposing these internals would be very welcome. Let me know if you need any help.

Hi Luca, thanks for your question. One reason that I used a hashmap for this project was that it supported the needs I knew of at the time (performant queries,...

I don't like that `Area::new(width: U, height: U)` constructs an area anchored at (1,1) by default. That feels like a footgun to me. One of the things I liked about...

Sorry, I don't understand the issue yet. What is producing that error? Is it cargo build/test or something else?

@t-veor, thank you for this exhaustive and extremely helpful bug report! I am delighted to see someone else is using this library in a complex enough way to catch a...

[`Query`](https://docs.rs/quadtree_rs/latest/quadtree_rs/iter/struct.Query.html) is a bit "lazy" at the moment - it implements `Iterator`, but it's not possible to know whether or not that iterator is empty without consuming it. This means...

It is already possible to construct a `Query` and simply `.collect()` all the `Entry` s from its `Iterator`. I don't see what the benefit is of forcing every user of...

You can use `query` for this already. Here is an example: ```rust let mut qt = Quadtree::::new(4); // 0 1 2 3 4 5 6 // 0 +--+--+--+--+--+--+ // |...

This sounds pretty similar to the non-overlapping mode we discussed in https://github.com/ambuc/quadtree/issues/16. I would be happy to review PRs which add that mode. Perhaps [`Quadtree::insert`](https://docs.rs/quadtree_rs/latest/quadtree_rs/struct.Quadtree.html#method.insert) fails in non-overlapping mode if...