void destruct_matcher(struct Matcher * matcher){
int i;
for (i = 0; i < matcher->numOfClasses; ++i)
destruct_signature(matcher->signatures[i]);
free(matcher->signatures);
destruct_KTree(matcher->ktree);
destruct_mapper(matcher->mapper);
free(matcher);
}
void test1(){
struct KTree *ktree;
ktree = new_KTree();
struct KTreeNode * ptr_addedKeyword;
ptr_addedKeyword = add_keyword(ktree, "01", 2);
ptr_addedKeyword = add_keyword(ktree, "012", 3);
ptr_addedKeyword = add_keyword(ktree, "012", 3);
char * string_broken = "012\n3";
ptr_addedKeyword = add_keyword(ktree, string_broken, 5);
trace_back_keyword(ktree, 3);
destruct_KTree(ktree);
}
void test1_5(){
struct KTree *ktree;
ktree = new_KTree();
struct KTreeNode * ptr_addedKeyword;
ptr_addedKeyword = add_keyword(ktree, "bist", 4);
ptr_addedKeyword = add_keyword(ktree, "ist", 3);
ptr_addedKeyword = add_keyword(ktree, "ist", 3);
ptr_addedKeyword = add_keyword(ktree, "abcdef", 6);
printf("find_string: %i\n", find_string(ktree, "012"));
int * matches;
char * flow = "istn\n \0\12\n30130123\n012313230103";
matches = match(ktree, flow, strlen(flow));
int i;
for (i = 0; i < ktree->numofkeywords_actual; ++i)
printf("%i : ", matches[i]);
printf("\n");
destruct_KTree(ktree);
}
