diff options
| author | planetmaker <planetmaker@openttd.org> | 2013-01-08 22:46:42 +0000 |
|---|---|---|
| committer | planetmaker <planetmaker@openttd.org> | 2013-01-08 22:46:42 +0000 |
| commit | c24374f99c22d9420d6d182ff835f07a5b954b48 (patch) | |
| tree | 7043ad53c941668339a0949867e10888f9e54f16 /src/core/bitmath_func.cpp | |
| parent | 89a2ba2a6d25e605c391e7343ba66090ee9f26de (diff) | |
| download | openttd-c24374f99c22d9420d6d182ff835f07a5b954b48.tar.xz | |
(svn r24900) -Fix [FS#5389]: Comments with typos (most fixes supplied by Eagle_rainbow)
Diffstat (limited to 'src/core/bitmath_func.cpp')
| -rw-r--r-- | src/core/bitmath_func.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/core/bitmath_func.cpp b/src/core/bitmath_func.cpp index 12937168a..af0200bcb 100644 --- a/src/core/bitmath_func.cpp +++ b/src/core/bitmath_func.cpp @@ -27,7 +27,7 @@ const uint8 _ffb_64[64] = { * Search the first set bit in a 32 bit variable. * * This algorithm is a static implementation of a log - * conguence search algorithm. It checks the first half + * congruence search algorithm. It checks the first half * if there is a bit set search there further. And this * way further. If no bit is set return 0. * @@ -55,7 +55,7 @@ uint8 FindFirstBit(uint32 x) * Search the last set bit in a 64 bit variable. * * This algorithm is a static implementation of a log - * conguence search algorithm. It checks the second half + * congruence 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. * |