C++ (Cpp) makeup_labels示例

示例#1

文件： equiv.c 项目： CaptainTrunky/espresso-ab

void find_equiv_outputs(pPLA PLA)
{
  int i, j, ipart, jpart, some_equiv;
  pcover *R, *F;

  some_equiv = FALSE;

  makeup_labels(PLA);

  F = ALLOC(pcover, cube.part_size[cube.output]);
  R = ALLOC(pcover, cube.part_size[cube.output]);

  for(i = 0; i < cube.part_size[cube.output]; i++) {
    ipart = cube.first_part[cube.output] + i;
    R[i] = cof_output(PLA->R, ipart);
    F[i] = complement(cube1list(R[i]));
  }

  for(i = 0; i < cube.part_size[cube.output]-1; i++) {
    for(j = i+1; j < cube.part_size[cube.output]; j++) {
      ipart = cube.first_part[cube.output] + i;
      jpart = cube.first_part[cube.output] + j;

      if (check_equiv(F[i], F[j])) {
        printf("# Outputs %d and %d (%s and %s) are equivalent\n",
            i, j, PLA->label[ipart], PLA->label[jpart]);
        some_equiv = TRUE;
      } else if (check_equiv(F[i], R[j])) {
        printf("# Outputs %d and NOT %d (%s and %s) are equivalent\n",
            i, j, PLA->label[ipart], PLA->label[jpart]);
        some_equiv = TRUE;
      } else if (check_equiv(R[i], F[j])) {
        printf("# Outputs NOT %d and %d (%s and %s) are equivalent\n",
            i, j, PLA->label[ipart], PLA->label[jpart]);
        some_equiv = TRUE;
      } else if (check_equiv(R[i], R[j])) {
        printf("# Outputs NOT %d and NOT %d (%s and %s) are equivalent\n",
            i, j, PLA->label[ipart], PLA->label[jpart]);
        some_equiv = TRUE;
      }
    }
  }

  if (! some_equiv) {
    printf("# No outputs are equivalent\n");
  }

  for(i = 0; i < cube.part_size[cube.output]; i++) {
    free_cover(F[i]);
    free_cover(R[i]);
  }
  FREE(F);
  FREE(R);
}

示例#2

文件： equiv.c 项目： CARV-ICS-FORTH/scoop

find_equiv_outputs(pPLA PLA)
{
int i, j, ipart, jpart, some_equiv;
pset_family *R, *F;
some_equiv = 0;
makeup_labels(PLA);
F = ((pset_family *) malloc(sizeof(pset_family) * ( cube.part_size[cube.output])));
R = ((pset_family *) malloc(sizeof(pset_family) * ( cube.part_size[cube.output])));
for(i = 0; i < cube.part_size[cube.output]; i++) {
ipart = cube.first_part[cube.output] + i;
R[i] = cof_output(PLA->R, ipart);
F[i] = complement(cube1list(R[i]));
}
for(i = 0; i < cube.part_size[cube.output]-1; i++) {
for(j = i+1; j < cube.part_size[cube.output]; j++) {
ipart = cube.first_part[cube.output] + i;
jpart = cube.first_part[cube.output] + j;
if (check_equiv(F[i], F[j])) {
printf("# Outputs %d and %d (%s and %s) are equivalent\n",
i, j, PLA->label[ipart], PLA->label[jpart]);
some_equiv = 1;
} else if (check_equiv(F[i], R[j])) {
printf("# Outputs %d and NOT %d (%s and %s) are equivalent\n",
i, j, PLA->label[ipart], PLA->label[jpart]);
some_equiv = 1;
} else if (check_equiv(R[i], F[j])) {
printf("# Outputs NOT %d and %d (%s and %s) are equivalent\n",
i, j, PLA->label[ipart], PLA->label[jpart]);
some_equiv = 1;
} else if (check_equiv(R[i], R[j])) {
printf("# Outputs NOT %d and NOT %d (%s and %s) are equivalent\n",
i, j, PLA->label[ipart], PLA->label[jpart]);
some_equiv = 1;
}
}
}
if (! some_equiv) {
printf("# No outputs are equivalent\n");
}
for(i = 0; i < cube.part_size[cube.output]; i++) {
sf_free(F[i]);
sf_free(R[i]);
}
((F) ? (free((char *) (F)), (F) = 0) : 0);
((R) ? (free((char *) (R)), (R) = 0) : 0);
}