From 596bbbe6dc3f8311a5166269d651d50ec6b2dff8 Mon Sep 17 00:00:00 2001 From: Alan Mishchenko Date: Sun, 19 Feb 2012 13:16:51 -0800 Subject: Added QuickSort based on 3-way partitioning. --- src/aig/saig/saigAbsCba.c | 2 +- src/aig/saig/saigIsoFast.c | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) (limited to 'src/aig/saig') diff --git a/src/aig/saig/saigAbsCba.c b/src/aig/saig/saigAbsCba.c index e8b68a6f..e4fc6cad 100644 --- a/src/aig/saig/saigAbsCba.c +++ b/src/aig/saig/saigAbsCba.c @@ -113,7 +113,7 @@ Vec_Int_t * Saig_ManCbaFilterFlops( Aig_Man_t * pAig, Abc_Cex_t * pAbsCex, Vec_I Vec_IntForEachEntry( vAbsFfsToAdd, Entry, i ) Vec_IntPush( vFlopAddCosts, -Vec_IntEntry(vFlopCosts, Entry) ); // sort the flops - pPerm = Abc_SortCost( Vec_IntArray(vFlopAddCosts), Vec_IntSize(vFlopAddCosts) ); + pPerm = Abc_MergeSortCost( Vec_IntArray(vFlopAddCosts), Vec_IntSize(vFlopAddCosts) ); // shrink the array vFfsToAddBest = Vec_IntAlloc( nFfsToSelect ); for ( i = 0; i < nFfsToSelect; i++ ) diff --git a/src/aig/saig/saigIsoFast.c b/src/aig/saig/saigIsoFast.c index a415dcc8..befbf934 100644 --- a/src/aig/saig/saigIsoFast.c +++ b/src/aig/saig/saigIsoFast.c @@ -219,7 +219,7 @@ Vec_Int_t * Iso_StoCollectInfo( Iso_Sto_t * p, Aig_Obj_t * pPo ) // printf( "%d ", Vec_IntSize(p->vVisited) ); // sort the costs in the increasing order - pPerm = Abc_SortCost( Vec_IntArray(p->vVisited), Vec_IntSize(p->vVisited) ); + pPerm = Abc_MergeSortCost( Vec_IntArray(p->vVisited), Vec_IntSize(p->vVisited) ); assert( Vec_IntEntry(p->vVisited, pPerm[0]) <= Vec_IntEntry(p->vVisited, pPerm[Vec_IntSize(p->vVisited)-1]) ); // create information -- cgit v1.2.3