DiscreteVectorField

Instance Constructors

new DiscreteVectorField(domain: DiscreteDomain[D], data: IndexedSeq[Vector[DO]])(implicit arg0: NDSpace[D], arg1: NDSpace[DO])

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: (Vector[DO]) ⇒ C): PartialFunction[PointId, C]

Definition Classes
PartialFunction → Function1
def apply(ptId: PointId): Vector[DO]

Definition Classes
DiscreteVectorField → Function1
def applyOrElse[A1 <: PointId, B1 >: Vector[DO]](x: A1, default: (A1) ⇒ B1): B1

Definition Classes
PartialFunction
def asBreezeVector: DenseVector[Float]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

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

Definition Classes
Function1
Annotations
@unspecialized()
val domain: DiscreteDomain[D]

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

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

Definition Classes
AnyRef → Any
def finalize(): Unit

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

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def interpolateNearestNeighbor(): VectorField[D, DO]

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
DiscreteVectorField → DiscreteField
def isDefinedAt(ptId: PointId): Boolean

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

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

Definition Classes
PartialFunction
def map(f: (Vector[DO]) ⇒ Vector[DO]): DiscreteVectorField[D, DO]

map the function f over the values, but ensures that the result is scalar valued as well
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 >: Vector[DO]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

Definition Classes
DiscreteField
def pointsWithValues: Iterator[(Point[D], Vector[DO])]

Definition Classes
DiscreteField
def runWith[U](action: (Vector[DO]) ⇒ 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[Vector[DO]]

Definition Classes
DiscreteVectorField → DiscreteField
def valuesWithIds: Iterator[(Vector[DO], 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 Docs: object DiscreteVectorField | package common

class DiscreteVectorField[D <: Dim, DO <: Dim] extends DiscreteField[D, Vector[DO]]

Instance Constructors

new DiscreteVectorField(domain: DiscreteDomain[D], data: IndexedSeq[Vector[DO]])(implicit arg0: NDSpace[D], arg1: NDSpace[DO])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

def apply(ptId: PointId): Vector[DO]

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

def asBreezeVector: DenseVector[Float]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

val domain: DiscreteDomain[D]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foreach(f: (Vector[DO]) ⇒ Unit): Unit

final def getClass(): Class[_]

def hashCode(): Int

def interpolateNearestNeighbor(): VectorField[D, DO]

def isDefinedAt(ptId: PointId): Boolean

final def isInstanceOf[T0]: Boolean

def lift: (PointId) ⇒ Option[Vector[DO]]

def map(f: (Vector[DO]) ⇒ Vector[DO]): DiscreteVectorField[D, DO]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def pointsWithValues: Iterator[(Point[D], Vector[DO])]

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

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

def toString(): String

def values: Iterator[Vector[DO]]

def valuesWithIds: Iterator[(Vector[DO], PointId)]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from DiscreteField[D, Vector[DO]]

Inherited from PartialFunction[PointId, Vector[DO]]

Inherited from (PointId) ⇒ Vector[DO]

Inherited from AnyRef

Inherited from Any

Ungrouped