Colony

#include "intersectData.h"

#include "lineDrive.h"

/*

 * 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 indmax is out of bounds.

void insertNode(int key, int featureid, int intersect_num, int node_type, int node_info){

        if(key < NUM_FEATURES)

          NodeData[key] = (featureid<<12) + (intersect_num<<5) + (node_type<<2) + node_info;

        return;

}

void insertIntersection(int key, int intersect_num, int node_type, int intersection_position){

        if(key < NUM_FEATURES)

           NodeData[key] = (INTERSECTION_NODE<<12) + (intersect_num<<5) + (node_type<<2)

               + intersection_position;

        return;

}

void insertRoad(int key, int intersect_num, int node_type, int road_type){

        if(key < NUM_FEATURES)

           NodeData[key] = (ROAD_NODE<<12) + (intersect_num<<5) + (node_type<<2) + road_type;

        return;

}

/*

 * 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 ech map. 

 *

 */

/**********************************************************************NEEDS TO BE FIXED*/

void initializeData(){

        //insert all intersections that are in the map.

        //THIS DATA FOR THE DEMO MAP

/*        insertNode(0, INTERSECTION_NODE, DOUBLE_C, TMIDDLE);

        insertNode(1, ROAD_NODE, ROAD, ROAD_SINGLE);

        insertNode(2, INTERSECTION_NODE, DOUBLE_C, TMIDDLE);

        insertNode(4,ROAD_NODE,ROAD,HIGHWAY);

        insertNode(5,INTERSECTION_NODE,DOUBLE_C,TMIDDLE);        

        insertNode(8,ROAD_NODE,ROAD,ROAD_SINGLE);

        insertNode(10,ROAD_NODE,ROAD,ROAD_SINGLE);

        insertNode(16,INTERSECTION_NODE,DOUBLE_C, TMIDDLE);

*/        return;

}

// Functions to get data from the Database:

int getFeatureId(int key)

{

        if(key < NUM_FEATURES)

          return (NodeData[key]>>12)&15;

        else return -1;

}

int getIntersectType(int key){

        if(key < NUM_FEATURES && getFeatureId(key) == INTERSECTION_NODE)

                return (NodeData[key]>>2)&7;

        else return -1;

}

int getIntersectPos(int key){

        if(key < NUM_FEATURES && getFeatureId(key) == INTERSECTION_NODE)

                return (NodeData[key])&3;

        else return -1;

}

int getRoadType(int key){

        if(key < NUM_FEATURES && getFeatureId(key) == ROAD_NODE)

                return (NodeData[key]>>2)&7;

        else return -1;

}

int getRoadInfo(int key){

        if(key < NUM_FEATURES && getFeatureId(key) == ROAD_NODE)

                return (NodeData[key])&3;

        else return -1;

}

int getIntersectNum(int key){

        if(key < NUM_FEATURES && getFeatureId(key) == INTERSECTION_NODE) 

                return (NodeData[key]>>5)&127;

        else return -1;

}