Packages

c

provingground.learning

IndexEquationMapSolver

class IndexEquationMapSolver extends ExpressionEquationIndexifier

Seek an approximately stable distribution for equations given in terms of indices, hence solving the equations (approximately). Here stable distribution is under the iteration to solve equations viewing them as fixed points. This is an implementation based on maps and keeping track of supports, which is not used as Vectors were more efficient.

Linear Supertypes
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexEquationMapSolver
  2. ExpressionEquationIndexifier
  3. AnyRef
  4. 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 IndexEquationMapSolver(initMap: Map[Expression, Double], equationVec: Vector[Equation], params: (Coeff[_]) => Option[Double], maxRatio: Double, resolution: Double, exponent: Double, decay: Double, maxTime: Option[Long], previousMap: Option[Map[Expression, Double]])

    initMap

    initial values of some expressions

    params

    values of coefficients in the equations

    maxRatio

    bound on ratio of stabilization

    resolution

    additive scale for stabilization and some auxiliary quantities

    exponent

    the next step is stabilized using geometric means, weighted by the exponent

    decay

    decay of the exponent, to allow steps to be damped progressively more

    maxTime

    time in milliseconds for timing out stabilizations

    previousMap

    an optional previous map to initialize

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toany2stringadd[IndexEquationMapSolver] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (IndexEquationMapSolver, B)
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toArrowAssoc[IndexEquationMapSolver] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  8. lazy val constantEquations: Set[Int]
  9. lazy val constantMap: Map[Int, Double]
  10. def ensuring(cond: (IndexEquationMapSolver) => Boolean, msg: => Any): IndexEquationMapSolver
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toEnsuring[IndexEquationMapSolver] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: (IndexEquationMapSolver) => Boolean): IndexEquationMapSolver
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toEnsuring[IndexEquationMapSolver] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean, msg: => Any): IndexEquationMapSolver
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toEnsuring[IndexEquationMapSolver] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean): IndexEquationMapSolver
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toEnsuring[IndexEquationMapSolver] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  16. def equationGradients(v: ParSeq[Double]): ParVector[ParVector[Double]]
  17. val equationVec: Vector[Equation]
  18. lazy val finalDistMap: Map[Expression, Double]
  19. lazy val finalStableMap: Map[Int, Double]
  20. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toStringFormat[IndexEquationMapSolver] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  21. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  22. def getProd(exp: Expression): ProductIndexExpression
  23. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  24. lazy val indexMap: Map[Expression, Int]
  25. lazy val initPar: ParMap[Expression, Double]
  26. lazy val initTermIndices: Vector[Int]
  27. lazy val initTypIndices: Vector[Int]
  28. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  29. def mapToIndexMap[V](m: Map[Expression, V]): Map[Int, V]
  30. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. def nextMap(m: Map[Int, Double], support: Set[Int], exponent: Double): Map[Int, Double]

    the next map, assuming support is stable and is the support except for terms that stay constant

    the next map, assuming support is stable and is the support except for terms that stay constant

    m

    the present map

    support

    the indices to update

    exponent

    exponent for geometric mean

    returns

    a stable map

  32. def nextMapSupport(m: Map[Int, Double], support: Set[Int]): (Map[Int, Double], Set[Int], Boolean)

    The next step towards a stable map with given equations

    The next step towards a stable map with given equations

    m

    the map so far

    support

    the set of indices where we should recompute

    returns

    triple of the next map, next support and whether stable

  33. def nextTraceSet(current: Set[Set[Int]], relativeTo: Set[Int]): Set[Set[Int]]
  34. def nextTraceVector(current: Vector[Vector[Int]]): Vector[Vector[Int]]
  35. def normalizedMapBounded(v: Map[Int, Double], w: Map[Int, Double]): Boolean
  36. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  37. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  38. val numVars: Int
  39. def orthonormalGradients(v: ParSeq[Double], cutoff: Double = 0.0): ParVector[ParVector[Double]]
  40. def proofData(typ: Typ[Term]): Vector[(Int, Equation)]
  41. lazy val randomVarIndices: ParVector[Vector[Int]]
  42. def ratioBounded(v: Vector[Double], w: Vector[Double], bound: Double = maxRatio): Boolean
  43. final def recTraceSet(current: Set[Set[Int]], depth: Int, relativeTo: Set[Int], accum: Set[Set[Int]]): Set[Set[Int]]
    Definition Classes
    ExpressionEquationIndexifier
    Annotations
    @tailrec()
  44. def restrictMap(m: Map[Int, Double], indices: Vector[Int]): Vector[Double]
  45. lazy val rhsExprs: Vector[SumIndexExpression]
  46. lazy val rhsExprsPar: ParVector[SumIndexExpression]
  47. def rhsInvolves(js: Set[Int]): Set[Int]
  48. def simplify(exp: Expression): SumIndexExpression
  49. lazy val size: Int
  50. final def stableMap(initMap: Map[Int, Double], support: Set[Int], exponent: Double = 0.5, decay: Double, maxTime: Option[Long], steps: Long): Map[Int, Double]
    Annotations
    @tailrec()
  51. final def stableSupportMap(initMap: Map[Int, Double], initSupport: Set[Int], maxTime: Option[Long], steps: Long): (Map[Int, Double], Set[Int])
    Annotations
    @tailrec()
  52. lazy val startingMap: Map[Int, Double]
  53. lazy val startingSupport: Set[Int]
  54. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  55. lazy val termIndexVec: Vector[(Term, Int)]
  56. lazy val termIndices: Vector[Int]
  57. lazy val thmPfIndices: Map[Int, Vector[Int]]
  58. def toString(): String
    Definition Classes
    AnyRef → Any
  59. lazy val totalProbEquations: ParVector[ParVector[Double]]
  60. def traceIndices(j: Int, depth: Int): Vector[Int]
  61. def traceSet(elem: Expression, depth: Int, relativeTo: Set[Int]): Set[Set[Int]]
  62. lazy val typIndexVec: Vector[(Typ[Term], Int)]
  63. lazy val typIndices: Vector[Int]
  64. lazy val varVec: Vector[Expression]
  65. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  66. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  67. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def [B](y: B): (IndexEquationMapSolver, B)
    Implicit
    This member is added by an implicit conversion from IndexEquationMapSolver toArrowAssoc[IndexEquationMapSolver] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromIndexEquationMapSolver to any2stringadd[IndexEquationMapSolver]

Inherited by implicit conversion StringFormat fromIndexEquationMapSolver to StringFormat[IndexEquationMapSolver]

Inherited by implicit conversion Ensuring fromIndexEquationMapSolver to Ensuring[IndexEquationMapSolver]

Inherited by implicit conversion ArrowAssoc fromIndexEquationMapSolver to ArrowAssoc[IndexEquationMapSolver]

Ungrouped