![](/media/cache/img/default_profile.jpg.50x50_q85.jpg)
tao lao
Dependencies: mbed wave_player 4DGL-uLCD-SE MMA8452
map.cpp
- Committer:
- hnguyen403
- Date:
- 2020-11-24
- Revision:
- 3:33bf11645fe1
- Parent:
- 2:4947d6a82971
File content as of revision 3:33bf11645fe1:
// Copyright 2020 Georgia Tech. All rights reserved. // The materials provided by the instructor in this course are for // the use of the students currently enrolled in the course. // Copyrighted course materials may not be further disseminated. // This file must not be made publicly available anywhere. #include "map.h" #include "globals.h" #include "graphics.h" /** * The Map structure. This holds a HashTable for all the MapItems, along with * values for the width and height of the Map. */ struct Map { HashTable* items; int w, h; }; #define NUM_MAPS 1 #define MAP_WIDTH 50 #define MAP_HEIGHT 50 static Map maps[NUM_MAPS]; static int active_map; static const MapItem CLEAR_SENTINEL = { .type = CLEAR, .draw = draw_nothing }; /** * The first step in HashTable access for the map is turning the two-dimensional * key information (x, y) into a one-dimensional unsigned integer. * This function should uniquely map (x,y) onto the space of unsigned integers. */ static unsigned XY_KEY(int X, int Y) { return X*maps[0].h + Y; } /** * This is the hash function actually passed into createHashTable. It takes an * unsigned key (the output of XY_KEY) and turns it into a hash value (some * small non-negative integer). */ unsigned map_hash(unsigned key) { return key%(NUM_MAPS); } void maps_init() { maps[0].items = createHashTable(map_hash, NUM_MAPS); maps[0].w = MAP_WIDTH; maps[0].h = MAP_HEIGHT; } Map* get_active_map() { return &maps[active_map]; } Map* set_active_map(int m) { active_map = m; return &maps[active_map]; } void print_map() { char lookup[] = {'W', 'D', 'P', 'A', 'K', 'C', 'N',' ','S'}; Map* map = get_active_map(); for(int j = 0; j < map->h; j++) { for (int i = 0; i < map->w; i++) { MapItem* item = (MapItem*)getItem(map->items, XY_KEY(i, j)); if (item) pc.printf("%c", lookup[item->type]); else pc.printf(" "); } pc.printf("\r\n"); } } int map_width() { return get_active_map()->w; } int map_height() { return get_active_map()->h; } int map_area() { return map_width() * map_height(); } MapItem* get_north(int x, int y) { return get_here(x, y-1); } MapItem* get_south(int x, int y) { return get_here(x, y+1); } MapItem* get_east(int x, int y) { return get_here(x+1, y); } MapItem* get_west(int x, int y) { return get_here(x-1, y); } MapItem* get_here(int x, int y) { return (MapItem*) getItem(get_active_map()->items, XY_KEY(x, y)); } void map_erase(int x, int y) { MapItem* item = get_here(x, y); if (item && item->data) free(item->data); deleteItem(get_active_map()->items, XY_KEY(x, y)); } void add_wall(int x, int y, int dir, int len) { for(int i = 0; i < len; i++) { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = WALL; w1->draw = draw_wall; w1->walkable = false; w1->data = NULL; unsigned key = (dir == HORIZONTAL) ? XY_KEY(x+i, y) : XY_KEY(x, y+i); void* val = insertItem(get_active_map()->items, key, w1); if (val) free(val); // If something is already there, free it } } void add_plant(int x, int y) { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = PLANT; w1->draw = draw_plant; w1->walkable = false; w1->data = NULL; void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); if (val) free(val); // If something is already there, free it } void add_goodie(int x, int y) { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = GOODIE; w1->draw = draw_goodie; w1->walkable = true; w1->data = NULL; void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); if (val) free(val); // If something is already there, free it } void remove_goodie(int x, int y) // I'm lazy so overwrite it with a plant { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = PLANT; w1->draw = draw_plant; w1->walkable = true; w1->data = NULL; void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); if (val) free(val); // If something is already there, free it } void add_snake_body(int x, int y) { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = SNAKE_BODY; w1->draw = draw_snake_body; w1->walkable = false; w1->data = NULL; void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); if (val) free(val); // If something is already there, free it } void add_snake_head(int x, int y) { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = SNAKE_BODY; w1->draw = draw_snake_head; w1->walkable = false; w1->data = NULL; void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); if (val) free(val); // If something is already there, free it } void add_snake_tail(int x, int y) { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = SNAKE_BODY; w1->draw = draw_snake_tail; w1->walkable = false; w1->data = NULL; void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); if (val) free(val); // If something is already there, free it } void add_nothing(int x, int y) { MapItem* w1 = (MapItem*) malloc(sizeof(MapItem)); w1->type = CLEAR; w1->draw = draw_nothing; w1->walkable = true; w1->data = NULL; void* val = insertItem(get_active_map()->items, XY_KEY(x, y), w1); if (val) free(val); // If something is already there, free it }