int BV_comp(pbit_vect bv, pbit_vect bv2)
{
my_assert(bv->n<10001);
int flag=1;
for (unsigned int i= 0; i<bv->n; ++i) {
if(!(BV_get(bv,i)==BV_get(bv2,i)))
flag=0;
}
return flag;
}
int countTrue(pbit_vect bv)
{
int cont=0;
for(unsigned int i=0;i<bv->n;i++){
if(BV_get(bv,i)==true){
cont=cont+1;
}
}
return cont;
}
int main(void) {
INFO("MIN-FACTORIZATION");
PRINT_LICENSE_INFORMATION;
PRINT_SYSTEM_INFORMATION;
pmytime timer= MYTIME_create_with_name("Timer");
pmytime ttot= MYTIME_create_with_name("Total");
MYTIME_start(ttot);
plist p= read_factorizations(stdin);
//Inizializzo a NULL
pbit_vect bv=NULL;
MYTIME_start(timer);
INFO("Colored matrix creation...");
bool is_not_window;
//Colorazione della matrice sulla base degli esoni come fattori unici
is_not_window=true;
//Colorazione della matrice sulla base delle finestre di contenimento degli esoni
is_not_window=false;
plist unique_factors= color_matrix_create(p, is_not_window);
// color_matrix_print(p);
INFO("Colored matrix created!");
#if defined (LOG_MSG) && (LOG_LEVEL_DEBUG <= LOG_THRESHOLD)
print_factors_list(unique_factors,is_not_window);
#endif
//exit(1);
/*plistit list_it_est=list_first(p);
while(listit_has_next(list_it_est)){
pEST est=listit_next(list_it_est);
plistit temp=list_first(est->bin_factorizations);
while(listit_has_next(temp)){
fprintf(stdout, ">EST %s\n", est->info->EST_id);
pbit_vect ltemp=(pbit_vect)listit_next(temp);
unsigned int i;
for(i=0; i<ltemp->n; i++){
fprintf(stdout, "%d", BV_get(ltemp,i));
}
fprintf(stdout, "\n");
}
listit_destroy(temp);
}
listit_destroy(list_it_est);
exit(1);*/
MYTIME_stop(timer);
MYTIME_LOG(INFO, timer);
MYTIME_reset(timer);
MYTIME_start(timer);
INFO("Starting simplification");
psimpl psimp= simplification(p,unique_factors);
psimpl_print(psimp);
/*unsigned int j;
fprintf(stdout, "Used: ");
for(j=0; j<psimp->factors_used->n; j++){
if(BV_get(psimp->factors_used,j))
fprintf(stdout, "%d-", j);
}*/
//exit(1);
//fprintf(stdout, "ESTs %d factors %d\n", list_size(p), psimp->factors_used->n);
//exit(1);
/*unsigned int j;
fprintf(stdout, "Used: ");
for(j=0; j<psimp->factors_used->n; j++){
if(BV_get(psimp->factors_used,j))
fprintf(stdout, "%d-", j);
}
fprintf(stdout, "\n");
fprintf(stdout, "ESTs ok: ");
unsigned int c=0;
for(j=0; j<psimp->ests_ok->n; j++){
if(BV_get(psimp->ests_ok,j)){
fprintf(stdout, "%d-", j);
c++;
}
}
fprintf(stdout, "\nSimplified rows %d", c);
fprintf(stdout, "\n");
fprintf(stdout, "Not used: ");
for(j=0; j<psimp->factors_not_used->n; j++){
if(BV_get(psimp->factors_not_used,j))
fprintf(stdout, "%d-", j);
}
fprintf(stdout, "\n");
exit(1);*/
//printf("usati: %s", BV_to_string(psimp->ests_ok));
//exit(1);
plist pl= color_matrix_simplified_create(p,psimp);
//color_matrix_print(pl);
//exit(1);
//Se pl e' vuota significa che tutti i fattori sono necessari
INFO("Simplification terminated!");
MYTIME_stop(timer);
MYTIME_LOG(INFO, timer);
MYTIME_reset(timer);
MYTIME_start(timer);
INFO("Start search of the minimum factorization");
if(!BV_all_true(psimp->ests_ok)){
bv= min_fact(pl);
INFO("Search of the minimum factorization completed");
} else {
INFO("Minimum factorization is already found by simplification.");
}
print_factorizations_result(bv,p,unique_factors,psimp);
unsigned int q;
unsigned int count_used_opt=0;
for(q=0; q<psimp->factors_used->n; q++){
if (BV_get(psimp->factors_used,q)){
//INFO("U %d ", q);
count_used_opt++;
}
}
INFO("Factors used in the optimum: %d", count_used_opt);
MYTIME_stop(timer);
MYTIME_LOG(INFO, timer);
list_destroy(p,(delete_function)EST_destroy);
color_matrix_simplified_destroy(pl);
list_destroy(unique_factors,(delete_function)factor_destroy);
psimpl_destroy(psimp);
//Controllo!! Altrimenti potrebbe dare segm. fault!!
if(bv != NULL)
BV_destroy(bv);
MYTIME_stop(ttot);
MYTIME_LOG(INFO, ttot);
MYTIME_destroy(ttot);
MYTIME_destroy(timer);
}
