object ParMapState extends Serializable
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- def add[Y](m1: ParMap[Y, Double], m2: ParMap[Y, Double]): ParMap[Y, Double]
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def coeffVal(tg: TermGenParams): (Coeff[_]) => Option[Double]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def fromTermState(ts: TermState): ParMapState
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- def makeMap[T](vec: ParVector[(T, Double)]): ParMap[T, Double]
- def mapMap[Y, Z](m: ParMap[Y, Double], f: (Y) => Z): ParMap[Z, Double]
- def mapMapOpt[Y, Z](m: ParMap[Y, Double], f: (Y) => Option[Z]): ParMap[Z, Double]
- final def ne(arg0: AnyRef): Boolean
- def normalize[Y](m: ParMap[Y, Double]): ParMap[Y, Double]
- final def notify(): Unit
- final def notifyAll(): Unit
- def parGenNodes(tg: TermGenParams): TermGeneratorNodes[ParMapState]
- def parNodeSeq(tg: TermGenParams): TermNodeCoeffSeq[ParMapState]
- def parUnion(a1: ParSet[EquationNode], a2: ParSet[EquationNode]): ParSet[EquationNode]
- def purge[Y](m: ParMap[Y, Double], cutoff: Double): ParMap[Y, Double]
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- case object ParBaseNodes extends TermGeneratorNodes[ParMapState] with Product with Serializable
- case object ParEnterIsle extends (Term, ParMapState) => ParMapState with Product with Serializable
Deprecated Value Members
- def finalize(): Unit
Inherited from AnyRef
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- 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(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- def finalize(): Unit
Inherited from Any
Value Members
- final def asInstanceOf[T0]: T0
- final def isInstanceOf[T0]: Boolean
Ungrouped
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- def add[Y](m1: ParMap[Y, Double], m2: ParMap[Y, Double]): ParMap[Y, Double]
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def coeffVal(tg: TermGenParams): (Coeff[_]) => Option[Double]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def fromTermState(ts: TermState): ParMapState
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- def makeMap[T](vec: ParVector[(T, Double)]): ParMap[T, Double]
- def mapMap[Y, Z](m: ParMap[Y, Double], f: (Y) => Z): ParMap[Z, Double]
- def mapMapOpt[Y, Z](m: ParMap[Y, Double], f: (Y) => Option[Z]): ParMap[Z, Double]
- final def ne(arg0: AnyRef): Boolean
- def normalize[Y](m: ParMap[Y, Double]): ParMap[Y, Double]
- final def notify(): Unit
- final def notifyAll(): Unit
- def parGenNodes(tg: TermGenParams): TermGeneratorNodes[ParMapState]
- def parNodeSeq(tg: TermGenParams): TermNodeCoeffSeq[ParMapState]
- def parUnion(a1: ParSet[EquationNode], a2: ParSet[EquationNode]): ParSet[EquationNode]
- def purge[Y](m: ParMap[Y, Double], cutoff: Double): ParMap[Y, Double]
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- case object ParBaseNodes extends TermGeneratorNodes[ParMapState] with Product with Serializable
- case object ParEnterIsle extends (Term, ParMapState) => ParMapState with Product with Serializable
- def finalize(): Unit