From b2fce95b1453e1840bf469419a609d57a3e7d58c Mon Sep 17 00:00:00 2001
From: Martin Sumner <martin.sumner@adaptip.co.uk>
Date: Wed, 26 Sep 2018 14:11:02 +0100
Subject: [PATCH] Add explainer to NaiveBestRun

---
 src/leveled_iclerk.erl | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/leveled_iclerk.erl b/src/leveled_iclerk.erl
index c1a43ce..11ca1ba 100644
--- a/src/leveled_iclerk.erl
+++ b/src/leveled_iclerk.erl
@@ -502,6 +502,8 @@ fetch_inbatches(PositionList, BatchSize, CDB, CheckedList) ->
 assess_candidates(AllCandidates, Params) ->
     MaxRunLength = min(element(1, Params), length(AllCandidates)),
     NaiveBestRun = lists:sublist(AllCandidates, MaxRunLength),
+        % This will end up being scored twice, but lets take a guess at
+        % the best scoring run to take into the loop
     FoldFun =
         fun(RunLength, Best) ->
             assess_for_runlength(RunLength, AllCandidates, Params, Best)