luke/abc
1
0
Fork 0
mirror of https://github.com/YosysHQ/abc.git synced 2026-09-07 03:05:36 +02:00
Code Issues Packages Projects Releases Wiki Activity

Changes and improvements to different packages.

Browse Source
This commit is contained in:
Alan Mishchenko
2014-06-26 09:51:53 -07:00
parent 2edf2a970e
commit a68ec38df1
5 changed files with 60 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/misc/vec/vecInt.h
+15 -4
View File
@@ -1715,16 +1715,27 @@ static inline void Vec_IntSelectSort( int * pArray, int nSize )
***********************************************************************/
static inline void Vec_IntSelectSortCost( int * pArray, int nSize, Vec_Int_t * vCosts )
{
int temp, i, j, best_i;
int i, j, best_i;
for ( i = 0; i < nSize-1; i++ )
{
best_i = i;
for ( j = i+1; j < nSize; j++ )
if ( Vec_IntEntry(vCosts, pArray[j]) < Vec_IntEntry(vCosts, pArray[best_i]) )
best_i = j;
temp = pArray[i];
pArray[i] = pArray[best_i];
pArray[best_i] = temp;
ABC_SWAP( int, pArray[i], pArray[best_i] );
}
}
static inline void Vec_IntSelectSortCost2( int * pArray, int nSize, int * pCosts )
{
int i, j, best_i;
for ( i = 0; i < nSize-1; i++ )
{
best_i = i;
for ( j = i+1; j < nSize; j++ )
if ( pCosts[j] < pCosts[best_i] )
best_i = j;
ABC_SWAP( int, pArray[i], pArray[best_i] );
ABC_SWAP( int, pCosts[i], pCosts[best_i] );
}
}