Search  

---

C:/temp/src/j2k/QNX4/Train/Track.cpp

Go to the documentation of this file.

#ifndef __J2K__Train__Track_CPP__
#define __J2K__Train__Track_CPP__

Track::Track()
{
  initSegments();
  initSwitches();
  initGeometry();

  //testSwitches();
}


void Track::initSegments()
{
  int i;
  for( i = 0; i < NSEG; i++ ) {
    segment[i].setSegmentID(i+1);
  }
}

void Track::initSwitches()
{
  int i;

  // Initialize (close) the switches...
  for( i = 0; i < NSW; i++ ) {
    switch[i].setSwitchID(i+1);
  }
}

void Track::initGeometry()
{
  // The following assumes that ALL switches are closed (inner track connected).
  // Create the geometry by linking the segment IDs (not the array indices!)

  segment[ 1-1].setNext(2);
  segment[ 2-1].setNext(5);
  segment[ 3-1].setNext(4);
  segment[ 4-1].setNext(7);
  segment[ 5-1].setNext(6);
  segment[ 6-1].setNext(7);
  segment[ 7-1].setNext(8);
  segment[ 8-1].setNext(9);
  segment[ 9-1].setNext(10);
  segment[10-1].setNext(11);
  segment[11-1].setNext(12);
  segment[12-1].setNext(15);
  segment[13-1].setNext(14);
  segment[14-1].setNext(15);
  segment[15-1].setNext(16);
  segment[16-1].setNext(1);

  segment[ 1-1].setPrev(16);
  segment[ 2-1].setPrev(1);
  segment[ 3-1].setPrev(2);
  segment[ 4-1].setPrev(3);
  segment[ 5-1].setPrev(2);
  segment[ 6-1].setPrev(5);
  segment[ 7-1].setPrev(6);
  segment[ 8-1].setPrev(7);
  segment[ 9-1].setPrev(8);
  segment[10-1].setPrev(9);
  segment[11-1].setPrev(10);
  segment[12-1].setPrev(11);
  segment[13-1].setPrev(10);
  segment[14-1].setPrev(13);
  segment[15-1].setPrev(12);
  segment[16-1].setPrev(15);

  showGeometry();
}

void Track::showGeometry()
{
  int ID;
  printf("Track Geometry\n==============\n\n");

  for( ID = 1; ID <= NSEG; ID++) {
    printf("(%2d) --> %2d\t", ID, segment[ID-1].getNext() );

    if ( ID % 4 == 0 ) {  printf("\n"); }
  }                                                                                    

  printf("\n\n\n");
  for( ID = 1; ID <= NSEG; ID++) {
    printf("(%2d) <-- %2d\t", ID, segment[ID-1].getPrev() );
    if ( ID % 4 == 0 ) {  printf("\n"); }
  }                                                                                    
                                                                                             
  printf("\n\n");          
}

Track::~Track() { }

void Track::testSwitches()
{
  delay( 5000 );   // DEBUG!!!!

  for( int Sw = 1; Sw <= NSW; Sw++ ) {
    setSwitch( Sw, 1 );
    delay( 250 );

    setSwitch( Sw, 0 );
    delay( 250 );
  }
}

int Track::isSegmentOccupied(int Seg)
{
  if ( Seg >= 1 && Seg <= NSEG ) {     // Validation
    return  segment[Seg-1].isOccupied();
  } else {
    printf("Track ERROR - isActive: Zone out of range\a\n");
    exit(1);
    return  0;
  }
}

void Track::setSwitch(int S, int P) {
  if ( Seg >= 1 && Seg <= NSEG ) {     // Validation
    switch[S-1].setSwitch(P);
    updateTrack(S,P);
  } else {
    printf("Track ERROR - setSwitch: Switch out of range\a\n");
    exit(1);
  }
}

void Track::updateTrack(int ID, int P) {
  // the following code is to update the track
  if ( P == OPEN ) {
    switch( ID ) {
      case 1: segment[2-1].setNext(3);
              segment[3-1].setPrev(2);
              segment[5-1].setPrev(2);
              break;  // Update the next segment of segment 2

      case 2: segment[7-1].setPrev(4);
              segment[4-1].setNext(7);
              segment[6-1].setNext(7);
              break;  // Update the previous segment of segment 7

      case 3: segment[10-1].setNext(13);
              segment[13-1].setPrev(10);
              segment[11-1].setPrev(10);
              break;  // Update the next segment of segment 10

      case 4: segment[15-1].setPrev(14);
              segment[14-1].setNext(15);
              segment[12-1].setNext(15);
              break;  // Update the previous segment of segment 15
    }

  } else {
    switch( ID ) {
     case 1: segment[2-1].setNext(5);
             segment[3-1].setPrev(2);
             segment[5-1].setPrev(2);
             break;   // Update the next segment of segment 2

     case 2: segment[7-1].setPrev(6);                                                  
             segment[4-1].setNext(7);
             segment[6-1].setNext(7);
             break;   // Update the previous segment of segment 7                            

     case 3: segment[10-1].setNext(11);
             segment[13-1].setPrev(10);
             segment[11-1].setPrev(10);
             break;   // Update the next segment of segment 10

     case 4: segment[15-1].setPrev(12);
             segment[14-1].setNext(15);
             segment[12-1].setNext(15);
             break;  //update the previous segment of segment 15                           
    }   
  }
}

int Track::GetNext( int s )
{
  return segment[s-1].getNext();
}

int Track::GetPrev( int s ) 
{
  return segment[s-1].getPrev();
}

#endif

---