Home
last modified time | relevance | path

Searched refs:kPolygonCount (Results 1 – 4 of 4) sorted by relevance

/dports/games/libretro-scummvm/scummvm-7b1e929/engines/bladerunner/
H A Dobstacles.cpp44 _polygons = new Polygon[kPolygonCount]; in Obstacles()
45 _polygonsBackup = new Polygon[kPolygonCount]; in Obstacles()
64 for (int i = 0; i < kPolygonCount; i++) { in clear()
297 for (int i = 0; i < kPolygonCount; ++i) { in add()
329 for (int i = 0; i < kPolygonCount; i++) { in findEmptyPolygon()
354 static bool polygonVisited[kPolygonCount]; in findNextWaypoint()
358 for (int i = 0; i != kPolygonCount; ++i) { in findNextWaypoint()
371 for (int i = 0; i != kPolygonCount; ++i) { in findNextWaypoint()
540 for (int i = 0; i != kPolygonCount; ++i) { in findPolygonVerticeByXZ()
897 for (int i = 0; i < kPolygonCount; ++i) { in load()
[all …]
H A Dobstacles.h37 static const int kPolygonCount = 50; variable
/dports/games/scummvm/scummvm-2.5.1/engines/bladerunner/
H A Dobstacles.cpp44 _polygons = new Polygon[kPolygonCount]; in Obstacles()
45 _polygonsBackup = new Polygon[kPolygonCount]; in Obstacles()
64 for (int i = 0; i < kPolygonCount; ++i) { in clear()
298 for (int i = 0; i < kPolygonCount; ++i) { in add()
330 for (int i = 0; i < kPolygonCount; ++i) { in findEmptyPolygon()
355 static bool polygonVisited[kPolygonCount]; in findNextWaypoint()
359 for (int i = 0; i != kPolygonCount; ++i) { in findNextWaypoint()
372 for (int i = 0; i != kPolygonCount; ++i) { in findNextWaypoint()
541 for (int i = 0; i != kPolygonCount; ++i) { in findPolygonVerticeByXZ()
898 for (int i = 0; i < kPolygonCount; ++i) { in load()
[all …]
H A Dobstacles.h37 static const int kPolygonCount = 50; variable