Skip to content

Typos found by lintian #156

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
tmpgnh wants to merge 1 commit into
base: master
Choose a base branch
from
+4 −4
Open

Typos found by lintian #156

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/limit.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -151,7 +151,7 @@ struct Inc {
if (THRESHHOLD && DELTA < THRESH) { \
VERBOSE (2, \
"delaying %s with ticklimit %" PRId64 \
" and threshhold %" PRId64, \
" and threshold %" PRId64, \
#NAME, DELTA, THRESH); \
return false; \
} \
Expand Down
4 changes: 2 additions & 2 deletions src/options.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -127,7 +127,7 @@ OPTION( factorunbump, 1, 0, 1,0,1,1, "extension variable with lowest impo
OPTION( fastelim, 1, 0, 1,0,1,1, "fast BVE during preprocessing") \
OPTION( fastelimbound, 8, 1,1e3,1,0,1, "fast BVE bound during preprocessing") \
OPTION( fastelimclslim, 1e2, 2,2e9,2,0,1, "fast BVE resolvent size limit") \
OPTION( fastelimocclim, 100, 1,2e9,2,0,1, "fast BVE occurence limit during preprocessing") \
OPTION( fastelimocclim, 100, 1,2e9,2,0,1, "fast BVE occurrence limit during preprocessing") \
OPTION( fastelimrounds, 4, 1,512,1,0,1, "number of fastelim rounds") \
OPTION( flush, 0, 0, 1,0,1,1, "flush redundant clauses") \
OPTION( flushfactor, 3, 1,1e3,0,0,1, "interval increase") \
Expand Down Expand Up @@ -169,7 +169,7 @@ QUTOPT( quiet, 0, 0, 1,0,0,0, "disable all messages") \
OPTION( radixsortlim, 32, 0,2e9,0,0,1, "radix sort limit") \
OPTION( randec, 0, 0, 1,0,0,1, "random decisions") \
OPTION( randecfocused, 1, 0, 1,0,0,1, "random decisions in focused mode") \
OPTION( randecinit, 1e3, 2,2e9,0,0,1, "inital random decision interval") \
OPTION( randecinit, 1e3, 2,2e9,0,0,1, "initial random decision interval") \
OPTION( randecint, 500, 0,2e9,0,0,1, "random conflict length") \
OPTION( randeclength, 10, 1,1e9,0,0,1, "length random decisions phases") \
OPTION( randecstable, 0, 0, 1,0,0,1, "random decisions in stable mode") \
Expand Down
2 changes: 1 addition & 1 deletion src/probe.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -903,7 +903,7 @@ bool Internal::probe () {
// overhead in setting up the datastructures. This has to be accounted for
// with the 'ticks', however, since inprocessing is done frequently, this
// overhead is too expensive to pay. So instead, we accumulate the budget
// of 'ticks' and delay the technique until it passes a certain threshhold,
// of 'ticks' and delay the technique until it passes a certain threshold,
// which depends on the the cost of initialization. Note that in the case of
// sweeping, we have two different delays, one which resets the budged, and
// one which passes it to the next round. In this case the former takes
Expand Down