diff options
| author | Paweł Kołodziejski | 2003-12-17 08:36:09 +0000 |
|---|---|---|
| committer | Paweł Kołodziejski | 2003-12-17 08:36:09 +0000 |
| commit | 7f03b140d465b1d5bff351fe1d955f9e402ce679 (patch) | |
| tree | 6ea03cbaab2e3ef2b76b49f4fbd813b722e911dd | |
| parent | 8b12be81e52334a1267469052ad61061e6a5e087 (diff) | |
| download | scummvm-rg350-7f03b140d465b1d5bff351fe1d955f9e402ce679.tar.gz scummvm-rg350-7f03b140d465b1d5bff351fe1d955f9e402ce679.tar.bz2 scummvm-rg350-7f03b140d465b1d5bff351fe1d955f9e402ce679.zip | |
fixed warning
svn-id: r11705
| -rw-r--r-- | sword2/router.cpp | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/sword2/router.cpp b/sword2/router.cpp index ae79c55fd3..f6ca345c35 100644 --- a/sword2/router.cpp +++ b/sword2/router.cpp @@ -355,6 +355,7 @@ int32 Router::smoothestPath() { // This is because I was unable to derive a function to relate number // of steps taken between two points to the shrunken step size + int i; int32 steps = 0; int32 lastDir; int32 tempturns[4]; @@ -442,7 +443,7 @@ int32 Router::smoothestPath() { tempturns[3] = DD; turns[3] = 3; - for (int i = 0; i < 3; i++) { + for (i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { if (tempturns[j] > tempturns[j + 1]) { SWAP(turns[j], turns[j + 1]); @@ -459,7 +460,7 @@ int32 Router::smoothestPath() { assert(options); - int i = 0; + i = 0; steps = 0; do { |