RTree Methods |
The RTree type exposes the following members.
| Name | Description | |
|---|---|---|
| Add |
Start at the Root Node
Select the child that needs the least enlargement in order to fit the new geometry.
Repeat until at a leaf node.
If leaf node has available space insert Else split the entry into two nodes
Update parent nodes
Update the entry that pointed to the node with a new minimum bounding rectangle
Add a new entry for the second new node
If there is no space in the parent node, split and repeat
| |
| checkConsistency |
Check the consistency of the tree.
| |
| Contains |
Finds all rectangles contained by the passed rectangle
| |
| InitializeAfterRead | (Overrides OptimizedPersistableInitializeAfterRead(SessionBase).) | |
| Intersects |
Finds all rectangles that intersect the passed rectangle.
| |
| Nearest |
Finds the nearest rectangles to the passed point. If multiple rectangles are equally near, they will all be returned.
| |
| NearestN |
Finds the N nearest rectangles to the passed point. If multiple rectangles are equally near, they will all (but total limited to N) be returned.
| |
| Remove |
Removes a rectangle from the Rtree
|
| Name | Description | |
|---|---|---|
| ToStringDetails(SessionBase, Boolean) | Overloaded.
Object details as a string
(Defined by Utilities.) | |
| ToStringDetails(Schema, TypeVersion, Boolean) | Overloaded.
Currently only used by Database Manager
(Defined by Utilities.) |