Packages

c

com.scalarl.state

TickState

case class TickState[Obs, A, R, S[_]](state: State[Obs, A, R, S], tick: Int, limit: Int)(implicit evidence$1: Functor[S]) extends State[Obs, A, R, S] with Product with Serializable

State that ends after a certain number of interactions. This is useful for turning a non-episodic into an episodic task.

Source
TickState.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, State[Obs, A, R, S], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TickState
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. State
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TickState(state: State[Obs, A, R, S], tick: Int, limit: Int)(implicit arg0: Functor[S])

Type Members

  1. type This = State[Obs, A, R, S]
    Definition Classes
    State

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. def act(action: A): S[(R, This)]
    Definition Classes
    TickState → State
  5. def actions: Set[A]
    Definition Classes
    TickState → State
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  8. def dynamics: Map[A, S[(R, This)]]

    For every action you could take, returns a generator of the next set of rewards.

    For every action you could take, returns a generator of the next set of rewards. This is a real world, or a sample model. If we want the full distribution we're going to have to build out a better interface. Good enough for now.

    Definition Classes
    TickState → State
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def invalidMove: S[(R, This)]
    Definition Classes
    TickState → State
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def isTerminal: Boolean

    Returns a list of possible actions to take from this state.

    Returns a list of possible actions to take from this state. To specify the terminal state, return an empty set.

    Definition Classes
    TickState → State
  15. val limit: Int
  16. def mapK[N[_]](f: FunctionK[S, N])(implicit N: Functor[N]): State[Obs, A, R, N]
    Definition Classes
    TickState → State
  17. def mapObservation[P](f: (Obs) ⇒ P)(implicit S: Functor[S]): State[P, A, R, S]
    Definition Classes
    TickState → State
  18. def mapReward[T](f: (R) ⇒ T)(implicit S: Functor[S]): State[Obs, A, T, S]
    Definition Classes
    TickState → State
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. def observation: Obs
    Definition Classes
    TickState → State
  23. val state: State[Obs, A, R, S]
  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. val tick: Int
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from State[Obs, A, R, S]

Inherited from AnyRef

Inherited from Any

Ungrouped