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.

        //THIS DATA FOR THE DEMO MAP

        insertNode(0, INTERSECTION_NODE, INTERSECTION_DOUBLE_C, TMIDDLE);

        insertNode(1, ROAD_NODE, ROAD, ROAD_DOUBLE);

        insertNode(2, ROAD_NODE, ROAD, ROAD_DOUBLE);

        insertNode(3, ROAD_NODE, ROAD, ROAD_DOUBLE);

        insertNode(4, ROAD_NODE, ROAD, ROAD_DOUBLE);

        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 insertNode(int key, int featureid, int node_type, int node_info){

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

        if(key < NUM_FEATURES)

          IntersectData[key] = featureid + node_type + node_info;

        return;

}

// Functions to get data from the Database:

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

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

//        Add checks to see if we call getIntersect...() on intersections

//        and getRoad...() on roads.

int getIntersectType(int key){

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

}

int getTurningIntersect(int key){

        switch(getIntersectType(key))

        {

                case INTERSECTION_SINGLE:

                        return SINGLE;

                case INTERSECTION_DOUBLE_C:

                case INTERSECTION_DOUBLE_T:

                        return DOUBLE;

                case INTERSECTION_ON_RAMP:

                        return ON_RAMP;

                case INTERSECTION_OFF_RAMP:

                        return OFF_RAMP;

        }

}

int getIntersectPos(int key){

        return (IntersectData[key])&3;

}

int getFeatureId(int key)

{

        return (IntersectData[key])&61440;  // 61220 == (15<<12);

}

int getRoadType(int key){

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

}

int getRoadInfo(int key){

        return (IntersectData[key])&3;

}