renamed function names from german to english

Change-Id: I201dc723a22097709858b0a3489ac8a562cfccc2
Reviewed-on: https://gerrit.libreoffice.org/11450Reviewed-by: Eike Rathke <erack@redhat.com>
Tested-by: Eike Rathke <erack@redhat.com>

i18npool/source/search/levdis.cxx

@@ -276,10 +276,10 @@ int WLevDistance::CalcLPQR( int nX, int nY, int nZ, bool bRelaxed )
         if ( 0 == (nMid = Mid3( nX, nY, nZ )) )     // even two 0
             nLimit = nMax;  // either 0 or the only one >0
         else        // one is 0
-            nLimit = KGV( nMid, nMax );
+            nLimit = LCM( nMid, nMax );
     }
     else        // all three of them are not 0
-        nLimit = KGV( KGV( nX, nY ), nZ );
+        nLimit = LCM( LCM( nX, nY ), nZ );
     nRepP0 = ( nX ? nLimit / nX : nLimit + 1 );
     nInsQ0 = ( nY ? nLimit / nY : nLimit + 1 );
     nDelR0 = ( nZ ? nLimit / nZ : nLimit + 1 );
@@ -289,7 +289,7 @@ int WLevDistance::CalcLPQR( int nX, int nY, int nZ, bool bRelaxed )
 
 // greatest common divisior according to  Euklid (chaindivision)
 // special case: 0 plus anything produces 1
-int WLevDistance::GGT( int a, int b )
+int WLevDistance::GCD( int a, int b )
 {
     if ( !a || !b )
         return 1;
@@ -305,13 +305,13 @@ int WLevDistance::GGT( int a, int b )
     return( a ? a : b);
 }
 
-// least common multiple : a * b / GGT(a,b)
-int WLevDistance::KGV( 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
-        return( (a / GGT(a,b)) * b );
+        return( (a / GCD(a,b)) * b );
     else
-        return( (b / GGT(a,b)) * a );
+        return( (b / GCD(a,b)) * a );
 }
 
 // Minimum of three values

i18npool/source/search/levdis.hxx

@@ -37,7 +37,7 @@
 
  Wertebereich fuer X,Y,Z ist 0..33 um mit Limit sicher unter
  16-bit-signed-int-max zu bleiben, 31*32*33 gibt das Maximum
- KGV(31,32,33) == 32736
+ LCM(31,32,33) == 32736
  */
 
 #define LEVDISDEFAULT_XOTHER    2
@@ -132,8 +132,8 @@ class WLevDistance
     inline int Min3( int x, int y, int z );     // inline wegen Schleife
     int Mid3( int x, int y, int z );
     int Max3( int x, int y, int z );
-    int GGT( int a, int b );     // Groesster Gemeinsamer Teiler
-    int KGV( int a, int b );     // Kleinstes Gemeinsames Vielfaches
+    int GCD( int a, int b );     // Groesster Gemeinsamer Teiler
+    int LCM( int a, int b );     // Kleinstes Gemeinsames Vielfaches
 
 public:
     // CToren mit Userangaben, danach mit GetLimit() Limit holen