class KDB extends PartitioningUtils with Serializable
see <a href="https://en.wikipedia.org/wiki/K-D-B-tree">https://en.wikipedia.org/wiki/K-D-B-tree
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- KDB
- Serializable
- PartitioningUtils
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new KDB(maxItemsPerNode: Int, maxLevels: Int, extent: Envelope)
Value Members
- def assignLeafIds(): Unit
- def dropElements(): Unit
-
def
fetchLeafZones(): List[Envelope]
- Definition Classes
- KDB → PartitioningUtils
- Annotations
- @Override()
- def findLeafNodes(envelope: Envelope): List[KDB]
- def getExtent(): Envelope
- def getItemCount(): Int
-
def
getKeys(geometry: Geometry): Set[Integer]
- Definition Classes
- KDB → PartitioningUtils
- Annotations
- @Override()
- def getLeafId(): Int
- def insert(envelope: Envelope): Unit
- def isLeaf(): Boolean
-
def
placeObject(geometry: Geometry): Iterator[(Integer, Geometry)]
- Definition Classes
- KDB → PartitioningUtils
- Annotations
- @Override()
-
def
traverse(visitor: Visitor): Unit
Traverses the tree top-down breadth-first and calls the visitor for each node.
Traverses the tree top-down breadth-first and calls the visitor for each node. Stops traversing if a call to Visitor.visit returns false.