ScalarMeshField

Instance Constructors

new ScalarMeshField(mesh: TriangleMesh, data: ScalarArray[S])(implicit arg0: Scalar[S], arg1: ClassTag[S])

Returns a scalar mesh data given a triangle mesh and an array of values.
Returns a scalar mesh data given a triangle mesh and an array of values. The number of values and mesh points must be equal.

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def andThen[C](k: (S) ⇒ C): PartialFunction[PointId, C]

Definition Classes
PartialFunction → Function1
def apply(ptId: PointId): S

Definition Classes
ScalarMeshField → DiscreteScalarField → Function1
def applyOrElse[A1 <: PointId, B1 >: S](x: A1, default: (A1) ⇒ B1): B1

Definition Classes
PartialFunction
final def asInstanceOf[T0]: T0

Definition Classes
Any
def canEqual(other: Any): Boolean

Definition Classes
DiscreteScalarField
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compose[A](g: (A) ⇒ PointId): (A) ⇒ S

Definition Classes
Function1
Annotations
@unspecialized()
val data: ScalarArray[S]

Definition Classes
ScalarMeshField → DiscreteScalarField
val domain: TriangleMesh

Definition Classes
ScalarMeshField → DiscreteScalarField → DiscreteField
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(other: Any): Boolean

Definition Classes
DiscreteScalarField → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def foreach(f: (S) ⇒ Unit): Unit

Definition Classes
DiscreteField
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
lazy val hashCode: Int

Definition Classes
DiscreteScalarField → AnyRef → Any
def interpolateNearestNeighbor(): ScalarField[_3D, S]

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

Definition Classes
DiscreteScalarField → DiscreteField
def isDefinedAt(ptId: PointId): Boolean

Definition Classes
ScalarMeshField → DiscreteScalarField → PartialFunction
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def lift: (PointId) ⇒ Option[S]

Definition Classes
PartialFunction
def map[S2](f: (S) ⇒ S2)(implicit arg0: Scalar[S2], arg1: ClassTag[S2]): ScalarMeshField[S2]

map the function f over the values, but ensures that the result is scalar valued as well
map the function f over the values, but ensures that the result is scalar valued as well

Definition Classes
ScalarMeshField → DiscreteScalarField
val mesh: TriangleMesh
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def orElse[A1 <: PointId, B1 >: S](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

Definition Classes
PartialFunction
def pointsWithIds: Iterator[(Point[_3D], Int)]

Definition Classes
DiscreteField
def pointsWithValues: Iterator[(Point[_3D], S)]

Definition Classes
DiscreteField
def runWith[U](action: (S) ⇒ U): (PointId) ⇒ Boolean

Definition Classes
PartialFunction
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
Function1 → AnyRef → Any
def values: Iterator[S]

Definition Classes
ScalarMeshField → DiscreteScalarField → DiscreteField
def valuesWithIds: Iterator[(S, PointId)]

Definition Classes
DiscreteField
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package mesh

case class ScalarMeshField[S](mesh: TriangleMesh, data: ScalarArray[S])(implicit evidence$1: Scalar[S], evidence$2: ClassTag[S]) extends DiscreteScalarField[_3D, S] with Product with Serializable

Instance Constructors

new ScalarMeshField(mesh: TriangleMesh, data: ScalarArray[S])(implicit arg0: Scalar[S], arg1: ClassTag[S])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

def apply(ptId: PointId): S

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

final def asInstanceOf[T0]: T0

def canEqual(other: Any): Boolean

def clone(): AnyRef

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

val data: ScalarArray[S]

val domain: TriangleMesh

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

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

final def getClass(): Class[_]

lazy val hashCode: Int

def interpolateNearestNeighbor(): ScalarField[_3D, S]

def isDefinedAt(ptId: PointId): Boolean

final def isInstanceOf[T0]: Boolean

def lift: (PointId) ⇒ Option[S]

def map[S2](f: (S) ⇒ S2)(implicit arg0: Scalar[S2], arg1: ClassTag[S2]): ScalarMeshField[S2]

val mesh: TriangleMesh

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def pointsWithValues: Iterator[(Point[_3D], S)]

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

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

def toString(): String

def values: Iterator[S]

def valuesWithIds: Iterator[(S, PointId)]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from DiscreteScalarField[_3D, S]

Inherited from DiscreteField[_3D, S]

Inherited from PartialFunction[PointId, S]

Inherited from (PointId) ⇒ S

Inherited from AnyRef

Inherited from Any

Ungrouped