From 5d74f2ced4206725724d92fd8a5a22f9e1ce8b14 Mon Sep 17 00:00:00 2001 From: skidd13 Date: Mon, 3 Dec 2007 09:19:19 +0000 Subject: (svn r11564) -Codechange: Increase the usage of the for_each_bit macro and rename it fitting to the naming style --- src/core/bitmath_func.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/core') 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. * -- cgit v1.2.3-70-g09d2