object
KNearestRDD
Type Members
-
case class
Ord[T](ex: Geometry, f: (T) ⇒ Geometry) extends Ordering[T] with Serializable with Product
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
kNearest[G, H](rdd: RDD[G], centers: Traversable[H], k: Int)(g: (G) ⇒ Geometry, h: (H) ⇒ Geometry): Seq[Seq[G]]
-
def
kNearest[T](rdd: RDD[T], ex: Extent, k: Int)(f: (T) ⇒ Geometry): Seq[T]
-
def
kNearest[T](rdd: RDD[T], p: Point, k: Int)(f: (T) ⇒ Geometry): Seq[T]
-
def
kNearest[T](rdd: RDD[T], p: (Double, Double), k: Int)(f: (T) ⇒ Geometry): Seq[T]
-
def
kNearest[T](rdd: RDD[T], x: Double, y: Double, k: Int)(f: (T) ⇒ Geometry): Seq[T]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any