case class GeneratorEquations[State](nodeCoeffSeq: NodeCoeffSeq[State, Double], varWeight: Double, initState: State, finalState: State)(implicit sd: StateDistribution[State, FiniteDistribution]) extends EvolvedEquations[State] with Product with Serializable
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- def +(other: String): String
- def ->[B](y: B): (GeneratorEquations[State], B)
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def elemFinalVarList[Dom <: HList](vl: RandomVarList[Dom]): Set[ElemList[Dom]]
- lazy val elemFinalVars: Map[RandomVar[_], Set[Elem[_]]]
- def elemInitVarList[Dom <: HList](vl: RandomVarList[Dom]): Set[ElemList[Dom]]
- lazy val elemInitVars: Map[RandomVar[_], Set[Elem[_]]]
- def ensuring(cond: (GeneratorEquations[State]) => Boolean, msg: => Any): GeneratorEquations[State]
- def ensuring(cond: (GeneratorEquations[State]) => Boolean): GeneratorEquations[State]
- def ensuring(cond: Boolean, msg: => Any): GeneratorEquations[State]
- def ensuring(cond: Boolean): GeneratorEquations[State]
- final def eq(arg0: AnyRef): Boolean
- lazy val equations: Set[Equation]
- lazy val eventEquations: Set[Equation]
- def eventTotal[X, Y](ev: Event[X, Y]): Expression
- def eventValue[X, Y](ev: Event[X, Y]): Double
- lazy val eventValues: Map[VarVal[_], Double]
- def finalElemIndices[Dom <: HList, Y](rvF: RandomVarFamily[Dom, Y]): Set[Dom]
- def finalElemValOpt[Y](element: Y, rv: RandomVar[Y]): Option[FinalVal[Y]]
- lazy val finalElemValues: Map[VarVal[_], Double]
- def finalListProb[Dom <: HList](rvl: RandomVarList[Dom]): Set[(Dom, Expression)]
- def finalProbSet[Dom <: HList, Y](rvF: RandomVarFamily[Dom, Y]): Map[HList, Set[FinalVal[Any]]]
- lazy val finalProbTotals: Set[Expression]
- lazy val finalProbVars: Map[RandomVar[Any], Set[Expression]]
- def finalProbs[Y](rv: RandomVar[Y]): Set[(Y, FinalVal[_])]
- val finalState: State
- lazy val finalVars: Set[Variable[_]]
- def formatted(fmtstr: String): String
- final def getClass(): Class[_ <: AnyRef]
- lazy val initElemValues: Map[VarVal[_], Double]
- def initProbs[Y](rv: RandomVar[Y]): Set[(Y, InitialVal[_])]
- val initState: State
- lazy val initVars: Set[Variable[_]]
- final def isInstanceOf[T0]: Boolean
- def mse(epsilon: Double): Expression
- final def ne(arg0: AnyRef): Boolean
- val nodeCoeffSeq: NodeCoeffSeq[State, Double]
- def nodeCoeffSeqEquations(ncs: NodeCoeffSeq[State, Double]): Set[Equation]
- def nodeCoeffsEquationTerms[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y], x: Dom): (Set[EquationNode], Set[Equation])
- def nodeCoeffsEquations[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y]): Set[Equation]
- def nodeEquationTerms[Y](node: GeneratorNode[Y]): (Set[EquationNode], Set[Equation])
- final def notify(): Unit
- final def notifyAll(): Unit
- lazy val pairEventEquations: Set[Equation]
- def pairEventTotal[X1, X2, Y](ev: PairEvent[X1, X2, Y]): Expression
- def pairEventValue[X1, X2, Y](ev: PairEvent[X1, X2, Y]): Double
- lazy val pairEventValues: Map[VarVal[_], Double]
- def productElementNames: Iterator[String]
- lazy val recurrenceEquations: Set[Equation]
- final def synchronized[T0](arg0: => T0): T0
- lazy val totalProbEquations: Set[Equation]
- def totalSquare(epsilon: Double): Expression
- lazy val varValues: Map[VarVal[_], Double]
- val varWeight: Double
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
Inherited from Product
Value Members
- def productElementNames: Iterator[String]
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
- final def getClass(): Class[_ <: AnyRef]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- final def synchronized[T0](arg0: => T0): T0
- 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
- def +(other: String): String
- def ->[B](y: B): (GeneratorEquations[State], B)
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def elemFinalVarList[Dom <: HList](vl: RandomVarList[Dom]): Set[ElemList[Dom]]
- lazy val elemFinalVars: Map[RandomVar[_], Set[Elem[_]]]
- def elemInitVarList[Dom <: HList](vl: RandomVarList[Dom]): Set[ElemList[Dom]]
- lazy val elemInitVars: Map[RandomVar[_], Set[Elem[_]]]
- def ensuring(cond: (GeneratorEquations[State]) => Boolean, msg: => Any): GeneratorEquations[State]
- def ensuring(cond: (GeneratorEquations[State]) => Boolean): GeneratorEquations[State]
- def ensuring(cond: Boolean, msg: => Any): GeneratorEquations[State]
- def ensuring(cond: Boolean): GeneratorEquations[State]
- final def eq(arg0: AnyRef): Boolean
- lazy val equations: Set[Equation]
- lazy val eventEquations: Set[Equation]
- def eventTotal[X, Y](ev: Event[X, Y]): Expression
- def eventValue[X, Y](ev: Event[X, Y]): Double
- lazy val eventValues: Map[VarVal[_], Double]
- def finalElemIndices[Dom <: HList, Y](rvF: RandomVarFamily[Dom, Y]): Set[Dom]
- def finalElemValOpt[Y](element: Y, rv: RandomVar[Y]): Option[FinalVal[Y]]
- lazy val finalElemValues: Map[VarVal[_], Double]
- def finalListProb[Dom <: HList](rvl: RandomVarList[Dom]): Set[(Dom, Expression)]
- def finalProbSet[Dom <: HList, Y](rvF: RandomVarFamily[Dom, Y]): Map[HList, Set[FinalVal[Any]]]
- lazy val finalProbTotals: Set[Expression]
- lazy val finalProbVars: Map[RandomVar[Any], Set[Expression]]
- def finalProbs[Y](rv: RandomVar[Y]): Set[(Y, FinalVal[_])]
- val finalState: State
- lazy val finalVars: Set[Variable[_]]
- def formatted(fmtstr: String): String
- final def getClass(): Class[_ <: AnyRef]
- lazy val initElemValues: Map[VarVal[_], Double]
- def initProbs[Y](rv: RandomVar[Y]): Set[(Y, InitialVal[_])]
- val initState: State
- lazy val initVars: Set[Variable[_]]
- final def isInstanceOf[T0]: Boolean
- def mse(epsilon: Double): Expression
- final def ne(arg0: AnyRef): Boolean
- val nodeCoeffSeq: NodeCoeffSeq[State, Double]
- def nodeCoeffSeqEquations(ncs: NodeCoeffSeq[State, Double]): Set[Equation]
- def nodeCoeffsEquationTerms[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y], x: Dom): (Set[EquationNode], Set[Equation])
- def nodeCoeffsEquations[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y]): Set[Equation]
- def nodeEquationTerms[Y](node: GeneratorNode[Y]): (Set[EquationNode], Set[Equation])
- final def notify(): Unit
- final def notifyAll(): Unit
- lazy val pairEventEquations: Set[Equation]
- def pairEventTotal[X1, X2, Y](ev: PairEvent[X1, X2, Y]): Expression
- def pairEventValue[X1, X2, Y](ev: PairEvent[X1, X2, Y]): Double
- lazy val pairEventValues: Map[VarVal[_], Double]
- def productElementNames: Iterator[String]
- lazy val recurrenceEquations: Set[Equation]
- final def synchronized[T0](arg0: => T0): T0
- lazy val totalProbEquations: Set[Equation]
- def totalSquare(epsilon: Double): Expression
- lazy val varValues: Map[VarVal[_], Double]
- val varWeight: Double
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- def finalize(): Unit
- def →[B](y: B): (GeneratorEquations[State], B)