diff options
| author | skidd13 <skidd13@openttd.org> | 2007-12-03 09:19:19 +0000 |
|---|---|---|
| committer | skidd13 <skidd13@openttd.org> | 2007-12-03 09:19:19 +0000 |
| commit | 5d74f2ced4206725724d92fd8a5a22f9e1ce8b14 (patch) | |
| tree | ffda3073f527cfcef5eb31264655b305398d87ab /src/core | |
| parent | 2b372e7e7b7aa04a45dd218681a3f1ed76d812ce (diff) | |
| download | openttd-5d74f2ced4206725724d92fd8a5a22f9e1ce8b14.tar.xz | |
(svn r11564) -Codechange: Increase the usage of the for_each_bit macro and rename it fitting to the naming style
Diffstat (limited to 'src/core')
| -rw-r--r-- | src/core/bitmath_func.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/core/bitmath_func.cpp b/src/core/bitmath_func.cpp index 53139308a..bbfad72ff 100644 --- a/src/core/bitmath_func.cpp +++ b/src/core/bitmath_func.cpp @@ -48,7 +48,7 @@ uint8 FindFirstBit(uint32 x) * Search the last set bit in a 32 bit variable. * * This algorithm is a static implementation of a log - * conguence search algorithm. It checks the first half + * conguence search algorithm. It checks the second half * if there is a bit set search there further. And this * way further. If no bit is set return 0. * |