for (Nodes::iterator it = _nodes.begin(); it != _nodes.end(); ++it)
{
+ DBG << "Looking at node " << it->first << " order " << it->second.order << ":" << it->second.item << endl;
if (it->second.order == 0)
{
DBG << "InstallOrder::computeNextSet found " << it->second.item << endl;
_topsorted.clear();
_numrun++;
- DBG << "run #" << _numrun << endl;
+ DBG << "startrdfs run #" << _numrun << endl;
// initialize all nodes
for (PoolItemSet::iterator it = _toinstall.begin(); it != _toinstall.end(); ++it)
&& (!provider.status().staysInstalled()) // only visit if provider is not already installed
&& (toinstall.find(provider) != toinstall.end() // only look at resolvables
|| installed.find(provider) != installed.end())) { // we are currently considering anyways
+ DBG << "tovisit " << provider << endl;
tovisit.insert (provider);
}
typedef list<Capability> CapList;
CapList requires;
- _DBG ("RC_SPEW") << "InstallOrder::rdfsvisit, visiting " << item << endl;
+ DBG << "InstallOrder::rdfsvisit, visiting " << item << endl;
NodeInfo& nodeinfo = _nodes[item];
}
}
}
+ DBG << "_topsorted.push_back(" << item << ")" << endl;
_topsorted.push_back(item);
_nodes[item].endtime = _rdfstime;
_rdfstime++;