Home
last modified time | relevance | path

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

/dports/games/libretro-scummvm/scummvm-7b1e929/engines/bladerunner/
H A Dobstacles.h38 static const int kPolygonVertexCount = 160; variable
57 Vector2 vertices[kPolygonVertexCount];
58 VertexType vertexType[kPolygonVertexCount];
H A Dobstacles.cpp67 for (int j = 0; j < kPolygonVertexCount; j++) { in clear()
210 assert(polyMerged.verticeCount < kPolygonVertexCount); in mergePolygons()
214 if (polyMerged.verticeCount >= kPolygonVertexCount) { in mergePolygons()
883 for (int j = 0; j < kPolygonVertexCount; ++j) { in save()
886 for (int j = 0; j < kPolygonVertexCount; ++j) { in save()
914 for (int j = 0; j < kPolygonVertexCount; ++j) { in load()
917 for (int j = 0; j < kPolygonVertexCount; ++j) { in load()
/dports/games/scummvm/scummvm-2.5.1/engines/bladerunner/
H A Dobstacles.h38 static const int kPolygonVertexCount = 160; variable
57 Vector2 vertices[kPolygonVertexCount];
58 VertexType vertexType[kPolygonVertexCount];
H A Dobstacles.cpp67 for (int j = 0; j < kPolygonVertexCount; ++j) { in clear()
210 assert(polyMerged.verticeCount < kPolygonVertexCount); in mergePolygons()
214 if (polyMerged.verticeCount >= kPolygonVertexCount) { in mergePolygons()
884 for (int j = 0; j < kPolygonVertexCount; ++j) { in save()
887 for (int j = 0; j < kPolygonVertexCount; ++j) { in save()
915 for (int j = 0; j < kPolygonVertexCount; ++j) { in load()
918 for (int j = 0; j < kPolygonVertexCount; ++j) { in load()