All algorithms should return the number of matches
[2dmatching.git] / code.h
blob0ec37df7c696b5887685a9af226719fde2b56cc7
1 #include <stdlib.h>
2 #include <string.h>
3 #include <stdio.h>
4 #include <time.h>
5 #include <mpi/mpi.h>
7 extern void load_files();
9 extern void print_pattern();
11 extern void create_files(int pattern_size, int text_size, int alphabet);
13 extern int power(int number, int power);
15 extern unsigned int naive();
17 extern unsigned int karp();
19 extern unsigned int zhu( int version );
21 extern unsigned int bird();
23 extern unsigned int bird2();
25 extern unsigned int baeza();
27 extern unsigned int baeza2();
29 extern unsigned int search_kmp();
31 extern unsigned int search_bm();
33 extern int aho( int trow, int tcolumn, int prow, int tlength );
35 #define Q 16647133 /* A big prime number for the Zhu algorithm*/
37 #define m 4/*pattern size*/
38 #define n 1000/*text size*/
40 /*Don't forget to change MAXCHAR on aho.c */
42 #define ALPHABET_SIZE 2
44 int pattern[m][m];
46 int text[n][n];
48 double pattern2[m];
50 double text2[n*n];