mirror of
https://github.com/TombEngine/TombEngine.git
synced 2025-04-30 08:47:58 +03:00
6cccd1d28e
- changed mgLOS from TR3 to TR5. - changed a bit GetTiltType() that normally return short. - changed a bit CollideStaticObjects() and LaraBaddieCollision() to use "vector<short>" instead of "array". - fixed GetCollidedObjects() where "collidedItems[numItems] = NULL" is called before last return. - created GetRoomList() to get the roomList with vector or array return. - structured some function.
87 lines
No EOL
1.6 KiB
C++
87 lines
No EOL
1.6 KiB
C++
#include "misc.h"
|
|
|
|
#define CHK_ANY(var, flag) (var & flag) != 0
|
|
#define CHK_NOP(var, flag) !(var & flag)
|
|
|
|
short GF(short animIndex, short frameToStart)
|
|
{
|
|
return short(Anims[animIndex].frameBase + frameToStart);
|
|
}
|
|
|
|
short GF2(short objectID, short animIndex, short frameToStart)
|
|
{
|
|
return short(Anims[Objects[objectID].animIndex + animIndex].frameBase + frameToStart);
|
|
}
|
|
|
|
void GetRoomList(short roomNumber, short* roomArray, short* numRooms)
|
|
{
|
|
short numDoors, *door, adjoiningRoom;
|
|
int i, j;
|
|
bool adjoiningRoomFound;
|
|
|
|
roomArray[0] = roomNumber;
|
|
door = Rooms[roomNumber].door;
|
|
if (door)
|
|
{
|
|
numDoors = *door;
|
|
door++;
|
|
|
|
for (i = 0; i < numDoors; i++)
|
|
{
|
|
adjoiningRoom = *door;
|
|
adjoiningRoomFound = false;
|
|
|
|
for (j = 0; j < *numRooms; j++)
|
|
{
|
|
if (roomArray[i] == adjoiningRoom)
|
|
{
|
|
adjoiningRoomFound = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!adjoiningRoomFound)
|
|
roomArray[*numRooms++] = adjoiningRoom;
|
|
|
|
door += 16;
|
|
}
|
|
}
|
|
}
|
|
|
|
void GetRoomList(short roomNumber, vector<short>* destRoomList)
|
|
{
|
|
vector<short> roomList;
|
|
short numDoors, *door, adjoiningRoom;
|
|
int i, j;
|
|
bool adjoiningRoomFound;
|
|
|
|
roomList.push_back(roomNumber);
|
|
door = Rooms[roomNumber].door;
|
|
if (door)
|
|
{
|
|
numDoors = *door;
|
|
door++;
|
|
|
|
for (i = 0; i < numDoors; i++)
|
|
{
|
|
adjoiningRoom = *door;
|
|
adjoiningRoomFound = false;
|
|
|
|
for (j = 0; j < roomList.size(); j++)
|
|
{
|
|
if (roomList[i] == adjoiningRoom)
|
|
{
|
|
adjoiningRoomFound = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!adjoiningRoomFound)
|
|
roomList.push_back(adjoiningRoom);
|
|
|
|
door += 16;
|
|
}
|
|
}
|
|
|
|
*destRoomList = roomList;
|
|
} |