Packages

case class GeneratorTF[State](nodeCoeffSeq: NodeCoeffSeq[State, Double], varWeight: Double, initState: State, finalState: State)(implicit sd: StateDistribution[State, FiniteDistribution]) extends Product with Serializable

Linear Supertypes
Serializable, Product, Equals, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GeneratorTF
  2. Serializable
  3. Product
  4. Equals
  5. AnyRef
  6. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new GeneratorTF(nodeCoeffSeq: NodeCoeffSeq[State, Double], varWeight: Double, initState: State, finalState: State)(implicit sd: StateDistribution[State, FiniteDistribution])

Value Members

  1. lazy val baseData: TFData
  2. def elemFinalVarList[Dom <: HList](vl: RandomVarList[Dom]): Set[ElemList[Dom]]
  3. lazy val elemFinalVars: Map[RandomVar[_], Set[Elem[_]]]
  4. def elemInitVarList[Dom <: HList](vl: RandomVarList[Dom]): Set[ElemList[Dom]]
  5. lazy val elemInitVars: Map[RandomVar[_], Set[Elem[_]]]
  6. val eqnTask: Task[Set[Equation]]
  7. lazy val equations: Set[Equation]
  8. def eventSupport[X, Y](ev: Event[X, Y]): Set[Elem[_]]
  9. def finalElemIndices[Dom <: HList, Y](rvF: RandomVarFamily[Dom, Y]): Set[Dom]
  10. def finalElemValOpt[Y](element: Y, rv: RandomVar[Y]): Option[FinalVal[Y]]
  11. lazy val finalElemValues: Map[VarVal[_], Double]
  12. def finalListProb[Dom <: HList](rvl: RandomVarList[Dom]): Set[(Dom, Expression)]
  13. def finalProbSet[Dom <: HList, Y](rvF: RandomVarFamily[Dom, Y]): Map[HList, Set[FinalVal[Any]]]
  14. lazy val finalProbTotals: Set[Expression]
  15. lazy val finalProbVars: Map[RandomVar[Any], Set[Expression]]
  16. def finalProbs[Y](rv: RandomVar[Y]): Set[(Y, FinalVal[_])]
  17. val finalState: State
  18. lazy val finalVars: Set[Variable[_]]
  19. lazy val initElemValues: Map[VarVal[_], Double]
  20. def initProbs[Y](rv: RandomVar[Y]): Set[(Y, InitialVal[_])]
  21. val initState: State
  22. lazy val initVars: Set[Variable[_]]
  23. val nodeCoeffSeq: NodeCoeffSeq[State, Double]
  24. def nodeCoeffSeqEquations(ncs: NodeCoeffSeq[State, Double]): (Set[Equation], TFData)
  25. def nodeCoeffSeqEquationsTask(ncs: NodeCoeffSeq[State, Double]): Task[(Set[Equation], TFData)]
  26. def nodeCoeffsEquationTerms[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y], x: Dom): (Set[EquationNode], TFData)
  27. def nodeCoeffsEquationTermsTask[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y], x: Dom): Task[(Set[EquationNode], TFData)]
  28. def nodeCoeffsEquations[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y]): (Set[Equation], TFData)
  29. def nodeCoeffsEquationsTask[Dom <: HList, Y](nodeCoeffs: NodeCoeffs[State, Double, Dom, Y]): Task[(Set[Equation], TFData)]
  30. def nodeEquationTerms[Y](node: GeneratorNode[Y]): (Set[EquationNode], TFData)
  31. def nodeEquationTermsTask[Y](node: GeneratorNode[Y]): Task[(Set[EquationNode], TFData)]
  32. val nodeMap: Map[GeneratorNode[_], (Set[EquationNode], TFData)]
  33. def pairEventSupport[X1, X2, Y](ev: PairEvent[X1, X2, Y]): Set[(Elem[_], Elem[_])]
  34. def productElementNames: Iterator[String]
    Definition Classes
    Product
  35. lazy val recData: TFData
  36. val recTask: Task[(Set[Equation], TFData)]
  37. lazy val recurrenceEquations: Set[Equation]
  38. lazy val tfData: TFData
  39. val varWeight: Double