class ConstantStepGroup extends Group[ConstantStep]
- Source
- ConstantStep.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ConstantStepGroup
- Group
- AdditiveGroup
- Monoid
- AdditiveMonoid
- Semigroup
- AdditiveSemigroup
- Group
- Monoid
- Semigroup
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
additive: Group[ConstantStep]
- Definition Classes
- Group → AdditiveGroup → Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
assertNotZero(v: ConstantStep): Unit
- Definition Classes
- Monoid
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
combine(l: ConstantStep, r: ConstantStep): ConstantStep
- Definition Classes
- Semigroup → Semigroup
-
def
combineAll(t: TraversableOnce[ConstantStep]): ConstantStep
- Definition Classes
- Monoid → Monoid
-
def
combineAllOption(iter: TraversableOnce[ConstantStep]): Option[ConstantStep]
- Definition Classes
- Semigroup → Semigroup
-
def
combineN(a: ConstantStep, n: Int): ConstantStep
- Definition Classes
- Group → Monoid → Semigroup
-
def
empty: ConstantStep
- Definition Classes
- Monoid → Monoid
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
inverse(v: ConstantStep): ConstantStep
- Definition Classes
- Group → Group
-
def
isEmpty(a: ConstantStep)(implicit ev: Eq[ConstantStep]): Boolean
- Definition Classes
- Monoid
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNonZero(cs: ConstantStep): Boolean
- Definition Classes
- ConstantStepGroup → Monoid
-
def
isZero(a: ConstantStep)(implicit ev: Eq[ConstantStep]): Boolean
- Definition Classes
- AdditiveMonoid
-
def
minus(x: ConstantStep, y: ConstantStep): ConstantStep
- Definition Classes
- AdditiveGroup
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
negate(v: ConstantStep): ConstantStep
- Definition Classes
- ConstantStepGroup → AdditiveGroup
-
def
nonZeroOption(v: ConstantStep): Option[ConstantStep]
- Definition Classes
- Monoid
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
plus(l: ConstantStep, r: ConstantStep): ConstantStep
- Definition Classes
- ConstantStepGroup → AdditiveSemigroup
-
def
positiveSumN(a: ConstantStep, n: Int): ConstantStep
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
-
def
remove(l: ConstantStep, r: ConstantStep): ConstantStep
- Definition Classes
- Group → Group
-
def
repeatedCombineN(a: ConstantStep, n: Int): ConstantStep
- Attributes
- protected[this]
- Definition Classes
- Semigroup
-
def
reward(v: ConstantStep, reward: Double, time: Time): ConstantStep
This assigns the reward at the current time, which forces the timestamp forward.
This assigns the reward at the current time, which forces the timestamp forward.
If you didn't bump the time you could do this:
modern + (reward * (alpha / (1.0 - alpha)))
And force the alpha to be less than one.
-
def
sum(vs: TraversableOnce[ConstantStep]): ConstantStep
- Definition Classes
- Monoid → AdditiveMonoid
-
def
sumN(a: ConstantStep, n: Int): ConstantStep
- Definition Classes
- AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
-
def
sumOption(iter: TraversableOnce[ConstantStep]): Option[ConstantStep]
- Definition Classes
- Semigroup
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
trySum(as: TraversableOnce[ConstantStep]): Option[ConstantStep]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
-
def
valueAsOf(v: ConstantStep, time: Time): Double
Returns the value if the timestamp is less than the time of the supplied ConstantStep instance.
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
val
zero: ConstantStep
- Definition Classes
- ConstantStepGroup → AdditiveMonoid
edit this text on github
ScalaRL
This is the API documentation for the ScalaRL functional reinforcement learning library.
Further documentation for ScalaRL can be found at the documentation site.
Check out the ScalaRL package list for all the goods.