Colony

#include "intersectData.h"

/*

 * This function serves to make the code for the intersection database

 * as reuseable as possible. This part initializes the data and is the

 * only one that needs to be rewritten for each map. 

 *

 */

void initializeData(){

        //insert all intersections that are in the map.

        insertIntersection(0, 0,  INTERSECTION_DOUBLE_C, TMIDDLE);

        return;

}

/*

 * This function serves to make the code for the intersection database

 * as reuseable as possible. This part creates the implementation of the

 * database that can be copied over for all projects.  

 *

 */

// Does nothing if your indmaex is out of bounds.

void insertIntersection(int key, int featureid, int intersect_type, int intersect_position){

//        if (key < sizeof(IntersectData)/sizeof(int))

        if(key < NUM_INTERSECTIONS)

          IntersectData[key] = (featureid << 12) + intersect_type + intersect_position;

        return;

}

// Functions to get data from the Database:

//@TODO:Add some checks to make sure the key is less than NUM_INTERSECTIONS

//        also: figure out what to do when this happens.

int getIntersectType(int key){

        return (IntersectData[key])&28; // 28 == 11100;

}

int getIntersectPos(int key){

        return (IntersectData[key])&3;

}

int getFeatureId(int key)

{

        return (IntersectData[key] >> 12)&0xF;

}