Interval discrete decision node. More...
Public Member Functions | |
IntervalDFNode * | clone () const |
Clone this IntervalDFNode object. | |
IntervalDFNode * | createTemporalClone () |
Construct a temporal clone of this IntervalDFNode object. | |
double | getQuantile (double probability) const |
Return the quantile corresponding to the specified probability argument of the inverse cumulative distribution function. | |
Index | getStateIndex (double value) const |
Return the index of the state (interval) matching the specified value. | |
double | getStateValue (size_t state) const |
Return the value associated with state. | |
IntervalDFNode (DiscreteFunctionNode *node) | |
Construct a new IntervalDFNode object corresponding to the given DiscreteFunctionNode object node . | |
IntervalDFNode (NetworkModel *nm) | |
Create a new IntervalDFNode in the given NetworkModel. | |
void | setStateValue (size_t state, double value) |
Set the value associated with state. |
Interval discrete decision node.
Each state of an IntervalDFNode represents an interval.
HAPI::IntervalDFNode::IntervalDFNode | ( | DiscreteFunctionNode * | node ) |
Construct a new IntervalDFNode object corresponding to the given DiscreteFunctionNode object node
.
The new object will be identical to node
(that is, same parents, same table, etc.) except for its type.
As a side-effect, the object node
is deleted. And if node
is an output node, then all output clone objects associated with the node are also deleted.
IntervalDFNode* HAPI::IntervalDFNode::clone | ( | ) | const [virtual] |
Clone this IntervalDFNode object.
Implements HAPI::Node.
IntervalDFNode* HAPI::IntervalDFNode::createTemporalClone | ( | ) | [virtual] |
Construct a temporal clone of this IntervalDFNode object.
Implements HAPI::Node.
Index HAPI::IntervalDFNode::getStateIndex | ( | double | value ) | const |
Return the index of the state (interval) matching the specified value.
If there is no interval containing the specified value, -1 is returned.
value | an interval containing this value will be searched for |