Instance Constructors
-
new
QuadTreeSpace(pos: Map[E, P], radius: Double, bound: Option[Bound] = None)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
add(e: E, p: P): Unit
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
contains(e: E): Boolean
-
var
elemPositions: Map[E, P]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
getAll(): Iterable[E]
-
def
getAt(p: P): Option[E]
-
final
def
getClass(): Class[_]
-
def
getDistance(p1: P, p2: P): Double
-
def
getLocation(e: E): P
-
def
getNeighbors(e: E): Iterable[E]
-
def
getNeighborsWithDistance(e: E): Iterable[(E, D)]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
def
neighbouring(p1: P, p2: P): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
val
proximityThreshold: Double
-
def
remove(e: E): Unit
-
def
setLocation(e: E, p: P): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
wait(): Unit
Deprecated Value Members
-
def
finalize(): Unit
Inherited from Serializable
Inherited from Serializable
Inherited from AnyRef
Inherited from Any
a space that used quad tree index to compute neighbour
the type of node