Project

General

Profile

Revision 1982

Update intersectData.{c,h} to reflect new demo map. Renumbered intersections.
Created macro UNUSED_INTER, an intersection number that signifies that a node is
not in use. Use it to initialize the arrray for indices that do not correspond
to meaningful barcodes.

View differences:

intersectData.c
39 39
void initializeData(){
40 40
    //insert all intersections that are in the map.
41 41
    //THIS DATA FOR THE DEMO MAP
42
    insertIntersection(0, 1, SINGLE, SACROSS);
43
    insertIntersection(1, 1, SINGLE, SUP);
44
    insertIntersection(2, 2, SINGLE, SUP);
45
    insertIntersection(3, 2, SINGLE, SACROSS);
46
    insertIntersection(4, 3, DOUBLE_C, CLEFT);
47
    insertIntersection(5, 3, DOUBLE_C, CTOP);
48
    insertIntersection(6, 3, DOUBLE_C, CRIGHT);
49
    insertIntersection(7, 3, DOUBLE_C, CBOT);
50
    insertIntersection(8, 5, DOUBLE_T, TLEFT);
51
    insertIntersection(9, 5, DOUBLE_T, TMIDDLE);
52
    insertIntersection(10, 5, DOUBLE_T, TRIGHT);
53
    insertIntersection(11, 6, ON_RAMP, R_LEFT);
54
    insertIntersection(12, 6, ON_RAMP, R_RAMP);
55
    insertIntersection(13, 6, ON_RAMP, R_RIGHT);
56
    insertIntersection(14, 4, OFF_RAMP, R_RIGHT);
57
    insertIntersection(15, 4, OFF_RAMP, R_RAMP);
58
    insertIntersection(16, 4, OFF_RAMP, R_LEFT);
42
    insertIntersection(0, UNUSED_INTER, 0, 0);
43
    insertIntersection(1, 1, SINGLE, SACROSS);
44
    insertIntersection(2, UNUSED_INTER, 0, 0);
45
    insertIntersection(3, 3, DOUBLE_C, CBOT);
46
    insertIntersection(4, UNUSED_INTER, 0, 0);
47
    insertIntersection(5, 5, DOUBLE_T, TMIDDLE);
48
    insertIntersection(6, 3, DOUBLE_C, CLEFT);
49
    insertIntersection(7, 5, DOUBLE_T, TRIGHT);
50
    insertIntersection(8, UNUSED_INTER, 0, 0);
51
    insertIntersection(9, 5, DOUBLE_T, TLEFT);
52
    insertIntersection(10, UNUSED_INTER, 0, 0);
53
    insertIntersection(11, 1, SINGLE, SUP);
54
    insertIntersection(12, UNUSED_INTER, 0, 0);
55
    insertIntersection(13, 2, SINGLE, SUP);
56
    insertIntersection(14, 3, DOUBLE_C, CRIGHT);
57
    insertIntersection(15, 3, DOUBLE_C, CTOP);
58
    insertIntersection(16, 2, SINGLE, SACROSS);
59 59
    return;
60 60
}
61 61

  

Also available in: Unified diff