diff --git a/Detour/Source/DetourStatNavMesh.cpp b/Detour/Source/DetourStatNavMesh.cpp index 163ac16..8c18ca1 100755 --- a/Detour/Source/DetourStatNavMesh.cpp +++ b/Detour/Source/DetourStatNavMesh.cpp @@ -467,7 +467,7 @@ public: inline void modify(dtNode* node) { - for (unsigned i = 0; i < m_size; ++i) + for (int i = 0; i < m_size; ++i) { if (m_heap[i] == node) { @@ -1101,7 +1101,7 @@ int dtStatNavMesh::findPolysAround(dtPolyRef centerRef, const float* centerPos, startNode->flags = dtNode::OPEN; m_openList->push(startNode); - unsigned n = 0; + int n = 0; if (n < maxResult) { if (resultRef) @@ -1224,7 +1224,7 @@ int dtStatNavMesh::queryPolygons(const float* center, const float* extents, bmax[2] = (unsigned short)(ics * maxz + 1) | 1; // Traverse tree - unsigned n = 0; + int n = 0; while (node < end) { bool overlap = checkOverlapBox(bmin, bmax, node->bmin, node->bmax); diff --git a/Detour/Source/DetourStatNavMeshBuilder.cpp b/Detour/Source/DetourStatNavMeshBuilder.cpp index 400e9c2..125d8c2 100755 --- a/Detour/Source/DetourStatNavMeshBuilder.cpp +++ b/Detour/Source/DetourStatNavMeshBuilder.cpp @@ -72,7 +72,7 @@ void calcExtends(BVItem* items, int nitems, int imin, int imax, bmax[1] = items[imin].bmax[1]; bmax[2] = items[imin].bmax[2]; - for (unsigned i = imin+1; i < imax; ++i) + for (int i = imin+1; i < imax; ++i) { const BVItem& it = items[i]; if (it.bmin[0] < bmin[0]) bmin[0] = it.bmin[0]; diff --git a/RecastDemo/Bin/Recast.exe b/RecastDemo/Bin/Recast.exe index a1a099d..6dc193f 100644 Binary files a/RecastDemo/Bin/Recast.exe and b/RecastDemo/Bin/Recast.exe differ diff --git a/RecastDemo/Build/VC9/Recast.vcproj b/RecastDemo/Build/VC9/Recast.vcproj index e07c9f2..0c24cfc 100644 --- a/RecastDemo/Build/VC9/Recast.vcproj +++ b/RecastDemo/Build/VC9/Recast.vcproj @@ -41,7 +41,7 @@ + + + + + + @@ -234,6 +246,18 @@ Filter="h;hpp;hxx;hm;inl;inc;xsd" UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}" > + + + + + +