abstract class AbstractSTRtree extends Serializable
- Annotations
- @SerialVersionUID()
- Alphabetic
- By Inheritance
- AbstractSTRtree
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
Abstract Value Members
- abstract def createNode(level: Int): AbstractNode
- Attributes
- protected
- abstract def getComparator: Comparator[Boundable]
- Attributes
- protected
- abstract def getIntersectsOp: IntersectsOp
return a test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds.
return a test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds.
- Attributes
- protected
- See also
IntersectsOp
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def boundablesAtLevel(level: Int): ArrayList[Boundable]
- Attributes
- protected
- def build(): Unit
Creates parent nodes, grandparent nodes, and so forth up to the root node, for the data that has been inserted into the tree.
Creates parent nodes, grandparent nodes, and so forth up to the root node, for the data that has been inserted into the tree. Can only be called once, and thus can be called only after all of the data has been inserted into the tree.
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def createParentBoundables(childBoundables: List[Boundable], newLevel: Int): ArrayList[AbstractNode]
Sorts the childBoundables then divides them into groups of size M, where M is the node capacity.
Sorts the childBoundables then divides them into groups of size M, where M is the node capacity.
- Attributes
- protected
- def depth(node: AbstractNode): Int
- Attributes
- protected
- def depth: Int
- Attributes
- protected
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getNodeCapacity: Int
Returns the maximum number of child nodes that a node may have.
Returns the maximum number of child nodes that a node may have.
return the node capacity
- def getRoot: AbstractNode
Gets the root node of the tree.
Gets the root node of the tree.
return the root node
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def insert(bounds: AnyRef, item: Any): Boolean
- Attributes
- protected
- def isEmpty: Boolean
Tests whether the index contains any items.
Tests whether the index contains any items. This method does not build the index, so items can still be inserted after it has been called.
return true if the index does not contain any items
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def itemsTree: List[Any]
Gets a tree structure (as a nested list) corresponding to the structure of the items and nodes in this tree.
Gets a tree structure (as a nested list) corresponding to the structure of the items and nodes in this tree.
The returned {link List}s contain either {link Object} items, or Lists which correspond to subtrees of the tree Subtrees which do not contain any items are not included.
Builds the tree if necessary.
return a List of items and/or Lists
- def lastNode(nodes: List[AbstractNode]): AbstractNode
- Attributes
- protected
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- var nodeCapacity: Int
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def query(searchBounds: Any, visitor: ItemVisitor): Unit
- Attributes
- protected
- def query(searchBounds: Any): List[Any]
Also builds the tree, if necessary.
Also builds the tree, if necessary.
- Attributes
- protected
- def remove(searchBounds: Any, item: Any): Boolean
Removes an item from the tree.
Removes an item from the tree. (Builds the tree, if necessary.)
- Attributes
- protected
- var root: AbstractNode
- Attributes
- protected
- def size(node: AbstractNode): Int
- Attributes
- protected
- def size: Int
- Attributes
- protected
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()