Abstract Value Members
-
abstract
def
left: KDTree
-
abstract
def
node: Seq[Double]
-
abstract
def
right: KDTree
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
->[B](y: B): (KDTree, B)
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
distance(p1: Seq[Double], p2: Seq[Double]): Double
-
def
ensuring(cond: (KDTree) ⇒ Boolean, msg: ⇒ Any): KDTree
-
def
ensuring(cond: (KDTree) ⇒ Boolean): KDTree
-
def
ensuring(cond: Boolean, msg: ⇒ Any): KDTree
-
def
ensuring(cond: Boolean): KDTree
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
insertInKNearest(l: Seq[Seq[Double]], e: Seq[Double], query: Seq[Double], k: Int): Seq[Seq[Double]]
-
final
def
isInstanceOf[T0]: Boolean
-
def
knearest(k: Int, query: Seq[Double], depth: Int = 0): Seq[Seq[Double]]
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nearest(query: Seq[Double], depth: Int = 0): Seq[Double]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toSeq: Seq[Seq[Double]]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
→[B](y: B): (KDTree, B)
Inherited from AnyRef
Inherited from Any
Inherited by implicit conversion any2stringadd from
KDTree to any2stringadd[KDTree]
Inherited by implicit conversion StringFormat from
KDTree to StringFormat[KDTree]
Inherited by implicit conversion Ensuring from
KDTree to Ensuring[KDTree]
Inherited by implicit conversion ArrowAssoc from
KDTree to ArrowAssoc[KDTree]
KD-Tree algorithm from https://en.wikipedia.org/wiki/Kd-tree 5-5-2014