DiscreteField

abstract def apply(v1: PointId): A

abstract def domain: DiscreteDomain[D]

abstract def interpolateNearestNeighbor(): Field[D, A]

Returns a continuous field, where the value at each point is that of the closest point in the discrete set *

abstract def isDefinedAt(x: PointId): Boolean

abstract def values: Iterator[A]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[C](k: (A) ⇒ C): PartialFunction[PointId, C]

def applyOrElse[A1 <: PointId, B1 >: A](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[A](g: (A) ⇒ PointId): (A) ⇒ A

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foreach(f: (A) ⇒ Unit): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lift: (PointId) ⇒ Option[A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: PointId, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def pointsWithIds: Iterator[(Point[D], Int)]

def pointsWithValues: Iterator[(Point[D], A)]

def runWith[U](action: (A) ⇒ U): (PointId) ⇒ Boolean

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def valuesWithIds: Iterator[(A, PointId)]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit