Strings vergleichen

#include <windows.h>
#include "project.h"


#ifdef WIN32
/*
 * Number of micro-seconds between the beginning of the Windows epoch
 * (Jan. 1, 1601) and the Unix epoch (Jan. 1, 1970).
 *
 * This assumes all Win32 compilers have 64-bit support.
 */
#if defined(_MSC_VER) || defined(_MSC_EXTENSIONS) || defined(__WATCOMC__)
  #define DELTA_EPOCH_IN_USEC  11644473600000000Ui64
#else
  #define DELTA_EPOCH_IN_USEC  11644473600000000ULL
#endif
typedef	unsigned long long	u_int64_t;
static u_int64_t filetime_to_unix_epoch (const FILETIME *ft)
{
    u_int64_t res = (u_int64_t) ft->dwHighDateTime << 32;


    res |= ft->dwLowDateTime;
    res /= 10;                   /* from 100 nano-sec periods to usec */
    res -= DELTA_EPOCH_IN_USEC;  /* from Win epoch to Unix epoch */
    return (res);
}
#endif


BOOL WINAPI DllMain(HINSTANCE hinstDLL, DWORD fdwReason, LPVOID lpvReserved)
{
    switch (fdwReason)
    {
        case DLL_PROCESS_ATTACH:
            // attach to process
            // return FALSE to fail DLL load
            break;


        case DLL_PROCESS_DETACH:
            // detach from process
            break;


        case DLL_THREAD_ATTACH:
            // attach to thread
            break;


        case DLL_THREAD_DETACH:
            // detach from thread
            break;
    }
    return TRUE; // succesful
}




#ifdef __cplusplus
// Inhalt
// min3($a,$b,$c) - Minimum aus drei Werten wird zurückgegben
// LevenshteinDistance($s, $t) - Gibt Levenshteinabstand der beide Zeichenketten zurück
//   Für die Levenshtein-Distanz gelten einige obere und untere Schranken:
//       * sie beträgt mindestens den Unterschied der Längen beider Strings
//       * sie beträgt höchstens die Länge des längeren Strings
//       * sie ist dann und nur dann 0, wenn beide Strings identisch sind




using std::cerr;
using std::cout;
using std::ifstream;


int min3(int a, int b, int c) {
   int dummy;


   dummy = a;
   if (b < dummy) {dummy = b;}
   if (c < dummy) {dummy = c;}
   return dummy;
}




DLL_EXPORT int __stdcall LevenshteinDistance (char * S1, char * S2) {
    int n = strlen(S1), m = strlen(S2);


    if (!strcmpi(S1, S2)) return 0;
    if (!n) return m;
    if (!m) return n;


    int d[n+1][m+1], i, j, cost;


    for (i=0;i<=n;i++) d[i][0] = i;
    for (j=0;j<=m;j++) d[0][j] = j;


    for (i=1;i<=n;i++) {
        for (j=1;j<=m;j++) {
            if (S1[i-1] == S2[j-1])
                cost = 0;
            else
                cost = 1;


            d[i][j] = min3(d[i-1][j] + 1, d[i][j-1] + 1, d[i-1][j-1] + cost);
        }
    }


    return d[n][m];
}




#endif // __cplusplus