Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: orxonox.OLD/branches/avi_play/src/util/track/track_manager.cc @ 6284

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

orxonox/branches/avi_play: merged the trunk back to the avi_play branche again
merged with command
svn merge -r 5924:HEAD ../trunk/ avi_play/

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 "load_param.h"
22#include "p_node.h"
23#include "track_node.h"
24#include "stdincl.h"
25#include "list.h"
26#include "text.h"
27#include "t_animation.h"
28
29
30#include "parser/tinyxml/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 = NULL;
108      while (enumElem)
109        {
110          if ((tmpElem = enumElem->findByID(trackID)) != NULL)
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(unsigned 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 (unsigned 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 = new Text("fonts/earth.ttf", 30);
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(root, element);
401  {
402
403    LoadParam_CYCLE(element, "WorkOn", this, TrackManager, workOnS)
404        .describe("Selects a TrackElement (by name) to work on");
405
406    LoadParam_CYCLE(element, "Point", this, TrackManager, addPoint)
407        .describe("Adds a new Point to the currently selected TrackElement");
408
409    LoadParam_CYCLE(element, "Duration", this, TrackManager, setDuration)
410        .describe("Sets the Duration of the currently selected TrackElement");
411
412    LoadParam_CYCLE(element, "HotPoint", this, TrackManager, addHotPoint)
413        .describe("Sets a new Point that acts as a hot point. meaning, the curve will flow through this Point");
414
415    LoadParam_CYCLE(element, "SavePoint", this, TrackManager, setSavePointS)
416        .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");
417
418    LoadParam_CYCLE(element, "Fork", this, TrackManager, forkS)
419        .describe("Forks the Path into multiple forked Path names seperated by ','");
420
421    LoadParam_CYCLE(element, "Join", this, TrackManager, joinS)
422        .describe("Joins multiple joining Path names seperated by ','");
423
424      /*
425    if( !strcmp( element->Value(), "Fork"))
426    {
427    container = element->FirstChild();
428    if( container->ToText())
429        {
430        assert( container->Value() != NULL);
431        PRINTF(4)("Loaded Fork: %s\n", container->Value());
432        forkS(container->Value());
433        }
434        }
435      */
436      /*
437        if( !strcmp( element->Value(), "Join"))
438        {
439        container = element->FirstChild();
440        if( container->ToText())
441        {
442        assert( container->Value() != NULL);
443        PRINTF0("Loaded Join: %s\n", container->Value());
444        joinS(container->Value());
445        }
446        }
447      */
448  }
449  LOAD_PARAM_END_CYCLE(element);
450}
451
452/**
453 *  standard destructor
454*/
455TrackManager::~TrackManager()
456{
457  PRINTF(3)("Destruct TrackManager\n");
458
459  PRINTF(4)("Deleting all the TrackElements\n");
460  delete this->firstTrackElem;
461
462  delete this->trackText;
463  // the tracknode should be deleted here, but is deleted by pNode: -> null_parent
464
465  // we do not have a TrackManager anymore
466  TrackManager::singletonRef = NULL;
467}
468
469//! Singleton Reference to TrackManager
470TrackManager* TrackManager::singletonRef = NULL;
471
472// INITIALIZE //
473/**
474 *  reserves Space for childCount children
475 * @param childCount The Count of children to make space for.
476 * @param trackElem The TrackElement to appy this to. (if NULL chose this->currentTrackElement)
477*/
478void TrackManager::initChildren(unsigned int childCount, TrackElement* trackElem)
479{
480  if (!trackElem)
481    trackElem = this->currentTrackElem;
482
483  trackElem->childCount = childCount;
484  trackElem->mainJoin = true;  // this tells join, that this one is the Main Join, if it tries to join multiple Tracks
485  trackElem->children =  new tList<TrackElement>();
486  for (int i = 0; i < childCount; i++)
487    {
488      // create a new Element
489      TrackElement* newElem = new TrackElement();
490      // setting up the new ID
491      newElem->ID = ++trackElemCount;
492      // setting up the Time
493      newElem->startingTime = trackElem->endTime + trackElem->jumpTime;
494      // adds the conection Point
495      this->addPointV(trackElem->curve->getNode(trackElem->curve->getNodeCount()),
496                     newElem);
497      // add the new child to the childList.
498      trackElem->children->add(newElem);
499    }
500
501  // setting the Name of the new TrackElement to the name of the last one + _childI
502
503  if (trackElem->getName())
504    {
505      for (int i = 0; i < trackElem->childCount; i++)
506      {
507        char* childName = new char[strlen(trackElem->getName())+10];
508        sprintf(childName, "%s_child%d", trackElem->getName(), i);
509        trackElem->getChild(i)->setName(childName);
510      }
511    }
512  // select the first Child to work on.
513  this->currentTrackElem = trackElem->getChild(0);
514}
515
516
517/**
518 *  Sets the trackID we are working on.
519 * @param trackID the trackID we are working on
520*/
521void TrackManager::workOn(unsigned int trackID)
522{
523  TrackElement* tmpElem = this->firstTrackElem->findByID(trackID);
524  if (tmpElem)
525    this->currentTrackElem = tmpElem;
526  else
527    PRINTF(2)("TrackElement %d not Found, leaving unchanged\n", trackID);
528  PRINTF(4)("now Working on %d\n", this->currentTrackElem->ID);
529}
530
531/**
532 *  Sets the TrackElement to work on
533 * @param trackName the Name of the Track to work on
534*/
535void TrackManager::workOnS(const char* trackName)
536{
537  TrackElement* tmpElem = this->firstTrackElem->findByName(trackName);
538  if (tmpElem)
539    this->currentTrackElem = tmpElem;
540  else
541    PRINTF(2)("TrackElement %s not Found, leaving unchanged\n", trackName);
542  PRINTF(4)("now Working on %d\n", this->currentTrackElem->ID);
543}
544
545/**
546 *  Sets the Type of the Curve
547 * @param curveType The Type to set
548 * @param trackElem the TrackElement that should get a new Curve.
549
550 *  this will possibly get obsolete during the process.
551*/
552void TrackManager::setCurveType(CurveType curveType, TrackElement* trackElem)
553{
554  if (!trackElem->isFresh)
555    {
556      PRINTF(2)("It is not possible to change the type of a Curve after you have have appended some points to it\n");
557      return;
558    }
559  this->curveType = curveType;
560  switch (curveType)
561    {
562    case CURVE_BEZIER:
563      trackElem->curve = new BezierCurve();
564      break;
565    }
566}
567
568/**
569 * @param duration the duration of the TrackElement
570   \see void TrackManager::setDuration(float duration, TrackElement* trackElem)
571*/
572void TrackManager::setDuration(float duration)
573{
574  this->setDuration(duration, NULL);
575}
576
577/**
578 *  Sets the duration of the current path in seconds.
579 * @param duration The duration in seconds.
580 * @param trackElem The TrackElement to apply this to.
581*/
582void TrackManager::setDuration(float duration, TrackElement* trackElem)
583{
584  if (!trackElem)
585    trackElem = this->currentTrackElem;
586
587  trackElem->duration = duration;
588  trackElem->endTime = trackElem->startingTime + duration;
589}
590
591/**
592 *  adds a point to trackElem
593 * @param x x coord
594 * @param y y coord
595 * @param z z coord
596 * @param trackElem The TrackElement to add the Point to
597*/
598void TrackManager::addPoint(float x, float y, float z)
599{
600  this->addPointV(Vector(x,y,z));
601}
602
603/**
604 *  adds a point to trackElem
605 * @param newPoint The point to add.
606 * @param trackElem The TrackElement to add the Point to
607*/
608void TrackManager::addPointV(Vector newPoint, TrackElement* trackElem)
609{
610  if (!trackElem)
611    trackElem = this->currentTrackElem;
612
613  if (trackElem->isFresh)
614    {
615      this->setCurveType(TMAN_DEFAULT_CURVETYPE, trackElem);
616      trackElem->isFresh = false;
617    }
618  trackElem->curve->addNode(newPoint);
619  trackElem->nodeCount++;
620}
621
622/**
623 *  adds a new Hot Point
624 * @param x: the x coordinate of the hotpoint
625 * @param y: the y coordinate of the hotpoint
626 * @param z: the z coordinate of the hotpoint
627   \see int TrackManager::addHotPointV(Vector newPoint, TrackElement* trackElem)
628*/
629void TrackManager::addHotPoint(float x, float y, float z)
630{
631  this->addHotPointV(Vector(x, y, z));
632}
633
634/**
635 *  adds save/splitpoint.
636 * @param newPoint The point to add.
637 * @param trackElem if supplied it will add a hotpoint on this TrackElement
638 * @returns A Pointer to a newly appended Curve
639*/
640int TrackManager::addHotPointV(Vector newPoint, TrackElement* trackElem)
641{
642  if (!trackElem)
643    trackElem = this->currentTrackElem;
644
645  PRINTF(4)("setting up a HotPoint\n");
646  if (trackElem->isFresh)
647    {
648      trackElem->isFresh = false;
649    }
650
651  // @todo HotPoint Handling.
652  trackElem->curve->addNode(newPoint);
653  trackElem->nodeCount++;
654  this->initChildren(1, trackElem);
655}
656
657/**
658   @todo this must be better
659*/
660void TrackManager::setSavePointS(const char* nextElementName)
661{
662  this->setSavePoint(NULL);
663  if (strcmp(nextElementName, ""))
664    this->firstTrackElem->findByID(this->trackElemCount)->setName(nextElementName);
665}
666
667/**
668 *  Sets the last HotPoint into a savePoint.
669 * @param trackElem The TrackElement to appy this to. (if NULL chose this->currentTrackElement)
670 * @returns A Pointer to a newly appended Curve
671
672   If no HotPoint was defined the last added Point will be rendered into a savePoint. \n
673   If the HotPoint was defined as a fork the Point will \b not be set into a savePoint.
674*/
675void TrackManager::setSavePoint(TrackElement* trackElem)
676{
677  if (!trackElem)
678    trackElem = this->currentTrackElem;
679
680  PRINTF(4)("setting up a SavePoint.\n");
681  if (trackElem->isFork || trackElem->isSavePoint)
682    {
683      PRINTF(2)("%d is already finished \n", trackElem->ID);
684      return;
685    }
686  trackElem->isSavePoint = true;
687  trackElem->isHotPoint = true;
688
689  this->initChildren(1, trackElem);
690}
691
692/**
693 *  adds some interessting non-linear movments through the level.
694 * @param count The Count of children the fork will produce
695
696   If no HotPoint was defined the last added Point will be rendered into a fork. \n
697   If the HotPoint was defined as a savePoint the Point will \b not be set into a fork.
698*/
699void TrackManager::fork(unsigned int count, ...)
700{
701  int* trackIDs = new int[count];
702  this->forkV(count, trackIDs, NULL);
703  va_list ID;
704  va_start (ID, count);
705  for(int i = 0; i < count; i++)
706    {
707      *va_arg (ID, int*) = trackIDs[i];
708    }
709  va_end(ID);
710  delete []trackIDs;
711}
712
713/**
714 * @param count how many children to produce
715 * @param ... the information on the children (these are the Stings of their names
716   \see TrackManager::fork(unsigned int count, ...)
717
718   does the same as fork, but has an array of strings as an input.
719*/
720void TrackManager::forkS(unsigned int count, ...)
721{
722  int* trackIDs = new int[count];
723  this->forkV(count, trackIDs, NULL);
724  va_list name;
725  va_start (name, count);
726  for(int i = 0; i < count; i++)
727    {
728      this->firstTrackElem->findByID(trackIDs[i])->setName(va_arg(name, const char*));
729    }
730  va_end(name);
731  delete []trackIDs;
732}
733
734/**
735   \see TrackManager::fork(unsigned int count, ...)
736*/
737void TrackManager::forkS(const char* forkString)
738{
739  SubString strings(forkString, ',');
740
741  int* trackIDs = new int[strings.getCount()];
742  this->forkV(strings.getCount(), trackIDs, NULL);
743
744  for(int i = 0; i < strings.getCount(); i++)
745    {
746      this->firstTrackElem->findByID(trackIDs[i])->setName(strings.getString(i));
747    }
748  delete []trackIDs;
749}
750
751/**
752 *  adds some interessting non-linear movments through the level.
753 * @param count The Count of childrens the current HotPoint will have.
754 * @param trackIDs A Pointer to an Array of ints which will hold the trackID's (the user will have to reserve space for this).
755 * @param trackNames the names for the tracks as a char-arrey-array
756 * @param trackElem The TrackElement to appy this to. (if NULL choose this->currentTrackElement)
757   \see TrackManager::fork(unsigned int count, ...)
758*/
759void TrackManager::forkV(unsigned int count, int* trackIDs, char** trackNames, TrackElement* trackElem)
760{
761  if (!trackElem)
762    trackElem = this->currentTrackElem;
763
764  PRINTF(4)("Forking with %d children\n", count);
765  if (trackElem->isSavePoint)
766    return;
767  trackElem->isFork = true;
768  trackElem->isHotPoint = true;
769  for(int i = 0; i < count; i++)
770    trackIDs[i]=this->trackElemCount+1+i;
771  this->initChildren(count, trackElem);
772}
773
774/**
775 *  decides under what condition a certain Path will be chosen.
776 * @param trackID the trackID to apply this to.
777 * @param cond the CONDITION of the decision
778 * @param subject the Subject that will be decided upon with CONDITION cond.
779*/
780void TrackManager::condition(unsigned int trackID, CONDITION cond, void* subject)
781{
782  this->condition(cond, subject, this->firstTrackElem->findByID(trackID));
783}
784
785/**
786 *  decides under what condition a certain Path will be chosen.
787 * @param cond the CONDITION of the decision
788 * @param subject the Subject that will be decided upon with CONDITION cond.
789 * @param trackElem The TrackElement to appy this to. (if NULL chose this->currentTrackElement)
790*/
791void TrackManager::condition(CONDITION cond, void* subject, TrackElement* trackElem)
792{
793  if (!trackElem)
794    trackElem = this->currentTrackElem;
795
796  if (!trackElem->isFork)
797    {
798      PRINTF(2)("%d is not a Fork, and no condition can be set in this case\n", trackElem->ID);
799      return;
800    }
801  else
802    {
803      switch (cond)
804        {
805        case LOWEST:
806          trackElem->condFunc = &TrackElement::lowest;
807          break;
808        case HIGHEST:
809          trackElem->condFunc = &TrackElement::highest;
810          break;
811        case RANDOM:
812          trackElem->condFunc = &TrackElement::random;
813          break;
814        case LEFTRIGHT:
815          trackElem->condFunc = &TrackElement::leftRight;
816          break;
817        case NEAREST:
818          trackElem->condFunc = &TrackElement::nearest;
819          break;
820        case ENEMYKILLED:
821          break;
822        }
823      trackElem->subject=subject;
824    }
825}
826
827/**
828 *  joins some tracks together again.
829 * @param count The count of Paths to join.
830
831   Join will set the localTime to the longest time a Path has to get to this Point. \n
832   Join will join all curves to the first curve, meaning that all the tangents will be matched.
833*/
834void TrackManager::join(unsigned int count, ...)
835{
836  int* trackIDs = new int [count];
837  va_list ID;
838  va_start (ID, count);
839  for(int i = 0; i < count; i++)
840    {
841      trackIDs[i] = va_arg (ID, int);
842    }
843  va_end(ID);
844  this->joinV(count, trackIDs);
845  delete []trackIDs;
846}
847
848/**
849 *  Joins some Tracks together again.
850 * @param count The count of trackElements to join
851   \see void TrackManager::join(unsigned int count, ...)
852
853   The difference to void TrackManager::join(unsigned int count, ...) is, that this function takes
854   the Names of the TrackElements as inputs and not their ID
855*/
856void TrackManager::joinS(unsigned int count, ...)
857{
858  int* trackIDs = new int [count];
859  va_list NAME;
860  va_start (NAME, count);
861  for(int i = 0; i < count; i++)
862    {
863      const char* name = va_arg (NAME, char*);
864      TrackElement* tmpElem = this->firstTrackElem->findByName(name);
865      if (tmpElem)
866        trackIDs[i] = tmpElem->ID;
867      else
868        PRINTF(1)("Trying to join a Track, of which the name does not exist: %s\n", name);
869    }
870  va_end(NAME);
871  this->joinV(count, trackIDs);
872  delete []trackIDs;
873}
874
875/**
876   \see void TrackManager::join(unsigned int count, ...)
877*/
878void TrackManager::joinS(const char* joinString)
879{
880  SubString strings(joinString, ',');
881
882  int* trackIDs = new int[strings.getCount()];
883  this->joinV(strings.getCount(), trackIDs);
884
885  for(unsigned int i = 0; i < strings.getCount(); i++)
886    {
887      TrackElement* tmpElem = this->firstTrackElem->findByName(strings.getString(i));
888      if (tmpElem != NULL)
889        trackIDs[i] = tmpElem->ID;
890      else
891      {
892        PRINTF(1)("Trying to join a Track, of which the name does not exist: %s\n", strings.getString(i));
893        trackIDs[i] = -1;
894      }
895    }
896  this->joinV(strings.getCount(), trackIDs);
897  delete []trackIDs;
898}
899
900/**
901 *  joins some tracks together again.
902 * @param count The count of Paths to join.
903 * @param trackIDs an Array with the trackID's to join
904 *
905 * @see void TrackManager::join(unsigned int count, ...)
906*/
907void TrackManager::joinV(unsigned int count, int* trackIDs)
908{
909  TrackElement* tmpTrackElem;
910  TrackElement* tmpJoinElem;
911  for (unsigned int i = 0; i < count; i++)
912    if (!this->firstTrackElem->findByID(trackIDs[i]))
913      {
914        PRINTF(1)("Trying to Connect Paths that do not exist yet: %d\n Not Joining Anything\n", trackIDs[i]);
915        return;
916      }
917
918
919  PRINTF(3)("Joining %d tracks and merging to Track %d\n", count, trackIDs[0]);
920
921  // checking if there is a back-loop-connection and ERROR if it is.
922  tmpTrackElem = this->firstTrackElem->findByID(trackIDs[0]);
923  if (!tmpTrackElem->backLoopCheck())
924    {
925      PRINTF(2)("Backloop connection detected at joining trackElements\n -> TRACK WILL NOT BE JOINED\n");
926      return;
927    }
928
929  TrackElement* firstJoint =   this->firstTrackElem->findByID(trackIDs[0]);
930  float tmpLatestTime = firstJoint->endTime;
931
932  Vector tmpEndPoint = firstJoint->curve->getNode(firstJoint->curve->getNodeCount());
933  Vector tmpTangentPoint = firstJoint->curve->getNode(firstJoint->curve->getNodeCount()-1);
934  Vector tmpc2Point = firstJoint->curve->getNode(firstJoint->curve->getNodeCount()-2);
935  firstJoint->isJoined = true;
936  //  firstJoint->mainJoin = true;
937  if(!firstJoint->isHotPoint)
938    this->setSavePoint(firstJoint);
939  // Timing:
940  for (unsigned int i = 0; i < count; i++)
941    {
942      if(tmpJoinElem = this->firstTrackElem->findByID(trackIDs[i]))
943        {
944          if (tmpJoinElem->childCount == 0
945              && tmpJoinElem->endTime > tmpLatestTime)
946            tmpLatestTime = tmpJoinElem->endTime;
947        }
948    }
949  // time the main Join.
950  firstJoint->jumpTime = tmpLatestTime - firstJoint->endTime;
951
952  // Joining:
953  for (int i = 1; i < count; i++)
954    {
955      if( tmpJoinElem = this->firstTrackElem->findByID(trackIDs[i]))
956        {
957          if (tmpJoinElem->childCount > 0)
958            printf("!!This Curve has children, and as such will not be joined!!\n You can try joining other childless TrackElements to this one!");
959          else
960            {
961              this->addPointV(tmpc2Point, tmpJoinElem);
962              this->addPointV(tmpTangentPoint, tmpJoinElem);
963              this->addPointV(tmpEndPoint, tmpJoinElem);
964              // time all other Joins
965              tmpJoinElem->jumpTime = tmpLatestTime - tmpJoinElem->endTime;
966
967              //Copying Joint-Info
968              tmpJoinElem->children = firstJoint->children;
969              tmpJoinElem->childCount = firstJoint->childCount;
970              tmpJoinElem->isSavePoint = firstJoint->isSavePoint;
971              tmpJoinElem->isFork = firstJoint->isFork;
972
973              tmpJoinElem->isJoined = true;
974            }
975        }
976    }
977  if(firstJoint->children)
978    {
979      //TrackElement* enumElem = firstJoint->children->enumerate();
980      tIterator<TrackElement>* iterator = firstJoint->children->getIterator();
981      TrackElement* enumElem = iterator->firstElement();
982      while (enumElem)
983        {
984          PRINTF(5)("Setting startingTime of %d to %f.\n", enumElem->ID, tmpLatestTime);
985          enumElem->startingTime = tmpLatestTime;
986          enumElem->endTime = tmpLatestTime + enumElem->duration;
987
988          enumElem = iterator->nextElement();
989        }
990      delete iterator;
991    }
992}
993
994/**
995 *  finalizes the TrackSystem. after this it will not be editable anymore
996
997   @todo check for any inconsistencies, output errors
998*/
999void TrackManager::finalize()
1000{
1001  for (int i = 1; i<= trackElemCount ;i++)
1002    {
1003      TrackElement* tmpElem = this->firstTrackElem->findByID(i);
1004      if( tmpElem->childCount > 0 && tmpElem->mainJoin)
1005        {
1006          tIterator<TrackElement>* iterator = tmpElem->children->getIterator();
1007          TrackElement* enumElem = iterator->firstElement();
1008          //TrackElement* enumElem = tmpElem->children->enumerate();
1009          while (enumElem)
1010            {
1011
1012              // c1-continuity
1013              enumElem->curve->addNode(enumElem->curve->getNode(0) +
1014                                                   ((enumElem->curve->getNode(0) -
1015                                                    tmpElem->curve->getNode(tmpElem->curve->getNodeCount()-1))
1016                                                    ),2);
1017              enumElem->nodeCount++;
1018              // c2-continuity
1019              enumElem->curve->addNode((tmpElem->curve->getNode(tmpElem->curve->getNodeCount())-
1020                                                    tmpElem->curve->getNode(tmpElem->curve->getNodeCount()-1)) * 4 +
1021                                                   tmpElem->curve->getNode(tmpElem->curve->getNodeCount()-2), 3);
1022              enumElem->nodeCount++;
1023              PRINTF(5)("accelerations: %d-in: count: %d, %f, %f, %f\n                  %d-out: count: %d %f, %f, %f\n",
1024                     tmpElem->ID, tmpElem->nodeCount,
1025                     tmpElem->curve->calcAcc(0.999).x, tmpElem->curve->calcAcc(0.999).y, tmpElem->curve->calcAcc(0.999).z,
1026                     enumElem->ID, enumElem->nodeCount,
1027                     enumElem->curve->calcAcc(0).x, enumElem->curve->calcAcc(0).y, enumElem->curve->calcAcc(0).z);
1028
1029              enumElem = iterator->nextElement();
1030            }
1031          delete iterator;
1032        }
1033    }
1034  for (int i = 1; i <= trackElemCount;i++)
1035    if (this->firstTrackElem->findByID(i)->endTime > this->maxTime)
1036      this->maxTime = this->firstTrackElem->findByID(i)->endTime; // very bad implemented :/
1037}
1038
1039
1040// RUNTIME //
1041
1042/**
1043 *  calculates the Position for the localTime of the Track.
1044 * @returns the calculated Position
1045*/
1046Vector TrackManager::calcPos() const
1047{
1048  return this->currentTrackElem->curve->calcPos((this->localTime-this->currentTrackElem->startingTime)/this->currentTrackElem->duration);
1049}
1050
1051/**
1052 *  calculates the Rotation for the localTime of the Track.
1053 * @returns the calculated Rotation
1054*/
1055Vector TrackManager::calcDir() const
1056{
1057  return this->currentTrackElem->curve->calcDir((this->localTime - this->currentTrackElem->startingTime)/this->currentTrackElem->duration);
1058}
1059
1060/**
1061 * @returns the current Width of the track
1062*/
1063float TrackManager::getWidth() const
1064{
1065  return this->currentTrackElem->width;
1066}
1067
1068/**
1069 *  Advances the local-time of the Track around dt
1070 * @param dt The time about which to advance.
1071
1072   This function also checks, if the TrackElement has to be changed.
1073*/
1074void TrackManager::tick(float dt)
1075{
1076  PRINTF(4)("CurrentTrackID: %d, LocalTime is: %f, timestep is: %f\n", this->currentTrackElem->ID, this->localTime, dt);
1077  if (this->localTime <= this->firstTrackElem->duration)
1078    this->jumpTo(this->localTime);
1079  if (this->localTime <= this->maxTime)
1080    this->localTime += dt;
1081  if (this->localTime > this->currentTrackElem->endTime
1082      && this->currentTrackElem->children)
1083    {
1084      if (this->currentTrackElem->jumpTime != 0.0)
1085        this->jumpTo(this->localTime + this->currentTrackElem->jumpTime);
1086      // jump to the next TrackElement and also set the history of the new Element to the old one.
1087      TrackElement* tmpHistoryElem = this->currentTrackElem;
1088      this->currentTrackElem = this->currentTrackElem->getChild(this->choosePath(this->currentTrackElem));
1089      this->currentTrackElem->history = tmpHistoryElem;
1090      if (this->currentTrackElem->getName())
1091        {
1092          this->trackText->setText(this->currentTrackElem->getName());
1093          this->textAnimation->replay();
1094        }
1095    }
1096  if (this->bindSlave)
1097    {
1098      Vector tmp = this->calcPos();
1099      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));
1100
1101      Vector v(0.0, 1.0, 0.0);
1102      Quaternion q(-PI/2, v);
1103      quat = quat * q;
1104
1105      this->bindSlave->setAbsCoor(tmp);
1106      this->bindSlave->setAbsDir(quat);
1107    }
1108}
1109
1110/**
1111 *  Jumps to a certain point on the Track.
1112 * @param time The time on the Track to jump to.
1113
1114   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.)
1115   Max is trackLengthMax.
1116*/
1117void TrackManager::jumpTo(float time)
1118{
1119  if (time == 0)
1120    {
1121      this->currentTrackElem = this->firstTrackElem;
1122      if (this->currentTrackElem->getName())
1123        {
1124          this->trackText->setText(this->currentTrackElem->getName());
1125          this->textAnimation->play();
1126        }
1127    }
1128  this->localTime = time;
1129}
1130
1131/**
1132 *  a Function that decides which Path we should follow.
1133 * @param trackElem The Path to choose.
1134
1135*/
1136int TrackManager::choosePath(TrackElement* trackElem)
1137{
1138  return (trackElem->*(trackElem->condFunc))(trackElem->subject);
1139}
1140
1141/**
1142 *  Sets the PNode, that should be moved along the Tack
1143 * @param bindSlave the PNode to set
1144*/
1145void TrackManager::setBindSlave(PNode* bindSlave)
1146{
1147  this->bindSlave = bindSlave;
1148}
1149
1150/**
1151 * @returns the main TrackNode
1152*/
1153PNode* TrackManager::getTrackNode()
1154{
1155  return this->trackNode;
1156}
1157
1158// DEBUG //
1159
1160/**
1161 *  Imports a model of the Graph into the OpenGL-environment.
1162 * @param dt The Iterator used in seconds for Painting the Graph.
1163
1164   This is for testing facility only. Do this if you want to see the Path inside the Level.
1165   eventually this will all be packed into a gl-list.
1166*/
1167void TrackManager::drawGraph(float dt) const
1168{
1169  for (int i = 1; i <= trackElemCount; i++)
1170    {
1171      glBegin(GL_LINE_STRIP);
1172      TrackElement* tmpElem = this->firstTrackElem->findByID(i);
1173      if (tmpElem->curve)
1174        for(float f = 0.0; f < 1.0; f+=dt)
1175          {
1176            //      printf("%f, %f, %f\n",trackManager->calcPos().x, trackManager->calcPos().y, trackManager->calcPos().z);
1177            Vector tmpVector = tmpElem->curve->calcPos(f);
1178            glVertex3f(tmpVector.x, tmpVector.y, tmpVector.z);
1179          }
1180      glEnd();
1181    }
1182}
1183
1184/**
1185 *  outputs debug information about the trackManager
1186 * @param level how much debug
1187*/
1188void TrackManager::debug(unsigned int level) const
1189{
1190  PRINT(0)("=========================================\n");
1191  PRINT(0)("= CLASS TRACKMANAGER::debug information =\n");
1192  PRINT(0)("=========================================\n");
1193  //  PRINT(0)("Status is: %
1194  PRINT(0)(" Consists of %d elements\n", this->trackElemCount);
1195  PRINT(0)(" localTime is: %f\n", this->localTime);
1196  if (level >= 2)
1197    {
1198      for (int i = 1; i <= trackElemCount; i++)
1199        {
1200          TrackElement* tmpElem = this->firstTrackElem->findByID(i);
1201          tmpElem->debug();
1202        }
1203    }
1204  PRINT(0)("-----------------------------------------\n");
1205}
Note: See TracBrowser for help on using the repository browser.