| 程序包 | 说明 |
|---|---|
| org.h2.mvstore.rtree |
An R-tree implementation
|
| 限定符和类型 | 方法和说明 |
|---|---|
SpatialKey |
MVRTreeMap.RTreeCursor.next() |
| 限定符和类型 | 方法和说明 |
|---|---|
void |
MVRTreeMap.add(SpatialKey key,
V value)
Add a given key-value pair.
|
protected boolean |
MVRTreeMap.RTreeCursor.check(boolean leaf,
SpatialKey key,
SpatialKey test)
Check a given key.
|
boolean |
SpatialKey.equalsIgnoringId(SpatialKey o)
Check whether two objects are equals, but do not compare the id fields.
|
MVRTreeMap.RTreeCursor |
MVRTreeMap.findContainedKeys(SpatialKey x)
Iterate over all keys that are fully contained within the given
rectangle.
|
MVRTreeMap.RTreeCursor |
MVRTreeMap.findIntersectingKeys(SpatialKey x)
Iterate over all keys that have an intersection with the given rectangle.
|
V |
MVRTreeMap.put(SpatialKey key,
V value) |
| 限定符和类型 | 方法和说明 |
|---|---|
void |
MVRTreeMap.addNodeKeys(ArrayList<SpatialKey> list,
Page p)
Add all node keys (including internal bounds) to the given list.
|
| 构造器和说明 |
|---|
RTreeCursor(Page root,
SpatialKey filter) |
Copyright © 2017. All rights reserved.