int start2 = (*j)->getStart()->getIndex();
int end2 = (*j)->getEnd()->getIndex();
int oppIndex = (*j)->getIndex();
- cerr << "Opposite of " << (*i)->getIndex() << " (" << start1 << "," << end1 << ") "
- << "happens to be " << oppIndex << " (" << start2 << "," << end2 << ") " << endl;
+// cerr << "Opposite of " << (*i)->getIndex() << " (" << start1 << "," << end1 << ") "
+// << "happens to be " << oppIndex << " (" << start2 << "," << end2 << ") " << endl;
break;
}
j++;
return segments[idx-1]->getAddress();
else
{
- cerr << "Alert: trying to find invalid segment " << idx << endl;
+ //cerr << "Alert: trying to find invalid segment " << idx << endl;
return 0;
}
}
return dynamics;
} else {
FGRunwayPreference rwyPrefs;
- cerr << "Trying to load dynamics for " << _id << endl;
+ //cerr << "Trying to load dynamics for " << _id << endl;
dynamics = new FGAirportDynamics(_latitude, _longitude, _elevation, _id);
SGPath parkpath( globals->get_fg_root() );
intVecIterator i = intentions.begin();
if ((*i) != pos) {
SG_LOG(SG_GENERAL, SG_ALERT, "Error in FGTrafficRecord::setPositionAndIntentions");
- cerr << "Pos : " << pos << " Curr " << *(intentions.begin()) << endl;
+ //cerr << "Pos : " << pos << " Curr " << *(intentions.begin()) << endl;
for (intVecIterator i = intentions.begin(); i != intentions.end() ; i++) {
- cerr << (*i) << " ";
+ //cerr << (*i) << " ";
}
- cerr << endl;
+ //cerr << endl;
}
intentions.erase(i);
} else {
if ((*i) > 0) {
if ((currentTargetNode == net->findSegment(*i)->getEnd()->getIndex()))
{
- cerr << "Current crosses at " << currentTargetNode <<endl;
+ //cerr << "Current crosses at " << currentTargetNode <<endl;
return currentTargetNode;
}
}
if ((*i) > 0) {
if (otherTargetNode == net->findSegment(*i)->getEnd()->getIndex())
{
- cerr << "Other crosses at " << currentTargetNode <<endl;
+ //cerr << "Other crosses at " << currentTargetNode <<endl;
return otherTargetNode;
}
}
if (opp->getIndex() ==
net->findSegment(*j)->getIndex())
{
- cerr << "Nodes " << net->findSegment(*i)->getIndex()
- << " and " << net->findSegment(*j)->getIndex()
- << " are opposites " << endl;
+// cerr << "Nodes " << net->findSegment(*i)->getIndex()
+// << " and " << net->findSegment(*j)->getIndex()
+// << " are opposites " << endl;
if (net->findSegment(*i)->getStart()->getIndex() == node) {
{
- cerr << "Found the node" << endl;
+ //cerr << "Found the node" << endl;
return true;
}
}