|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
|
|
|
|
|
|
#include "control.h"
|
|
|
|
|
#include "lighting.h"
|
|
|
|
|
|
|
|
|
|
using namespace devilution;
|
|
|
|
|
|
|
|
|
|
TEST(Lighting, CrawlTables)
|
|
|
|
|
{
|
|
|
|
|
int CrawlNum[19] = { 0, 3, 12, 45, 94, 159, 240, 337, 450, 579, 724, 885, 1062, 1255, 1464, 1689, 1930, 2187, 2460 };
|
|
|
|
|
|
|
|
|
|
bool added[40][40];
|
|
|
|
|
memset(added, 0, sizeof(added));
|
|
|
|
|
|
|
|
|
|
for (int j = 0; j < 19; j++) {
|
|
|
|
|
int x = 20;
|
|
|
|
|
int y = 20;
|
|
|
|
|
int cr = CrawlNum[j] + 1;
|
|
|
|
|
for (unsigned i = (uint8_t)CrawlTable[cr - 1]; i > 0; i--, cr += 2) {
|
|
|
|
|
int dx = x + CrawlTable[cr];
|
|
|
|
|
int dy = y + CrawlTable[cr + 1];
|
|
|
|
|
sprintf(tempstr, "location %i:%i added twice.", dx - 20, dy - 20);
|
|
|
|
|
EXPECT_EQ(added[dx][dy], false) << tempstr;
|
|
|
|
|
added[dx][dy] = true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (int i = -18; i <= 18; i++) {
|
|
|
|
|
for (int j = -18; j <= 18; j++) {
|
|
|
|
|
if (added[i + 20][j + 20])
|
|
|
|
|
continue;
|
|
|
|
|
if ((i == -18 && j == -18) || (i == -18 && j == 18) || (i == 18 && j == -18) || (i == 18 && j == 18))
|
|
|
|
|
continue; // Limit of the crawl table rage
|
|
|
|
|
sprintf(tempstr, "while checking location %i:%i.", i, j);
|
|
|
|
|
EXPECT_EQ(false, true) << tempstr;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
