| 程序包 | 说明 |
|---|---|
| org.h2.mvstore.rtree |
An R-tree implementation
|
| 限定符和类型 | 方法和说明 |
|---|---|
MVRTreeMap.RTreeCursor<V> |
MVRTreeMap.findContainedKeys(Spatial x)
Iterate over all keys that are fully contained within the given
rectangle.
|
MVRTreeMap.RTreeCursor<V> |
MVRTreeMap.findContainedKeys(Spatial x)
Iterate over all keys that are fully contained within the given
rectangle.
|
MVRTreeMap.RTreeCursor<V> |
MVRTreeMap.findIntersectingKeys(Spatial x)
Iterate over all keys that have an intersection with the given rectangle.
|
MVRTreeMap.RTreeCursor<V> |
MVRTreeMap.findIntersectingKeys(Spatial x)
Iterate over all keys that have an intersection with the given rectangle.
|
Copyright © 2022. All rights reserved.