diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2021-09-26 11:30:54 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2021-09-26 11:30:54 -0700 |
| commit | ba64e78608064612db61d6515f19dd2cabe69cee (patch) | |
| tree | d4df3672f9d056a010244711f73c848e020168e8 /src/aig/hop | |
| parent | 2ce1ce8bed69623de58d9394e22a3a8812096561 (diff) | |
| download | abc-ba64e78608064612db61d6515f19dd2cabe69cee.tar.gz abc-ba64e78608064612db61d6515f19dd2cabe69cee.tar.bz2 abc-ba64e78608064612db61d6515f19dd2cabe69cee.zip | |
Changing declaration of Vec_Ptr_t sorting function to satisfy some compilers.
Diffstat (limited to 'src/aig/hop')
| -rw-r--r-- | src/aig/hop/hopBalance.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/aig/hop/hopBalance.c b/src/aig/hop/hopBalance.c index e9aa4d4d..a3ce1c86 100644 --- a/src/aig/hop/hopBalance.c +++ b/src/aig/hop/hopBalance.c @@ -246,7 +246,7 @@ Hop_Obj_t * Hop_NodeBalanceBuildSuper( Hop_Man_t * p, Vec_Ptr_t * vSuper, Hop_Ty int LeftBound; assert( vSuper->nSize > 1 ); // sort the new nodes by level in the decreasing order - Vec_PtrSort( vSuper, (int (*)(void))Hop_NodeCompareLevelsDecrease ); + Vec_PtrSort( vSuper, (int (*)(const void *, const void *))Hop_NodeCompareLevelsDecrease ); // balance the nodes while ( vSuper->nSize > 1 ) { |