diff options
| author | Andrea Gelmini <andrea.gelmini@gelma.net> | 2015-09-29 17:54:04 +0200 |
|---|---|---|
| committer | Oliver Specht <oliver.specht@cib.de> | 2015-09-30 12:41:09 +0000 |
| commit | a50539e2aa79bfef74c1100c252020972d436e77 (patch) | |
| tree | 9f282bbc336fad97557c71ab6d92d6857f2162f4 /i18npool/source/search/levdis.cxx | |
| parent | eab0904f0edda70334532b5cbf466717966f5db0 (diff) | |
Fix typos
Change-Id: Iab78219aff60a7a45a319a96f326e27a6e8e25b8
Reviewed-on: https://gerrit.libreoffice.org/18953
Reviewed-by: Oliver Specht <oliver.specht@cib.de>
Tested-by: Oliver Specht <oliver.specht@cib.de>
Diffstat (limited to 'i18npool/source/search/levdis.cxx')
| -rw-r--r-- | i18npool/source/search/levdis.cxx | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/i18npool/source/search/levdis.cxx b/i18npool/source/search/levdis.cxx index c0dc37a0ee80..f15d6ca24894 100644 --- a/i18npool/source/search/levdis.cxx +++ b/i18npool/source/search/levdis.cxx @@ -289,7 +289,7 @@ int WLevDistance::CalcLPQR( int nX, int nY, int nZ, bool bRelaxed ) return nLimit; } -// greatest common divisior according to Euklid (chaindivision) +// greatest common divisor according to Euklid (chaindivision) // special case: 0 plus anything produces 1 int WLevDistance::GCD( int a, int b ) { @@ -310,7 +310,7 @@ int WLevDistance::GCD( int a, int b ) // least common multiple : a * b / GCD(a,b) int WLevDistance::LCM( int a, int b ) { - if ( a > b ) // decrease owerflow chance + if ( a > b ) // decrease overflow chance return( (a / GCD(a,b)) * b ); else return( (b / GCD(a,b)) * a ); |