/** * @file trigs.cpp * * Implementation of functionality for triggering events when the player enters an area. */ #include "trigs.h" #include #include "control.h" #include "cursor.h" #include "error.h" #include "init.h" #include "utils/language.h" namespace devilution { bool trigflag; int numtrigs; TriggerStruct trigs[MAXTRIGGERS]; int TWarpFrom; /** Specifies the dungeon piece IDs which constitute stairways leading down to the cathedral from town. */ int TownDownList[] = { 716, 715, 719, 720, 721, 723, 724, 725, 726, 727, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading down to the catacombs from town. */ int TownWarp1List[] = { 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1181, 1183, 1185, -1 }; int TownCryptList[] = { 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, -1 }; int TownHiveList[] = { 1307, 1308, 1309, 1310, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading up from the cathedral. */ int L1UpList[] = { 127, 129, 130, 131, 132, 133, 135, 137, 138, 139, 140, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading down from the cathedral. */ int L1DownList[] = { 106, 107, 108, 109, 110, 112, 114, 115, 118, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading up from the catacombs. */ int L2UpList[] = { 266, 267, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading down from the catacombs. */ int L2DownList[] = { 269, 270, 271, 272, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading up to town from the catacombs. */ int L2TWarpUpList[] = { 558, 559, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading up from the caves. */ int L3UpList[] = { 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading down from the caves. */ int L3DownList[] = { 162, 163, 164, 165, 166, 167, 168, 169, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading up to town from the caves. */ int L3TWarpUpList[] = { 182, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading up from hell. */ int L4UpList[] = { 82, 83, 90, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading down from hell. */ int L4DownList[] = { 120, 130, 131, 132, 133, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading up to town from hell. */ int L4TWarpUpList[] = { 421, 422, 429, -1 }; /** Specifies the dungeon piece IDs which constitute stairways leading down to Diablo from hell. */ int L4PentaList[] = { 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, -1 }; int L5TWarpUpList[] = { 172, 173, 174, 175, 176, 177, 178, 179, 184, -1 }; int L5UpList[] = { 149, 150, 151, 152, 153, 154, 155, 157, 158, 159, -1 }; int L5DownList[] = { 125, 126, 129, 131, 132, 135, 136, 140, 142, -1 }; int L6TWarpUpList[] = { 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, -1 }; int L6UpList[] = { 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, -1 }; int L6DownList[] = { 57, 58, 59, 60, 61, 62, 63, 64, -1 }; void InitNoTriggers() { numtrigs = 0; trigflag = false; } bool IsWarpOpen(dungeon_type type) { if (gbIsSpawn) return false; if (gbIsMultiplayer && type != DTYPE_NEST) // Opening the nest is part of in town quest return true; auto &myPlayer = Players[MyPlayerId]; if (type == DTYPE_CATACOMBS && (myPlayer.pTownWarps & 1) != 0) return true; if (type == DTYPE_CAVES && (myPlayer.pTownWarps & 2) != 0) return true; if (type == DTYPE_HELL && (myPlayer.pTownWarps & 4) != 0) return true; if (gbIsHellfire) { if (type == DTYPE_CATACOMBS && myPlayer._pLevel >= 10) return true; if (type == DTYPE_CAVES && myPlayer._pLevel >= 15) return true; if (type == DTYPE_HELL && myPlayer._pLevel >= 20) return true; if (type == DTYPE_NEST && IsAnyOf(Quests[Q_FARMER]._qactive, QUEST_DONE, QUEST_HIVE_DONE)) return true; if (type == DTYPE_CRYPT && Quests[Q_GRAVE]._qactive == QUEST_DONE) return true; } return false; } void InitTownTriggers() { numtrigs = 0; // Cathedral trigs[numtrigs].position = { 25, 29 }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; if (IsWarpOpen(DTYPE_CATACOMBS)) { trigs[numtrigs].position = { 49, 21 }; trigs[numtrigs]._tmsg = WM_DIABTOWNWARP; trigs[numtrigs]._tlvl = 5; numtrigs++; } if (IsWarpOpen(DTYPE_CAVES)) { trigs[numtrigs].position = { 17, 69 }; trigs[numtrigs]._tmsg = WM_DIABTOWNWARP; trigs[numtrigs]._tlvl = 9; numtrigs++; } if (IsWarpOpen(DTYPE_HELL)) { trigs[numtrigs].position = { 41, 80 }; trigs[numtrigs]._tmsg = WM_DIABTOWNWARP; trigs[numtrigs]._tlvl = 13; numtrigs++; } if (IsWarpOpen(DTYPE_NEST)) { trigs[numtrigs].position = { 80, 62 }; trigs[numtrigs]._tmsg = WM_DIABTOWNWARP; trigs[numtrigs]._tlvl = 17; numtrigs++; } if (IsWarpOpen(DTYPE_CRYPT)) { trigs[numtrigs].position = { 36, 24 }; trigs[numtrigs]._tmsg = WM_DIABTOWNWARP; trigs[numtrigs]._tlvl = 21; numtrigs++; } trigflag = false; } void InitL1Triggers() { numtrigs = 0; if (currlevel < 17) { for (int j = 0; j < MAXDUNY; j++) { for (int i = 0; i < MAXDUNX; i++) { if (dPiece[i][j] == 129) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABPREVLVL; numtrigs++; } if (dPiece[i][j] == 115) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; } } } } else { for (int j = 0; j < MAXDUNY; j++) { for (int i = 0; i < MAXDUNX; i++) { if (dPiece[i][j] == 184) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABTWARPUP; trigs[numtrigs]._tlvl = 0; numtrigs++; } if (dPiece[i][j] == 158) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABPREVLVL; numtrigs++; } if (dPiece[i][j] == 126) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; } } } } trigflag = false; } void InitL2Triggers() { numtrigs = 0; for (int j = 0; j < MAXDUNY; j++) { for (int i = 0; i < MAXDUNX; i++) { if (dPiece[i][j] == 267 && (i != Quests[Q_SCHAMB].position.x || j != Quests[Q_SCHAMB].position.y)) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABPREVLVL; numtrigs++; } if (dPiece[i][j] == 559) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABTWARPUP; trigs[numtrigs]._tlvl = 0; numtrigs++; } if (dPiece[i][j] == 271) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; } } } trigflag = false; } void InitL3Triggers() { if (currlevel < 17) { numtrigs = 0; for (int j = 0; j < MAXDUNY; j++) { for (int i = 0; i < MAXDUNX; i++) { if (dPiece[i][j] == 171) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABPREVLVL; numtrigs++; } if (dPiece[i][j] == 168) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; } if (dPiece[i][j] == 549) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABTWARPUP; numtrigs++; } } } } else { numtrigs = 0; for (int j = 0; j < MAXDUNY; j++) { for (int i = 0; i < MAXDUNX; i++) { if (dPiece[i][j] == 66) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABPREVLVL; numtrigs++; } if (dPiece[i][j] == 63) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; } if (dPiece[i][j] == 80) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABTWARPUP; numtrigs++; } } } } trigflag = false; } void InitL4Triggers() { numtrigs = 0; for (int j = 0; j < MAXDUNY; j++) { for (int i = 0; i < MAXDUNX; i++) { if (dPiece[i][j] == 83) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABPREVLVL; numtrigs++; } if (dPiece[i][j] == 422) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABTWARPUP; trigs[numtrigs]._tlvl = 0; numtrigs++; } if (dPiece[i][j] == 120) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; } } } for (int j = 0; j < MAXDUNY; j++) { for (int i = 0; i < MAXDUNX; i++) { if (dPiece[i][j] == 370 && Quests[Q_BETRAYER]._qactive == QUEST_DONE) { trigs[numtrigs].position = { i, j }; trigs[numtrigs]._tmsg = WM_DIABNEXTLVL; numtrigs++; } } } trigflag = false; } void InitSKingTriggers() { trigflag = false; numtrigs = 1; trigs[0].position = { 82, 42 }; trigs[0]._tmsg = WM_DIABRTNLVL; } void InitSChambTriggers() { trigflag = false; numtrigs = 1; trigs[0].position = { 70, 39 }; trigs[0]._tmsg = WM_DIABRTNLVL; } void InitPWaterTriggers() { trigflag = false; numtrigs = 1; trigs[0].position = { 30, 83 }; trigs[0]._tmsg = WM_DIABRTNLVL; } void InitVPTriggers() { trigflag = false; numtrigs = 1; trigs[0].position = { 35, 32 }; trigs[0]._tmsg = WM_DIABRTNLVL; } bool ForceTownTrig() { for (auto tileId : TownDownList) { if (tileId == -1) break; if (dPiece[cursPosition.x][cursPosition.y] == tileId) { strcpy(infostr, _("Down to dungeon")); cursPosition = { 25, 29 }; return true; } } if (IsWarpOpen(DTYPE_CATACOMBS)) { for (auto tileId : TownWarp1List) { if (tileId == -1) break; if (dPiece[cursPosition.x][cursPosition.y] == tileId) { strcpy(infostr, _("Down to catacombs")); cursPosition = { 49, 21 }; return true; } } } if (IsWarpOpen(DTYPE_CAVES)) { for (int i = 1199; i <= 1220; i++) { if (dPiece[cursPosition.x][cursPosition.y] == i) { strcpy(infostr, _("Down to caves")); cursPosition = { 17, 69 }; return true; } } } if (IsWarpOpen(DTYPE_HELL)) { for (int i = 1240; i <= 1255; i++) { if (dPiece[cursPosition.x][cursPosition.y] == i) { strcpy(infostr, _("Down to hell")); cursPosition = { 41, 80 }; return true; } } } if (IsWarpOpen(DTYPE_NEST)) { for (auto tileId : TownHiveList) { if (tileId == -1) break; if (dPiece[cursPosition.x][cursPosition.y] == tileId) { strcpy(infostr, _("Down to Hive")); cursPosition = { 80, 62 }; return true; } } } if (IsWarpOpen(DTYPE_CRYPT)) { for (auto tileId : TownCryptList) { if (tileId == -1) break; if (dPiece[cursPosition.x][cursPosition.y] == tileId) { strcpy(infostr, _("Down to Crypt")); cursPosition = { 36, 24 }; return true; } } } return false; } bool ForceL1Trig() { if (currlevel < 17) { for (int i = 0; L1UpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L1UpList[i]) { if (currlevel > 1) strcpy(infostr, fmt::format(_("Up to level {:d}"), currlevel - 1).c_str()); else strcpy(infostr, _("Up to town")); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABPREVLVL) { cursPosition = trigs[j].position; return true; } } } } for (int i = 0; L1DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L1DownList[i]) { strcpy(infostr, fmt::format(_("Down to level {:d}"), currlevel + 1).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABNEXTLVL) { cursPosition = trigs[j].position; return true; } } } } } else { for (int i = 0; L5UpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L5UpList[i]) { strcpy(infostr, fmt::format(_("Up to Crypt level {:d}"), currlevel - 21).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABPREVLVL) { cursPosition = trigs[j].position; return true; } } } } if (dPiece[cursPosition.x][cursPosition.y] == 317) { strcpy(infostr, _("Cornerstone of the World")); return true; } for (int i = 0; L5DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L5DownList[i]) { strcpy(infostr, fmt::format(_("Down to Crypt level {:d}"), currlevel - 19).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABNEXTLVL) { cursPosition = trigs[j].position; return true; } } } } if (currlevel == 21) { for (int i = 0; L5TWarpUpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L5TWarpUpList[i]) { for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABTWARPUP) { int dx = abs(trigs[j].position.x - cursPosition.x); int dy = abs(trigs[j].position.y - cursPosition.y); if (dx < 4 && dy < 4) { strcpy(infostr, _("Up to town")); cursPosition = trigs[j].position; return true; } } } } } } } return false; } bool ForceL2Trig() { for (int i = 0; L2UpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L2UpList[i]) { for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABPREVLVL) { int dx = abs(trigs[j].position.x - cursPosition.x); int dy = abs(trigs[j].position.y - cursPosition.y); if (dx < 4 && dy < 4) { strcpy(infostr, fmt::format(_("Up to level {:d}"), currlevel - 1).c_str()); cursPosition = trigs[j].position; return true; } } } } } for (int i = 0; L2DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L2DownList[i]) { strcpy(infostr, fmt::format(_("Down to level {:d}"), currlevel + 1).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABNEXTLVL) { cursPosition = trigs[j].position; return true; } } } } if (currlevel == 5) { for (int i = 0; L2TWarpUpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L2TWarpUpList[i]) { for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABTWARPUP) { int dx = abs(trigs[j].position.x - cursPosition.x); int dy = abs(trigs[j].position.y - cursPosition.y); if (dx < 4 && dy < 4) { strcpy(infostr, _("Up to town")); cursPosition = trigs[j].position; return true; } } } } } } return false; } bool ForceL3Trig() { if (currlevel < 17) { for (int i = 0; L3UpList[i] != -1; ++i) { if (dPiece[cursPosition.x][cursPosition.y] == L3UpList[i]) { strcpy(infostr, fmt::format(_("Up to level {:d}"), currlevel - 1).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABPREVLVL) { int dx = abs(trigs[j].position.x - cursPosition.x); int dy = abs(trigs[j].position.y - cursPosition.y); if (dx < 4 && dy < 4) { cursPosition = trigs[j].position; return true; } } } } } for (int i = 0; L3DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L3DownList[i] || dPiece[cursPosition.x + 1][cursPosition.y] == L3DownList[i] || dPiece[cursPosition.x + 2][cursPosition.y] == L3DownList[i]) { strcpy(infostr, fmt::format(_("Down to level {:d}"), currlevel + 1).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABNEXTLVL) { cursPosition = trigs[j].position; return true; } } } } } else { for (int i = 0; L6UpList[i] != -1; ++i) { if (dPiece[cursPosition.x][cursPosition.y] == L6UpList[i]) { strcpy(infostr, fmt::format(_("Up to Nest level {:d}"), currlevel - 17).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABPREVLVL) { cursPosition = trigs[j].position; return true; } } } } for (int i = 0; L6DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L6DownList[i] || dPiece[cursPosition.x + 1][cursPosition.y] == L6DownList[i] || dPiece[cursPosition.x + 2][cursPosition.y] == L6DownList[i]) { strcpy(infostr, fmt::format(_("Down to level {:d}"), currlevel - 15).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABNEXTLVL) { cursPosition = trigs[j].position; return true; } } } } } if (currlevel == 9) { for (int i = 0; L3TWarpUpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L3TWarpUpList[i]) { for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABTWARPUP) { int dx = abs(trigs[j].position.x - cursPosition.x); int dy = abs(trigs[j].position.y - cursPosition.y); if (dx < 4 && dy < 4) { strcpy(infostr, _("Up to town")); cursPosition = trigs[j].position; return true; } } } } } } if (currlevel == 17) { for (int i = 0; L6TWarpUpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L6TWarpUpList[i]) { for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABTWARPUP) { int dx = abs(trigs[j].position.x - cursPosition.x); int dy = abs(trigs[j].position.y - cursPosition.y); if (dx < 4 && dy < 4) { strcpy(infostr, _("Up to town")); cursPosition = trigs[j].position; return true; } } } } } } return false; } bool ForceL4Trig() { for (int i = 0; L4UpList[i] != -1; ++i) { if (dPiece[cursPosition.x][cursPosition.y] == L4UpList[i]) { strcpy(infostr, fmt::format(_("Up to level {:d}"), currlevel - 1).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABPREVLVL) { cursPosition = trigs[j].position; return true; } } } } for (int i = 0; L4DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L4DownList[i]) { strcpy(infostr, fmt::format(_("Down to level {:d}"), currlevel + 1).c_str()); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABNEXTLVL) { cursPosition = trigs[j].position; return true; } } } } if (currlevel == 13) { for (int i = 0; L4TWarpUpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L4TWarpUpList[i]) { for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABTWARPUP) { int dx = abs(trigs[j].position.x - cursPosition.x); int dy = abs(trigs[j].position.y - cursPosition.y); if (dx < 4 && dy < 4) { strcpy(infostr, _("Up to town")); cursPosition = trigs[j].position; return true; } } } } } } if (currlevel == 15) { for (int i = 0; L4PentaList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L4PentaList[i]) { strcpy(infostr, _("Down to Diablo")); for (int j = 0; j < numtrigs; j++) { if (trigs[j]._tmsg == WM_DIABNEXTLVL) { cursPosition = trigs[j].position; return true; } } } } } return false; } void Freeupstairs() { for (int i = 0; i < numtrigs; i++) { int tx = trigs[i].position.x; int ty = trigs[i].position.y; for (int yy = -2; yy <= 2; yy++) { for (int xx = -2; xx <= 2; xx++) { dFlags[tx + xx][ty + yy] |= DungeonFlag::Populated; } } } } bool ForceSKingTrig() { for (int i = 0; L1UpList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L1UpList[i]) { strcpy(infostr, fmt::format(_("Back to Level {:d}"), Quests[Q_SKELKING]._qlevel).c_str()); cursPosition = trigs[0].position; return true; } } return false; } bool ForceSChambTrig() { for (int i = 0; L2DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L2DownList[i]) { strcpy(infostr, fmt::format(_("Back to Level {:d}"), Quests[Q_SCHAMB]._qlevel).c_str()); cursPosition = trigs[0].position; return true; } } return false; } bool ForcePWaterTrig() { for (int i = 0; L3DownList[i] != -1; i++) { if (dPiece[cursPosition.x][cursPosition.y] == L3DownList[i]) { strcpy(infostr, fmt::format(_("Back to Level {:d}"), Quests[Q_PWATER]._qlevel).c_str()); cursPosition = trigs[0].position; return true; } } return false; } void CheckTrigForce() { trigflag = false; if (!sgbControllerActive && MousePosition.y > GetMainPanel().position.y - 1) { return; } if (!setlevel) { switch (leveltype) { case DTYPE_TOWN: trigflag = ForceTownTrig(); break; case DTYPE_CATHEDRAL: trigflag = ForceL1Trig(); break; case DTYPE_CATACOMBS: trigflag = ForceL2Trig(); break; case DTYPE_CAVES: trigflag = ForceL3Trig(); break; case DTYPE_HELL: trigflag = ForceL4Trig(); break; default: break; } if (leveltype != DTYPE_TOWN && !trigflag) { trigflag = ForceQuests(); } } else { switch (setlvlnum) { case SL_SKELKING: trigflag = ForceSKingTrig(); break; case SL_BONECHAMB: trigflag = ForceSChambTrig(); break; case SL_POISONWATER: trigflag = ForcePWaterTrig(); break; default: break; } } if (trigflag) { ClearPanel(); } } void CheckTriggers() { auto &myPlayer = Players[MyPlayerId]; if (myPlayer._pmode != PM_STAND) return; for (int i = 0; i < numtrigs; i++) { if (myPlayer.position.tile != trigs[i].position) { continue; } switch (trigs[i]._tmsg) { case WM_DIABNEXTLVL: if (gbIsSpawn && currlevel >= 2) { NetSendCmdLoc(MyPlayerId, true, CMD_WALKXY, { myPlayer.position.tile.x, myPlayer.position.tile.y + 1 }); myPlayer.Say(HeroSpeech::NotAChance); InitDiabloMsg(EMSG_NOT_IN_SHAREWARE); } else { StartNewLvl(MyPlayerId, trigs[i]._tmsg, currlevel + 1); } break; case WM_DIABPREVLVL: StartNewLvl(MyPlayerId, trigs[i]._tmsg, currlevel - 1); break; case WM_DIABRTNLVL: StartNewLvl(MyPlayerId, trigs[i]._tmsg, ReturnLevel); break; case WM_DIABTOWNWARP: if (gbIsMultiplayer) { bool abort = false; diablo_message abortflag; auto position = myPlayer.position.tile; if (trigs[i]._tlvl == 5 && myPlayer._pLevel < 8) { abort = true; position.y += 1; abortflag = EMSG_REQUIRES_LVL_8; } if (IsAnyOf(trigs[i]._tlvl, 9, 17) && myPlayer._pLevel < 13) { abort = true; position.x += 1; abortflag = EMSG_REQUIRES_LVL_13; } if (IsAnyOf(trigs[i]._tlvl, 13, 21) && myPlayer._pLevel < 17) { abort = true; position.y += 1; abortflag = EMSG_REQUIRES_LVL_17; } if (abort) { myPlayer.Say(HeroSpeech::ICantGetThereFromHere); InitDiabloMsg(abortflag); NetSendCmdLoc(MyPlayerId, true, CMD_WALKXY, position); return; } } StartNewLvl(MyPlayerId, trigs[i]._tmsg, trigs[i]._tlvl); break; case WM_DIABTWARPUP: TWarpFrom = currlevel; StartNewLvl(MyPlayerId, trigs[i]._tmsg, 0); break; default: app_fatal("Unknown trigger msg"); } } } bool EntranceBoundaryContains(Point entrance, Point position) { constexpr Displacement entranceOffsets[7] = { { 0, 0 }, { -1, 0 }, { 0, -1 }, { -1, -1 }, { -2, -1 }, { -1, -2 }, { -2, -2 } }; return std::any_of( std::begin(entranceOffsets), std::end(entranceOffsets), [&](auto offset) { return entrance + offset == position; }); } } // namespace devilution