case class TermGenParams(appW: Double = 0.1, unAppW: Double = 0.1, argAppW: Double = 0.1, lmW: Double = 0.1, piW: Double = 0.1, piTermW: Double = 0, termsByTypW: Double = 0.05, typFromFamilyW: Double = 0.05, sigmaW: Double = 0.05, recDefW: Double = 0, inducDefW: Double = 0, typAsCodW: Double = 0.05, targetInducW: Double = 0, varWeight: Double = 0.3, goalWeight: Double = 0.7, typVsFamily: Double = 0.5, negTargetW: Double = 0, solverW: Double = 0, contraW: Double = 0, solver: TypSolver = TypSolver.coreSolver) extends TermNodeCoeffSeq[TermState] with Product with Serializable
Instance Constructors
- new TermGenParams(appW: Double = 0.1, unAppW: Double = 0.1, argAppW: Double = 0.1, lmW: Double = 0.1, piW: Double = 0.1, piTermW: Double = 0, termsByTypW: Double = 0.05, typFromFamilyW: Double = 0.05, sigmaW: Double = 0.05, recDefW: Double = 0, inducDefW: Double = 0, typAsCodW: Double = 0.05, targetInducW: Double = 0, varWeight: Double = 0.3, goalWeight: Double = 0.7, typVsFamily: Double = 0.5, negTargetW: Double = 0, solverW: Double = 0, contraW: Double = 0, solver: TypSolver = TypSolver.coreSolver)
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- def +(other: String): String
- def ->[B](y: B): (TermGenParams, B)
- final def ==(arg0: Any): Boolean
- val Gen: TermGeneratorNodes[TermState]
- val appW: Double
- val argAppW: Double
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def coeffVal(cf: Coeff[_]): Option[Double]
- val contraW: Double
- def ensuring(cond: (TermGenParams) => Boolean, msg: => Any): TermGenParams
- def ensuring(cond: (TermGenParams) => Boolean): TermGenParams
- def ensuring(cond: Boolean, msg: => Any): TermGenParams
- def ensuring(cond: Boolean): TermGenParams
- final def eq(arg0: AnyRef): Boolean
- def evolvedStateTask(initState: TermState, epsilon: Double, limit: FiniteDuration = 3.minutes): Task[EvolvedState]
- def findProof(initState: TermState, typ: Typ[Term], epsilon: Double, limit: FiniteDuration = 3.minutes): Task[FiniteDistribution[Term]]
- def formatted(fmtstr: String): String
- lazy val funcForCodNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], Term]
- lazy val funcNodes: NodeCoeffs[TermState, Double, HNil, ExstFunc]
- lazy val funcWithDomNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], ExstFunc]
- final def getClass(): Class[_ <: AnyRef]
- lazy val goalNodes: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- val goalWeight: Double
- val inducDefW: Double
- lazy val inducDomainNodes: NodeCoeffs[TermState, Double, ::[ExstInducDefn, HNil], Term]
- lazy val inducNodes: NodeCoeffs[TermState, Double, HNil, ExstInducDefn]
- final def isInstanceOf[T0]: Boolean
- lazy val isleDomainsNode: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- val lmW: Double
- lazy val monixEqFD: MonixFiniteDistributionEq[TermState]
- lazy val monixFD: MonixFiniteDistribution[TermState]
- def monixTangFD(baseState: TermState): MonixTangentFiniteDistribution[TermState]
- final def ne(arg0: AnyRef): Boolean
- val negTargetW: Double
- def nextStateTask(initState: TermState, epsilon: Double, limit: FiniteDuration = 3.minutes): Task[TermState]
- def nextTangStateTask(baseState: TermState, tangState: TermState, epsilon: Double, limit: FiniteDuration = 3.minutes): Task[TermState]
- lazy val nodeCoeffSeq: NodeCoeffSeq[TermState, Double]
- final def notify(): Unit
- final def notifyAll(): Unit
- val piTermW: Double
- val piW: Double
- def productElementNames: Iterator[String]
- val recDefW: Double
- val sigmaW: Double
- val solver: TypSolver
- val solverW: Double
- final def synchronized[T0](arg0: => T0): T0
- lazy val targTypNodes: NodeCoeffs[TermState, Double, HNil, Term]
- val targetInducW: Double
- val termInit: Double
- lazy val termNodes: NodeCoeffs[TermState, Double, HNil, Term]
- lazy val termsByTypNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], Term]
- val termsByTypW: Double
- val toJson: Value
- val typAsCodW: Double
- lazy val typFamilyNodes: NodeCoeffs[TermState, Double, HNil, ExstFunc]
- val typFromFamilyW: Double
- val typInit: Double
- lazy val typNodes: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- lazy val typOrFmlyNodes: NodeCoeffs[TermState, Double, HNil, Term]
- val typVsFamily: Double
- val unAppW: Double
- val varWeight: Double
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
Deprecated Value Members
- def finalize(): Unit
- def →[B](y: B): (TermGenParams, B)
Inherited from Product
Value Members
- def productElementNames: Iterator[String]
Value Members
- lazy val funcForCodNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], Term]
- lazy val funcNodes: NodeCoeffs[TermState, Double, HNil, ExstFunc]
- lazy val funcWithDomNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], ExstFunc]
- lazy val goalNodes: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- lazy val inducDomainNodes: NodeCoeffs[TermState, Double, ::[ExstInducDefn, HNil], Term]
- lazy val inducNodes: NodeCoeffs[TermState, Double, HNil, ExstInducDefn]
- lazy val isleDomainsNode: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- lazy val nodeCoeffSeq: NodeCoeffSeq[TermState, Double]
- lazy val targTypNodes: NodeCoeffs[TermState, Double, HNil, Term]
- val termInit: Double
- lazy val termNodes: NodeCoeffs[TermState, Double, HNil, Term]
- lazy val termsByTypNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], Term]
- lazy val typFamilyNodes: NodeCoeffs[TermState, Double, HNil, ExstFunc]
- val typInit: Double
- lazy val typNodes: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- lazy val typOrFmlyNodes: NodeCoeffs[TermState, Double, HNil, Term]
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
Inherited by implicit conversion any2stringadd fromTermGenParams to any2stringadd[TermGenParams]
Value Members
- def +(other: String): String
Inherited by implicit conversion StringFormat fromTermGenParams to StringFormat[TermGenParams]
Value Members
- def formatted(fmtstr: String): String
Ungrouped
- final def !=(arg0: Any): Boolean
- final def ##: Int
- def +(other: String): String
- def ->[B](y: B): (TermGenParams, B)
- final def ==(arg0: Any): Boolean
- val Gen: TermGeneratorNodes[TermState]
- val appW: Double
- val argAppW: Double
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def coeffVal(cf: Coeff[_]): Option[Double]
- val contraW: Double
- def ensuring(cond: (TermGenParams) => Boolean, msg: => Any): TermGenParams
- def ensuring(cond: (TermGenParams) => Boolean): TermGenParams
- def ensuring(cond: Boolean, msg: => Any): TermGenParams
- def ensuring(cond: Boolean): TermGenParams
- final def eq(arg0: AnyRef): Boolean
- def evolvedStateTask(initState: TermState, epsilon: Double, limit: FiniteDuration = 3.minutes): Task[EvolvedState]
- def findProof(initState: TermState, typ: Typ[Term], epsilon: Double, limit: FiniteDuration = 3.minutes): Task[FiniteDistribution[Term]]
- def formatted(fmtstr: String): String
- lazy val funcForCodNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], Term]
- lazy val funcNodes: NodeCoeffs[TermState, Double, HNil, ExstFunc]
- lazy val funcWithDomNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], ExstFunc]
- final def getClass(): Class[_ <: AnyRef]
- lazy val goalNodes: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- val goalWeight: Double
- val inducDefW: Double
- lazy val inducDomainNodes: NodeCoeffs[TermState, Double, ::[ExstInducDefn, HNil], Term]
- lazy val inducNodes: NodeCoeffs[TermState, Double, HNil, ExstInducDefn]
- final def isInstanceOf[T0]: Boolean
- lazy val isleDomainsNode: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- val lmW: Double
- lazy val monixEqFD: MonixFiniteDistributionEq[TermState]
- lazy val monixFD: MonixFiniteDistribution[TermState]
- def monixTangFD(baseState: TermState): MonixTangentFiniteDistribution[TermState]
- final def ne(arg0: AnyRef): Boolean
- val negTargetW: Double
- def nextStateTask(initState: TermState, epsilon: Double, limit: FiniteDuration = 3.minutes): Task[TermState]
- def nextTangStateTask(baseState: TermState, tangState: TermState, epsilon: Double, limit: FiniteDuration = 3.minutes): Task[TermState]
- lazy val nodeCoeffSeq: NodeCoeffSeq[TermState, Double]
- final def notify(): Unit
- final def notifyAll(): Unit
- val piTermW: Double
- val piW: Double
- def productElementNames: Iterator[String]
- val recDefW: Double
- val sigmaW: Double
- val solver: TypSolver
- val solverW: Double
- final def synchronized[T0](arg0: => T0): T0
- lazy val targTypNodes: NodeCoeffs[TermState, Double, HNil, Term]
- val targetInducW: Double
- val termInit: Double
- lazy val termNodes: NodeCoeffs[TermState, Double, HNil, Term]
- lazy val termsByTypNodes: NodeCoeffs[TermState, Double, ::[Typ[Term], HNil], Term]
- val termsByTypW: Double
- val toJson: Value
- val typAsCodW: Double
- lazy val typFamilyNodes: NodeCoeffs[TermState, Double, HNil, ExstFunc]
- val typFromFamilyW: Double
- val typInit: Double
- lazy val typNodes: NodeCoeffs[TermState, Double, HNil, Typ[Term]]
- lazy val typOrFmlyNodes: NodeCoeffs[TermState, Double, HNil, Term]
- val typVsFamily: Double
- val unAppW: 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): (TermGenParams, B)