diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2020-01-27 10:43:37 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2020-01-27 10:43:37 -0800 |
| commit | 951afa27cb5f2621ddac2f003a4844288e01eddf (patch) | |
| tree | cce115371b41ace2b78bc630758782cfbe252200 /src/base/acb/acbFunc.c | |
| parent | 8c8f39ad7603362c7e16598d1888313f2e6ca0a0 (diff) | |
| download | abc-951afa27cb5f2621ddac2f003a4844288e01eddf.tar.gz abc-951afa27cb5f2621ddac2f003a4844288e01eddf.tar.bz2 abc-951afa27cb5f2621ddac2f003a4844288e01eddf.zip | |
Cleaning up code and fixing for several typos.
Diffstat (limited to 'src/base/acb/acbFunc.c')
| -rw-r--r-- | src/base/acb/acbFunc.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/base/acb/acbFunc.c b/src/base/acb/acbFunc.c index 6ffeb0e8..ff7e4504 100644 --- a/src/base/acb/acbFunc.c +++ b/src/base/acb/acbFunc.c @@ -1094,7 +1094,7 @@ Vec_Int_t * Acb_FindSupport( sat_solver * pSat, int iFirstDiv, Vec_Int_t * vWeig vSuppBest = Vec_IntDup( vSuppStart ); printf( "Starting cost = %d.\n", CostBest ); - // interatively find the one with the most ones in the uncovered rows + // iteratively find the one with the most ones in the uncovered rows for ( Iter = 0; Iter < 200; Iter++ ) { if ( Abc_Clock() > clkLimit ) |