From c7549a40b0526967359364671183906e7cb89000 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?G=C3=A1bor=20N=C3=A9meth?= Date: Mon, 5 Jan 2026 13:01:33 +0100 Subject: [PATCH] Typos found by lintian MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Gábor Németh --- src/limit.hpp | 2 +- src/options.hpp | 4 ++-- src/probe.cpp | 2 +- 3 files changed, 4 insertions(+), 4 deletions(-) diff --git a/src/limit.hpp b/src/limit.hpp index 57203ec1c..aaaa91d7d 100644 --- a/src/limit.hpp +++ b/src/limit.hpp @@ -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; \ } \ diff --git a/src/options.hpp b/src/options.hpp index cfc60f95c..4a632dbea 100644 --- a/src/options.hpp +++ b/src/options.hpp @@ -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") \ @@ -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") \ diff --git a/src/probe.cpp b/src/probe.cpp index 738b80ab6..363ac0010 100644 --- a/src/probe.cpp +++ b/src/probe.cpp @@ -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