aboutsummaryrefslogtreecommitdiff
path: root/engines/sludge/floor.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'engines/sludge/floor.cpp')
-rw-r--r--engines/sludge/floor.cpp195
1 files changed, 106 insertions, 89 deletions
diff --git a/engines/sludge/floor.cpp b/engines/sludge/floor.cpp
index 7ca30b6c3d..ec5738728f 100644
--- a/engines/sludge/floor.cpp
+++ b/engines/sludge/floor.cpp
@@ -35,17 +35,15 @@ bool pointInFloorPolygon(floorPolygon &floorPoly, int x, int y) {
float xp_i, yp_i;
float xp_j, yp_j;
- for (j = floorPoly.numVertices - 1; i < floorPoly.numVertices;
- j = i ++) {
+ for (j = floorPoly.numVertices - 1; i < floorPoly.numVertices; j = i++) {
- xp_i = currentFloor -> vertex[floorPoly.vertexID[i]].x;
- yp_i = currentFloor -> vertex[floorPoly.vertexID[i]].y;
- xp_j = currentFloor -> vertex[floorPoly.vertexID[j]].x;
- yp_j = currentFloor -> vertex[floorPoly.vertexID[j]].y;
+ xp_i = currentFloor->vertex[floorPoly.vertexID[i]].x;
+ yp_i = currentFloor->vertex[floorPoly.vertexID[i]].y;
+ xp_j = currentFloor->vertex[floorPoly.vertexID[j]].x;
+ yp_j = currentFloor->vertex[floorPoly.vertexID[j]].y;
- if ((((yp_i <= y) && (y < yp_j)) ||
- ((yp_j <= y) && (y < yp_i))) &&
- (x < (xp_j - xp_i) * (y - yp_i) / (yp_j - yp_i) + xp_i)) {
+ if ((((yp_i <= y) && (y < yp_j)) || ((yp_j <= y) && (y < yp_i)))
+ && (x < (xp_j - xp_i) * (y - yp_i) / (yp_j - yp_i) + xp_i)) {
c = !c;
}
@@ -53,14 +51,15 @@ bool pointInFloorPolygon(floorPolygon &floorPoly, int x, int y) {
return c;
}
-bool getMatchingCorners(floorPolygon &a, floorPolygon &b, int &cornerA, int &cornerB) {
+bool getMatchingCorners(floorPolygon &a, floorPolygon &b, int &cornerA,
+ int &cornerB) {
int sharedVertices = 0;
int i, j;
- for (i = 0; i < a.numVertices; i ++) {
- for (j = 0; j < b.numVertices; j ++) {
+ for (i = 0; i < a.numVertices; i++) {
+ for (j = 0; j < b.numVertices; j++) {
if (a.vertexID[i] == b.vertexID[j]) {
- if (sharedVertices ++) {
+ if (sharedVertices++) {
cornerB = a.vertexID[i];
return true;
} else {
@@ -77,10 +76,11 @@ bool polysShareSide(floorPolygon &a, floorPolygon &b) {
int sharedVertices = 0;
int i, j;
- for (i = 0; i < a.numVertices; i ++) {
- for (j = 0; j < b.numVertices; j ++) {
+ for (i = 0; i < a.numVertices; i++) {
+ for (j = 0; j < b.numVertices; j++) {
if (a.vertexID[i] == b.vertexID[j]) {
- if (sharedVertices ++) return true;
+ if (sharedVertices++)
+ return true;
}
}
}
@@ -89,30 +89,31 @@ bool polysShareSide(floorPolygon &a, floorPolygon &b) {
}
void noFloor() {
- currentFloor -> numPolygons = 0;
- currentFloor -> polygon = NULL;
- currentFloor -> vertex = NULL;
- currentFloor -> matrix = NULL;
+ currentFloor->numPolygons = 0;
+ currentFloor->polygon = NULL;
+ currentFloor->vertex = NULL;
+ currentFloor->matrix = NULL;
}
bool initFloor() {
currentFloor = new flor;
- if (! checkNew(currentFloor)) return false;
+ if (!checkNew(currentFloor))
+ return false;
noFloor();
return true;
}
void killFloor() {
- for (int i = 0; i < currentFloor -> numPolygons; i ++) {
- delete currentFloor -> polygon[i].vertexID;
- delete currentFloor -> matrix[i];
+ for (int i = 0; i < currentFloor->numPolygons; i++) {
+ delete currentFloor->polygon[i].vertexID;
+ delete currentFloor->matrix[i];
}
- delete currentFloor -> polygon;
- currentFloor -> polygon = NULL;
- delete currentFloor -> vertex;
- currentFloor -> vertex = NULL;
- delete currentFloor -> matrix;
- currentFloor -> matrix = NULL;
+ delete currentFloor->polygon;
+ currentFloor->polygon = NULL;
+ delete currentFloor->vertex;
+ currentFloor->vertex = NULL;
+ delete currentFloor->matrix;
+ currentFloor->matrix = NULL;
}
void setFloorNull() {
@@ -128,73 +129,81 @@ bool setFloor(int fileNum) {
setResourceForFatal(fileNum);
- if (! openFileFromNum(fileNum)) return false;
+ if (!openFileFromNum(fileNum))
+ return false;
// Find out how many polygons there are and reserve memory
- currentFloor -> originalNum = fileNum;
- currentFloor -> numPolygons = getch(bigDataFile);
- currentFloor -> polygon = new floorPolygon[currentFloor -> numPolygons];
- if (! checkNew(currentFloor -> polygon)) return false;
+ currentFloor->originalNum = fileNum;
+ currentFloor->numPolygons = getch(bigDataFile);
+ currentFloor->polygon = new floorPolygon[currentFloor->numPolygons];
+ if (!checkNew(currentFloor->polygon))
+ return false;
// Read in each polygon
- for (i = 0; i < currentFloor -> numPolygons; i ++) {
+ for (i = 0; i < currentFloor->numPolygons; i++) {
// Find out how many vertex IDs there are and reserve memory
- currentFloor -> polygon[i].numVertices = getch(bigDataFile);
- currentFloor -> polygon[i].vertexID = new int[currentFloor -> polygon[i].numVertices];
- if (! checkNew(currentFloor -> polygon[i].vertexID)) return false;
+ currentFloor->polygon[i].numVertices = getch(bigDataFile);
+ currentFloor->polygon[i].vertexID =
+ new int[currentFloor->polygon[i].numVertices];
+ if (!checkNew(currentFloor->polygon[i].vertexID))
+ return false;
// Read in each vertex ID
- for (j = 0; j < currentFloor -> polygon[i].numVertices; j ++) {
- currentFloor -> polygon[i].vertexID[j] = get2bytes(bigDataFile);
+ for (j = 0; j < currentFloor->polygon[i].numVertices; j++) {
+ currentFloor->polygon[i].vertexID[j] = get2bytes(bigDataFile);
}
}
// Find out how many vertices there are and reserve memory
i = get2bytes(bigDataFile);
- currentFloor -> vertex = new POINT[i];
- if (! checkNew(currentFloor -> vertex)) return false;
+ currentFloor->vertex = new POINT[i];
+ if (!checkNew(currentFloor->vertex))
+ return false;
- for (j = 0; j < i; j ++) {
+ for (j = 0; j < i; j++) {
- currentFloor -> vertex[j].x = get2bytes(bigDataFile);
- currentFloor -> vertex[j].y = get2bytes(bigDataFile);
+ currentFloor->vertex[j].x = get2bytes(bigDataFile);
+ currentFloor->vertex[j].y = get2bytes(bigDataFile);
}
finishAccess();
// Now build the movement martix
- currentFloor -> matrix = new int *[currentFloor -> numPolygons];
- int * * distanceMatrix = new int *[currentFloor -> numPolygons];
+ currentFloor->matrix = new int *[currentFloor->numPolygons];
+ int * * distanceMatrix = new int *[currentFloor->numPolygons];
- if (! checkNew(currentFloor -> matrix)) return false;
+ if (!checkNew(currentFloor->matrix))
+ return false;
- for (i = 0; i < currentFloor -> numPolygons; i ++) {
- currentFloor -> matrix[i] = new int [currentFloor -> numPolygons];
- distanceMatrix [i] = new int [currentFloor -> numPolygons];
- if (! checkNew(currentFloor -> matrix[i])) return false;
- for (j = 0; j < currentFloor -> numPolygons; j ++) {
- currentFloor -> matrix[i][j] = -1;
- distanceMatrix [i][j] = 10000;
+ for (i = 0; i < currentFloor->numPolygons; i++) {
+ currentFloor->matrix[i] = new int[currentFloor->numPolygons];
+ distanceMatrix[i] = new int[currentFloor->numPolygons];
+ if (!checkNew(currentFloor->matrix[i]))
+ return false;
+ for (j = 0; j < currentFloor->numPolygons; j++) {
+ currentFloor->matrix[i][j] = -1;
+ distanceMatrix[i][j] = 10000;
}
}
- for (i = 0; i < currentFloor -> numPolygons; i ++) {
- for (j = 0; j < currentFloor -> numPolygons; j ++) {
+ for (i = 0; i < currentFloor->numPolygons; i++) {
+ for (j = 0; j < currentFloor->numPolygons; j++) {
if (i != j) {
- if (polysShareSide(currentFloor -> polygon[i], currentFloor -> polygon[j])) {
- currentFloor -> matrix[i][j] = j;
- distanceMatrix [i][j] = 1;
+ if (polysShareSide(currentFloor->polygon[i],
+ currentFloor->polygon[j])) {
+ currentFloor->matrix[i][j] = j;
+ distanceMatrix[i][j] = 1;
}
} else {
- currentFloor -> matrix[i][j] = -2;
- distanceMatrix [i][j] = 0;
+ currentFloor->matrix[i][j] = -2;
+ distanceMatrix[i][j] = 0;
}
}
}
@@ -203,22 +212,23 @@ bool setFloor(int fileNum) {
int lookForDistance = 0;
do {
- lookForDistance ++;
+ lookForDistance++;
// debugMatrix ();
madeChange = false;
- for (i = 0; i < currentFloor -> numPolygons; i ++) {
- for (j = 0; j < currentFloor -> numPolygons; j ++) {
- if (currentFloor -> matrix[i][j] == -1) {
+ for (i = 0; i < currentFloor->numPolygons; i++) {
+ for (j = 0; j < currentFloor->numPolygons; j++) {
+ if (currentFloor->matrix[i][j] == -1) {
// OK, so we don't know how to get from i to j...
- for (int d = 0; d < currentFloor -> numPolygons; d ++) {
+ for (int d = 0; d < currentFloor->numPolygons; d++) {
if (d != i && d != j) {
- if (currentFloor -> matrix[i][d] == d &&
- currentFloor -> matrix[d][j] >= 0 &&
- distanceMatrix [d][j] <= lookForDistance) {
+ if (currentFloor->matrix[i][d] == d
+ && currentFloor->matrix[d][j] >= 0
+ && distanceMatrix[d][j]
+ <= lookForDistance) {
- currentFloor -> matrix[i][j] = d;
- distanceMatrix [i][j] = lookForDistance + 1;
+ currentFloor->matrix[i][j] = d;
+ distanceMatrix[i][j] = lookForDistance + 1;
madeChange = true;
}
}
@@ -228,8 +238,8 @@ bool setFloor(int fileNum) {
}
} while (madeChange);
- for (i = 0; i < currentFloor -> numPolygons; i ++) {
- delete distanceMatrix [i];
+ for (i = 0; i < currentFloor->numPolygons; i++) {
+ delete distanceMatrix[i];
}
delete distanceMatrix;
@@ -242,20 +252,26 @@ bool setFloor(int fileNum) {
void drawFloor() {
int i, j, nV;
- for (i = 0; i < currentFloor -> numPolygons; i ++) {
+ for (i = 0; i < currentFloor->numPolygons; i++) {
// drawLine (i, 0, i + 5, 100);
- nV = currentFloor -> polygon[i].numVertices;
+ nV = currentFloor->polygon[i].numVertices;
if (nV > 1) {
- for (j = 1; j < nV; j ++) {
- drawLine(currentFloor -> vertex[currentFloor -> polygon[i].vertexID[j - 1]].x,
- currentFloor -> vertex[currentFloor -> polygon[i].vertexID[j - 1]].y,
- currentFloor -> vertex[currentFloor -> polygon[i].vertexID[j]].x,
- currentFloor -> vertex[currentFloor -> polygon[i].vertexID[j]].y);
+ for (j = 1; j < nV; j++) {
+ drawLine(
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[j
+ - 1]].x,
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[j
+ - 1]].y,
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[j]].x,
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[j]].y);
}
- drawLine(currentFloor -> vertex[currentFloor -> polygon[i].vertexID[0]].x,
- currentFloor -> vertex[currentFloor -> polygon[i].vertexID[0]].y,
- currentFloor -> vertex[currentFloor -> polygon[i].vertexID[nV - 1]].x,
- currentFloor -> vertex[currentFloor -> polygon[i].vertexID[nV - 1]].y);
+ drawLine(
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[0]].x,
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[0]].y,
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[nV
+ - 1]].x,
+ currentFloor->vertex[currentFloor->polygon[i].vertexID[nV
+ - 1]].y);
}
}
}
@@ -263,14 +279,15 @@ void drawFloor() {
int inFloor(int x, int y) {
int i, r = -1;
- for (i = 0; i < currentFloor -> numPolygons; i ++)
- if (pointInFloorPolygon(currentFloor -> polygon[i], x, y))
+ for (i = 0; i < currentFloor->numPolygons; i++)
+ if (pointInFloorPolygon(currentFloor->polygon[i], x, y))
r = i;
return r;
}
-bool closestPointOnLine(int &closestX, int &closestY, int x1, int y1, int x2, int y2, int xP, int yP) {
+bool closestPointOnLine(int &closestX, int &closestY, int x1, int y1, int x2,
+ int y2, int xP, int yP) {
int xDiff = x2 - x1;
int yDiff = y2 - y1;
generated by cgit v1.2.3 (git 2.25.1) at 2024-08-01 07:47:09 +0000