|
|
|
@ -269,6 +269,54 @@ void CreateThemeRoom(int themeIndex) |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FindTransparencyValues(int i, int j, int x, int y, int d, uint8_t floorID) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
if (dTransVal[x][y] != 0 || dungeon[i][j] != floorID) { |
|
|
|
|
|
|
|
if (d == 1) { |
|
|
|
|
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 2) { |
|
|
|
|
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 3) { |
|
|
|
|
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 4) { |
|
|
|
|
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 5) { |
|
|
|
|
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 6) { |
|
|
|
|
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 7) { |
|
|
|
|
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 8) { |
|
|
|
|
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
return; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
|
|
|
|
FindTransparencyValues(i + 1, j, x + 2, y, 1, floorID); |
|
|
|
|
|
|
|
FindTransparencyValues(i - 1, j, x - 2, y, 2, floorID); |
|
|
|
|
|
|
|
FindTransparencyValues(i, j + 1, x, y + 2, 3, floorID); |
|
|
|
|
|
|
|
FindTransparencyValues(i, j - 1, x, y - 2, 4, floorID); |
|
|
|
|
|
|
|
FindTransparencyValues(i - 1, j - 1, x - 2, y - 2, 5, floorID); |
|
|
|
|
|
|
|
FindTransparencyValues(i + 1, j - 1, x + 2, y - 2, 6, floorID); |
|
|
|
|
|
|
|
FindTransparencyValues(i - 1, j + 1, x - 2, y + 2, 7, floorID); |
|
|
|
|
|
|
|
FindTransparencyValues(i + 1, j + 1, x + 2, y + 2, 8, floorID); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
} // namespace
|
|
|
|
} // namespace
|
|
|
|
|
|
|
|
|
|
|
|
void FillSolidBlockTbls() |
|
|
|
void FillSolidBlockTbls() |
|
|
|
@ -549,52 +597,21 @@ void InitLevels() |
|
|
|
setlevel = false; |
|
|
|
setlevel = false; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
void FindTransparencyValues(uint8_t tileID, int i, int j, int x, int y, int d) |
|
|
|
void FloodTransparencyValues(uint8_t floorID) |
|
|
|
{ |
|
|
|
{ |
|
|
|
if (dTransVal[x][y] != 0 || dungeon[i][j] != tileID) { |
|
|
|
int yy = 16; |
|
|
|
if (d == 1) { |
|
|
|
for (int j = 0; j < DMAXY; j++) { |
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
int xx = 16; |
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
for (int i = 0; i < DMAXX; i++) { |
|
|
|
} |
|
|
|
if (dungeon[i][j] == floorID && dTransVal[xx][yy] == 0) { |
|
|
|
if (d == 2) { |
|
|
|
FindTransparencyValues(i, j, xx, yy, 0, floorID); |
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
TransVal++; |
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
} |
|
|
|
} |
|
|
|
xx += 2; |
|
|
|
if (d == 3) { |
|
|
|
|
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 4) { |
|
|
|
|
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 5) { |
|
|
|
|
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 6) { |
|
|
|
|
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 7) { |
|
|
|
|
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (d == 8) { |
|
|
|
|
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
return; |
|
|
|
yy += 2; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
dTransVal[x][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x][y + 1] = TransVal; |
|
|
|
|
|
|
|
dTransVal[x + 1][y + 1] = TransVal; |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i + 1, j, x + 2, y, 1); |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i - 1, j, x - 2, y, 2); |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i, j + 1, x, y + 2, 3); |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i, j - 1, x, y - 2, 4); |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i - 1, j - 1, x - 2, y - 2, 5); |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i + 1, j - 1, x + 2, y - 2, 6); |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i - 1, j + 1, x - 2, y + 2, 7); |
|
|
|
|
|
|
|
FindTransparencyValues(tileID, i + 1, j + 1, x + 2, y + 2, 8); |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
} // namespace devilution
|
|
|
|
} // namespace devilution
|
|
|
|
|