* @return true if the future_values set is empty.
*/
bool Node::future_value_empty() {
- return ((future_index + 1) >= future_values.size());
+ return ((future_index + 1) >= ((int)future_values.size()));
}
/**
* @return The first element in future_values
*/
uint64_t Node::get_future_value() {
- ASSERT(future_index<future_values.size());
+ ASSERT(future_index<((int)future_values.size()));
return future_values[future_index].value;
}
modelclock_t Node::get_future_value_expiration() {
- ASSERT(future_index<future_values.size());
+ ASSERT(future_index<((int)future_values.size()));
return future_values[future_index].expiration;
}
bool Node::increment_read_from() {
DBG();
promises.clear();
- if ((read_from_index+1) < may_read_from.size()) {
+ if (read_from_index < may_read_from.size()) {
read_from_index++;
- return true;
+ return read_from_index < may_read_from.size();
}
return false;
}
bool Node::increment_future_value() {
DBG();
promises.clear();
- if ((future_index+1) < future_values.size()) {
+ if (future_index < ((int)future_values.size())) {
future_index++;
- return true;
+ return (future_index < ((int)future_values.size()));
}
return false;
}
{
/* Diverging from previous execution; clear out remainder of list */
unsigned int it=iter+numAhead;
+ for(unsigned int i=it;i<node_list.size();i++)
+ delete node_list[i];
node_list.resize(it);
}