A spatial index using a 2D fast long hashtable (Trove lib). Objects to index are placed in all grid bins touching the bounding envelope. We *do not store* any bouding envelope for each object, so this imply that we will return false positive when querying, and it's up to the client to filter them out (with whatever knowledge it has on the location of the object). Note: For performance reasons, write operation are not synchronized, it must be taken care by the client. Read-only operation are multi-thread-safe though.
| name | data type | description |
|---|
Example
{ }