umgeher/leveled
0
Fork 0
Code Issues Pull requests Releases Activity Actions

Add explainer to NaiveBestRun

Browse source
This commit is contained in:
Martin Sumner 2018-09-26 14:11:02 +01:00
parent 7885f93ba6
commit b2fce95b14
1 changed files with 2 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/leveled_iclerk.erl
View file

@ -502,6 +502,8 @@ fetch_inbatches(PositionList, BatchSize, CDB, CheckedList) ->
assess_candidates(AllCandidates, Params) -> assess_candidates(AllCandidates, Params) ->
MaxRunLength = min(element(1, Params), length(AllCandidates)), MaxRunLength = min(element(1, Params), length(AllCandidates)),
NaiveBestRun = lists:sublist(AllCandidates, MaxRunLength), 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 = FoldFun =
fun(RunLength, Best) -> fun(RunLength, Best) ->
assess_for_runlength(RunLength, AllCandidates, Params, Best) assess_for_runlength(RunLength, AllCandidates, Params, Best)