162 lines
3.9 KiB
C++
162 lines
3.9 KiB
C++
#include "Tilemap.h"
|
|
#include "vec2i.h"
|
|
#include "Actor.h"
|
|
#include "Renderer.h"
|
|
#include "Tileset.h"
|
|
#include "FieldOfView.h"
|
|
#include <SDL2/SDL.h>
|
|
|
|
int Tilemap::get_index(int x, int y) {
|
|
return y * width + x;
|
|
}
|
|
|
|
Tilemap::Tilemap(int width, int height) {
|
|
this->width = width;
|
|
this->height = height;
|
|
tilemap = std::vector<unsigned int>(width*height, 0);
|
|
}
|
|
|
|
Tilemap::~Tilemap() {
|
|
for (auto var : entities) {
|
|
delete var;
|
|
}
|
|
}
|
|
|
|
int Tilemap::get_width() {
|
|
return width;
|
|
}
|
|
|
|
int Tilemap::get_height() {
|
|
return height;
|
|
}
|
|
|
|
bool Tilemap::is_inside_bounds(int x, int y) {
|
|
return x >= 0 && x < width && y >= 0 && y < height;
|
|
}
|
|
|
|
std::vector<vec2i> Tilemap::get_neighbours(int x, int y, int range) {
|
|
return get_neighbours(x, y, range, range, range, range);
|
|
}
|
|
|
|
std::vector<vec2i> Tilemap::get_neighbours(int x, int y, int up, int down, int left, int right) {
|
|
std::vector<vec2i> neigh;
|
|
for (int dx = -left; dx <= right; dx++) {
|
|
for (int dy = -up; dy <= down; dy++) {
|
|
if ((dx != 0 || dy != 0) && is_inside_bounds(x + dx, y + dy)) {
|
|
neigh.emplace_back(x + dx, y + dy);
|
|
}
|
|
}
|
|
}
|
|
return neigh;
|
|
}
|
|
|
|
void Tilemap::set_tile(int x, int y, unsigned int tile) {
|
|
if (is_inside_bounds(x, y)) {
|
|
tilemap[get_index(x, y)] = tile;
|
|
}
|
|
}
|
|
|
|
int Tilemap::get_tile(int x, int y) {
|
|
if (is_inside_bounds(x, y)) {
|
|
return tilemap[get_index(x, y)];
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
bool Tilemap::is_blocked(int x, int y) {
|
|
if (is_inside_bounds(x, y)) {
|
|
if (tilemap[get_index(x, y)] == '#') { // TODO: Replace hardcoded tiles
|
|
return true;
|
|
}
|
|
for (Entity* var : entities) {
|
|
vec2i pos = var->get_position();
|
|
if (var->has_collision() && pos == vec2i(x, y))
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void Tilemap::add_entity(Entity *actor) {
|
|
for (Entity* var : entities) {
|
|
if (var == actor) {
|
|
return;
|
|
}
|
|
}
|
|
entities.push_back(actor);
|
|
}
|
|
|
|
void Tilemap::remove_entity(Entity * actor) {
|
|
for (auto it = entities.begin(); it != entities.end(); it++) {
|
|
if ((*it) == actor) {
|
|
entities.erase(it);
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
Entity * Tilemap::get_entity(int x, int y, EntityTypes type) {
|
|
vec2i pos = { x,y };
|
|
for (Entity* ent : entities) {
|
|
if (ent->entity_type() == type) {
|
|
vec2i apos = ent->get_position();
|
|
if (apos == pos) {
|
|
return ent;
|
|
}
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
std::vector<Entity*> Tilemap::get_entities(int x, int y, int range, EntityTypes type) {
|
|
std::vector<Entity*> found;
|
|
std::vector<vec2i> neigh = get_neighbours(x, y, range);
|
|
for (Entity* ent : entities) {
|
|
for (vec2i pos : neigh) {
|
|
if (ent->entity_type() == type) {
|
|
vec2i apos = ent->get_position();
|
|
if (apos == pos) {
|
|
found.emplace_back(ent);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return found;
|
|
}
|
|
|
|
std::vector<Entity*>* Tilemap::get_entity_list() {
|
|
return &entities;
|
|
}
|
|
|
|
void Tilemap::draw(Renderer *renderer, Tileset* tileset, int x, int y, int tx, int ty, int tw, int th, FieldOfView* view) {
|
|
int w = tileset->get_tile_width();
|
|
int h = tileset->get_tile_height();
|
|
for (int ix = 0; ix < tw; ix++) {
|
|
for (int iy = 0; iy < th; iy++) {
|
|
int ax = tx + ix;
|
|
int ay = ty + iy;
|
|
if (is_inside_bounds(ax, ay)) {
|
|
if (view == nullptr || view->has_seen({ ax, ay })) {
|
|
Color fg = Color(1, 1, 1, 1);
|
|
Color bg = Color(0, 0, 0, 1);
|
|
if (view != nullptr && !view->can_see({ ax, ay })) {
|
|
fg.a = 0.4f;
|
|
}
|
|
renderer->draw_sprite(tileset->get_sprite(get_tile(ax, ay)), fg, bg, x + ix * w, y + iy * h);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void Tilemap::debug_print() {
|
|
for (int y = 0; y < height; ++y) {
|
|
for (int x = 0; x < width; ++x) {
|
|
printf("\t%d", get_tile(x, y));
|
|
}
|
|
printf("\n");
|
|
}
|
|
}
|