73 int i, Entry, uUnique;
74 vRes = Hsh_IntManHashArray(
p->vCutData, 4 );
75 for ( i = 0; i <=
p->pPars->nLutSize; i++ )
76 vTest[i] = Vec_IntAlloc( 1000 );
78 Vec_IntPush( vTest[Vec_IntEntry(
p->vCutData, 4*i+2)], Entry );
79 for ( i = 0; i <=
p->pPars->nLutSize; i++ )
81 uUnique = Vec_IntCountUnique(vTest[i]);
82 printf(
"%2d-var entries = %8d. (%6.2f %%) Unique entries = %8d. (%6.2f %%)\n",
83 i, Vec_IntSize(vTest[i]), 100.0*Vec_IntSize(vTest[i])/Abc_MaxInt(1, Vec_IntSize(vRes)),
84 uUnique, 100.0*uUnique/Abc_MaxInt(1, Vec_IntSize(vTest[i])) );
86 for ( i = 0; i <=
p->pPars->nLutSize; i++ )
87 Vec_IntFree( vTest[i] );
88 uUnique = Vec_IntCountUnique(vRes);
89 printf(
"Total entries = %8d. (%6.2f %%) Unique entries = %8d. (%6.2f %%)\n",
90 Vec_IntSize(
p->vCutData)/4, 100.0, uUnique, 100.0*uUnique/Abc_MaxInt(1, Vec_IntSize(
p->vCutData)/4) );