zhu.c

   1 #include "code.h"
   2
   3 unsigned int zhu( int version )
   4 {
   5         unsigned int i = 0, j = 0, k = 0, matches;
   6
   7         /* Huge optimization instead of unsigned int B */
   8         #define B 128
   9
  10         #define limit n * n - (n * ( m - 1 ))
  11
  12         /* Reduce text to 1d and calculate hash */
  13         for( k = 0; k < limit; k = n + k )
  14                 for( j = 0 + k; j < n + k; j++ ) {
  15                         text2[j] = 0;
  16
  17                         for( i = 0; i < m; i++ )
  18                                 text2[j] = text2[j] * B + text[i][j] % Q;
  19                 }
  20
  21         /* Reduce pattern to 1d and calculate hash */
  22         for( j = 0; j < m; j++ ) {
  23                 pattern2[j] = 0;
  24
  25                 for( i = 0; i < m; i++ )
  26                         pattern2[j] = ( pattern2[j] * B ) + pattern[i][j] % Q;
  27         }
  28
  29         if ( version == 1 )
  30                 matches = search_kmp();
  31
  32         else
  33                 matches = search_bm();
  34
  35         return matches;
  36 }