Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: orxonox.OLD/trunk/src/util/track/track_manager.cc @ 5115

Last change on this file since 5115 was 5115, checked in by bensch, 19 years ago

orxonox/trunk: reimplemented the list functions, as i did before in revision 5110.
This time, i looked out for the bugs, and i think i found one

@patrick: i know, that you do not want to code at the moment… :/ → see mail

File size: 35.7 KB
Line 
1/*
2   orxonox - the future of 3D-vertical-scrollers
3
4   Copyright (C) 2004 orx
5
6   This program is free software; you can redistribute it and/or modify
7   it under the terms of the GNU General Public License as published by
8   the Free Software Foundation; either version 2, or (at your option)
9   any later version.
10
11   ### File Specific:
12   main-programmer: Benjamin Grauer
13   co-programmer: ...
14*/
15
16#define DEBUG_SPECIAL_MODULE DEBUG_MODULE_TRACK_MANAGER
17
18#include "track_manager.h"
19
20#include "base_object.h"
21#include "p_node.h"
22#include "track_node.h"
23#include "stdincl.h"
24#include "list.h"
25#include "text_engine.h"
26#include "t_animation.h"
27#include "load_param.h"
28
29
30#include "tinyxml.h"
31#include "substring.h"
32
33#include <stdarg.h>
34
35using namespace std;
36
37/**
38 *  initializes a TrackElement (sets the default values)
39*/
40TrackElement::TrackElement()
41{
42  this->setClassID(CL_TRACK_ELEMENT, "TrackElement");
43
44  this->isFresh = true;
45  this->isHotPoint = false;
46  this->isSavePoint = false;
47  this->isFork = false;
48  this->isJoined = false;
49  this->mainJoin = false;
50  this->ID = -1;
51  this->startingTime = 0;
52  this->duration = TMAN_DEFAULT_DURATION;
53  this->endTime = 1;
54  this->jumpTime = 0;
55  this->width = TMAN_DEFAULT_WIDTH;
56  this->nodeCount = 0;
57  this->curve = NULL;
58  this->childCount = 0;
59  this->children = NULL;
60
61  this->history = NULL;
62
63  this->subject = NULL;
64  this->condFunc = &TrackElement::random;
65}
66
67/**
68  *  destroys all alocated memory)
69    @todo eventually when deleting a TrackElement you would not like to delete all its preceding TrackElements
70*/
71TrackElement::~TrackElement()
72{
73  // deleting the Curve
74  delete this->curve;
75
76  // deleting all the Children of this TrackNode.
77  if ((!this->isJoined &&this->childCount > 0)
78      || (this->isJoined && this->mainJoin)) // only if this is the MainJoin.
79    {
80      tIterator<TrackElement>* iterator = this->children->getIterator();
81      TrackElement* enumElem = iterator->firstElement();
82      while (enumElem)
83        {
84          delete enumElem;
85          enumElem = iterator->nextElement();
86        }
87      delete iterator;
88      delete this->children;
89    }
90}
91
92/**
93 *  Searches through all the TrackElements for trackID.
94 * @param trackID The ID to search for.
95 * @returns The TrackElement if Found, NULL otherwise.
96*/
97TrackElement* TrackElement::findByID(unsigned int trackID)
98{
99  // return if Found.
100  if (this->ID == trackID)
101    return this;
102  // search all children
103  if (this->childCount > 0)
104    {
105      tIterator<TrackElement>* iterator = this->children->getIterator();
106      TrackElement* enumElem = iterator->firstElement();
107      TrackElement* tmpElem;
108      while (enumElem)
109        {
110          if ((tmpElem = enumElem->findByID(trackID)))
111            return tmpElem;
112          enumElem = iterator->nextElement();
113        }
114      delete iterator;
115    }
116  // if not found
117  return NULL;
118}
119
120
121/**
122 *  Searches through all the TrackElements for a trackName
123 * @param trackName The name to search for.
124 * @returns The TrackElement if Found, NULL otherwise.
125*/
126TrackElement* TrackElement::findByName(const char* trackName)
127{
128  // return if Found.
129  if (this->getName() && !strcmp(this->getName(), trackName))
130    return this;
131  // search all children
132  if (this->childCount > 0)
133    {
134      tIterator<TrackElement>* iterator = this->children->getIterator();
135      TrackElement* enumElem = iterator->firstElement();
136      TrackElement* tmpElem;
137      while (enumElem)
138        {
139          if ((tmpElem = enumElem->findByName(trackName)))
140            return tmpElem;
141          enumElem = iterator->nextElement();
142        }
143      delete iterator;
144    }
145  // if not found
146  return NULL;
147}
148
149/**
150 *  checks if there are any BackLoops in the Track
151 * @returns true if NO loop was found, false Otherwise
152   You actually have to act on false!!
153*/
154bool TrackElement::backLoopCheck() const
155{
156  tList<const TrackElement>* trackList = new tList<const TrackElement>;
157
158  this->backLoopCheckAtomic(trackList);
159
160  delete trackList;
161  // only returns if everything worked out
162  return true;
163}
164
165/**
166 *  checks if there are any BackLoops in the Track.
167 * @param trackList A list of stored tracks, to search in.
168 * @returns true if NO loop was found, false Otherwise
169   You actually have to act on false!!
170*/
171bool TrackElement::backLoopCheckAtomic(tList<const TrackElement>* trackList) const
172{
173  if (trackList->inList(this))
174    return false;
175
176  trackList->add(this);
177
178  if (this->children)
179    {
180      tIterator<TrackElement>* iterator = this->children->getIterator();
181      TrackElement* enumElem = iterator->firstElement();
182      while (enumElem)
183        {
184          if (!enumElem->backLoopCheckAtomic(trackList))
185            return false;
186        }
187      delete iterator;
188    }
189  return true;
190}
191
192
193/**
194 * @param childCount which child to return
195 * @returns the n-the children (starting at 0).
196   Be aware, that when the trackElement has no Children, NULL will be returned
197*/
198TrackElement* TrackElement::getChild(int childCount) const
199{
200  // if the the trackElement has no children return NULL.
201  if (this->childCount == 0)
202    return NULL;
203  // we cannot return the childCount+m's Child, so we return the last.
204  if (childCount > this->childCount)
205    childCount = this->childCount;
206
207  tIterator<TrackElement>* iterator = this->children->getIterator();
208  TrackElement* enumElem = iterator->firstElement();
209  for (int i = 0; i < childCount; i++)
210    enumElem = iterator->nextElement();
211  delete iterator;
212  return enumElem;
213}
214
215/**
216 *  prints out debug information about this TrackElement
217*/
218void TrackElement::debug() const
219{
220  PRINT(0)("--== TrackElement:%i ==--", this->ID);
221  if(this->getName())
222    PRINT(0)("--++Name: %s++--", this->getName());
223  if(this->isFresh)
224    PRINT(0)("  -- has not jet eddited in any way --\n");
225  PRINT(0)("\n   TimeTable: startingTime=%f; endTime=%f; duration=%f; jumpTime=%f\n", this->startingTime, this->endTime, this->duration, this->jumpTime);
226  PRINT(0)("   consists of %d Points\n", this->nodeCount);
227  if (this->childCount == 0)
228    PRINT(0)("   has no child\n");
229  else if (this->childCount == 1)
230    PRINT(0)("   has 1 child: =%d=\n", this->getChild(0)->ID);
231  else if (this->childCount > 1)
232    {
233      PRINT(0)("   has %d children: ", this->childCount);
234      //TrackElement* enumElem = this->children->enumerate();
235      tIterator<TrackElement>* iterator = this->children->getIterator();
236      TrackElement* enumElem = iterator->firstElement();
237      while (enumElem)
238        {
239          PRINT(0)("=%d= ", enumElem->ID);
240          enumElem = iterator->nextElement();
241        }
242      delete iterator;
243      PRINT(0)("\n");
244    }
245
246  if(this->isHotPoint)
247    PRINT(0)("   is a special Point:\n");
248  if(this->isSavePoint)
249    PRINT(0)("    is a SavePoint\n");
250  if(this->isFork)
251    {
252      PRINT(0)("    is A Fork with with %d children.\n", this->childCount);
253    }
254  if(this->isJoined)
255    PRINT(0)("   is Joined at the End\n");
256
257  if(!this->backLoopCheck()) /* this should not happen */
258    PRINT(2)(" THERE IS A BACKLOOP TO THIS ELEMENT\n");
259}
260
261/**
262 *  CONDITION that chooses the first child for the decision (static)
263 * @param nothing Nothing in this function
264 * @returns the chosen child
265*/
266int TrackElement::lowest(const void* nothing) const
267{
268  return 0;
269}
270
271/**
272 *  CONDITION that chooses the last child for the decision (static)
273 * @param nothing Nothing in this function
274 * @returns the chosen child
275*/
276int TrackElement::highest(const void* nothing) const
277{
278  return this->childCount-1;
279}
280
281/**
282 *  CONDITION that chooses a random child for the decision (static)
283 * @param nothing Nothing in this function
284 * @returns the chosen child
285*/
286int TrackElement::random(const void* nothing) const
287{
288  int i = (int)floor ((float)rand()/(float)RAND_MAX * (float)this->childCount);
289  if (i >= this->childCount)
290    return this->childCount-1;
291  else
292    return i;
293}
294
295/**
296 *  CONDITION that chooses child 0, if the node(probably Player)
297   is left of its parent (z<0)) and 1/right otherwise.
298 * @param node The node to act upon.
299 * @returns the chosen child
300*/
301int TrackElement::leftRight(const void* node) const
302{
303  PNode* tmpNode = (PNode*)node;
304
305  if (tmpNode->getRelCoor().z < 0)
306    return 0;
307  else
308    return 1;
309}
310
311
312/**
313 *  CONDITION that chooses the child, that has the nearest distance to the node (probably player).
314 * @param node The node to act upon.
315 * @returns the chosen child
316
317   This is rather dangerous, because one must carefully set the points on the curve.
318   The best Way is to set the nodes as wide away of each other as possible,
319   but take into consideration, that if the nodes are to far from a center node, the center will be chosen.
320   (play with this!!).
321*/
322int TrackElement::nearest(const void* node) const
323{
324  PNode* tmpNode = (PNode*)node;
325
326  Vector nodeRelCoord = tmpNode->getRelCoor();
327  float minDist = 100000000;
328  int childNumber = 0;
329  int i = 0;
330
331  //TrackElement* enumElem = this->children->enumerate();
332  tIterator<TrackElement>* iterator = this->children->getIterator();
333  TrackElement* enumElem = iterator->firstElement();
334  while (enumElem)
335    {
336      float dist = (nodeRelCoord - enumElem->curve->getNode(4)).len();
337      if (dist < minDist)
338        {
339          minDist = dist;
340          childNumber = i;
341        }
342      i++;
343      enumElem = iterator->nextElement();
344    }
345  delete iterator;
346
347  PRINTF(4)("PathDecision with nearest algorithm: %d\n", childNumber);
348  return childNumber;
349}
350
351
352////////////////////////
353///// TRACKMANAGER /////
354////////////////////////
355/**
356 *  standard constructor
357
358*/
359TrackManager::TrackManager()
360{
361  this->setClassID(CL_TRACK_MANAGER, "TrackManager");
362  this->setName("TrackManager");
363
364  TrackManager::singletonRef = this; // do this because otherwise the TrackNode cannot get The instance of the TrackManager
365
366  PRINTF(3)("Initializing the TrackManager\n");
367  // setting up the First TrackElement
368  this->firstTrackElem = new TrackElement();
369  this->firstTrackElem->ID = 1;
370  this->firstTrackElem->setName("root");
371
372  this->currentTrackElem = firstTrackElem;
373
374  this->curveType = CURVE_BEZIER;
375  this->localTime = 0;
376  this->maxTime = 0;
377  this->trackElemCount = 1;
378
379  this->trackNode = new TrackNode();
380  this->setBindSlave(this->trackNode);
381  // initializing the Text
382  this->trackText = TextEngine::getInstance()->createText("fonts/earth.ttf", 30, TEXT_DYNAMIC, 0, 255, 0);
383  this->trackText->setAlignment(E2D_ALIGN_SCREEN_CENTER);
384  // initializing the Animation for the Text.
385  this->textAnimation = new tAnimation<Text>(this->trackText, &Text::setBlending);
386  this->textAnimation->addKeyFrame(1.0, 3.0, ANIM_NEG_EXP);
387  this->textAnimation->addKeyFrame(0.0, .001);
388  this->textAnimation->setInfinity(ANIM_INF_CONSTANT);
389}
390
391
392/**
393 *  loads a trackElement from a TiXmlElement
394 * @param root the TiXmlElement to load the Data from
395*/
396bool TrackManager::loadParams(const TiXmlElement* root)
397{
398  double x, y, z, d;
399
400  LOAD_PARAM_START_CYCLE
401
402      LoadParam<TrackManager>(element, "WorkOn", this, &TrackManager::workOnS, true)
403        .describe("Selects a TrackElement (by name) to work on");
404
405      LoadParam<TrackManager>(element, "Point", this, &TrackManager::addPoint, true)
406        .describe("Adds a new Point to the currently selected TrackElement");
407
408      LoadParam<TrackManager>(element, "Duration", this, &TrackManager::setDuration, true)
409        .describe("Sets the Duration of the currently selected TrackElement");
410
411      LoadParam<TrackManager>(element, "HotPoint", this, &TrackManager::addHotPoint, true)
412        .describe("Sets a new Point that acts as a hot point. meaning, the curve will flow through this Point");
413
414      LoadParam<TrackManager>(element, "SavePoint", this, &TrackManager::setSavePointS, true)
415        .describe("Sets the current selected Point to a Savepoint, meaning that the curve will be ended and a new one starts, and that one starts again from this point on");
416
417      LoadParam<TrackManager>(element, "Fork", this, &TrackManager::forkS, true)
418        .describe("Forks the Path into multiple forked Path names seperated by ','");
419
420      LoadParam<TrackManager>(element, "Join", this, &TrackManager::joinS, true)
421        .describe("Joins multiple joining Path names seperated by ','");
422
423      /*
424        if( !strcmp( element->Value(), "Fork"))
425        {
426        container = element->FirstChild();
427        if( container->ToText())
428        {
429        assert( container->Value() != NULL);
430        PRINTF(4)("Loaded Fork: %s\n", container->Value());
431        forkS(container->Value());
432        }
433        }
434      */
435      /*
436        if( !strcmp( element->Value(), "Join"))
437        {
438        container = element->FirstChild();
439        if( container->ToText())
440        {
441        assert( container->Value() != NULL);
442        PRINTF0("Loaded Join: %s\n", container->Value());
443        joinS(container->Value());
444        }
445        }
446      */
447      LOAD_PARAM_END_CYCLE;
448}
449
450/**
451 *  standard destructor
452*/
453TrackManager::~TrackManager()
454{
455  PRINTF(3)("Destruct TrackManager\n");
456
457  PRINTF(4)("Deleting all the TrackElements\n");
458  delete this->firstTrackElem;
459
460  delete this->trackText;
461  // the tracknode should be deleted here, but is deleted by pNode: -> null_parent
462
463  // we do not have a TrackManager anymore
464  TrackManager::singletonRef = NULL;
465}
466
467//! Singleton Reference to TrackManager
468TrackManager* TrackManager::singletonRef = NULL;
469
470// INITIALIZE //
471/**
472 *  reserves Space for childCount children
473 * @param childCount The Count of children to make space for.
474 * @param trackElem The TrackElement to appy this to. (if NULL chose this->currentTrackElement)
475*/
476void TrackManager::initChildren(unsigned int childCount, TrackElement* trackElem)
477{
478  if (!trackElem)
479    trackElem = this->currentTrackElem;
480
481  trackElem->childCount = childCount;
482  trackElem->mainJoin = true;  // this tells join, that this one is the Main Join, if it tries to join multiple Tracks
483  trackElem->children =  new tList<TrackElement>();
484  for (int i = 0; i < childCount; i++)
485    {
486      // create a new Element
487      TrackElement* newElem = new TrackElement();
488      // setting up the new ID
489      newElem->ID = ++trackElemCount;
490      // setting up the Time
491      newElem->startingTime = trackElem->endTime + trackElem->jumpTime;
492      // adds the conection Point
493      this->addPointV(trackElem->curve->getNode(trackElem->curve->getNodeCount()),
494                     newElem);
495      // add the new child to the childList.
496      trackElem->children->add(newElem);
497    }
498
499  // setting the Name of the new TrackElement to the name of the last one + _childI
500
501  if (trackElem->getName())
502    {
503      for (int i = 0; i < trackElem->childCount; i++)
504      {
505        char* childName = new char[strlen(trackElem->getName())+10];
506        sprintf(childName, "%s_child%d", trackElem->getName(), i);
507        trackElem->getChild(i)->setName(childName);
508      }
509    }
510  // select the first Child to work on.
511  this->currentTrackElem = trackElem->getChild(0);
512}
513
514
515/**
516 *  Sets the trackID we are working on.
517 * @param trackID the trackID we are working on
518*/
519void TrackManager::workOn(unsigned int trackID)
520{
521  TrackElement* tmpElem = this->firstTrackElem->findByID(trackID);
522  if (tmpElem)
523    this->currentTrackElem = tmpElem;
524  else
525    PRINTF(2)("TrackElement %d not Found, leaving unchanged\n", trackID);
526  PRINTF(4)("now Working on %d\n", this->currentTrackElem->ID);
527}
528
529/**
530 *  Sets the TrackElement to work on
531 * @param trackName the Name of the Track to work on
532*/
533void TrackManager::workOnS(const char* trackName)
534{
535  TrackElement* tmpElem = this->firstTrackElem->findByName(trackName);
536  if (tmpElem)
537    this->currentTrackElem = tmpElem;
538  else
539    PRINTF(2)("TrackElement %s not Found, leaving unchanged\n", trackName);
540  PRINTF(4)("now Working on %d\n", this->currentTrackElem->ID);
541}
542
543/**
544 *  Sets the Type of the Curve
545 * @param curveType The Type to set
546 * @param trackElem the TrackElement that should get a new Curve.
547
548 *  this will possibly get obsolete during the process.
549*/
550void TrackManager::setCurveType(CurveType curveType, TrackElement* trackElem)
551{
552  if (!trackElem->isFresh)
553    {
554      PRINTF(2)("It is not possible to change the type of a Curve after you have have appended some points to it\n");
555      return;
556    }
557  this->curveType = curveType;
558  switch (curveType)
559    {
560    case CURVE_BEZIER:
561      trackElem->curve = new BezierCurve();
562      break;
563    }
564}
565
566/**
567 * @param duration the duration of the TrackElement
568   \see void TrackManager::setDuration(float duration, TrackElement* trackElem)
569*/
570void TrackManager::setDuration(float duration)
571{
572  this->setDuration(duration, NULL);
573}
574
575/**
576 *  Sets the duration of the current path in seconds.
577 * @param duration The duration in seconds.
578 * @param trackElem The TrackElement to apply this to.
579*/
580void TrackManager::setDuration(float duration, TrackElement* trackElem)
581{
582  if (!trackElem)
583    trackElem = this->currentTrackElem;
584
585  trackElem->duration = duration;
586  trackElem->endTime = trackElem->startingTime + duration;
587}
588
589/**
590 *  adds a point to trackElem
591 * @param x x coord
592 * @param y y coord
593 * @param z z coord
594 * @param trackElem The TrackElement to add the Point to
595*/
596void TrackManager::addPoint(float x, float y, float z)
597{
598  this->addPointV(Vector(x,y,z));
599}
600
601/**
602 *  adds a point to trackElem
603 * @param newPoint The point to add.
604 * @param trackElem The TrackElement to add the Point to
605*/
606void TrackManager::addPointV(Vector newPoint, TrackElement* trackElem)
607{
608  if (!trackElem)
609    trackElem = this->currentTrackElem;
610
611  if (trackElem->isFresh)
612    {
613      this->setCurveType(TMAN_DEFAULT_CURVETYPE, trackElem);
614      trackElem->isFresh = false;
615    }
616  trackElem->curve->addNode(newPoint);
617  trackElem->nodeCount++;
618}
619
620/**
621 *  adds a new Hot Point
622 * @param x: the x coordinate of the hotpoint
623 * @param y: the y coordinate of the hotpoint
624 * @param z: the z coordinate of the hotpoint
625   \see int TrackManager::addHotPointV(Vector newPoint, TrackElement* trackElem)
626*/
627void TrackManager::addHotPoint(float x, float y, float z)
628{
629  this->addHotPointV(Vector(x, y, z));
630}
631
632/**
633 *  adds save/splitpoint.
634 * @param newPoint The point to add.
635 * @param trackElem if supplied it will add a hotpoint on this TrackElement
636 * @returns A Pointer to a newly appended Curve
637*/
638int TrackManager::addHotPointV(Vector newPoint, TrackElement* trackElem)
639{
640  if (!trackElem)
641    trackElem = this->currentTrackElem;
642
643  PRINTF(4)("setting up a HotPoint\n");
644  if (trackElem->isFresh)
645    {
646      trackElem->isFresh = false;
647    }
648
649  // @todo HotPoint Handling.
650  trackElem->curve->addNode(newPoint);
651  trackElem->nodeCount++;
652  this->initChildren(1, trackElem);
653}
654
655/**
656   @todo this must be better
657*/
658void TrackManager::setSavePointS(const char* nextElementName)
659{
660  this->setSavePoint(NULL);
661  if (strcmp(nextElementName, ""))
662    this->firstTrackElem->findByID(this->trackElemCount)->setName(nextElementName);
663}
664
665/**
666 *  Sets the last HotPoint into a savePoint.
667 * @param trackElem The TrackElement to appy this to. (if NULL chose this->currentTrackElement)
668 * @returns A Pointer to a newly appended Curve
669
670   If no HotPoint was defined the last added Point will be rendered into a savePoint. \n
671   If the HotPoint was defined as a fork the Point will \b not be set into a savePoint.
672*/
673void TrackManager::setSavePoint(TrackElement* trackElem)
674{
675  if (!trackElem)
676    trackElem = this->currentTrackElem;
677
678  PRINTF(4)("setting up a SavePoint.\n");
679  if (trackElem->isFork || trackElem->isSavePoint)
680    {
681      PRINTF(2)("%d is already finished \n", trackElem->ID);
682      return;
683    }
684  trackElem->isSavePoint = true;
685  trackElem->isHotPoint = true;
686
687  this->initChildren(1, trackElem);
688}
689
690/**
691 *  adds some interessting non-linear movments through the level.
692 * @param count The Count of children the fork will produce
693
694   If no HotPoint was defined the last added Point will be rendered into a fork. \n
695   If the HotPoint was defined as a savePoint the Point will \b not be set into a fork.
696*/
697void TrackManager::fork(unsigned int count, ...)
698{
699  int* trackIDs = new int[count];
700  this->forkV(count, trackIDs, NULL);
701  va_list ID;
702  va_start (ID, count);
703  for(int i = 0; i < count; i++)
704    {
705      *va_arg (ID, int*) = trackIDs[i];
706    }
707  va_end(ID);
708  delete []trackIDs;
709}
710
711/**
712 * @param count how many children to produce
713 * @param ... the information on the children (these are the Stings of their names
714   \see TrackManager::fork(unsigned int count, ...)
715
716   does the same as fork, but has an array of strings as an input.
717*/
718void TrackManager::forkS(unsigned int count, ...)
719{
720  int* trackIDs = new int[count];
721  this->forkV(count, trackIDs, NULL);
722  va_list name;
723  va_start (name, count);
724  for(int i = 0; i < count; i++)
725    {
726      this->firstTrackElem->findByID(trackIDs[i])->setName(va_arg(name, const char*));
727    }
728  va_end(name);
729  delete []trackIDs;
730}
731
732/**
733   \see TrackManager::fork(unsigned int count, ...)
734*/
735void TrackManager::forkS(const char* forkString)
736{
737  SubString strings(forkString);
738
739  int* trackIDs = new int[strings.getCount()];
740  this->forkV(strings.getCount(), trackIDs, NULL);
741
742  for(int i = 0; i < strings.getCount(); i++)
743    {
744      this->firstTrackElem->findByID(trackIDs[i])->setName(strings.getString(i));
745    }
746  delete []trackIDs;
747}
748
749/**
750 *  adds some interessting non-linear movments through the level.
751 * @param count The Count of childrens the current HotPoint will have.
752 * @param trackIDs A Pointer to an Array of ints which will hold the trackID's (the user will have to reserve space for this).
753 * @param trackNames the names for the tracks as a char-arrey-array
754 * @param trackElem The TrackElement to appy this to. (if NULL choose this->currentTrackElement)
755   \see TrackManager::fork(unsigned int count, ...)
756*/
757void TrackManager::forkV(unsigned int count, int* trackIDs, char** trackNames, TrackElement* trackElem)
758{
759  if (!trackElem)
760    trackElem = this->currentTrackElem;
761
762  PRINTF(4)("Forking with %d children\n", count);
763  if (trackElem->isSavePoint)
764    return;
765  trackElem->isFork = true;
766  trackElem->isHotPoint = true;
767  for(int i = 0; i < count; i++)
768    trackIDs[i]=this->trackElemCount+1+i;
769  this->initChildren(count, trackElem);
770}
771
772/**
773 *  decides under what condition a certain Path will be chosen.
774 * @param trackID the trackID to apply this to.
775 * @param cond the CONDITION of the decision
776 * @param subject the Subject that will be decided upon with CONDITION cond.
777*/
778void TrackManager::condition(unsigned int trackID, CONDITION cond, void* subject)
779{
780  this->condition(cond, subject, this->firstTrackElem->findByID(trackID));
781}
782
783/**
784 *  decides under what condition a certain Path will be chosen.
785 * @param cond the CONDITION of the decision
786 * @param subject the Subject that will be decided upon with CONDITION cond.
787 * @param trackElem The TrackElement to appy this to. (if NULL chose this->currentTrackElement)
788*/
789void TrackManager::condition(CONDITION cond, void* subject, TrackElement* trackElem)
790{
791  if (!trackElem)
792    trackElem = this->currentTrackElem;
793
794  if (!trackElem->isFork)
795    {
796      PRINTF(2)("%d is not a Fork, and no condition can be set in this case\n", trackElem->ID);
797      return;
798    }
799  else
800    {
801      switch (cond)
802        {
803        case LOWEST:
804          trackElem->condFunc = &TrackElement::lowest;
805          break;
806        case HIGHEST:
807          trackElem->condFunc = &TrackElement::highest;
808          break;
809        case RANDOM:
810          trackElem->condFunc = &TrackElement::random;
811          break;
812        case LEFTRIGHT:
813          trackElem->condFunc = &TrackElement::leftRight;
814          break;
815        case NEAREST:
816          trackElem->condFunc = &TrackElement::nearest;
817          break;
818        case ENEMYKILLED:
819          break;
820        }
821      trackElem->subject=subject;
822    }
823}
824
825/**
826 *  joins some tracks together again.
827 * @param count The count of Paths to join.
828
829   Join will set the localTime to the longest time a Path has to get to this Point. \n
830   Join will join all curves to the first curve, meaning that all the tangents will be matched.
831*/
832void TrackManager::join(unsigned int count, ...)
833{
834  int* trackIDs = new int [count];
835  va_list ID;
836  va_start (ID, count);
837  for(int i = 0; i < count; i++)
838    {
839      trackIDs[i] = va_arg (ID, int);
840    }
841  va_end(ID);
842  this->joinV(count, trackIDs);
843  delete []trackIDs;
844}
845
846/**
847 *  Joins some Tracks together again.
848 * @param count The count of trackElements to join
849   \see void TrackManager::join(unsigned int count, ...)
850
851   The difference to void TrackManager::join(unsigned int count, ...) is, that this function takes
852   the Names of the TrackElements as inputs and not their ID
853*/
854void TrackManager::joinS(unsigned int count, ...)
855{
856  int* trackIDs = new int [count];
857  va_list NAME;
858  va_start (NAME, count);
859  for(int i = 0; i < count; i++)
860    {
861      const char* name = va_arg (NAME, char*);
862      TrackElement* tmpElem = this->firstTrackElem->findByName(name);
863      if (tmpElem)
864        trackIDs[i] = tmpElem->ID;
865      else
866        PRINTF(1)("Trying to join a Track, of which the name does not exist: %s\n", name);
867    }
868  va_end(NAME);
869  this->joinV(count, trackIDs);
870  delete []trackIDs;
871}
872
873/**
874   \see void TrackManager::join(unsigned int count, ...)
875*/
876void TrackManager::joinS(const char* joinString)
877{
878  SubString strings(joinString);
879
880  int* trackIDs = new int[strings.getCount()];
881  this->joinV(strings.getCount(), trackIDs);
882
883  for(int i = 0; i < strings.getCount(); i++)
884    {
885      TrackElement* tmpElem = this->firstTrackElem->findByName(strings.getString(i));
886      if (tmpElem)
887        trackIDs[i] = tmpElem->ID;
888      else
889        PRINTF(1)("Trying to join a Track, of which the name does not exist: %s\n", strings.getString(i));
890    }
891
892  this->joinV(strings.getCount(), trackIDs);
893  delete []trackIDs;
894}
895
896/**
897 *  joins some tracks together again.
898 * @param count The count of Paths to join.
899 * @param trackIDs an Array with the trackID's to join
900
901   \see void TrackManager::join(unsigned int count, ...)
902*/
903void TrackManager::joinV(unsigned int count, int* trackIDs)
904{
905  TrackElement* tmpTrackElem;
906  TrackElement* tmpJoinElem;
907  for (int i = 0; i < count; i++)
908    if (!this->firstTrackElem->findByID(trackIDs[i]))
909      {
910        PRINTF(1)("Trying to Connect Paths that do not exist yet: %d\n Not Joining Anything\n", trackIDs[i]);
911        return;
912      }
913
914
915  PRINTF(3)("Joining %d tracks and merging to Track %d\n", count, trackIDs[0]);
916
917  // checking if there is a back-loop-connection and ERROR if it is.
918  tmpTrackElem = this->firstTrackElem->findByID(trackIDs[0]);
919  if (!tmpTrackElem->backLoopCheck())
920    {
921      PRINTF(2)("Backloop connection detected at joining trackElements\n -> TRACK WILL NOT BE JOINED\n");
922      return;
923    }
924
925  TrackElement* firstJoint =   this->firstTrackElem->findByID(trackIDs[0]);
926  float tmpLatestTime = firstJoint->endTime;
927
928  Vector tmpEndPoint = firstJoint->curve->getNode(firstJoint->curve->getNodeCount());
929  Vector tmpTangentPoint = firstJoint->curve->getNode(firstJoint->curve->getNodeCount()-1);
930  Vector tmpc2Point = firstJoint->curve->getNode(firstJoint->curve->getNodeCount()-2);
931  firstJoint->isJoined = true;
932  //  firstJoint->mainJoin = true;
933  if(!firstJoint->isHotPoint)
934    this->setSavePoint(firstJoint);
935  // Timing:
936  for (int i = 0; i < count; i++)
937    {
938      if(tmpJoinElem = this->firstTrackElem->findByID(trackIDs[i]))
939        {
940          if (tmpJoinElem->childCount == 0
941              && tmpJoinElem->endTime > tmpLatestTime)
942            tmpLatestTime = tmpJoinElem->endTime;
943        }
944    }
945  // time the main Join.
946  firstJoint->jumpTime = tmpLatestTime - firstJoint->endTime;
947
948  // Joining:
949  for (int i = 1; i < count; i++)
950    {
951      if( tmpJoinElem = this->firstTrackElem->findByID(trackIDs[i]))
952        {
953          if (tmpJoinElem->childCount > 0)
954            printf("!!This Curve has children, and as such will not be joined!!\n You can try joining other childless TrackElements to this one!");
955          else
956            {
957              this->addPointV(tmpc2Point, tmpJoinElem);
958              this->addPointV(tmpTangentPoint, tmpJoinElem);
959              this->addPointV(tmpEndPoint, tmpJoinElem);
960              // time all other Joins
961              tmpJoinElem->jumpTime = tmpLatestTime - tmpJoinElem->endTime;
962
963              //Copying Joint-Info
964              tmpJoinElem->children = firstJoint->children;
965              tmpJoinElem->childCount = firstJoint->childCount;
966              tmpJoinElem->isSavePoint = firstJoint->isSavePoint;
967              tmpJoinElem->isFork = firstJoint->isFork;
968
969              tmpJoinElem->isJoined = true;
970            }
971        }
972    }
973  if(firstJoint->children)
974    {
975      //TrackElement* enumElem = firstJoint->children->enumerate();
976      tIterator<TrackElement>* iterator = firstJoint->children->getIterator();
977      TrackElement* enumElem = iterator->firstElement();
978      while (enumElem)
979        {
980          PRINTF(5)("Setting startingTime of %d to %f.\n", enumElem->ID, tmpLatestTime);
981          enumElem->startingTime = tmpLatestTime;
982          enumElem->endTime = tmpLatestTime + enumElem->duration;
983
984          enumElem = iterator->nextElement();
985        }
986      delete iterator;
987    }
988}
989
990/**
991 *  finalizes the TrackSystem. after this it will not be editable anymore
992
993   @todo check for any inconsistencies, output errors
994*/
995void TrackManager::finalize()
996{
997  for (int i = 1; i<= trackElemCount ;i++)
998    {
999      TrackElement* tmpElem = this->firstTrackElem->findByID(i);
1000      if( tmpElem->childCount > 0 && tmpElem->mainJoin)
1001        {
1002          tIterator<TrackElement>* iterator = tmpElem->children->getIterator();
1003          TrackElement* enumElem = iterator->firstElement();
1004          //TrackElement* enumElem = tmpElem->children->enumerate();
1005          while (enumElem)
1006            {
1007
1008              // c1-continuity
1009              enumElem->curve->addNode(enumElem->curve->getNode(0) +
1010                                                   ((enumElem->curve->getNode(0) -
1011                                                    tmpElem->curve->getNode(tmpElem->curve->getNodeCount()-1))
1012                                                    ),2);
1013              enumElem->nodeCount++;
1014              // c2-continuity
1015              enumElem->curve->addNode((tmpElem->curve->getNode(tmpElem->curve->getNodeCount())-
1016                                                    tmpElem->curve->getNode(tmpElem->curve->getNodeCount()-1)) * 4 +
1017                                                   tmpElem->curve->getNode(tmpElem->curve->getNodeCount()-2), 3);
1018              enumElem->nodeCount++;
1019              PRINTF(5)("accelerations: %d-in: count: %d, %f, %f, %f\n                  %d-out: count: %d %f, %f, %f\n",
1020                     tmpElem->ID, tmpElem->nodeCount,
1021                     tmpElem->curve->calcAcc(0.999).x, tmpElem->curve->calcAcc(0.999).y, tmpElem->curve->calcAcc(0.999).z,
1022                     enumElem->ID, enumElem->nodeCount,
1023                     enumElem->curve->calcAcc(0).x, enumElem->curve->calcAcc(0).y, enumElem->curve->calcAcc(0).z);
1024
1025              enumElem = iterator->nextElement();
1026            }
1027          delete iterator;
1028        }
1029    }
1030  for (int i = 1; i <= trackElemCount;i++)
1031    if (this->firstTrackElem->findByID(i)->endTime > this->maxTime)
1032      this->maxTime = this->firstTrackElem->findByID(i)->endTime; // very bad implemented :/
1033}
1034
1035
1036// RUNTIME //
1037
1038/**
1039 *  calculates the Position for the localTime of the Track.
1040 * @returns the calculated Position
1041*/
1042Vector TrackManager::calcPos() const
1043{
1044  return this->currentTrackElem->curve->calcPos((this->localTime-this->currentTrackElem->startingTime)/this->currentTrackElem->duration);
1045}
1046
1047/**
1048 *  calculates the Rotation for the localTime of the Track.
1049 * @returns the calculated Rotation
1050*/
1051Vector TrackManager::calcDir() const
1052{
1053  return this->currentTrackElem->curve->calcDir((this->localTime - this->currentTrackElem->startingTime)/this->currentTrackElem->duration);
1054}
1055
1056/**
1057 * @returns the current Width of the track
1058*/
1059float TrackManager::getWidth() const
1060{
1061  return this->currentTrackElem->width;
1062}
1063
1064/**
1065 *  Advances the local-time of the Track around dt
1066 * @param dt The time about which to advance.
1067
1068   This function also checks, if the TrackElement has to be changed.
1069*/
1070void TrackManager::tick(float dt)
1071{
1072  PRINTF(4)("CurrentTrackID: %d, LocalTime is: %f, timestep is: %f\n", this->currentTrackElem->ID, this->localTime, dt);
1073  if (this->localTime <= this->firstTrackElem->duration)
1074    this->jumpTo(this->localTime);
1075  if (this->localTime <= this->maxTime)
1076    this->localTime += dt;
1077  if (this->localTime > this->currentTrackElem->endTime
1078      && this->currentTrackElem->children)
1079    {
1080      if (this->currentTrackElem->jumpTime != 0.0)
1081        this->jumpTo(this->localTime + this->currentTrackElem->jumpTime);
1082      // jump to the next TrackElement and also set the history of the new Element to the old one.
1083      TrackElement* tmpHistoryElem = this->currentTrackElem;
1084      this->currentTrackElem = this->currentTrackElem->getChild(this->choosePath(this->currentTrackElem));
1085      this->currentTrackElem->history = tmpHistoryElem;
1086      if (this->currentTrackElem->getName())
1087        {
1088          this->trackText->setText(this->currentTrackElem->getName());
1089          this->textAnimation->replay();
1090        }
1091    }
1092  if (this->bindSlave)
1093    {
1094      Vector tmp = this->calcPos();
1095      Quaternion quat = Quaternion(this->calcDir(), Vector(this->currentTrackElem->curve->calcAcc((localTime-this->currentTrackElem->startingTime)/this->currentTrackElem->duration).x,1,this->currentTrackElem->curve->calcAcc((localTime-this->currentTrackElem->startingTime)/this->currentTrackElem->duration).z));
1096
1097      Vector v(0.0, 1.0, 0.0);
1098      Quaternion q(-PI/2, v);
1099      quat = quat * q;
1100
1101      this->bindSlave->setAbsCoor(tmp);
1102      this->bindSlave->setAbsDir(quat);
1103    }
1104}
1105
1106/**
1107 *  Jumps to a certain point on the Track.
1108 * @param time The time on the Track to jump to.
1109
1110   This should be used to Jump backwards on a Track, because moving forward means to change between the Path. (it then tries to choose the default.)
1111   Max is trackLengthMax.
1112*/
1113void TrackManager::jumpTo(float time)
1114{
1115  if (time == 0)
1116    {
1117      this->currentTrackElem = this->firstTrackElem;
1118      if (this->currentTrackElem->getName())
1119        {
1120          this->trackText->setText(this->currentTrackElem->getName());
1121          this->textAnimation->play();
1122        }
1123    }
1124  this->localTime = time;
1125}
1126
1127/**
1128 *  a Function that decides which Path we should follow.
1129 * @param trackElem The Path to choose.
1130
1131*/
1132int TrackManager::choosePath(TrackElement* trackElem)
1133{
1134  return (trackElem->*(trackElem->condFunc))(trackElem->subject);
1135}
1136
1137/**
1138 *  Sets the PNode, that should be moved along the Tack
1139 * @param bindSlave the PNode to set
1140*/
1141void TrackManager::setBindSlave(PNode* bindSlave)
1142{
1143  this->bindSlave = bindSlave;
1144}
1145
1146/**
1147 * @returns the main TrackNode
1148*/
1149PNode* TrackManager::getTrackNode()
1150{
1151  return this->trackNode;
1152}
1153
1154// DEBUG //
1155
1156/**
1157 *  Imports a model of the Graph into the OpenGL-environment.
1158 * @param dt The Iterator used in seconds for Painting the Graph.
1159
1160   This is for testing facility only. Do this if you want to see the Path inside the Level.
1161   eventually this will all be packed into a gl-list.
1162*/
1163void TrackManager::drawGraph(float dt) const
1164{
1165  for (int i = 1; i <= trackElemCount; i++)
1166    {
1167      glBegin(GL_LINE_STRIP);
1168      TrackElement* tmpElem = this->firstTrackElem->findByID(i);
1169      if (tmpElem->curve)
1170        for(float f = 0.0; f < 1.0; f+=dt)
1171          {
1172            //      printf("%f, %f, %f\n",trackManager->calcPos().x, trackManager->calcPos().y, trackManager->calcPos().z);
1173            Vector tmpVector = tmpElem->curve->calcPos(f);
1174            glVertex3f(tmpVector.x, tmpVector.y, tmpVector.z);
1175          }
1176      glEnd();
1177    }
1178}
1179
1180/**
1181 *  outputs debug information about the trackManager
1182 * @param level how much debug
1183*/
1184void TrackManager::debug(unsigned int level) const
1185{
1186  PRINT(0)("=========================================\n");
1187  PRINT(0)("= CLASS TRACKMANAGER::debug information =\n");
1188  PRINT(0)("=========================================\n");
1189  //  PRINT(0)("Status is: %
1190  PRINT(0)(" Consists of %d elements\n", this->trackElemCount);
1191  PRINT(0)(" localTime is: %f\n", this->localTime);
1192  if (level >= 2)
1193    {
1194      for (int i = 1; i <= trackElemCount; i++)
1195        {
1196          TrackElement* tmpElem = this->firstTrackElem->findByID(i);
1197          tmpElem->debug();
1198        }
1199    }
1200  PRINT(0)("-----------------------------------------\n");
1201}
Note: See TracBrowser for help on using the repository browser.