Packages

object Policy

Source
Policy.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Policy
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. def play[A, R, P <: Policy[A, R, P]](policy: P, state: State[A, R], penalty: R): Generator[(P, R, State[A, R])]

    Plays a single turn and returns a generator that returns the reward and the next state.

    Plays a single turn and returns a generator that returns the reward and the next state. If the chosen state's not allowed, returns the supplied penalty and sends the agent back to the initial state.

  16. def playMany[A, R, P <: Policy[A, R, P]](pairs: List[(P, State[A, R])], penalty: R)(rewardSum: (List[R]) ⇒ R): Generator[(List[(P, State[A, R])], R)]

    Takes an initial set of policies and a state...

  17. def playManyN[A, R, P <: Policy[A, R, P]](pairs: List[(P, State[A, R])], penalty: R, nTimes: Int)(rewardSum: (List[R]) ⇒ R): Generator[(List[(P, State[A, R])], List[R])]

    Takes an initial set of policies and a state...

  18. def playN[A, R, P <: Policy[A, R, P]](policy: P, state: State[A, R], penalty: R, nTimes: Int): Generator[(P, Seq[R], State[A, R])]

    Returns the final policy, a sequence of the rewards received and the final state.

  19. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped