From 9cf0d55d78c24ec981aaffb09775faa5d1f07ce7 Mon Sep 17 00:00:00 2001 From: "Adam M. Krajewski" <54290107+amkrajewski@users.noreply.github.com> Date: Fri, 1 Mar 2024 16:33:04 -0500 Subject: [PATCH] (core) improved `mostCommon` printout --- src/nimcso.nim | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/src/nimcso.nim b/src/nimcso.nim index 0c1a511..832c567 100644 --- a/src/nimcso.nim +++ b/src/nimcso.nim @@ -573,6 +573,7 @@ proc leastPreventing*(verbose: bool = true): seq[ElSolution] = ## Runs a search for single-element solutions preventing the least data, i.e. the least common elements *based on the filtered dataset*. Returns a sequence of [ElSolution]s which can ## be used on its own (by setting ``verbose`` to see it or by using ``saveResults``) or as a starting point for an exploration technique. let presenceBitArrays = getPresenceBitArrays() + if verbose: echo "\nRunning search for single-elements preventing the least data." benchmarkOnce "Searching for element removals preventing the least data:", verbose: var solutions = initHeapQueue[ElSolution]() for i in 0..