UnstructuredPointsDomain

abstract def boundingBox: BoxDomain[D]

Returns the smallest continuous box domain that fully contains all the domain points.

abstract def transform(t: (Point[D]) ⇒ Point[D]): DiscreteDomain[D]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

def findClosestPoint(pt: Point[D]): PointWithId[D]

* Returns the point belonging to the domain that is closest to the indicated position.

def findNClosestPoints(pt: Point[D], n: Int): Seq[PointWithId[D]]

final def getClass(): Class[_]

def hashCode(): Int

def isDefinedAt(pt: Point[D]): Boolean

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numberOfPoints: Int

def point(id: PointId): Point[D]

def pointId(pt: Point[D]): Option[PointId]

def pointIds: Iterator[PointId]

def points: Iterator[Point[D]]

def pointsWithId: Iterator[(Point[D], PointId)]

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