may_read_from(),
read_from_index(0),
future_values(),
- future_index(0)
+ future_index(-1)
{
if (act)
act->set_node(this);
return (promises[i]==2);
}
-bool Node::increment_promises() {
+bool Node::increment_promise() {
for (unsigned int i=0;i<promises.size();i++) {
if (promises[i]==1) {
promises[i]=2;
- do {
+ while (i>0) {
i--;
if (promises[i]==2)
promises[i]=1;
- } while(i>0);
+ }
return true;
}
}
return false;
}
-bool Node::promises_empty() {
+bool Node::promise_empty() {
for (unsigned int i=0;i<promises.size();i++)
if (promises[i]==1)
return false;
for(unsigned int i=0;i<future_values.size();i++)
if (future_values[i]==value)
return false;
+
future_values.push_back(value);
return true;
}
* @return true if the future_values set is empty.
*/
-bool Node::futurevalues_empty() {
+bool Node::future_value_empty() {
return ((future_index+1)>=future_values.size());
}
* Checks whether the readsfrom set for this node is empty.
* @return true if the readsfrom set is empty.
*/
-bool Node::readsfrom_empty() {
+bool Node::read_from_empty() {
return ((read_from_index+1)>=may_read_from.size());
}
* @return Returns false if we have explored all values.
*/
-bool Node::increment_future_values() {
+bool Node::increment_future_value() {
future_index++;
return (future_index<future_values.size());
}