- Timestamp:
- Mar 17, 2005, 3:53:02 PM (20 years ago)
- Location:
- orxonox/trunk/src
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
orxonox/trunk/src/lib/math/curve.cc
r3588 r3593 19 19 local-Time implementation 20 20 NURBS 21 tList implementation 21 22 22 23 */ 24 25 #define DEBUG_SPECIAL_MODULE DEBUG_MODULE_MATH 23 26 24 27 #include "curve.h" -
orxonox/trunk/src/proto_class.cc
r3544 r3593 16 16 */ 17 17 18 #define DEBUG_SPECIAL_MODULE DEBUG_MODULE_WORLD_ENTITY 18 19 19 20 #include "proto_class.h" -
orxonox/trunk/src/track_manager.cc
r3591 r3593 140 140 } 141 141 142 /** 143 \brief prints out debug information about this TrackElement 144 */ 145 void TrackElement::debug(void) 146 { 147 PRINT(0)("--== TrackElement:%i ==--", this->ID); 148 if(this->getName()) 149 PRINT(0)("Name: %s::", this->getName()); 150 if(this->isFresh) 151 PRINT(0)(" -- has not jet eddited in any way --\n"); 152 PRINT(0)("\n TimeTable: startingTime=%f; endTime=%f; duration=%f; jumpTime=%f\n", this->startingTime, this->endTime, this->duration, this->jumpTime); 153 PRINT(0)(" consists of %d Points\n", this->nodeCount); 154 if (this->childCount == 0) 155 PRINT(0)(" has no child\n"); 156 else if (this->childCount == 1) 157 PRINT(0)(" has 1 child: =%d=\n", this->children[0]->ID); 158 else if (this->childCount > 1) 159 { 160 PRINT(0)(" has %d children: ", this->childCount); 161 for(int i = 0; i < this->childCount; i++) 162 PRINT(0)("=%d= ", this->children[i]->ID); 163 PRINT(0)("\n"); 164 } 165 166 if(this->isHotPoint) 167 PRINT(0)(" is a special Point:\n"); 168 if(this->isSavePoint) 169 PRINT(0)(" is a SavePoint\n"); 170 if(this->isFork) 171 { 172 PRINT(0)(" is A Fork with with %d children.\n", this->childCount); 173 } 174 if(this->isJoined) 175 PRINT(0)(" is Joined at the End\n"); 176 177 if(!this->backLoopCheck(this)) /* this should not happen */ 178 PRINT(2)(" THERE IS A BACKLOOP TO THIS ELEMENT\n"); 179 } 142 180 143 181 /** … … 218 256 } 219 257 } 220 PRINTF( 3)("PathDecision with nearest algorithm: %d\n", nodeNumber);258 PRINTF(4)("PathDecision with nearest algorithm: %d\n", nodeNumber); 221 259 return nodeNumber; 222 260 } 223 224 261 225 262 … … 785 822 { 786 823 TrackElement* tmpElem = this->findTrackElementByID(i); 787 PRINT(0)("--== TrackElement:%i ==--", tmpElem->ID); 788 if(tmpElem->getName()) 789 PRINT(0)("Name: %s::", tmpElem->getName()); 790 if(tmpElem->isFresh) 791 PRINT(0)(" -- has not jet eddited in any way --\n"); 792 PRINT(0)("\n TimeTable: startingTime=%f; endTime=%f; duration=%f; jumpTime=%f\n", tmpElem->startingTime, tmpElem->endTime, tmpElem->duration, tmpElem->jumpTime); 793 PRINT(0)(" consists of %d Points\n", tmpElem->nodeCount); 794 if (tmpElem->childCount == 0) 795 PRINT(0)(" has no child\n"); 796 else if (tmpElem->childCount == 1) 797 PRINT(0)(" has 1 child: =%d=\n", tmpElem->children[0]->ID); 798 else if (tmpElem->childCount > 1) 799 { 800 PRINT(0)(" has %d children: ", tmpElem->childCount); 801 for(int i = 0; i < tmpElem->childCount; i++) 802 PRINT(0)("=%d= ", tmpElem->children[i]->ID); 803 PRINT(0)("\n"); 804 } 805 806 if(tmpElem->isHotPoint) 807 PRINT(0)(" is a special Point:\n"); 808 if(tmpElem->isSavePoint) 809 PRINT(0)(" is a SavePoint\n"); 810 if(tmpElem->isFork) 811 { 812 PRINT(0)(" is A Fork with with %d children.\n", tmpElem->childCount); 813 } 814 if(tmpElem->isJoined) 815 PRINT(0)(" is Joined at the End\n"); 816 817 if(!tmpElem->backLoopCheck(tmpElem)) /* this should not happen */ 818 PRINT(2)(" THERE IS A BACKLOOP TO THIS ELEMENT\n"); 824 tmpElem->debug(); 819 825 } 820 826 } -
orxonox/trunk/src/track_manager.h
r3588 r3593 60 60 // runtime 61 61 TrackElement* history; //!< a pointer to the last TrackElement we were on. This is if you want to walk the path backwards again. 62 63 void debug(void); 62 64 63 65 // CONDITION FUNCTIONS and STUFF
Note: See TracChangeset
for help on using the changeset viewer.