Adventure game written for ECE2035 at the Georgia Institute of Technology
Dependencies: mbed wave_player 4DGL-uLCD-SE MMA8452
map.cpp@3:289762133fd6, 2018-04-18 (annotated)
- Committer:
- trmontgomery
- Date:
- Wed Apr 18 20:18:51 2018 +0000
- Revision:
- 3:289762133fd6
- Parent:
- 2:0876296d9473
- Child:
- 4:cdc54191ff07
The second map works!
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
rconnorlawson | 0:35660d7952f7 | 1 | #include "map.h" |
rconnorlawson | 0:35660d7952f7 | 2 | |
rconnorlawson | 0:35660d7952f7 | 3 | #include "globals.h" |
rconnorlawson | 0:35660d7952f7 | 4 | #include "graphics.h" |
rconnorlawson | 0:35660d7952f7 | 5 | |
rconnorlawson | 0:35660d7952f7 | 6 | /** |
rconnorlawson | 0:35660d7952f7 | 7 | * The Map structure. This holds a HashTable for all the MapItems, along with |
rconnorlawson | 0:35660d7952f7 | 8 | * values for the width and height of the Map. |
rconnorlawson | 0:35660d7952f7 | 9 | */ |
trmontgomery | 3:289762133fd6 | 10 | |
rconnorlawson | 0:35660d7952f7 | 11 | |
rconnorlawson | 0:35660d7952f7 | 12 | /** |
rconnorlawson | 0:35660d7952f7 | 13 | * Storage area for the maps. |
rconnorlawson | 0:35660d7952f7 | 14 | * This is a global variable, but can only be access from this file because it |
rconnorlawson | 0:35660d7952f7 | 15 | * is static. |
rconnorlawson | 0:35660d7952f7 | 16 | */ |
trmontgomery | 2:0876296d9473 | 17 | static Map maps[2]; |
rconnorlawson | 0:35660d7952f7 | 18 | static int active_map; |
rconnorlawson | 0:35660d7952f7 | 19 | |
rconnorlawson | 0:35660d7952f7 | 20 | /** |
rconnorlawson | 0:35660d7952f7 | 21 | * The first step in HashTable access for the map is turning the two-dimensional |
rconnorlawson | 0:35660d7952f7 | 22 | * key information (x, y) into a one-dimensional unsigned integer. |
rconnorlawson | 0:35660d7952f7 | 23 | * This function should uniquely map (x,y) onto the space of unsigned integers. |
rconnorlawson | 0:35660d7952f7 | 24 | */ |
rconnorlawson | 0:35660d7952f7 | 25 | static unsigned XY_KEY(int X, int Y) { |
trmontgomery | 3:289762133fd6 | 26 | Map * m = get_active_map(); |
trmontgomery | 3:289762133fd6 | 27 | return (m->w)*Y + X; |
rconnorlawson | 0:35660d7952f7 | 28 | } |
rconnorlawson | 0:35660d7952f7 | 29 | |
rconnorlawson | 0:35660d7952f7 | 30 | /** |
rconnorlawson | 0:35660d7952f7 | 31 | * This is the hash function actually passed into createHashTable. It takes an |
rconnorlawson | 0:35660d7952f7 | 32 | * unsigned key (the output of XY_KEY) and turns it into a hash value (some |
rconnorlawson | 0:35660d7952f7 | 33 | * small non-negative integer). |
rconnorlawson | 0:35660d7952f7 | 34 | */ |
rconnorlawson | 0:35660d7952f7 | 35 | unsigned map_hash(unsigned key) |
rconnorlawson | 0:35660d7952f7 | 36 | { |
rconnorlawson | 0:35660d7952f7 | 37 | // TODO: Fix me! |
trmontgomery | 2:0876296d9473 | 38 | return key%5; |
rconnorlawson | 0:35660d7952f7 | 39 | } |
rconnorlawson | 0:35660d7952f7 | 40 | |
trmontgomery | 3:289762133fd6 | 41 | void maps_init(int h, int w, int buckets) |
rconnorlawson | 0:35660d7952f7 | 42 | { |
trmontgomery | 3:289762133fd6 | 43 | Map * m = get_active_map(); |
trmontgomery | 3:289762133fd6 | 44 | m->items = createHashTable(map_hash, buckets); |
trmontgomery | 3:289762133fd6 | 45 | m->w = w; |
trmontgomery | 3:289762133fd6 | 46 | m->h = h; |
rconnorlawson | 0:35660d7952f7 | 47 | } |
rconnorlawson | 0:35660d7952f7 | 48 | |
rconnorlawson | 0:35660d7952f7 | 49 | Map* get_active_map() |
rconnorlawson | 0:35660d7952f7 | 50 | { |
trmontgomery | 3:289762133fd6 | 51 | |
trmontgomery | 3:289762133fd6 | 52 | return &(maps[active_map]); |
rconnorlawson | 0:35660d7952f7 | 53 | } |
rconnorlawson | 0:35660d7952f7 | 54 | |
rconnorlawson | 0:35660d7952f7 | 55 | Map* set_active_map(int m) |
rconnorlawson | 0:35660d7952f7 | 56 | { |
rconnorlawson | 0:35660d7952f7 | 57 | active_map = m; |
trmontgomery | 3:289762133fd6 | 58 | return &(maps[active_map]); |
rconnorlawson | 0:35660d7952f7 | 59 | } |
rconnorlawson | 0:35660d7952f7 | 60 | |
rconnorlawson | 0:35660d7952f7 | 61 | void print_map() |
rconnorlawson | 0:35660d7952f7 | 62 | { |
rconnorlawson | 0:35660d7952f7 | 63 | // As you add more types, you'll need to add more items to this array. |
rconnorlawson | 0:35660d7952f7 | 64 | char lookup[] = {'W', 'P'}; |
rconnorlawson | 0:35660d7952f7 | 65 | for(int y = 0; y < map_height(); y++) |
rconnorlawson | 0:35660d7952f7 | 66 | { |
rconnorlawson | 0:35660d7952f7 | 67 | for (int x = 0; x < map_width(); x++) |
rconnorlawson | 0:35660d7952f7 | 68 | { |
rconnorlawson | 0:35660d7952f7 | 69 | MapItem* item = get_here(x,y); |
rconnorlawson | 0:35660d7952f7 | 70 | if (item) pc.printf("%c", lookup[item->type]); |
rconnorlawson | 0:35660d7952f7 | 71 | else pc.printf(" "); |
rconnorlawson | 0:35660d7952f7 | 72 | } |
rconnorlawson | 0:35660d7952f7 | 73 | pc.printf("\r\n"); |
rconnorlawson | 0:35660d7952f7 | 74 | } |
rconnorlawson | 0:35660d7952f7 | 75 | } |
rconnorlawson | 0:35660d7952f7 | 76 | |
rconnorlawson | 0:35660d7952f7 | 77 | int map_width() |
rconnorlawson | 0:35660d7952f7 | 78 | { |
trmontgomery | 3:289762133fd6 | 79 | Map * m = get_active_map(); |
trmontgomery | 3:289762133fd6 | 80 | return m->w; |
rconnorlawson | 0:35660d7952f7 | 81 | } |
rconnorlawson | 0:35660d7952f7 | 82 | |
rconnorlawson | 0:35660d7952f7 | 83 | int map_height() |
rconnorlawson | 0:35660d7952f7 | 84 | { |
trmontgomery | 3:289762133fd6 | 85 | Map * m = get_active_map(); |
trmontgomery | 3:289762133fd6 | 86 | return m->h; |
rconnorlawson | 0:35660d7952f7 | 87 | } |
rconnorlawson | 0:35660d7952f7 | 88 | |
rconnorlawson | 0:35660d7952f7 | 89 | int map_area() |
rconnorlawson | 0:35660d7952f7 | 90 | { |
trmontgomery | 3:289762133fd6 | 91 | Map * m = get_active_map(); |
trmontgomery | 3:289762133fd6 | 92 | return (m->h)*(m->w); |
rconnorlawson | 0:35660d7952f7 | 93 | } |
rconnorlawson | 0:35660d7952f7 | 94 | |
rconnorlawson | 0:35660d7952f7 | 95 | MapItem* get_north(int x, int y) |
rconnorlawson | 0:35660d7952f7 | 96 | { |
trmontgomery | 2:0876296d9473 | 97 | Map* map = get_active_map(); |
trmontgomery | 2:0876296d9473 | 98 | //get key of item north of the location |
trmontgomery | 2:0876296d9473 | 99 | int index = XY_KEY(x, y-1); |
trmontgomery | 2:0876296d9473 | 100 | return (MapItem*)getItem(map->items, index); |
rconnorlawson | 0:35660d7952f7 | 101 | } |
rconnorlawson | 0:35660d7952f7 | 102 | |
rconnorlawson | 0:35660d7952f7 | 103 | MapItem* get_south(int x, int y) |
rconnorlawson | 0:35660d7952f7 | 104 | { |
trmontgomery | 2:0876296d9473 | 105 | Map* map = get_active_map(); |
trmontgomery | 2:0876296d9473 | 106 | int index = XY_KEY(x, y+1); |
trmontgomery | 2:0876296d9473 | 107 | return (MapItem*)getItem(map->items, index); |
rconnorlawson | 0:35660d7952f7 | 108 | } |
rconnorlawson | 0:35660d7952f7 | 109 | |
rconnorlawson | 0:35660d7952f7 | 110 | MapItem* get_east(int x, int y) |
rconnorlawson | 0:35660d7952f7 | 111 | { |
trmontgomery | 2:0876296d9473 | 112 | Map* map = get_active_map(); |
trmontgomery | 2:0876296d9473 | 113 | int index = XY_KEY(x-1, y); //wtf why does this work boi |
trmontgomery | 2:0876296d9473 | 114 | return (MapItem*)getItem(map->items, index); |
rconnorlawson | 0:35660d7952f7 | 115 | } |
rconnorlawson | 0:35660d7952f7 | 116 | |
rconnorlawson | 0:35660d7952f7 | 117 | MapItem* get_west(int x, int y) |
rconnorlawson | 0:35660d7952f7 | 118 | { |
trmontgomery | 2:0876296d9473 | 119 | Map* map = get_active_map(); |
trmontgomery | 2:0876296d9473 | 120 | int index = XY_KEY(x+1, y); //shouldn't this be minus? |
trmontgomery | 2:0876296d9473 | 121 | return (MapItem*)getItem(map->items, index); |
rconnorlawson | 0:35660d7952f7 | 122 | } |
rconnorlawson | 0:35660d7952f7 | 123 | |
rconnorlawson | 0:35660d7952f7 | 124 | MapItem* get_here(int x, int y) |
rconnorlawson | 0:35660d7952f7 | 125 | { |
trmontgomery | 2:0876296d9473 | 126 | Map* map = get_active_map(); |
trmontgomery | 2:0876296d9473 | 127 | int index = XY_KEY(x, y); |
trmontgomery | 2:0876296d9473 | 128 | return (MapItem*)getItem(map->items, index); |
rconnorlawson | 0:35660d7952f7 | 129 | } |
rconnorlawson | 0:35660d7952f7 | 130 | |
rconnorlawson | 0:35660d7952f7 | 131 | |
rconnorlawson | 0:35660d7952f7 | 132 | void map_erase(int x, int y) |
rconnorlawson | 0:35660d7952f7 | 133 | { |
trmontgomery | 2:0876296d9473 | 134 | Map* map = get_active_map(); |
trmontgomery | 2:0876296d9473 | 135 | int index = XY_KEY(x, y); |
trmontgomery | 2:0876296d9473 | 136 | deleteItem(map->items, index); |
trmontgomery | 2:0876296d9473 | 137 | } |
trmontgomery | 2:0876296d9473 | 138 | |
trmontgomery | 2:0876296d9473 | 139 | void omni(){ |
trmontgomery | 2:0876296d9473 | 140 | Map* map = get_active_map(); |
trmontgomery | 2:0876296d9473 | 141 | int h = map -> h; |
trmontgomery | 2:0876296d9473 | 142 | int w = map -> w; |
trmontgomery | 2:0876296d9473 | 143 | for (int i = 0; i < h; i++){ |
trmontgomery | 2:0876296d9473 | 144 | for(int j = 0; j < w; j++){ |
trmontgomery | 2:0876296d9473 | 145 | MapItem* object = (MapItem*)getItem(map->items, XY_KEY(i,j)); |
trmontgomery | 2:0876296d9473 | 146 | if(object) object -> walkable = true; |
trmontgomery | 2:0876296d9473 | 147 | } |
trmontgomery | 2:0876296d9473 | 148 | } |
rconnorlawson | 0:35660d7952f7 | 149 | } |
rconnorlawson | 0:35660d7952f7 | 150 | |
rconnorlawson | 0:35660d7952f7 | 151 | void add_wall(int x, int y, int dir, int len) |
rconnorlawson | 0:35660d7952f7 | 152 | { |
rconnorlawson | 0:35660d7952f7 | 153 | for(int i = 0; i < len; i++) |
rconnorlawson | 0:35660d7952f7 | 154 | { |
rconnorlawson | 0:35660d7952f7 | 155 | MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); |
rconnorlawson | 0:35660d7952f7 | 156 | w1->type = WALL; |
rconnorlawson | 0:35660d7952f7 | 157 | w1->draw = draw_wall; |
rconnorlawson | 0:35660d7952f7 | 158 | w1->walkable = false; |
rconnorlawson | 0:35660d7952f7 | 159 | w1->data = NULL; |
rconnorlawson | 0:35660d7952f7 | 160 | unsigned key = (dir == HORIZONTAL) ? XY_KEY(x+i, y) : XY_KEY(x, y+i); |
rconnorlawson | 0:35660d7952f7 | 161 | void* val = insertItem(get_active_map()->items, key, w1); |
rconnorlawson | 0:35660d7952f7 | 162 | if (val) free(val); // If something is already there, free it |
rconnorlawson | 0:35660d7952f7 | 163 | } |
rconnorlawson | 0:35660d7952f7 | 164 | } |
rconnorlawson | 0:35660d7952f7 | 165 | |
rconnorlawson | 0:35660d7952f7 | 166 | void add_plant(int x, int y) |
rconnorlawson | 0:35660d7952f7 | 167 | { |
rconnorlawson | 0:35660d7952f7 | 168 | MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); |
rconnorlawson | 0:35660d7952f7 | 169 | w1->type = PLANT; |
rconnorlawson | 0:35660d7952f7 | 170 | w1->draw = draw_plant; |
rconnorlawson | 0:35660d7952f7 | 171 | w1->walkable = true; |
rconnorlawson | 0:35660d7952f7 | 172 | w1->data = NULL; |
rconnorlawson | 0:35660d7952f7 | 173 | void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); |
rconnorlawson | 0:35660d7952f7 | 174 | if (val) free(val); // If something is already there, free it |
trmontgomery | 2:0876296d9473 | 175 | } |
trmontgomery | 2:0876296d9473 | 176 | |
trmontgomery | 2:0876296d9473 | 177 | void add_rock(int x, int y) |
trmontgomery | 2:0876296d9473 | 178 | { |
trmontgomery | 2:0876296d9473 | 179 | MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); |
trmontgomery | 2:0876296d9473 | 180 | w1->type = ROCK; |
trmontgomery | 2:0876296d9473 | 181 | w1->draw = draw_rock; |
trmontgomery | 2:0876296d9473 | 182 | w1->walkable = false; |
trmontgomery | 2:0876296d9473 | 183 | Rock* r = (Rock*) malloc(sizeof(Rock)); |
trmontgomery | 2:0876296d9473 | 184 | //r -> is_pushed = false; |
trmontgomery | 2:0876296d9473 | 185 | //r -> wall_touch = false; |
trmontgomery | 2:0876296d9473 | 186 | //r -> x = x; |
trmontgomery | 2:0876296d9473 | 187 | //r -> y = y; |
trmontgomery | 2:0876296d9473 | 188 | w1->data = r; |
trmontgomery | 2:0876296d9473 | 189 | void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); |
trmontgomery | 2:0876296d9473 | 190 | if (val) free(val); // If something is already there, free it |
trmontgomery | 2:0876296d9473 | 191 | } |
trmontgomery | 2:0876296d9473 | 192 | |
trmontgomery | 2:0876296d9473 | 193 | void add_npc(int x, int y) |
trmontgomery | 2:0876296d9473 | 194 | { |
trmontgomery | 2:0876296d9473 | 195 | MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); |
trmontgomery | 2:0876296d9473 | 196 | w1->type = NPC; |
trmontgomery | 2:0876296d9473 | 197 | w1->draw = draw_npc; |
trmontgomery | 2:0876296d9473 | 198 | w1->walkable = false; |
trmontgomery | 2:0876296d9473 | 199 | NonPlayer* npc = (NonPlayer*) malloc(sizeof(NonPlayer)); |
trmontgomery | 2:0876296d9473 | 200 | npc->quest_requested = false; |
trmontgomery | 2:0876296d9473 | 201 | npc->quest_complete = false; |
trmontgomery | 2:0876296d9473 | 202 | npc->has_key = true; |
trmontgomery | 2:0876296d9473 | 203 | w1->data = npc; |
trmontgomery | 2:0876296d9473 | 204 | void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); |
trmontgomery | 2:0876296d9473 | 205 | if (val) free(val); // If something is already there, free it |
trmontgomery | 2:0876296d9473 | 206 | } |
trmontgomery | 2:0876296d9473 | 207 | |
trmontgomery | 2:0876296d9473 | 208 | void add_door(int x, int y) |
trmontgomery | 2:0876296d9473 | 209 | { |
trmontgomery | 2:0876296d9473 | 210 | MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); |
trmontgomery | 2:0876296d9473 | 211 | w1->type = DOOR; |
trmontgomery | 2:0876296d9473 | 212 | w1->draw = draw_door; |
trmontgomery | 2:0876296d9473 | 213 | w1->walkable = false; |
trmontgomery | 2:0876296d9473 | 214 | int o = false; |
trmontgomery | 2:0876296d9473 | 215 | w1->data = &o; |
trmontgomery | 2:0876296d9473 | 216 | void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); |
trmontgomery | 2:0876296d9473 | 217 | if (val) free(val); // If something is already there, free it |
trmontgomery | 2:0876296d9473 | 218 | } |
trmontgomery | 2:0876296d9473 | 219 | |
trmontgomery | 2:0876296d9473 | 220 | void add_goal(int x, int y) |
trmontgomery | 2:0876296d9473 | 221 | { |
trmontgomery | 2:0876296d9473 | 222 | MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); |
trmontgomery | 2:0876296d9473 | 223 | w1->type = GOAL; |
trmontgomery | 2:0876296d9473 | 224 | w1->draw = draw_goal; |
trmontgomery | 2:0876296d9473 | 225 | w1->walkable = false; |
trmontgomery | 2:0876296d9473 | 226 | int o = false; |
trmontgomery | 2:0876296d9473 | 227 | w1->data = &o; |
trmontgomery | 2:0876296d9473 | 228 | void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); |
trmontgomery | 2:0876296d9473 | 229 | if (val) free(val); // If something is already there, free it |
trmontgomery | 2:0876296d9473 | 230 | } |
trmontgomery | 2:0876296d9473 | 231 | |
trmontgomery | 2:0876296d9473 | 232 | void add_spike(int x, int y) |
trmontgomery | 2:0876296d9473 | 233 | { |
trmontgomery | 2:0876296d9473 | 234 | MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); |
trmontgomery | 2:0876296d9473 | 235 | w1->type = SPIKE; |
trmontgomery | 2:0876296d9473 | 236 | w1->draw = draw_spike; |
trmontgomery | 2:0876296d9473 | 237 | w1->walkable = false; |
trmontgomery | 2:0876296d9473 | 238 | int o = false; |
trmontgomery | 2:0876296d9473 | 239 | w1->data = &o; |
trmontgomery | 2:0876296d9473 | 240 | void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); |
trmontgomery | 2:0876296d9473 | 241 | if (val) free(val); // If something is already there, free it |
rconnorlawson | 0:35660d7952f7 | 242 | } |