Packages

c

provingground.learning

WeightedBiPaths

case class WeightedBiPaths[A, C](gens: Map[A, Vector[(C, Vector[A])]], forwardGens: Map[A, Vector[(C, A)]], coeffWeights: (C) => Double, backWeight: Double) extends BackPaths[A] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, BackPaths[A], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WeightedBiPaths
  2. Serializable
  3. Product
  4. Equals
  5. BackPaths
  6. AnyRef
  7. 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 WeightedBiPaths(gens: Map[A, Vector[(C, Vector[A])]], forwardGens: Map[A, Vector[(C, A)]], coeffWeights: (C) => Double, backWeight: Double)

Value Members

  1. val backWeight: Double
  2. val coeffWeights: (C) => Double
  3. val forwardGens: Map[A, Vector[(C, A)]]
  4. val generators: Map[A, Set[Set[A]]]
    Definition Classes
    BackPaths
  5. val gens: Map[A, Vector[(C, Vector[A])]]
  6. val initialValues: Vector[A]
    Definition Classes
    BackPaths
  7. def productElementNames: Iterator[String]
    Definition Classes
    Product
  8. def randomNext(init: A): Option[A]
  9. def randomPathFromInit(init: A, length: Int): Vector[A]
  10. def randomPaths(initNumber: Int, length: Int): Vector[Vector[A]]
    Definition Classes
    BackPaths
  11. def randomPathsFromInit(init: A, length: Int): Set[Vector[A]]
    Definition Classes
    BackPaths
  12. val rnd: Random
    Definition Classes
    BackPaths
  13. def unifRandomPaths(number: Int, length: Int): Vector[Vector[A]]