class
DecisionPolicyExact[T, U] extends DecisionPolicy[T, U]
Instance Constructors
-
new
DecisionPolicyExact(policy: Map[T, (U, Double)])
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toFcn(): (T) ⇒ Constant[U]
-
def
toString(): String
-
def
toUtility(): (T) ⇒ Constant[Double]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
An exact decision policy. This policy is exact because every possible value of the parent must have a defined policy. This makes it suitable for variable elimination algorithms or sampling algorithms if the range of the parent is small and enough samples are generated.